| /external/chromium_org/tools/memory_inspector/memory_inspector/classification/ |
| results.py | 8 aggregated results are organized in a bucket tree, which structure is identical
50 """A tree of results, where each node is a bucket (root: 'Total' bucket)."""
53 """Initializes the bucket tree using the structure of the rules tree.
55 Each node of the bucket tree is initialized with a list of len(keys) zeros.
84 def _AddToMatchingNodes(trace_record, values, bucket, num_keys):
85 if not bucket.rule.Match(trace_record):
88 bucket.values[i] += values[i]
89 for child_bucket in bucket.children:
98 bucket = Bucket(rule, num_keys
[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
|
| /external/chromium_org/third_party/tcmalloc/vendor/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
|
| 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...] |
| /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) {
83 CommonDecoder::Bucket* CommonDecoder::GetBucket(uint32 bucket_id) const
89 Bucket* bucket = GetBucket(bucket_id); local
188 Bucket* bucket = CreateBucket(bucket_id); local
204 Bucket* bucket = GetBucket(bucket_id); local
225 Bucket* bucket = GetBucket(bucket_id); local
259 Bucket* bucket = GetBucket(bucket_id); local
283 Bucket* bucket = GetBucket(bucket_id); local
[all...] |
| /external/llvm/include/llvm/Support/ |
| ArrayRecycler.h | 41 SmallVector<FreeList*, 8> Bucket;
43 // Remove an entry from the free list in Bucket[Idx] and return it.
46 if (Idx >= Bucket.size())
48 FreeList *Entry = Bucket[Idx];
51 Bucket[Idx] = Entry->Next;
55 // 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...] |
| /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...] |
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/ |
| bisect_test_ordering.py | 43 class Bucket(object):
62 self.buckets = [Bucket([self.expected_failure])]
69 # Split the list of test into buckets. Each bucket has at least one test required to cause
72 self.buckets = [Bucket(self.tests[:-1]), Bucket([self.expected_failure])]
81 return self.test_bucket_list_fails([Bucket([self.expected_failure])])
93 for bucket in self.buckets:
94 count += len(bucket.tests)
99 for bucket in self.buckets:
100 tests += bucket.test
[all...] |
| /external/chromium_org/tools/deep_memory_profiler/lib/ |
| bucket.py | 14 class Bucket(object):
15 """Represents a bucket, which is a unit of memory block classification."""
111 """Represents a set of bucket."""
118 """Loads all related bucket files.
121 prefix: A prefix string for bucket file names.
123 LOGGER.info('Loading bucket files.')
161 self._buckets[int(words[0])] = Bucket(
|
| /external/llvm/lib/Support/ |
| 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...] |
| 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...] |
| /external/chromium_org/chrome/browser/extensions/api/metrics_private/ |
| metrics_apitest.cc | 53 // Represents a bucket in a sparse histogram.
54 struct Bucket {
63 Bucket buckets[10];
128 const Bucket& bucket = sparse_histogram.buckets[j]; local
129 EXPECT_EQ(bucket.count, samples.GetCount(bucket.histogram_value));
|
| /external/chromium_org/extensions/browser/ |
| 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
97 // (represented by its Bucket) constitutes a quota violation.
101 // Bucket objects (see Below) and how often they are replenished.
103 // The maximum number of tokens a bucket can contain, and is refilled to
107 // Specifies how frequently the bucket is logically refilled with tokens.
111 // A Bucket is how the heuristic portrays an individual item (since quota
117 // come in). So, a bucket has an expiration to denote it has becomes stale.
118 class Bucket {
120 Bucket() : num_tokens_(0) {
[all...] |
| quota_service_unittest.cc | 20 typedef QuotaLimitHeuristic::Bucket Bucket;
45 buckets_[id] = new Bucket();
51 typedef std::map<int, Bucket*> BucketMap;
150 Bucket* b,
175 Bucket b;
195 Bucket bucket; local
197 bucket.Reset(k2PerMinute, kStartTime);
198 DoMoreThan2PerMinuteFor5Minutes(kStartTime, &lim, &bucket, -1)
[all...] |
| /external/chromium_org/third_party/jinja2/ |
| bccache.py | 57 class Bucket(object):
73 """Resets the bucket (unloads the bytecode)."""
93 raise TypeError('can\'t write empty bucket')
112 these methods are passed a :class:`~jinja2.bccache.Bucket`.
123 def load_bytecode(self, bucket):
124 filename = path.join(self.directory, bucket.key)
127 bucket.load_bytecode(f)
129 def dump_bytecode(self, bucket):
130 filename = path.join(self.directory, bucket.key)
132 bucket.write_bytecode(f
[all...] |
| /external/chromium_org/tools/deep_memory_profiler/tests/ |
| dmprof_test.py | 16 from lib.bucket import Bucket
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/compiler-rt/lib/ubsan/ |
| ubsan_type_hash.cc | 93 /// Find a bucket to store the given hash value in.
215 HashValue *Bucket = getTypeCacheHashTableBucket(Hash);
216 if (*Bucket == Hash) {
237 *Bucket = Hash;
|
| /external/icu/icu4c/source/i18n/unicode/ |
| alphaindex.h | 35 * in the bucket with this label.
41 * Undeflow Label. The bucket with this label contains names
42 * in scripts that sort before any of the bucket labels in this index.
48 * Inflow Label. The bucket with this label contains names
49 * in scripts that sort between two of the bucket labels in this index.
58 * Overflow Label. Te bucket with this label contains names in scripts
59 * that sort after all of the bucket labels in this index.
99 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
100 * the target list, where everything in the bucket is greater than or equal to the characte
[all...] |
| /external/llvm/include/llvm/ADT/ |
| SmallPtrSet.h | 148 const void *const *Bucket;
152 : Bucket(BP), End(E) {
157 return Bucket == RHS.Bucket;
160 return Bucket != RHS.Bucket;
164 /// AdvanceIfNotValid - If the current bucket isn't valid, advance to a bucket
165 /// that is. This is guaranteed to stop because the end() bucket is marked
168 assert(Bucket <= End)
[all...] |
| /external/chromium_org/gpu/command_buffer/client/ |
| query_tracker.h | 32 struct Bucket {
33 explicit Bucket(QuerySync* sync_mem)
41 QueryInfo(Bucket* bucket, int32 id, uint32 offset, QuerySync* sync_mem)
42 : bucket(bucket),
49 : bucket(NULL),
55 Bucket* bucket; member in struct:gpu::gles2::QuerySyncManager::QueryInfo
70 std::deque<Bucket*> buckets_
[all...] |
| /external/compiler-rt/lib/sanitizer_common/ |
| sanitizer_addrhashmap.h | 59 struct Bucket {
82 Bucket *bucket_;
93 Bucket *table_;
151 table_ = (Bucket*)MmapOrDie(kSize * sizeof(table_[0]), "AddrHashMap");
158 Bucket *b = &table_[hash];
165 // If we want to remove the element, we need exclusive access to the bucket,
287 Bucket *b = h->bucket_;
301 // See if we need to compact the bucket.
|
| /external/chromium_org/third_party/icu/source/i18n/ |
| alphaindex.cpp | 81 inline AlphabeticIndex::Bucket *getBucket(const UVector &list, int32_t i) {
82 return static_cast<AlphabeticIndex::Bucket *>(list[i]);
150 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, i); local
152 collatorPrimaryOnly.compare(name, bucket->lowerBoundary_, errorCode);
159 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, start); local
160 if (bucket->displayBucket_ != NULL) {
161 bucket = bucket->displayBucket_
461 Bucket *bucket = new Bucket(getUnderflowLabel(), emptyString_, U_ALPHAINDEX_UNDERFLOW); local
683 Bucket *bucket = currentBucket; local
[all...] |
