/freebsd-10.2-release/usr.bin/grep/regex/ |
H A D | xmalloc.c | 76 int hash; 79 /* I took this hash function just off the top of my head, I have 81 hash = 0; 84 hash ^= (unsigned long)ptr >> i*8; 85 hash += i * 17; 86 hash &= TABLE_MASK; 88 return hash; 75 int hash; local
|
/freebsd-10.2-release/contrib/wpa/src/eap_peer/ |
H A D | eap_pwd.c | 463 struct crypto_hash *hash; local 493 hash = eap_pwd_h_init(); 494 if (hash == NULL) 504 eap_pwd_h_update(hash, cruft, BN_num_bytes(data->grp->prime)); 517 eap_pwd_h_update(hash, cruft, BN_num_bytes(data->grp->prime)); 521 eap_pwd_h_update(hash, cruft, BN_num_bytes(data->grp->prime)); 528 eap_pwd_h_update(hash, cruft, BN_num_bytes(data->grp->order)); 542 eap_pwd_h_update(hash, cruft, BN_num_bytes(data->grp->prime)); 546 eap_pwd_h_update(hash, cruft, BN_num_bytes(data->grp->prime)); 553 eap_pwd_h_update(hash, cruf [all...] |
/freebsd-10.2-release/contrib/subversion/subversion/libsvn_subr/ |
H A D | cache-inprocess.c | 41 apr_hash_t *hash; member in struct:inprocess_cache_t 74 * structs, as well as the dup'd values and hash keys. 98 /* The pool in which cache_entry structs, hash keys, and dup'd 191 struct cache_entry *entry = apr_hash_get(cache->hash, key, cache->klen); 238 * CACHE's hash, clears its pool, and sets its entry pointer to NULL. 255 apr_hash_set(cache->hash, e->key, cache->klen, NULL); 277 existing_entry = apr_hash_get(cache->hash, key, cache->klen); 378 /* Add the entry to the hash, using the *entry's* copy of the 380 apr_hash_set(cache->hash, new_entry->key, cache->klen, new_entry); 448 svn_iter_apr_hash(completed, cache->hash, [all...] |
H A D | iter.c | 66 apr_hash_t *hash, 79 error_received = !apr_hash_do(hash_do_callback, &hdb, hash); 105 for (hi = apr_hash_first(pool, hash); 187 /* Note about the type casts: apr_hash_this() does not expect a const hash 188 * index pointer even though it does not modify the hash index. In 190 * a const hash index and we cast away the const when passing it down to 65 svn_iter_apr_hash(svn_boolean_t *completed, apr_hash_t *hash, svn_iter_apr_hash_cb_t func, void *baton, apr_pool_t *pool) argument
|
/freebsd-10.2-release/contrib/xz/src/liblzma/lz/ |
H A D | lz_encoder.c | 136 // Rewind read_pos so that the match finder can hash 285 // Calculate the sizes of mf->hash and mf->son and check that 298 // be used as a hash mask. 342 // Deallocate the old hash array if it exists and has different size 345 lzma_free(mf->hash, allocator); 346 mf->hash = NULL; 384 // Allocate match finder's hash array. 394 if (mf->hash == NULL) { 395 mf->hash = lzma_alloc(alloc_count * sizeof(uint32_t), 397 if (mf->hash [all...] |
/freebsd-10.2-release/contrib/apr-util/dbm/sdbm/ |
H A D | sdbm.c | 247 register long hash; local 264 if ((status = getpage(db, (hash = exhash(key)))) == APR_SUCCESS) { 280 if ((status = makroom(db, hash, need)) != APR_SUCCESS) 302 static apr_status_t makroom(apr_sdbm_t *db, long hash, int need) argument 319 newp = (hash & db->hmask) | (db->hmask + 1); 329 if (hash & (db->hmask + 1)) { 356 + ((hash & (db->hmask + 1)) ? 2 : 1); 444 static apr_status_t getpage(apr_sdbm_t *db, long hash) argument 454 dbit = 2 * dbit + ((hash & (1 << hbit++)) ? 2 : 1); 461 pagb = hash [all...] |
/freebsd-10.2-release/contrib/unbound/util/storage/ |
H A D | lruhash.c | 2 * util/storage/lruhash.c - hashtable, hash function, LRU keeping. 122 /* move entries to new table. Notice that since hash x is mapped to 140 newbin = &newa[p->hash & newmask]; 201 bin = &table->array[d->hash & table->size_mask]; 218 struct lruhash_bin* bin, hashvalue_t hash, void* key) 222 if(p->hash == hash && table->compfunc(p->key, key) == 0) 236 log_err("hash array malloc: size_t too small"); 242 log_err("hash grow: malloc failed"); 299 lruhash_insert(struct lruhash* table, hashvalue_t hash, argument 217 bin_find_entry(struct lruhash* table, struct lruhash_bin* bin, hashvalue_t hash, void* key) argument 355 lruhash_lookup(struct lruhash* table, hashvalue_t hash, void* key, int wr) argument 377 lruhash_remove(struct lruhash* table, hashvalue_t hash, void* key) argument [all...] |
/freebsd-10.2-release/crypto/heimdal/lib/gssapi/krb5/ |
H A D | unwrap.c | 52 u_char hash[16]; local 130 EVP_DigestFinal_ex(md5, hash, NULL); 136 DES_cbc_cksum ((void *)hash, (void *)hash, sizeof(hash), 138 if (ct_memcmp (p - 8, hash, 8) != 0) 148 EVP_CipherInit_ex(&des_ctx, EVP_des_cbc(), NULL, key->keyvalue.data, hash, 0);
|
H A D | verify_mic.c | 52 u_char hash[16], *seq; local 82 EVP_DigestFinal_ex(md5, hash, NULL); 89 DES_cbc_cksum ((void *)hash, (void *)hash, sizeof(hash), 91 if (ct_memcmp (p - 8, hash, 8) != 0) { 104 EVP_CipherInit_ex(&des_ctx, EVP_des_cbc(), NULL, key->keyvalue.data, hash, 0);
|
/freebsd-10.2-release/contrib/wpa/src/crypto/ |
H A D | random.c | 102 u8 hash[SHA1_MAC_LEN]; local 106 /* First, add hash back to pool to make backtracking more difficult. */ 108 sizeof(pool), hash); 109 random_mix_pool(hash, sizeof(hash)); 114 sizeof(buf), hash); 116 * Fold the hash to further reduce any potential output pattern. 120 hash_ptr = (u32 *) hash; 122 os_memcpy(out, hash, EXTRACT_LEN);
|
H A D | crypto_cryptoapi.c | 110 HCRYPTHASH hash; local 120 if (!CryptCreateHash(prov, alg, 0, 0, &hash)) { 127 if (!CryptHashData(hash, (BYTE *) addr[i], len[i], 0)) { 129 CryptDestroyHash(hash); 135 if (!CryptGetHashParam(hash, HP_HASHVAL, mac, &hlen, 0)) { 140 CryptDestroyHash(hash); 348 HCRYPTHASH hash; member in struct:crypto_hash 419 if (!CryptCreateHash(ctx->prov, calg, ctx->key, 0, &ctx->hash)) { 441 if (!CryptSetHashParam(ctx->hash, HP_HMAC_INFO, (BYTE *) &info, 444 CryptDestroyHash(ctx->hash); [all...] |
/freebsd-10.2-release/contrib/wpa/src/eap_common/ |
H A D | eap_gpsk_common.c | 44 u8 ibuf[2], hash[16]; local 48 hashlen = sizeof(hash); 60 if (omac1_aes_128_vector(psk, 2, addr, vlen, hash)) 63 os_memcpy(opos, hash, clen); 79 u8 ibuf[2], hash[SHA256_MAC_LEN]; local 95 hmac_sha256_vector(psk, 32, 2, addr, vlen, hash); 97 os_memcpy(opos, hash, clen);
|
H A D | ikev2_common.c | 57 size_t data_len, u8 *hash) 66 os_memcpy(hash, tmphash, 12); 72 os_memcpy(hash, tmphash, 12); 97 u8 *hash) 101 hmac_sha1_vector(key, key_len, num_elem, addr, len, hash); 104 hmac_md5_vector(key, key_len, num_elem, addr, len, hash); 118 u8 hash[IKEV2_MAX_HASH_LEN]; local 131 addr[0] = hash; 145 &len[1], hash); 148 hash); 56 ikev2_integ_hash(int alg, const u8 *key, size_t key_len, const u8 *data, size_t data_len, u8 *hash) argument 95 ikev2_prf_hash(int alg, const u8 *key, size_t key_len, size_t num_elem, const u8 *addr[], const size_t *len, u8 *hash) argument 440 u8 *sign_data, *pos, *buf, hash[IKEV2_MAX_HASH_LEN]; local 498 u8 hash[IKEV2_MAX_HASH_LEN], *decrypted; local [all...] |
/freebsd-10.2-release/contrib/wpa/src/tls/ |
H A D | tlsv1_record.c | 44 if (suite->hash == TLS_HASH_MD5) { 47 } else if (suite->hash == TLS_HASH_SHA) { 50 } else if (suite->hash == TLS_HASH_SHA256) { 285 u8 len[2], hash[100]; local 429 "hash value"); 451 hlen = sizeof(hash); 452 if (crypto_hash_finish(hmac, hash, &hlen) < 0) { 459 os_memcmp(hash, out_data + plen, hlen) != 0 ||
|
H A D | tlsv1_client_write.c | 434 u8 hash[100], *hpos; local 466 * The hash values are calculated over all handshake messages sent or 472 hpos = hash; 501 os_memmove(hash + 19, hash, hlen); 503 os_memcpy(hash, "\x30\x31\x30\x0d\x06\x09\x60\x86\x48\x01\x65" 542 wpa_hexdump(MSG_MSGDUMP, "TLSv1: CertificateVerify hash", hash, hlen); 549 * hash algorithms. 552 * HashAlgorithm hash; 646 u8 hash[MD5_MAC_LEN + SHA1_MAC_LEN]; local [all...] |
/freebsd-10.2-release/contrib/libc++/src/ |
H A D | debug.cpp | 129 size_t hc = hash<const void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); 165 size_t h = hash<void*>()(q->__c_) % nc; 176 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); 200 size_t hi = hash<void*>()(__i) % static_cast<size_t>(__iend_ - __ibeg_); 233 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); 264 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); 290 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); 317 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); 433 size_t hc = hash<void*>()(c1) % static_cast<size_t>(__cend_ - __cbeg_); 441 hc = hash<voi [all...] |
/freebsd-10.2-release/contrib/ncurses/ncurses/tty/ |
H A D | hashmap.c | 49 sped up by hashing. If a line hash is unique in both screens, those 53 We don't worry about false pairs produced by hash collisions, on the 115 hash(NCURSES_CH_T * text) function 292 /* re-hash only changed lines */ 295 newhash[i] = hash(NEWTEXT(i)); 298 /* re-hash all */ 306 newhash[i] = hash(NEWTEXT(i)); 307 oldhash[i] = hash(OLDTEXT(i)); 313 if (newhash[i] != hash(NEWTEXT(i))) 315 if (oldhash[i] != hash(OLDTEX [all...] |
/freebsd-10.2-release/contrib/jemalloc/src/ |
H A D | ckh.c | 4 * hash bucket contains 2^n cells, for n >= 1, and 2 indicates that two hash 14 * alternative to traditional hash tables. In Proceedings of the 7th 18 * This implementation uses precisely two hash functions because that is the 77 ckh->hash(key, hashes); 158 ckh->hash(key, hashes); 200 ckh->hash(key, hashes); 219 * Try to rebuild the hash table from scratch by inserting all items from the 348 ckh_new(ckh_t *ckh, size_t minitems, ckh_hash_t *hash, ckh_keycomp_t *keycomp) argument 355 assert(hash ! [all...] |
/freebsd-10.2-release/contrib/binutils/bfd/ |
H A D | merge.c | 33 /* An entry in the section merge hash table. */ 52 /* Next entity in the hash table. */ 56 /* The section merge hash table. */ 79 /* A hash table used to hold section content. */ 91 /* A hash table used to hold section content. */ 130 /* Look up an entry in a section merge hash table. */ 137 register unsigned long hash; local 143 hash = 0; 152 hash += c + (c << 17); 153 hash [all...] |
/freebsd-10.2-release/contrib/wpa/src/radius/ |
H A D | radius.c | 482 u8 hash[MD5_MAC_LEN]; local 493 md5_vector(4, addr, len, hash); 494 return os_memcmp(msg->hdr->authenticator, hash, MD5_MAC_LEN) != 0; 504 u8 hash[MD5_MAC_LEN]; local 520 md5_vector(4, addr, len, hash); 521 if (os_memcmp(msg->hdr->authenticator, hash, MD5_MAC_LEN) != 0) 802 u8 hash[MD5_MAC_LEN]; local 824 md5_vector(4, addr, len, hash); 825 if (os_memcmp(hash, msg->hdr->authenticator, MD5_MAC_LEN) != 0) { 857 * Use one-way MD5 hash calculate 952 u8 hash[MD5_MAC_LEN]; local 1023 u8 hash[MD5_MAC_LEN], saltbuf[2], *pos; local 1218 u8 hash[16]; local 1422 u8 hash[16]; local [all...] |
/freebsd-10.2-release/contrib/wpa/src/eap_server/ |
H A D | eap_server_md5.c | 104 u8 hash[CHAP_MD5_LEN], id; local 123 data->challenge, CHALLENGE_LEN, hash)) { 129 if (os_memcmp(hash, pos, CHAP_MD5_LEN) == 0) {
|
/freebsd-10.2-release/contrib/wpa/src/wps/ |
H A D | wps_common.c | 28 u8 hash[SHA256_MAC_LEN], *opos; local 48 hmac_sha256_vector(key, SHA256_MAC_LEN, 4, addr, len, hash); 50 os_memcpy(opos, hash, SHA256_MAC_LEN); 54 os_memcpy(opos, hash, left); 132 u8 hash[SHA256_MAC_LEN]; local 135 (dev_passwd_len + 1) / 2, hash); 136 os_memcpy(wps->psk1, hash, WPS_PSK_LEN); 139 dev_passwd_len / 2, hash); 140 os_memcpy(wps->psk2, hash, WPS_PSK_LEN); 447 u8 hash[SHA1_MAC_LE local [all...] |
/freebsd-10.2-release/cddl/contrib/opensolaris/tools/ctf/cvt/ |
H A D | iidesc.c | 39 #include "hash.h" 87 iidesc_add(hash_t *hash, iidesc_t *new) argument 94 (void) hash_match(hash, new, iidesc_cmp, &find); 108 hash_add(hash, new);
|
/freebsd-10.2-release/contrib/apr-util/include/ |
H A D | apr_memcache.h | 77 /* Custom hash callback function prototype, user for server selection. 79 * @param data data to hash 91 * @param hash hash of the selected key. 95 const apr_uint32_t hash); 122 * Creates a crc32 hash used to split keys between servers 126 * @return crc32 hash of data 127 * @remark The crc32 hash is not compatible with old memcached clients. 141 * hash compatible with the standard Perl Client. 148 * Picks a server based on a hash [all...] |
/freebsd-10.2-release/contrib/groff/src/roff/troff/ |
H A D | dictionary.cpp | 26 // is `p' a good size for a hash table 52 for (i = int(s.hash() % size); 100 for (i = int(s.hash() % size); 115 r = int(table[i].s.hash() % size);
|