/external/elfcopy/ |
H A D | 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];
|
H A D | elfcopy.c | 1233 Elf32_Word *bucket = (Elf32_Word *) hashd->d_buf; /* Sane arches first. */ local 1253 same size for the bucket array. */ 1254 INFO("hash table: buckets: %d (no change).\n", bucket[0]); 1257 bucket[1]); 1258 bucket[1] = symd->d_size / elsize; 1259 nbucket = bucket[0]; 1260 bucket += 2; 1261 chain = bucket + nbucket; 1274 memset (bucket, '\0', 1291 if (bucket[hid [all...] |
/external/blktrace/ |
H A D | stats.h | 116 static inline void histlog2_account(__u32 *bucket, __u32 val, argument 120 bucket[index]++;
|
/external/clearsilver/util/ |
H A D | 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/ |
H A D | SDL_fbvideo.h | 161 vidmem_bucket *bucket; local 167 for ( bucket=&surfaces; bucket; bucket=bucket->next ) { 168 bucket->dirty = 0;
|
H A D | 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 ) { 1087 if ( bucket 1107 vidmem_bucket *bucket; local 1139 vidmem_bucket *bucket, *freeable; local 1152 vidmem_bucket *bucket; local 1227 vidmem_bucket *bucket, *freeable; local [all...] |
/external/bison/lib/ |
H A D | hash.c | 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 < tabl 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...] |
/external/stlport/stlport/stl/ |
H A D | _unordered_map.h | 179 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_map 339 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_multimap
|
H A D | _unordered_set.h | 165 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_set 315 size_type bucket(const _KT& __k) const { return _M_ht.bucket(__k); } function in class:unordered_multiset
|
H A D | _hashtable.h | 197 //Returns the bucket size next to a required size 200 // Returns the bucket range containing sorted list of prime numbers <= __hint. 389 //The number of buckets is size() - 1 because the last bucket always contains 397 size_type bucket(const _KT& __k) const { return _M_bkt_num_key(__k); } function in class:hashtable 588 //__n is set to the first bucket that has to be modified if any
|
/external/stlport/stlport/stl/debug/ |
H A D | _hashtable.h | 186 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators 191 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators 199 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators 204 //TODO: Add checks for iterator locality -> avoids comparison between different bucket iterators 322 size_type bucket(const _KT& __k) const { return _M_non_dbg_impl.bucket(__k); } function in class:hashtable
|
/external/freetype/src/base/ |
H A D | 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/qemu/distrib/sdl-1.2.12/src/video/dga/ |
H A D | 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 ) { 603 if ( bucket 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/bluetooth/glib/glib/ |
H A D | 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); 310 iconv_cache_bucket_expire(GList *node, struct _iconv_cache_bucket *bucket) argument 351 struct _iconv_cache_bucket *bucket; local 372 struct _iconv_cache_bucket *bucket; local 469 struct _iconv_cache_bucket *bucket; local [all...] |
/external/dbus/dbus/ |
H A D | 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. 214 DBusHashEntry **bucket; /**< Pointer to bucket that points to member in struct:__anon719 219 DBusHashEntry *next_entry; /**< Next entry to be iterated onto in current bucket */ 220 int next_bucket; /**< index of next bucket */ 470 remove_entry(DBusHashTable *table, DBusHashEntry **bucket, DBusHashEntry *entry) argument 780 DBusHashEntry **bucket; local 804 add_allocated_entry(DBusHashTable *table, DBusHashEntry *entry, unsigned int idx, void *key, DBusHashEntry ***bucket) argument 832 add_entry(DBusHashTable *table, unsigned int idx, void *key, DBusHashEntry ***bucket, DBusPreallocatedHash *preallocated) argument 901 find_generic_function(DBusHashTable *table, void *key, unsigned int idx, KeyCompareFunc compare_func, dbus_bool_t create_if_not_found, DBusHashEntry ***bucket, DBusPreallocatedHash *preallocated) argument 942 find_string_function(DBusHashTable *table, void *key, dbus_bool_t create_if_not_found, DBusHashEntry ***bucket, DBusPreallocatedHash *preallocated) argument 979 find_two_strings_function(DBusHashTable *table, void *key, dbus_bool_t create_if_not_found, DBusHashEntry ***bucket, DBusPreallocatedHash *preallocated) argument 996 find_direct_function(DBusHashTable *table, void *key, dbus_bool_t create_if_not_found, DBusHashEntry ***bucket, DBusPreallocatedHash *preallocated) argument 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...] |
/external/elfutils/src/ |
H A D | strip.c | 1373 Elf32_Word *bucket = (Elf32_Word *) hashd->d_buf; local 1386 changed. We keep the same size for the bucket array. */ 1387 bucket[1] = symd->d_size / elsize; 1388 Elf32_Word nbucket = bucket[0]; 1389 bucket += 2; 1390 Elf32_Word *chain = bucket + nbucket; 1401 memset (bucket, '\0', 1417 if (bucket[hidx] == 0) 1418 bucket[hidx] = inner; 1421 hidx = bucket[hid 1436 Elf64_Xword *bucket = (Elf64_Xword *) hashd->d_buf; local [all...] |
H A D | ldgeneric.c | 3334 /* Determine how often each hash bucket is used. */ 5227 Elf32_Word *bucket; local 5236 /* Determine the "optimal" bucket size. */ 5260 bucket = &((Elf32_Word *) hashdata->d_buf)[2]; 5290 if (bucket[hashidx] == 0) 5291 bucket[hashidx] = dynidx; 5294 hashidx = bucket[hashidx];
|
H A D | readelf.c | 56 N_("Display histogram of bucket list lengths") }, 123 /* True if bucket list length histogram should be printed. */ 2400 Elf32_Word *bucket; local 2419 bucket = &((Elf32_Word *) data->d_buf)[2]; 2423 \nHistogram for bucket list length in section [%2u] '%s' (total of %d bucket):\n Addr: %#0*" PRIx64 " Offset: %#08" PRIx64 " Link to section: [%2u] '%s'\n", 2425 \nHistogram for bucket list length in section [%2u] '%s' (total of %d buckets):\n Addr: %#0*" PRIx64 " Offset: %#08" PRIx64 " Link to section: [%2u] '%s'\n", 2442 if (bucket[cnt] != 0) 2446 inner = bucket[cnt];
|
/external/webkit/JavaScriptCore/wtf/ |
H A D | HashTable.h | 384 static void initializeBucket(ValueType& bucket) { new (&bucket) ValueType(Traits::emptyValue()); } argument 385 static void deleteBucket(ValueType& bucket) { bucket.~ValueType(); Traits::constructDeletedValue(bucket); } argument
|
/external/yaffs2/yaffs2/ |
H A D | yaffs_guts.c | 1404 int bucket; local 1407 /* If it is still linked into the bucket list, free from the list */ 1410 bucket = yaffs_HashFunction(tn->objectId); 1411 dev->objectBucket[bucket].count--; 1522 int bucket = yaffs_FindNiceObjectBucket(dev); local 1531 __u32 n = (__u32) bucket; 1538 if (1 || dev->objectBucket[bucket].count > 0) { 1539 list_for_each(i, &dev->objectBucket[bucket].list) { 1556 int bucket = yaffs_HashFunction(in->objectId); local 1559 list_add(&in->hashLink, &dev->objectBucket[bucket] 1566 int bucket = yaffs_HashFunction(number); local [all...] |
/external/libxml2/ |
H A D | xmlschemas.c | 297 #define WXS_BUCKET(ctx) WXS_CONSTRUCTOR((ctx))->bucket 387 xmlSchemaBucketPtr bucket; member in struct:_xmlSchemaSchemaRelation 463 /* The owning main or import schema bucket. */ 572 xmlSchemaBucketPtr mainBucket; /* The main schema bucket */ 576 xmlSchemaBucketPtr bucket; /* The current schema bucket */ member in struct:_xmlSchemaConstructionCtxt 3495 xmlSchemaBucketFree(xmlSchemaBucketPtr bucket) argument 3497 if (bucket == NULL) 3499 if (bucket->globals != NULL) { 3500 xmlSchemaComponentListFree(bucket 5014 xmlSchemaFindRedefCompInGraph(xmlSchemaBucketPtr bucket, xmlSchemaTypeType type, const xmlChar *name, const xmlChar *nsName) argument 10076 xmlSchemaParseNewDocWithContext(xmlSchemaParserCtxtPtr pctxt, xmlSchemaPtr schema, xmlSchemaBucketPtr bucket) argument 10145 xmlSchemaParseNewDoc(xmlSchemaParserCtxtPtr pctxt, xmlSchemaPtr schema, xmlSchemaBucketPtr bucket) argument 10202 xmlSchemaSchemaRelationAddChild(xmlSchemaBucketPtr bucket, xmlSchemaSchemaRelationPtr rel) argument 10263 xmlSchemaAddSchemaDoc(xmlSchemaParserCtxtPtr pctxt, int type, const xmlChar *schemaLocation, xmlDocPtr schemaDoc, const char *schemaBuffer, int schemaBufferLen, xmlNodePtr invokingNode, const xmlChar *sourceTargetNamespace, const xmlChar *importNamespace, xmlSchemaBucketPtr *bucket) argument 10683 xmlSchemaBucketPtr bucket = NULL; local 10927 xmlSchemaBucketPtr bucket = NULL; local 20603 xmlSchemaAddComponents(xmlSchemaParserCtxtPtr pctxt, xmlSchemaBucketPtr bucket) argument 21198 xmlSchemaBucketPtr bucket = NULL; local 21501 xmlSchemaBucketPtr bucket = NULL; local [all...] |
/external/jdiff/ |
H A D | xerces.jar | META-INF/ META-INF/MANIFEST.MF META-INF/services/ org/ org/apache/ org/apache/html/ ... |