| /build/tools/apriori/ |
| hash.c | 15 Elf32_Word *buckets = ++hash_data; local
18 index = buckets[elf_hash(symname) % nbuckets];
|
| /build/tools/lsd/ |
| hash.c | 16 Elf32_Word *buckets = ++hash_data; local
19 index = buckets[elf_hash(symname) % nbuckets];
|
| /development/tools/idegen/src/ |
| Eclipse.java | 61 List<Bucket> buckets = new ArrayList<Bucket>(patterns.size()); local
63 buckets.add(new Bucket(pattern));
66 // Put source roots in respective buckets.
71 for (Bucket bucket : buckets) {
80 for (Bucket bucket : buckets) {
|
| /external/elfcopy/ |
| hash.c | 24 Elf32_Word *buckets = (Elf32_Word *)hash_data->d_buf; local
25 Elf32_Word nbuckets = *buckets++;
26 Elf32_Word *chains = ++buckets + nbuckets;
32 if (buckets[bucket] == STN_UNDEF) {
35 buckets[bucket] = symindex;
40 last_chain_index = buckets[bucket];
59 Elf32_Word *buckets = ++hash_data; local
64 index = buckets[elf_hash(symname) % nbuckets];
|
| /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())
143 makePattern(TLD_PREFIX, TLD_SUFFIX, buckets, isWebUrl=False
[all...] |
| /bionic/libc/stdio/ |
| flockfile.c | 68 FileLock* buckets[ FILE_LOCK_BUCKETS ]; member in struct:__anon526
80 memset(_lockTable->buckets, 0, sizeof(_lockTable->buckets));
105 pnode = &t->buckets[hash % FILE_LOCK_BUCKETS];
|
| /external/emma/core/java12/com/vladium/util/ |
| 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...] |
| 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...] |
| 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...] |
| /bootable/recovery/applypatch/ |
| bsdiff.c | 123 off_t buckets[256]; local
126 for(i=0;i<256;i++) buckets[i]=0;
127 for(i=0;i<oldsize;i++) buckets[old[i]]++;
128 for(i=1;i<256;i++) buckets[i]+=buckets[i-1];
129 for(i=255;i>0;i--) buckets[i]=buckets[i-1];
130 buckets[0]=0;
132 for(i=0;i<oldsize;i++) I[++buckets[old[i]]]=i;
134 for(i=0;i<oldsize;i++) V[i]=buckets[old[i]]
[all...] |
| /external/bsdiff/ |
| bsdiff.c | 106 off_t buckets[256]; local
109 for(i=0;i<256;i++) buckets[i]=0;
110 for(i=0;i<oldsize;i++) buckets[old[i]]++;
111 for(i=1;i<256;i++) buckets[i]+=buckets[i-1];
112 for(i=255;i>0;i--) buckets[i]=buckets[i-1];
113 buckets[0]=0;
115 for(i=0;i<oldsize;i++) I[++buckets[old[i]]]=i;
117 for(i=0;i<oldsize;i++) V[i]=buckets[old[i]]
[all...] |
| /packages/apps/Gallery3D/src/com/cooliris/media/ |
| MediaBucketList.java | 36 public static MediaItem getFirstItemSelection(ArrayList<MediaBucket> buckets) {
38 if (buckets != null) {
39 int numBuckets = buckets.size();
41 MediaBucket bucket = buckets.get(0);
56 public static MediaSet getFirstSetSelection(ArrayList<MediaBucket> buckets) {
58 if (buckets != null) {
59 int numBuckets = buckets.size();
61 MediaBucket bucket = buckets.get(0);
76 ArrayList<MediaBucket> buckets = mBuckets; local
77 int numBuckets = buckets.size()
[all...] |
| HudLayer.java | 223 ArrayList<MediaBucket> buckets = mGridLayer.getSelectedBuckets(); local
225 int numBuckets = buckets.size();
234 MediaBucket bucket = buckets.get(0);
262 ArrayList<MediaBucket> buckets = mGridLayer.getSelectedBuckets();
267 if (buckets == null) {
270 CharSequence[] strings = DetailMode.populateDetailModeStrings(mContext, buckets);
293 ArrayList<MediaBucket> buckets = mGridLayer.getSelectedBuckets();
294 MediaItem item = MediaBucketList.getFirstItemSelection(buckets);
325 ArrayList<MediaBucket> buckets = mGridLayer.getSelectedBuckets();
326 MediaItem item = MediaBucketList.getFirstItemSelection(buckets);
[all...] |
| /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/stlport/test/unit/ |
| unordered_test.cpp | 35 CPPUNIT_TEST(buckets);
52 void buckets();
321 void UnorderedTest::buckets() function in class:UnorderedTest
390 //we force a large number of buckets:
426 // Adding an element back shouldn't change number of buckets:
452 cout << "Hash container dump: Nb elems: " << hum.size() << ", Nb buckets: " << hum.bucket_count() << "\n";
|
| /ndk/sources/android/stlport/test/unit/ |
| unordered_test.cpp | 35 CPPUNIT_TEST(buckets);
52 void buckets();
321 void UnorderedTest::buckets() function in class:UnorderedTest
390 //we force a large number of buckets:
426 // Adding an element back shouldn't change number of buckets:
452 cout << "Hash container dump: Nb elems: " << hum.size() << ", Nb buckets: " << hum.bucket_count() << "\n";
|
| /external/dbus/dbus/ |
| dbus-hash.c | 109 * different buckets. The hash function was taken from a
113 * decreases as we increase the number of hash buckets (to keep more
115 * fewer high bits as the number of hash buckets increases.
125 * Initial number of buckets in hash table (hash table statically
126 * allocates its buckets for this size and below).
170 DBusHashEntry **buckets; /**< Pointer to bucket array. Each member in struct:DBusHashTable
178 int n_buckets; /**< Total number of buckets allocated
179 * at **buckets.
315 table->buckets = table->static_buckets;
388 entry = table->buckets[i]
[all...] |
| /external/freetype/src/base/ |
| ftdbgmem.c | 116 FT_MemNode* buckets; member in struct:FT_MemTableRec_
281 node = table->buckets[i];
295 if ( table->buckets )
296 ft_mem_table_free( table, table->buckets );
298 table->buckets = new_buckets;
327 table->buckets = (FT_MemNode *)
330 if ( table->buckets )
331 FT_ARRAY_ZERO( table->buckets, table->size );
360 FT_MemNode *pnode = table->buckets + i, next, node = *pnode;
388 table->buckets[i] = 0
[all...] |
| /external/iproute2/misc/ |
| arpd.c | 242 static int buckets; local
248 buckets += diff;
250 buckets = broadcast_burst;
252 if (buckets > broadcast_burst)
253 buckets = broadcast_burst;
254 if (buckets >= broadcast_rate && !send_probe(ifindex, addr)) {
255 buckets -= broadcast_rate;
|
| /external/qemu/android/skin/ |
| image.c | 347 SkinImage* buckets[ NUM_BUCKETS ]; member in struct:__anon5877
374 SkinImage** pnode = cache->buckets + (image->hash & (NUM_BUCKETS-1));
452 SkinImage** pnode = &cache->buckets[index];
|
| /libcore/luni/src/main/native/ |
| org_apache_harmony_xml_ExpatParser.cpp | 130 // Free the buckets.
363 InternedString*** buckets = parsingContext->internedStrings; local
364 InternedString** bucket = buckets[bucketIndex];
387 buckets[bucketIndex] = bucket;
402 buckets[bucketIndex] = bucket;
[all...] |
| /external/emma/lib/ |
| emma.jar | |
| /external/libxml2/ |
| xmlschemas.c | 205 * Macros for schema buckets.
292 ( (WXS_CONSTRUCTOR((ctx))->buckets != NULL) && \
293 (WXS_CONSTRUCTOR((ctx))->buckets->nbItems > 0) )
574 xmlSchemaItemListPtr buckets; /* List of schema buckets. */ member in struct:_xmlSchemaConstructionCtxt
[all...] |
