Searched refs:buckets (Results 1 - 6 of 6) sorted by relevance

/ast/src/lib/libtksh/tcl/
H A DtclHash.c30 * will end up in different buckets. The hash function was taken
87 tablePtr->buckets = tablePtr->staticBuckets;
181 hPtr = tablePtr->buckets[i];
193 if (tablePtr->buckets != tablePtr->staticBuckets) {
194 ckfree((char *) tablePtr->buckets);
275 searchPtr->tablePtr->buckets[searchPtr->nextIndex];
290 * in its hash buckets.
324 for (hPtr = tablePtr->buckets[i]; hPtr != NULL; hPtr = hPtr->nextPtr) {
341 sprintf(result, "%d entries in table, %d buckets\n",
345 sprintf(p, "number of buckets wit
[all...]
/ast/src/lib/libast/hash/
H A Dhashlook.c149 * migrate popular buckets to the front
183 tab->buckets--;
242 tab->buckets--;
277 if (!tab->frozen && !(tab->flags & HASH_FIXED) && tab->buckets > tab->root->meanchain * tab->size)
335 tab->buckets++;
338 tab->buckets--;
351 tab->buckets++;
H A Dhashdump.c123 sfprintf(sfstderr, " buckets: %d\n", tab->buckets);
/ast/src/cmd/dsslib/stats/
H A Dstats.c120 Dt_t* buckets; member in struct:State_s
489 if (!(state->buckets = dtnew(vm, &state->bucketdisc, Dtoset)))
547 if (bucket = (Bucket_t*)dtmatch(state->buckets, state->key))
549 else if (dtsize(state->buckets) < state->maxgroups)
571 dtinsert(state->buckets, bucket);
715 if (state->buckets)
723 if (state->buckets)
725 for (bucket = (Bucket_t*)dtfirst(state->buckets); bucket; bucket = (Bucket_t*)dtnext(state->buckets, bucket))
/ast/src/lib/libast/include/
H A Dhash.h175 int buckets; /* active bucket count */ member in struct:Hash_table
/ast/src/lib/libtksh/include/
H A Dtcl.h511 Tcl_HashEntry **buckets; /* Pointer to bucket array. Each member in struct:Tcl_HashTable
517 int numBuckets; /* Total number of buckets allocated

Completed in 17 milliseconds