| /external/mesa3d/src/gallium/auxiliary/pipebuffer/ |
| pb_bufmgr_slab.c | 162 struct pb_manager **buckets; member in struct:pb_slab_range_manager
498 return mgr->buckets[i]->create_buffer(mgr->buckets[i], size, desc);
527 mgr->buckets[i]->destroy(mgr->buckets[i]);
528 FREE(mgr->buckets);
567 mgr->buckets = CALLOC(mgr->numBuckets, sizeof(*mgr->buckets));
568 if (!mgr->buckets)
573 mgr->buckets[i] = pb_slab_manager_create(provider, bufSize, slabSize, desc)
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| DominatorInternals.h | 181 // Instead of using a bucket per vertex, we use a single array Buckets that
183 // Buckets[i] stores the index of the first element in V's bucket. After V's
184 // bucket is processed, Buckets[i] stores the index of the next element in the
186 SmallVector<unsigned, 32> Buckets;
187 Buckets.resize(N + 1);
189 Buckets[i] = i;
197 for (unsigned j = i; Buckets[j] != i; j = Buckets[j]) {
198 typename GraphT::NodeType* V = DT.Vertex[Buckets[j]];
225 Buckets[i] = Buckets[WInfo.Semi]
[all...] |
| /external/llvm/lib/CodeGen/AsmPrinter/ |
| DwarfAccelTable.h | 37 // | BUCKETS |
47 // the number of buckets, total number of hashes, and room for a special
50 // The buckets contain an index (e.g. 6) into the hashes array. The hashes
56 // number of buckets giving us our bucket. From there we take the bucket value
76 // Helper function to compute the number of buckets needed based on
84 uint32_t bucket_count; // The number of buckets in this hash table.
88 // indexes (buckets) for correct alignment.
238 // Buckets/Hashes/Offsets
241 BucketList Buckets;
|
| /external/llvm/lib/Support/ |
| StringMap.cpp | 20 /// Returns the number of buckets to allocate to ensure that the DenseMap can
34 // If a size is specified, initialize the table with that many buckets.
37 // buckets. To guarantee that "InitSize" number of entries can be inserted
43 // Otherwise, initialize it with zero buckets to avoid the allocation.
104 // case here is that we are only looking at the buckets (for item info
148 // case here is that we are only looking at the buckets (for item info
196 /// RehashTable - Grow the table, redistributing values into the buckets with
203 // the buckets are empty (meaning that many are filled with tombstones),
223 // Rehash all the items into their new buckets. Luckily :) we already have
|
| /development/tools/idegen/src/ |
| Eclipse.java | 61 List<Bucket> buckets = new ArrayList<Bucket>(patterns.size()); local
63 buckets.add(new Bucket(pattern));
66 // Put source roots in respective buckets.
71 for (Bucket bucket : buckets) {
80 for (Bucket bucket : buckets) {
|
| /external/icu/icu4c/source/i18n/unicode/ |
| alphaindex.h | 106 * The class also supports having buckets for strings before the first (underflow),
133 * // Show index at top. We could skip or gray out empty buckets
141 * // Show the buckets with their contents, skipping empty buckets
153 * if its bucket is empty. Small buckets could also be combined based on size, such as:
165 * they "lazily" build the index buckets.
168 * buckets and their labels and label types.
240 * and random access to buckets and their properties,
256 * Returns the number of index buckets and labels, including underflow/inflow/overflow.
258 * @return the number of index buckets
[all...] |
| /art/runtime/base/ |
| histogram.h | 100 // Add more buckets to the histogram to fill in a new value that exceeded
104 // Maximum number of buckets.
109 // histogram percentiles are. Grows adaptively when we hit max buckets.
|
| /external/iproute2/man/man8/ |
| tc-fq.8 | 17 .B buckets
71 .SS buckets
82 qdisc fq 8003: dev eth0 root refcnt 2 limit 10000p flow_limit 100p buckets 1024 quantum 3028 initial_quantum 15140
|
| /external/mesa3d/src/glx/ |
| glxhash.c | 121 __glxHashBucketPtr buckets[HASH_SIZE]; member in struct:__glxHashTable
171 table->buckets[i] = NULL;
187 for (bucket = table->buckets[i]; bucket;) {
210 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) {
215 bucket->next = table->buckets[hash];
216 table->buckets[hash] = bucket;
264 bucket->next = table->buckets[hash];
265 table->buckets[hash] = bucket;
287 table->buckets[hash] = bucket->next;
304 table->p1 = table->buckets[table->p0]
[all...] |
| /hardware/libhardware_legacy/include/hardware_legacy/ |
| gscan.h | 31 int max_scan_buckets; // maximum number of channel buckets
57 // multiple buckets that were scanned this period and one has the
97 "buckets on this platform.");
101 * buckets that are currently being scanned. See the buckets_scanned field
154 // Note that a given channel may appear in multiple buckets
167 wifi_scan_bucket_spec buckets[MAX_BUCKETS]; member in struct:__anon41453
172 * When this is called all requested buckets should be scanned, starting the beginning of the cycle
175 * If there are two buckets specified
180 * - t=0 buckets 1, 2, and 3 are scanned
186 * - t=60 buckets 1, 2, and 3 are scanne
[all...] |
| /external/iproute2/tc/ |
| q_fq.c | 56 fprintf(stderr, " [ maxrate RATE ] [ buckets NUMBER ]\n");
80 unsigned int buckets = 0; local
111 } else if (strcmp(*argv, "buckets") == 0) {
113 if (get_unsigned(&buckets, *argv, 0)) {
114 fprintf(stderr, "Illegal \"buckets\"\n");
176 if (buckets) {
177 unsigned int log = ilog2(buckets);
241 fprintf(f, "buckets %u ", 1U << buckets_log);
|
| /external/kmod/shared/ |
| hash.c | 44 struct hash_bucket buckets[]; member in struct:hash
74 bucket = hash->buckets;
151 struct hash_bucket *bucket = hash->buckets + pos;
194 struct hash_bucket *bucket = hash->buckets + pos;
239 const struct hash_bucket *bucket = hash->buckets + pos;
258 struct hash_bucket *bucket = hash->buckets + pos;
310 const struct hash_bucket *b = iter->hash->buckets + iter->bucket;
320 b = iter->hash->buckets + iter->bucket;
|
| /external/libchrome/base/metrics/ |
| histogram.h | 7 // vector of numbers corresponding to each of the aggregating buckets).
34 // The buckets layout of class Histogram is exponential. For example, buckets
38 // for values between 1 and 64, with 8 buckets, such as:
45 // the smallest ratio that it can use to construct the number of buckets
46 // selected in the constructor. An another example, if you had 50 buckets,
49 // root of 10000. This approach provides very fine grain (narrow) buckets
51 // gigantic range with the addition of very few buckets.
102 // Initialize maximum number of buckets in histograms as 16,384.
114 // buckets > 2 [minimum buckets needed: underflow, overflow and the range
[all...] |
| histogram_base.cc | 109 std::unique_ptr<ListValue> buckets(new ListValue());
110 GetCountAndBucketData(&count, &sum, buckets.get());
121 root.Set("buckets", std::move(buckets));
|
| histogram_flattener.h | 37 // differs from the sum of logged sample count in all the buckets. The
|
| /external/guava/guava/src/com/google/common/hash/ |
| Hashing.java | 307 * Assigns to {@code hashCode} a "bucket" in the range {@code [0, buckets)}, in a uniform
308 * manner that minimizes the need for remapping as {@code buckets} grows. That is,
319 public static int consistentHash(HashCode hashCode, int buckets) {
320 return consistentHash(hashCode.padToLong(), buckets);
324 * Assigns to {@code input} a "bucket" in the range {@code [0, buckets)}, in a uniform
325 * manner that minimizes the need for remapping as {@code buckets} grows. That is,
336 public static int consistentHash(long input, int buckets) {
337 checkArgument(buckets > 0, "buckets must be positive: %s", buckets);
[all...] |
| /external/libunwind/src/dwarf/ |
| Gparser.c | 507 cache->buckets[i].lru_chain = (i - 1);
508 cache->buckets[i].coll_chain = -1;
509 cache->buckets[i].ip = 0;
510 cache->buckets[i].valid = 0;
571 dwarf_reg_state_t *rs = cache->buckets + c->hint;
584 rs = cache->buckets + index;
590 c->hint = cache->buckets[c->prev_rs].hint =
591 (rs - cache->buckets);
596 rs = cache->buckets + rs->coll_chain;
608 rs = cache->buckets + head
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| FoldingSet.cpp | 187 /// The problem with this is that the start of the hash buckets are not
208 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) {
211 return Buckets + BucketNum;
216 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*)));
218 Buckets[NumBuckets] = reinterpret_cast<void*>(-1);
219 return Buckets;
229 Buckets = AllocateBuckets(NumBuckets);
233 free(Buckets);
237 memset(Buckets, 0, NumBuckets*sizeof(void*));
240 Buckets[NumBuckets] = reinterpret_cast<void*>(-1)
[all...] |
| /frameworks/base/core/java/android/net/ |
| NetworkStatsHistory.java | 52 * "buckets" in time. Internally it stores data in {@code long} series for more
287 * distribute across internal buckets, creating new buckets as needed.
297 * distribute across internal buckets, creating new buckets as needed.
313 // create any buckets needed by this range
316 // distribute data usage into buckets
361 * buckets that atomically occur in the inclusive time range. Doesn't
362 * interpolate across partial buckets.
385 * Ensure that buckets exist for given time range, creating as needed
[all...] |
| /frameworks/base/tests/net/java/android/net/ |
| NetworkStatsHistoryTest.java | 107 // split equally across two buckets
122 // overlap into neighboring buckets. total record is 20 minutes.
149 // we should have two buckets, far apart from each other
154 // now record something in middle, spread across two buckets
160 // now should have four buckets, with new record in middle two buckets
172 // record some data in one bucket, and another overlapping buckets
179 // should have two buckets, with some data mixed together
202 // now inspect internal buckets
226 // now inspect internal buckets
[all...] |
| /external/boringssl/src/infra/config/ |
| cq.cfg | 12 buckets {
|
| /external/libunwind/src/ia64/ |
| Gscript.c | 87 cache->buckets[i].lru_chain = (i - 1);
88 cache->buckets[i].coll_chain = -1;
89 cache->buckets[i].ip = 0;
154 struct ia64_script *script = cache->buckets + c->hint;
168 script = cache->buckets + index;
174 c->hint = cache->buckets[c->prev_script].hint =
175 (script - cache->buckets);
180 script = cache->buckets + script->coll_chain;
201 script = cache->buckets + head;
205 cache->buckets[cache->lru_tail].lru_chain = head
[all...] |
| /external/libyuv/files/infra/config/ |
| cq.cfg | 26 buckets {
|
| /external/pdfium/infra/config/ |
| cq.cfg | 33 buckets {
|
| /external/replicaisland/src/com/replica/replicaisland/ |
| GameComponent.java | 26 // Defines high-level buckets within which components may choose to run.
|
