/freebsd-11-stable/sys/libkern/ |
H A D | murmur3_32.c | 29 #include <sys/hash.h> 37 * Simple implementation of the Murmur3-32 hash function. 48 uint32_t hash, k; local 54 hash = seed; 65 hash ^= k; 66 hash = rol32(hash, 13); 67 hash *= 5; 68 hash += 0xe6546b64; 85 hash 108 uint32_t hash, k; local [all...] |
/freebsd-11-stable/contrib/bmake/unit-tests/ |
H A D | hash.mk | 11 @echo ${STR1:hash} 12 @echo ${STR2:hash} 13 @echo ${STR3:hash} 14 @echo ${STR4:hash} 15 @echo ${STR5:hash} 16 @echo ${STR6:hash} 17 @echo ${STR7:hash} 18 @echo ${STR8:hash}
|
/freebsd-11-stable/sys/sys/ |
H A D | hash.h | 25 * $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-11-stable/lib/libc/iconv/ |
H A D | citrus_db_hash.c | 47 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-11-stable/contrib/netbsd-tests/lib/libcrypt/ |
H A D | t_crypt.c | 73 const char *hash; member in struct:__anon4718 126 for (size_t i = 0; tests[i].hash; i++) { 127 char *hash = crypt(tests[i].pw, tests[i].hash); local 134 if (!hash) { 138 if (strcmp(hash, "*0") == 0 && strlen(tests[i].hash) < 13) 140 if (strcmp(hash, tests[i].hash)) 142 i, hash, test [all...] |
/freebsd-11-stable/usr.sbin/pw/tests/ |
H A D | crypt.c | 35 char *salt, *pass, *hash; local 42 hash = crypt(pass, salt); 43 printf("%s", hash); 44 return (hash == NULL ? 1 : 0);
|
/freebsd-11-stable/contrib/elftoolchain/libelftc/ |
H A D | libelftc_hash.c | 28 * An implementation of the Fowler-Noll-Vo hash function. 45 * hash function. 62 unsigned int hash; local 64 for (hash = FNV_OFFSET; (c = *s) != '\0'; s++) { 65 hash ^= c; 66 hash *= FNV_PRIME; 69 return (hash);
|
/freebsd-11-stable/usr.bin/grep/regex/ |
H A D | hashtable.c | 42 * Return a 32-bit hash of the given buffer. The init 43 * value should be 0, or the previous hash value to extend 44 * the previous hash. 47 hash32_buf(const void *buf, size_t len, uint32_t hash) argument 52 hash = HASHSTEP(hash, *p++); 54 return hash; 58 * Initializes a hash table that can hold table_size number of entries, 60 * bytes. On successful allocation returns a pointer to the hash table. 97 * HASH_OK: if the key was not present in the hash tabl 109 uint32_t hash = 0; local 183 uint32_t hash = 0; local [all...] |
/freebsd-11-stable/cddl/contrib/opensolaris/tools/ctf/cvt/ |
H A D | hash.c | 30 * 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-11-stable/contrib/libstdc++/include/ext/ |
H A D | hash_fun.h | 1 // '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-11-stable/contrib/subversion/subversion/libsvn_ra/ |
H A D | deprecated.h | 43 apr_hash_t *hash); 49 apr_hash_t *hash); 55 apr_hash_t *hash);
|
/freebsd-11-stable/contrib/wpa/src/eap_common/ |
H A D | eap_psk_common.c | 37 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...] |
/freebsd-11-stable/contrib/apr-util/test/ |
H A D | testpass.c | 46 const char *hash; member in struct:__anon161 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:__anon162 182 char hash[100]; local [all...] |
/freebsd-11-stable/sys/netinet6/ |
H A D | in6_pcbgroup.c | 51 * Given a hash of whatever the covered tuple might be, return a pcbgroup 56 in6_pcbgroup_getbucket(struct inpcbinfo *pcbinfo, uint32_t hash) argument 60 return (rss_getbucket(hash)); 62 return (hash % pcbinfo->ipi_npcbgroups); 67 * Map a (hashtype, hash) tuple into a connection group, or NULL if the hash 69 * a TCP packet turnsup with a 2-tuple hash, or if an RSS hash is present but 73 in6_pcbgroup_byhash(struct inpcbinfo *pcbinfo, u_int hashtype, uint32_t hash) argument 84 in6_pcbgroup_getbucket(pcbinfo, hash)]); 101 uint32_t hash; local [all...] |
/freebsd-11-stable/contrib/libstdc++/include/backward/ |
H A D | hashtable.h | 69 using __gnu_cxx::hash;
|
H A D | hash_map.h | 63 using __gnu_cxx::hash;
|
H A D | hash_set.h | 63 using __gnu_cxx::hash;
|
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/hash_fn/ |
H A D | direct_mask_range_hashing_imp.hpp | 62 operator()(size_type hash) const 63 { return mask_based_base::range_hash(hash); }
|
H A D | direct_mod_range_hashing_imp.hpp | 62 operator()(size_type hash) const 63 { return mod_based_base::range_hash(hash); }
|
H A D | mod_based_range_hashing.hpp | 77 range_hash(size_type hash) const; 102 range_hash(size_type hash) const 104 return (hash % m_size);
|
H A D | sample_range_hashing.hpp | 77 // Transforms the __hash value hash into a ranged-hash value. 79 operator()(size_type hash) const;
|
/freebsd-11-stable/contrib/wpa/src/crypto/ |
H A D | sha1-prf.c | 35 u8 hash[SHA1_MAC_LEN]; local 57 hash)) 59 os_memcpy(&buf[pos], hash, plen); 64 forced_memzero(hash, sizeof(hash));
|
/freebsd-11-stable/contrib/apr-util/crypto/ |
H A D | apr_passwd.c | 83 const char *hash) 89 if (hash[0] == '$' 90 && hash[1] == '2' 91 && (hash[2] == 'a' || hash[2] == 'y') 92 && hash[3] == '$') { 93 if (_crypt_blowfish_rn(passwd, hash, sample, sizeof(sample)) == NULL) 96 else if (!strncmp(hash, apr1_id, strlen(apr1_id))) { 98 * The hash was created using our custom algorithm. 100 apr_md5_encode(passwd, hash, sampl [all...] |
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/ |
H A D | resize_store_hash_fn_imps.hpp | 45 * 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-11-stable/lib/libc/stdlib/ |
H A D | hsearch_r.c | 39 * Look up an unused entry in the hash table for a given hash. For this 44 hsearch_lookup_free(struct __hsearch *hsearch, size_t hash) argument 48 for (index = hash, i = 0;; index += ++i) { 56 * Computes an FNV-1a hash of the key. Depending on the pointer size, this 62 size_t hash; local 64 hash = offset_basis; 66 hash ^= (uint8_t)*str++; 68 hash *= UINT32_C(16777619); 70 hash * 80 size_t hash, index, i, old_hash, old_count, new_count; local [all...] |