Searched refs:hash (Results 226 - 250 of 630) sorted by relevance

1234567891011>>

/freebsd-10.2-release/crypto/openssh/
H A Dumac.c294 /* The NH-based hash functions used in UMAC are described in the UMAC paper
298 * in a single buffer and returns the hash result immediately. The second
302 * hash, the client calls nh_final() which calculates the hash output.
303 * Before beginning another hash calculation the nh_reset() routine
308 * responsability to pass no more than L1_KEY_LEN bytes per hash result.
320 #define STREAMS (UMAC_OUTPUT_LEN / 4) /* Number of times hash is applied */
339 /* NH hashing primitive. Previous (partial) hash result is loaded and
375 * reading and writing 16 bytes of hash-state per call.
422 * reading and writing 24 bytes of hash
783 nh_ctx hash; /* Hash context for L1 NH hash */ member in struct:uhash_ctx
1190 uhash_ctx hash; /* Hash function for message compression */ member in struct:umac_ctx
[all...]
/freebsd-10.2-release/contrib/libgnuregex/
H A Dregex_internal.c26 unsigned int hash) internal_function;
30 unsigned int hash) internal_function;
1462 unsigned int hash = nodes->nelem + context;
1465 hash += nodes->elems[i];
1466 return hash;
1483 unsigned int hash;
1492 hash = calc_state_hash (nodes, 0);
1493 spot = dfa->state_table + (hash & dfa->state_hash_mask);
1498 if (hash != state->hash)
1459 unsigned int hash = nodes->nelem + context; local
1480 unsigned int hash; local
1524 unsigned int hash; local
1558 register_state(const re_dfa_t *dfa, re_dfastate_t *newstate, unsigned int hash) argument
1613 create_ci_newstate(const re_dfa_t *dfa, const re_node_set *nodes, unsigned int hash) argument
1663 create_cd_newstate(const re_dfa_t *dfa, const re_node_set *nodes, unsigned int context, unsigned int hash) argument
[all...]
/freebsd-10.2-release/contrib/gcc/
H A Dpostreload-gcse.c63 1. Build available expressions hash table:
66 the hash table.
91 /* We need to keep a hash table of expressions. The table entries are of
98 /* Expression elements in the hash table. */
104 /* The same hash for this entry. */ member in struct:expr
105 hashval_t hash;
144 This array is used during the building of the hash table (step 1) to
178 /* Support for hash table construction and transformations. */
239 /* Allocate the available expressions hash table. We don't want to
240 make the hash tabl
326 hashval_t hash; local
406 hashval_t hash = hash_expr (pat, &do_not_record_p); local
[all...]
/freebsd-10.2-release/contrib/subversion/subversion/libsvn_ra/
H A Ddeprecated.c491 apr_hash_t *hash)
493 return svn_error_trace(svn_ra_local_init(abi_version, pool, hash));
499 apr_hash_t *hash)
501 return svn_error_trace(svn_ra_svn_init(abi_version, pool, hash));
507 apr_hash_t *hash)
509 return svn_error_trace(svn_ra_serf_init(abi_version, pool, hash));
488 svn_ra_local__deprecated_init(int abi_version, apr_pool_t *pool, apr_hash_t *hash) argument
496 svn_ra_svn__deprecated_init(int abi_version, apr_pool_t *pool, apr_hash_t *hash) argument
504 svn_ra_serf__deprecated_init(int abi_version, apr_pool_t *pool, apr_hash_t *hash) argument
/freebsd-10.2-release/contrib/wpa/src/crypto/
H A Dms_funcs.c84 u8 hash[SHA1_MAC_LEN]; local
95 if (sha1_vector(3, addr, len, hash))
97 os_memcpy(challenge, hash, 8);
335 u8 hash[SHA1_MAC_LEN]; local
341 if (sha1_vector(3, addr, len, hash))
343 os_memcpy(master_key, hash, 16);
/freebsd-10.2-release/contrib/wpa/src/wps/
H A Dwps_attr_build.c135 u8 hash[SHA256_MAC_LEN]; local
152 hmac_sha256_vector(wps->authkey, WPS_AUTHKEY_LEN, 2, addr, len, hash);
157 wpabuf_put_data(msg, hash, WPS_AUTHENTICATOR_LEN);
308 u8 hash[SHA256_MAC_LEN]; local
312 wpabuf_len(msg), hash);
316 wpabuf_put_data(msg, hash, WPS_KWA_LEN);
/freebsd-10.2-release/sys/geom/mirror/
H A Dg_mirror.h258 u_char md_hash[16]; /* MD5 hash. */
448 char hash[16 * 2 + 1]; local
491 bzero(hash, sizeof(hash));
493 hash[i * 2] = hex[md->md_hash[i] >> 4];
494 hash[i * 2 + 1] = hex[md->md_hash[i] & 0x0f];
496 printf(" MD5 hash: %s\n", hash);
/freebsd-10.2-release/sys/geom/raid3/
H A Dg_raid3.h285 u_char md_hash[16]; /* MD5 hash. */
427 char hash[16 * 2 + 1]; local
469 bzero(hash, sizeof(hash));
471 hash[i * 2] = hex[md->md_hash[i] >> 4];
472 hash[i * 2 + 1] = hex[md->md_hash[i] & 0x0f];
474 printf(" MD5 hash: %s\n", hash);
/freebsd-10.2-release/contrib/llvm/include/llvm/ADT/
H A DFoldingSet.h10 // This file defines a hash set that can be used to remove duplication of nodes
34 /// This class is implemented as a single-link chained hash table, where the
106 /// structure is an array of buckets. Each bucket is indexed by the hash of
185 /// GrowHashTable - Double the size of the hash table and rehash everything.
199 /// this function to compute a hash value for the given node.
225 // ComputeHash - Compute a hash value for X, using TempID to
227 // just calls Profile and does a regular hash computation.
275 /// ComputeHash - Compute a strong hash value for this FoldingSetNodeIDRef,
292 /// hash value for the node.
325 /// ComputeHash - Compute a strong hash valu
427 bucket_begin(unsigned hash) argument
431 bucket_end(unsigned hash) argument
507 bucket_begin(unsigned hash) argument
511 bucket_end(unsigned hash) argument
[all...]
/freebsd-10.2-release/contrib/subversion/subversion/include/
H A Dsvn_props.h59 * value in a hash. So instead, we use these structures.
102 /** A hash of (<tt>const char *</tt>) inherited property names, and
110 * Given a hash (keys <tt>const char *</tt> and values <tt>const
117 svn_prop_hash_to_array(const apr_hash_t *hash,
121 * Given an array of svn_prop_t items, return a hash mapping const char *
134 * Creates a deep copy of @a hash (keys <tt>const char *</tt> and
140 svn_prop_hash_dup(const apr_hash_t *hash,
H A Dsvn_config.h205 * into the hash @a *cfg_hash. If @a config_dir is not NULL it specifies a
209 * configurations (again from file or registry). The hash and all its data
212 * @a *cfg_hash is a hash whose keys are @c const char * configuration
666 /** A hash-key pointing to a realmstring. Every file containing
672 * ~/.subversion/auth/ area. If the file exists, initialize @a *hash
673 * and load the file contents into the hash, using @a pool. If the
674 * file doesn't exist, set @a *hash to NULL.
679 * Besides containing the original credential fields, the hash will
687 svn_config_read_auth_data(apr_hash_t **hash,
694 * within the ~/.subversion/auth/ area. Write the contents of @a hash int
[all...]
/freebsd-10.2-release/contrib/gcc/cp/
H A Dcp-objcp-common.c248 h->hash = htab_hash_pointer (from);
251 loc = htab_find_slot_with_hash (shadowed_var_for_decl, h, h->hash, INSERT);
/freebsd-10.2-release/sys/mips/nlm/dev/net/ucore/
H A Ducore.h336 * hash - if 1, use hash based destination
339 nlm_ucore_setup_poepktdistr(int pdm, int mc3, int pdl, int dest, int hash) argument
343 val |= ((hash & 0x1) << 20);
/freebsd-10.2-release/contrib/llvm/tools/lldb/include/lldb/Breakpoint/
H A DBreakpointOptions.h186 const char *GetConditionText (size_t *hash = NULL) const;
353 size_t m_condition_text_hash; // Its hash, so that locations know when the condition is updated.
/freebsd-10.2-release/lib/libc/db/test/hash.tests/
H A Dtdel.c43 __FBSDID("$FreeBSD: releng/10.2/lib/libc/db/test/hash.tests/tdel.c 165903 2007-01-09 00:28:16Z imp $");
69 ctl.hash = NULL;
77 fprintf(stderr, "cannot create: hash table size %d)\n",
H A Dthash4.c43 __FBSDID("$FreeBSD: releng/10.2/lib/libc/db/test/hash.tests/thash4.c 165903 2007-01-09 00:28:16Z imp $");
71 ctl.hash = NULL;
79 fprintf(stderr, "cannot create: hash table size %d)\n",
/freebsd-10.2-release/libexec/rtld-elf/amd64/
H A Delf_rtld.x13 .hash : { *(.hash) }
/freebsd-10.2-release/libexec/rtld-elf/i386/
H A Delf_rtld.x13 .hash : { *(.hash) }
/freebsd-10.2-release/contrib/apr/include/
H A Dapr_hash.h43 * is not included in the hash value (why throw a constant in?).
44 * Since the hash table merely references the provided key (rather
50 * Abstract type for hash tables.
55 * Abstract type for scanning hash tables.
60 * Callback functions for calculating hash values.
68 * The default hash function.
74 * Create a hash table.
75 * @param pool The pool to allocate the hash table out of
76 * @return The hash table just created
81 * Create a hash tabl
274 APR_POOL_DECLARE_ACCESSOR(hash); variable
[all...]
/freebsd-10.2-release/contrib/apr/random/unix/
H A Dapr_random.c51 #define hash(h,r,b,n) hash_init(h),hash_add(h,b,n),hash_finish(h,r) macro
251 hash(g->pool_hash,p->pool+r,p->pool+r*2,g->pool_hash->size*2);
265 hash(g->prng_hash,g->H,g->H,H_size(g));
266 hash(g->prng_hash,random,g->H,B_size(g));
/freebsd-10.2-release/contrib/binutils/bfd/
H A Dcoff-aux.c89 h = bfd_link_hash_lookup (info->hash, name, TRUE, copy, FALSE);
/freebsd-10.2-release/sys/geom/
H A Dgeom_sunlabel.c265 u_char *buf, hash[16]; local
296 error = g_getattr("SUN::labelsum", cp, &hash);
297 if (!error && !bcmp(ms->labelsum, hash, sizeof(hash))) {
/freebsd-10.2-release/contrib/gdb/gdb/
H A Dbcache.c45 /* The half hash hack. This contains the upper 16 bits of the hash
69 /* How many hash buckets we're using. */
82 /* Number of times that the hash table is expanded and hence
89 /* Number of times that the half-hash compare hit (compare the upper
90 16 bits of hash values) hit, but the corresponding combined
95 /* The old hash function was stolen from SDBM. This is what DB 3.0 uses now,
101 hash(const void *addr, int length)
117 /* Growing the bcache's hash table. */
120 resize our hash tabl
100 hash(const void *addr, int length) function
[all...]
/freebsd-10.2-release/crypto/openssl/ssl/
H A Ds3_enc.c391 const EVP_MD *hash; local
399 if (!ssl_cipher_get_evp(s->session, &c, &hash, NULL, NULL, &comp)) {
405 s->s3->tmp.new_hash = hash;
412 num = EVP_MD_size(hash);
701 const EVP_MD_CTX *hash; local
711 hash = ssl->write_hash;
716 hash = ssl->read_hash;
719 t = EVP_MD_CTX_size(hash);
733 ssl3_cbc_record_digest_supported(hash)) {
744 * With SHA-1 (the largest hash spece
[all...]
/freebsd-10.2-release/sbin/dhclient/
H A Dtables.c434 dhcp_universe.hash = new_hash();
435 if (!dhcp_universe.hash)
436 error("Can't allocate dhcp option hash table.");
439 add_hash(dhcp_universe.hash,

Completed in 165 milliseconds

1234567891011>>