Searched refs:HashMap (Results 1 – 6 of 6) sorted by relevance
145 if (!HashMap.empty()) in buildHashMap()150 HashMap.resize(Header->NumHashBuckets); in buildHashMap()156 HashMap[HV].push_back(TIB++); in buildHashMap()165 if (Bucket > HashMap.size()) in findRecordsByName()169 for (TypeIndex TI : HashMap[Bucket]) { in findRecordsByName()177 bool TpiStream::supportsTypeLookup() const { return !HashMap.empty(); } in supportsTypeLookup()194 for (TypeIndex TI : HashMap[BucketIdx]) { in findFullDeclForForwardRef()
91 std::vector<std::vector<codeview::TypeIndex>> HashMap; variable
95 Map <String, Long> firstValues = new HashMap <String, Long> (); in testCleared()
299 new HashMap < Tuple, String > (); in getPrintaRecord()
2018 MapVector<unsigned, std::pair<unsigned, unsigned>> HashMap; in getBestLaneToStartReordering() local 2031 HashMap.clear(); in getBestLaneToStartReordering() 2032 HashMap[NumFreeOpsHash.Hash] = std::make_pair(1, Lane); in getBestLaneToStartReordering() 2038 HashMap[NumFreeOpsHash.Hash] = std::make_pair(1, Lane); in getBestLaneToStartReordering() 2041 auto *It = HashMap.find(NumFreeOpsHash.Hash); in getBestLaneToStartReordering() 2042 if (It == HashMap.end()) in getBestLaneToStartReordering() 2043 HashMap[NumFreeOpsHash.Hash] = std::make_pair(1, Lane); in getBestLaneToStartReordering() 2051 for (const auto &Data : reverse(HashMap)) { in getBestLaneToStartReordering()
5950 // the HashMap (keyed by x_private). When we later need to xdr_destroy,