Lines Matching defs:idx
71 u_int *idx);
73 u_int *idx);
137 iter->idx = 0;
169 u_int idx = 0;
174 rval = get_locate_index(dict, key, &idx);
177 entry = kxld_array_get_item(&dict->buckets, idx);
195 u_int base, idx;
197 base = idx = dict->hash(dict, key);
200 entry = kxld_array_get_item(&dict->buckets, idx);
204 idx = (idx + 1) % dict->buckets.nitems;
205 if (idx == base) goto finish;
207 entry = kxld_array_get_item(&dict->buckets, idx);
210 check(idx < dict->buckets.nitems);
212 *_idx = idx;
226 u_int idx = 0;
244 rval = get_insert_index(dict, key, &idx);
250 entry = kxld_array_get_item(&dict->buckets, idx);
318 u_int base, idx;
320 base = idx = dict->hash(dict, key);
325 entry = kxld_array_get_item(&dict->buckets, idx);
327 idx = (idx + 1) % dict->buckets.nitems;
328 require_action(base != idx, finish, rval=KERN_FAILURE);
329 entry = kxld_array_get_item(&dict->buckets, idx);
332 *r_index = idx;
346 u_int idx = 0;
352 rval = get_locate_index(dict, key, &idx);
358 entry = kxld_array_get_item(&dict->buckets, idx);
386 for (; iter->idx < iter->dict->buckets.nitems; ++(iter->idx)) {
387 entry = kxld_array_get_item(&iter->dict->buckets, iter->idx);
391 ++(iter->idx);
402 iter->idx = 0;
407 * It's fast and distributes well. Returns an idx into the symbol hash table.