Home
last modified time | relevance | path

Searched refs:Buckets (Results 1 – 17 of 17) sorted by relevance

/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Support/
H A DOnDiskHashTable.h85 Bucket *Buckets; variable
89 void insert(Bucket *Buckets, size_t Size, Item *E) { in insert() argument
90 Bucket &B = Buckets[E->Hash & (Size - 1)]; in insert()
102 for (Item *E = Buckets[I].Head; E;) { in resize()
109 free(Buckets); in resize()
111 Buckets = NewBuckets; in resize()
130 insert(Buckets, NumBuckets, new (BA.Allocate()) Item(Key, Data, InfoObj)); in insert()
136 for (Item *I = Buckets[Hash & (NumBuckets - 1)].Head; I; I = I->Next) in contains()
173 Bucket &B = Buckets[I]; in Emit()
220 LE.write<offset_type>(Buckets[I].Off); in Emit()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Support/
H A DFoldingSet.cpp213 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) { in GetBucketFor() argument
216 return Buckets + BucketNum; in GetBucketFor()
221 void **Buckets = static_cast<void**>(safe_calloc(NumBuckets + 1, in AllocateBuckets() local
224 Buckets[NumBuckets] = reinterpret_cast<void*>(-1); in AllocateBuckets()
225 return Buckets; in AllocateBuckets()
235 Buckets = AllocateBuckets(NumBuckets); in FoldingSetBase()
240 : Buckets(Arg.Buckets), NumBuckets(Arg.NumBuckets), NumNodes(Arg.NumNodes) { in FoldingSetBase()
241 Arg.Buckets = nullptr; in FoldingSetBase()
247 free(Buckets); // This may be null if the set is in a moved-from state. in operator =()
248 Buckets = RHS.Buckets; in operator =()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/Native/
H A DHashTable.h74 return Map->Buckets[Index];
83 while (Index < Map->Buckets.size()) {
115 HashTable() { Buckets.resize(8); } in HashTable()
117 Buckets.resize(Capacity); in HashTable()
131 Buckets.resize(H->Capacity); in load()
146 if (auto EC = Stream.readInteger(Buckets[P].first)) in load()
151 Buckets[P].second = *Value; in load()
207 Buckets.resize(8); in clear()
213 uint32_t capacity() const { return Buckets.size(); } in capacity()
228 if (Traits.storageKeyToLookupKey(Buckets[I].first) == K) in find_as()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp202 SmallVector<Bucket, 16> &Buckets,
206 bool updateFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets);
210 bool dispFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets,
310 SmallVector<Bucket, 16> &Buckets, in addOneCandidate() argument
316 for (auto &B : Buckets) { in addOneCandidate()
326 if (Buckets.size() == MaxCandidateNum) in addOneCandidate()
328 Buckets.push_back(Bucket(LSCEV, MemI)); in addOneCandidate()
336 SmallVector<Bucket, 16> Buckets; in collectCandidates() local
372 addOneCandidate(MemI, LSCEV, Buckets, MaxCandidateNum); in collectCandidates()
374 return Buckets; in collectCandidates()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
H A DDenseMap.h722 BucketT *Buckets; variable
755 deallocate_buffer(Buckets, sizeof(BucketT) * NumBuckets, alignof(BucketT)); in ~DenseMap()
761 std::swap(Buckets, RHS.Buckets); in swap()
775 deallocate_buffer(Buckets, sizeof(BucketT) * NumBuckets, alignof(BucketT));
783 deallocate_buffer(Buckets, sizeof(BucketT) * NumBuckets, alignof(BucketT)); in copyFrom()
804 BucketT *OldBuckets = Buckets; in grow()
807 assert(Buckets); in grow()
834 deallocate_buffer(Buckets, sizeof(BucketT) * OldNumBuckets, in shrink_and_clear()
857 return Buckets; in getBuckets()
867 Buckets = nullptr; in allocateBuckets()
[all …]
H A DFoldingSet.h115 void **Buckets;
420 iterator begin() { return iterator(Buckets); } in begin()
421 iterator end() { return iterator(Buckets+NumBuckets); } in end()
425 const_iterator begin() const { return const_iterator(Buckets); } in begin()
426 const_iterator end() const { return const_iterator(Buckets+NumBuckets); } in end()
431 return bucket_iterator(Buckets + (hash & (NumBuckets-1))); in bucket_begin()
435 return bucket_iterator(Buckets + (hash & (NumBuckets-1)), true); in bucket_end()
/netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/AsmPrinter/
H A DAccelTable.cpp74 Buckets.resize(BucketCount); in finalize()
77 Buckets[Bucket].push_back(&E.second); in finalize()
83 for (auto &Bucket : Buckets) in finalize()
263 const auto &Buckets = Contents.getBuckets(); in emitOffsets() local
265 for (size_t i = 0, e = Buckets.size(); i < e; ++i) { in emitOffsets()
266 for (auto *Hash : Buckets[i]) { in emitOffsets()
307 const auto &Buckets = Contents.getBuckets(); in emitBuckets() local
309 for (size_t i = 0, e = Buckets.size(); i < e; ++i) { in emitBuckets()
311 if (!Buckets[i].empty()) in emitBuckets()
318 for (auto *HD : Buckets[i]) { in emitBuckets()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/Native/
H A DPDBStringTableBuilder.cpp178 std::vector<ulittle32_t> Buckets(BucketCount); in writeHashTable() local
187 if (Buckets[Slot] != 0) in writeHashTable()
189 Buckets[Slot] = Offset; in writeHashTable()
194 if (auto EC = Writer.writeArray(ArrayRef<ulittle32_t>(Buckets))) in writeHashTable()
/netbsd-src/external/apache2/llvm/dist/clang/lib/Serialization/
H A DMultiOnDiskHashTable.h67 storage_type Buckets, storage_type Payload, storage_type Base, in OnDiskTable()
70 Table(NumBuckets, NumEntries, Buckets, Payload, Base, InfoObj) {} in OnDiskTable()
216 storage_type Buckets = Data + BucketOffset; variable
218 OnDiskTable::HashTable::readNumBucketsAndEntries(Buckets);
223 Buckets, Ptr, Data, std::move(InfoObj));
/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-dwp/
H A Dllvm-dwp.cpp449 std::vector<unsigned> Buckets(NextPowerOf2(3 * IndexEntries.size() / 2)); in writeIndex() local
450 uint64_t Mask = Buckets.size() - 1; in writeIndex()
456 while (Buckets[H]) { in writeIndex()
457 assert(S != IndexEntries.begin()[Buckets[H] - 1].first && in writeIndex()
461 Buckets[H] = i + 1; in writeIndex()
469 Out.emitIntValue(Buckets.size(), 4); // Num Buckets in writeIndex()
472 for (const auto &I : Buckets) in writeIndex()
476 for (const auto &I : Buckets) in writeIndex()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
H A DAccelTable.h170 BucketList Buckets; variable
178 ArrayRef<HashList> getBuckets() const { return Buckets; } in getBuckets()
209 assert(Buckets.empty() && "Already finalized!"); in addName()
/netbsd-src/external/apache2/llvm/dist/clang/lib/Tooling/Transformer/
H A DRewriteRule.cpp383 Buckets; in buildMatchers() local
388 Buckets[Cases[I].Matcher.getSupportedKind()].emplace_back(I, Cases[I]); in buildMatchers()
397 for (const auto &Bucket : Buckets) { in buildMatchers()
/netbsd-src/external/apache2/llvm/dist/llvm/tools/llvm-readobj/
H A DELFDumper.cpp2485 ArrayRef<typename ELFT::Word> Buckets = GnuHashTable->buckets(); in getGnuHashTableChains() local
2486 if (!llvm::all_of(Buckets, [](typename ELFT::Word V) { return V == 0; })) in getGnuHashTableChains()
2519 ArrayRef<Elf_Word> Buckets = GnuHashTable->buckets(); in printGnuHashTable() local
2520 W.printList("Buckets", Buckets); in printGnuHashTable()
3835 auto Buckets = SysVHash.buckets(); in printHashTableSymbols() local
3838 if (Buckets[Buc] == ELF::STN_UNDEF) in printHashTableSymbols()
3841 for (uint32_t Ch = Buckets[Buc]; Ch < SysVHash.nchain; Ch = Chains[Ch]) { in printHashTableSymbols()
3899 ArrayRef<Elf_Word> Buckets = GnuHash.buckets(); in printGnuHashTableSymbols() local
3901 if (Buckets[Buc] == ELF::STN_UNDEF) in printGnuHashTableSymbols()
3903 uint32_t Index = Buckets[Buc]; in printGnuHashTableSymbols()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/lib/ProfileData/
H A DInstrProfReader.cpp615 const unsigned char *Buckets, const unsigned char *const Payload, in InstrProfReaderIndex() argument
620 Buckets, Payload, Base, in InstrProfReaderIndex()
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/ProfileData/
H A DInstrProfReader.h403 InstrProfReaderIndex(const unsigned char *Buckets,
/netbsd-src/external/gpl3/binutils/dist/binutils/po/
H A Dfi.po7285 msgstr "Buckets-lukumäärän lukeminen epäonnistui\n"
/netbsd-src/external/gpl3/binutils.old/dist/binutils/po/
H A Dfi.po7285 msgstr "Buckets-lukumäärän lukeminen epäonnistui\n"