Lines Matching refs:bucket
39 * This is a conventional "bucket hash". The key is hashed in to a number
41 * to index in to the array of buckets. Each bucket is a linked list
238 /* adjust bucket count to be prime */
246 /* create each bucket as a linked list */
269 register bucket_t *bucket;
271 bucket = ht->buckets;
274 cnt += bucket->list.count;
275 bucket++;
284 * Fill in "sizes" with information about bucket lengths in hash
294 register bucket_t *bucket;
298 bucket = ht->buckets;
302 idx = bucket->list.count;
304 bucket++;
335 bucket_t *bucket;
351 /* hash to the bucket */
352 bucket = &(ht->buckets[$3]);
355 ll = &(bucket->list);
374 ll_add(&(bucket->list), newli);
398 bucket_t *bucket;
405 /* find the bucket */
406 bucket = &(ht->buckets[$3]);
409 ll = &(bucket->list);
432 ll_add(&(bucket->list), li);
450 bucket_t *bucket;
458 if ((bucket = &(ht->buckets[$3])) != NULL)
460 ll = &(bucket->list);
488 bucket_t *bucket;
497 if ((bucket = &(ht->buckets[$3])) != NULL)
499 ll = &(bucket->list);
534 /* initialize pos for first item in first bucket */
540 /* find the first non-empty bucket */
579 /* no: regrab first item in current bucket list (might be NULL) */
588 /* if its NULL we have to find another bucket */
591 /* locate another bucket */