Home
last modified time | relevance | path

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

12

/freebsd-12.1/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-12.1/contrib/llvm/lib/Support/
H A DFoldingSet.cpp326 void *Probe = *Bucket; in FindNodeOrInsertPos()
340 InsertPos = Bucket; in FindNodeOrInsertPos()
361 void *Next = *Bucket; in InsertNode()
371 *Bucket = N; in InsertNode()
402 Ptr = *Bucket; in RemoveNode()
407 *Bucket = NodeNextPtr; in RemoveNode()
433 (!*Bucket || !GetNextPtr(*Bucket))) in FoldingSetIteratorImpl()
434 ++Bucket; in FoldingSetIteratorImpl()
451 ++Bucket; in advance()
453 (!*Bucket || !GetNextPtr(*Bucket))); in advance()
[all …]
H A DSmallPtrSet.cpp53 if (*Bucket == Ptr) in insert_imp_big()
54 return std::make_pair(Bucket, false); // Already inserted, good. in insert_imp_big()
57 if (*Bucket == getTombstoneMarker()) in insert_imp_big()
61 *Bucket = Ptr; in insert_imp_big()
63 return std::make_pair(Bucket, true); in insert_imp_big()
76 if (LLVM_LIKELY(Array[Bucket] == getEmptyMarker())) in FindBucketFor()
77 return Tombstone ? Tombstone : Array+Bucket; in FindBucketFor()
80 if (LLVM_LIKELY(Array[Bucket] == Ptr)) in FindBucketFor()
81 return Array+Bucket; in FindBucketFor()
85 if (Array[Bucket] == getTombstoneMarker() && !Tombstone) in FindBucketFor()
[all …]
H A DStringMap.cpp187 int Bucket = FindKey(Key); in RemoveKey() local
188 if (Bucket == -1) return nullptr; in RemoveKey()
190 StringMapEntryBase *Result = TheTable[Bucket]; in RemoveKey()
191 TheTable[Bucket] = getTombstoneVal(); in RemoveKey()
229 StringMapEntryBase *Bucket = TheTable[I]; in RehashTable() local
230 if (Bucket && Bucket != getTombstoneVal()) { in RehashTable()
235 NewTableArray[FullHash & (NewSize-1)] = Bucket; in RehashTable()
249 NewTableArray[NewBucket] = Bucket; in RehashTable()
/freebsd-12.1/contrib/llvm/include/llvm/ADT/
H A DStringMap.h264 if (!Bucket || Bucket == getTombstoneVal()) { in StringMap()
265 TheTable[I] = Bucket; in StringMap()
296 if (Bucket && Bucket != getTombstoneVal()) { in ~StringMap()
334 int Bucket = FindKey(Key); in find() local
340 int Bucket = FindKey(Key); in find() local
369 if (Bucket && Bucket != getTombstoneVal()) in insert()
374 Bucket = KeyValue; in insert()
398 if (Bucket && Bucket != getTombstoneVal()) in try_emplace()
420 if (Bucket && Bucket != getTombstoneVal()) { in clear()
423 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()
290 assert(Bucket < End);
297 --Bucket;
[all …]
H A DFoldingSet.h624 FoldingSetIteratorImpl(void **Bucket);
639 explicit FoldingSetIterator(void **Bucket) : FoldingSetIteratorImpl(Bucket) {} in FoldingSetIterator() argument
666 explicit FoldingSetBucketIteratorImpl(void **Bucket);
668 FoldingSetBucketIteratorImpl(void **Bucket, bool) : Ptr(Bucket) {} in FoldingSetBucketIteratorImpl() argument
688 explicit FoldingSetBucketIterator(void **Bucket) : in FoldingSetBucketIterator() argument
689 FoldingSetBucketIteratorImpl(Bucket) {} in FoldingSetBucketIterator()
691 FoldingSetBucketIterator(void **Bucket, bool) : in FoldingSetBucketIterator() argument
692 FoldingSetBucketIteratorImpl(Bucket, true) {} in FoldingSetBucketIterator()
H A DDenseMap.h80 typename Bucket = llvm::detail::DenseMapPair<KeyT, ValueT>,
1175 template <typename KeyT, typename ValueT, typename KeyInfoT, typename Bucket,
1178 friend class DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, true>;
1179 friend class DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, false>;
1181 using ConstIterator = DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, true>;
1186 typename std::conditional<IsConst, const Bucket, Bucket>::type;
1217 const DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, IsConstSrc> &I) in DenseMapIterator() argument
/freebsd-12.1/contrib/llvm/include/llvm/Support/
H A DArrayRecycler.h40 SmallVector<FreeList*, 8> Bucket; variable
45 if (Idx >= Bucket.size()) in pop()
47 FreeList *Entry = Bucket[Idx]; in pop()
51 Bucket[Idx] = Entry->Next; in pop()
60 if (Idx >= Bucket.size()) in push()
61 Bucket.resize(size_t(Idx) + 1); in push()
62 Entry->Next = Bucket[Idx]; in push()
63 Bucket[Idx] = Entry; in push()
106 for (; !Bucket.empty(); Bucket.pop_back()) in clear()
107 while (T *Ptr = pop(Bucket.size() - 1)) in clear()
[all …]
H A DOnDiskHashTable.h79 struct Bucket { struct
85 Bucket *Buckets; argument
89 void insert(Bucket *Buckets, size_t Size, Item *E) { in insert()
90 Bucket &B = Buckets[E->Hash & (Size - 1)]; in insert()
98 Bucket *NewBuckets = static_cast<Bucket *>( in resize()
99 safe_calloc(NewSize, sizeof(Bucket))); in resize()
173 Bucket &B = Buckets[I]; in Emit()
230 Buckets = static_cast<Bucket *>(safe_calloc(NumBuckets, sizeof(Bucket))); in OnDiskChainedHashTableGenerator()
359 const unsigned char *Bucket = Buckets + sizeof(offset_type) * Idx; variable
361 offset_type Offset = endian::readNext<offset_type, little, aligned>(Bucket);
H A DGenericDomTreeConstruction.h633 Bucket; // Queue of tree nodes sorted by level in descending order. member
754 II.Bucket.push({ToLevel, To}); in InsertReachable()
756 while (!II.Bucket.empty()) { in InsertReachable()
757 const TreeNodePtr CurrentNode = II.Bucket.top().second; in InsertReachable()
759 II.Bucket.pop(); in InsertReachable()
829 II.Bucket.push({SuccLevel, SuccTN}); in VisitInsertion()
/freebsd-12.1/contrib/llvm/lib/CodeGen/AsmPrinter/
H A DAccelTable.cpp78 Buckets[Bucket].push_back(&E.second); in finalize()
84 for (auto &Bucket : Buckets) in finalize() local
85 std::stable_sort(Bucket.begin(), Bucket.end(), in finalize()
253 for (auto &Bucket : Contents.getBuckets()) { in emitHashes() local
254 for (auto &Hash : Bucket) { in emitHashes()
403 for (auto *Hash : Bucket) { in getUniqueTags()
440 Index += Bucket.value().size(); in emitBuckets()
447 for (auto *Hash : Bucket.value()) { in emitStringOffsets()
505 for (auto *Hash : Bucket) { in emitData()
694 for (auto &Bucket : Buckets) in print() local
[all …]
/freebsd-12.1/contrib/llvm/lib/DebugInfo/DWARF/
H A DDWARFAcceleratorTable.cpp231 for (unsigned Bucket = 0; Bucket < Hdr.BucketCount; ++Bucket) { in dump() local
245 if (Hash % Hdr.BucketCount != Bucket) in dump()
336 unsigned Bucket = HashValue % Hdr.BucketCount; in equal_range() local
350 if (Hash % Hdr.BucketCount != Bucket) in equal_range()
639 assert(Bucket < Hdr.BucketCount); in getBucketArrayEntry()
719 uint32_t Index = getBucketArrayEntry(Bucket); in dumpBucket()
731 if (Hash % Hdr.BucketCount != Bucket) in dumpBucket()
747 for (uint32_t Bucket = 0; Bucket < Hdr.BucketCount; ++Bucket) in dump() local
748 dumpBucket(W, Bucket); in dump()
796 uint32_t Bucket = *Hash % Hdr.BucketCount; in findEntryOffsetInCurrentIndex() local
[all …]
H A DDWARFVerifier.cpp987 uint32_t Bucket; in verifyNameIndexBuckets() member
990 constexpr BucketInfo(uint32_t Bucket, uint32_t Index) in verifyNameIndexBuckets()
991 : Bucket(Bucket), Index(Index) {} in verifyNameIndexBuckets()
1006 for (uint32_t Bucket = 0, End = NI.getBucketCount(); Bucket < End; ++Bucket) { in verifyNameIndexBuckets() local
1007 uint32_t Index = NI.getBucketArrayEntry(Bucket); in verifyNameIndexBuckets()
1011 Bucket, NI.getUnitOffset(), Index, NI.getNameCount()); in verifyNameIndexBuckets()
1016 BucketStarts.emplace_back(Bucket, Index); in verifyNameIndexBuckets()
1052 if (B.Bucket == NI.getBucketCount()) in verifyNameIndexBuckets()
1061 if (FirstHash % NI.getBucketCount() != B.Bucket) { in verifyNameIndexBuckets()
1065 NI.getUnitOffset(), B.Bucket, FirstHash, in verifyNameIndexBuckets()
[all …]
/freebsd-12.1/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-12.1/contrib/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_addrhashmap.h59 struct Bucket { struct
84 Bucket *bucket_; argument
95 Bucket *table_;
163 table_ = (Bucket*)MmapOrDie(kSize * sizeof(table_[0]), "AddrHashMap"); in AddrHashMap()
170 Bucket *b = &table_[hash]; in acquire()
299 Bucket *b = h->bucket_; in release()
/freebsd-12.1/contrib/compiler-rt/lib/ubsan/
H A Dubsan_type_hash_itanium.cc216 HashValue *Bucket = getTypeCacheHashTableBucket(Hash); in checkDynamicType() local
217 if (*Bucket == Hash) { in checkDynamicType()
243 *Bucket = Hash; in checkDynamicType()
/freebsd-12.1/contrib/llvm/tools/clang/lib/Lex/
H A DHeaderMap.cpp220 for (unsigned Bucket = HashHMapKey(Filename);; ++Bucket) { in lookupFilename() local
221 HMapBucket B = getBucket(Bucket & (NumBuckets-1)); in lookupFilename()
/freebsd-12.1/contrib/llvm/lib/DebugInfo/PDB/Native/
H A DTpiStream.cpp166 uint32_t Bucket = hashStringV1(Name) % Header->NumHashBuckets; in findRecordsByName() local
167 if (Bucket > HashMap.size()) in findRecordsByName()
171 for (TypeIndex TI : HashMap[Bucket]) { in findRecordsByName()
H A DGSIStreamBuilder.cpp157 auto &Bucket = TmpBuckets[BucketIdx]; in finalizeBuckets() local
158 if (Bucket.empty()) in finalizeBuckets()
176 llvm::sort(Bucket, [](const std::pair<StringRef, PSHashRecord> &Left, in finalizeBuckets()
181 for (const auto &Entry : Bucket) in finalizeBuckets()
/freebsd-12.1/contrib/llvm/lib/Target/PowerPC/
H A DPPCLoopPreIncPrep.cpp135 struct Bucket { struct
136 Bucket(const SCEV *B, Instruction *I) : BaseSCEV(B), in Bucket() function
260 SmallVector<Bucket, 16> Buckets; in runOnLoop()
327 Buckets.push_back(Bucket(LSCEV, MemI)); in runOnLoop()
/freebsd-12.1/contrib/llvm/tools/clang/lib/ASTMatchers/
H A DASTMatchFinder.cpp511 TimeBucketRegion() : Bucket(nullptr) {} in TimeBucketRegion()
523 if (Bucket != NewBucket) { in setBucket()
525 if (Bucket) in setBucket()
526 *Bucket += Now; in setBucket()
529 Bucket = NewBucket; in setBucket()
534 llvm::TimeRecord *Bucket; member in clang::ast_matchers::internal::__anon99630ca40111::MatchASTVisitor::TimeBucketRegion
/freebsd-12.1/contrib/serf/
H A Ddesign-guide.txt9 4. Bucket Read Functions
11 6. Bucket lifetimes
/freebsd-12.1/contrib/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFAcceleratorTable.h408 void dumpBucket(ScopedPrinter &W, uint32_t Bucket) const;
436 uint32_t getBucketArrayEntry(uint32_t Bucket) const;
/freebsd-12.1/cddl/contrib/opensolaris/cmd/dtrace/test/cmd/jdtrace/
H A DJDTrace.java303 Distribution.Bucket bucket; in printDistribution()

12