HomeSort by: relevance | last modified time | path
    Searched defs:bucket (Results 1 - 25 of 89) sorted by relevancy

1 2 3 4

  /src/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/
gl_anyhash_list2.h 116 size_t bucket = node->hashcode % new_size; local
117 node->hash_next = new_table[bucket];
118 new_table[bucket] = node;
gl_linkedhash_list.c 61 size_t bucket = node->h.hashcode % list->table_size; local
63 node->h.hash_next = list->table[bucket];
64 list->table[bucket] = &node->h;
71 size_t bucket = node->h.hashcode % list->table_size; local
74 for (p = &list->table[bucket]; ; p = &(*p)->hash_next)
82 /* node is not in the right bucket. Did the hash codes
gl_anylinked_list2.h 232 size_t bucket = hashcode % list->table_size; local
237 /* Look for the first match in the hash bucket. */
241 for (node = (gl_list_node_t) list->table[bucket];
277 /* Look whether there is more than one match in the hash bucket. */
282 for (node = (gl_list_node_t) list->table[bucket];
388 size_t bucket = hashcode % list->table_size; local
395 /* Look for the first match in the hash bucket. */
396 for (node = (gl_list_node_t) list->table[bucket];
407 /* Look whether there is more than one match in the hash bucket. */
411 for (node = (gl_list_node_t) list->table[bucket];
    [all...]
  /src/sys/dev/raidframe/
rf_debugMem.c 157 size_t bucket = (size_t)HASHADDR(addr); local
163 for (p = mh_table[bucket]; p && (p->address != addr); p = p->next)
168 p->next = mh_table[bucket];
169 mh_table[bucket] = p;
189 size_t bucket = HASHADDR(addr); local
193 for (p = mh_table[bucket]; p && (p->address != addr); p = p->next)
  /src/usr.sbin/bootp/common/
hash.c 101 * Frees an entire linked list of bucket members (used in the open
122 * memory and resets all bucket pointers to NULL.
205 * to determine the bucket number, and "compare" and "key" to determine
209 * already exists in the given bucket of the hash table, or some other error
331 unsigned bucket;
344 * until we find a new chain (non-empty bucket) or run out of buckets.
346 bucket = hashtable->bucketnum + 1;
347 while ((bucket < hashtable->size) &&
348 !(memberptr = (hashtable->table)[bucket])) {
349 bucket++
323 unsigned bucket; local
    [all...]
  /src/external/bsd/libarchive/dist/libarchive/
archive_write_disk_set_standard_lookup.c 52 struct bucket { struct
79 * but has a bad pathology in which it thrashes a single bucket. Even
86 struct bucket *ucache = calloc(cache_size, sizeof(struct bucket));
87 struct bucket *gcache = calloc(cache_size, sizeof(struct bucket));
102 struct bucket *b;
103 struct bucket *gcache = (struct bucket *)private_data;
171 struct bucket *b
    [all...]
archive_entry_link_resolver.c 279 size_t hash, bucket; local
300 bucket = hash & (res->number_buckets - 1);
301 for (le = res->buckets[bucket]; le != NULL; le = le->next) {
314 /* Remove it from this hash bucket. */
319 if (res->buckets[bucket] == le)
320 res->buckets[bucket] = le->next;
334 size_t bucket; local
344 /* Look for next non-empty bucket in the links cache. */
345 for (bucket = 0; bucket < res->number_buckets; bucket++)
374 size_t hash, bucket; local
410 size_t i, bucket; local
    [all...]
  /src/external/bsd/top/dist/
hash.h 59 typedef struct bucket { struct
  /src/libexec/ld.elf_so/
symbol.c 333 Elf32_Word bucket; local
349 bucket = obj->buckets_gnu[fast_remainder32(hash, obj->nbuckets_gnu,
351 if (bucket == 0)
354 hashval = &obj->chains_gnu[bucket];
xmalloc.c 111 uint16_t ovu_index; /* bucket # */
171 size_t bucket; local
200 bucket = 0;
203 bucket++;
204 if (amt == 0 || bucket >= NBUCKETS)
208 * If nothing in hash bucket right now,
211 if ((op = nextf[bucket]) == NULL) {
212 morecore(bucket);
213 if ((op = nextf[bucket]) == NULL)
217 nextf[bucket] = op->ov_next
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/amd/amdgpu/
amdgpu_bo_list.c 204 /* This is based on the bucket sort with O(n) time complexity.
205 * An item with priority "i" is added to bucket[i]. The lists are then
208 struct list_head bucket[AMDGPU_BO_LIST_NUM_BUCKETS]; local
213 INIT_LIST_HEAD(&bucket[i]);
225 list_add_tail(&e->tv.head, &bucket[priority]);
232 list_splice(&bucket[i], validated);
  /src/external/cddl/osnet/dist/uts/powerpc/dtrace/
fasttrap_isa.c 268 fasttrap_bucket_t *bucket; local
272 bucket = &fasttrap_tpoints.fth_table[FASTTRAP_TPOINTS_INDEX(pid, pc)];
274 for (tp = bucket->ftb_data; tp != NULL; tp = tp->ftt_next) {
337 fasttrap_bucket_t *bucket; local
366 bucket = &fasttrap_tpoints.fth_table[FASTTRAP_TPOINTS_INDEX(pid, pc)];
371 for (tp = bucket->ftb_data; tp != NULL; tp = tp->ftt_next) {
  /src/external/gpl3/gcc/dist/gcc/
tree-phinodes.cc 97 size_t bucket = NUM_BUCKETS - 2; local
102 for (bucket = len - 2; bucket < NUM_BUCKETS - 2; bucket++)
103 if (free_phinodes[bucket])
107 if (bucket < NUM_BUCKETS - 2
108 && gimple_phi_capacity ((*free_phinodes[bucket])[0]) >= len)
111 phi = as_a <gphi *> (free_phinodes[bucket]->pop ());
112 if (free_phinodes[bucket]->is_empty ())
113 vec_free (free_phinodes[bucket]);
215 size_t bucket; local
    [all...]
  /src/external/gpl3/gcc.old/dist/gcc/
tree-phinodes.cc 97 size_t bucket = NUM_BUCKETS - 2; local
102 for (bucket = len - 2; bucket < NUM_BUCKETS - 2; bucket++)
103 if (free_phinodes[bucket])
107 if (bucket < NUM_BUCKETS - 2
108 && gimple_phi_capacity ((*free_phinodes[bucket])[0]) >= len)
111 phi = as_a <gphi *> (free_phinodes[bucket]->pop ());
112 if (free_phinodes[bucket]->is_empty ())
113 vec_free (free_phinodes[bucket]);
215 size_t bucket; local
    [all...]
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/profile/
unordered_base.h 43 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper
52 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper
54 { return __uc.bucket(__node->_M_v()); }
64 bucket(const _UnorderedCont& __uc, function in struct:__profile::_Bucket_index_helper
66 { return __uc.bucket(__node->_M_v().first); }
76 return __bucket_index_helper::bucket(__uc, __node);
  /src/external/mpl/bind/dist/lib/isc/
symtab.c 154 unsigned int bucket; local
160 FIND(symtab, key, type, bucket, elt);
213 unsigned int bucket; local
220 FIND(symtab, key, type, bucket, elt);
227 UNLINK(symtab->table[bucket], elt, link);
253 PREPEND(symtab->table[bucket], elt, link);
264 unsigned int bucket; local
270 FIND(symtab, key, type, bucket, elt);
280 UNLINK(symtab->table[bucket], elt, link);
  /src/external/mpl/bind/dist/lib/isccc/
symtab.c 102 free_elt(isccc_symtab_t *symtab, unsigned int bucket, elt_t *elt) {
103 ISC_LIST_UNLINK(symtab->table[bucket], elt, link);
191 unsigned int bucket; local
197 FIND(symtab, key, type, bucket, elt);
211 unsigned int bucket; local
218 FIND(symtab, key, type, bucket, elt);
225 ISC_LIST_UNLINK(symtab->table[bucket], elt, link);
246 ISC_LIST_PREPEND(symtab->table[bucket], elt, link);
254 unsigned int bucket; local
260 FIND(symtab, key, type, bucket, elt)
    [all...]
  /src/external/mpl/dhcp/bind/dist/lib/isc/
symtab.c 157 unsigned int bucket; local
163 FIND(symtab, key, type, bucket, elt);
218 unsigned int bucket; local
225 FIND(symtab, key, type, bucket, elt);
232 UNLINK(symtab->table[bucket], elt, link);
258 PREPEND(symtab->table[bucket], elt, link);
269 unsigned int bucket; local
275 FIND(symtab, key, type, bucket, elt);
285 UNLINK(symtab->table[bucket], elt, link);
  /src/lib/libbsdmalloc/
malloc.c 85 u_char ovu_index; /* bucket # */
117 static int pagebucket; /* page size bucket */
181 int bucket; local
203 bucket = 0;
207 bucket++;
209 pagebucket = bucket;
218 amt = 8; /* size of first bucket */
219 bucket = 0;
221 amt = 16; /* size of first bucket */
222 bucket = 1
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/radeon/
radeon_cs.c 48 /* This is based on the bucket sort with O(n) time complexity.
49 * An item with priority "i" is added to bucket[i]. The lists are then
53 struct list_head bucket[RADEON_CS_NUM_BUCKETS]; member in struct:radeon_cs_buckets
61 INIT_LIST_HEAD(&b->bucket[i]);
72 list_add_tail(item, &b->bucket[min(priority, RADEON_CS_MAX_PRIORITY)]);
82 list_splice(&b->bucket[i], out_list);
  /src/sys/net/npf/
lpm.c 88 lpm_ent_t ** bucket; member in struct:__anon7045
115 KASSERT(!hmap->bucket);
119 lpm_ent_t *entry = hmap->bucket[i];
133 kmem_free(hmap->bucket, hmap->hashsize * sizeof(lpm_ent_t *));
134 hmap->bucket = NULL;
172 lpm_ent_t **bucket; local
178 bucket = kmem_zalloc(hashsize * sizeof(lpm_ent_t *), flags);
179 if (bucket == NULL)
182 lpm_ent_t *list = hmap->bucket[n];
190 entry->next = bucket[i]
    [all...]
  /src/external/bsd/jemalloc/dist/src/
ckh.c 4 * hash bucket contains 2^n cells, for n >= 1, and 2 indicates that two hash
24 * | #cells/bucket |
32 * The number of cells per bucket is chosen such that a bucket fits in one cache
58 * Search bucket for key and return the cell number if found; SIZE_T_MAX
62 ckh_bucket_search(ckh_t *ckh, size_t bucket, const void *key) {
67 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];
69 return (bucket << LG_CKH_BUCKET_CELLS) + i;
81 size_t hashes[2], bucket, cell; local
87 /* Search primary bucket. *
137 size_t hashes[2], bucket, tbucket; local
205 size_t hashes[2], bucket; local
    [all...]
  /src/external/bsd/jemalloc.old/dist/src/
ckh.c 4 * hash bucket contains 2^n cells, for n >= 1, and 2 indicates that two hash
24 * | #cells/bucket |
32 * The number of cells per bucket is chosen such that a bucket fits in one cache
59 * Search bucket for key and return the cell number if found; SIZE_T_MAX
63 ckh_bucket_search(ckh_t *ckh, size_t bucket, const void *key) {
68 cell = &ckh->tab[(bucket << LG_CKH_BUCKET_CELLS) + i];
70 return (bucket << LG_CKH_BUCKET_CELLS) + i;
82 size_t hashes[2], bucket, cell; local
88 /* Search primary bucket. *
138 size_t hashes[2], bucket, tbucket; local
206 size_t hashes[2], bucket; local
    [all...]
  /src/external/cddl/osnet/dist/tools/ctf/cvt/
hash.c 114 int bucket = hash->h_hashfn(hash->h_nbuckets, key); local
116 list_add(&hash->h_buckets[bucket], key);
142 int bucket = hash->h_hashfn(hash->h_nbuckets, key); local
144 (void) list_remove(&hash->h_buckets[bucket], key,
152 int bucket = hash->h_hashfn(hash->h_nbuckets, key); local
154 return (list_iter(hash->h_buckets[bucket], fun, private) < 0);
177 int bucket = hash->h_hashfn(hash->h_nbuckets, key); local
185 return (list_iter(hash->h_buckets[bucket], hash_find_list_cb,
  /src/external/gpl3/binutils/dist/opcodes/
arc-ext.c 126 struct ExtInstruction **bucket = local
133 insn->next = *bucket;
137 *bucket = insn;

Completed in 133 milliseconds

1 2 3 4