Searched refs:hash (Results 1 - 25 of 645) sorted by relevance

1234567891011>>

/freebsd-10.1-release/sys/sys/
H A Dhash.h25 * $OpenBSD: hash.h,v 1.4 2004/05/25 18:37:23 jmc Exp $
40 * Return a 32-bit hash of the given buffer. The init
41 * value should be 0, or the previous hash value to extend
42 * the previous hash.
45 hash32_buf(const void *buf, size_t len, uint32_t hash) argument
50 hash = HASHSTEP(hash, *p++);
52 return hash;
56 * Return a 32-bit hash of the given string.
59 hash32_str(const void *buf, uint32_t hash) argument
73 hash32_strn(const void *buf, size_t len, uint32_t hash) argument
89 hash32_stre(const void *buf, int end, const char **ep, uint32_t hash) argument
108 hash32_strne(const void *buf, size_t len, int end, const char **ep, uint32_t hash) argument
[all...]
/freebsd-10.1-release/lib/libc/iconv/
H A Dcitrus_db_hash.c47 uint32_t hash, tmp; local
50 hash = 0;
54 hash <<= 4;
55 hash += _bcs_tolower(*p);
56 tmp = hash & 0xF0000000;
58 hash ^= tmp;
59 hash ^= tmp >> 24;
63 return (hash);
/freebsd-10.1-release/usr.bin/grep/regex/
H A Dhashtable.c40 * Return a 32-bit hash of the given buffer. The init
41 * value should be 0, or the previous hash value to extend
42 * the previous hash.
45 hash32_buf(const void *buf, size_t len, uint32_t hash) argument
50 hash = HASHSTEP(hash, *p++);
52 return hash;
56 * Initializes a hash table that can hold table_size number of entries,
58 * bytes. On successful allocation returns a pointer to the hash table.
95 * HASH_OK: if the key was not present in the hash tabl
107 uint32_t hash = 0; local
181 uint32_t hash = 0; local
[all...]
/freebsd-10.1-release/cddl/contrib/opensolaris/tools/ctf/cvt/
H A Dhash.c30 * Routines for manipulating hash tables
39 #include "hash.h"
43 struct hash { struct
95 hash_t *hash; local
97 hash = xmalloc(sizeof (hash_t));
98 hash->h_buckets = xcalloc(sizeof (list_t *) * nbuckets);
99 hash->h_nbuckets = nbuckets;
100 hash->h_hashfn = hashfn ? hashfn : hash_def_hash;
101 hash->h_cmp = cmp ? cmp : hash_def_cmp;
103 return (hash);
107 hash_add(hash_t *hash, void *key) argument
130 hash_t *hash = arg; local
135 hash_remove(hash_t *hash, void *key) argument
144 hash_match(hash_t *hash, void *key, int (*fun)(void *, void *), void *private) argument
169 hash_find_iter(hash_t *hash, void *key, int (*fun)(void *, void *), void *private) argument
198 hash_find(hash_t *hash, void *key, void **value) argument
215 hash_iter(hash_t *hash, int (*fun)(void *, void *), void *private) argument
234 hash_count(hash_t *hash) argument
245 hash_free(hash_t *hash, void (*datafree)(void *, void *), void *private) argument
259 hash_stats(hash_t *hash, int verbose) argument
[all...]
/freebsd-10.1-release/contrib/libstdc++/include/ext/
H A Dhash_fun.h1 // 'struct hash' from SGI -*- C++ -*-
71 struct hash { }; struct
83 struct hash<char*> struct
91 struct hash<const char*> struct
99 struct hash<char> struct
107 struct hash<unsigned char> struct
115 struct hash<signed char> struct
123 struct hash<short> struct
131 struct hash<unsigned short> struct
139 struct hash<in struct
147 struct hash<unsigned int> struct
155 struct hash<long> struct
163 struct hash<unsigned long> struct
[all...]
/freebsd-10.1-release/contrib/subversion/subversion/libsvn_ra/
H A Ddeprecated.h43 apr_hash_t *hash);
49 apr_hash_t *hash);
55 apr_hash_t *hash);
/freebsd-10.1-release/contrib/wpa/src/eap_common/
H A Deap_psk_common.c37 u8 hash[aes_block_size]; local
41 if (aes_128_encrypt_block(kdk, rand_p, hash))
44 hash[aes_block_size - 1] ^= counter;
45 if (aes_128_encrypt_block(kdk, hash, tek))
47 hash[aes_block_size - 1] ^= counter;
51 hash[aes_block_size - 1] ^= counter;
52 if (aes_128_encrypt_block(kdk, hash, &msk[i * aes_block_size]))
54 hash[aes_block_size - 1] ^= counter;
59 hash[aes_block_size - 1] ^= counter;
60 if (aes_128_encrypt_block(kdk, hash,
[all...]
H A Deap_pwd_common.c26 void eap_pwd_h_update(struct crypto_hash *hash, const u8 *data, size_t len) argument
28 crypto_hash_update(hash, data, len);
32 void eap_pwd_h_final(struct crypto_hash *hash, u8 *digest) argument
35 crypto_hash_finish(hash, digest, &len);
43 struct crypto_hash *hash; local
54 hash = crypto_hash_init(CRYPTO_HASH_ALG_HMAC_SHA256,
56 if (hash == NULL)
59 crypto_hash_update(hash, digest, SHA256_MAC_LEN);
60 crypto_hash_update(hash, (u8 *) &i, sizeof(u16));
61 crypto_hash_update(hash, labe
94 struct crypto_hash *hash; local
289 struct crypto_hash *hash; local
[all...]
/freebsd-10.1-release/contrib/apr-util/crypto/
H A Dapr_passwd.c77 const char *hash)
83 if (hash[0] == '$'
84 && hash[1] == '2'
85 && (hash[2] == 'a' || hash[2] == 'y')
86 && hash[3] == '$') {
87 if (_crypt_blowfish_rn(passwd, hash, sample, sizeof(sample)) == NULL)
90 else if (!strncmp(hash, apr1_id, strlen(apr1_id))) {
92 * The hash was created using our custom algorithm.
94 apr_md5_encode(passwd, hash, sampl
[all...]
/freebsd-10.1-release/contrib/apr-util/test/
H A Dtestpass.c46 const char *hash; member in struct:__anon169
80 passwords[i].hash));
126 char hash[100]; local
128 apr_sha1_base64(pass, strlen(pass), hash);
131 apr_password_validate(pass, hash));
133 apr_password_validate(pass2, hash));
140 char hash[100]; local
142 apr_md5_encode(pass, salt, hash, sizeof hash);
145 apr_password_validate(pass, hash));
154 const char *hash; member in struct:__anon170
182 char hash[100]; local
[all...]
/freebsd-10.1-release/contrib/libstdc++/include/backward/
H A Dhashtable.h69 using __gnu_cxx::hash;
H A Dhash_map.h63 using __gnu_cxx::hash;
H A Dhash_set.h63 using __gnu_cxx::hash;
/freebsd-10.1-release/contrib/libstdc++/include/ext/pb_ds/detail/hash_fn/
H A Ddirect_mask_range_hashing_imp.hpp62 operator()(size_type hash) const
63 { return mask_based_base::range_hash(hash); }
H A Ddirect_mod_range_hashing_imp.hpp62 operator()(size_type hash) const
63 { return mod_based_base::range_hash(hash); }
H A Dmod_based_range_hashing.hpp77 range_hash(size_type hash) const;
102 range_hash(size_type hash) const
104 return (hash % m_size);
H A Dsample_range_hashing.hpp77 // Transforms the __hash value hash into a ranged-hash value.
79 operator()(size_type hash) const;
/freebsd-10.1-release/contrib/subversion/subversion/include/
H A Dsvn_hash.h24 * @brief Dumping and reading hash tables to/from files.
65 * The conventional terminator for hash dumps.
72 * Read a hash table from @a stream, storing the resultants names and
73 * values in @a hash. Use a @a pool for all allocations. @a hash will
75 * If @a terminator is NULL, expect the hash to be terminated by the
76 * end of the stream; otherwise, expect the hash to be terminated by a
83 svn_hash_read2(apr_hash_t *hash,
89 * Dump @a hash to @a stream. Use @a pool for all allocations. @a
90 * hash ha
[all...]
/freebsd-10.1-release/sys/netinet6/
H A Din6_pcbgroup.c46 * Given a hash of whatever the covered tuple might be, return a pcbgroup
50 in6_pcbgroup_getbucket(struct inpcbinfo *pcbinfo, uint32_t hash) argument
53 return (hash % pcbinfo->ipi_npcbgroups);
57 * Map a (hashtype, hash) tuple into a connection group, or NULL if the hash
61 in6_pcbgroup_byhash(struct inpcbinfo *pcbinfo, u_int hashtype, uint32_t hash) argument
79 uint32_t hash; local
83 hash = faddrp->s6_addr32[3] ^ fport;
87 hash = faddrp->s6_addr32[3] ^ laddrp->s6_addr32[3];
91 hash
[all...]
/freebsd-10.1-release/contrib/libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/
H A Dresize_store_hash_fn_imps.hpp45 * hash value is stored.
55 size_type hash = ranged_probe_fn_base::operator()(r_key, p_e->m_hash); local
60 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
66 p_new_e->m_hash = hash;
/freebsd-10.1-release/contrib/gperf/lib/
H A Dhash.cc6 #include <hash.h>
9 Some useful hash function.
10 It's not a particularly good hash function (<< 5 would be better than << 4),
/freebsd-10.1-release/contrib/groff/src/include/
H A Dindex.h42 unsigned hash(const char *s, int len);
/freebsd-10.1-release/sys/dev/drm/
H A Ddrm_auth.c52 int hash = drm_hash_magic(magic); local
56 for (pt = dev->magiclist[hash].head; pt; pt = pt->next) {
66 * Inserts the given magic number into the hash table of used magic number
72 int hash; local
79 hash = drm_hash_magic(magic);
87 if (dev->magiclist[hash].tail) {
88 dev->magiclist[hash].tail->next = entry;
89 dev->magiclist[hash].tail = entry;
91 dev->magiclist[hash].head = entry;
92 dev->magiclist[hash]
106 int hash; local
[all...]
/freebsd-10.1-release/sys/dev/drm2/
H A Ddrm_auth.c52 int hash = drm_hash_magic(magic); local
56 for (pt = dev->magiclist[hash].head; pt; pt = pt->next) {
66 * Inserts the given magic number into the hash table of used magic number
72 int hash; local
79 hash = drm_hash_magic(magic);
87 if (dev->magiclist[hash].tail) {
88 dev->magiclist[hash].tail->next = entry;
89 dev->magiclist[hash].tail = entry;
91 dev->magiclist[hash].head = entry;
92 dev->magiclist[hash]
106 int hash; local
[all...]
/freebsd-10.1-release/contrib/subversion/subversion/libsvn_diff/
H A Dtoken.c37 * Prime number to use as the size of the hash table. This number was
48 apr_uint32_t hash; member in struct:svn_diff__node_t
87 apr_uint32_t hash, void *token)
97 node_ref = &tree->root[hash % SVN_DIFF__HASH_SIZE];
103 rv = hash - parent->hash;
135 new_node->hash = hash;
164 apr_uint32_t hash; local
170 hash
84 tree_insert_token(svn_diff__node_t **node, svn_diff__tree_t *tree, void *diff_baton, const svn_diff_fns2_t *vtable, apr_uint32_t hash, void *token) argument
[all...]

Completed in 133 milliseconds

1234567891011>>