Home
last modified time | relevance | path

Searched refs:Bucket (Results 1 – 25 of 40) sorted by relevance

12

/freebsd/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/java_api/
H A Dtst.Bean.ksh.out45 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
56 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
68 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
79 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
150 …Bucket[min = -4611686018427387904, max = -2305843009213693953, frequency = 0], org.opensolaris.os.…
151 …Bucket[min = -4611686018427387904, max = -2305843009213693953, frequency = 0], org.opensolaris.os.…
153 …Bucket[min = -4611686018427387904, max = -2305843009213693953, frequency = 0], org.opensolaris.os.…
156 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
157 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
159 …Bucket[min = 1, max = 10, frequency = 0], org.opensolaris.os.dtrace.Distribution$Bucket[min = 11, …
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DFoldingSet.cpp282 void *Probe = *Bucket; in FindNodeOrInsertPos()
296 InsertPos = Bucket; in FindNodeOrInsertPos()
319 void *Next = *Bucket; in InsertNode()
329 *Bucket = N; in InsertNode()
360 Ptr = *Bucket; in RemoveNode()
365 *Bucket = NodeNextPtr; in RemoveNode()
393 (!*Bucket || !GetNextPtr(*Bucket))) in FoldingSetIteratorImpl()
394 ++Bucket; in FoldingSetIteratorImpl()
411 ++Bucket; in advance()
413 (!*Bucket || !GetNextPtr(*Bucket))); in advance()
[all …]
H A DSmallPtrSet.cpp52 if (*Bucket == Ptr) in insert_imp_big()
53 return std::make_pair(Bucket, false); // Already inserted, good. in insert_imp_big()
56 if (*Bucket == getTombstoneMarker()) in insert_imp_big()
60 *Bucket = Ptr; in insert_imp_big()
62 return std::make_pair(Bucket, true); in insert_imp_big()
75 if (LLVM_LIKELY(Array[Bucket] == getEmptyMarker())) in FindBucketFor()
76 return Tombstone ? Tombstone : Array+Bucket; in FindBucketFor()
79 if (LLVM_LIKELY(Array[Bucket] == Ptr)) in FindBucketFor()
80 return Array+Bucket; in FindBucketFor()
84 if (Array[Bucket] == getTombstoneMarker() && !Tombstone) in FindBucketFor()
[all …]
H A DStringMap.cpp196 int Bucket = FindKey(Key); in RemoveKey() local
197 if (Bucket == -1) in RemoveKey()
200 StringMapEntryBase *Result = TheTable[Bucket]; in RemoveKey()
201 TheTable[Bucket] = getTombstoneVal(); in RemoveKey()
233 StringMapEntryBase *Bucket = TheTable[I]; in RehashTable() local
234 if (Bucket && Bucket != getTombstoneVal()) { in RehashTable()
246 NewTableArray[NewBucket] = Bucket; in RehashTable()
H A DBalancedPartitioning.cpp25 make_range(UtilityNodes.begin(), UtilityNodes.end()), Bucket); in dump()
106 return L.Bucket < R.Bucket; in run()
124 N.Bucket = Offset++; in bisect()
143 llvm::partition(Nodes, [&](auto &N) { return N.Bucket == LeftBucket; }); in bisect()
192 if (N.Bucket == LeftBucket) { in runIterations()
234 bool FromLeftToRight = (N.Bucket == LeftBucket); in runIteration()
241 Gains, [&](const auto &GP) { return GP.second->Bucket == LeftBucket; }); in runIteration()
278 bool FromLeftToRight = (N.Bucket == LeftBucket); in moveFunctionNode()
280 N.Bucket = (FromLeftToRight ? RightBucket : LeftBucket); in moveFunctionNode()
311 N.Bucket = StartBucket; in split()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DStringMap.h154 if (!Bucket || Bucket == getTombstoneVal()) { in StringMap()
186 if (Bucket && Bucket != getTombstoneVal()) { in ~StringMap()
220 if (Bucket == -1) in find()
227 if (Bucket == -1) in find()
290 if (Bucket && Bucket != getTombstoneVal()) in insert()
295 Bucket = KeyValue; in insert()
344 if (Bucket && Bucket != getTombstoneVal()) in try_emplace()
350 Bucket = in try_emplace()
368 if (Bucket && Bucket != getTombstoneVal()) { in clear()
371 Bucket = nullptr; in clear()
[all …]
H A DSmallPtrSet.h189 if (*Bucket == Ptr) in find_imp()
190 return Bucket; in find_imp()
229 : Bucket(BP), End(E) { in SmallPtrSetIteratorImpl()
238 return Bucket == RHS.Bucket;
241 return Bucket != RHS.Bucket;
249 assert(Bucket <= End); in AdvanceIfNotValid()
253 ++Bucket; in AdvanceIfNotValid()
260 --Bucket; in RetreatIfNotValid()
291 assert(Bucket < End);
298 --Bucket;
[all …]
H A DConcurrentHashtable.h126 BucketsArray = std::make_unique<Bucket[]>(NumberOfBuckets); in MultiThreadAllocator()
174 Bucket &CurBucket = BucketsArray[getBucketIdx(Hash)]; in insert()
235 uint64_t OverallSize = sizeof(*this) + NumberOfBuckets * sizeof(Bucket); in printStatistic()
241 Bucket &CurBucket = BucketsArray[Idx]; in printStatistic()
276 struct Bucket { struct
277 Bucket() = default;
298 void RehashBucket(Bucket &CurBucket) { in RehashBucket() argument
392 std::unique_ptr<Bucket[]> BucketsArray;
H A DFoldingSet.h697 FoldingSetIteratorImpl(void **Bucket);
712 explicit FoldingSetIterator(void **Bucket) : FoldingSetIteratorImpl(Bucket) {} in FoldingSetIterator() argument
739 explicit FoldingSetBucketIteratorImpl(void **Bucket);
741 FoldingSetBucketIteratorImpl(void **Bucket, bool) : Ptr(Bucket) {} in FoldingSetBucketIteratorImpl() argument
761 explicit FoldingSetBucketIterator(void **Bucket) : in FoldingSetBucketIterator() argument
762 FoldingSetBucketIteratorImpl(Bucket) {} in FoldingSetBucketIterator()
764 FoldingSetBucketIterator(void **Bucket, bool) : in FoldingSetBucketIterator() argument
765 FoldingSetBucketIteratorImpl(Bucket, true) {} in FoldingSetBucketIterator()
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DArrayRecycler.h39 SmallVector<FreeList*, 8> Bucket; variable
44 if (Idx >= Bucket.size()) in pop()
46 FreeList *Entry = Bucket[Idx]; in pop()
50 Bucket[Idx] = Entry->Next; in pop()
59 if (Idx >= Bucket.size()) in push()
60 Bucket.resize(size_t(Idx) + 1); in push()
61 Entry->Next = Bucket[Idx]; in push()
62 Bucket[Idx] = Entry; in push()
105 for (; !Bucket.empty(); Bucket.pop_back()) in clear()
106 while (T *Ptr = pop(Bucket.size() - 1)) in clear()
[all …]
H A DOnDiskHashTable.h78 struct Bucket { struct
84 Bucket *Buckets; argument
88 void insert(Bucket *Buckets, size_t Size, Item *E) { in insert()
89 Bucket &B = Buckets[E->Hash & (Size - 1)]; in insert()
97 Bucket *NewBuckets = static_cast<Bucket *>( in resize()
98 safe_calloc(NewSize, sizeof(Bucket))); in resize()
172 Bucket &B = Buckets[I]; in Emit()
229 Buckets = static_cast<Bucket *>(safe_calloc(NumBuckets, sizeof(Bucket))); in OnDiskChainedHashTableGenerator()
360 const unsigned char *Bucket = Buckets + sizeof(offset_type) * Idx; variable
364 Bucket);
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp195 struct Bucket { struct
277 rewriteLoadStoresForCommoningChains(Loop *L, Bucket &Bucket,
537 for (auto &Bucket : Buckets) { in chainCommoning() local
549 Loop *L, Bucket &Bucket, SmallSet<BasicBlock *, 16> &BBChanged) { in rewriteLoadStoresForCommoningChains() argument
552 assert(Bucket.Elements.size() == in rewriteLoadStoresForCommoningChains()
553 Bucket.ChainBases.size() * Bucket.ChainSize && in rewriteLoadStoresForCommoningChains()
568 : Bucket.BaseSCEV; in rewriteLoadStoresForCommoningChains()
865 SmallVector<Bucket, 16> Buckets; in collectCandidates()
1097 for (auto &Bucket : Buckets) in updateFormPrep() local
1118 for (auto &Bucket : Buckets) { in dispFormPrep() local
[all …]
/freebsd/contrib/llvm-project/clang/lib/AST/
H A DRandstruct.cpp40 class Bucket { class
45 virtual ~Bucket() = default;
56 void Bucket::addField(FieldDecl *Field, int FieldSize) { in addField()
61 struct BitfieldRunBucket : public Bucket {
70 SmallVector<std::unique_ptr<Bucket>, 16> Buckets; in randomizeStructureLayoutImpl()
73 std::unique_ptr<Bucket> CurrentBucket; in randomizeStructureLayoutImpl()
115 CurrentBucket = std::make_unique<Bucket>(); in randomizeStructureLayoutImpl()
119 std::unique_ptr<Bucket> OverSized = std::make_unique<Bucket>(); in randomizeStructureLayoutImpl()
159 for (const std::unique_ptr<Bucket> &B : Buckets) { in randomizeStructureLayoutImpl()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/AsmPrinter/
H A DAccelTable.cpp77 Buckets[Bucket].push_back(&E.second); in finalize()
83 for (auto &Bucket : Buckets) in finalize() local
258 for (const auto &Hash : Bucket) { in emitHashes()
339 for (const auto &Hash : Bucket) { in emitData()
356 if (!Bucket.empty()) in emitData()
472 for (auto *Hash : Bucket) { in populateAbbrevsMap()
522 Index += Bucket.value().size(); in emitBuckets()
625 for (auto *Hash : Bucket) { in emitData()
653 for (auto *Hash : Bucket) in Dwarf5AccelTableWriter()
842 for (const auto &Bucket : Buckets) in print() local
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Lex/
H A DHeaderMap.h48 for (unsigned Bucket = 0; Bucket < NumBuckets; ++Bucket) { in forEachKey() local
49 HMapBucket B = getBucket(Bucket); in forEachKey()
/freebsd/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/java_api/src/
H A DTestBean.java206 List < Distribution.Bucket > buckets = in getLogDistribution()
207 new ArrayList < Distribution.Bucket > (); in getLogDistribution()
208 Distribution.Bucket bucket; in getLogDistribution()
220 bucket = new Distribution.Bucket(-1, -1, n++); in getLogDistribution()
222 bucket = new Distribution.Bucket(0, 0, n++); in getLogDistribution()
224 bucket = new Distribution.Bucket(1, 1, n++); in getLogDistribution()
248 List < Distribution.Bucket > buckets = in getLinearDistribution()
249 new ArrayList < Distribution.Bucket > (); in getLinearDistribution()
250 Distribution.Bucket bucket; in getLinearDistribution()
254 bucket = new Distribution.Bucket(Long.MIN_VALUE, (base - 1), 0); in getLinearDistribution()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/
H A DDWARFAcceleratorTable.cpp241 for (unsigned Bucket = 0; Bucket < Hdr.BucketCount; ++Bucket) { in dump() local
255 if (Hash % Hdr.BucketCount != Bucket) in dump()
737 assert(Bucket < Hdr.BucketCount); in getBucketArrayEntry()
738 uint64_t BucketOffset = BucketsBase + 4 * Bucket; in getBucketArrayEntry()
818 uint32_t Index = getBucketArrayEntry(Bucket); in dumpBucket()
830 if (Hash % Hdr.BucketCount != Bucket) in dumpBucket()
846 for (uint32_t Bucket = 0; Bucket < Hdr.BucketCount; ++Bucket) in dump() local
847 dumpBucket(W, Bucket); in dump()
895 uint32_t Bucket = *Hash % Hdr.BucketCount; in findEntryOffsetInCurrentIndex() local
896 uint32_t Index = CurrentIndex->getBucketArrayEntry(Bucket); in findEntryOffsetInCurrentIndex()
[all …]
H A DDWARFVerifier.cpp1148 uint32_t Bucket; in verifyNameIndexBuckets() member
1151 constexpr BucketInfo(uint32_t Bucket, uint32_t Index) in verifyNameIndexBuckets()
1152 : Bucket(Bucket), Index(Index) {} in verifyNameIndexBuckets()
1167 for (uint32_t Bucket = 0, End = NI.getBucketCount(); Bucket < End; ++Bucket) { in verifyNameIndexBuckets() local
1168 uint32_t Index = NI.getBucketArrayEntry(Bucket); in verifyNameIndexBuckets()
1172 Bucket, NI.getUnitOffset(), Index, NI.getNameCount()); in verifyNameIndexBuckets()
1177 BucketStarts.emplace_back(Bucket, Index); in verifyNameIndexBuckets()
1213 if (B.Bucket == NI.getBucketCount()) in verifyNameIndexBuckets()
1222 if (FirstHash % NI.getBucketCount() != B.Bucket) { in verifyNameIndexBuckets()
1226 NI.getUnitOffset(), B.Bucket, FirstHash, in verifyNameIndexBuckets()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_addrhashmap.h63 struct Bucket { struct
88 Bucket *bucket_; argument
105 Bucket *table_;
115 Bucket *bucket = &table_[n]; in ForEach()
200 table_ = (Bucket*)MmapOrDie(kSize * sizeof(table_[0]), "AddrHashMap"); in AddrHashMap()
208 Bucket *b = &table_[hash]; in acquire()
338 Bucket *b = h->bucket_; in release()
/freebsd/contrib/llvm-project/compiler-rt/lib/ubsan/
H A Dubsan_type_hash_itanium.cpp228 HashValue *Bucket = getTypeCacheHashTableBucket(Hash); in checkDynamicType() local
229 if (*Bucket == Hash) { in checkDynamicType()
255 *Bucket = Hash; in checkDynamicType()
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Readers/
H A DLVBinaryReader.cpp820 for (LVBucket &Bucket : Buckets) { in processLines()
821 dbgs() << "Begin: " << format_decimal(std::get<0>(Bucket), 5) << ", " in processLines()
822 << "End: " << format_decimal(std::get<1>(Bucket), 5) << ", " in processLines()
823 << "Address: " << hexValue(std::get<2>(Bucket)) << "\n"; in processLines()
842 for (LVBucket &Bucket : Buckets) { in processLines()
843 if (std::get<3>(Bucket)) in processLines()
846 if (Size == std::get<2>(Bucket)) { in processLines()
849 LVLines::iterator IterStart = DebugLines->begin() + std::get<0>(Bucket); in processLines()
851 DebugLines->begin() + std::get<1>(Bucket) + 1; in processLines()
855 std::get<3>(Bucket) = true; in processLines()
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/PDB/Native/
H A DTpiStream.cpp164 uint32_t Bucket = hashStringV1(Name) % Header->NumHashBuckets; in findRecordsByName() local
165 if (Bucket > HashMap.size()) in findRecordsByName()
169 for (TypeIndex TI : HashMap[Bucket]) { in findRecordsByName()
/freebsd/contrib/llvm-project/clang/lib/Lex/
H A DHeaderMap.cpp206 for (unsigned Bucket = HashHMapKey(Filename);; ++Bucket) { in lookupFilename() local
207 HMapBucket B = getBucket(Bucket & (NumBuckets-1)); in lookupFilename()
/freebsd/contrib/llvm-project/clang/lib/AST/Interp/
H A DDescriptor.cpp336 unsigned Bucket = I / PER_FIELD; in initializeElement() local
338 if (!(data()[Bucket] & Mask)) { in initializeElement()
339 data()[Bucket] |= Mask; in initializeElement()
346 unsigned Bucket = I / PER_FIELD; in isElementInitialized() local
347 return data()[Bucket] & (T(1) << (I % PER_FIELD)); in isElementInitialized()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DRDFLiveness.cpp225 for (auto &Bucket : Blocks) { in getAllReachingDefs() local
226 TmpBB.push_back(Bucket.first); in getAllReachingDefs()
227 if (Bucket.second.size() > 2) in getAllReachingDefs()
228 GetOrder(*Bucket.first); in getAllReachingDefs()
229 llvm::sort(Bucket.second, Precedes); in getAllReachingDefs()
238 auto &Bucket = Blocks[MBB]; in getAllReachingDefs() local
239 TmpInst.insert(TmpInst.end(), Bucket.rbegin(), Bucket.rend()); in getAllReachingDefs()

12