Home
last modified time | relevance | path

Searched refs:bucket (Results 1 – 25 of 100) sorted by relevance

1234

/external/bison/lib/
Dhash.c57 struct hash_entry *bucket; member
176 struct hash_entry const *bucket; in hash_get_max_bucket_length() local
179 for (bucket = table->bucket; bucket < table->bucket_limit; bucket++) in hash_get_max_bucket_length()
181 if (bucket->data) in hash_get_max_bucket_length()
183 struct hash_entry const *cursor = bucket; in hash_get_max_bucket_length()
203 struct hash_entry const *bucket; in hash_table_ok() local
207 for (bucket = table->bucket; bucket < table->bucket_limit; bucket++) in hash_table_ok()
209 if (bucket->data) in hash_table_ok()
211 struct hash_entry const *cursor = bucket; in hash_table_ok()
254 return table->bucket + n; in safe_hasher()
[all …]
/external/libvpx/libvpx/
Drate_hist.c33 struct hist_bucket bucket[RATE_BINS]; member
57 hist->bucket[i].low = INT_MAX; in init_rate_histogram()
58 hist->bucket[i].high = 0; in init_rate_histogram()
59 hist->bucket[i].count = 0; in init_rate_histogram()
112 if (hist->bucket[idx].low > avg_bitrate) in update_rate_histogram()
113 hist->bucket[idx].low = (int)avg_bitrate; in update_rate_histogram()
114 if (hist->bucket[idx].high < avg_bitrate) in update_rate_histogram()
115 hist->bucket[idx].high = (int)avg_bitrate; in update_rate_histogram()
116 hist->bucket[idx].count++; in update_rate_histogram()
120 static int merge_hist_buckets(struct hist_bucket *bucket, in merge_hist_buckets() argument
[all …]
/external/libdrm/
Dxf86drmHash.c177 HashBucketPtr bucket; in drmHashDestroy() local
184 for (bucket = table->buckets[i]; bucket;) { in drmHashDestroy()
185 next = bucket->next; in drmHashDestroy()
186 HASH_FREE(bucket); in drmHashDestroy()
187 bucket = next; in drmHashDestroy()
202 HashBucketPtr bucket; in HashFind() local
206 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) { in HashFind()
207 if (bucket->key == key) { in HashFind()
210 prev->next = bucket->next; in HashFind()
211 bucket->next = table->buckets[hash]; in HashFind()
[all …]
/external/mesa3d/src/glx/
Dglxhash.c179 __glxHashBucketPtr bucket; in __glxHashDestroy() local
187 for (bucket = table->buckets[i]; bucket;) { in __glxHashDestroy()
188 next = bucket->next; in __glxHashDestroy()
189 HASH_FREE(bucket); in __glxHashDestroy()
190 bucket = next; in __glxHashDestroy()
205 __glxHashBucketPtr bucket; in HashFind() local
210 for (bucket = table->buckets[hash]; bucket; bucket = bucket->next) { in HashFind()
211 if (bucket->key == key) { in HashFind()
214 prev->next = bucket->next; in HashFind()
215 bucket->next = table->buckets[hash]; in HashFind()
[all …]
/external/libcxx/test/std/containers/unord/unord.multiset/
Dlocal_iterators.pass.cpp45 C::size_type b = c.bucket(0); in main()
50 b = c.bucket(1); in main()
58 b = c.bucket(2); in main()
66 b = c.bucket(3); in main()
72 b = c.bucket(4); in main()
78 b = c.bucket(5); in main()
83 b = c.bucket(6); in main()
103 C::size_type b = c.bucket(0); in main()
108 b = c.bucket(1); in main()
116 b = c.bucket(2); in main()
[all …]
Dlocal_iterators.fail.cpp43 C::size_type b = c.bucket(0); in main()
48 b = c.bucket(1); in main()
57 b = c.bucket(2); in main()
65 b = c.bucket(3); in main()
71 b = c.bucket(4); in main()
77 b = c.bucket(5); in main()
82 b = c.bucket(6); in main()
102 C::size_type b = c.bucket(0); in main()
107 b = c.bucket(1); in main()
115 b = c.bucket(2); in main()
[all …]
/external/libcxx/test/std/containers/unord/unord.set/
Dlocal_iterators.pass.cpp45 C::size_type b = c.bucket(0); in main()
50 b = c.bucket(1); in main()
56 b = c.bucket(2); in main()
62 b = c.bucket(3); in main()
68 b = c.bucket(4); in main()
89 C::size_type b = c.bucket(0); in main()
94 b = c.bucket(1); in main()
100 b = c.bucket(2); in main()
106 b = c.bucket(3); in main()
112 b = c.bucket(4); in main()
[all …]
Dlocal_iterators.fail.cpp43 C::size_type b = c.bucket(0); in main()
48 b = c.bucket(1); in main()
57 b = c.bucket(2); in main()
65 b = c.bucket(3); in main()
71 b = c.bucket(4); in main()
77 b = c.bucket(5); in main()
82 b = c.bucket(6); in main()
102 C::size_type b = c.bucket(0); in main()
107 b = c.bucket(1); in main()
115 b = c.bucket(2); in main()
[all …]
/external/libcxx/test/std/containers/unord/unord.multimap/
Dlocal_iterators.pass.cpp46 C::size_type b = c.bucket(0); in main()
51 b = c.bucket(1); in main()
61 b = c.bucket(2); in main()
71 b = c.bucket(3); in main()
78 b = c.bucket(4); in main()
85 b = c.bucket(5); in main()
90 b = c.bucket(6); in main()
110 C::size_type b = c.bucket(0); in main()
115 b = c.bucket(1); in main()
125 b = c.bucket(2); in main()
[all …]
Dlocal_iterators.fail.cpp44 C::size_type b = c.bucket(0); in main()
49 b = c.bucket(1); in main()
60 b = c.bucket(2); in main()
70 b = c.bucket(3); in main()
77 b = c.bucket(4); in main()
84 b = c.bucket(5); in main()
89 b = c.bucket(6); in main()
109 C::size_type b = c.bucket(0); in main()
114 b = c.bucket(1); in main()
124 b = c.bucket(2); in main()
[all …]
/external/libcxx/test/std/containers/unord/unord.map/
Dlocal_iterators.pass.cpp46 C::size_type b = c.bucket(0); in main()
51 b = c.bucket(1); in main()
58 b = c.bucket(2); in main()
65 b = c.bucket(3); in main()
72 b = c.bucket(4); in main()
94 C::size_type b = c.bucket(0); in main()
99 b = c.bucket(1); in main()
106 b = c.bucket(2); in main()
113 b = c.bucket(3); in main()
120 b = c.bucket(4); in main()
[all …]
/external/mesa3d/src/gallium/drivers/nouveau/
Dnouveau_mm.c29 struct mm_bucket bucket[MM_NUM_BUCKETS]; member
90 return &cache->bucket[MAX2(order, MM_MIN_ORDER) - MM_MIN_ORDER]; in mm_bucket_by_order()
160 struct mm_bucket *bucket; in nouveau_mm_allocate() local
165 bucket = mm_bucket_by_size(cache, size); in nouveau_mm_allocate()
166 if (!bucket) { in nouveau_mm_allocate()
177 if (!LIST_IS_EMPTY(&bucket->used)) { in nouveau_mm_allocate()
178 slab = LIST_ENTRY(struct mm_slab, bucket->used.next, head); in nouveau_mm_allocate()
180 if (LIST_IS_EMPTY(&bucket->free)) { in nouveau_mm_allocate()
183 slab = LIST_ENTRY(struct mm_slab, bucket->free.next, head); in nouveau_mm_allocate()
186 LIST_ADD(&slab->head, &bucket->used); in nouveau_mm_allocate()
[all …]
/external/jmonkeyengine/engine/src/core/com/jme3/renderer/queue/
DRenderQueue.java189 public void setGeometryComparator(Bucket bucket, GeometryComparator c) { in setGeometryComparator() argument
190 switch (bucket) { in setGeometryComparator()
207 throw new UnsupportedOperationException("Unknown bucket type: " + bucket); in setGeometryComparator()
255 public void addToQueue(Geometry g, Bucket bucket) { in addToQueue() argument
256 switch (bucket) { in addToQueue()
273 throw new UnsupportedOperationException("Unknown bucket type: " + bucket); in addToQueue()
324 public boolean isQueueEmpty(Bucket bucket) { in isQueueEmpty() argument
325 switch (bucket) { in isQueueEmpty()
337 throw new UnsupportedOperationException("Unsupported bucket type: " + bucket); in isQueueEmpty()
341 public void renderQueue(Bucket bucket, RenderManager rm, Camera cam) { in renderQueue() argument
[all …]
/external/mesa3d/src/mesa/program/
Dhash_table.c115 const unsigned bucket = hash_value % ht->num_buckets; in get_node() local
118 foreach(node, & ht->buckets[bucket]) { in get_node()
141 const unsigned bucket = hash_value % ht->num_buckets; in hash_table_insert() local
149 insert_at_head(& ht->buckets[bucket], & node->link); in hash_table_insert()
156 const unsigned bucket = hash_value % ht->num_buckets; in hash_table_replace() local
160 foreach(node, & ht->buckets[bucket]) { in hash_table_replace()
174 insert_at_head(& ht->buckets[bucket], & hn->link); in hash_table_replace()
196 int bucket; in hash_table_call_foreach() local
198 for (bucket = 0; bucket < ht->num_buckets; bucket++) { in hash_table_call_foreach()
200 foreach_s(node, temp, &ht->buckets[bucket]) { in hash_table_call_foreach()
/external/icu/icu4j/main/classes/collate/src/com/ibm/icu/text/
DAlphabeticIndex.java640 for (Bucket<V> bucket : buckets) { in getBucketLabels()
641 result.add(bucket.getLabel()); in getBucketLabels()
804 Bucket<V> bucket = currentBucket; in initBuckets() local
805 if (bucket.displayBucket != null) { in initBuckets()
806 bucket = bucket.displayBucket; in initBuckets()
808 if (bucket.records == null) { in initBuckets()
809 bucket.records = new ArrayList<Record<V>>(); in initBuckets()
811 bucket.records.add(r); in initBuckets()
1051 Bucket<V> bucket = new Bucket<V>(fixLabel(current), current, LabelType.NORMAL); in createBucketList() local
1052 bucketList.add(bucket); in createBucketList()
[all …]
/external/jemalloc/src/
Dckh.c53 ckh_bucket_search(ckh_t *ckh, size_t bucket, const void *key) in ckh_bucket_search() argument
59 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i]; in ckh_bucket_search()
61 return ((bucket << LG_CKH_BUCKET_CELLS) + i); in ckh_bucket_search()
73 size_t hashes[2], bucket, cell; in ckh_isearch() local
80 bucket = hashes[0] & ((ZU(1) << ckh->lg_curbuckets) - 1); in ckh_isearch()
81 cell = ckh_bucket_search(ckh, bucket, key); in ckh_isearch()
86 bucket = hashes[1] & ((ZU(1) << ckh->lg_curbuckets) - 1); in ckh_isearch()
87 cell = ckh_bucket_search(ckh, bucket, key); in ckh_isearch()
92 ckh_try_bucket_insert(ckh_t *ckh, size_t bucket, const void *key, in ckh_try_bucket_insert() argument
104 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + in ckh_try_bucket_insert()
[all …]
/external/libdrm/freedreno/
Dfreedreno_bo.c92 struct fd_bo_bucket *bucket = &dev->cache_bucket[i]; in fd_cleanup_bo_cache() local
95 while (!LIST_IS_EMPTY(&bucket->list)) { in fd_cleanup_bo_cache()
96 bo = LIST_ENTRY(struct fd_bo, bucket->list.next, list); in fd_cleanup_bo_cache()
118 struct fd_bo_bucket *bucket = &dev->cache_bucket[i]; in get_bucket() local
119 if (bucket->size >= size) { in get_bucket()
120 return bucket; in get_bucket()
136 struct fd_bo_bucket *bucket, uint32_t flags) in find_in_bucket() argument
148 while (!LIST_IS_EMPTY(&bucket->list)) { in find_in_bucket()
149 bo = LIST_ENTRY(struct fd_bo, bucket->list.next, list); in find_in_bucket()
174 struct fd_bo_bucket *bucket; in fd_bo_new() local
[all …]
/external/icu/icu4c/source/i18n/
Dalphaindex.cpp149 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, i); in getBucketIndex() local
151 collatorPrimaryOnly.compare(name, bucket->lowerBoundary_, errorCode); in getBucketIndex()
158 const AlphabeticIndex::Bucket *bucket = getBucket(*bucketList_, start); in getBucketIndex() local
159 if (bucket->displayBucket_ != NULL) { in getBucketIndex()
160 bucket = bucket->displayBucket_; in getBucketIndex()
162 return bucket->displayIndex_; in getBucketIndex()
452 Bucket *bucket = new Bucket(getUnderflowLabel(), emptyString_, U_ALPHAINDEX_UNDERFLOW); in createBucketList() local
453 if (bucket == NULL) { in createBucketList()
457 bucketList->addElement(bucket, errorCode); in createBucketList()
482 bucket = new Bucket(getInflowLabel(), inflowBoundary, U_ALPHAINDEX_INFLOW); in createBucketList()
[all …]
/external/icu/icu4j/main/tests/collate/src/com/ibm/icu/dev/test/collator/
DAlphabeticIndexTest.java225 Bucket<Integer> bucket = find(alphabeticIndex, probe); in TestA() local
227 expectedLabel, bucket.getLabel()); in TestA()
232 for (Bucket<Integer> bucket : alphabeticIndex) { in find()
233 for (Record<Integer> record : bucket) { in find()
235 return bucket; in find()
310 for (Bucket<String> bucket : alphabeticIndex) { in TestEmpty()
312 LabelType labelType = bucket.getLabelType(); in TestEmpty()
341 for (Bucket<Double> bucket : alphabeticIndex) { in TestInflow()
342 LabelType labelType = bucket.getLabelType(); in TestInflow()
388 for (AlphabeticIndex.Bucket<Integer> bucket : index) { in checkBuckets()
[all …]
/external/mesa3d/src/gallium/auxiliary/cso_cache/
Dcso_hash.c193 struct cso_node **bucket = hash->buckets; in cso_data_first_node() local
196 if (*bucket != e) in cso_data_first_node()
197 return *bucket; in cso_data_first_node()
198 ++bucket; in cso_data_first_node()
264 struct cso_node **bucket = (struct cso_node **)(hash->data.d->buckets); in cso_hash_delete() local
267 struct cso_node *cur = *bucket++; in cso_hash_delete()
309 struct cso_node **bucket; in cso_hash_data_next() local
321 bucket = a.d->buckets + start; in cso_hash_data_next()
324 if (*bucket != a.e) in cso_hash_data_next()
325 return *bucket; in cso_hash_data_next()
[all …]
/external/libnl/lib/route/sch/
Dtbf.c235 int bucket) in calc_limit() argument
240 limit += bucket; in calc_limit()
340 static inline int calc_cell_log(int cell, int bucket) in calc_cell_log() argument
347 if (!bucket) in calc_cell_log()
348 bucket = 2047; /* defaults to cell_log=3 */ in calc_cell_log()
350 while ((bucket >> cell) > 255) in calc_cell_log()
365 int rtnl_qdisc_tbf_set_rate(struct rtnl_qdisc *qdisc, int rate, int bucket, in rtnl_qdisc_tbf_set_rate() argument
375 cell_log = calc_cell_log(cell, bucket); in rtnl_qdisc_tbf_set_rate()
380 tbf->qt_rate_bucket = bucket; in rtnl_qdisc_tbf_set_rate()
382 tbf->qt_rate_txtime = rtnl_tc_calc_txtime(bucket, rate); in rtnl_qdisc_tbf_set_rate()
[all …]
/external/antlr/antlr-3.4/runtime/C/src/
Dantlr3collections.c133 ANTLR3_UINT32 bucket; // Used to traverse the buckets in antlr3HashTableNew() local
161 for (bucket = 0; bucket < sizeHint; bucket++) in antlr3HashTableNew()
163 table->buckets[bucket].entries = NULL; in antlr3HashTableNew()
197 ANTLR3_UINT32 bucket; /* Used to traverse the buckets */ in antlr3HashFree() local
208 for (bucket = 0; bucket < table->modulo; bucket++) in antlr3HashFree()
210 thisBucket = &(table->buckets[bucket]); in antlr3HashFree()
277 pANTLR3_HASH_BUCKET bucket; in antlr3HashRemoveI() local
287 bucket = table->buckets + hash; in antlr3HashRemoveI()
295 entry = bucket->entries; /* Entry to examine */ in antlr3HashRemoveI()
296 … nextPointer = & bucket->entries; /* Where to put the next pointer of the deleted entry */ in antlr3HashRemoveI()
[all …]
/external/mockito/cglib-and-asm/src/org/mockito/cglib/core/
DCollectionUtils.java28 public static Map bucket(Collection c, Transformer t) { in bucket() method in CollectionUtils
33 List bucket = (List)buckets.get(key); in bucket() local
34 if (bucket == null) { in bucket()
35 buckets.put(key, bucket = new LinkedList()); in bucket()
37 bucket.add(value); in bucket()
/external/mesa3d/src/gallium/drivers/svga/
Dsvga_screen_cache.c100 unsigned bucket; in svga_screen_cache_lookup() local
105 bucket = svga_screen_cache_bucket(key); in svga_screen_cache_lookup()
109 curr = cache->bucket[bucket].next; in svga_screen_cache_lookup()
111 while (curr != &cache->bucket[bucket]) { in svga_screen_cache_lookup()
152 handle ? "hit" : "miss", tries, bucket); in svga_screen_cache_lookup()
304 unsigned bucket; in svga_screen_cache_flush() local
322 bucket = svga_screen_cache_bucket(&entry->key); in svga_screen_cache_flush()
323 LIST_ADD(&entry->bucket_head, &cache->bucket[bucket]); in svga_screen_cache_flush()
374 LIST_INITHEAD(&cache->bucket[i]); in svga_screen_cache_init()
/external/jmonkeyengine/engine/src/core-plugins/com/jme3/export/binary/
DBinaryExporter.java242 ArrayList<BinaryIdContentPair> bucket = alreadySaved in save() local
244 int prevLoc = findPrevMatch(pair, bucket); in save()
251 if (bucket == null) { in save()
252 bucket = new ArrayList<BinaryIdContentPair>(); in save()
253 alreadySaved.put(savableName + getChunk(pair), bucket); in save()
255 bucket.add(pair); in save()
308 ArrayList<BinaryIdContentPair> bucket) { in findPrevMatch() argument
309 if (bucket == null) in findPrevMatch()
311 for (int x = bucket.size(); --x >= 0;) { in findPrevMatch()
312 BinaryIdContentPair pair = bucket.get(x); in findPrevMatch()

1234