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

123456

/netgear-R7000-V1.0.7.12_1.2.5/src/router/busybox-1.x/libbb/
H A Dinode_hash.c32 ino_dev_hashtable_bucket_t *bucket; local
37 bucket = ino_dev_hashtable[hash_inode(statbuf->st_ino)];
38 while (bucket != NULL) {
39 if ((bucket->ino == statbuf->st_ino)
40 && (bucket->dev == statbuf->st_dev)
42 return bucket->name;
44 bucket = bucket->next;
53 ino_dev_hashtable_bucket_t *bucket; local
58 bucket
75 ino_dev_hashtable_bucket_t *bucket; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/staging/batman-adv/
H A Dhash.c41 struct element_t *bucket, *last_bucket; local
45 bucket = hash->table[i];
47 while (bucket != NULL) {
49 free_cb(bucket->data);
51 last_bucket = bucket;
52 bucket = bucket->next;
80 /* sanity checks first (if our bucket got deleted in the last
82 if (iter->bucket != NULL) {
86 if ((*iter->first_bucket) != iter->bucket) {
170 struct element_t *bucket, *prev_bucket = NULL; local
210 struct element_t *bucket; local
282 struct element_t *bucket; local
[all...]
H A Dhash.h26 .index = -1, .bucket = NULL, \
37 struct element_t *next; /* overflow bucket pointer */
42 struct element_t *bucket; member in struct:hash_it_t
64 /* remove bucket (this might be used in hash_iterate() if you already found the
65 * bucket you want to delete and don't need the overhead to find it again with
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/ceph/crush/
H A Dmapper.c52 * bucket choose methods
54 * For each bucket algorithm, we have a "choose" method that, given a
56 * will produce an item in the bucket.
60 * Choose based on a random permutation of the bucket.
64 * calculate an actual random permutation of the bucket members.
68 static int bucket_perm_choose(struct crush_bucket *bucket, argument
71 unsigned pr = r % bucket->size;
75 if (bucket->perm_x != x || bucket->perm_n == 0) {
76 dprintk("bucket
128 bucket_uniform_choose(struct crush_bucket_uniform *bucket, int x, int r) argument
135 bucket_list_choose(struct crush_bucket_list *bucket, int x, int r) argument
188 bucket_tree_choose(struct crush_bucket_tree *bucket, int x, int r) argument
219 bucket_straw_choose(struct crush_bucket_straw *bucket, int x, int r) argument
290 crush_choose(struct crush_map *map, struct crush_bucket *bucket, __u32 *weight, int x, int numrep, int type, int *out, int outpos, int firstn, int recurse_to_leaf, int *out2) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/gdbm-1.8.3/
H A Dbucket.c0 /* bucket.c - The routines for playing with hash buckets. */
36 /* Initializing a new hash buckets sets all bucket entries to -1 hash value. */
38 _gdbm_new_bucket (dbf, bucket, bits)
40 hash_bucket *bucket;
46 bucket->av_count = 0;
49 bucket->bucket_bits = bits;
50 bucket->count = 0;
52 /* Initialize all bucket elements. */
54 bucket->h_table[index].hash_value = -1;
59 /* Find a bucket fo
132 hash_bucket *bucket[2]; /* Pointers to the new buckets. */ local
[all...]
H A Dgdbmstore.c57 int elem_loc; /* The location in hash bucket. */
86 A side effect loads the correct bucket and calculates the hash value. */
99 free_adr = dbf->bucket->h_table[elem_loc].data_pointer;
100 free_size = dbf->bucket->h_table[elem_loc].key_size
101 + dbf->bucket->h_table[elem_loc].data_size;
121 (Current bucket's free space is first place to look.) */
127 /* If this is a new entry in the bucket, we need to do special things. */
130 if (dbf->bucket->count == dbf->header->bucket_elems)
132 /* Split the current bucket. */
136 /* Find space to insert into bucket an
[all...]
H A Dgdbmdelete.c45 int elem_loc; /* The location in the current hash bucket. */
73 elem = dbf->bucket->h_table[elem_loc];
76 dbf->bucket->h_table[elem_loc].hash_value = -1;
77 dbf->bucket->count -= 1;
83 && dbf->bucket->h_table[elem_loc].hash_value != -1)
85 home = dbf->bucket->h_table[elem_loc].hash_value
91 dbf->bucket->h_table[last_loc] = dbf->bucket->h_table[elem_loc];
92 dbf->bucket->h_table[elem_loc].hash_value = -1;
106 /* Clear out the data cache for the current bucket
[all...]
H A Dfindkey.c36 /* Read the data found in bucket entry ELEM_LOC in file DBF and
55 key_size = dbf->bucket->h_table[elem_loc].key_size;
56 data_size = dbf->bucket->h_table[elem_loc].data_size;
64 data_ca->hash_val = dbf->bucket->h_table[elem_loc].hash_value;
74 dbf->bucket->h_table[elem_loc].data_pointer, L_SET);
75 if (file_pos != dbf->bucket->h_table[elem_loc].data_pointer)
86 return value is the location in the current hash bucket of the KEY's
97 int bucket_hash_val; /* The hash value from the bucket. */
99 int elem_loc; /* The location in the bucket. */
100 int home_loc; /* The home location in the bucket
[all...]
H A Dgdbmopen.c89 dbf->bucket = NULL;
254 /* Create the first and only hash bucket. */
259 dbf->bucket = (hash_bucket *) malloc (dbf->header->bucket_size);
260 if (dbf->bucket == NULL)
266 _gdbm_new_bucket (dbf, dbf->bucket, 0);
267 dbf->bucket->av_count = 1;
268 dbf->bucket->bucket_avail[0].av_adr = 3*dbf->header->block_size;
269 dbf->bucket->bucket_avail[0].av_size = dbf->header->block_size;
293 /* Block 1 is the initial bucket directory. */
302 /* Block 2 is the only bucket
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/gdbm-1.8.3/
H A Dbucket.c0 /* bucket.c - The routines for playing with hash buckets. */
36 /* Initializing a new hash buckets sets all bucket entries to -1 hash value. */
38 _gdbm_new_bucket (dbf, bucket, bits)
40 hash_bucket *bucket;
46 bucket->av_count = 0;
49 bucket->bucket_bits = bits;
50 bucket->count = 0;
52 /* Initialize all bucket elements. */
54 bucket->h_table[index].hash_value = -1;
59 /* Find a bucket fo
132 hash_bucket *bucket[2]; /* Pointers to the new buckets. */ local
[all...]
H A Dgdbmstore.c57 int elem_loc; /* The location in hash bucket. */
86 A side effect loads the correct bucket and calculates the hash value. */
99 free_adr = dbf->bucket->h_table[elem_loc].data_pointer;
100 free_size = dbf->bucket->h_table[elem_loc].key_size
101 + dbf->bucket->h_table[elem_loc].data_size;
121 (Current bucket's free space is first place to look.) */
127 /* If this is a new entry in the bucket, we need to do special things. */
130 if (dbf->bucket->count == dbf->header->bucket_elems)
132 /* Split the current bucket. */
136 /* Find space to insert into bucket an
[all...]
H A Dgdbmdelete.c45 int elem_loc; /* The location in the current hash bucket. */
73 elem = dbf->bucket->h_table[elem_loc];
76 dbf->bucket->h_table[elem_loc].hash_value = -1;
77 dbf->bucket->count -= 1;
83 && dbf->bucket->h_table[elem_loc].hash_value != -1)
85 home = dbf->bucket->h_table[elem_loc].hash_value
91 dbf->bucket->h_table[last_loc] = dbf->bucket->h_table[elem_loc];
92 dbf->bucket->h_table[elem_loc].hash_value = -1;
106 /* Clear out the data cache for the current bucket
[all...]
H A Dfindkey.c36 /* Read the data found in bucket entry ELEM_LOC in file DBF and
55 key_size = dbf->bucket->h_table[elem_loc].key_size;
56 data_size = dbf->bucket->h_table[elem_loc].data_size;
64 data_ca->hash_val = dbf->bucket->h_table[elem_loc].hash_value;
74 dbf->bucket->h_table[elem_loc].data_pointer, L_SET);
75 if (file_pos != dbf->bucket->h_table[elem_loc].data_pointer)
86 return value is the location in the current hash bucket of the KEY's
97 int bucket_hash_val; /* The hash value from the bucket. */
99 int elem_loc; /* The location in the bucket. */
100 int home_loc; /* The home location in the bucket
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/gettext-0.17/gettext-tools/gnulib-lib/
H A Dgl_linkedhash_list.c60 size_t bucket = node->h.hashcode % list->table_size; local
62 node->h.hash_next = list->table[bucket];
63 list->table[bucket] = &node->h;
70 size_t bucket = node->h.hashcode % list->table_size; local
73 for (p = &list->table[bucket]; ; p = &(*p)->hash_next)
81 /* node is not in the right bucket. Did the hash codes
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openvpn-2.3.1/src/openvpn/
H A Dlist.h82 struct hash_bucket *bucket,
87 struct hash_bucket *bucket,
97 struct hash_bucket *bucket; member in struct:hash_iterator
154 struct hash_bucket *bucket = &hash->buckets[hv & hash->mask]; local
156 he = hash_lookup_fast (hash, bucket, key, hv);
166 struct hash_bucket *bucket,
177 he->next = bucket->list;
178 bucket->list = he;
186 struct hash_bucket *bucket; local
190 bucket
165 hash_add_fast(struct hash *hash, struct hash_bucket *bucket, const void *key, uint32_t hv, void *value) argument
[all...]
H A Dlist.c87 struct hash_bucket *bucket,
94 he = bucket->list;
104 he->next = bucket->list;
105 bucket->list = he;
118 struct hash_bucket *bucket,
125 he = bucket->list;
134 bucket->list = he->next;
149 struct hash_bucket *bucket; local
154 bucket = &hash->buckets[hv & hash->mask];
156 if ((he = hash_lookup_fast (hash, bucket, ke
86 hash_lookup_fast(struct hash *hash, struct hash_bucket *bucket, const void *key, uint32_t hv) argument
117 hash_remove_fast(struct hash *hash, struct hash_bucket *bucket, const void *key, uint32_t hv) argument
189 hash_remove_marked(struct hash *hash, struct hash_bucket *bucket) argument
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/9p/
H A Derror.c193 int bucket; local
196 for (bucket = 0; bucket < ERRHASHSZ; bucket++)
197 INIT_HLIST_HEAD(&hash_errmap[bucket]);
202 bucket = jhash(c->name, c->namelen, 0) % ERRHASHSZ;
204 hlist_add_head(&c->list, &hash_errmap[bucket]);
223 int bucket; local
228 bucket = jhash(errstr, len, 0) % ERRHASHSZ;
229 hlist_for_each_entry(c, p, &hash_errmap[bucket], lis
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/cpuidle/governors/
H A Dmenu.c118 unsigned int bucket; member in struct:menu_device
138 int bucket = 0; local
147 bucket = BUCKETS/2;
150 return bucket;
152 return bucket + 1;
154 return bucket + 2;
156 return bucket + 3;
158 return bucket + 4;
159 return bucket + 5;
258 data->bucket
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/dlm/
H A Ddebug_fs.c349 unsigned bucket; member in struct:rsbtbl_iter
400 unsigned bucket, entry; local
402 bucket = n >> 32;
405 if (bucket >= ls->ls_rsbtbl_size)
420 spin_lock(&ls->ls_rsbtbl[bucket].lock);
421 if (!list_empty(&ls->ls_rsbtbl[bucket].list)) {
422 list_for_each_entry(r, &ls->ls_rsbtbl[bucket].list,
427 ri->bucket = bucket;
428 spin_unlock(&ls->ls_rsbtbl[bucket]
473 unsigned bucket; local
[all...]
H A Ddir.c132 uint32_t bucket; local
134 bucket = dir_hash(ls, de->name, de->length);
135 list_add_tail(&de->list, &ls->ls_dirtbl[bucket].list);
139 int namelen, uint32_t bucket)
143 list_for_each_entry(de, &ls->ls_dirtbl[bucket].list, list) {
155 uint32_t bucket; local
157 bucket = dir_hash(ls, name, namelen);
159 spin_lock(&ls->ls_dirtbl[bucket].lock);
161 de = search_bucket(ls, name, namelen, bucket);
176 spin_unlock(&ls->ls_dirtbl[bucket]
138 search_bucket(struct dlm_ls *ls, char *name, int namelen, uint32_t bucket) argument
306 uint32_t bucket; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/dbus-1.6.8/dbus/
H A Ddbus-hash.c101 * When there are this many entries per bucket, on average, rebuild
108 * hash tables bucket list. The idea is to make it so that
146 * hash bucket, or #NULL for end of
159 DBusHashEntry ***bucket,
171 DBusHashEntry **buckets; /**< Pointer to bucket array. Each
173 * bucket's hash chain, or #NULL.
215 DBusHashEntry **bucket; /**< Pointer to bucket that points to member in struct:__anon1669
220 DBusHashEntry *next_entry; /**< Next entry to be iterated onto in current bucket */
221 int next_bucket; /**< index of next bucket */
457 remove_entry(DBusHashTable *table, DBusHashEntry **bucket, DBusHashEntry *entry) argument
747 DBusHashEntry **bucket; local
771 add_allocated_entry(DBusHashTable *table, DBusHashEntry *entry, unsigned int idx, void *key, DBusHashEntry ***bucket) argument
799 add_entry(DBusHashTable *table, unsigned int idx, void *key, DBusHashEntry ***bucket, DBusPreallocatedHash *preallocated) argument
847 find_generic_function(DBusHashTable *table, void *key, unsigned int idx, KeyCompareFunc compare_func, dbus_bool_t create_if_not_found, DBusHashEntry ***bucket, DBusPreallocatedHash *preallocated) argument
888 find_string_function(DBusHashTable *table, void *key, dbus_bool_t create_if_not_found, DBusHashEntry ***bucket, DBusPreallocatedHash *preallocated) argument
904 find_direct_function(DBusHashTable *table, void *key, dbus_bool_t create_if_not_found, DBusHashEntry ***bucket, DBusPreallocatedHash *preallocated) argument
1009 DBusHashEntry **bucket; local
1127 DBusHashEntry **bucket; local
1155 DBusHashEntry **bucket; local
1183 DBusHashEntry **bucket; local
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/transmission/libevent-2.0.20-stable/
H A Dratelim-internal.h35 /** A token bucket is an internal structure that tracks how many bytes we are
42 /** When was this bucket last updated? Measured in abstract 'ticks'
43 * relative to the token bucket configuration. */
47 /** Configuration info for a token bucket or set of token buckets. */
66 /** The current tick is 'current_tick': add bytes to 'bucket' as specified in
68 int ev_token_bucket_update(struct ev_token_bucket *bucket,
77 /** Adjust 'bucket' to respect 'cfg', and note that it was last updated in
79 * configuration of 'bucket'; otherwise, we are setting it up for the first
82 int ev_token_bucket_init(struct ev_token_bucket *bucket,
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/db-4.7.25.NC/dbinc/
H A Dhash.h74 db_pgno_t bucket; /* Bucket we are traversing. */ member in struct:cursor_t
90 #define H_NOMORE 0x0040 /* No more entries in bucket. */
104 #define BS_TO_PAGE(bucket, spares) \
105 ((bucket) + (spares)[__db_log2((bucket) + 1)])
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/autofs/
H A Ddirhash.c173 int bucket, ecount, i; local
176 bucket = (*ptr >> 16) - 1;
179 if ( bucket < 0 ) {
180 bucket = ecount = 0;
183 DPRINTK(("autofs_hash_enum: bucket %d, entry %d\n", bucket, ecount));
190 while ( bucket < AUTOFS_HASH_SIZE ) {
191 ent = dh->h[bucket];
200 bucket++; ecount = 0;
213 *ptr = ((bucket
[all...]
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/ipv4/netfilter/
H A Dnf_conntrack_l3proto_ipv4_compat.c25 unsigned int bucket; member in struct:ct_iter_state
34 for (st->bucket = 0;
35 st->bucket < net->ct.htable_size;
36 st->bucket++) {
37 n = rcu_dereference(net->ct.hash[st->bucket].first);
52 if (likely(get_nulls_value(head) == st->bucket)) {
53 if (++st->bucket >= net->ct.htable_size)
56 head = rcu_dereference(net->ct.hash[st->bucket].first);
188 unsigned int bucket; member in struct:ct_expect_iter_state
197 for (st->bucket
[all...]

Completed in 406 milliseconds

123456