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

12345

/macosx-10.9.5/emacs-92/emacs/oldXMenu/
H A DXCrAssoc.c19 * buckets per 100 objects; a reasonable maximum number of object per
20 * buckets is 8. If there is an error creating the XAssocTable, a NULL
27 register XAssoc *buckets; /* Pointer to the first bucket in */ local
37 /* calloc the buckets (actually just their headers). */
38 buckets = (XAssoc *)calloc((unsigned)size, (unsigned)sizeof(XAssoc));
39 if (buckets == NULL) {
46 table->buckets = buckets;
51 buckets->prev = buckets;
[all...]
H A DXDestAssoc.c20 /* Free the buckets. */
22 bucket = &table->buckets[i];
34 free((char *)table->buckets);
H A DX10.h50 * which is contains an array of circular queues (buckets).
62 * table. An XAssocTable is a hash table whose buckets are circular
67 * of buckets in the array.
70 XAssoc *buckets; /* Pointer to first bucket in bucket array.*/ member in struct:__anon8673
71 int size; /* Table size (number of buckets). */
H A DXDelAssoc.c32 bucket = &table->buckets[hash];
H A DXLookAssoc.c33 bucket = &table->buckets[hash];
/macosx-10.9.5/objc4-551.1/test/
H A DbadCache.m45 struct bucket_t *buckets;
68 cache->buckets[0].sel = (void*)~0;
69 cache->buckets[0].imp = (void*)~0;
70 cache->buckets[1].sel = (void*)(uintptr_t)1;
71 cache->buckets[1].imp = (void*)cache->buckets;
H A DbadCache2.m45 struct bucket_t *buckets;
68 cache->buckets[0].sel = (void*)~0;
69 cache->buckets[0].imp = (void*)~0;
/macosx-10.9.5/groff-38/groff/src/libs/libxutil/
H A DDviChar.c65 DviCharNameHash **buckets; local
69 buckets = map->buckets;
71 for (h = buckets[i]; h; h=next) {
93 DviCharNameHash **buckets; local
97 buckets = map->buckets;
99 buckets[i] = 0;
106 h->next = buckets[i];
107 buckets[
[all...]
/macosx-10.9.5/tcl-102/tcl/tcl/generic/
H A DtclThreadAlloc.c73 * of buckets in the bucket cache.
99 * The following structure defines a cache of buckets and objs, of which there
109 Bucket buckets[NBUCKETS]; /* The buckets for this thread */ member in struct:Cache
243 if (cachePtr->buckets[bucket].numFree > 0) {
244 PutBlocks(cachePtr, bucket, cachePtr->buckets[bucket].numFree);
338 if (cachePtr->buckets[bucket].numFree || GetBlocks(cachePtr, bucket)) {
339 blockPtr = cachePtr->buckets[bucket].firstPtr;
340 cachePtr->buckets[bucket].firstPtr = blockPtr->nextBlock;
341 --cachePtr->buckets[bucke
[all...]
H A DtclLiteral.c69 tablePtr->buckets = tablePtr->staticBuckets;
129 entryPtr = tablePtr->buckets[i];
201 entryPtr = tablePtr->buckets[i];
215 if (tablePtr->buckets != tablePtr->staticBuckets) {
216 ckfree((char *) tablePtr->buckets);
271 for (globalPtr=globalTablePtr->buckets[globalHash] ; globalPtr!=NULL;
327 globalPtr->nextPtr = globalTablePtr->buckets[globalHash];
328 globalTablePtr->buckets[globalHash] = globalPtr;
333 * more buckets.
348 for (entryPtr=globalTablePtr->buckets[
[all...]
H A DtclHash.c36 * buckets. The hash function was taken from a random-number generator.
182 tablePtr->buckets = tablePtr->staticBuckets;
305 for (hPtr = tablePtr->buckets[index]; hPtr != NULL;
320 for (hPtr = tablePtr->buckets[index]; hPtr != NULL;
356 hPtr->nextPtr = tablePtr->buckets[index];
357 tablePtr->buckets[index] = hPtr;
359 hPtr->bucketPtr = &(tablePtr->buckets[index]);
367 * buckets.
428 bucketPtr = &(tablePtr->buckets[index]);
497 hPtr = tablePtr->buckets[
[all...]
/macosx-10.9.5/tcl-102/tcl84/tcl/generic/
H A DtclThreadAlloc.c94 * of buckets in the bucket cache.
117 * The following structure defines a cache of buckets and objs.
126 Bucket buckets[NBUCKETS]; member in struct:Cache
261 if (cachePtr->buckets[bucket].nfree > 0) {
262 PutBlocks(cachePtr, bucket, cachePtr->buckets[bucket].nfree);
357 if (cachePtr->buckets[bucket].nfree || GetBlocks(cachePtr, bucket)) {
358 blockPtr = cachePtr->buckets[bucket].firstPtr;
359 cachePtr->buckets[bucket].firstPtr = blockPtr->b_next;
360 --cachePtr->buckets[bucket].nfree;
361 ++cachePtr->buckets[bucke
[all...]
H A DtclLiteral.c71 tablePtr->buckets = tablePtr->staticBuckets;
123 entryPtr = tablePtr->buckets[i];
136 if (tablePtr->buckets != tablePtr->staticBuckets) {
137 ckfree((char *) tablePtr->buckets);
205 for (localPtr = localTablePtr->buckets[localHash];
230 for (globalPtr = globalTablePtr->buckets[globalHash];
296 globalPtr->nextPtr = globalTablePtr->buckets[globalHash];
297 globalTablePtr->buckets[globalHash] = globalPtr;
302 * with more buckets.
318 for (entryPtr = globalTablePtr->buckets[
[all...]
/macosx-10.9.5/libarchive-29/libarchive/libarchive/
H A Darchive_entry_link_resolver.c80 struct links_entry **buckets; member in struct:archive_entry_linkresolver
105 res->buckets = malloc(res->number_buckets *
106 sizeof(res->buckets[0]));
107 if (res->buckets == NULL) {
112 res->buckets[i] = NULL;
154 if (res->buckets != NULL) {
157 free(res->buckets);
158 res->buckets = NULL;
265 if (res->buckets == NULL)
274 for (le = res->buckets[bucke
[all...]
/macosx-10.9.5/xnu-2422.115.4/libkern/kxld/
H A Dkxld_dict.c90 /* We want the number of allocated buckets to be at least twice that of the
98 /* Allocate enough buckets for the anticipated number of entries */
99 rval = kxld_array_init(&dict->buckets, sizeof(DictEntry), num_buckets);
125 kxld_array_clear(&dict->buckets);
148 kxld_array_deinit(&dict->buckets);
177 entry = kxld_array_get_item(&dict->buckets, idx);
184 * collision, we just walk along the buckets until a free bucket shows up.
200 entry = kxld_array_get_item(&dict->buckets, idx);
204 idx = (idx + 1) % dict->buckets.nitems;
207 entry = kxld_array_get_item(&dict->buckets, id
[all...]
/macosx-10.9.5/apache-786.1/httpd/srclib/apr-util/
H A Dbuild-outputs.mk3 buckets/apr_brigade.lo: buckets/apr_brigade.c .make.dirs include/apr_buckets.h
4 buckets/apr_buckets.lo: buckets/apr_buckets.c .make.dirs include/apr_buckets.h
5 buckets/apr_buckets_alloc.lo: buckets/apr_buckets_alloc.c .make.dirs include/apr_buckets.h
6 buckets/apr_buckets_eos.lo: buckets/apr_buckets_eos.c .make.dirs include/apr_buckets.h
7 buckets/apr_buckets_file.lo: buckets/apr_buckets_fil
[all...]
/macosx-10.9.5/apr-30/apr-util/apr-util/
H A Dbuild-outputs.mk3 buckets/apr_brigade.lo: buckets/apr_brigade.c .make.dirs include/apr_buckets.h
4 buckets/apr_buckets.lo: buckets/apr_buckets.c .make.dirs include/apr_buckets.h
5 buckets/apr_buckets_alloc.lo: buckets/apr_buckets_alloc.c .make.dirs include/apr_buckets.h
6 buckets/apr_buckets_eos.lo: buckets/apr_buckets_eos.c .make.dirs include/apr_buckets.h
7 buckets/apr_buckets_file.lo: buckets/apr_buckets_fil
[all...]
/macosx-10.9.5/file_cmds-230/du/
H A Ddu.c377 static struct links_entry **buckets; local
390 if (buckets == NULL) {
392 buckets = malloc(number_buckets * sizeof(buckets[0]));
393 if (buckets == NULL)
396 buckets[i] = NULL;
421 while (buckets[i] != NULL) {
423 le = buckets[i];
424 buckets[i] = le->next;
437 free(buckets);
510 static struct links_entry **buckets; local
[all...]
/macosx-10.9.5/groff-38/groff/src/include/
H A DDviChar.h27 DviCharNameHash *buckets[DVI_HASH_SIZE]; member in struct:_dviCharNameMap
/macosx-10.9.5/Libc-997.90.3/stdlib/FreeBSD/
H A Dstrhash.c95 * bucket pointers. Then set all the buckets to
112 if (!(new->buckets = (hash_node **)malloc(size * sizeof(hash_node *)))){
117 new->buckets[i] = NODE_NULL;
172 hash_node *found = table->buckets[bucket];
183 table->buckets[bucket] = found->next;
232 hash_node *found = list_find(key, table->buckets[bucket]);
252 new->next = table->buckets[bucket];
253 table->buckets[bucket] = new;
299 hash_node *n = table->buckets[i];
323 hash_node *n = table->buckets[
[all...]
/macosx-10.9.5/BerkeleyDB-21/db/mod_db4/
H A Dmm_hash.c35 cur = table->buckets[i];
64 for (b = table->buckets[ hash ]; b; b = b->next) {
82 for(b = table->buckets[ hash ]; b; b = b->next) {
97 b->next = table->buckets[ hash ];
98 table->buckets[ hash ] = b;
110 for (b = table->buckets[ hash ]; b; b = b->next) {
120 table->buckets[hash] = b->next;
H A Dmm_hash.h27 MM_Bucket *buckets[ MM_HASH_SIZE ]; member in struct:_Hash
/macosx-10.9.5/Libc-997.90.3/include/
H A Dstrhash.h48 hash_node **buckets; member in struct:__anon2894
/macosx-10.9.5/Security-55471.14.18/include/security_smime/
H A Dplhash.c46 /* Compute the number of buckets in ht */
49 /* The smallest table has 16 buckets */
53 /* Compute the maximum entries given n buckets that we will tolerate, ~90% */
139 ht->buckets = (PLHashEntry**)((*allocOps->allocTable)(allocPriv, nb));
140 if (!ht->buckets) {
144 memset(ht->buckets, 0, nb);
164 for (he = ht->buckets[i]; he; he = next) {
170 memset(ht->buckets, 0xDB, n * sizeof ht->buckets[0]);
172 (*allocOps->freeTable)(allocPriv, ht->buckets);
[all...]
/macosx-10.9.5/Security-55471.14.18/libsecurity_smime/lib/
H A Dplhash.c46 /* Compute the number of buckets in ht */
49 /* The smallest table has 16 buckets */
53 /* Compute the maximum entries given n buckets that we will tolerate, ~90% */
139 ht->buckets = (PLHashEntry**)((*allocOps->allocTable)(allocPriv, nb));
140 if (!ht->buckets) {
144 memset(ht->buckets, 0, nb);
164 for (he = ht->buckets[i]; he; he = next) {
170 memset(ht->buckets, 0xDB, n * sizeof ht->buckets[0]);
172 (*allocOps->freeTable)(allocPriv, ht->buckets);
[all...]

Completed in 319 milliseconds

12345