Searched defs:Bucket (Results 1 - 25 of 32) sorted by relevance

12

/external/chromium_org/third_party/tcmalloc/chromium/src/
H A Dstack_trace_table.h64 struct Bucket { struct in class:tcmalloc::StackTraceTable
71 Bucket* next;
86 Bucket** table_;
H A Dprofiledata.h160 struct Bucket { struct in class:ProfileData
164 Bucket* hash_; // hash table
H A Ddeep-heap-profile.h80 typedef HeapProfileTable::Bucket Bucket; typedef in class:DeepHeapProfile
219 // Contains extended information for HeapProfileTable::Bucket. These objects
221 // a Bucket and other additional information.
227 Bucket* bucket;
248 DeepBucket* Lookup(Bucket* bucket,
H A Dheap-profile-table.h237 typedef HeapProfileBucket Bucket; typedef in class:HeapProfileTable
242 Bucket* bucket() const {
243 return reinterpret_cast<Bucket*>(bucket_rep & ~uintptr_t(kMask));
246 void set_bucket(Bucket* b) { bucket_rep = reinterpret_cast<uintptr_t>(b); }
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,
455 // but make it a Bucket t
[all...]
/external/chromium_org/third_party/tcmalloc/vendor/src/
H A Dstack_trace_table.h64 struct Bucket { struct in class:tcmalloc::StackTraceTable
71 Bucket* next;
86 Bucket** table_;
H A Dprofiledata.h160 struct Bucket { struct in class:ProfileData
164 Bucket* hash_; // hash table
H A Dheap-profile-table.h206 struct Bucket : public Stats { struct in class:HeapProfileTable
210 Bucket* next; // Next entry in hash-table
216 Bucket* bucket() const {
217 return reinterpret_cast<Bucket*>(bucket_rep & ~uintptr_t(kMask));
220 void set_bucket(Bucket* b) { bucket_rep = reinterpret_cast<uintptr_t>(b); }
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** MakeSortedBucketLis
[all...]
/external/chromium_org/gpu/command_buffer/service/
H A Dcommon_decoder.h51 class GPU_EXPORT Bucket { class in class:gpu::CommonDecoder
53 Bucket();
54 ~Bucket();
94 DISALLOW_COPY_AND_ASSIGN(Bucket);
108 Bucket* CreateBucket(uint32 bucket_id);
111 Bucket* GetBucket(uint32 bucket_id) const;
168 typedef std::map<uint32, linked_ptr<Bucket> > BucketMap;
H A Dcommon_decoder.cc10 CommonDecoder::Bucket::Bucket() : size_(0) {} function in class:gpu::CommonDecoder::Bucket
12 CommonDecoder::Bucket::~Bucket() {}
14 void* CommonDecoder::Bucket::GetData(size_t offset, size_t size) const {
21 void CommonDecoder::Bucket::SetSize(size_t size) {
29 bool CommonDecoder::Bucket::SetData(
38 void CommonDecoder::Bucket::SetFromString(const char* str) {
50 bool CommonDecoder::Bucket::GetAsString(std::string* str) {
86 CommonDecoder::Bucket* CommonDecode
[all...]
/external/chromium_org/tools/deep_memory_profiler/lib/
H A Dbucket.py17 class Bucket(object): class in inherits:object
164 self._buckets[int(words[0])] = Bucket(
/external/llvm/include/llvm/Support/
H A DArrayRecycler.h39 SmallVector<FreeList*, 8> Bucket; member in class:llvm::ArrayRecycler
41 // Remove an entry from the free list in Bucket[Idx] and return it.
44 if (Idx >= Bucket.size())
46 FreeList *Entry = Bucket[Idx];
49 Bucket[Idx] = Entry->Next;
53 // Add an entry to the free list at Bucket[Idx].
59 if (Idx >= Bucket.size())
60 Bucket.resize(size_t(Idx) + 1);
61 Entry->Next = Bucket[Idx];
62 Bucket[Id
[all...]
/external/chromium/chrome/browser/extensions/
H A Dextensions_quota_service.h7 // represented by a 'Bucket' that holds state for that item for one single
11 // arguments to a unique Bucket (the BucketMapper), and another to determine
80 // (represented by its Bucket) constitutes a quota violation.
84 // Bucket objects (see Below) and how often they are replenished.
94 // A Bucket is how the heuristic portrays an individual item (since quota
101 class Bucket { class in class:QuotaLimitHeuristic
103 Bucket() : num_tokens_(0) {} function in class:QuotaLimitHeuristic::Bucket
122 DISALLOW_COPY_AND_ASSIGN(Bucket);
124 typedef std::list<Bucket*> BucketList;
159 virtual bool Apply(Bucket* bucke
[all...]
H A Dextensions_quota_service_unittest.cc14 typedef QuotaLimitHeuristic::Bucket Bucket; typedef
37 buckets_[id] = new Bucket();
42 typedef std::map<int, Bucket*> BucketMap;
116 Bucket* b,
141 Bucket b;
160 Bucket bucket;
/external/chromium_org/third_party/jinja2/
H A Dbccache.py62 class Bucket(object): class in inherits:object
117 these methods are passed a :class:`~jinja2.bccache.Bucket`.
183 bucket = Bucket(environment, key, checksum)
/external/chromium_org/tools/deep_memory_profiler/tests/
H A Ddmprof_test.py16 from lib.bucket import Bucket namespace
175 bucket1 = Bucket([0x1212, 0x013], 'malloc', 0x29492, '_Z')
177 bucket2 = Bucket([0x18242, 0x1381], 'malloc', 0x9492, '_Z')
179 bucket3 = Bucket([0x18242, 0x181], 'malloc', 0x949, '_Z')
/external/jmonkeyengine/engine/src/core/com/jme3/renderer/queue/
H A DRenderQueue.java71 * The render queue <code>Bucket</code> specifies the bucket
76 * via {@link Spatial#setQueueBucket(com.jme3.renderer.queue.RenderQueue.Bucket) }.
78 public enum Bucket { enum in class:RenderQueue
178 * <li>Bucket.Opaque: {@link com.jme3.renderer.queue.OpaqueComparator} which sorts
180 * <li>Bucket.Transparent: {@link com.jme3.renderer.queue.TransparentComparator} which
182 * <li>Bucket.Translucent: {@link com.jme3.renderer.queue.TransparentComparator} which
184 * <li>Bucket.Sky: {@link com.jme3.renderer.queue.NullComparator} which does no sorting
186 * <li>Bucket.Gui: {@link com.jme3.renderer.queue.GuiComparator} sorts geometries back to
189 public void setGeometryComparator(Bucket bucket, GeometryComparator c) {
255 public void addToQueue(Geometry g, Bucket bucke
[all...]
/external/llvm/include/llvm/ADT/
H A DSmallPtrSet.h144 const void *const *Bucket; member in class:llvm::SmallPtrSetIteratorImpl
148 : Bucket(BP), End(E) {
153 return Bucket == RHS.Bucket;
156 return Bucket != RHS.Bucket;
164 assert(Bucket <= End);
165 while (Bucket != End &&
166 (*Bucket == SmallPtrSetImpl::getEmptyMarker() ||
167 *Bucket
[all...]
H A DFoldingSet.h641 FoldingSetIteratorImpl(void **Bucket);
657 explicit FoldingSetIterator(void **Bucket) : FoldingSetIteratorImpl(Bucket) {} argument
685 explicit FoldingSetBucketIteratorImpl(void **Bucket);
687 FoldingSetBucketIteratorImpl(void **Bucket, bool) argument
688 : Ptr(Bucket) {}
709 explicit FoldingSetBucketIterator(void **Bucket) : argument
710 FoldingSetBucketIteratorImpl(Bucket) {}
712 FoldingSetBucketIterator(void **Bucket, bool) : argument
713 FoldingSetBucketIteratorImpl(Bucket, tru
[all...]
/external/llvm/lib/Support/
H A DStringMap.cpp168 int Bucket = FindKey(Key); local
169 if (Bucket == -1) return 0;
171 StringMapEntryBase *Result = TheTable[Bucket];
172 TheTable[Bucket] = getTombstoneVal();
210 StringMapEntryBase *Bucket = TheTable[I]; local
211 if (Bucket && Bucket != getTombstoneVal()) {
216 NewTableArray[FullHash & (NewSize-1)] = Bucket;
228 NewTableArray[NewBucket] = Bucket;
H A DFoldingSet.cpp285 void **Bucket = GetBucketFor(IDHash, Buckets, NumBuckets); local
286 void *Probe = *Bucket;
300 InsertPos = Bucket;
319 void **Bucket = static_cast<void**>(InsertPos); local
321 void *Next = *Bucket;
327 Next = reinterpret_cast<void*>(reinterpret_cast<intptr_t>(Bucket)|1);
331 *Bucket = N;
361 void **Bucket = GetBucketPtr(Ptr); local
362 Ptr = *Bucket;
367 *Bucket
390 FoldingSetIteratorImpl(void **Bucket) argument
407 void **Bucket = GetBucketPtr(Probe); local
422 FoldingSetBucketIteratorImpl(void **Bucket) argument
[all...]
/external/chromium_org/chrome/browser/extensions/
H A Dextensions_quota_service.h7 // represented by a 'Bucket' that holds state for that item for one single
11 // arguments to a unique Bucket (the BucketMapper), and another to determine
98 // (represented by its Bucket) constitutes a quota violation.
102 // Bucket objects (see Below) and how often they are replenished.
112 // A Bucket is how the heuristic portrays an individual item (since quota
119 class Bucket { class in class:QuotaLimitHeuristic
121 Bucket() : num_tokens_(0) {} function in class:QuotaLimitHeuristic::Bucket
140 DISALLOW_COPY_AND_ASSIGN(Bucket);
142 typedef std::list<Bucket*> BucketList;
169 Bucket bucket
[all...]
H A Dextensions_quota_service_unittest.cc18 typedef QuotaLimitHeuristic::Bucket Bucket; typedef
43 buckets_[id] = new Bucket();
48 typedef std::map<int, Bucket*> BucketMap;
151 Bucket* b,
176 Bucket b;
196 Bucket bucket;
/external/chromium_org/gpu/command_buffer/client/
H A Dquery_tracker.h31 struct Bucket { struct in class:gpu::gles2::QuerySyncManager
32 explicit Bucket(QuerySync* sync_mem) function in struct:gpu::gles2::QuerySyncManager::Bucket
40 QueryInfo(Bucket* bucket, int32 id, uint32 offset, QuerySync* sync_mem)
54 Bucket* bucket;
69 std::deque<Bucket*> buckets_;
/external/compiler-rt/lib/ubsan/
H A Dubsan_type_hash.cc213 HashValue *Bucket = getTypeCacheHashTableBucket(Hash); local
214 if (*Bucket == Hash) {
235 *Bucket = Hash;
/external/clang/include/clang/Basic/
H A DOnDiskHashTable.h132 class Bucket { class in class:clang::OnDiskChainedHashTableGenerator
138 Bucket() {} function in class:clang::OnDiskChainedHashTableGenerator::Bucket
141 Bucket* Buckets;
144 void insert(Bucket* b, size_t size, Item* E) {
146 Bucket& B = b[idx];
153 Bucket* newBuckets = (Bucket*) std::calloc(newsize, sizeof(Bucket));
195 Bucket& B = Buckets[i];
204 assert(B.length != 0 && "Bucket ha
295 const unsigned char* Bucket = Buckets + sizeof(uint32_t)*idx; local
[all...]

Completed in 1494 milliseconds

12