Searched refs:hashcode (Results 1 - 12 of 12) sorted by relevance

/freebsd-9.3-release/libexec/bootpd/
H A Dhash.c158 * It is assumed that this result will be used as the "hashcode" parameter in
160 * adjust the hashcode for the size of each hashtable.
196 hash_Exists(hashtable, hashcode, compare, key)
198 unsigned hashcode;
204 memberptr = (hashtable->table)[hashcode % (hashtable->size)];
218 * Insert the data item "element" into the hash table using "hashcode"
228 hash_Insert(hashtable, hashcode, compare, key, element)
230 unsigned hashcode;
236 hashcode %= hashtable->size;
237 if (hash_Exists(hashtable, hashcode, compar
[all...]
H A Dreadfile.c326 unsigned hashcode, buflen;
438 hashcode = hash_HashFunction(hp->haddr, haddrlength(hp->htype));
439 if (hash_Insert(hwhashtable, hashcode, hwinscmp, hp, hp) < 0) {
449 hashcode = hash_HashFunction((u_char *) & (hp->iaddr.s_addr), 4);
450 if (hash_Insert(iphashtable, hashcode, nullcmp, hp, hp) < 0) {
459 hashcode = hash_HashFunction((u_char *) hp->hostname->string,
461 if (hash_Insert(nmhashtable, hashcode, nullcmp,
1448 unsigned int tlen, hashcode;
1454 hashcode = hash_HashFunction((u_char *) tstring, tlen);
1455 hp2 = (struct host *) hash_Lookup(nmhashtable, hashcode, nmcm
323 unsigned hashcode, buflen; local
1436 unsigned int tlen, hashcode; local
[all...]
H A Dbootpd.c636 unsigned hlen, hashcode;
686 hashcode = hash_HashFunction(bp->bp_chaddr, hlen);
687 hp = (struct host *) hash_Lookup(hwhashtable, hashcode, hwlookcmp,
699 hashcode = hash_HashFunction(dummyhost.haddr, hlen);
700 hp = (struct host *) hash_Lookup(hwhashtable, hashcode,
725 hashcode = hash_HashFunction((u_char *) &(bp->bp_ciaddr.s_addr), 4);
726 hp = (struct host *) hash_Lookup(iphashtable, hashcode, iplookcmp,
632 unsigned hlen, hashcode; local
/freebsd-9.3-release/libexec/bootpd/tools/bootpef/
H A Dbootpef.c237 unsigned int tlen, hashcode;
241 hashcode = hash_HashFunction((u_char *)argv[0], tlen);
243 hashcode,
234 unsigned int tlen, hashcode; local
/freebsd-9.3-release/contrib/gcc/
H A Dtree-vn.c55 hashval_t hashcode; member in struct:val_expr_pair_d
135 The hashcode is cached in the val_expr_pair, so we just return
142 return ve->hashcode;
261 new_pair->hashcode = vn_compute (expr, 0);
262 slot = htab_find_slot_with_hash (value_table, new_pair, new_pair->hashcode,
302 vep.hashcode = vn_compute (expr, 0);
303 slot = htab_find_slot_with_hash (value_table, &vep, vep.hashcode, NO_INSERT);
H A Dtree.c3393 hashval_t hashcode = 0;
3408 hashcode = iterative_hash_object (code, hashcode);
3410 hashcode = iterative_hash_object (TYPE_HASH (TREE_TYPE (ntype)),
3411 hashcode);
3412 hashcode = attribute_hash_list (attribute, hashcode);
3417 hashcode = type_hash_list (TYPE_ARG_TYPES (ntype), hashcode);
3420 hashcode
3372 hashval_t hashcode = 0; local
4133 type_hash_list(tree list, hashval_t hashcode) argument
4250 type_hash_lookup(hashval_t hashcode, tree type) argument
4271 type_hash_add(hashval_t hashcode, tree type) argument
4293 type_hash_canon(unsigned int hashcode, tree type) argument
4350 attribute_hash_list(tree list, hashval_t hashcode) argument
5192 hashval_t hashcode = 0; local
5248 hashval_t hashcode = 0; local
5314 int hashcode = 0; local
5363 hashval_t hashcode = 0; local
5388 hashval_t hashcode; local
6407 hashval_t hashcode = 0; local
[all...]
H A Dgenattrtab.c292 int hashcode; /* Hash code of this rtx or string. */ member in struct:attr_hash
317 attr_hash_add_rtx (int hashcode, rtx rtl) argument
322 h->hashcode = hashcode;
324 h->next = attr_hash_table[hashcode % RTL_HASH_SIZE];
325 attr_hash_table[hashcode % RTL_HASH_SIZE] = h;
331 attr_hash_add_string (int hashcode, char *str) argument
336 h->hashcode = -hashcode;
338 h->next = attr_hash_table[hashcode
356 int hashcode; local
578 int hashcode; local
[all...]
H A Dtree-ssa-pre.c370 /* The hashcode for the expression, pred pair. This is cached for
372 hashval_t hashcode; member in struct:expr_pred_trans_d
381 return ve->hashcode;
437 ept.hashcode = vn_compute (e, (unsigned long) pred);
438 slot = htab_find_slot_with_hash (phi_translate_table, &ept, ept.hashcode,
459 new_pair->hashcode = vn_compute (e, (unsigned long) pred);
461 new_pair->hashcode, INSERT);
H A Dtree-ssa-structalias.c4359 hashval_t hashcode; member in struct:shared_bitmap_info
4370 return bi->hashcode;
4393 sbi.hashcode = bitmap_hash (pt_vars);
4396 sbi.hashcode, NO_INSERT);
4413 sbi->hashcode = bitmap_hash (pt_vars);
4416 sbi->hashcode, INSERT);
/freebsd-9.3-release/contrib/gperf/src/
H A Dsearch.cc1310 int hashcode; local
1318 hashcode = sum;
1323 if (_collision_detector->set_bit (hashcode))
1529 int hashcode = compute_hash (keyword); local
1530 if (max_hash_value < hashcode)
1531 max_hash_value = hashcode;
1532 if (_collision_detector->set_bit (hashcode))
1603 unsigned int hashcode = compute_hash (curr); local
1604 if (_collision_detector->set_bit (hashcode))
/freebsd-9.3-release/contrib/gcc/cp/
H A Dtree.c736 hashval_t hashcode = 0;
739 hashcode += TREE_HASH (chain);
742 hashcode += TREE_HASH (value);
744 hashcode += 1007;
746 hashcode += TREE_HASH (purpose);
748 hashcode += 1009;
749 return hashcode;
770 int hashcode = 0;
775 hashcode = list_hash_pieces (purpose, value, chain);
782 slot = htab_find_slot_with_hash (list_hash_table, &proxy, hashcode,
732 hashval_t hashcode = 0; local
766 int hashcode = 0; local
[all...]
/freebsd-9.3-release/cddl/contrib/opensolaris/lib/libzfs/common/
H A Dlibzfs_sendrecv.c172 uint32_t hashcode; local
175 hashcode = BF64_GET(cs->zc_word[0], 0, ddt->numhashbits);
177 for (ddepp = &(ddt->dedup_hash_array[hashcode]); *ddepp != NULL;

Completed in 219 milliseconds