| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | OnDiskHashTable.h | 84 Bucket *Buckets; variable
88 void insert(Bucket *Buckets, size_t Size, Item *E) { in insert() argument
89 Bucket &B = Buckets[E->Hash & (Size - 1)]; in insert()
101 for (Item *E = Buckets[I].Head; E;) { in resize()
108 free(Buckets); in resize()
110 Buckets = NewBuckets; in resize()
129 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj)); in insert()
135 for (Item *I = Buckets[Hash & (NumBuckets - 1)].Head; I; I = I->Next) in contains()
172 Bucket &B = Buckets[I]; in Emit()
219 LE.write<offset_type>(Buckets[I].Off); in Emit()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | FoldingSet.cpp | 165 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { in GetBucketFor() argument
168 return Buckets + BucketNum; in GetBucketFor()
173 void **Buckets = static_cast<void**>(safe_calloc(NumBuckets + 1, in AllocateBuckets() local
176 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in AllocateBuckets()
177 return Buckets; in AllocateBuckets()
187 Buckets = AllocateBuckets(NumBuckets); in FoldingSetBase()
192 : Buckets(Arg.Buckets), NumBuckets(Arg.NumBuckets), NumNodes(Arg.NumNodes) { in FoldingSetBase()
193 Arg.Buckets = nullptr; in FoldingSetBase()
199 free(Buckets); // This may be null if the set is in a moved-from state. in operator =()
200 Buckets = RHS.Buckets; in operator =()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/PDB/Native/ |
| H A D | HashTable.h | 72 return Map->Buckets[Index];
79 while (Index < Map->Buckets.size()) {
111 HashTable() { Buckets.resize(8); } in HashTable()
113 Buckets.resize(Capacity); in HashTable()
127 Buckets.resize(H->Capacity); in load()
142 if (auto EC = Stream.readInteger(Buckets[P].first)) in load()
147 Buckets[P].second = *Value; in load()
203 Buckets.resize(8); in clear()
209 uint32_t capacity() const { return Buckets.size(); } in capacity()
224 if (Traits.storageKeyToLookupKey(Buckets[I].first) == K) in find_as()
[all …]
|
| /freebsd/contrib/llvm-project/clang/lib/AST/ |
| H A D | Randstruct.cpp | 70 SmallVector<std::unique_ptr<Bucket>, 16> Buckets; in randomizeStructureLayoutImpl() local
89 Buckets.push_back(std::move(CurrentBucket)); in randomizeStructureLayoutImpl()
111 Buckets.push_back(std::move(CurrentBitfieldRun)); in randomizeStructureLayoutImpl()
122 Buckets.push_back(std::move(OverSized)); in randomizeStructureLayoutImpl()
134 Buckets.push_back(std::move(CurrentBucket)); in randomizeStructureLayoutImpl()
149 Buckets.push_back(std::move(CurrentBucket)); in randomizeStructureLayoutImpl()
153 Buckets.push_back(std::move(CurrentBitfieldRun)); in randomizeStructureLayoutImpl()
155 std::shuffle(std::begin(Buckets), std::end(Buckets), RNG); in randomizeStructureLayoutImpl()
159 for (const std::unique_ptr<Bucket> &B : Buckets) { in randomizeStructureLayoutImpl()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
| H A D | PPCLoopInstrFormPrep.cpp | 270 bool chainCommoning(Loop *L, SmallVector<Bucket, 16> &Buckets);
292 SmallVector<Bucket, 16> &Buckets,
297 bool updateFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets);
301 bool dispFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets, PrepForm Form);
529 SmallVector<Bucket, 16> &Buckets) { in chainCommoning() argument
532 if (Buckets.empty()) in chainCommoning()
537 for (auto &Bucket : Buckets) { in chainCommoning()
836 Instruction *MemI, const SCEV *LSCEV, SmallVector<Bucket, 16> &Buckets, in addOneCandidate() argument
843 for (auto &B : Buckets) { in addOneCandidate()
856 if (Buckets.size() == MaxCandidateNum) { in addOneCandidate()
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | DenseMap.h | 765 BucketT *Buckets; variable
798 deallocate_buffer(Buckets, sizeof(BucketT) * NumBuckets, alignof(BucketT)); in ~DenseMap()
804 std::swap(Buckets, RHS.Buckets); in swap()
818 deallocate_buffer(Buckets, sizeof(BucketT) * NumBuckets, alignof(BucketT));
826 deallocate_buffer(Buckets, sizeof(BucketT) * NumBuckets, alignof(BucketT)); in copyFrom()
847 BucketT *OldBuckets = Buckets; in grow()
850 assert(Buckets); in grow()
877 deallocate_buffer(Buckets, sizeof(BucketT) * OldNumBuckets, in shrink_and_clear()
900 return Buckets; in getBuckets()
910 Buckets = nullptr; in allocateBuckets()
[all …]
|
| H A D | FoldingSet.h | 120 void **Buckets;
463 iterator begin() { return iterator(Buckets); } in begin()
464 iterator end() { return iterator(Buckets+NumBuckets); } in end()
468 const_iterator begin() const { return const_iterator(Buckets); } in begin()
469 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } in end()
474 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); in bucket_begin()
478 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); in bucket_end()
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_dense_map.h | 576 BucketT *Buckets = nullptr; variable
599 deallocate_buffer(Buckets, sizeof(BucketT) * NumBuckets); in ~DenseMap()
603 Swap(Buckets, RHS.Buckets); in swap()
617 deallocate_buffer(Buckets, sizeof(BucketT) * NumBuckets, alignof(BucketT));
625 deallocate_buffer(Buckets, sizeof(BucketT) * NumBuckets); in copyFrom()
646 BucketT *OldBuckets = Buckets; in grow()
649 CHECK(Buckets); in grow()
670 BucketT *getBuckets() const { return Buckets; } in getBuckets()
677 Buckets = nullptr; in allocateBuckets()
690 Buckets = static_cast<BucketT *>(allocate_buffer(Size)); in allocateBuckets()
|
| /freebsd/contrib/llvm-project/llvm/lib/DebugInfo/PDB/Native/ |
| H A D | PDBStringTableBuilder.cpp | 60 // This is a precomputed list of Buckets given the specified number of in computeBucketCount()
180 std::vector<ulittle32_t> Buckets(BucketCount); in writeHashTable()
189 if (Buckets[Slot] != 0) in writeHashTable()
191 Buckets[Slot] = Offset; in writeHashTable()
196 if (auto EC = Writer.writeArray(ArrayRef<ulittle32_t>(Buckets))) in writeHashTable()
179 std::vector<ulittle32_t> Buckets(BucketCount); writeHashTable() local
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/ |
| H A D | AccelTable.cpp | 62 Buckets.resize(BucketCount); in finalize()
65 Buckets[Bucket].push_back(&E.second); in finalize()
71 for (auto &Bucket : Buckets) in finalize()
267 const auto &Buckets = Contents.getBuckets(); in emitOffsets() local
269 for (size_t i = 0, e = Buckets.size(); i < e; ++i) { in emitOffsets()
270 for (auto *Hash : Buckets[i]) { in emitOffsets()
311 const auto &Buckets = Contents.getBuckets(); in emitBuckets() local
313 for (size_t i = 0, e = Buckets.size(); i < e; ++i) { in emitBuckets()
315 if (!Buckets[i].empty()) in emitBuckets()
322 for (auto *HD : Buckets[i]) { in emitBuckets()
[all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Serialization/ |
| H A D | MultiOnDiskHashTable.h | 67 storage_type Buckets, storage_type Payload, storage_type Base, in OnDiskTable()
70 Table(NumBuckets, NumEntries, Buckets, Payload, Base, InfoObj) {} in OnDiskTable()
218 storage_type Buckets = Data + BucketOffset; variable
220 OnDiskTable::HashTable::readNumBucketsAndEntries(Buckets);
225 Buckets, Ptr, Data, std::move(InfoObj));
|
| /freebsd/contrib/llvm-project/llvm/lib/DWP/ |
| H A D | DWP.cpp | 505 std::vector<unsigned> Buckets(NextPowerOf2(3 * IndexEntries.size() / 2)); in writeIndex() local
506 uint64_t Mask = Buckets.size() - 1; in writeIndex()
512 while (Buckets[H]) { in writeIndex()
513 assert(S != IndexEntries.begin()[Buckets[H] - 1].first && in writeIndex()
517 Buckets[H] = I + 1; in writeIndex()
525 Out.emitIntValue(Buckets.size(), 4); // Num Buckets in writeIndex()
528 for (const auto &I : Buckets) in writeIndex()
532 for (const auto &I : Buckets) in writeIndex()
|
| /freebsd/contrib/tcsh/nls/german/ |
| H A D | set13 | 4 2 %d Hash-Buckets mit jeweils %d Bits\n
|
| /freebsd/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Readers/ |
| H A D | LVBinaryReader.cpp | 826 std::vector<LVBucket> Buckets; in processLines() local
836 Buckets.emplace_back(Begin, End, Address, false); in processLines()
844 Buckets.emplace_back(Begin, End, Address, false); in processLines()
848 dbgs() << "\nDebug Lines buckets: " << Buckets.size() << "\n"; in processLines()
849 for (LVBucket &Bucket : Buckets) { in processLines()
871 for (LVBucket &Bucket : Buckets) { in processLines()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | AccelTable.h | 175 BucketList Buckets; variable
183 ArrayRef<HashList> getBuckets() const { return Buckets; } in getBuckets()
217 assert(Buckets.empty() && "Already finalized!"); in addName()
|
| /freebsd/contrib/llvm-project/clang/lib/Tooling/Transformer/ |
| H A D | RewriteRule.cpp | 417 Buckets; in buildMatchers() local
422 Buckets[Cases[I].Matcher.getSupportedKind()].emplace_back(I, Cases[I]); in buildMatchers()
431 for (const auto &Bucket : Buckets) { in buildMatchers()
|
| /freebsd/contrib/llvm-project/llvm/tools/llvm-readobj/ |
| H A D | ELFDumper.cpp | 2684 ArrayRef<typename ELFT::Word> Buckets = GnuHashTable->buckets(); in getGnuHashTableChains() local
2685 if (!llvm::all_of(Buckets, [](typename ELFT::Word V) { return V == 0; })) in getGnuHashTableChains()
2718 ArrayRef<Elf_Word> Buckets = GnuHashTable->buckets(); in printGnuHashTable() local
2719 W.printList("Buckets", Buckets); in printGnuHashTable()
2755 ArrayRef<Elf_Word> Buckets = HashTable.buckets(); in printHashHistogram() local
2769 for (size_t C = Buckets[B]; C < NChain; C = Chains[C]) { in printHashHistogram()
2817 ArrayRef<Elf_Word> Buckets = GnuHashTable.buckets(); in printGnuHashHistogram() local
2820 if (!Buckets[B]) in printGnuHashHistogram()
2823 for (size_t C = Buckets[B] - Symndx; in printGnuHashHistogram()
4391 auto Buckets = SysVHash.buckets(); in printHashTableSymbols() local
[all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ProfileData/ |
| H A D | InstrProfReader.h | 579 InstrProfReaderIndex(const unsigned char *Buckets,
|
| /freebsd/contrib/llvm-project/llvm/lib/ProfileData/ |
| H A D | InstrProfReader.cpp | 1002 const unsigned char *Buckets, const unsigned char *const Payload, in InstrProfReaderIndex() argument
1007 Buckets, Payload, Base, in InstrProfReaderIndex()
|