HomeSort by: relevance | last modified time | path
    Searched refs:hashcode (Results 1 - 25 of 27) sorted by relevancy

1 2

  /src/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/
gl_anyhash_list1.h 26 size_t hashcode; /* cache of values' common hash code */ member in struct:gl_hash_entry
gl_linkedhash_list.c 61 size_t bucket = node->h.hashcode % list->table_size;
71 size_t bucket = node->h.hashcode % list->table_size;
gl_anylinked_list2.h 100 node->h.hashcode =
201 if (new_hashcode != node->h.hashcode)
205 node->h.hashcode = new_hashcode;
228 size_t hashcode = local
232 size_t bucket = hashcode % list->table_size;
244 if (node->h.hashcode == hashcode
285 if (node->h.hashcode == hashcode
310 if (node->h.hashcode == hashcod
384 size_t hashcode = local
    [all...]
gl_anyhash_list2.h 116 size_t bucket = node->hashcode % new_size;
  /src/usr.sbin/bootp/common/
hash.c 149 * It is assumed that this result will be used as the "hashcode" parameter in
151 * adjust the hashcode for the size of each hashtable.
185 hash_Exists(hash_tbl *hashtable, unsigned int hashcode, hash_cmpfp compare,
190 memberptr = (hashtable->table)[hashcode % (hashtable->size)];
204 * Insert the data item "element" into the hash table using "hashcode"
214 hash_Insert(hash_tbl *hashtable, unsigned int hashcode, hash_cmpfp compare,
219 hashcode %= hashtable->size;
220 if (hash_Exists(hashtable, hashcode, compare, key)) {
228 temp->next = (hashtable->table)[hashcode];
229 (hashtable->table)[hashcode] = temp
    [all...]
readfile.c 322 unsigned hashcode, buflen;
434 hashcode = hash_HashFunction(hp->haddr, haddrlength(hp->htype));
435 if (hash_Insert(hwhashtable, hashcode, hwinscmp, hp, hp) < 0) {
445 hashcode = hash_HashFunction((u_char *) & (hp->iaddr.s_addr), 4);
446 if (hash_Insert(iphashtable, hashcode, nullcmp, hp, hp) < 0) {
455 hashcode = hash_HashFunction((u_char *) hp->hostname->string,
457 if (hash_Insert(nmhashtable, hashcode, nullcmp,
1426 unsigned int tlen, hashcode;
1432 hashcode = hash_HashFunction((u_char *) tstring, tlen);
1433 hp2 = (struct host *) hash_Lookup(nmhashtable, hashcode, nmcmp, tstring)
319 unsigned hashcode, buflen; local
1414 unsigned int tlen, hashcode; local
    [all...]
  /src/usr.sbin/bootp/bootpef/
bootpef.c 233 unsigned int tlen, hashcode;
237 hashcode = hash_HashFunction((u_char *)argv[0], tlen);
239 hashcode,
230 unsigned int tlen, hashcode; local
  /src/external/gpl3/gcc/dist/gcc/
tree-ssa-sccvn.h 45 and hashcode is stored to avoid having to calculate it
56 hashval_t hashcode; member in struct:vn_nary_op_s
79 number of the operation, and hashcode is stored to avoid having to
88 hashval_t hashcode; member in struct:vn_phi_s
137 the resulting value number, and the hashcode. */
144 hashval_t hashcode; member in struct:vn_reference_s
161 hashval_t hashcode; member in struct:vn_constant_s
genattrtab.cc 327 unsigned int hashcode; /* Hash code of this rtx or string. */ member in struct:attr_hash
349 /* Add an entry to the hash table for RTL with hash code HASHCODE. */
352 attr_hash_add_rtx (unsigned int hashcode, rtx rtl)
357 h->hashcode = hashcode;
359 h->next = attr_hash_table[hashcode % RTL_HASH_SIZE];
360 attr_hash_table[hashcode % RTL_HASH_SIZE] = h;
363 /* Add an entry to the hash table for STRING with hash code HASHCODE. */
366 attr_hash_add_string (unsigned int hashcode, char *str)
371 h->hashcode = -hashcode
391 unsigned int hashcode; local
    [all...]
tree-ssa-sccvn.cc 155 /* Return the computed hashcode for nary operation P1. */
160 return vno1->hashcode;
187 /* Return the computed hashcode for phi operation P1. */
192 return vp1->hashcode;
245 /* Return the hashcode for a given reference operation P1. */
250 return vr1->hashcode;
338 return vc1->hashcode;
346 if (vc1->hashcode != vc2->hashcode)
654 vc.hashcode = vn_hash_constant_with_type (constant)
    [all...]
tree-ssa-structalias.cc 1938 hashval_t hashcode; member in struct:equiv_class_label
1958 return ecl->hashcode;
1967 return (eql1->hashcode == eql2->hashcode
1993 ecl.hashcode = bitmap_hash (labels);
1999 (*slot)->hashcode = ecl.hashcode;
6583 hashval_t hashcode; member in struct:shared_bitmap_info
6601 return bi->hashcode;
6627 sbi.hashcode = bitmap_hash (pt_vars)
    [all...]
tree-ssa-pre.cc 311 return PRE_EXPR_NARY (e)->hashcode;
313 return PRE_EXPR_REFERENCE (e)->hashcode;
438 nary->hashcode = vn_nary_op_compute_hash (nary);
  /src/external/gpl3/gcc.old/dist/gcc/
tree-ssa-sccvn.h 45 and hashcode is stored to avoid having to calculate it
56 hashval_t hashcode; member in struct:vn_nary_op_s
79 number of the operation, and hashcode is stored to avoid having to
88 hashval_t hashcode; member in struct:vn_phi_s
137 the resulting value number, and the hashcode. */
144 hashval_t hashcode; member in struct:vn_reference_s
159 hashval_t hashcode; member in struct:vn_constant_s
genattrtab.cc 327 unsigned int hashcode; /* Hash code of this rtx or string. */ member in struct:attr_hash
349 /* Add an entry to the hash table for RTL with hash code HASHCODE. */
352 attr_hash_add_rtx (unsigned int hashcode, rtx rtl)
357 h->hashcode = hashcode;
359 h->next = attr_hash_table[hashcode % RTL_HASH_SIZE];
360 attr_hash_table[hashcode % RTL_HASH_SIZE] = h;
363 /* Add an entry to the hash table for STRING with hash code HASHCODE. */
366 attr_hash_add_string (unsigned int hashcode, char *str)
371 h->hashcode = -hashcode
391 unsigned int hashcode; local
    [all...]
tree-ssa-sccvn.cc 149 /* Return the computed hashcode for nary operation P1. */
154 return vno1->hashcode;
181 /* Return the computed hashcode for phi operation P1. */
186 return vp1->hashcode;
239 /* Return the hashcode for a given reference operation P1. */
244 return vr1->hashcode;
332 return vc1->hashcode;
340 if (vc1->hashcode != vc2->hashcode)
648 vc.hashcode = vn_hash_constant_with_type (constant)
    [all...]
tree-ssa-structalias.cc 1915 hashval_t hashcode; member in struct:equiv_class_label
1935 return ecl->hashcode;
1944 return (eql1->hashcode == eql2->hashcode
1970 ecl.hashcode = bitmap_hash (labels);
1976 (*slot)->hashcode = ecl.hashcode;
6557 hashval_t hashcode; member in struct:shared_bitmap_info
6575 return bi->hashcode;
6601 sbi.hashcode = bitmap_hash (pt_vars)
    [all...]
tree-ssa-pre.cc 311 return PRE_EXPR_NARY (e)->hashcode;
313 return PRE_EXPR_REFERENCE (e)->hashcode;
450 nary->hashcode = vn_nary_op_compute_hash (nary);
tree.cc 6190 /* Given TYPE, and HASHCODE its hash code, return the canonical
6200 type_hash_canon (unsigned int hashcode, tree type)
6213 in.hash = hashcode;
6216 loc = type_hash_table->find_slot_with_hash (&in, hashcode, INSERT);
6254 h->hash = hashcode;
  /src/usr.sbin/bootp/bootpd/
bootpd.c 602 unsigned hlen, hashcode;
660 hashcode = hash_HashFunction(bp->bp_chaddr, hlen);
661 hp = (struct host *) hash_Lookup(hwhashtable, hashcode, hwlookcmp,
673 hashcode = hash_HashFunction(dummyhost.haddr, hlen);
674 hp = (struct host *) hash_Lookup(hwhashtable, hashcode,
699 hashcode = hash_HashFunction((u_char *) &(bp->bp_ciaddr.s_addr), 4);
700 hp = (struct host *) hash_Lookup(iphashtable, hashcode, iplookcmp,
597 unsigned hlen, hashcode; local
  /src/external/gpl2/gettext/dist/gettext-tools/src/
write-qt.c 83 u32 hashcode; // elfHash of the concatenation of msgid and
87 It's sorted in ascending order by hashcode as primary sorting criteria
134 u32 hashcode; // elfHash of the concatenation of msgid and
424 unsigned int hashcode = string_hashcode (msgid_as_iso_8859_1); local
428 append_u32 (&hashes_pool, hashcode);
446 append_u32 (&messages_pool, hashcode);
write-java.c 115 The Java String.hashCode() function returns the same values across
167 i.e. total number of times that 1 + (hashcode % (hashsize - 2))
306 unsigned int hashcode = string_hashcode (mlp->item[j]->msgid); local
307 unsigned int idx = hashcode % hashsize;
311 unsigned int incr = 1 + (hashcode % (hashsize - 2));
418 fprintf (stream, " int hash_val = msgid.hashCode() & 0x7fffffff;\n");
  /src/external/gpl3/gcc.old/dist/gcc/cp/
tree.cc 2187 hashval_t hashcode = 0;
2190 hashcode += TREE_HASH (chain);
2193 hashcode += TREE_HASH (value);
2195 hashcode += 1007;
2197 hashcode += TREE_HASH (purpose);
2199 hashcode += 1009;
2200 return hashcode;
2220 int hashcode = 0;
2225 hashcode = list_hash_pieces (purpose, value, chain);
2232 slot = list_hash_table->find_slot_with_hash (&proxy, hashcode, INSERT)
2184 hashval_t hashcode = 0; local
2217 int hashcode = 0; local
    [all...]
  /src/external/gpl3/gcc/dist/gcc/cp/
tree.cc 2201 hashval_t hashcode = 0;
2204 hashcode += TREE_HASH (chain);
2207 hashcode += TREE_HASH (value);
2209 hashcode += 1007;
2211 hashcode += TREE_HASH (purpose);
2213 hashcode += 1009;
2214 return hashcode;
2234 int hashcode = 0;
2239 hashcode = list_hash_pieces (purpose, value, chain);
2246 slot = list_hash_table->find_slot_with_hash (&proxy, hashcode, INSERT)
2198 hashval_t hashcode = 0; local
2231 int hashcode = 0; local
    [all...]
  /src/external/cddl/osnet/dist/lib/libzfs/common/
libzfs_sendrecv.c 179 uint32_t hashcode; local
182 hashcode = BF64_GET(cs->zc_word[0], 0, ddt->numhashbits);
184 for (ddepp = &(ddt->dedup_hash_array[hashcode]); *ddepp != NULL;
  /src/external/gpl3/gcc/dist/gcc/c-family/
c-common.cc 7146 hashval_t hashcode = type_hash_canon_hash (main_type);
7147 main_type = type_hash_canon (hashcode, main_type);
7129 hashval_t hashcode = type_hash_canon_hash (main_type); local

Completed in 99 milliseconds

1 2