/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Support/ |
D | FoldingSet.cpp | 324 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 = NodeNextPtr; in RemoveNode() [all …]
|
D | SmallPtrSet.cpp | 51 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 …]
|
D | StringMap.cpp | 186 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-subzero/include/llvm/ADT/ |
D | StringMap.h | 271 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 = FindKey(Key); in find() local 323 if (Bucket == -1) return end(); in find() [all …]
|
D | SmallPtrSet.h | 211 const void *const *Bucket; 216 : Bucket(BP), End(E) { in SmallPtrSetIteratorImpl() 227 return Bucket == RHS.Bucket; 230 return Bucket != RHS.Bucket; 238 assert(Bucket <= End); in AdvanceIfNotValid() 239 while (Bucket != End && in AdvanceIfNotValid() 240 (*Bucket == SmallPtrSetImplBase::getEmptyMarker() || in AdvanceIfNotValid() 241 *Bucket == SmallPtrSetImplBase::getTombstoneMarker())) in AdvanceIfNotValid() 242 ++Bucket; in AdvanceIfNotValid() 246 --Bucket; in RetreatIfNotValid() [all …]
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Support/ |
D | ArrayRecycler.h | 39 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 …]
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/ADT/ |
D | StringMap.h | 285 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)->Destroy(Allocator); in ~StringMap() 356 int Bucket = FindKey(Key); in find() local 357 if (Bucket == -1) return end(); in find() [all …]
|
D | SmallPtrSet.h | 187 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; 228 : Bucket(BP), End(E) { in SmallPtrSetIteratorImpl() 237 return Bucket == RHS.Bucket; 240 return Bucket != RHS.Bucket; 248 assert(Bucket <= End); in AdvanceIfNotValid() 249 while (Bucket != End && in AdvanceIfNotValid() 250 (*Bucket == SmallPtrSetImplBase::getEmptyMarker() || in AdvanceIfNotValid() [all …]
|
/third_party/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
D | AlphabeticIndex.java | 19 import com.ibm.icu.text.AlphabeticIndex.Bucket; 20 import com.ibm.icu.text.AlphabeticIndex.Bucket.LabelType; 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<V>> iterator() { in iterator() 779 Iterator<Bucket<V>> bucketIterator = buckets.fullIterator(); in initBuckets() 780 Bucket<V> currentBucket = bucketIterator.next(); in initBuckets() [all …]
|
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/ |
D | AlphabeticIndex.java | 20 import ohos.global.icu.text.AlphabeticIndex.Bucket; 21 import ohos.global.icu.text.AlphabeticIndex.Bucket.LabelType; 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<V>> iterator() { in iterator() 751 Iterator<Bucket<V>> bucketIterator = buckets.fullIterator(); in initBuckets() 752 Bucket<V> currentBucket = bucketIterator.next(); in initBuckets() [all …]
|
/third_party/grpc/src/csharp/Grpc.IntegrationTesting/ |
D | HistogramTest.cs | 52 Assert.AreEqual(2, data.Bucket[925]); in Simple() 53 Assert.AreEqual(2, data.Bucket[935]); in Simple() 64 Assert.AreEqual(1, data.Bucket[0]); in ExtremeObservations() 65 Assert.AreEqual(1, data.Bucket[data.Bucket.Count - 1]); in ExtremeObservations() 86 Assert.AreEqual(1, data.Bucket[0]); in MergeSnapshots() 87 Assert.AreEqual(1, data.Bucket[925]); in MergeSnapshots() 88 Assert.AreEqual(1, data.Bucket[935]); in MergeSnapshots() 89 Assert.AreEqual(1, data.Bucket[data.Bucket.Count - 1]); in MergeSnapshots() 110 CollectionAssert.AreEqual(new uint[data.Bucket.Count], data.Bucket); in Reset()
|
D | Histogram.cs | 119 …GrpcPreconditions.CheckArgument(mergeTo.Bucket.Count == 0 || mergeTo.Bucket.Count == buckets.Lengt… in GetSnapshotUnsafe() 134 if (mergeTo.Bucket.Count == 0) in GetSnapshotUnsafe() 136 mergeTo.Bucket.AddRange(buckets); in GetSnapshotUnsafe() 142 mergeTo.Bucket[i] += buckets[i]; in GetSnapshotUnsafe()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-subzero/lib/Support/ |
D | SmallPtrSet.cpp | 51 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() 61 return std::make_pair(Bucket, true); in insert_imp_big() 80 void **Bucket = const_cast<void**>(FindBucketFor(Ptr)); in erase_imp() local 81 if (*Bucket != Ptr) return false; // Not in the set? in erase_imp() 84 *Bucket = getTombstoneMarker(); in erase_imp() 90 unsigned Bucket = DenseMapInfo<void *>::getHashValue(Ptr) & (CurArraySize-1); in FindBucketFor() local [all …]
|
D | StringMap.cpp | 182 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/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Target/PowerPC/ |
D | PPCLoopInstrFormPrep.cpp | 137 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, 16> &Buckets, in addOneCandidate() argument [all …]
|
/third_party/mindspore/mindspore/ccsrc/runtime/device/ |
D | bucket.cc | 24 void Bucket::AddGradTensor(const tensor::TensorPtr &tensor) { in AddGradTensor() 40 void Bucket::Launch() { in Launch() 66 void Bucket::UpdateTensorAddr() { in UpdateTensorAddr() 86 void Bucket::CalculateMean() { in CalculateMean() 110 void Bucket::UpdateTensorOutputAddr(uint8_t *addr) { in UpdateTensorOutputAddr() 118 void Bucket::LazyDeleteOldAddr() { in LazyDeleteOldAddr() 126 void Bucket::Release() { in Release()
|
/third_party/grpc/src/csharp/Grpc.IntegrationTesting/CoreStats/ |
D | Stats.cs | 36 …new pbr::GeneratedClrTypeInfo(typeof(global::Grpc.Core.Bucket), global::Grpc.Core.Bucket.Parser, n… in StatsReflection() 46 public sealed partial class Bucket : pb::IMessage<Bucket> class 51 …private static readonly pb::MessageParser<Bucket> _parser = new pb::MessageParser<Bucket>(() => ne… 54 public static pb::MessageParser<Bucket> Parser { get { return _parser; } } 67 public Bucket() { in Bucket() method in Grpc.Core.Bucket 74 public Bucket(Bucket other) : this() { in Bucket() method in Grpc.Core.Bucket 81 public Bucket Clone() { in Clone() 82 return new Bucket(this); in Clone() 109 return Equals(other as Bucket); in Equals() 113 public bool Equals(Bucket other) { in Equals() [all …]
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/AsmPrinter/ |
D | AccelTable.cpp | 76 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() local 84 llvm::stable_sort(Bucket, [](HashData *LHS, HashData *RHS) { in finalize() 251 for (auto &Bucket : Contents.getBuckets()) { in emitHashes() local 252 for (auto &Hash : Bucket) { in emitHashes() 400 for (auto &Bucket : Contents.getBuckets()) { in getUniqueTags() local 401 for (auto *Hash : Bucket) { in getUniqueTags() 435 for (const auto &Bucket : enumerate(Contents.getBuckets())) { in emitBuckets() local 436 Asm->OutStreamer->AddComment("Bucket " + Twine(Bucket.index())); in emitBuckets() [all …]
|
/third_party/node/deps/icu-small/source/i18n/ |
D | alphaindex.cpp | 82 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 Bucket *bucket = new Bucket(getUnderflowLabel(), emptyString_, U_ALPHAINDEX_UNDERFLOW); in createBucketList() 484 bucket = new Bucket(getInflowLabel(), inflowBoundary, U_ALPHAINDEX_INFLOW); in createBucketList() 493 bucket = new Bucket(fixLabel(current, temp), current, U_ALPHAINDEX_NORMAL); in createBucketList() [all …]
|
/third_party/flutter/skia/third_party/externals/icu/source/i18n/ |
D | alphaindex.cpp | 82 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 Bucket *bucket = new Bucket(getUnderflowLabel(), emptyString_, U_ALPHAINDEX_UNDERFLOW); in createBucketList() 484 bucket = new Bucket(getInflowLabel(), inflowBoundary, U_ALPHAINDEX_INFLOW); in createBucketList() 493 bucket = new Bucket(fixLabel(current, temp), current, U_ALPHAINDEX_NORMAL); in createBucketList() [all …]
|
/third_party/skia/third_party/externals/icu/source/i18n/ |
D | alphaindex.cpp | 82 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(getInflowLabel(), inflowBoundary, U_ALPHAINDEX_INFLOW); in createBucketList() 492 bucket = new Bucket(fixLabel(current, temp), current, U_ALPHAINDEX_NORMAL); in createBucketList() [all …]
|
/third_party/icu/icu4c/source/i18n/ |
D | alphaindex.cpp | 82 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(getInflowLabel(), inflowBoundary, U_ALPHAINDEX_INFLOW); in createBucketList() 492 bucket = new Bucket(fixLabel(current, temp), current, U_ALPHAINDEX_NORMAL); in createBucketList() [all …]
|
/third_party/flutter/skia/third_party/externals/icu/source/i18n/unicode/ |
D | alphaindex.h | 199 class U_I18N_API Bucket : public UObject { 205 virtual ~Bucket(); 229 Bucket *displayBucket_; 233 Bucket(const UnicodeString &label, // Parameter strings are copied. 283 const Bucket *getBucket(int32_t index) const; 729 Bucket *currentBucket_; // While an iteration of the index in underway,
|
/third_party/skia/third_party/externals/icu/source/i18n/unicode/ |
D | alphaindex.h | 202 class U_I18N_API Bucket : public UObject { 208 virtual ~Bucket(); 232 Bucket *displayBucket_; 236 Bucket(const UnicodeString &label, // Parameter strings are copied. 286 const Bucket *getBucket(int32_t index) const; 732 Bucket *currentBucket_; // While an iteration of the index in underway,
|
/third_party/node/deps/icu-small/source/i18n/unicode/ |
D | alphaindex.h | 202 class U_I18N_API Bucket : public UObject { 208 virtual ~Bucket(); 232 Bucket *displayBucket_; 236 Bucket(const UnicodeString &label, // Parameter strings are copied. 286 const Bucket *getBucket(int32_t index) const; 732 Bucket *currentBucket_; // While an iteration of the index in underway,
|