| /external/bison/lib/ |
| hash.c | 54 /* The array of buckets starts at BUCKET and extends to BUCKET_LIMIT-1,
57 struct hash_entry *bucket; member in struct:hash_table
93 slot. A bucket is the collection of all entries hashing to the same slot.
96 In the ideal case, the length of each bucket is roughly the number of
99 entry is linear in time with the size of the bucket. Consequently, a
119 /* If a deletion empties a bucket and causes the ratio of used buckets to
171 /* Return the length of the longest chain (bucket). */
176 struct hash_entry const *bucket; local
179 for (bucket = table->bucket; bucket < table->bucket_limit; bucket++
203 struct hash_entry const *bucket; local
252 struct hash_entry const *bucket local
281 struct hash_entry const *bucket; local
300 struct hash_entry const *bucket local
330 struct hash_entry const *bucket; local
362 struct hash_entry const *bucket; local
607 struct hash_entry *bucket; local
650 struct hash_entry *bucket; local
747 struct hash_entry *bucket local
822 struct hash_entry *bucket; local
911 struct hash_entry *bucket; local
986 struct hash_entry *bucket; local
1031 struct hash_entry const *bucket; local
[all...] |
| /packages/apps/Gallery3D/src/com/cooliris/media/ |
| MediaBucketList.java | 32 // If only albums are selected, a bucket contains mediaSets.
33 // If items are selected, a bucket contains mediaSets and mediaItems.
41 MediaBucket bucket = buckets.get(0); local
42 if (bucket != null && !isSetSelection(bucket)) {
43 ArrayList<MediaItem> items = bucket.mediaItems;
61 MediaBucket bucket = buckets.get(0); local
62 if (bucket != null && isSetSelection(bucket)) {
63 set = bucket.mediaSet
80 MediaBucket bucket = buckets.get(i); local
109 MediaBucket bucket = null; local
205 MediaBucket bucket = selectedBuckets.get(i); local
[all...] |
| ConcatenatedDataSource.java | 55 MediaBucket bucket = mediaBuckets.get(i); local
56 MediaSet set = bucket.mediaSet;
60 singleBucket.set(0, bucket);
|
| HudLayer.java | 234 MediaBucket bucket = buckets.get(0); local
235 MediaSet mediaSet = bucket.mediaSet;
240 if (bucket.mediaItems == null || bucket.mediaItems.size() == 0) {
243 ArrayList<MediaItem> items = bucket.mediaItems;
696 MediaBucket bucket = selection.get(j); local
699 if (bucket.mediaItems != null && !bucket.mediaItems.isEmpty()) {
700 items = bucket.mediaItems;
702 } else if (bucket.mediaSet != null)
835 MediaBucket bucket = selection.get(i); local
[all...] |
| DetailMode.java | 45 MediaBucket bucket = buckets.get(i); local
48 if (MediaBucketList.isSetSelection(bucket)) {
49 MediaSet currSet = bucket.mediaSet;
55 currItems = bucket.mediaItems;
|
| LongSparseArray.java | 427 int bucket = ((System.identityHashCode(kind) / 8) & 0x7FFFFFFF) % CACHE_SIZE; local
428 Object cache = sCache[bucket];
432 sCache[bucket] = cache;
435 // bucket);
|
| /external/qemu/distrib/sdl-1.2.12/src/video/dga/ |
| SDL_dgavideo.c | 595 vidmem_bucket *bucket; local
600 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
601 printf("Bucket: %p, %d (%s)\n", bucket->base, bucket->size, bucket->used ? "used" : "free");
602 if ( bucket->prev )
623 vidmem_bucket *bucket; local
655 vidmem_bucket *bucket, *freeable; local
678 vidmem_bucket *bucket; local
691 vidmem_bucket *bucket; local
772 vidmem_bucket *bucket, *freeable; local
[all...] |
| /external/elfcopy/ |
| hash.c | 28 unsigned long bucket = elf_hash(symbol) % nbuckets; local
32 if (buckets[bucket] == STN_UNDEF) {
33 INFO("Adding [%s] to hash at bucket [%ld] (first add)\n",
34 symbol, bucket);
35 buckets[bucket] = symindex;
38 INFO("Collision on adding [%s] to hash at bucket [%ld]\n",
39 symbol, bucket);
40 last_chain_index = buckets[bucket];
|
| /external/clearsilver/util/ |
| neo_hash.c | 142 UINT32 hashv, bucket; local
150 bucket = (*node)->hashv & (hash->size - 1);
155 bucket = hashv & (hash->size - 1);
160 bucket = 0;
170 bucket++;
173 while (bucket < hash->size)
175 if (hash->nodes[bucket])
177 *key = hash->nodes[bucket]->key;
178 return hash->nodes[bucket]->value;
180 bucket++
188 UINT32 hashv, bucket; local
[all...] |
| /external/qemu/distrib/sdl-1.2.12/src/video/fbcon/ |
| SDL_fbvideo.c | 1079 vidmem_bucket *bucket; local
1084 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
1085 printf("Bucket: %p, %d (%s)\n", bucket->base, bucket->size, bucket->used ? "used" : "free");
1086 if ( bucket->prev )
1107 vidmem_bucket *bucket; local
1139 vidmem_bucket *bucket, *freeable; local
1152 vidmem_bucket *bucket; local
1227 vidmem_bucket *bucket, *freeable; local
[all...] |
| SDL_fbvideo.h | 161 vidmem_bucket *bucket; local
167 for ( bucket=&surfaces; bucket; bucket=bucket->next ) {
168 bucket->dirty = 0;
|
| /external/dbus/dbus/ |
| dbus-hash.c | 100 * When there are this many entries per bucket, on average, rebuild
107 * hash tables bucket list. The idea is to make it so that
145 * hash bucket, or #NULL for end of
158 DBusHashEntry ***bucket,
170 DBusHashEntry **buckets; /**< Pointer to bucket array. Each
172 * bucket's hash chain, or #NULL.
175 /**< Bucket array used for small tables
214 DBusHashEntry **bucket; /**< Pointer to bucket that points to member in struct:__anon1530
219 DBusHashEntry *next_entry; /**< Next entry to be iterated onto in current bucket */
780 DBusHashEntry **bucket; local
1101 DBusHashEntry **bucket; local
1283 DBusHashEntry **bucket; local
1312 DBusHashEntry **bucket; local
1341 DBusHashEntry **bucket; local
1371 DBusHashEntry **bucket; local
1400 DBusHashEntry **bucket; local
[all...] |
| /frameworks/base/core/java/com/android/internal/util/ |
| ArrayUtils.java | 107 int bucket = ((System.identityHashCode(kind) / 8) & 0x7FFFFFFF) % CACHE_SIZE; local
108 Object cache = sCache[bucket];
112 sCache[bucket] = cache;
114 // Log.e("cache", "new empty " + kind.getName() + " at " + bucket);
|
| /development/tools/axl/ |
| chewperf.py | 64 bucket = x[0] / 1000
66 if bucket in buckets:
67 buckets[bucket] += bytes
69 buckets[bucket] = bytes
|
| /external/webkit/LayoutTests/storage/domstorage/script-tests/ |
| quota.js | 26 debug("Putting 'data' into another bucket.h");
37 debug("Removing bucket 38.");
40 debug("Adding 'Hello!' into a new bucket.");
72 debug("Putting 'data' into another bucket.h");
|
| /development/tools/idegen/src/ |
| Eclipse.java | 61 List<Bucket> buckets = new ArrayList<Bucket>(patterns.size());
63 buckets.add(new Bucket(pattern));
71 for (Bucket bucket : buckets) {
72 if (bucket.matches(path)) {
73 bucket.sourceRoots.add(sourceRoot);
80 for (Bucket bucket : buckets) {
81 for (File sourceRoot : bucket.sourceRoots)
[all...] |
| /frameworks/base/common/tools/ |
| make-iana-tld-pattern.py | 29 class Bucket:
103 bucket = buckets.get(letter)
105 if bucket is None:
106 bucket = Bucket(letter)
107 buckets[letter] = bucket
109 return bucket
|
| /external/bluetooth/glib/glib/ |
| gconvert.c | 267 * Creates a new cache bucket, inserts it into the cache and
272 * Returns a pointer to the newly allocated cache bucket.
277 struct _iconv_cache_bucket *bucket; local
279 bucket = g_new (struct _iconv_cache_bucket, 1);
280 bucket->key = key;
281 bucket->refcount = 1;
282 bucket->used = TRUE;
283 bucket->cd = cd;
285 g_hash_table_insert (iconv_cache, bucket->key, bucket);
351 struct _iconv_cache_bucket *bucket; local
372 struct _iconv_cache_bucket *bucket; local
469 struct _iconv_cache_bucket *bucket; local
[all...] |
| /external/stlport/test/unit/ |
| unordered_test.cpp | 93 lit = us.begin(us.bucket(i));
94 litEnd = us.end(us.bucket(i));
96 usettype::size_type bucket_pos = us.bucket(*lit);
98 CPPUNIT_ASSERT( us.bucket(*lit) == bucket_pos );
137 lit = us.begin(us.bucket(i));
138 litEnd = us.end(us.bucket(i));
140 usettype::size_type bucket_pos = us.bucket(*lit);
142 CPPUNIT_ASSERT( us.bucket(*lit) == bucket_pos );
207 lit = us.begin(us.bucket(i));
208 litEnd = us.end(us.bucket(i))
[all...] |
| /external/jdiff/src/jdiff/ |
| HTMLStatistics.java | 203 int bucket = (int)(pkg.pdiff); local
204 hist[bucket]++;
206 if (bucket != 0)
207 h_.writeText(" <TD ALIGN=\"center\">" + bucket + "</TD>");
290 int bucket = (int)(classDiff.pdiff); local
291 hist[bucket]++;
293 if (bucket != 0)
294 h_.writeText(" <TD ALIGN=\"center\">" + bucket + "</TD>");
|
| /dalvik/dx/src/com/android/dx/ssa/ |
| Dominators.java | 213 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>();
|
| /dalvik/libcore/xml/src/main/native/ |
| org_apache_harmony_xml_ExpatParser.cpp | 199 * Allocates a new bucket with one entry.
201 * @param entry to store in the bucket
202 * @returns a reference to the bucket
205 InternedString** bucket local
207 if (bucket == NULL) return NULL;
209 bucket[0] = entry;
210 bucket[1] = NULL;
211 return bucket;
215 * Expands an interned string bucket and adds the given entry. Frees the
216 * provided bucket and returns a new one
272 InternedString** bucket = buckets[bucketIndex]; local
991 InternedString** bucket = context->internedStrings[i]; local
[all...] |
| /external/freetype/src/base/ |
| ftdbgmem.c | 930 FT_MemSource* bucket = table->sources; local
931 FT_MemSource* limit = bucket + FT_MEM_SOURCE_BUCKETS;
938 for ( ; bucket < limit; bucket++ )
940 FT_MemSource source = *bucket;
951 for ( bucket = table->sources; bucket < limit; bucket++ )
953 FT_MemSource source = *bucket;
|
| /external/blktrace/ |
| stats.h | 116 static inline void histlog2_account(__u32 *bucket, __u32 val,
120 bucket[index]++;
|
| /external/elfutils/src/ |
| strip.c | 1373 Elf32_Word *bucket = (Elf32_Word *) hashd->d_buf; local
1436 Elf64_Xword *bucket = (Elf64_Xword *) hashd->d_buf; local
[all...] |
