| /external/antlr/antlr-3.4/runtime/ObjC/Framework/ANTLR/ANTLR.xcodeproj/xcuserdata/acondit.xcuserdatad/xcdebugger/ |
| Breakpoints.xcbkptlist | 2 <Bucket
5 </Bucket>
|
| /packages/providers/ContactsProvider/tests/src/com/android/providers/contacts/ |
| ContactsIcuTest.java | 65 Log.e(TAG, "Bucket for '" + ch + "' expected to be '"
97 E ContactsIcuTest: Bucket for '?' expected to be '2?', but was '48?'
98 E ContactsIcuTest: Bucket for '?' expected to be '3?', but was '48?'
99 E ContactsIcuTest: Bucket for '?' expected to be '3?', but was '48?'
100 E ContactsIcuTest: Bucket for '?' expected to be '3?', but was '48?'
101 E ContactsIcuTest: Bucket for '?' expected to be '3?', but was '48?'
102 E ContactsIcuTest: Bucket for '?' expected to be '3?', but was '48?'
103 E ContactsIcuTest: Bucket for '?' expected to be '4?', but was '48?'
104 E ContactsIcuTest: Bucket for '?' expected to be '4?', but was '48?'
105 E ContactsIcuTest: Bucket for '?' expected to be '4?', but was '48?
[all...] |
| /external/libchrome/base/trace_event/ |
| heap_profiler_heap_dump_writer.cc | 30 // The pairs are grouped into |Bucket|s. A bucket is a group of (context, size)
33 // bucket that represents the entire heap. Then this bucket is recursively
34 // broken down into smaller buckets. Each bucket keeps track of whether further
46 struct Bucket {
47 Bucket()
63 // elements in this bucket, the stack frames 0 up to (but not including) the
67 // When true, the type name for all elements in this bucket must be equal.
72 bool operator<(const Bucket& lhs, const Bucket& rhs)
[all...] |
| trace_sampling_thread.cc | 17 TraceBucketData(base::subtle::AtomicWord* bucket,
22 TRACE_EVENT_API_ATOMIC_WORD* bucket; member in class:base::trace_event::TraceBucketData
50 TRACE_EVENT_API_ATOMIC_LOAD(*bucket_data->bucket);
73 TRACE_EVENT_API_ATOMIC_WORD* bucket,
80 sample_buckets_.push_back(TraceBucketData(bucket, name, callback));
99 TraceBucketData::TraceBucketData(base::subtle::AtomicWord* bucket,
102 : bucket(bucket), bucket_name(name), callback(callback) {}
|
| /external/libvpx/libvpx/ |
| rate_hist.c | 33 struct hist_bucket bucket[RATE_BINS]; member in struct:rate_hist
62 hist->bucket[i].low = INT_MAX;
63 hist->bucket[i].high = 0;
64 hist->bucket[i].count = 0;
118 if (hist->bucket[idx].low > avg_bitrate)
119 hist->bucket[idx].low = (int)avg_bitrate;
120 if (hist->bucket[idx].high < avg_bitrate)
121 hist->bucket[idx].high = (int)avg_bitrate;
122 hist->bucket[idx].count++;
126 static int merge_hist_buckets(struct hist_bucket *bucket, int max_buckets
254 struct hist_bucket bucket[64]; local
[all...] |
| /external/chromium-trace/catapult/telemetry/ |
| cloud_storage | 20 BUCKETS = {bucket: easy_bucket_name for easy_bucket_name, bucket
39 for bucket in BUCKETS:
41 bucket_contents[bucket] = cloud_storage.List(bucket)
45 # Check if each file is in the bucket contents.
59 for bucket in BUCKETS:
60 if bucket in bucket_contents and file_hash in bucket_contents[bucket]:
61 file_buckets[file_path].append(bucket)
[all...] |
| /external/libdrm/ |
| xf86drmHash.c | 127 HashBucketPtr bucket; local
134 for (bucket = table->buckets[i]; bucket;) {
135 next = bucket->next;
136 drmFree(bucket);
137 bucket = next;
144 /* Find the bucket and organize the list so that this bucket is at the
152 HashBucketPtr bucket; local
156 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next)
178 HashBucketPtr bucket; local
191 HashBucketPtr bucket; local
214 HashBucketPtr bucket; local
[all...] |
| /frameworks/opt/net/wifi/service/java/com/android/server/wifi/scanner/ |
| BackgroundScanScheduler.java | 48 * where each bucket represents a set of channels and an interval to scan at. This
51 * <p>Each new request is placed in the best predefined bucket. Once all requests have been added
52 * the last buckets (lower priority) are placed in the next best bucket until the number of buckets
66 // Max channels that can be specified per bucket
90 * the next smallest bucket with the smallest bucket having a period of PERIOD_MIN_GCD_MS.
103 * scan will be placed in the 20s bucket.
105 * If there are special scan requests such as exponential back off, we always dedicate a bucket
128 * collection to be scanned by the bucket as settings are added to it.
130 private class Bucket {
276 Bucket bucket = mBuckets[index]; local
[all...] |
| /external/kmod/shared/ |
| hash.c | 69 struct hash_bucket *bucket, *bucket_end; local
74 bucket = hash->buckets;
75 bucket_end = bucket + hash->n_buckets;
76 for (; bucket < bucket_end; bucket++) {
79 entry = bucket->entries;
80 entry_end = entry + bucket->used;
84 free(bucket->entries);
151 struct hash_bucket *bucket = hash->buckets + pos; local
154 if (bucket->used + 1 >= bucket->total)
194 struct hash_bucket *bucket = hash->buckets + pos; local
239 const struct hash_bucket *bucket = hash->buckets + pos; local
258 struct hash_bucket *bucket = hash->buckets + pos; local
[all...] |
| /cts/tests/tests/app.usage/src/android/app/usage/cts/ |
| NetworkUsageStatsTest.java | 343 NetworkStats.Bucket bucket = null; local
345 bucket = mNsm.querySummaryForDevice(
351 assertNotNull(bucket);
352 assertTimestamps(bucket);
353 assertEquals(bucket.getState(), NetworkStats.Bucket.STATE_ALL);
354 assertEquals(bucket.getUid(), NetworkStats.Bucket.UID_ALL);
355 assertEquals(bucket.getMetered(), NetworkStats.Bucket.METERED_ALL)
376 NetworkStats.Bucket bucket = null; local
415 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
475 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
531 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
586 NetworkStats.Bucket bucket = new NetworkStats.Bucket(); local
[all...] |
| /external/bison/lib/ |
| hash.c | 54 /* The array of buckets starts at BUCKET and extends to BUCKET_LIMIT-1,
57 struct hash_entry *bucket; member in struct:hash_table
93 slot. A bucket is the collection of all entries hashing to the same slot.
96 In the ideal case, the length of each bucket is roughly the number of
99 entry is linear in time with the size of the bucket. Consequently, a
119 /* If a deletion empties a bucket and causes the ratio of used buckets to
171 /* Return the length of the longest chain (bucket). */
176 struct hash_entry const *bucket; local
179 for (bucket = table->bucket; bucket < table->bucket_limit; bucket++
203 struct hash_entry const *bucket; local
263 struct hash_entry const *bucket = safe_hasher (table, entry); local
290 struct hash_entry const *bucket; local
309 struct hash_entry const *bucket = safe_hasher (table, entry); local
340 struct hash_entry const *bucket; local
372 struct hash_entry const *bucket; local
655 struct hash_entry *bucket; local
698 struct hash_entry *bucket; local
793 struct hash_entry *bucket = safe_hasher (table, entry); local
862 struct hash_entry *bucket; local
1042 struct hash_entry *bucket; local
1151 struct hash_entry *bucket; local
1214 struct hash_entry *bucket = (struct hash_entry *) table->bucket; local
[all...] |
| /external/parameter-framework/asio-1.10.6/include/asio/detail/ |
| hash_map.hpp | 103 size_t bucket = calculate_hash_value(k) % num_buckets_; local
104 iterator it = buckets_[bucket].first;
107 iterator end_it = buckets_[bucket].last;
124 size_t bucket = calculate_hash_value(k) % num_buckets_; local
125 const_iterator it = buckets_[bucket].first;
128 const_iterator end_it = buckets_[bucket].last;
145 size_t bucket = calculate_hash_value(v.first) % num_buckets_; local
146 iterator it = buckets_[bucket].first;
149 buckets_[bucket].first = buckets_[bucket].last
173 size_t bucket = calculate_hash_value(it->first) % num_buckets_; local
250 std::size_t bucket = calculate_hash_value(iter->first) % num_buckets_; local
[all...] |
| /external/mesa3d/src/gallium/drivers/nouveau/ |
| nouveau_mm.c | 29 struct mm_bucket bucket[MM_NUM_BUCKETS]; member in struct:nouveau_mman
90 return &cache->bucket[MAX2(order, MM_MIN_ORDER) - MM_MIN_ORDER];
160 struct mm_bucket *bucket; local
165 bucket = mm_bucket_by_size(cache, size);
166 if (!bucket) {
177 if (!LIST_IS_EMPTY(&bucket->used)) {
178 slab = LIST_ENTRY(struct mm_slab, bucket->used.next, head);
180 if (LIST_IS_EMPTY(&bucket->free)) {
183 slab = LIST_ENTRY(struct mm_slab, bucket->free.next, head);
186 LIST_ADD(&slab->head, &bucket->used)
213 struct mm_bucket *bucket = mm_bucket_by_order(slab->cache, slab->order); local
[all...] |
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| local_iterators.pass.cpp | 45 C::size_type b = c.bucket(0);
50 b = c.bucket(1);
58 b = c.bucket(2);
66 b = c.bucket(3);
72 b = c.bucket(4);
78 b = c.bucket(5);
83 b = c.bucket(6);
103 C::size_type b = c.bucket(0);
108 b = c.bucket(1);
116 b = c.bucket(2)
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/unord/unord.multiset/ |
| local_iterators.pass.cpp | 45 C::size_type b = c.bucket(0);
50 b = c.bucket(1);
58 b = c.bucket(2);
66 b = c.bucket(3);
72 b = c.bucket(4);
78 b = c.bucket(5);
83 b = c.bucket(6);
103 C::size_type b = c.bucket(0);
108 b = c.bucket(1);
116 b = c.bucket(2)
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/unord/unord.multiset/ |
| local_iterators.pass.cpp | 45 C::size_type b = c.bucket(0);
50 b = c.bucket(1);
58 b = c.bucket(2);
66 b = c.bucket(3);
72 b = c.bucket(4);
78 b = c.bucket(5);
83 b = c.bucket(6);
103 C::size_type b = c.bucket(0);
108 b = c.bucket(1);
116 b = c.bucket(2)
[all...] |
| /frameworks/base/libs/androidfw/include/androidfw/ |
| ByteBucketArray.h | 55 T* bucket = buckets_[bucket_index]; local
56 if (bucket == NULL) {
59 return bucket[0x0f & static_cast<uint8_t>(index)];
67 T* bucket = buckets_[bucket_index];
68 if (bucket == NULL) {
69 bucket = buckets_[bucket_index] = new T[kBucketSize]();
71 return bucket[0x0f & static_cast<uint8_t>(index)];
|
| /external/libmojo/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/icu/android_icu4j/src/main/java/android/icu/text/ |
| AlphabeticIndex.java | 20 import android.icu.text.AlphabeticIndex.Bucket;
21 import android.icu.text.AlphabeticIndex.Bucket.LabelType;
44 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
45 * the target list, where everything in the bucket is greater than or equal to the character
47 * they will be in sorted order in the right bucket.
52 * into an inflow bucket between the other two scripts.
73 * for (AlphabeticIndex.Bucket<Integer> bucket : index) {
74 * if (showAll || bucket.size() != 0)
781 Bucket<V> bucket = currentBucket; local
1012 Bucket<V> bucket = new Bucket<V>(fixLabel(current), current, LabelType.NORMAL); local
1079 Bucket<V> bucket = bucketList.get(i); local
1125 Bucket<V> bucket = bucketList.get(i); local
1133 Bucket<V> bucket = bucketList.get(start); local
[all...] |
| /external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/ |
| AlphabeticIndex.java | 19 import com.ibm.icu.text.AlphabeticIndex.Bucket;
20 import com.ibm.icu.text.AlphabeticIndex.Bucket.LabelType;
43 * (bucket) of a larger "target" list. That is, each label corresponds to a bucket in
44 * the target list, where everything in the bucket is greater than or equal to the character
46 * they will be in sorted order in the right bucket.
51 * into an inflow bucket between the other two scripts.
72 * for (AlphabeticIndex.Bucket<Integer> bucket : index) {
73 * if (showAll || bucket.size() != 0)
809 Bucket<V> bucket = currentBucket; local
1058 Bucket<V> bucket = new Bucket<V>(fixLabel(current), current, LabelType.NORMAL); local
1125 Bucket<V> bucket = bucketList.get(i); local
1171 Bucket<V> bucket = bucketList.get(i); local
1179 Bucket<V> bucket = bucketList.get(start); local
[all...] |
| /external/autotest/client/cros/video/ |
| histogram_verifier.py | 14 Verifies histogram string and success rate in a parsed histogram bucket.
20 @param histogram_bucket_value: int, required bucket number to look for
25 error_msg_format = ('{} not loaded or histogram bucket not found '
26 'or histogram bucket found at < 100%')
53 @param histogram_bucket_value: int, required bucket number to look for
54 @returns True if histogram page was loaded and the bucket was found.
|
| /external/ltp/testcases/kernel/controllers/io-throttle/ |
| io_throttle_testplan.txt | 24 - 1 single stream per cgroup using leaky-bucket I/O throttling
25 - 1 single stream per cgroup using token-bucket I/O throttling
26 - 2 parallel streams per cgroup using leaky-bucket I/O throttling
27 - 2 parallel streams per cgroup using token-bucket I/O throttling
28 - 4 parallel streams per cgroup using leaky-bucket I/O throttling
29 - 4 parallel streams per cgroup using token-bucket I/O throttling
|
| /frameworks/base/packages/SettingsLib/src/com/android/settingslib/ |
| TronUtils.java | 43 int bucket; local
46 bucket = 0;
49 bucket = 1;
52 bucket = 2;
55 bucket = 3;
61 MetricsLogger.histogram(context, histogram, bucket);
|
| /external/chromium-trace/catapult/dependency_manager/dependency_manager/ |
| uploader_unittest.py | 15 self.bucket = 'cloud_storage_bucket'
24 self.bucket, None, self.local_path)
26 self.bucket, self.remote_path, None)
31 self.bucket, self.remote_path, self.local_path)
35 self.bucket, self.remote_path, self.local_path)
36 expected_bucket = self.bucket
47 self.bucket, self.remote_path, self.local_path)
49 self.bucket, self.remote_path, self.local_path)
68 self.bucket, self.remote_path, self.local_path)
74 self.bucket, new_remote_path, self.local_path
[all...] |
| /external/jemalloc/src/ |
| ckh.c | 4 * hash bucket contains 2^n cells, for n >= 1, and 2 indicates that two hash
24 * | #cells/bucket |
32 * The number of cells per bucket is chosen such that a bucket fits in one cache
49 * Search bucket for key and return the cell number if found; SIZE_T_MAX
53 ckh_bucket_search(ckh_t *ckh, size_t bucket, const void *key)
59 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];
61 return ((bucket << LG_CKH_BUCKET_CELLS) + i);
73 size_t hashes[2], bucket, cell; local
79 /* Search primary bucket. *
130 size_t hashes[2], bucket, tbucket; local
198 size_t hashes[2], bucket; local
[all...] |
