| /art/test/102-concurrent-gc/src/ |
| Main.java | 20 private static final int buckets = 16 * 1024; field in class:Main
28 ByteContainer[] l = new ByteContainer[buckets];
30 for (int i = 0; i < buckets; ++i) {
35 for (int i = 0; i < buckets / 256; ++i) {
36 int index = rnd.nextInt(buckets);
|
| /external/qemu/android/utils/ |
| refset.h | 25 AVECTOR_DECL(void*,buckets);
32 AVECTOR_INIT(s,buckets);
38 AVECTOR_DONE(s,buckets);
44 AVECTOR_CLEAR(s,buckets);
51 return (int) AVECTOR_SIZE(s,buckets);
68 void* __refset_item = (_set)->buckets[__refset_nn]; \
|
| refset.c | 36 void** pnode = &s->buckets[index];
55 void** pnode = &s->buckets[index];
90 AVECTOR_INIT_ALLOC(&newSet,buckets, newSize);
93 void* item = s->buckets[nn];
100 AVECTOR_DONE(s,buckets);
101 s->buckets = newSet.buckets;
118 AVECTOR_INIT_ALLOC(s,buckets,4);
165 if (s->buckets[nn] == AREFSET_DELETED) {
166 s->buckets[nn] = NULL
[all...] |
| /external/emma/core/java12/com/vladium/util/ |
| IntObjectMap.java | 48 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1].
87 final Entry [] buckets = m_buckets; local
88 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
112 final Entry [] buckets = m_buckets; local
113 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
116 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
164 Entry [] buckets = m_buckets; local
165 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
189 buckets = m_buckets
248 final Entry [] buckets = m_buckets; local
[all...] |
| IntIntMap.java | 48 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1].
87 final Entry [] buckets = m_buckets; local
88 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
91 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
111 final Entry [] buckets = m_buckets; local
112 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
115 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
130 final Entry [] buckets = m_buckets; local
131 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
134 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next
178 Entry [] buckets = m_buckets; local
221 Entry [] buckets = m_buckets; local
290 final Entry [] buckets = m_buckets; local
[all...] |
| IntSet.java | 46 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1].
85 final Entry [] buckets = m_buckets; local
86 final int bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
89 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
145 Entry [] buckets = m_buckets; local
146 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
161 buckets = m_buckets;
162 bucketIndex = (key & 0x7FFFFFFF) % buckets.length;
163 final Entry bucketListHead = buckets [bucketIndex];
165 buckets [bucketIndex] = newEntry
220 final Entry [] buckets = m_buckets; local
[all...] |
| ObjectIntMap.java | 50 * @param initialCapacity initial number of hash buckets in the table [may not be negative, 0 is equivalent to 1].
91 final Entry [] buckets = m_buckets; local
93 final int bucketIndex = (keyHash & 0x7FFFFFFF) % buckets.length;
96 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
119 final Entry [] buckets = m_buckets; local
121 final int bucketIndex = (keyHash & 0x7FFFFFFF) % buckets.length;
124 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
171 Entry [] buckets = m_buckets; local
172 for (Entry entry = buckets [bucketIndex]; entry != null; entry = entry.m_next)
193 buckets = m_buckets
217 Entry [] buckets = m_buckets; local
286 final Entry [] buckets = m_buckets; local
[all...] |
| 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...] |
| /development/tools/axl/ |
| chewperf.py | 62 buckets = {}
66 if bucket in buckets:
67 buckets[bucket] += bytes
69 buckets[bucket] = bytes
71 top = max(buckets.keys())
73 if x not in buckets.keys():
74 buckets[x] = 0
79 for x in range(len(buckets.items())):
80 window[x % len(window)] = buckets.items()[x][1]
81 print "%s\t%s" % (buckets.items()[x][0], sum(window) / len(window)
[all...] |
| /external/chromium_org/tools/telemetry/telemetry/value/ |
| histogram_util_unittest.py | 12 baseline_histogram = """{"count": 3, "buckets": [
16 later_histogram = """{"count": 14, "buckets": [
24 for b in new_histogram['buckets']:
33 histograms.append("""{"count": 3, "buckets": [
37 histograms.append("""{"count": 20, "buckets": [
41 histograms.append("""{"count": 15, "buckets": [
48 for b in new_histogram['buckets']:
|
| histogram.py | 40 assert 'buckets' in raw_value
41 assert isinstance(raw_value['buckets'], list)
42 self.buckets = []
43 for bucket in raw_value['buckets']:
44 self.buckets.append(HistogramValueBucket(
49 self.buckets = []
83 return '{"buckets": [%s]}' % (
84 ', '.join([b.ToJSONString() for b in self.buckets]))
100 d['buckets'] = [b.AsDict() for b in self.buckets]
[all...] |
| histogram_util.py | 32 if 'buckets' not in start_histogram:
43 for b in start_histogram['buckets']:
47 for b in histogram['buckets']:
57 histogram['buckets'] = new_buckets
73 buckets = collections.defaultdict(int)
76 for b in h['buckets']:
78 buckets[key] += b['count']
80 buckets = [{'low': key[0], 'high': key[1], 'count': value}
81 for key, value in buckets.iteritems()]
82 buckets.sort(key = lambda h : h['low']
[all...] |
| /frameworks/ex/common/tools/ |
| make-iana-tld-pattern.py | 101 def getBucket(buckets, line):
103 bucket = buckets.get(letter)
107 buckets[letter] = bucket
111 def makePattern(prefix, suffix, buckets, isWebUrl=False):
114 output += getBucket(buckets, 'a').dump(isFirst=True, isWebUrl=isWebUrl)
117 output += getBucket(buckets, chr(letter)).dump(isWebUrl=isWebUrl)
119 output += getBucket(buckets, 'z').dump(isLast=True, isWebUrl=isWebUrl)
135 buckets = {} variable
141 getBucket(buckets, domain[0]).add(domain.strip())
147 getBucket(buckets, 'xn--').add(result[2:-1]
[all...] |
| /external/chromium_org/third_party/libvpx/source/libvpx/ |
| rate_hist.c | 123 int buckets = *num_buckets; local
126 /* Find the extrema for this list of buckets */
128 for (i = 0; i < buckets; i++) {
135 /* If we have too many buckets, merge the smallest with an adjacent
138 while (buckets > max_buckets) {
139 int last_bucket = buckets - 1;
152 assert(small_bucket < buckets);
153 assert(big_bucket < buckets);
154 assert(merge_bucket < buckets);
167 buckets--
249 int buckets = 0; local
271 int buckets = 0; local
[all...] |
| /external/libvpx/libvpx/ |
| rate_hist.c | 123 int buckets = *num_buckets; local
126 /* Find the extrema for this list of buckets */
128 for (i = 0; i < buckets; i++) {
135 /* If we have too many buckets, merge the smallest with an adjacent
138 while (buckets > max_buckets) {
139 int last_bucket = buckets - 1;
152 assert(small_bucket < buckets);
153 assert(big_bucket < buckets);
154 assert(merge_bucket < buckets);
167 buckets--
249 int buckets = 0; local
271 int buckets = 0; local
[all...] |
| /hardware/intel/common/omx-components/videocodec/libvpx_internal/libvpx/ |
| rate_hist.c | 123 int buckets = *num_buckets; local
126 /* Find the extrema for this list of buckets */
128 for (i = 0; i < buckets; i++) {
135 /* If we have too many buckets, merge the smallest with an adjacent
138 while (buckets > max_buckets) {
139 int last_bucket = buckets - 1;
152 assert(small_bucket < buckets);
153 assert(big_bucket < buckets);
154 assert(merge_bucket < buckets);
167 buckets--
249 int buckets = 0; local
271 int buckets = 0; local
[all...] |
| /external/chromium_org/third_party/WebKit/Tools/Scripts/webkitpy/layout_tests/ |
| bisect_test_ordering.py | 62 self.buckets = [Bucket([self.expected_failure])]
69 # Split the list of test into buckets. Each bucket has at least one test required to cause
70 # the expected failure at the end. Split buckets in half until there are only buckets left
72 self.buckets = [Bucket(self.tests[:-1]), Bucket([self.expected_failure])]
87 if self.test_bucket_list_fails(self.buckets):
93 for bucket in self.buckets:
95 print '%d tests left, %d buckets' % (count, len(self.buckets))
99 for bucket in self.buckets
[all...] |
| /external/chromium_org/third_party/mesa/src/src/mesa/program/ |
| hash_table.c | 45 struct node buckets[1]; member in struct:hash_table
69 * sizeof(ht->buckets[0])));
76 make_empty_list(& ht->buckets[i]);
101 foreach_s(node, temp, & ht->buckets[i]) {
106 assert(is_empty_list(& ht->buckets[i]));
118 foreach(node, & ht->buckets[bucket]) {
149 insert_at_head(& ht->buckets[bucket], & node->link);
160 foreach(node, & ht->buckets[bucket]) {
174 insert_at_head(& ht->buckets[bucket], & hn->link);
200 foreach_s(node, temp, &ht->buckets[bucket])
[all...] |
| /external/mesa3d/src/mesa/program/ |
| hash_table.c | 45 struct node buckets[1]; member in struct:hash_table
69 * sizeof(ht->buckets[0])));
76 make_empty_list(& ht->buckets[i]);
101 foreach_s(node, temp, & ht->buckets[i]) {
106 assert(is_empty_list(& ht->buckets[i]));
118 foreach(node, & ht->buckets[bucket]) {
149 insert_at_head(& ht->buckets[bucket], & node->link);
160 foreach(node, & ht->buckets[bucket]) {
174 insert_at_head(& ht->buckets[bucket], & hn->link);
200 foreach_s(node, temp, &ht->buckets[bucket])
[all...] |
| /external/chromium_org/tools/telemetry/ |
| cloud_storage | 16 BUCKETS = {bucket: easy_bucket_name for easy_bucket_name, bucket
32 """Returns a dict of all files and which buckets they're in."""
33 # Preprocessing: get the contents of all buckets.
35 for bucket in BUCKETS:
55 for bucket in BUCKETS:
100 for file_path, buckets in sorted(files.iteritems()):
101 if buckets:
102 buckets = [BUCKETS[bucket] for bucket in buckets]
[all...] |
| /packages/apps/Gallery2/src/com/android/gallery3d/ingest/data/ |
| MtpDeviceIndex.java | 13 * Index of MTP media objects organized into "buckets," or groupings, based on the date
16 * When the index is created, the buckets are sorted in their natural
17 * order, and the items within the buckets sorted by the date they are taken.
207 DateBucket bucket = results.buckets[results.unifiedLookupIndex[position]];
216 DateBucket bucket = results.buckets[results.unifiedLookupIndex[zeroIndex]];
251 /* Although this is O(log(number of buckets)), and thus should not be used
264 int iMax = results.buckets.length - 1;
267 if (results.buckets[iMid].itemsStartIndex + results.buckets[iMid].numItems
270 } else if (results.buckets[iMid].itemsStartIndex > position)
[all...] |
| MtpDeviceIndexRunnable.java | 54 final DateBucket[] buckets; field in class:MtpDeviceIndexRunnable.Results
58 int[] unifiedLookupIndex, IngestObjectInfo[] mtpObjects, DateBucket[] buckets) {
61 this.buckets = buckets;
62 this.reversedBuckets = new DateBucket[buckets.length];
63 for (int i = 0; i < buckets.length; i++) {
64 this.reversedBuckets[i] = buckets[buckets.length - 1 - i];
106 DateBucket[] buckets = new DateBucket[numBuckets]; local
130 buckets[i] = new DateBucket(bucketTemp.getKey(), unifiedStartIndex, unifiedEndIndex
[all...] |
| /external/mockito/cglib-and-asm/src/org/mockito/cglib/core/ |
| CollectionUtils.java | 29 Map buckets = new HashMap(); local
33 List bucket = (List)buckets.get(key);
35 buckets.put(key, bucket = new LinkedList());
39 return buckets;
|
| /system/core/libcutils/ |
| hashmap.c | 35 Entry** buckets; member in struct:Hashmap
61 map->buckets = calloc(map->bucketCount, sizeof(Entry*));
62 if (map->buckets == NULL) {
115 Entry* entry = map->buckets[i];
126 free(map->buckets);
127 map->buckets = newBuckets;
143 Entry* entry = map->buckets[i];
150 free(map->buckets);
193 Entry** p = &(map->buckets[index]);
225 Entry* entry = map->buckets[index]
[all...] |
| /external/chromium_org/components/omnibox/ |
| omnibox_field_trial_unittest.cc | 353 ASSERT_EQ(3u, scoring_params.typed_count_buckets.buckets().size());
355 scoring_params.typed_count_buckets.buckets()[0]);
357 scoring_params.typed_count_buckets.buckets()[1]);
359 scoring_params.typed_count_buckets.buckets()[2]);
362 ASSERT_EQ(2u, scoring_params.visited_count_buckets.buckets().size());
364 scoring_params.visited_count_buckets.buckets()[0]);
366 scoring_params.visited_count_buckets.buckets()[1]);
370 HUPScoringParams::ScoreBuckets buckets; local
373 EXPECT_EQ(1.0, buckets.HalfLifeTimeDecay(base::TimeDelta::FromDays(7)));
375 buckets.set_half_life_days(7)
[all...] |
