/external/llvm/include/llvm/Support/ |
ArrayRecycler.h | 39 SmallVector<FreeList*, 8> Bucket; 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[Idx] = Entry [all...] |
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
stack_trace_table.h | 64 struct Bucket { 71 Bucket* next; 86 Bucket** table_;
|
profiledata.h | 159 // Hash table bucket 160 struct Bucket { 164 Bucket* hash_; // hash table
|
static_vars.h | 81 static PageHeapAllocator<StackTraceTable::Bucket>* bucket_allocator() { 98 static PageHeapAllocator<StackTraceTable::Bucket> bucket_allocator_;
|
heap-profile-table.h | 235 // Hash table bucket to hold (de)allocation stats 237 typedef HeapProfileBucket Bucket; 241 // Access to the stack-trace bucket 242 Bucket* bucket() const { function in struct:HeapProfileTable::AllocValue 243 return reinterpret_cast<Bucket*>(bucket_rep & ~uintptr_t(kMask)); 246 void set_bucket(Bucket* b) { bucket_rep = reinterpret_cast<uintptr_t>(b); } 355 // Unparse bucket b and print its portion of profile dump into buf. 361 // counting bucket b. 363 // "extra" is appended to the unparsed bucket. Typically it is empty [all...] |
stack_trace_table.cc | 44 bool StackTraceTable::Bucket::KeyEqual(uintptr_t h, 59 table_(new Bucket*[kHashTableSize]()) { 60 memset(table_, 0, kHashTableSize * sizeof(Bucket*)); 84 Bucket* b = table_[idx]; 97 "tcmalloc: could not allocate bucket", sizeof(*b)); 127 Bucket* b = table_[i]; 147 Bucket* b = table_[i]; 149 Bucket* next = b->next;
|
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
stack_trace_table.h | 64 struct Bucket { 71 Bucket* next; 86 Bucket** table_;
|
heap-profile-table.h | 204 // Hash table bucket to hold (de)allocation stats 206 struct Bucket : public Stats { 210 Bucket* next; // Next entry in hash-table 215 // Access to the stack-trace bucket 216 Bucket* bucket() const { function in struct:HeapProfileTable::AllocValue 217 return reinterpret_cast<Bucket*>(bucket_rep & ~uintptr_t(kMask)); 220 void set_bucket(Bucket* b) { bucket_rep = reinterpret_cast<uintptr_t>(b); } 261 // Unparse bucket b and print its portion of profile dump into buf. 267 // counting bucket b [all...] |
profiledata.h | 159 // Hash table bucket 160 struct Bucket { 164 Bucket* hash_; // hash table
|
static_vars.h | 81 static PageHeapAllocator<StackTraceTable::Bucket>* bucket_allocator() { 98 static PageHeapAllocator<StackTraceTable::Bucket> bucket_allocator_;
|
heap-profile-table.cc | 132 alloc_table_ = reinterpret_cast<Bucket**>(alloc_(alloc_table_bytes)); 164 void HeapProfileTable::DeallocateBucketTable(Bucket** table) { 167 for (Bucket* x = table[b]; x != 0; /**/) { 168 Bucket* b = x; 178 HeapProfileTable::Bucket* HeapProfileTable::GetBucket( 179 int depth, const void* const key[], Bucket** table, 193 for (Bucket* b = table[buck]; b != 0; b = b->next) { 201 // Create new bucket 205 Bucket* b = reinterpret_cast<Bucket*>(alloc_(sizeof(Bucket))) [all...] |
/system/core/libutils/ |
BasicHashtable.cpp | 29 mBucketSize(entrySize + sizeof(Bucket)), mHasTrivialDestructor(hasTrivialDestructor), 88 Bucket& bucket = bucketAt(mBuckets, i); local 89 bucket.cookie = 0; 104 const Bucket& bucket = bucketAt(mBuckets, index); local 105 if (bucket.cookie & Bucket::PRESENT) { 123 const Bucket& bucket = bucketAt(mBuckets, size_t(index)) local 139 const Bucket& bucket = bucketAt(mBuckets, size_t(index)); local 162 Bucket* bucket = &bucketAt(mBuckets, size_t(index)); local 191 Bucket& bucket = bucketAt(mBuckets, index); local 252 Bucket& bucket = bucketAt(buckets, i); local 269 Bucket& bucket = bucketAt(buckets, i); local [all...] |
/external/llvm/include/llvm/ADT/ |
SmallPtrSet.h | 144 const void *const *Bucket; 148 : Bucket(BP), End(E) { 153 return Bucket == RHS.Bucket; 156 return Bucket != RHS.Bucket; 160 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucket 161 /// that is. This is guaranteed to stop because the end() bucket is marked 164 assert(Bucket <= End) [all...] |
StringMap.h | 74 /// LookupBucketFor - Look up the bucket that the specified string should end 76 /// specified bucket will be non-null. Otherwise, it will be null. In either 77 /// case, the FullHashValue field of the bucket will be set to the hash value 81 /// FindKey - Look up the bucket that contains the specified key. If it exists 82 /// in the map, return the bucket number of the key. Otherwise return -1. 152 // Okay, the item doesn't already exist, and 'Bucket' is the bucket to fill 292 int Bucket = FindKey(Key); 293 if (Bucket == -1) return end(); 294 return iterator(TheTable+Bucket, true) [all...] |
/external/chromium_org/gpu/command_buffer/service/ |
common_decoder.h | 29 // A bucket is a buffer to help collect memory across a command buffer. When 39 // SetBucketData, SetBucketDataImmediate the client can fill a bucket. It can 40 // then call a command that uses that bucket (like BufferDataBucket in the 48 // arbitary size, the service puts the string in a bucket. The client can 49 // then query the size of a bucket and request sections of the bucket to 51 class GPU_EXPORT Bucket { 53 Bucket(); 54 ~Bucket(); 60 // Gets a pointer to a section the bucket. Returns NULL if offset or size i [all...] |
common_decoder.cc | 10 CommonDecoder::Bucket::Bucket() : size_(0) {} 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* CommonDecoder::GetBucket(uint32 bucket_id) const 92 Bucket* bucket = GetBucket(bucket_id); local 185 Bucket* bucket = CreateBucket(bucket_id); local 201 Bucket* bucket = GetBucket(bucket_id); local 222 Bucket* bucket = GetBucket(bucket_id); local 256 Bucket* bucket = GetBucket(bucket_id); local 280 Bucket* bucket = GetBucket(bucket_id); local [all...] |
/external/llvm/lib/Support/ |
FoldingSet.cpp | 184 /// GetNextPtr - In order to save space, each bucket is a 188 /// Nodes. If NextInBucketPtr is a bucket pointer, this method returns null: 191 // The low bit is set if this is the pointer back to the bucket. 202 assert((Ptr & 1) && "Not a bucket pointer"); 206 /// GetBucketFor - Hash the specified node ID and return the hash bucket for 214 /// AllocateBuckets - Allocated initialized bucket memory. 217 // Set the very last bucket to be a non-null "pointer". 236 // Set all but the last bucket to null pointers. 239 // Set the very last bucket to be a non-null "pointer". 267 // Insert the node into the new bucket, after recomputing the hash [all...] |
SmallPtrSet.cpp | 62 // Okay, we know we have space. Find a hash bucket. 63 const void **Bucket = const_cast<const void**>(FindBucketFor(Ptr)); 64 if (*Bucket == Ptr) return false; // Already inserted, good. 67 if (*Bucket == getTombstoneMarker()) 69 *Bucket = Ptr; 90 // Okay, we know we have space. Find a hash bucket. 91 void **Bucket = const_cast<void**>(FindBucketFor(Ptr)); 92 if (*Bucket != Ptr) return false; // Not in the set? 95 *Bucket = getTombstoneMarker(); 102 unsigned Bucket = DenseMapInfo<void *>::getHashValue(Ptr) & (CurArraySize-1) [all...] |
StringMap.cpp | 47 // Allocate one extra bucket, set it to look filled so the iterators stop at 53 /// LookupBucketFor - Look up the bucket that the specified string should end 55 /// specified bucket will be non-null. Otherwise, it will be null. In either 56 /// case, the FullHashValue field of the bucket will be set to the hash value 72 // If we found an empty bucket, this key isn't in the table yet, return it. 75 // empty bucket. This reduces probing. 103 // Okay, we didn't find the item. Probe to the next bucket. 113 /// FindKey - Look up the bucket that contains the specified key. If it exists 114 /// in the map, return the bucket number of the key. Otherwise return -1. 126 // If we found an empty bucket, this key isn't in the table yet, return [all...] |
/external/chromium_org/chrome/browser/extensions/ |
extensions_quota_service.h | 7 // 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. 104 // The maximum number of tokens a bucket can contain, and is refilled to 108 // Specifies how frequently the bucket is logically refilled with tokens. 112 // A Bucket is how the heuristic portrays an individual item (since quota 118 // come in). So, a bucket has an expiration to denote it has becomes stale. 119 class Bucket { 121 Bucket() : num_tokens_(0) { [all...] |
/system/core/include/utils/ |
BasicHashtable.h | 30 struct Bucket { 31 // The collision flag indicates that the bucket is part of a collision chain 32 // such that at least two entries both hash to this bucket. When true, we 36 // The present flag indicates that the bucket contains an initialized entry value. 39 // Mask for 30 bits worth of the hash code that are stored within the bucket to 74 const size_t mBucketSize; // number of bytes per bucket including the entry 83 inline const Bucket& bucketAt(const void* __restrict__ buckets, size_t index) const { 84 return *reinterpret_cast<const Bucket*>( 88 inline Bucket& bucketAt(void* __restrict__ buckets, size_t index) const { 89 return *reinterpret_cast<Bucket*>(static_cast<uint8_t*>(buckets) + index * mBucketSize) [all...] |
/external/chromium/chrome/browser/extensions/ |
extensions_quota_service.h | 7 // 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. 86 // The maximum number of tokens a bucket can contain, and is refilled to 90 // Specifies how frequently the bucket is logically refilled with tokens. 94 // A Bucket is how the heuristic portrays an individual item (since quota 100 // come in). So, a bucket has an expiration to denote it has becomes stale. 101 class Bucket { 103 Bucket() : num_tokens_(0) { [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/scene/debug/ |
SkeletonDebugger.java | 36 import com.jme3.renderer.queue.RenderQueue.Bucket; 56 setQueueBucket(Bucket.Transparent);
|
/external/chromium_org/gpu/command_buffer/client/ |
query_tracker.h | 31 struct Bucket { 32 explicit Bucket(QuerySync* sync_mem) 40 QueryInfo(Bucket* bucket, int32 id, uint32 offset, QuerySync* sync_mem) 41 : bucket(bucket), 48 : bucket(NULL), 54 Bucket* bucket; member in struct:gpu::gles2::QuerySyncManager::QueryInfo 69 std::deque<Bucket*> buckets_ [all...] |
/development/tools/idegen/src/ |
Eclipse.java | 61 List<Bucket> buckets = new ArrayList<Bucket>(patterns.size()); 63 buckets.add(new Bucket(pattern)); 71 for (Bucket bucket : buckets) { 72 if (bucket.matches(path)) { 73 bucket.sourceRoots.add(sourceRoot); 80 for (Bucket bucket : buckets) { 81 for (File sourceRoot : bucket.sourceRoots) [all...] |