Home
last modified time | relevance | path

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

12

/freebsd-13.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-13.1/contrib/llvm-project/llvm/include/llvm/ADT/
H A DStringMap.h153 if (!Bucket || Bucket == getTombstoneVal()) { in StringMap()
154 TheTable[I] = Bucket; in StringMap()
185 if (Bucket && Bucket != getTombstoneVal()) { in ~StringMap()
220 if (Bucket == -1) in find()
227 if (Bucket == -1) in find()
279 if (Bucket && Bucket != getTombstoneVal()) in insert()
284 Bucket = KeyValue; in insert()
318 if (Bucket && Bucket != getTombstoneVal()) in try_emplace()
341 if (Bucket && Bucket != getTombstoneVal()) { in clear()
344 Bucket = nullptr; in clear()
[all …]
H A DSmallPtrSet.h188 if (*Bucket == Ptr) in find_imp()
189 return Bucket; in find_imp()
228 : Bucket(BP), End(E) { in SmallPtrSetIteratorImpl()
237 return Bucket == RHS.Bucket;
240 return Bucket != RHS.Bucket;
248 assert(Bucket <= End); in AdvanceIfNotValid()
252 ++Bucket; in AdvanceIfNotValid()
259 --Bucket; in RetreatIfNotValid()
289 assert(Bucket < End);
296 --Bucket;
[all …]
H A DFoldingSet.h669 FoldingSetIteratorImpl(void **Bucket);
684 explicit FoldingSetIterator(void **Bucket) : FoldingSetIteratorImpl(Bucket) {} in FoldingSetIterator() argument
711 explicit FoldingSetBucketIteratorImpl(void **Bucket);
713 FoldingSetBucketIteratorImpl(void **Bucket, bool) : Ptr(Bucket) {} in FoldingSetBucketIteratorImpl() argument
733 explicit FoldingSetBucketIterator(void **Bucket) : in FoldingSetBucketIterator() argument
734 FoldingSetBucketIteratorImpl(Bucket) {} in FoldingSetBucketIterator()
736 FoldingSetBucketIterator(void **Bucket, bool) : in FoldingSetBucketIterator() argument
737 FoldingSetBucketIteratorImpl(Bucket, true) {} in FoldingSetBucketIterator()
H A DDenseMap.h54 typename Bucket = llvm::detail::DenseMapPair<KeyT, ValueT>,
1190 template <typename KeyT, typename ValueT, typename KeyInfoT, typename Bucket,
1193 friend class DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, true>;
1194 friend class DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, false>;
1199 typename std::conditional<IsConst, const Bucket, Bucket>::type;
1230 const DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, IsConstSrc> &I) in DenseMapIterator() argument
/freebsd-13.1/contrib/llvm-project/llvm/lib/Support/
H A DFoldingSet.cpp330 void *Probe = *Bucket; in FindNodeOrInsertPos()
344 InsertPos = Bucket; in FindNodeOrInsertPos()
367 void *Next = *Bucket; in InsertNode()
377 *Bucket = N; in InsertNode()
408 Ptr = *Bucket; in RemoveNode()
413 *Bucket = NodeNextPtr; in RemoveNode()
441 (!*Bucket || !GetNextPtr(*Bucket))) in FoldingSetIteratorImpl()
442 ++Bucket; in FoldingSetIteratorImpl()
459 ++Bucket; in advance()
461 (!*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.cpp185 int Bucket = FindKey(Key); in RemoveKey() local
186 if (Bucket == -1) in RemoveKey()
189 StringMapEntryBase *Result = TheTable[Bucket]; in RemoveKey()
190 TheTable[Bucket] = getTombstoneVal(); in RemoveKey()
228 StringMapEntryBase *Bucket = TheTable[I]; in RehashTable() local
229 if (Bucket && Bucket != getTombstoneVal()) { in RehashTable()
234 NewTableArray[FullHash & (NewSize - 1)] = Bucket; in RehashTable()
248 NewTableArray[NewBucket] = Bucket; in RehashTable()
/freebsd-13.1/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.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.h643 Bucket; member
773 II.Bucket.push(To); in InsertReachable()
776 while (!II.Bucket.empty()) { in InsertReachable()
777 TreeNodePtr TN = II.Bucket.top(); in InsertReachable()
778 II.Bucket.pop(); in InsertReachable()
829 II.Bucket.push(SuccTN); in InsertReachable()
/freebsd-13.1/contrib/llvm-project/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp135 struct Bucket { struct
194 SmallVector<Bucket, 16> collectCandidates(
328 Buckets.push_back(Bucket(LSCEV, MemI)); in addOneCandidate()
337 SmallVector<Bucket, 16> Buckets; in collectCandidates()
694 for (auto &Bucket : Buckets) in updateFormPrep() local
697 if (prepareBaseForUpdateFormChain(Bucket)) in updateFormPrep()
715 for (auto &Bucket : Buckets) { in dispFormPrep() local
718 if (prepareBaseForDispFormChain(Bucket, Form)) in dispFormPrep()
887 SmallVector<Bucket, 16> UpdateFormBuckets = in runOnLoop()
896 SmallVector<Bucket, 16> DSFormBuckets = in runOnLoop()
[all …]
/freebsd-13.1/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
250 for (auto &Hash : Bucket) { in emitHashes()
331 for (auto &Hash : Bucket) { in emitData()
348 if (!Bucket.empty()) in emitData()
396 for (auto *Hash : Bucket) { in getUniqueTags()
433 Index += Bucket.value().size(); in emitBuckets()
440 for (auto *Hash : Bucket.value()) { in emitStringOffsets()
498 for (auto *Hash : Bucket) { in emitData()
671 for (auto &Bucket : Buckets) in print() local
[all …]
/freebsd-13.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-13.1/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/
H A DDWARFAcceleratorTable.cpp230 for (unsigned Bucket = 0; Bucket < Hdr.BucketCount; ++Bucket) { in dump() local
244 if (Hash % Hdr.BucketCount != Bucket) in dump()
335 unsigned Bucket = HashValue % Hdr.BucketCount; in equal_range() local
349 if (Hash % Hdr.BucketCount != Bucket) in equal_range()
655 assert(Bucket < Hdr.BucketCount); in getBucketArrayEntry()
736 uint32_t Index = getBucketArrayEntry(Bucket); in dumpBucket()
748 if (Hash % Hdr.BucketCount != Bucket) in dumpBucket()
764 for (uint32_t Bucket = 0; Bucket < Hdr.BucketCount; ++Bucket) in dump() local
765 dumpBucket(W, Bucket); in dump()
813 uint32_t Bucket = *Hash % Hdr.BucketCount; in findEntryOffsetInCurrentIndex() local
[all …]
H A DDWARFVerifier.cpp1025 uint32_t Bucket; in verifyNameIndexBuckets() member
1028 constexpr BucketInfo(uint32_t Bucket, uint32_t Index) in verifyNameIndexBuckets()
1029 : Bucket(Bucket), Index(Index) {} in verifyNameIndexBuckets()
1044 for (uint32_t Bucket = 0, End = NI.getBucketCount(); Bucket < End; ++Bucket) { in verifyNameIndexBuckets() local
1045 uint32_t Index = NI.getBucketArrayEntry(Bucket); in verifyNameIndexBuckets()
1049 Bucket, NI.getUnitOffset(), Index, NI.getNameCount()); in verifyNameIndexBuckets()
1054 BucketStarts.emplace_back(Bucket, Index); in verifyNameIndexBuckets()
1090 if (B.Bucket == NI.getBucketCount()) in verifyNameIndexBuckets()
1099 if (FirstHash % NI.getBucketCount() != B.Bucket) { in verifyNameIndexBuckets()
1103 NI.getUnitOffset(), B.Bucket, FirstHash, in verifyNameIndexBuckets()
[all …]
/freebsd-13.1/contrib/llvm-project/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_addrhashmap.h58 struct Bucket { struct
83 Bucket *bucket_; argument
94 Bucket *table_;
162 table_ = (Bucket*)MmapOrDie(kSize * sizeof(table_[0]), "AddrHashMap"); in AddrHashMap()
169 Bucket *b = &table_[hash]; in acquire()
298 Bucket *b = h->bucket_; in release()
/freebsd-13.1/contrib/llvm-project/compiler-rt/lib/ubsan/
H A Dubsan_type_hash_itanium.cpp216 HashValue *Bucket = getTypeCacheHashTableBucket(Hash); in checkDynamicType() local
217 if (*Bucket == Hash) { in checkDynamicType()
243 *Bucket = Hash; in checkDynamicType()
/freebsd-13.1/contrib/llvm-project/clang/lib/AST/Interp/
H A DDescriptor.cpp273 unsigned Bucket = I / PER_FIELD; in initialize() local
275 if (!(data()[Bucket] & Mask)) { in initialize()
276 data()[Bucket] |= Mask; in initialize()
283 unsigned Bucket = I / PER_FIELD; in isInitialized() local
285 return data()[Bucket] & Mask; in isInitialized()
/freebsd-13.1/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-13.1/contrib/llvm-project/clang/lib/Lex/
H A DHeaderMap.cpp219 for (unsigned Bucket = HashHMapKey(Filename);; ++Bucket) { in lookupFilename() local
220 HMapBucket B = getBucket(Bucket & (NumBuckets-1)); in lookupFilename()
/freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/
H A DRDFLiveness.cpp229 for (auto &Bucket : Blocks) { in getAllReachingDefs() local
230 TmpBB.push_back(Bucket.first); in getAllReachingDefs()
231 if (Bucket.second.size() > 2) in getAllReachingDefs()
232 GetOrder(*Bucket.first); in getAllReachingDefs()
233 llvm::sort(Bucket.second, Precedes); in getAllReachingDefs()
242 auto &Bucket = Blocks[MBB]; in getAllReachingDefs() local
243 TmpInst.insert(TmpInst.end(), Bucket.rbegin(), Bucket.rend()); in getAllReachingDefs()
/freebsd-13.1/contrib/llvm-project/clang/lib/Tooling/Transformer/
H A DRewriteRule.cpp397 for (const auto &Bucket : Buckets) { in buildMatchers() local
399 DynTypedMatcher::VO_AnyOf, Bucket.first, in buildMatchers()
400 taggedMatchers("Tag", Bucket.second, TK_AsIs)); in buildMatchers()
/freebsd-13.1/contrib/llvm-project/clang/lib/ASTMatchers/
H A DASTMatchFinder.cpp779 TimeBucketRegion() : Bucket(nullptr) {} in TimeBucketRegion()
791 if (Bucket != NewBucket) { in setBucket()
793 if (Bucket) in setBucket()
794 *Bucket += Now; in setBucket()
797 Bucket = NewBucket; in setBucket()
802 llvm::TimeRecord *Bucket; member in clang::ast_matchers::internal::__anonb98ef6e90111::MatchASTVisitor::TimeBucketRegion
/freebsd-13.1/contrib/serf/
H A Ddesign-guide.txt9 4. Bucket Read Functions
11 6. Bucket lifetimes

12