Searched refs:bucket (Results 1 - 25 of 32) sorted by relevance

12

/haiku-fatelf/src/bin/coreutils/lib/
H A Dhash.c57 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
283 struct hash_entry const *bucket; local
302 struct hash_entry const *bucket local
332 struct hash_entry const *bucket; local
364 struct hash_entry const *bucket; local
647 struct hash_entry *bucket; local
690 struct hash_entry *bucket; local
785 struct hash_entry *bucket local
858 struct hash_entry *bucket; local
1033 struct hash_entry *bucket; local
1112 struct hash_entry *bucket; local
1175 struct hash_entry *bucket = (struct hash_entry *) table->bucket; local
[all...]
/haiku-fatelf/src/bin/findutils/gnulib/lib/
H A Dhash.c54 struct hash_entry *bucket; member in struct:hash_table
90 slot. A bucket is the collection of all entries hashing to the same slot.
93 In the ideal case, the length of each bucket is roughly the number of
96 entry is linear in time with the size of the bucket. Consequently, a
116 /* If a deletion empties a bucket and causes the ratio of used buckets to
168 /* Return the length of the longest chain (bucket). */
173 struct hash_entry const *bucket; local
176 for (bucket = table->bucket; bucket < tabl
200 struct hash_entry const *bucket; local
249 struct hash_entry const *bucket local
278 struct hash_entry const *bucket; local
297 struct hash_entry const *bucket local
327 struct hash_entry const *bucket; local
359 struct hash_entry const *bucket; local
606 struct hash_entry *bucket; local
649 struct hash_entry *bucket; local
746 struct hash_entry *bucket local
821 struct hash_entry *bucket; local
910 struct hash_entry *bucket; local
985 struct hash_entry *bucket; local
1030 struct hash_entry const *bucket; local
[all...]
/haiku-fatelf/src/bin/gawk/
H A Darray.c306 NODE *bucket, *next; local
311 for (bucket = symbol->var_array[i]; bucket != NULL; bucket = next) {
312 next = bucket->ahnext;
313 unref(bucket->ahvalue);
314 unref(bucket); /* unref() will free the ahname_str */
416 register NODE *bucket; local
421 for (bucket = symbol->var_array[hash1]; bucket !
482 register NODE *bucket; local
563 register NODE *bucket, *last; local
766 NODE *bucket; local
833 NODE **old, **new, *chain, *bucket; local
1005 NODE *bucket, *next, *list; local
[all...]
H A Dawkgram.y2437 register int bucket;
2441 bucket = hash(name, len, (unsigned long) HASHSIZE);
2444 hp->hnext = variables[bucket];
2445 variables[bucket] = hp;
2458 register NODE *bucket;
2462 for (bucket = variables[hash(name, len, (unsigned long) HASHSIZE)];
2463 bucket != NULL; bucket = bucket->hnext)
2464 if (bucket
[all...]
H A Dawkgram.c4276 register int bucket;
4280 bucket = hash(name, len, (unsigned long) HASHSIZE);
4283 hp->hnext = variables[bucket];
4284 variables[bucket] = hp;
4297 register NODE *bucket;
4301 for (bucket = variables[hash(name, len, (unsigned long) HASHSIZE)];
4302 bucket != NULL; bucket = bucket->hnext)
4303 if (bucket
4272 register int bucket; local
4293 register NODE *bucket; local
4673 register NODE *bucket, **save; local
[all...]
/haiku-fatelf/src/system/kernel/fs/
H A DVnode.cpp17 mutex_init(&lock, "vnode bucket");
36 Bucket& bucket = _Bucket(); local
37 MutexLocker bucketLocker(bucket.lock);
50 bucket.waiters.Add(&waiter);
63 Bucket& bucket = _Bucket(); local
64 MutexLocker bucketLocker(bucket.lock);
72 for (LockWaiterList::Iterator it = bucket.waiters.GetIterator();
/haiku-fatelf/src/add-ons/kernel/file_systems/ramfs/
H A DBlockAllocator.cpp164 AreaBucket *bucket = fBuckets + i; local
166 if (!bucket->SanityCheck(deep))
169 for (Area *area = bucket->GetFirstArea();
171 area = bucket->GetNextArea(area)) {
198 AreaBucket *bucket = fBuckets + i; local
199 for (Area *area = bucket->GetFirstArea();
201 area = bucket->GetNextArea(area)) {
257 // find a bucket for the allocation
259 AreaBucket *bucket = NULL; local
263 bucket
310 AreaBucket *bucket = area->GetBucket(); local
325 _RethinkAreaBucket(Area *area, AreaBucket *bucket, bool needsDefragmenting) argument
359 AreaBucket *bucket = NULL; local
[all...]
H A DBlockAllocator.h52 inline void _RethinkAreaBucket(Area *area, AreaBucket *bucket,
H A DBlockAllocatorArea.h17 inline void SetBucket(AreaBucket *bucket) { fBucket = bucket; } argument
/haiku-fatelf/src/tests/add-ons/kernel/file_systems/userlandfs/r5/src/test/ramfs/
H A DBlockAllocator.cpp166 AreaBucket *bucket = fBuckets + i; local
168 if (!bucket->SanityCheck(deep))
171 for (Area *area = bucket->GetFirstArea();
173 area = bucket->GetNextArea(area)) {
200 AreaBucket *bucket = fBuckets + i; local
201 for (Area *area = bucket->GetFirstArea();
203 area = bucket->GetNextArea(area)) {
259 // find a bucket for the allocation
261 AreaBucket *bucket = NULL; local
265 bucket
312 AreaBucket *bucket = area->GetBucket(); local
327 _RethinkAreaBucket(Area *area, AreaBucket *bucket, bool needsDefragmenting) argument
361 AreaBucket *bucket = NULL; local
[all...]
H A DBlockAllocator.h52 inline void _RethinkAreaBucket(Area *area, AreaBucket *bucket,
H A DBlockAllocatorArea.h17 inline void SetBucket(AreaBucket *bucket) { fBucket = bucket; } argument
/haiku-fatelf/src/bin/bash/
H A Dhashlib.c150 /* Return the location of the bucket which should contain the data
172 int bucket; local
178 bucket = HASH_BUCKET (string, table, hv);
180 for (list = table->bucket_array[bucket]; list; list = list->next)
192 list->next = table->bucket_array[bucket];
193 table->bucket_array[bucket] = list;
216 int bucket; local
223 bucket = HASH_BUCKET (string, table, hv);
225 for (temp = table->bucket_array[bucket]; temp; temp = temp->next)
232 table->bucket_array[bucket]
251 int bucket; local
288 register BUCKET_CONTENTS *bucket, *item; local
[all...]
H A Dhashlib.h35 struct bucket_contents *next; /* Link to next hashed key in this bucket. */
70 #define hash_items(bucket, table) \
71 ((table && (bucket < table->nbuckets)) ? \
72 table->bucket_array[bucket] : \
/haiku-fatelf/src/bin/gdb/gdb/
H A Dbcache.c74 struct bstring **bucket; member in struct:bcache
162 * sizeof (bcache->bucket[0]));
171 for (s = bcache->bucket[i]; s; s = next)
184 if (bcache->bucket)
185 xfree (bcache->bucket);
186 bcache->bucket = new_buckets;
220 /* Search the hash bucket for a string identical to the caller's.
223 for (s = bcache->bucket[hash_index]; s; s = s->next)
241 new->next = bcache->bucket[hash_index];
243 bcache->bucket[hash_inde
[all...]
/haiku-fatelf/headers/private/kernel/util/
H A DOpenHashTable.h245 // add the bucket to the list
249 // element in the bucket
411 ValueType* bucket = fTable[i]; local
412 while (bucket) {
413 ValueType* next = _Link(bucket);
414 _Insert(newTable, newSize, bucket);
415 bucket = next;
430 ValueType*& _Link(ValueType* bucket) const
432 return fDefinition.GetLink(bucket);
438 ValueType* bucket local
[all...]
H A DMultiHashTable.h166 ValueType *bucket = HashTable::fTable[i]; local
167 while (bucket) {
168 ValueType *next = HashTable::_Link(bucket);
169 _Insert(newTable, newSize, bucket);
170 bucket = next;
H A Dkhash.h24 int bucket; member in struct:hash_iterator
/haiku-fatelf/src/tests/kits/locale/
H A DcollatorTest.cpp71 uint32 bucket = 1; local
76 printf("\n%2lu)", bucket++);
94 printf("%2lu)", bucket++);
/haiku-fatelf/src/tools/fs_shell/
H A Dhash.h16 int bucket; member in struct:FSShell::hash_iterator
H A Dhash.cpp156 uint32_t index = iterator->bucket;
265 iterator->bucket = -1;
276 // get next bucket
277 for (index = (uint32_t)(iterator->bucket + 1); index < table->table_size; index++) {
279 iterator->bucket = index;
/haiku-fatelf/src/libs/compat/freebsd_wlan/net80211/
H A Dieee80211_rssadapt.c207 bucket(int pktlen) function
235 thrs = &ra->ra_rate_thresh[bucket(pktlen)];
267 thrs = &ra->ra_rate_thresh[bucket(pktlen)];
287 thrs = &ra->ra_rate_thresh[bucket(pktlen)];
/haiku-fatelf/src/system/kernel/util/
H A Dkhash.cpp237 uint32 index = iterator->bucket;
257 // We need to rewind the bucket, as hash_next() advances to the
258 // next bucket when iterator->current is NULL. With this we
260 // bucket and before the start of this one so hash_next()
261 // doesn't skip the rest of this bucket.
262 iterator->bucket--;
355 iterator->bucket = -1;
366 // get next bucket
367 for (index = (uint32)(iterator->bucket + 1); index < table->table_size; index++) {
369 iterator->bucket
[all...]
/haiku-fatelf/src/bin/diffutils/src/
H A Dio.c46 lin next; /* Next item in this bucket. */
60 The bucket-chains go through the elements in this array.
226 lin i, *bucket;
390 bucket = &buckets[h % nbuckets];
400 bucket = &buckets[-1];
407 for (i = *bucket; ; i = eqs[i].next)
410 /* Create a new equivalence class in this bucket. */
419 eqs[i].next = *bucket;
423 *bucket = i;
222 lin i, *bucket; local
/haiku-fatelf/src/tools/docbook/libxml2/
H A Dxmlschemas.c289 #define WXS_BUCKET(ctx) WXS_CONSTRUCTOR((ctx))->bucket
379 xmlSchemaBucketPtr bucket; member in struct:_xmlSchemaSchemaRelation
455 /* The owning main or import schema bucket. */
564 xmlSchemaBucketPtr mainBucket; /* The main schema bucket */
568 xmlSchemaBucketPtr bucket; /* The current schema bucket */ member in struct:_xmlSchemaConstructionCtxt
3486 xmlSchemaBucketFree(xmlSchemaBucketPtr bucket) argument
3488 if (bucket == NULL)
3490 if (bucket->globals != NULL) {
3491 xmlSchemaComponentListFree(bucket
5005 xmlSchemaFindRedefCompInGraph(xmlSchemaBucketPtr bucket, xmlSchemaTypeType type, const xmlChar *name, const xmlChar *nsName) argument
10067 xmlSchemaParseNewDocWithContext(xmlSchemaParserCtxtPtr pctxt, xmlSchemaPtr schema, xmlSchemaBucketPtr bucket) argument
10136 xmlSchemaParseNewDoc(xmlSchemaParserCtxtPtr pctxt, xmlSchemaPtr schema, xmlSchemaBucketPtr bucket) argument
10193 xmlSchemaSchemaRelationAddChild(xmlSchemaBucketPtr bucket, xmlSchemaSchemaRelationPtr rel) argument
10254 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
10666 xmlSchemaBucketPtr bucket = NULL; local
10910 xmlSchemaBucketPtr bucket = NULL; local
20456 xmlSchemaAddComponents(xmlSchemaParserCtxtPtr pctxt, xmlSchemaBucketPtr bucket) argument
21035 xmlSchemaBucketPtr bucket = NULL; local
21338 xmlSchemaBucketPtr bucket = NULL; local
[all...]

Completed in 315 milliseconds

12