| /external/llvm/lib/Support/ |
| D | FoldingSet.cpp | 285 void **Bucket = GetBucketFor(ID.ComputeHash(), Buckets, NumBuckets); in FindNodeOrInsertPos() local
286 void *Probe = *Bucket; in FindNodeOrInsertPos()
300 InsertPos = Bucket; in FindNodeOrInsertPos()
319 void **Bucket = static_cast<void**>(InsertPos); in InsertNode() local
321 void *Next = *Bucket; in InsertNode()
327 Next = reinterpret_cast<void*>(reinterpret_cast<intptr_t>(Bucket)|1); in InsertNode()
331 *Bucket = N; in InsertNode()
361 void **Bucket = GetBucketPtr(Ptr); in RemoveNode() local
362 Ptr = *Bucket; in RemoveNode()
367 *Bucket = NodeNextPtr; in RemoveNode()
[all …]
|
| D | SmallPtrSet.cpp | 65 const void **Bucket = const_cast<const void**>(FindBucketFor(Ptr)); in insert_imp() local
66 if (*Bucket == Ptr) return false; // Already inserted, good. in insert_imp()
69 if (*Bucket == getTombstoneMarker()) in insert_imp()
71 *Bucket = Ptr; in insert_imp()
93 void **Bucket = const_cast<void**>(FindBucketFor(Ptr)); in erase_imp() local
94 if (*Bucket != Ptr) return false; // Not in the set? in erase_imp()
97 *Bucket = getTombstoneMarker(); in erase_imp()
104 unsigned Bucket = Hash(Ptr); in FindBucketFor() local
111 if (Array[Bucket] == Ptr) in FindBucketFor()
112 return Array+Bucket; in FindBucketFor()
[all …]
|
| D | StringMap.cpp | 67 ItemBucket &Bucket = TheTable[BucketNo]; in LookupBucketFor() local
68 StringMapEntryBase *BucketItem = Bucket.Item; in LookupBucketFor()
78 Bucket.FullHashValue = FullHashValue; in LookupBucketFor()
85 } else if (Bucket.FullHashValue == FullHashValue) { in LookupBucketFor()
121 ItemBucket &Bucket = TheTable[BucketNo]; in FindKey() local
122 StringMapEntryBase *BucketItem = Bucket.Item; in FindKey()
129 } else if (Bucket.FullHashValue == FullHashValue) { in FindKey()
165 int Bucket = FindKey(Key); in RemoveKey() local
166 if (Bucket == -1) return 0; in RemoveKey()
168 StringMapEntryBase *Result = TheTable[Bucket].Item; in RemoveKey()
[all …]
|
| /external/llvm/include/llvm/ADT/ |
| D | StringMap.h | 290 int Bucket = FindKey(Key); in find() local
291 if (Bucket == -1) return end(); in find()
292 return iterator(TheTable+Bucket); in find()
296 int Bucket = FindKey(Key); in find() local
297 if (Bucket == -1) return end(); in find()
298 return const_iterator(TheTable+Bucket); in find()
323 ItemBucket &Bucket = TheTable[BucketNo]; in insert() local
324 if (Bucket.Item && Bucket.Item != getTombstoneVal()) in insert()
327 if (Bucket.Item == getTombstoneVal()) in insert()
329 Bucket.Item = KeyValue; in insert()
[all …]
|
| D | SmallPtrSet.h | 147 const void *const *Bucket;
149 explicit SmallPtrSetIteratorImpl(const void *const *BP) : Bucket(BP) { in SmallPtrSetIteratorImpl()
154 return Bucket == RHS.Bucket;
157 return Bucket != RHS.Bucket;
165 while (*Bucket == SmallPtrSetImpl::getEmptyMarker() || in AdvanceIfNotValid()
166 *Bucket == SmallPtrSetImpl::getTombstoneMarker()) in AdvanceIfNotValid()
167 ++Bucket; in AdvanceIfNotValid()
189 return PtrTraits::getFromVoidPointer(const_cast<void*>(*Bucket));
193 ++Bucket;
|
| D | FoldingSet.h | 526 FoldingSetIteratorImpl(void **Bucket);
542 explicit FoldingSetIterator(void **Bucket) : FoldingSetIteratorImpl(Bucket) {} in FoldingSetIterator() argument
570 explicit FoldingSetBucketIteratorImpl(void **Bucket);
572 FoldingSetBucketIteratorImpl(void **Bucket, bool) in FoldingSetBucketIteratorImpl() argument
573 : Ptr(Bucket) {} in FoldingSetBucketIteratorImpl()
594 explicit FoldingSetBucketIterator(void **Bucket) : in FoldingSetBucketIterator() argument
595 FoldingSetBucketIteratorImpl(Bucket) {} in FoldingSetBucketIterator()
597 FoldingSetBucketIterator(void **Bucket, bool) : in FoldingSetBucketIterator() argument
598 FoldingSetBucketIteratorImpl(Bucket, true) {} in FoldingSetBucketIterator()
|
| D | DenseMap.h | 483 typedef std::pair<KeyT, ValueT> Bucket; typedef
489 typedef typename conditional<IsConst, const Bucket, Bucket>::type value_type;
|
| /external/webkit/Source/WebKit/android/jni/ |
| D | PictureSet.h | 65 typedef WTF::Vector<BucketPicture> Bucket; typedef
66 typedef WTF::HashMap<BucketPosition , Bucket* > BucketMap;
77 void displayBucket(Bucket* bucket);
79 WTF::Vector<Bucket*>* bucketsToUpdate() { return &mUpdatedBuckets; } in bucketsToUpdate()
80 Bucket* getBucket(int x, int y);
81 void addToBucket(Bucket* bucket, int dx, int dy, SkIRect& rect);
82 void gatherBucketsForArea(WTF::Vector<Bucket*>& list, const SkIRect& rect);
119 WTF::Vector<Bucket*> mUpdatedBuckets;
|
| D | PictureSet.cpp | 113 WTF::Vector<Bucket*>* buckets = bucketsToUpdate(); in PictureSet()
115 Bucket* bucket = (*buckets)[i]; in PictureSet()
188 Bucket* PictureSet::getBucket(int x, int y) in getBucket()
198 Bucket* bucket = new Bucket(); in getBucket()
204 void PictureSet::displayBucket(Bucket* bucket) in displayBucket()
234 void PictureSet::addToBucket(Bucket* bucket, int dx, int dy, SkIRect& rect) in addToBucket()
346 void PictureSet::gatherBucketsForArea(WTF::Vector<Bucket*>& list, const SkIRect& rect) in gatherBucketsForArea()
367 Bucket* bucket = getBucket(i, j); in gatherBucketsForArea()
404 Bucket* bucket = getBucket(i, j); in splitAdd()
674 Bucket* bucket = iter->second; in clear()
[all …]
|
| D | WebViewCore.cpp | 907 WTF::Vector<Bucket*>* buckets = pictureSet->bucketsToUpdate(); in rebuildPictureSet()
910 Bucket* bucket = (*buckets)[i]; in rebuildPictureSet()
|
| /external/chromium/chrome/browser/extensions/ |
| D | extensions_quota_service.h | 101 class Bucket {
103 Bucket() : num_tokens_(0) {} in Bucket() function
122 DISALLOW_COPY_AND_ASSIGN(Bucket);
124 typedef std::list<Bucket*> BucketList;
159 virtual bool Apply(Bucket* bucket, const base::TimeTicks& event_time) = 0;
178 virtual bool Apply(Bucket* bucket, const base::TimeTicks& event_time);
189 virtual bool Apply(Bucket* bucket, const base::TimeTicks& event_time);
|
| D | extensions_quota_service_unittest.cc | 14 typedef QuotaLimitHeuristic::Bucket Bucket; typedef
37 buckets_[id] = new Bucket(); in GetBucketsForArgs()
42 typedef std::map<int, Bucket*> BucketMap;
116 Bucket* b, in DoMoreThan2PerMinuteFor5Minutes()
141 Bucket b; in TEST_F()
160 Bucket bucket; in TEST_F()
|
| D | extensions_quota_service.cc | 80 void QuotaLimitHeuristic::Bucket::Reset(const Config& config, in Reset()
114 bool ExtensionsQuotaService::TimedLimit::Apply(Bucket* bucket, in Apply()
122 bool ExtensionsQuotaService::SustainedLimit::Apply(Bucket* bucket, in Apply()
|
| D | extension_bookmarks_module.cc | 41 typedef QuotaLimitHeuristic::Bucket Bucket; typedef
642 Bucket* GetBucket(const BucketIdType& id) { in GetBucket()
643 Bucket* b = buckets_[id]; in GetBucket()
645 b = new Bucket(); in GetBucket()
651 std::map<BucketIdType, Bucket*> buckets_;
|
| /external/clang/include/clang/Basic/ |
| D | OnDiskHashTable.h | 132 class Bucket {
138 Bucket() {} in Bucket() function
141 Bucket* Buckets;
144 void insert(Bucket* b, size_t size, Item* E) { in insert()
146 Bucket& B = b[idx]; in insert()
153 Bucket* newBuckets = (Bucket*) std::calloc(newsize, sizeof(Bucket)); in resize()
195 Bucket& B = Buckets[i]; in Emit()
230 Buckets = (Bucket*) std::calloc(NumBuckets, sizeof(Bucket)); in OnDiskChainedHashTableGenerator()
294 const unsigned char* Bucket = Buckets + sizeof(uint32_t)*idx; variable
296 unsigned offset = ReadLE32(Bucket);
|
| /external/clang/lib/Lex/ |
| D | HeaderMap.cpp | 213 for (unsigned Bucket = HashHMapKey(Filename);; ++Bucket) { in LookupFile() local
214 HMapBucket B = getBucket(Bucket & (NumBuckets-1)); in LookupFile()
|
| /external/iproute2/examples/diffserv/ |
| D | README | 17 EF PHB using the PRIO scheduler, Token Bucket to rate control EF,
|