Home
last modified time | relevance | path

Searched refs:Bucket (Results 1 - 25 of 46) sorted by relevance

12

/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/
H A DFoldingSet.cpp324 void **Bucket = GetBucketFor(IDHash, Buckets, NumBuckets); in FindNodeOrInsertPos() local
325 void *Probe = *Bucket; in FindNodeOrInsertPos()
339 InsertPos = Bucket; in FindNodeOrInsertPos()
358 void **Bucket = static_cast<void**>(InsertPos); in InsertNode() local
360 void *Next = *Bucket; in InsertNode()
366 Next = reinterpret_cast<void*>(reinterpret_cast<intptr_t>(Bucket)|1); in InsertNode()
370 *Bucket = N; in InsertNode()
400 void **Bucket = GetBucketPtr(Ptr); in RemoveNode() local
401 Ptr = *Bucket; in RemoveNode()
406 *Bucket in RemoveNode()
429 FoldingSetIteratorImpl(void **Bucket) FoldingSetIteratorImpl() argument
446 void **Bucket = GetBucketPtr(Probe); advance() local
461 FoldingSetBucketIteratorImpl(void **Bucket) FoldingSetBucketIteratorImpl() argument
[all...]
H A DSmallPtrSet.cpp51 const void **Bucket = const_cast<const void**>(FindBucketFor(Ptr)); in insert_imp_big()
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);
75 if (LLVM_LIKELY(Array[Bucket] == getEmptyMarker()))
76 return Tombstone ? Tombstone : Array+Bucket;
79 if (LLVM_LIKELY(Array[Bucket]
[all...]
H A DStringMap.cpp186 int Bucket = FindKey(Key); in RemoveKey() local
187 if (Bucket == -1) return nullptr; 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()
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/
H A DStringMap.h285 StringMapEntryBase *Bucket = RHS.TheTable[I]; in StringMap() local
286 if (!Bucket || Bucket == getTombstoneVal()) { in StringMap()
287 TheTable[I] = Bucket; in StringMap()
292 static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator, in StringMap()
293 static_cast<MapEntryTy *>(Bucket)->getValue()); in StringMap()
317 StringMapEntryBase *Bucket = TheTable[I]; in ~StringMap() local
318 if (Bucket && Bucket != getTombstoneVal()) { in ~StringMap()
319 static_cast<MapEntryTy*>(Bucket) in ~StringMap()
356 int Bucket = FindKey(Key); find() local
362 int Bucket = FindKey(Key); find() local
395 StringMapEntryBase *&Bucket = TheTable[BucketNo]; insert() local
434 StringMapEntryBase *&Bucket = TheTable[BucketNo]; try_emplace() local
456 StringMapEntryBase *&Bucket = TheTable[I]; clear() local
497 StringMapIterBase(StringMapEntryBase **Bucket, bool NoAdvance = false) StringMapIterBase() argument
538 StringMapConstIterator(StringMapEntryBase **Bucket, bool NoAdvance = false) StringMapConstIterator() argument
555 StringMapIterator(StringMapEntryBase **Bucket, bool NoAdvance = false) StringMapIterator() argument
[all...]
H A DSmallPtrSet.h187 auto *Bucket = FindBucketFor(Ptr); in find_imp() local
188 if (*Bucket == Ptr) in find_imp()
189 return Bucket; in find_imp()
223 const void *const *Bucket; member in llvm::SmallPtrSetIteratorImpl
228 : Bucket(BP), End(E) { in SmallPtrSetIteratorImpl()
237 return Bucket == RHS.Bucket; in operator ==()
240 return Bucket != RHS.Bucket; in operator !=()
248 assert(Bucket < in AdvanceIfNotValid()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/include/llvm/ADT/
H A DStringMap.h271 StringMapEntryBase *Bucket = RHS.TheTable[I]; in StringMap() local
272 if (!Bucket || Bucket == getTombstoneVal()) { in StringMap()
273 TheTable[I] = Bucket; in StringMap()
278 static_cast<MapEntryTy *>(Bucket)->getKey(), Allocator, in StringMap()
279 static_cast<MapEntryTy *>(Bucket)->getValue()); in StringMap()
316 int Bucket = FindKey(Key); in find() local
317 if (Bucket == -1) return end(); in find()
318 return iterator(TheTable+Bucket, true); in find()
322 int Bucket in find() local
350 StringMapEntryBase *&Bucket = TheTable[BucketNo]; insert() local
379 StringMapEntryBase *&Bucket = TheTable[BucketNo]; try_emplace() local
401 StringMapEntryBase *&Bucket = TheTable[I]; clear() local
437 StringMapEntryBase *Bucket = TheTable[I]; ~StringMap() local
456 StringMapConstIterator(StringMapEntryBase **Bucket, bool NoAdvance = false) StringMapConstIterator() argument
497 StringMapIterator(StringMapEntryBase **Bucket, bool NoAdvance = false) StringMapIterator() argument
[all...]
H A DSmallPtrSet.h211 const void *const *Bucket; member in llvm::SmallPtrSetIteratorImpl
216 : Bucket(BP), End(E) { in SmallPtrSetIteratorImpl()
227 return Bucket == RHS.Bucket; in operator ==()
230 return Bucket != RHS.Bucket; in operator !=()
238 assert(Bucket <= End); in AdvanceIfNotValid()
239 while (Bucket != End && in AdvanceIfNotValid()
240 (*Bucket == SmallPtrSetImplBase::getEmptyMarker() || in AdvanceIfNotValid()
241 *Bucket in AdvanceIfNotValid()
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/
H A DArrayRecycler.h39 SmallVector<FreeList*, 8> Bucket; member in llvm::ArrayRecycler
41 // Remove an entry from the free list in Bucket[Idx] and return it.
44 if (Idx >= Bucket.size()) in pop()
46 FreeList *Entry = Bucket[Idx]; in pop()
50 Bucket[Idx] = Entry->Next; in pop()
55 // Add an entry to the free list at Bucket[Idx].
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[Id in push()
[all...]
H A DOnDiskHashTable.h79 struct Bucket { struct in llvm::OnDiskChainedHashTableGenerator
85 Bucket *Buckets;
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()
183 assert(B.Length != 0 && "Bucket has a head but zero length?"); in Emit()
229 // Bucket object in OnDiskChainedHashTableGenerator()
359 const unsigned char *Bucket = Buckets + sizeof(offset_type) * Idx; find_hashed() local
[all...]
/third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/
H A DAlphabeticIndex.java19 import com.ibm.icu.text.AlphabeticIndex.Bucket;
20 import com.ibm.icu.text.AlphabeticIndex.Bucket.LabelType;
72 * for (AlphabeticIndex.Bucket&lt;Integer&gt; bucket : index) {
80 * for (AlphabeticIndex.Bucket&lt;Integer&gt; bucket : index) {
126 public final class AlphabeticIndex<V> implements Iterable<Bucket<V>> {
172 public static final class ImmutableIndex<V> implements Iterable<Bucket<V>> {
210 public Bucket<V> getBucket(int index) { in getBucket()
223 public Iterator<Bucket<V>> iterator() { in iterator()
640 for (Bucket<V> bucket : buckets) { in getBucketLabels()
752 public Iterator<Bucket<
895 public static class Bucket<V> implements Iterable<Record<V>> { global() class in AlphabeticIndex
940 private Bucket(String label, String lowerBoundary, LabelType labelType) { Bucket() method in AlphabeticIndex.Bucket
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DAlphabeticIndex.java20 import ohos.global.icu.text.AlphabeticIndex.Bucket;
21 import ohos.global.icu.text.AlphabeticIndex.Bucket.LabelType;
73 * for (AlphabeticIndex.Bucket&lt;Integer&gt; bucket : index) {
81 * for (AlphabeticIndex.Bucket&lt;Integer&gt; bucket : index) {
126 public final class AlphabeticIndex<V> implements Iterable<Bucket<V>> {
171 public static final class ImmutableIndex<V> implements Iterable<Bucket<V>> {
206 public Bucket<V> getBucket(int index) { in getBucket()
218 public Iterator<Bucket<V>> iterator() { in iterator()
619 for (Bucket<V> bucket : buckets) { in getBucketLabels()
724 public Iterator<Bucket<
861 public static class Bucket<V> implements Iterable<Record<V>> { global() class in AlphabeticIndex
899 private Bucket(String label, String lowerBoundary, LabelType labelType) { Bucket() method in AlphabeticIndex.Bucket
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/lib/Support/
H A DSmallPtrSet.cpp51 const void **Bucket = const_cast<const void**>(FindBucketFor(Ptr)); in insert_imp_big()
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()
61 return std::make_pair(Bucket, true); in insert_imp_big()
80 void **Bucket = const_cast<void**>(FindBucketFor(Ptr));
81 if (*Bucket != Ptr) return false; // Not in the set?
84 *Bucket = getTombstoneMarker();
90 unsigned Bucket
[all...]
H A DStringMap.cpp182 int Bucket = FindKey(Key); in RemoveKey() local
183 if (Bucket == -1) return nullptr; in RemoveKey()
185 StringMapEntryBase *Result = TheTable[Bucket]; in RemoveKey()
186 TheTable[Bucket] = getTombstoneVal(); in RemoveKey()
224 StringMapEntryBase *Bucket = TheTable[I]; in RehashTable() local
225 if (Bucket && Bucket != getTombstoneVal()) { in RehashTable()
230 NewTableArray[FullHash & (NewSize-1)] = Bucket; in RehashTable()
244 NewTableArray[NewBucket] = Bucket; in RehashTable()
/third_party/node/deps/v8/src/heap/
H A Dslot-set.h155 size_t buckets_size = buckets * sizeof(Bucket*); in Allocate()
208 Bucket* bucket = LoadBucket<access_mode>(bucket_index); in Insert()
210 bucket = new Bucket; in Insert()
232 Bucket* bucket = LoadBucket(bucket_index); in Contains()
242 Bucket* bucket = LoadBucket(bucket_index); in Remove()
266 Bucket* bucket; in RemoveRange()
324 Bucket* bucket = LoadBucket(bucket_index); in Lookup()
386 Bucket* bucket = LoadBucket<AccessMode::NON_ATOMIC>(bucket_index); in CheckPossiblyEmptyBuckets()
420 class Bucket : public Malloced { class
424 Bucket() { in Bucket() function in Bucket
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/PowerPC/
H A DPPCLoopInstrFormPrep.cpp137 struct Bucket { struct
138 Bucket(const SCEV *B, Instruction *I) : BaseSCEV(B), in Bucket() function
196 SmallVector<Bucket, 16>
204 SmallVector<Bucket, 16> &Buckets,
208 bool updateFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets);
212 bool dispFormPrep(Loop *L, SmallVector<Bucket, 16> &Buckets,
221 bool prepareBaseForDispFormChain(Bucket &BucketChain,
229 bool prepareBaseForUpdateFormChain(Bucket &BucketChain);
233 bool rewriteLoadStores(Loop *L, Bucket &BucketChain,
309 SmallVector<Bucket, 1 in addOneCandidate()
[all...]
/third_party/jinja2/
H A Dbccache.py44 class Bucket: class
104 these methods are passed a :class:`~jinja2.bccache.Bucket`.
130 def load_bytecode(self, bucket: Bucket) -> None:
137 def dump_bytecode(self, bucket: Bucket) -> None:
171 ) -> Bucket:
177 bucket = Bucket(environment, key, checksum)
181 def set_bucket(self, bucket: Bucket) -> None:
259 def _get_cache_filename(self, bucket: Bucket) -> str:
262 def load_bytecode(self, bucket: Bucket) -> None:
277 def dump_bytecode(self, bucket: Bucket)
[all...]
/third_party/icu/icu4c/source/i18n/
H A Dalphaindex.cpp82 inline AlphabeticIndex::Bucket *getBucket(const UVector &list, int32_t i) { in getBucket()
83 return static_cast<AlphabeticIndex::Bucket *>(list[i]); in getBucket()
151 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, i); in getBucketIndex()
160 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, start); in getBucketIndex()
196 const AlphabeticIndex::Bucket *
437 Bucket *asciiBuckets[26] = { in createBucketList()
441 Bucket *pinyinBuckets[26] = { in createBucketList()
454 LocalPointer<Bucket> bucket(new Bucket(getUnderflowLabel(), emptyString_, U_ALPHAINDEX_UNDERFLOW), errorCode); in createBucketList()
484 new Bucket(getInflowLabe in createBucketList()
1220 AlphabeticIndex::Bucket::Bucket(const UnicodeString &label, Bucket() function in AlphabeticIndex::Bucket
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Dalphaindex.cpp82 inline AlphabeticIndex::Bucket *getBucket(const UVector &list, int32_t i) { in getBucket()
83 return static_cast<AlphabeticIndex::Bucket *>(list[i]); in getBucket()
151 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, i); in getBucketIndex()
160 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, start); in getBucketIndex()
196 const AlphabeticIndex::Bucket *
437 Bucket *asciiBuckets[26] = { in createBucketList()
441 Bucket *pinyinBuckets[26] = { in createBucketList()
454 LocalPointer<Bucket> bucket(new Bucket(getUnderflowLabel(), emptyString_, U_ALPHAINDEX_UNDERFLOW), errorCode); in createBucketList()
484 new Bucket(getInflowLabe in createBucketList()
1220 AlphabeticIndex::Bucket::Bucket(const UnicodeString &label, Bucket() function in AlphabeticIndex::Bucket
[all...]
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/AsmPrinter/
H A DAccelTable.cpp76 uint32_t Bucket = E.second.HashValue % BucketCount; in finalize() local
77 Buckets[Bucket].push_back(&E.second); in finalize()
83 for (auto &Bucket : Buckets) in finalize()
84 llvm::stable_sort(Bucket, [](HashData *LHS, HashData *RHS) { in finalize()
251 for (auto &Bucket : Contents.getBuckets()) { in emitHashes()
252 for (auto &Hash : Bucket) { in emitHashes()
256 Asm->OutStreamer->AddComment("Hash in Bucket " + Twine(BucketIdx)); in emitHashes()
273 Asm->OutStreamer->AddComment("Offset in Bucket " + Twine(i)); in emitOffsets()
286 Asm->OutStreamer->AddComment("Header Bucket Count"); in emit()
312 Asm->OutStreamer->AddComment("Bucket " in emitBuckets()
[all...]
/third_party/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/
H A DAlphabeticIndexTest.java33 import com.ibm.icu.text.AlphabeticIndex.Bucket;
34 import com.ibm.icu.text.AlphabeticIndex.Bucket.LabelType;
230 Bucket<Integer> bucket = find(alphabeticIndex, probe); in TestA()
236 private Bucket<Integer> find(AlphabeticIndex<Integer> alphabeticIndex, final String probe) { in find()
237 for (Bucket<Integer> bucket : alphabeticIndex) { in find()
322 for (Bucket<String> bucket : alphabeticIndex) { in TestEmpty()
369 Counter<AlphabeticIndex.Bucket.LabelType> counter = new Counter(); in TestInflow()
370 for (Bucket<Double> bucket : alphabeticIndex) { in TestInflow()
387 List<Bucket<Double>> buckets = CollectionUtilities.addAll(alphabeticIndex.iterator(), new ArrayList<Bucket<Doubl in TestInflow()
[all...]
/third_party/icu/ohos_icu4j/src/main/tests/ohos/global/icu/dev/test/collator/
H A DAlphabeticIndexTest.java34 import ohos.global.icu.text.AlphabeticIndex.Bucket;
35 import ohos.global.icu.text.AlphabeticIndex.Bucket.LabelType;
233 Bucket<Integer> bucket = find(alphabeticIndex, probe); in TestA()
239 private Bucket<Integer> find(AlphabeticIndex<Integer> alphabeticIndex, final String probe) { in find()
240 for (Bucket<Integer> bucket : alphabeticIndex) { in find()
325 for (Bucket<String> bucket : alphabeticIndex) { in TestEmpty()
372 Counter<AlphabeticIndex.Bucket.LabelType> counter = new Counter(); in TestInflow()
373 for (Bucket<Double> bucket : alphabeticIndex) { in TestInflow()
390 List<Bucket<Double>> buckets = CollectionUtilities.addAll(alphabeticIndex.iterator(), new ArrayList<Bucket<Doubl in TestInflow()
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dalphaindex.cpp82 inline AlphabeticIndex::Bucket *getBucket(const UVector &list, int32_t i) { in getBucket()
83 return static_cast<AlphabeticIndex::Bucket *>(list[i]); in getBucket()
151 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, i); in getBucketIndex()
160 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, start); in getBucketIndex()
196 const AlphabeticIndex::Bucket *
436 Bucket *asciiBuckets[26] = { in createBucketList()
440 Bucket *pinyinBuckets[26] = { in createBucketList()
453 Bucket *bucket = new Bucket(getUnderflowLabel(), emptyString_, U_ALPHAINDEX_UNDERFLOW); in createBucketList()
483 bucket = new Bucket(getInflowLabe in createBucketList()
1227 AlphabeticIndex::Bucket::Bucket(const UnicodeString &label, Bucket() function in AlphabeticIndex::Bucket
[all...]
/third_party/node/deps/icu-small/source/i18n/unicode/
H A Dalphaindex.h199 * The Bucket class is not intended for public subclassing.
202 class U_I18N_API Bucket : public UObject { class in AlphabeticIndex
208 virtual ~Bucket();
232 Bucket *displayBucket_;
236 Bucket(const UnicodeString &label, // Parameter strings are copied.
286 const Bucket *getBucket(int32_t index) const;
476 * Add a record to the index. Each record will be associated with an index Bucket
528 * Given the name of a record, return the zero-based index of the Bucket
531 * Bucket numbers are zero-based, in Bucket iteratio
[all...]
/third_party/icu/icu4c/source/i18n/unicode/
H A Dalphaindex.h199 * The Bucket class is not intended for public subclassing.
202 class U_I18N_API Bucket : public UObject { class in AlphabeticIndex
208 virtual ~Bucket();
232 Bucket *displayBucket_;
236 Bucket(const UnicodeString &label, // Parameter strings are copied.
286 const Bucket *getBucket(int32_t index) const;
476 * Add a record to the index. Each record will be associated with an index Bucket
528 * Given the name of a record, return the zero-based index of the Bucket
531 * Bucket numbers are zero-based, in Bucket iteratio
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/unicode/
H A Dalphaindex.h199 * The Bucket class is not intended for public subclassing.
202 class U_I18N_API Bucket : public UObject { class in AlphabeticIndex
208 virtual ~Bucket();
232 Bucket *displayBucket_;
236 Bucket(const UnicodeString &label, // Parameter strings are copied.
286 const Bucket *getBucket(int32_t index) const;
476 * Add a record to the index. Each record will be associated with an index Bucket
528 * Given the name of a record, return the zero-based index of the Bucket
531 * Bucket numbers are zero-based, in Bucket iteratio
[all...]

Completed in 21 milliseconds

12