Home
last modified time | relevance | path

Searched refs:Bucket (Results 1 – 25 of 37) 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.…
154 …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, …
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DFoldingSet.cpp281 void **Bucket = GetBucketFor(IDHash, Buckets, NumBuckets); in FindNodeOrInsertPos() local
282 void *Probe = *Bucket; in FindNodeOrInsertPos()
296 InsertPos = Bucket; in FindNodeOrInsertPos()
317 void **Bucket = static_cast<void**>(InsertPos); in InsertNode() local
319 void *Next = *Bucket; in InsertNode()
325 Next = reinterpret_cast<void*>(reinterpret_cast<intptr_t>(Bucket)|1); in InsertNode()
329 *Bucket = N; in InsertNode()
359 void **Bucket = GetBucketPtr(Ptr); in RemoveNode() local
360 Ptr = *Bucket; in RemoveNode()
365 *Bucket = NodeNextPtr; in RemoveNode()
[all …]
H A DSmallPtrSet.cpp51 const void **Bucket = const_cast<const void**>(FindBucketFor(Ptr)); in insert_imp_big() local
52 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()
66 unsigned Bucket = DenseMapInfo<void *>::getHashValue(Ptr) & (CurArraySize-1); in FindBucketFor() local
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()
[all …]
H A DStringMap.cpp203 int Bucket = FindKey(Key); in RemoveKey() local
204 if (Bucket == -1) in RemoveKey()
207 StringMapEntryBase *Result = TheTable[Bucket]; in RemoveKey()
208 TheTable[Bucket] = getTombstoneVal(); in RemoveKey()
240 StringMapEntryBase *Bucket = TheTable[I]; in RehashTable() local
241 if (Bucket && Bucket != getTombstoneVal()) { in RehashTable()
253 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.h169 StringMapEntryBase *Bucket = RHS.TheTable[I]; in StringMap() local
170 if (!Bucket || Bucket == getTombstoneVal()) { in StringMap()
171 TheTable[I] = Bucket; in StringMap()
176 static_cast<MapEntryTy *>(Bucket)->getKey(), getAllocator(), in StringMap()
177 static_cast<MapEntryTy *>(Bucket)->getValue()); in StringMap()
201 StringMapEntryBase *Bucket = TheTable[I]; in ~StringMap() local
202 if (Bucket && Bucket != getTombstoneVal()) { in ~StringMap()
203 static_cast<MapEntryTy *>(Bucket)->Destroy(getAllocator()); in ~StringMap()
236 int Bucket = FindKey(Key, FullHashValue); in find() local
237 if (Bucket == -1) in find()
[all …]
H A DSmallPtrSet.h165 auto *Bucket = FindBucketFor(Ptr); in erase_imp() local
166 if (*Bucket != Ptr) in erase_imp()
169 *const_cast<const void **>(Bucket) = getTombstoneMarker(); in erase_imp()
191 auto *Bucket = FindBucketFor(Ptr); in find_imp() local
192 if (*Bucket == Ptr) in find_imp()
193 return Bucket; in find_imp()
227 const void *const *Bucket;
232 : Bucket(BP), End(E) { in SmallPtrSetIteratorImpl()
241 return Bucket == RHS.Bucket;
244 return Bucket != RHS.Bucket;
[all …]
H A DConcurrentHashtable.h43 /// [ StartEntryIndex ][ Bucket Index ]
62 /// [Bucket 0].Hashes -> [uint32_t][uint32_t]
63 /// [Bucket 0].Entries -> [KeyDataTy*][KeyDataTy*]
65 /// [Bucket 1].Hashes -> [uint32_t][uint32_t][uint32_t][uint32_t]
66 /// [Bucket 1].Entries -> [KeyDataTy*][KeyDataTy*][KeyDataTy*][KeyDataTy*]
68 /// [Bucket N].Hashes -> [uint32_t][uint32_t][uint32_t]
69 /// [Bucket N].Entries -> [KeyDataTy*][KeyDataTy*][KeyDataTy*]
126 BucketsArray = std::make_unique<Bucket[]>(NumberOfBuckets); in MultiThreadAllocator()
152 // exceed 2^31. Bucket size is always power of two. in MultiThreadAllocator()
174 Bucket in insert()
277 struct Bucket { global() struct
299 GuardBucket RehashBucket() argument
[all...]
H A DFoldingSet.h712 FoldingSetIteratorImpl(void **Bucket);
727 explicit FoldingSetIterator(void **Bucket) : FoldingSetIteratorImpl(Bucket) {} in FoldingSetIterator() argument
754 explicit FoldingSetBucketIteratorImpl(void **Bucket);
756 FoldingSetBucketIteratorImpl(void **Bucket, bool) : Ptr(Bucket) {} in FoldingSetBucketIteratorImpl() argument
776 explicit FoldingSetBucketIterator(void **Bucket) : in FoldingSetBucketIterator() argument
777 FoldingSetBucketIteratorImpl(Bucket) {} in FoldingSetBucketIterator()
779 FoldingSetBucketIterator(void **Bucket, bool) : in FoldingSetBucketIterator() argument
780 FoldingSetBucketIteratorImpl(Bucket, true) {} in FoldingSetBucketIterator()
H A DDenseMap.h55 typename Bucket = llvm::detail::DenseMapPair<KeyT, ValueT>,
1235 template <typename KeyT, typename ValueT, typename KeyInfoT, typename Bucket,
1238 friend class DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, true>;
1239 friend class DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, false>;
1243 using value_type = std::conditional_t<IsConst, const Bucket, Bucket>;
1274 const DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, IsConstSrc> &I) in DenseMapIterator() argument
/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()
98 assert(Bucket.empty() && "Non-empty ArrayRecycler deleted!"); in ~ArrayRecycler()
105 for (; !Bucket.empty(); Bucket.pop_back()) 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);
H A DBalancedPartitioning.h76 std::optional<unsigned> Bucket; variable
/freebsd/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp195 struct Bucket { struct
196 Bucket(const SCEV *B, Instruction *I) in Bucket() function
270 bool chainCommoning(Loop *L, SmallVector<Bucket, 16> &Buckets);
273 bool prepareBasesForCommoningChains(Bucket &BucketChain);
277 rewriteLoadStoresForCommoningChains(Loop *L, Bucket &Bucket,
282 SmallVector<Bucket, 16> collectCandidates(
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);
309 bool prepareBaseForDispFormChain(Bucket &BucketChain, PrepForm Form);
[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.cpp64 uint32_t Bucket = E.second.HashValue % BucketCount; in finalize() local
65 Buckets[Bucket].push_back(&E.second); in finalize()
71 for (auto &Bucket : Buckets) in finalize() local
72 llvm::stable_sort(Bucket, [](HashData *LHS, HashData *RHS) { in finalize()
253 for (const auto &Bucket : Contents.getBuckets()) { in emitHashes() local
254 for (const auto &Hash : Bucket) { in emitHashes()
333 for (const AccelTableBase::HashList &Bucket : Buckets) { in emitData() local
335 for (const auto &Hash : Bucket) { in emitData()
352 if (!Bucket.empty()) in emitData()
431 for (auto &Bucket : Contents.getBuckets()) { in populateAbbrevsMap() local
[all …]
/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()
238 bucket = new Distribution.Bucket(lowerBound, upperBound, n++); in getLogDistribution()
248 List < Distribution.Bucket > buckets = in getLinearDistribution()
249 new ArrayList < Distribution.Bucket > (); in getLinearDistribution()
250 Distribution.Bucket bucket; 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
244 ListScope BucketScope(W, ("Bucket " + Twine(Bucket)).str()); in dump()
255 if (Hash % Hdr.BucketCount != Bucket) in dump()
812 DWARFDebugNames::NameIndex::getBucketArrayEntry(uint32_t Bucket) const { in getBucketArrayEntry()
813 assert(Bucket < Hdr.BucketCount); in getBucketArrayEntry()
814 uint64_t BucketOffset = Offsets.BucketsBase + 4 * Bucket; in getBucketArrayEntry()
898 uint32_t Bucket) const { in dumpBucket()
899 ListScope BucketScope(W, ("Bucket " + Twine(Bucket)).str()); in dumpBucket()
900 uint32_t Index = getBucketArrayEntry(Bucket); in dumpBucket()
912 if (Hash % Hdr.BucketCount != Bucket) in dumpBucket()
[all …]
H A DDWARFVerifier.cpp1284 uint32_t Bucket; in verifyNameIndexBuckets() member
1287 constexpr BucketInfo(uint32_t Bucket, uint32_t Index) in verifyNameIndexBuckets()
1288 : Bucket(Bucket), Index(Index) {} in verifyNameIndexBuckets()
1303 for (uint32_t Bucket = 0, End = NI.getBucketCount(); Bucket < End; ++Bucket) { in verifyNameIndexBuckets() local
1304 uint32_t Index = NI.getBucketArrayEntry(Bucket); in verifyNameIndexBuckets()
1309 Bucket, NI.getUnitOffset(), Index, in verifyNameIndexBuckets()
1316 BucketStarts.emplace_back(Bucket, Index); in verifyNameIndexBuckets()
1354 if (B.Bucket == NI.getBucketCount()) in verifyNameIndexBuckets()
1363 if (FirstHash % NI.getBucketCount() != B.Bucket) { in verifyNameIndexBuckets()
1368 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.cpp849 for (LVBucket &Bucket : Buckets) { in processLines()
850 dbgs() << "Begin: " << format_decimal(std::get<0>(Bucket), 5) << ", " in processLines()
851 << "End: " << format_decimal(std::get<1>(Bucket), 5) << ", " in processLines()
852 << "Address: " << hexValue(std::get<2>(Bucket)) << "\n"; in processLines()
871 for (LVBucket &Bucket : Buckets) { in processLines()
872 if (std::get<3>(Bucket)) in processLines()
875 if (Size == std::get<2>(Bucket)) { in processLines()
878 LVLines::iterator IterStart = DebugLines->begin() + std::get<0>(Bucket); in processLines()
880 DebugLines->begin() + std::get<1>(Bucket) + 1; in processLines()
884 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/AST/Interp/
H A DDescriptor.cpp402 unsigned Bucket = I / PER_FIELD; in initializeElement() local
404 if (!(data()[Bucket] & Mask)) { in initializeElement()
405 data()[Bucket] |= Mask; in initializeElement()
412 unsigned Bucket = I / PER_FIELD; in isElementInitialized() local
413 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