/freebsd-10.2-release/contrib/subversion/subversion/libsvn_diff/ |
H A D | token.c | 37 * 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...] |
/freebsd-10.2-release/contrib/subversion/subversion/libsvn_subr/ |
H A D | hash.c | 2 * hash.c : dumping and reading hash tables to/from files. 53 * The format of a dumped hash table is: 92 /*** Dumping and loading hash files. */ 96 hash_read(apr_hash_t *hash, svn_stream_t *stream, const char *terminator, 115 /* Check for the end of the hash. */ 123 _("Serialized hash missing terminator")); 132 _("Serialized hash malformed")); 145 _("Serialized hash malformed")); 156 _("Serialized hash malforme 93 hash_read(apr_hash_t *hash, svn_stream_t *stream, const char *terminator, svn_boolean_t incremental, apr_pool_t *pool) argument 215 hash_write(apr_hash_t *hash, apr_hash_t *oldhash, svn_stream_t *stream, const char *terminator, apr_pool_t *pool) argument 285 svn_hash_read2(apr_hash_t *hash, svn_stream_t *stream, const char *terminator, apr_pool_t *pool) argument 292 svn_hash_read_incremental(apr_hash_t *hash, svn_stream_t *stream, const char *terminator, apr_pool_t *pool) argument 302 svn_hash_write2(apr_hash_t *hash, svn_stream_t *stream, const char *terminator, apr_pool_t *pool) argument 310 svn_hash_write_incremental(apr_hash_t *hash, apr_hash_t *oldhash, svn_stream_t *stream, const char *terminator, apr_pool_t *pool) argument 320 svn_hash_write(apr_hash_t *hash, apr_file_t *destfile, apr_pool_t *pool) argument 330 svn_hash_read(apr_hash_t *hash, apr_file_t *srcfile, apr_pool_t *pool) argument 490 svn_hash_keys(apr_array_header_t **array, apr_hash_t *hash, apr_pool_t *pool) argument 513 apr_hash_t *hash = svn_hash__make(pool); local 527 svn_hash__clear(apr_hash_t *hash) argument 546 svn_hash__get_cstring(apr_hash_t *hash, const char *key, const char *default_value) argument 561 svn_hash__get_bool(apr_hash_t *hash, const char *key, svn_boolean_t default_value) argument 597 unsigned int hash = 0; local [all...] |
/freebsd-10.2-release/contrib/libstdc++/include/tr1/ |
H A D | functional_hash.h | 45 // Definition of default hash function std::tr1::hash<>. The types for 46 // which std::tr1::hash<T> is defined is in clause 6.3.3. of the PDTR. 48 struct hash; 52 struct hash<_Tp> \ 77 struct hash<_Tp*> struct in namespace:std 86 // (used by the next specializations of std::tr1::hash<>) 93 hash(const char* __first, std::size_t __length) function in struct:std::_Fnv_hash 106 hash(const char* __first, std::size_t __length) function in struct:std::_Fnv_hash 122 hash(cons function in struct:std::_Fnv_hash 139 struct hash<std::string> struct in namespace:std 149 struct hash<std::wstring> struct in namespace:std 162 struct hash<float> struct in namespace:std 179 struct hash<double> struct in namespace:std 198 struct hash<long double> struct in namespace:std [all...] |
/freebsd-10.2-release/usr.sbin/IPXrouted/ |
H A D | af.c | 92 long hash; local 101 hash = 0; 102 hash = hash * IMVAL + *c++; 103 hash = hash * IMVAL + *c++; 104 hash = hash * IMVAL + *c++; 105 hash = hash * IMVA [all...] |
/freebsd-10.2-release/sys/kern/ |
H A D | vfs_hash.c | 38 static MALLOC_DEFINE(M_VFS_HASH, "vfs_hash", "VFS hash table"); 50 mtx_init(&vfs_hash_mtx, "vfs hash", NULL, MTX_DEF); 65 vfs_hash_bucket(const struct mount *mp, u_int hash) argument 68 return (&vfs_hash_tbl[(hash + mp->mnt_hashseed) & vfs_hash_mask]); 72 vfs_hash_get(const struct mount *mp, u_int hash, int flags, struct thread *td, struct vnode **vpp, vfs_hash_cmp_t *fn, void *arg) argument 79 LIST_FOREACH(vp, vfs_hash_bucket(mp, hash), v_hashlist) { 80 if (vp->v_hash != hash) 114 vfs_hash_insert(struct vnode *vp, u_int hash, int flags, struct thread *td, struct vnode **vpp, vfs_hash_cmp_t *fn, void *arg) argument 123 vfs_hash_bucket(vp->v_mount, hash), v_hashlist) { 124 if (vp2->v_hash != hash) 154 vfs_hash_rehash(struct vnode *vp, u_int hash) argument [all...] |
/freebsd-10.2-release/contrib/wpa/src/crypto/ |
H A D | sha1-tprf.c | 34 u8 hash[SHA1_MAC_LEN]; local 40 addr[0] = hash; 57 if (hmac_sha1_vector(key, key_len, 5, addr, len, hash)) 60 os_memcpy(&buf[pos], hash, SHA1_MAC_LEN); 63 os_memcpy(&buf[pos], hash, plen);
|
H A D | sha1-prf.c | 35 u8 hash[SHA1_MAC_LEN]; local 57 hash)) 59 os_memcpy(&buf[pos], hash, plen);
|
H A D | sha256-prf.c | 34 u8 hash[SHA256_MAC_LEN]; local 58 hmac_sha256_vector(key, key_len, 4, addr, len, hash); 59 os_memcpy(&buf[pos], hash, plen);
|
/freebsd-10.2-release/contrib/wpa/src/eap_common/ |
H A D | eap_peap_common.c | 21 u8 hash[SHA1_MAC_LEN]; local 27 addr[0] = hash; 72 if (hmac_sha1_vector(key, key_len, 5, addr, len, hash) < 0) 75 os_memcpy(&buf[pos], hash, SHA1_MAC_LEN); 78 os_memcpy(&buf[pos], hash, plen);
|
/freebsd-10.2-release/contrib/binutils/opcodes/ |
H A D | cgen-dis.c | 54 /* Add an instruction to the hash chain. */ 59 unsigned int hash) 70 for (current_buf = htable[hash]; current_buf != NULL; 83 htable[hash] = hentbuf; 88 /* Subroutine of build_dis_hash_table to add INSNS to the hash table. 93 HTABLE points to the hash table. 94 HENTBUF is a pointer to sufficiently large buffer of hash entries. 113 unsigned int hash; local 122 to hash on, so set both up. */ 129 hash 56 add_insn_to_hash_chain(CGEN_INSN_LIST *hentbuf, const CGEN_INSN *insn, CGEN_INSN_LIST **htable, unsigned int hash) argument 151 unsigned int hash; local 233 unsigned int hash; local [all...] |
/freebsd-10.2-release/contrib/libstdc++/include/ext/pb_ds/detail/gp_hash_table_map_/ |
H A D | resize_no_store_hash_fn_imps.hpp | 45 * hash value is not stored. 55 size_type hash = ranged_probe_fn_base::operator()(r_key); local 59 const size_type pos = ranged_probe_fn_base::operator()(r_key, hash, i);
|
/freebsd-10.2-release/sbin/hastd/ |
H A D | hast_checksum.c | 53 unsigned char *hash, size_t *hsizep) 59 bcopy(&crc, hash, sizeof(crc)); 66 unsigned char *hash, size_t *hsizep) 72 SHA256_Final(hash, &ctx); 96 unsigned char hash[MAX_HASH_SIZE]; local 103 hast_crc32_checksum(*datap, *sizep, hash, &hsize); 107 hast_sha256_checksum(*datap, *sizep, hash, &hsize); 114 nv_add_uint8_array(nv, hash, hsize, "hash"); 134 rhash = nv_get_uint8_array(nv, &rhsize, "hash"); 52 hast_crc32_checksum(const unsigned char *data, size_t size, unsigned char *hash, size_t *hsizep) argument 65 hast_sha256_checksum(const unsigned char *data, size_t size, unsigned char *hash, size_t *hsizep) argument [all...] |
/freebsd-10.2-release/contrib/mtree/ |
H A D | only.c | 58 uint32_t hash; member in struct:hentry 70 uint32_t hash = 0; local 72 hash = hash * 33 + c; /* "perl": k=33, r=r+r/32 */ 73 return hash + (hash >> 5); 83 if (e->hash == *h && strcmp(e->str, str) == 0) 97 e->hash = h;
|
/freebsd-10.2-release/crypto/openssl/crypto/lhash/ |
H A D | lhash.c | 60 * Code for dynamic hash table routines 127 ret->hash = ((h == NULL) ? (LHASH_HASH_FN_TYPE)lh_strhash : h); 180 unsigned long hash; local 188 rn = getrn(lh, data, &hash); 198 nn->hash = hash; 215 unsigned long hash; local 220 rn = getrn(lh, data, &hash); 243 unsigned long hash; local 248 rn = getrn(lh, data, &hash); 307 unsigned long hash, nni; local 393 unsigned long hash, nn; local [all...] |
/freebsd-10.2-release/crypto/openssl/engines/ccgost/ |
H A D | gostsum.c | 20 int get_line(FILE *f, char *hash, char *filename); 99 "%s: GOST hash sum check failed for '%s'\n", 107 "%s: %d of %d file(f) failed GOST hash sum check\n", 166 int get_line(FILE *f, char *hash, char *filename) argument 169 if (fread(hash, 1, 64, f) < 64) 171 hash[64] = 0; 173 if (hash[i] < '0' || (hash[i] > '9' && hash[i] < 'A') 174 || (hash[ [all...] |
/freebsd-10.2-release/contrib/xz/src/liblzma/lz/ |
H A D | lz_encoder_mf.c | 84 /// Hash value to indicate unused element in the hash. Since we start the 95 /// \brief Normalizes hash values 97 /// The hash arrays store positions of match candidates. The positions are 102 /// the hash. 104 /// To prevent integer overflows of the offsets stored in the hash arrays, 120 uint32_t *hash = mf->hash; local 124 // we can simply mark the hash element as empty. 128 // in mf->son. Since we go through both mf->hash and 133 if (hash[ [all...] |
/freebsd-10.2-release/sys/dev/drm2/ttm/ |
H A D | ttm_object.c | 47 * ref_hash hash tables. 75 * @object_lock: lock that protects the object_hash hash table. 77 * @object_hash: hash table for fast lookup of object global names. 94 * @hash: Hash entry for the per-file object reference hash. 104 * This is similar to an idr object, but it also has a hash table entry 113 struct drm_hash_item hash; member in struct:ttm_ref_object 167 &base->hash, 182 (void)drm_ht_remove_item(&tdev->object_hash, &base->hash); 192 (void)drm_ht_remove_item(&tdev->object_hash, &base->hash); 230 struct drm_hash_item *hash; local 263 struct drm_hash_item *hash; local 346 struct drm_hash_item *hash; local [all...] |
/freebsd-10.2-release/contrib/gdb/gdb/ |
H A D | bcache.h | 59 there's another problem. A bcache stores all its strings in a hash 61 its hash value. This means that the modified string is now in the 62 wrong place in the hash table, and future bcache probes will never 73 Assuming a 32-bit system (the hash table slots are 4 bytes), 77 bcache: This uses a separate linked list to track the hash chain. 78 The numbers show roughly 100% occupancy of the hash table and an 84 hashtab: This uses a more traditional re-hash algorithm where the 85 chain is maintained within the hash table. The table occupancy is 111 Speed of bcache VS hashtab (the half hash hack): 116 hash [all...] |
/freebsd-10.2-release/contrib/libstdc++/include/ext/pb_ds/detail/hash_fn/ |
H A D | sample_ranged_probe_fn.hpp | 79 operator()(const_key_reference r_key, size_t hash, size_type i) const;
|
/freebsd-10.2-release/contrib/netbsd-tests/usr.bin/nbperf/ |
H A D | hash_driver.c | 37 #include "hash.c" 49 printf("%" PRId32 "\n", hash(line, len));
|
/freebsd-10.2-release/contrib/unbound/util/storage/ |
H A D | slabhash.h | 39 * Hash table that consists of smaller hash tables. 64 /** lookup array of hash tables */ 69 * Create new slabbed hash table. 70 * @param numtables: number of hash tables to use, other parameters used to 80 * @return: new hash table or NULL on malloc failure. 88 * Delete hash table. Entries are all deleted. 94 * Clear hash table. Entries are all deleted. 103 * @param table: hash table. 104 * @param hash: hash valu [all...] |
/freebsd-10.2-release/lib/libcrypt/ |
H A D | crypt-nthash.c | 59 u_char hash[MD4_SIZE]; local 72 MD4Final(hash, &ctx); 75 final[j++] = hexconvtab[hash[i] >> 4]; 76 final[j++] = hexconvtab[hash[i] & 15];
|
/freebsd-10.2-release/sbin/dhclient/ |
H A D | tree.h | 57 struct hash_table *hash; member in struct:universe
|
/freebsd-10.2-release/cddl/contrib/opensolaris/tools/ctf/cvt/ |
H A D | hash.h | 33 * Routines for manipulating hash tables 40 typedef struct hash hash_t;
|
/freebsd-10.2-release/contrib/groff/src/libs/libbib/ |
H A D | common.cpp | 20 unsigned hash(const char *s, int len) function
|