Searched defs:bucket (Results 1 - 25 of 79) sorted by relevance

1234

/external/mockito/cglib-and-asm/src/org/mockito/cglib/core/
H A DCollectionUtils.java28 public static Map bucket(Collection c, Transformer t) { method in class:CollectionUtils
33 List bucket = (List)buckets.get(key);
34 if (bucket == null) {
35 buckets.put(key, bucket = new LinkedList());
37 bucket.add(value);
/external/libdrm/tests/
H A Dhash.c87 static int count_entries(HashBucketPtr bucket) argument
91 for (; bucket; bucket = bucket->next)
107 HashBucketPtr bucket; local
113 bucket = table->buckets[i];
114 update_dist(count_entries(bucket));
/external/pdfium/xfa/src/fxbarcode/pdf417/
H A DBC_PDF417Codeword.cpp28 int32_t bucket,
32 m_bucket = bucket;
26 CBC_Codeword(int32_t startX, int32_t endX, int32_t bucket, int32_t cvalue) argument
/external/chromium-trace/catapult/telemetry/telemetry/story/
H A Dstory_set.py26 cloud_storage_bucket: The cloud storage bucket used to download
88 def bucket(self): member in class:StorySet
96 os.path.join(self.base_dir, self.archive_data_file), self.bucket)
/external/fio/
H A Dfilehash.c49 struct flist_head *bucket = &file_hash[hash(name)]; local
52 flist_for_each(n, bucket) {
/external/libchrome/base/trace_event/
H A Dtrace_sampling_thread.cc16 TraceBucketData(base::subtle::AtomicWord* bucket,
21 TRACE_EVENT_API_ATOMIC_WORD* bucket; member in class:base::trace_event::TraceBucketData
47 TRACE_EVENT_API_ATOMIC_LOAD(*bucket_data->bucket);
69 TRACE_EVENT_API_ATOMIC_WORD* bucket,
76 sample_buckets_.push_back(TraceBucketData(bucket, name, callback));
95 TraceBucketData::TraceBucketData(base::subtle::AtomicWord* bucket, argument
98 : bucket(bucket), bucket_name(name), callback(callback) {}
68 RegisterSampleBucket( TRACE_EVENT_API_ATOMIC_WORD* bucket, const char* const name, TraceSampleCallback callback) argument
/external/libdrm/
H A Dxf86drmHash.c127 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
178 HashBucketPtr bucket; local
191 HashBucketPtr bucket; local
214 HashBucketPtr bucket; local
[all...]
/external/mesa3d/src/gallium/drivers/svga/
H A Dsvga_screen_cache.h79 /** Head for the bucket lists. */
107 struct list_head bucket[SVGA_HOST_SURFACE_CACHE_BUCKETS]; member in struct:svga_host_surface_cache
H A Dsvga_screen_cache.c77 * Compute the bucket for this key.
100 unsigned bucket; local
105 bucket = svga_screen_cache_bucket(key);
109 curr = cache->bucket[bucket].next;
111 while (curr != &cache->bucket[bucket]) {
151 debug_printf("%s: cache %s after %u tries (bucket %d)\n", __FUNCTION__,
152 handle ? "hit" : "miss", tries, bucket);
304 unsigned bucket; local
[all...]
/external/blktrace/
H A Dstats.h116 static inline void histlog2_account(__u32 *bucket, __u32 val, argument
120 bucket[index]++;
/external/ceres-solver/internal/ceres/
H A Dreorder_program.cc189 // extra bucket at the end to catch all non-eliminated F blocks.
202 // each histogram bucket (where each bucket is for the residuals for that
218 // Fill in each bucket with the residual blocks for its corresponding E block.
219 // Each bucket is individually filled from the back of the bucket to the front
220 // of the bucket. The filling order among the buckets is dictated by the
222 // from each offset as a residual block is placed in the bucket. When the
228 int bucket = min_position_per_residual[i]; local
231 offsets[bucket]
[all...]
/external/dexmaker/src/dx/java/com/android/dx/ssa/
H A DDominators.java213 info[vertex.get(wInfo.semidom).getIndex()].bucket.add(w);
224 wParentBucket = info[wInfo.parent.getIndex()].bucket;
279 public ArrayList<SsaBasicBlock> bucket; field in class:Dominators.DFSInfo
282 bucket = new ArrayList<SsaBasicBlock>();
/external/jmonkeyengine/engine/src/core/com/jme3/renderer/queue/
H A DRenderQueue.java71 * The render queue <code>Bucket</code> specifies the bucket
75 * bucket the spatial is placed. A spatial's queue bucket can be set
100 * spatials in this bucket will appear behind everything, the downside
101 * to this bucket is that 3D objects will not be rendered correctly
165 * Sets a different geometry comparator for the specified bucket, one
171 * bucket since there is no correct way to sort the transparent bucket
183 * sorts purely back to front by leading bounding edge with no material sort. this bucket is rendered after post processors.
189 public void setGeometryComparator(Bucket bucket, GeometryComparato argument
255 addToQueue(Geometry g, Bucket bucket) argument
324 isQueueEmpty(Bucket bucket) argument
341 renderQueue(Bucket bucket, RenderManager rm, Camera cam) argument
345 renderQueue(Bucket bucket, RenderManager rm, Camera cam, boolean clear) argument
[all...]
/external/jmonkeyengine/engine/src/core-plugins/com/jme3/export/binary/
H A DBinaryExporter.java242 ArrayList<BinaryIdContentPair> bucket = alreadySaved
244 int prevLoc = findPrevMatch(pair, bucket);
251 if (bucket == null) {
252 bucket = new ArrayList<BinaryIdContentPair>();
253 alreadySaved.put(savableName + getChunk(pair), bucket);
255 bucket.add(pair);
308 ArrayList<BinaryIdContentPair> bucket) {
309 if (bucket == null)
311 for (int x = bucket.size(); --x >= 0;) {
312 BinaryIdContentPair pair = bucket
307 findPrevMatch(BinaryIdContentPair oldPair, ArrayList<BinaryIdContentPair> bucket) argument
[all...]
/external/libdrm/freedreno/
H A Dfreedreno_bo.c56 /* don't break the bucket if this bo was found in one */
95 struct fd_bo_bucket *bucket = &dev->cache_bucket[i]; local
98 while (!LIST_IS_EMPTY(&bucket->list)) {
99 bo = LIST_ENTRY(struct fd_bo, bucket->list.next, list);
118 * way to the correct bucket size rather than looping..
121 struct fd_bo_bucket *bucket = &dev->cache_bucket[i]; local
122 if (bucket->size >= size) {
123 return bucket;
139 struct fd_bo_bucket *bucket, uint32_t flags)
151 while (!LIST_IS_EMPTY(&bucket
138 find_in_bucket(struct fd_device *dev, struct fd_bo_bucket *bucket, uint32_t flags) argument
177 struct fd_bo_bucket *bucket; local
304 struct fd_bo_bucket *bucket = get_bucket(dev, bo->size); local
[all...]
/external/llvm/lib/CodeGen/AsmPrinter/
H A DDwarfAccelTable.cpp54 // Then compute the bucket size, minimum of 1 bucket.
87 // Figure out how many buckets we need, then compute the bucket
94 // Compute bucket contents and final ordering.
97 uint32_t bucket = Data[i]->HashValue % Header.bucket_count; local
98 Buckets[bucket].push_back(Data[i]);
162 // bucket.
180 // element in each bucket. This is done via a symbol subtraction from the
204 // the bucket. For the string case emit the dies and the various offsets.
205 // Terminate each HashData bucket wit
[all...]
/external/mesa3d/src/mesa/program/
H A Dhash_table.c115 const unsigned bucket = hash_value % ht->num_buckets; local
118 foreach(node, & ht->buckets[bucket]) {
141 const unsigned bucket = hash_value % ht->num_buckets; local
149 insert_at_head(& ht->buckets[bucket], & node->link);
156 const unsigned bucket = hash_value % ht->num_buckets; local
160 foreach(node, & ht->buckets[bucket]) {
174 insert_at_head(& ht->buckets[bucket], & hn->link);
196 int bucket; local
198 for (bucket = 0; bucket < h
[all...]
/external/freetype/src/cache/
H A Dftccache.c87 /* get a top bucket for specified hash from cache,
130 * the bucket lists
144 /* split a single bucket */
488 FTC_Node* bucket; local
501 bucket = pnode = FTC_NODE__TOP_FOR_HASH( cache, hash );
520 /* Update bucket by modified linked list */
521 bucket = pnode = FTC_NODE__TOP_FOR_HASH( cache, hash );
537 if ( node != *bucket )
540 node->link = *bucket;
541 *bucket
575 FTC_Node* bucket = cache->buckets + i; local
[all...]
/external/jemalloc/src/
H A Dckh.c4 * 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) argument
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
92 ckh_try_bucket_insert(ckh_t *ckh, size_t bucket, const void *key, const void *data) argument
129 size_t hashes[2], bucket, tbucket; local
197 size_t hashes[2], bucket; local
[all...]
/external/libvpx/libvpx/
H A Drate_hist.c33 struct hist_bucket bucket[RATE_BINS]; member in struct:rate_hist
57 hist->bucket[i].low = INT_MAX;
58 hist->bucket[i].high = 0;
59 hist->bucket[i].count = 0;
115 if (hist->bucket[idx].low > avg_bitrate)
116 hist->bucket[idx].low = (int)avg_bitrate;
117 if (hist->bucket[idx].high < avg_bitrate)
118 hist->bucket[idx].high = (int)avg_bitrate;
119 hist->bucket[idx].count++;
123 static int merge_hist_buckets(struct hist_bucket *bucket, argument
191 show_histogram(const struct hist_bucket *bucket, int buckets, int total, int scale) argument
251 struct hist_bucket bucket[64]; local
[all...]
/external/mesa3d/src/gallium/drivers/nouveau/
H A Dnouveau_mm.c29 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
213 struct mm_bucket *bucket = mm_bucket_by_order(slab->cache, slab->order); local
[all...]
/external/mesa3d/src/glx/
H A Dglxhash.c179 __glxHashBucketPtr bucket; local
187 for (bucket = table->buckets[i]; bucket;) {
188 next = bucket->next;
189 HASH_FREE(bucket);
190 bucket = next;
197 /* Find the bucket and organize the list so that this bucket is at the
205 __glxHashBucketPtr bucket; local
210 for (bucket
234 __glxHashBucketPtr bucket; local
250 __glxHashBucketPtr bucket; local
277 __glxHashBucketPtr bucket; local
337 count_entries(__glxHashBucketPtr bucket) argument
359 __glxHashBucketPtr bucket; local
[all...]
/external/parameter-framework/asio/include/asio/detail/
H A Dhash_map.hpp103 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]
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/parameter-framework/asio-1.10.6/include/asio/detail/
H A Dhash_map.hpp103 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]
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/icu/icu4c/source/test/intltest/
H A Dalphaindextst.cpp33 const AlphabeticIndex::Bucket *bucket; local
34 for (int32_t i = 0; (bucket = index.getBucket(i)) != NULL; ++i) {
38 dest.append(bucket->getLabel());
368 assertEquals("initial bucket index", -1, index.getBucketIndex());
372 assertEquals("bucket index", bucketIndex, index.getBucketIndex());
377 const AlphabeticIndex::Bucket *bucket = immIndex->getBucket(bucketIndex); local
378 TEST_ASSERT(bucket != NULL);
379 assertEquals("bucket label vs. immutable: locale=" + UnicodeString(localeName) +
381 label, bucket->getLabel());
382 TEST_ASSERT(&label != &bucket
[all...]

Completed in 526 milliseconds

1234