| /external/llvm/lib/Support/ |
| D | FoldingSet.cpp | 285 void **Bucket = GetBucketFor(IDHash, 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 | 63 const void **Bucket = const_cast<const void**>(FindBucketFor(Ptr)); in insert_imp() local
64 if (*Bucket == Ptr) return false; // Already inserted, good. in insert_imp()
67 if (*Bucket == getTombstoneMarker()) in insert_imp()
69 *Bucket = Ptr; in insert_imp()
91 void **Bucket = const_cast<void**>(FindBucketFor(Ptr)); in erase_imp() local
92 if (*Bucket != Ptr) return false; // Not in the set? in erase_imp()
95 *Bucket = getTombstoneMarker(); in erase_imp()
102 unsigned Bucket = DenseMapInfo<void *>::getHashValue(Ptr) & (CurArraySize-1); in FindBucketFor() local
109 if (Array[Bucket] == Ptr) in FindBucketFor()
110 return Array+Bucket; in FindBucketFor()
[all …]
|
| D | StringMap.cpp | 168 int Bucket = FindKey(Key); in RemoveKey() local
169 if (Bucket == -1) return nullptr; in RemoveKey()
171 StringMapEntryBase *Result = TheTable[Bucket]; in RemoveKey()
172 TheTable[Bucket] = getTombstoneVal(); in RemoveKey()
211 StringMapEntryBase *Bucket = TheTable[I]; in RehashTable() local
212 if (Bucket && Bucket != getTombstoneVal()) { in RehashTable()
217 NewTableArray[FullHash & (NewSize-1)] = Bucket; in RehashTable()
231 NewTableArray[NewBucket] = Bucket; in RehashTable()
|
| /external/llvm/include/llvm/Support/ |
| D | ArrayRecycler.h | 41 SmallVector<FreeList*, 8> Bucket; variable
46 if (Idx >= Bucket.size()) in pop()
48 FreeList *Entry = Bucket[Idx]; in pop()
51 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()
97 assert(Bucket.empty() && "Non-empty ArrayRecycler deleted!"); in ~ArrayRecycler()
104 for (; !Bucket.empty(); Bucket.pop_back()) in clear()
[all …]
|
| D | OnDiskHashTable.h | 78 class Bucket {
84 Bucket() {} in Bucket() function
87 Bucket *Buckets;
91 void insert(Bucket *Buckets, size_t Size, Item *E) { in insert()
92 Bucket &B = Buckets[E->Hash & (Size - 1)]; in insert()
100 Bucket *NewBuckets = (Bucket *)std::calloc(NewSize, sizeof(Bucket)); in resize()
150 Bucket &B = Buckets[I]; in Emit()
193 Buckets = (Bucket *)std::calloc(NumBuckets, sizeof(Bucket)); in OnDiskChainedHashTableGenerator()
296 const unsigned char *Bucket = Buckets + sizeof(offset_type) * Idx; variable
298 offset_type Offset = endian::readNext<offset_type, little, aligned>(Bucket);
|
| /external/llvm/include/llvm/ADT/ |
| D | StringMap.h | 278 int Bucket = FindKey(Key); in find() local
279 if (Bucket == -1) return end(); in find()
280 return iterator(TheTable+Bucket, true); in find()
284 int Bucket = FindKey(Key); in find() local
285 if (Bucket == -1) return end(); in find()
286 return const_iterator(TheTable+Bucket, true); in find()
312 StringMapEntryBase *&Bucket = TheTable[BucketNo]; in insert() local
313 if (Bucket && Bucket != getTombstoneVal()) in insert()
316 if (Bucket == getTombstoneVal()) in insert()
318 Bucket = KeyValue; in insert()
[all …]
|
| D | SmallPtrSet.h | 148 const void *const *Bucket;
152 : Bucket(BP), End(E) { in SmallPtrSetIteratorImpl()
157 return Bucket == RHS.Bucket;
160 return Bucket != RHS.Bucket;
168 assert(Bucket <= End); in AdvanceIfNotValid()
169 while (Bucket != End && in AdvanceIfNotValid()
170 (*Bucket == SmallPtrSetImplBase::getEmptyMarker() || in AdvanceIfNotValid()
171 *Bucket == SmallPtrSetImplBase::getTombstoneMarker())) in AdvanceIfNotValid()
172 ++Bucket; in AdvanceIfNotValid()
194 assert(Bucket < End);
[all …]
|
| D | FoldingSet.h | 645 FoldingSetIteratorImpl(void **Bucket);
661 explicit FoldingSetIterator(void **Bucket) : FoldingSetIteratorImpl(Bucket) {} in FoldingSetIterator() argument
689 explicit FoldingSetBucketIteratorImpl(void **Bucket);
691 FoldingSetBucketIteratorImpl(void **Bucket, bool) in FoldingSetBucketIteratorImpl() argument
692 : Ptr(Bucket) {} in FoldingSetBucketIteratorImpl()
713 explicit FoldingSetBucketIterator(void **Bucket) : in FoldingSetBucketIterator() argument
714 FoldingSetBucketIteratorImpl(Bucket) {} in FoldingSetBucketIterator()
716 FoldingSetBucketIterator(void **Bucket, bool) : in FoldingSetBucketIterator() argument
717 FoldingSetBucketIteratorImpl(Bucket, true) {} in FoldingSetBucketIterator()
|
| /external/chromium_org/third_party/tcmalloc/vendor/src/ |
| D | heap-profile-table.h | 206 struct Bucket : public Stats { struct
210 Bucket* next; // Next entry in hash-table argument
216 Bucket* bucket() const { in bucket()
217 return reinterpret_cast<Bucket*>(bucket_rep & ~uintptr_t(kMask)); in bucket()
220 void set_bucket(Bucket* b) { bucket_rep = reinterpret_cast<uintptr_t>(b); } in set_bucket()
272 static int UnparseBucket(const Bucket& b,
281 void DeallocateBucketTable(Bucket** table);
287 Bucket* GetBucket(int depth, const void* const key[], Bucket** table,
316 Bucket** MakeSortedBucketList() const;
336 const Bucket& total,
[all …]
|
| D | heap-profile-table.cc | 132 alloc_table_ = reinterpret_cast<Bucket**>(alloc_(alloc_table_bytes)); in HeapProfileTable()
164 void HeapProfileTable::DeallocateBucketTable(Bucket** table) { in DeallocateBucketTable()
167 for (Bucket* x = table[b]; x != 0; /**/) { in DeallocateBucketTable()
168 Bucket* b = x; in DeallocateBucketTable()
178 HeapProfileTable::Bucket* HeapProfileTable::GetBucket( in GetBucket()
179 int depth, const void* const key[], Bucket** table, in GetBucket()
193 for (Bucket* b = table[buck]; b != 0; b = b->next) { in GetBucket()
205 Bucket* b = reinterpret_cast<Bucket*>(alloc_(sizeof(Bucket))); in GetBucket()
227 Bucket* b = GetBucket(stack_depth, call_stack, alloc_table_, in RecordAlloc()
243 Bucket* b = v.bucket(); in RecordFree()
[all …]
|
| D | stack_trace_table.cc | 44 bool StackTraceTable::Bucket::KeyEqual(uintptr_t h, in KeyEqual()
59 table_(new Bucket*[kHashTableSize]()) { in StackTraceTable()
60 memset(table_, 0, kHashTableSize * sizeof(Bucket*)); in StackTraceTable()
84 Bucket* b = table_[idx]; in AddTrace()
127 Bucket* b = table_[i]; in ReadStackTracesAndClear()
147 Bucket* b = table_[i]; in ReadStackTracesAndClear()
149 Bucket* next = b->next; in ReadStackTracesAndClear()
|
| D | stack_trace_table.h | 64 struct Bucket { struct
71 Bucket* next; argument
86 Bucket** table_;
|
| /external/chromium_org/gpu/command_buffer/service/ |
| D | common_decoder.cc | 10 CommonDecoder::Bucket::Bucket() : size_(0) {} in Bucket() function in gpu::CommonDecoder::Bucket
12 CommonDecoder::Bucket::~Bucket() {} in ~Bucket()
14 void* CommonDecoder::Bucket::GetData(size_t offset, size_t size) const { in GetData()
21 void CommonDecoder::Bucket::SetSize(size_t size) { in SetSize()
29 bool CommonDecoder::Bucket::SetData( in SetData()
38 void CommonDecoder::Bucket::SetFromString(const char* str) { in SetFromString()
50 bool CommonDecoder::Bucket::GetAsString(std::string* str) { in GetAsString()
83 CommonDecoder::Bucket* CommonDecoder::GetBucket(uint32 bucket_id) const { in GetBucket()
88 CommonDecoder::Bucket* CommonDecoder::CreateBucket(uint32 bucket_id) { in CreateBucket()
89 Bucket* bucket = GetBucket(bucket_id); in CreateBucket()
[all …]
|
| D | common_decoder.h | 51 class GPU_EXPORT Bucket { in NON_EXPORTED_BASE()
53 Bucket(); in NON_EXPORTED_BASE()
54 ~Bucket(); in NON_EXPORTED_BASE()
94 DISALLOW_COPY_AND_ASSIGN(Bucket); in NON_EXPORTED_BASE()
108 Bucket* CreateBucket(uint32 bucket_id); in NON_EXPORTED_BASE()
111 Bucket* GetBucket(uint32 bucket_id) const; in NON_EXPORTED_BASE()
168 typedef std::map<uint32, linked_ptr<Bucket> > BucketMap; in NON_EXPORTED_BASE()
|
| /external/chromium_org/third_party/tcmalloc/chromium/src/ |
| D | heap-profile-table.h | 237 typedef HeapProfileBucket Bucket; typedef
242 Bucket* bucket() const { in bucket()
243 return reinterpret_cast<Bucket*>(bucket_rep & ~uintptr_t(kMask)); in bucket()
246 void set_bucket(Bucket* b) { bucket_rep = reinterpret_cast<uintptr_t>(b); } in set_bucket()
366 static int UnparseBucket(const Bucket& b,
373 Bucket* GetBucket(int depth, const void* const key[]);
389 inline static void DumpBucketIterator(const Bucket* bucket,
425 Bucket** MakeSortedBucketList() const;
445 const Bucket& total,
456 Bucket total_;
[all …]
|
| D | heap-profile-table.cc | 141 bucket_table_ = static_cast<Bucket**>(alloc_(table_bytes)); in HeapProfileTable()
161 for (Bucket* curr = bucket_table_[i]; curr != 0; /**/) { in ~HeapProfileTable()
162 Bucket* bucket = curr; in ~HeapProfileTable()
172 HeapProfileTable::Bucket* HeapProfileTable::GetBucket(int depth, in GetBucket()
186 for (Bucket* b = bucket_table_[buck]; b != 0; b = b->next) { in GetBucket()
198 Bucket* b = reinterpret_cast<Bucket*>(alloc_(sizeof(Bucket))); in GetBucket()
218 Bucket* b = GetBucket(stack_depth, call_stack); in RecordAlloc()
233 Bucket* b = v.bucket(); in RecordFree()
302 int HeapProfileTable::UnparseBucket(const Bucket& b, in UnparseBucket()
335 HeapProfileTable::Bucket**
[all …]
|
| D | stack_trace_table.cc | 44 bool StackTraceTable::Bucket::KeyEqual(uintptr_t h, in KeyEqual()
59 table_(new Bucket*[kHashTableSize]()) { in StackTraceTable()
60 memset(table_, 0, kHashTableSize * sizeof(Bucket*)); in StackTraceTable()
84 Bucket* b = table_[idx]; in AddTrace()
127 Bucket* b = table_[i]; in ReadStackTracesAndClear()
147 Bucket* b = table_[i]; in ReadStackTracesAndClear()
149 Bucket* next = b->next; in ReadStackTracesAndClear()
|
| D | stack_trace_table.h | 64 struct Bucket { struct
71 Bucket* next; argument
86 Bucket** table_;
|
| /external/chromium_org/extensions/browser/ |
| D | quota_service.h | 118 class Bucket {
120 Bucket() : num_tokens_(0) {} in Bucket() function
140 DISALLOW_COPY_AND_ASSIGN(Bucket);
142 typedef std::list<Bucket*> BucketList;
169 Bucket bucket_;
194 virtual bool Apply(Bucket* bucket, const base::TimeTicks& event_time) = 0;
216 virtual bool Apply(Bucket* bucket,
229 virtual bool Apply(Bucket* bucket,
|
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/ |
| D | bisect_test_ordering.py | 43 class Bucket(object): class
62 self.buckets = [Bucket([self.expected_failure])]
72 self.buckets = [Bucket(self.tests[:-1]), Bucket([self.expected_failure])]
81 return self.test_bucket_list_fails([Bucket([self.expected_failure])])
122 first_half = Bucket(bucket_to_split.tests[:halfway_point])
123 second_half = Bucket(bucket_to_split.tests[halfway_point:])
|
| /external/chromium_org/third_party/icu/source/i18n/unicode/ |
| D | alphaindex.h | 190 class Bucket;
200 class U_I18N_API Bucket : public UObject {
206 virtual ~Bucket();
230 Bucket *displayBucket_;
234 Bucket(const UnicodeString &label, // Parameter strings are copied.
282 const Bucket *getBucket(int32_t index) const;
730 Bucket *currentBucket_; // While an iteration of the index in underway,
|
| /external/chromium_org/gpu/command_buffer/client/ |
| D | query_tracker.h | 32 struct Bucket { struct
33 explicit Bucket(QuerySync* sync_mem) in Bucket() argument
41 QueryInfo(Bucket* bucket, int32 id, uint32 offset, QuerySync* sync_mem) in QueryInfo() argument
55 Bucket* bucket;
70 std::deque<Bucket*> buckets_;
|
| /external/icu/icu4c/source/i18n/unicode/ |
| D | alphaindex.h | 196 class U_I18N_API Bucket : public UObject {
202 virtual ~Bucket();
226 Bucket *displayBucket_;
230 Bucket(const UnicodeString &label, // Parameter strings are copied.
278 const Bucket *getBucket(int32_t index) const;
721 Bucket *currentBucket_; // While an iteration of the index in underway,
|
| /external/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 *
437 Bucket *asciiBuckets[26] = { in createBucketList()
441 Bucket *pinyinBuckets[26] = { in createBucketList()
455 Bucket *bucket = new Bucket(getUnderflowLabel(), emptyString_, U_ALPHAINDEX_UNDERFLOW); in createBucketList()
485 bucket = new Bucket(getInflowLabel(), inflowBoundary, U_ALPHAINDEX_INFLOW); in createBucketList()
494 bucket = new Bucket(fixLabel(current, temp), current, U_ALPHAINDEX_NORMAL); in createBucketList()
[all …]
|
| /external/chromium_org/third_party/icu/source/i18n/ |
| D | alphaindex.cpp | 81 inline AlphabeticIndex::Bucket *getBucket(const UVector &list, int32_t i) { in getBucket()
82 return static_cast<AlphabeticIndex::Bucket *>(list[i]); in getBucket()
150 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, i); in getBucketIndex()
159 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, start); in getBucketIndex()
195 const AlphabeticIndex::Bucket *
443 Bucket *asciiBuckets[26] = { in createBucketList()
447 Bucket *pinyinBuckets[26] = { in createBucketList()
461 Bucket *bucket = new Bucket(getUnderflowLabel(), emptyString_, U_ALPHAINDEX_UNDERFLOW); in createBucketList()
491 bucket = new Bucket(getInflowLabel(), inflowBoundary, U_ALPHAINDEX_INFLOW); in createBucketList()
500 bucket = new Bucket(fixLabel(current, temp), current, U_ALPHAINDEX_NORMAL); in createBucketList()
[all …]
|