| /external/v8/src/js/ |
| D | collection.js | 34 function HashToEntry(table, hash, numBuckets) { argument
35 var bucket = ORDERED_HASH_TABLE_HASH_TO_BUCKET(hash, numBuckets);
41 function SetFindEntry(table, numBuckets, key, hash) { argument
42 var entry = HashToEntry(table, hash, numBuckets);
44 var candidate = ORDERED_HASH_SET_KEY_AT(table, entry, numBuckets);
51 entry = ORDERED_HASH_SET_CHAIN_AT(table, entry, numBuckets);
53 candidate = ORDERED_HASH_SET_KEY_AT(table, entry, numBuckets);
61 function MapFindEntry(table, numBuckets, key, hash) { argument
62 var entry = HashToEntry(table, hash, numBuckets);
64 var candidate = ORDERED_HASH_MAP_KEY_AT(table, entry, numBuckets);
[all …]
|
| D | macros.py | 227 macro ORDERED_HASH_TABLE_HASH_TO_BUCKET(hash, numBuckets) = (hash & ((numBuckets) - 1));
229 macro ORDERED_HASH_SET_ENTRY_TO_INDEX(entry, numBuckets) = (3 + (numBuckets) + ((entry) << 1));
230 …ED_HASH_SET_KEY_AT(table, entry, numBuckets) = (FIXED_ARRAY_GET(table, ORDERED_HASH_SET_ENTRY_TO_I…
231 …_HASH_SET_CHAIN_AT(table, entry, numBuckets) = (FIXED_ARRAY_GET(table, ORDERED_HASH_SET_ENTRY_TO_I…
233 macro ORDERED_HASH_MAP_ENTRY_TO_INDEX(entry, numBuckets) = (3 + (numBuckets) + ((entry) * 3));
234 …ED_HASH_MAP_KEY_AT(table, entry, numBuckets) = (FIXED_ARRAY_GET(table, ORDERED_HASH_MAP_ENTRY_TO_I…
235 …_HASH_MAP_VALUE_AT(table, entry, numBuckets) = (FIXED_ARRAY_GET(table, ORDERED_HASH_MAP_ENTRY_TO_I…
236 …_HASH_MAP_CHAIN_AT(table, entry, numBuckets) = (FIXED_ARRAY_GET(table, ORDERED_HASH_MAP_ENTRY_TO_I…
|
| /external/libdrm/amdgpu/ |
| D | util_hash.c | 90 int numBuckets; member
145 int oldNumBuckets = hash->numBuckets; in util_data_rehash()
149 hash->numBuckets = primeForNumBits(hint); in util_data_rehash()
150 hash->buckets = malloc(sizeof(struct util_node*) * hash->numBuckets); in util_data_rehash()
151 for (i = 0; i < hash->numBuckets; ++i) in util_data_rehash()
166 beforeFirstNode = &hash->buckets[h % hash->numBuckets]; in util_data_rehash()
180 if (hash->size >= hash->numBuckets) in util_data_might_grow()
186 if (hash->size <= (hash->numBuckets >> 3) && in util_data_has_shrunk()
197 int n = hash->numBuckets; in util_data_first_node()
210 if (hash->data.d->numBuckets) { in util_hash_find_node()
[all …]
|
| /external/mesa3d/src/gallium/auxiliary/cso_cache/ |
| D | cso_hash.c | 87 int numBuckets; member
142 int oldNumBuckets = hash->numBuckets; in cso_data_rehash()
146 hash->numBuckets = primeForNumBits(hint); in cso_data_rehash()
147 hash->buckets = MALLOC(sizeof(struct cso_node*) * hash->numBuckets); in cso_data_rehash()
148 for (i = 0; i < hash->numBuckets; ++i) in cso_data_rehash()
163 beforeFirstNode = &hash->buckets[h % hash->numBuckets]; in cso_data_rehash()
177 if (hash->size >= hash->numBuckets) in cso_data_might_grow()
183 if (hash->size <= (hash->numBuckets >> 3) && in cso_data_has_shrunk()
194 int n = hash->numBuckets; in cso_data_first_node()
207 if (hash->data.d->numBuckets) { in cso_hash_find_node()
[all …]
|
| /external/mesa3d/src/gallium/auxiliary/pipebuffer/ |
| D | pb_bufmgr_slab.c | 158 unsigned numBuckets; member
496 for (i = 0; i < mgr->numBuckets; ++i) { in pb_slab_range_manager_create_buffer()
526 for (i = 0; i < mgr->numBuckets; ++i) in pb_slab_range_manager_destroy()
560 mgr->numBuckets = 1; in pb_slab_range_manager_create()
564 ++mgr->numBuckets; in pb_slab_range_manager_create()
567 mgr->buckets = CALLOC(mgr->numBuckets, sizeof(*mgr->buckets)); in pb_slab_range_manager_create()
572 for (i = 0; i < mgr->numBuckets; ++i) { in pb_slab_range_manager_create()
582 for (i = 0; i < mgr->numBuckets; ++i) in pb_slab_range_manager_create()
|
| /external/pdfium/xfa/src/fxbarcode/common/ |
| D | BC_GlobalHistogramBinarizer.cpp | 124 int32_t numBuckets = buckets.GetSize(); in EstimateBlackPoint() local
129 for (x = 0; x < numBuckets; x++) { in EstimateBlackPoint()
140 for (x = 0; x < numBuckets; x++) { in EstimateBlackPoint()
153 if (secondPeak - firstPeak <= numBuckets >> 4) { in EstimateBlackPoint()
|
| /external/opencv3/modules/cudev/include/opencv2/cudev/grid/detail/ |
| D | integral.hpp | 72 int numBuckets = divUp(cols, NUM_SCAN_THREADS); in horizontal_pass() local
75 while (numBuckets--) in horizontal_pass()
115 int numBuckets = divUp(cols, NUM_SCAN_THREADS); in horizontal_pass() local
118 while (numBuckets--) in horizontal_pass()
433 int numBuckets = divUp(rows, blockDim.y); in vertical_pass() local
436 while (numBuckets--) in vertical_pass()
493 int numBuckets = divUp(rows, 8 * 4); in vertical_pass()
496 while (numBuckets--) in vertical_pass()
|
| /external/deqp/modules/gles3/performance/ |
| D | es3pBufferDataUploadTests.cpp | 1068 … samples, std::vector<UploadSampleResult<DurationType> >* buckets, int numBuckets, int& minBufferS… in bucketizeSamplesUniformly() argument
1085 …leNdx].allocatedSize - minBufferSize) / (float)(maxBufferSize - minBufferSize) * (float)numBuckets; in bucketizeSamplesUniformly()
1086 const int bucketNdx = de::clamp((int)deFloatFloor(bucketNdxFloat), 0, numBuckets-1); in bucketizeSamplesUniformly()
1698 const int numBuckets = 4; in analyzeSampleResults() local
1701 std::vector<UploadSampleResult<SampleType> > buckets[numBuckets]; in analyzeSampleResults()
1703 bucketizeSamplesUniformly(samples, &buckets[0], numBuckets, minBufferSize, maxBufferSize); in analyzeSampleResults()
1705 for (int bucketNdx = 0; bucketNdx < numBuckets; ++bucketNdx) in analyzeSampleResults()
1712 … bucketRangeMin = minBufferSize + (int)(((float) bucketNdx / (float)numBuckets) * (float)(maxBu… in analyzeSampleResults()
1713 … bucketRangeMax = minBufferSize + (int)(((float)(bucketNdx+1) / (float)numBuckets) * (float)(maxBu… in analyzeSampleResults()
|
| /external/opencv3/modules/cudalegacy/src/cuda/ |
| D | NPP_staging.cu | 280 Ncv32u numBuckets = (srcWidth + NUM_SCAN_THREADS - 1) >> LOG2_NUM_SCAN_THREADS; in scanRows() local
288 while (numBuckets--) in scanRows()
|