/freebsd-10.2-release/contrib/subversion/subversion/include/ |
H A D | svn_ra.h | 636 * @a config is a hash mapping <tt>const char *</tt> keys to 836 * @a rev in the repository of @a session. The hash maps 873 * @a revprop_table is a hash mapping <tt>const char *</tt> property 890 * @a lock_tokens, if non-NULL, is a hash mapping <tt>const char 919 * to a hash containing the @c SVN_PROP_REVISION_LOG property set 1474 * the hash's keys are all the paths committed in that revision, the hash's 1744 * Lock each path in @a path_revs, which is a hash whose keys are the 1786 * @a path_tokens is a hash whose keys are the paths to be locked, and 2358 * entries) to the hash tabl [all...] |
/freebsd-10.2-release/contrib/wpa/src/tls/ |
H A D | tlsv1_client_read.c | 765 u8 hash[MD5_MAC_LEN + SHA1_MAC_LEN]; local 824 crypto_hash_finish(conn->verify.sha256_server, hash, &hlen) 837 crypto_hash_finish(conn->verify.md5_server, hash, &hlen) < 0) { 848 crypto_hash_finish(conn->verify.sha1_server, hash + MD5_MAC_LEN, 864 "server finished", hash, hlen,
|
H A D | x509v3.c | 1590 u8 hash[32]; local 1748 hash); 1750 wpa_hexdump(MSG_MSGDUMP, "X509: Certificate hash (MD5)", 1751 hash, hash_len); 1755 hash); 1757 wpa_hexdump(MSG_MSGDUMP, "X509: Certificate hash (SHA1)", 1758 hash, hash_len); 1762 hash); 1764 wpa_hexdump(MSG_MSGDUMP, "X509: Certificate hash (SHA256)", 1765 hash, hash_le [all...] |
/freebsd-10.2-release/contrib/wpa/src/wps/ |
H A D | wps_registrar.c | 1392 u8 *hash; local 1411 hash = wpabuf_put(msg, SHA256_MAC_LEN); 1421 hmac_sha256_vector(wps->authkey, WPS_AUTHKEY_LEN, 4, addr, len, hash); 1422 wpa_hexdump(MSG_DEBUG, "WPS: R-Hash1", hash, SHA256_MAC_LEN); 1427 hash = wpabuf_put(msg, SHA256_MAC_LEN); 1431 hmac_sha256_vector(wps->authkey, WPS_AUTHKEY_LEN, 4, addr, len, hash); 1432 wpa_hexdump(MSG_DEBUG, "WPS: R-Hash2", hash, SHA256_MAC_LEN); 2147 u8 hash[SHA256_MAC_LEN]; local 2168 hmac_sha256_vector(wps->authkey, WPS_AUTHKEY_LEN, 4, addr, len, hash); 2170 if (os_memcmp(wps->peer_hash1, hash, WPS_HASH_LE 2187 u8 hash[SHA256_MAC_LEN]; local 2532 u8 hash[WPS_HASH_LEN]; local 3516 const u8 *pos, *hash, *dev_pw; local [all...] |
/freebsd-10.2-release/sys/vm/ |
H A D | uma_core.c | 116 * The initial hash tables come out of this zone so they can be allocated 251 static void hash_free(struct uma_hash *hash); 446 * based calculations. (stats, hash size, etc.) 476 * Expand the keg hash table. 478 * This is done if the number of slabs is larger than the hash size. 521 * Allocate and zero fill the next sized hash table from the appropriate 525 * hash A new hash structure with the old hash size in uh_hashsize 531 hash_alloc(struct uma_hash *hash) argument 614 hash_free(struct uma_hash *hash) argument [all...] |
/freebsd-10.2-release/crypto/heimdal/lib/gssapi/mech/ |
H A D | gss_mo.c | 193 u_char hdr[2], hash[20], *h = hash; local 205 EVP_DigestFinal_ex(ctx, hash, NULL);
|
/freebsd-10.2-release/contrib/unbound/dns64/ |
H A D | dns64.c | 651 dk->entry.hash = rrset_key_hash(&dk->rk); 714 /* also sets dk->entry.hash */ 722 dk->entry.hash = fk->entry.hash;
|
/freebsd-10.2-release/contrib/diff/src/ |
H A D | io.c | 32 /* Given a hash value and a new character, return a new hash value. */ 36 /* The type of a hash value. */ 47 hash_value hash; /* Hash of lines in this class. */ 56 /* Number of buckets in the hash table array, not counting buckets[-1]. */ 424 eqs[i].hash = h; 430 else if (eqs[i].hash == h) 846 /* Allocate (one plus) a prime number of hash buckets. Use a prime 46 hash_value hash; /* Hash of lines in this class. */ member in struct:equivclass
|
/freebsd-10.2-release/contrib/ipfilter/ |
H A D | ip_fil.c | 581 u_char hash[16]; local 586 * Compute the base value of the ISS. It is a hash 599 MD5Final(hash, &ctx); 601 memcpy(&newiss, hash, sizeof(newiss));
|
H A D | md5.c | 172 void MD5Final (hash, mdContext) 173 unsigned char hash[]; 210 bcopy((char *)mdContext->digest, (char *)hash, 16);
|
/freebsd-10.2-release/usr.sbin/kldxref/ |
H A D | ef.c | 175 unsigned long hash; local 178 hash = elf_hash(name); 179 symnum = ef->ef_buckets[hash % ef->ef_nbuckets]; 286 warnx("can't read hash header (%lx)", 296 warnx("can't read hash table");
|
/freebsd-10.2-release/contrib/binutils/bfd/ |
H A D | elf-eh-frame.c | 33 unsigned int hash; member in struct:cie 220 if (c1->hash == c2->hash 249 return c->hash; 270 c->hash = h; 925 ecie->cie.hash, INSERT);
|
H A D | xcofflink.c | 63 when the reloc was handled, the global hash table entry. */ 402 /* Routine to create an entry in an XCOFF link hash table. */ 438 /* Create a XCOFF link hash table. */ 478 /* Free a XCOFF link hash table. */ 481 _bfd_xcoff_bfd_link_hash_table_free (struct bfd_link_hash_table *hash) 483 struct xcoff_link_hash_table *ret = (struct xcoff_link_hash_table *) hash; 566 if (info->hash->creator != abfd->xvec) 635 symbols routine, since we might not be using an XCOFF hash 637 hash table. */ 792 if (info->hash 479 _bfd_xcoff_bfd_link_hash_table_free(struct bfd_link_hash_table *hash) argument 3403 bfd_boolean copy, hash; local [all...] |
/freebsd-10.2-release/contrib/llvm/tools/lldb/source/Breakpoint/ |
H A D | BreakpointLocation.cpp | 257 BreakpointLocation::GetConditionText (size_t *hash) const 259 return GetOptionsNoCreate()->GetConditionText(hash);
|
/freebsd-10.2-release/contrib/llvm/tools/clang/lib/Rewrite/Core/ |
H A D | HTMLRewrite.cpp | 415 case tok::hash: { 463 if (Tok.is(tok::hash) && Tok.isAtStartOfLine())
|
/freebsd-10.2-release/contrib/gcc/ |
H A D | tree-ssa-dom.c | 91 expressions it enters into the hash table along with a marker entry 93 remove the expressions from the global hash table until we hit the 102 hash code for an expression and be unable to find/remove it from 106 /* Structure for entries in the expression hash table. 108 This requires more memory for the hash table entries, but allows us 110 eliminates 2 global hash tables and two block local varrays. 112 It also allows us to reduce the number of hash table lookups we 128 /* The hash value for RHS/ann. */ 129 hashval_t hash; member in struct:expr_hash_elt 247 /* Create our hash table [all...] |
H A D | varasm.c | 221 /* Return a hash value for section SECT. */ 1041 hash map from DECL to set of attributes. */ 2428 /* Hash of value. Computing the hash from value each time 2430 use of the hash table during hash table expansion. */ 2431 hashval_t hash; 2440 /* Compute a hash code for a constant expression. */ 2445 return ((struct constant_descriptor_tree *)ptr)->hash; 2456 /* Either set P and LEN to the address and len of something to hash and 2501 /* Don't hash th 2418 hashval_t hash; local 3019 hashval_t hash; local 3182 hashval_t hash; local [all...] |
/freebsd-10.2-release/contrib/one-true-awk/ |
H A D | proto.h | 103 extern int hash(const char *, int);
|
/freebsd-10.2-release/contrib/subversion/subversion/libsvn_ra/ |
H A D | wrapper_template.h | 490 apr_hash_t *hash) 509 apr_hash_set(hash, *schemes, APR_HASH_KEY_STRING, &compat_plugin); 488 COMPAT_INITFUNC(int abi_version, apr_pool_t *pool, apr_hash_t *hash) argument
|
/freebsd-10.2-release/sys/boot/ficl/ |
H A D | dict.c | 17 ** 29 jun 1998 (sadler) added variable sized hash table support 78 ** has been successfully defined (ie linked into a hash). It 252 pFW->hash = hashHashCode(si); 378 ** of cells capacity, and no hashing (hash size == 1). 439 ** Empty the dictionary, reset its hash table, and reset its search order. 440 ** Clears and (re-)creates the hash table with the size specified by nHash. 465 ** Calculate a figure of merit for the dictionary hash table based 471 ** The figure would be worse if the hash table used an open 518 /* Calc actual avg search depth for this hash */ 521 /* Calc best possible performance with this size hash */ [all...] |
/freebsd-10.2-release/usr.bin/mail/ |
H A D | cmd3.c | 416 h = hash(*ap); 464 h = hash(gname);
|
/freebsd-10.2-release/contrib/ofed/management/infiniband-diags/src/ |
H A D | ibtracert.c | 368 int hash = HASHGUID(new->nodeguid) % HTSZ; local 371 for (node = nodestbl[hash]; node; node = node->htnext) 377 new->htnext = nodestbl[hash]; 378 nodestbl[hash] = new;
|
/freebsd-10.2-release/contrib/ntp/lib/isc/ |
H A D | entropy.c | 71 * Number of bytes returned per hash. This must be true: 522 * Do this by stiring the pool and returning a part of hash as randomness. 523 * Note that no secrets are given away here since parts of the hash are 534 isc_sha1_t hash; local 609 isc_sha1_init(&hash); 610 isc_sha1_update(&hash, (void *)(ent->pool.pool), 612 isc_sha1_final(&hash, digest);
|
/freebsd-10.2-release/crypto/heimdal/lib/hx509/ |
H A D | ca.c | 1268 unsigned char hash[SHA_DIGEST_LENGTH]; local 1277 EVP_DigestFinal_ex(ctx, hash, NULL); 1281 si.data = hash; 1282 si.length = sizeof(hash);
|
/freebsd-10.2-release/crypto/openssl/crypto/conf/ |
H A D | conf.h | 120 void CONF_set_nconf(CONF *conf, LHASH_OF(CONF_VALUE) *hash);
|