| /prebuilts/go/darwin-x86/src/runtime/ |
| hashmap_fast.go | 26 b = (*bmap)(h.buckets)
30 b = (*bmap)(add(h.buckets, (hash&m)*uintptr(t.bucketsize)))
33 // There used to be half as many buckets; mask down one more power of two.
75 b = (*bmap)(h.buckets)
79 b = (*bmap)(add(h.buckets, (hash&m)*uintptr(t.bucketsize)))
82 // There used to be half as many buckets; mask down one more power of two.
124 b = (*bmap)(h.buckets)
128 b = (*bmap)(add(h.buckets, (hash&m)*uintptr(t.bucketsize)))
131 // There used to be half as many buckets; mask down one more power of two.
173 b = (*bmap)(h.buckets)
[all...] |
| /prebuilts/go/linux-x86/src/runtime/ |
| hashmap_fast.go | 26 b = (*bmap)(h.buckets)
30 b = (*bmap)(add(h.buckets, (hash&m)*uintptr(t.bucketsize)))
33 // There used to be half as many buckets; mask down one more power of two.
75 b = (*bmap)(h.buckets)
79 b = (*bmap)(add(h.buckets, (hash&m)*uintptr(t.bucketsize)))
82 // There used to be half as many buckets; mask down one more power of two.
124 b = (*bmap)(h.buckets)
128 b = (*bmap)(add(h.buckets, (hash&m)*uintptr(t.bucketsize)))
131 // There used to be half as many buckets; mask down one more power of two.
173 b = (*bmap)(h.buckets)
[all...] |
| /frameworks/opt/net/wifi/tests/wifitests/src/com/android/server/wifi/scanner/ |
| BackgroundScanSchedulerTest.java | 481 assertBucketChannels(schedule.buckets[0], expectedBucketChannelSet);
514 assertBucketChannels(schedule.buckets[0], expectedBucketChannelSet);
547 assertBucketChannels(schedule.buckets[0], expectedBucketChannelSet);
551 assertBucketChannels(schedule.buckets[1], expectedBucketChannelSet);
557 * across the lower time period buckets.
586 assertBucketChannels(schedule.buckets[0], expectedBucketChannelSet);
590 assertBucketChannels(schedule.buckets[1], expectedBucketChannelSet);
598 assertBucketChannels(schedule.buckets[2], expectedBucketChannelSet);
604 * across the lower time period buckets and the last bucket is split into 2 because the
635 assertBucketChannels(schedule.buckets[0], expectedBucketChannelSet)
[all...] |
| /external/libdrm/amdgpu/ |
| util_hash.c | 85 struct util_node **buckets; member in struct:util_hash_data
144 struct util_node **oldBuckets = hash->buckets;
150 hash->buckets = malloc(sizeof(struct util_node*) * hash->numBuckets);
152 hash->buckets[i] = e;
166 beforeFirstNode = &hash->buckets[h % hash->numBuckets];
196 struct util_node **bucket = hash->buckets;
211 node = (struct util_node **)(&hash->data.d->buckets[akey % hash->data.d->numBuckets]);
254 hash->data.d->buckets = 0;
267 struct util_node **bucket = (struct util_node **)(hash->data.d->buckets);
277 free(hash->data.d->buckets);
[all...] |
| /external/ltp/utils/ffsb-6.0-rc2/ |
| ffsb_stats.h | 33 * -- called "buckets"
65 struct stat_bucket *buckets; member in struct:ffsb_stats_config
85 uint32_t *buckets[FFSB_NUM_SYSCALLS]; /* bucket counters */ member in struct:ffsb_stats_data
|
| /external/skia/infra/branch-config/ |
| cq.cfg | 35 buckets {
40 buckets {
44 buckets {
|
| /external/llvm/include/llvm/ADT/ |
| DenseMap.h | 272 /// somewhere into the DenseMap's array of buckets (i.e. either to a key or
278 /// getPointerIntoBucketsArray() - Return an opaque pointer into the buckets
304 "# initial buckets must be a power of two!");
310 /// Returns the number of buckets to allocate to ensure that the DenseMap can
475 // the buckets are empty (meaning that many are filled with tombstones),
497 // so that when growing buckets we have self-consistent entry count.
592 BucketT *Buckets;
620 operator delete(Buckets);
626 std::swap(Buckets, RHS.Buckets);
[all...] |
| /external/emma/core/java12/com/vladium/util/ |
| SoftValueMap.java | 61 * @param initialCapacity initial number of hash buckets in the table
163 final SoftEntry [] buckets = m_buckets; local
164 final int bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length;
169 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
234 SoftEntry [] buckets = m_buckets; local
235 int bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length;
238 for (SoftEntry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
281 buckets = m_buckets;
282 bucketIndex = (keyHashCode & 0x7FFFFFFF) % buckets.length;
283 final SoftEntry bucketListHead = buckets [bucketIndex]
301 final SoftEntry [] buckets = m_buckets; local
345 final SoftEntry [] buckets = m_buckets; local
476 final SoftEntry [] buckets = m_buckets; local
[all...] |
| /external/llvm/lib/Support/ |
| FoldingSet.cpp | 188 /// The problem with this is that the start of the hash buckets are not
209 static void **GetBucketFor(unsigned Hash, void **Buckets, unsigned NumBuckets) {
212 return Buckets + BucketNum;
217 void **Buckets = static_cast<void**>(calloc(NumBuckets+1, sizeof(void*)));
219 Buckets[NumBuckets] = reinterpret_cast<void*>(-1);
220 return Buckets;
232 Buckets = AllocateBuckets(NumBuckets);
237 : Buckets(Arg.Buckets), NumBuckets(Arg.NumBuckets), NumNodes(Arg.NumNodes) {
238 Arg.Buckets = nullptr
[all...] |
| /frameworks/compile/slang/tests/P_reduce_general_examples/ |
| reduce_general_examples.rs | 128 #define BUCKETS 256
129 typedef uint32_t Histogram[BUCKETS];
134 for (int i = 0; i < BUCKETS; ++i)
144 for (int i = 1; i < BUCKETS; ++i)
|
| /frameworks/compile/slang/tests/P_reduce_general_examples_backward/ |
| reduce_general_examples_backward.rs | 125 #define BUCKETS 256
126 typedef uint32_t Histogram[BUCKETS];
131 for (int i = 0; i < BUCKETS; ++i)
140 for (int i = 1; i < BUCKETS; ++i)
|
| /frameworks/rs/tests/java_api/RSTest_CompatLib/src/com/android/rs/test/ |
| reduce.rs | 132 #define BUCKETS 256
133 typedef uint32_t Histogram[BUCKETS];
138 for (int i = 0; i < BUCKETS; ++i)
148 for (int i = 1; i < BUCKETS; ++i)
|
| reduce_backward.rs | 128 #define BUCKETS 256
129 typedef uint32_t Histogram[BUCKETS];
134 for (int i = 0; i < BUCKETS; ++i)
143 for (int i = 1; i < BUCKETS; ++i)
|
| /frameworks/rs/tests/java_api/RsTest/src/com/android/rs/test/ |
| reduce_backward.rs | 130 #define BUCKETS 256
131 typedef uint32_t Histogram[BUCKETS];
136 for (int i = 0; i < BUCKETS; ++i)
145 for (int i = 1; i < BUCKETS; ++i)
|
| /packages/apps/Gallery2/src/com/android/gallery3d/util/ |
| BucketNames.java | 20 * Bucket names for buckets that are created and used in the Gallery.
|
| /external/clang/include/clang/Lex/ |
| HeaderMapTypes.h | 35 uint32_t NumBuckets; // Number of buckets (always a power of 2).
38 // Strings follow the buckets, at StringsOffset.
|
| /external/clang/unittests/Lex/ |
| HeaderMapTest.cpp | 27 HMapBucket Buckets[NumBuckets];
35 Header.StringsOffset = sizeof(Header) + sizeof(Buckets);
79 if (!File.Buckets[I].Key) {
80 File.Buckets[I].Key = Key;
81 File.Buckets[I].Prefix = Prefix;
82 File.Buckets[I].Suffix = Suffix;
89 llvm_unreachable("no empty buckets");
139 ASSERT_EQ(3 * sizeof(HMapBucket), sizeof(File.Buckets));
|
| /external/fio/ |
| stat.h | 42 * FIO_IO_U_PLAT_NR is the total number of buckets.
47 * method is to keep an array of (999 + 1) buckets, in which a counter
54 * example, let the buckets be {[0,99],[100,199],...,[900,999]}, and
57 * use buckets with non-uniform ranges, while bounding the error of
59 * would be when error_bound = 0.005, buckets are {
62 * groups with different ranges, then buckets with uniform ranges. An
85 * as the index, each group must contains 2^M buckets.
90 * Group MSB #discarded range of #buckets
|
| /external/jemalloc/include/jemalloc/internal/ |
| ckh.h | 49 * Minimum and current number of hash table buckets. There are
59 /* Hash table with 2^lg_curbuckets buckets. */
|
| /external/libchrome/base/metrics/ |
| sample_vector_unittest.cc | 21 // Custom buckets: [1, 5) [5, 10)
48 // Custom buckets: [1, 250000000) [250000000, 500000000)
75 // Custom buckets: [0, 1) [1, 2) [2, 3) [3, INT_MAX)
120 // 8 buckets with exponential layout:
139 // Custom buckets: [1, 5) [5, 10)
141 // have overflow buckets.
162 // Custom buckets 1: [1, 3) [3, 5)
169 // Custom buckets 2: [0, 1) [1, 3) [3, 6) [6, 7)
|
| /external/selinux/libselinux/man/man3/ |
| avc_cache_stats.3 | 25 produce log messages indicating the status of the access decision and SID tables, respectively. The messages contain the number of entries in the table, number of hash buckets and number of buckets used, and maximum number of entries in a single bucket.
|
| /external/v8/infra/config/ |
| cq.cfg | 27 buckets {
110 buckets {
|
| /external/webrtc/webrtc/modules/remote_bitrate_estimator/ |
| rate_statistics.cc | 18 : num_buckets_(window_size_ms + 1), // N ms in (N+1) buckets.
77 // This guarantees we go through all the buckets at most once, even if
|
| /packages/apps/Gallery2/src/com/android/gallery3d/data/ |
| BucketHelper.java | 98 ContentResolver resolver, Uri tableUri, HashMap<Integer, BucketEntry> buckets) {
109 BucketEntry entry = buckets.get(bucketId);
112 buckets.put(bucketId, entry);
125 HashMap<Integer, BucketEntry> buckets = new HashMap<Integer, BucketEntry>(64); local
128 jc, resolver, Images.Media.EXTERNAL_CONTENT_URI, buckets);
132 jc, resolver, Video.Media.EXTERNAL_CONTENT_URI, buckets);
134 BucketEntry[] entries = buckets.values().toArray(new BucketEntry[buckets.size()]);
|
| /external/llvm/include/llvm/Support/ |
| GenericDomTreeConstruction.h | 180 // Instead of using a bucket per vertex, we use a single array Buckets that
182 // Buckets[i] stores the index of the first element in V's bucket. After V's
183 // bucket is processed, Buckets[i] stores the index of the next element in the
185 SmallVector<unsigned, 32> Buckets;
186 Buckets.resize(N + 1);
188 Buckets[i] = i;
196 for (unsigned j = i; Buckets[j] != i; j = Buckets[j]) {
197 typename GraphT::NodeType* V = DT.Vertex[Buckets[j]];
224 Buckets[i] = Buckets[WInfo.Semi]
[all...] |
