Searched refs:HashTable (Results 1 – 5 of 5) sorted by relevance
66 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1); in LookupBucketFor() local77 HashTable[FirstTombstone] = FullHashValue; in LookupBucketFor()81 HashTable[BucketNo] = FullHashValue; in LookupBucketFor()88 } else if (LLVM_LIKELY(HashTable[BucketNo] == FullHashValue)) { in LookupBucketFor()121 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1); in FindKey() local132 } else if (LLVM_LIKELY(HashTable[BucketNo] == FullHashValue)) { in FindKey()186 unsigned *HashTable = (unsigned *)(TheTable + NumBuckets + 1); in RehashTable() local214 unsigned FullHash = HashTable[I]; in RehashTable()
423 HashTableTy HashTable; variable444 return HashTable.getAllocator(); in getAllocator()450 auto &Entry = *HashTable.insert(std::make_pair(Name, nullptr)).first; in get()487 auto &Entry = *HashTable.insert(std::make_pair(Name, nullptr)).first; in getOwn()511 iterator begin() const { return HashTable.begin(); } in begin()512 iterator end() const { return HashTable.end(); } in end()513 unsigned size() const { return HashTable.size(); } in size()
77 : HashTable(8192), // Start with space for 8K identifiers. in IdentifierTable()295 unsigned NumBuckets = HashTable.getNumBuckets(); in PrintStats()296 unsigned NumIdentifiers = HashTable.getNumItems(); in PrintStats()303 I = HashTable.begin(), E = HashTable.end(); I != E; ++I) { in PrintStats()320 HashTable.getAllocator().PrintStats(); in PrintStats()
156 typedef DenseMap<BlockNode::IndexType, Weight> HashTable; in combineWeightsByHashing() typedef157 HashTable Combined(NextPowerOf2(2 * Weights.size())); in combineWeightsByHashing()
590 llvm::Type *HashTable = llvm::ArrayType::get(IntPtrTy, CacheSize); in EmitTypeCheck() local591 llvm::Value *Cache = CGM.CreateRuntimeVariable(HashTable, in EmitTypeCheck()