/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/zebra/lib/ |
H A D | hash.h | 24 /* Default hash table size. */ 39 struct hash struct 57 struct hash *hash_create (unsigned int (*) (), int (*) ()); 58 struct hash *hash_create_size (unsigned int, unsigned int (*) (), int (*) ()); 60 void *hash_get (struct hash *, void *, void * (*) ()); 62 void *hash_lookup (struct hash *, void *); 63 void *hash_release (struct hash *, void *); 65 void hash_iterate (struct hash *, 68 void hash_clean (struct hash *, void (*) (void *)); 69 void hash_free (struct hash *); [all...] |
H A D | hash.c | 24 #include "hash.h" 27 /* Allocate a new hash. */ 28 struct hash * 32 struct hash *hash; local 34 hash = XMALLOC (MTYPE_HASH, sizeof (struct hash)); 35 hash->index = XMALLOC (MTYPE_HASH_INDEX, 37 memset (hash->index, 0, sizeof (struct hash_backet *) * size); 38 hash 66 hash_get(struct hash *hash, void *data, void * (*alloc_func) ()) argument 99 hash_lookup(struct hash *hash, void *data) argument 108 hash_release(struct hash *hash, void *data) argument 140 hash_iterate(struct hash *hash, void (*func) (struct hash_backet *, void *), void *arg) argument 153 hash_clean(struct hash *hash, void (*free_func) (void *)) argument 178 hash_free(struct hash *hash) argument [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/openvpn-2.3.1/src/openvpn/ |
H A D | list.h | 29 * This code is a fairly straightforward hash 31 * hash function. 61 struct hash struct 72 struct hash *hash_init (const int n_buckets, 77 void hash_free (struct hash *hash); 79 bool hash_add (struct hash *hash, const void *key, void *value, bool replace); 81 struct hash_element *hash_lookup_fast (struct hash *hash, 95 struct hash *hash; member in struct:hash_iterator 125 hash_value(const struct hash *hash, const void *key) argument 131 hash_n_elements(const struct hash *hash) argument 137 hash_n_buckets(const struct hash *hash) argument 143 hash_bucket(struct hash *hash, uint32_t hv) argument 149 hash_lookup(struct hash *hash, const void *key) argument 165 hash_add_fast(struct hash *hash, struct hash_bucket *bucket, const void *key, uint32_t hv, void *value) argument 183 hash_remove(struct hash *hash, const void *key) argument [all...] |
H A D | list.c | 40 struct hash * 46 struct hash *h; 50 ALLOC_OBJ_CLEAR (h, struct hash); 66 hash_free (struct hash *hash) argument 69 for (i = 0; i < hash->n_buckets; ++i) 71 struct hash_bucket *b = &hash->buckets[i]; 81 free (hash->buckets); 82 free (hash); 86 hash_lookup_fast (struct hash *has argument 117 hash_remove_fast(struct hash *hash, struct hash_bucket *bucket, const void *key, uint32_t hv) argument 146 hash_add(struct hash *hash, const void *key, void *value, bool replace) argument 174 hash_remove_by_value(struct hash *hash, void *value) argument 189 hash_remove_marked(struct hash *hash, struct hash_bucket *bucket) argument 228 hash_iterator_init_range(struct hash *hash, struct hash_iterator *hi, int start_bucket, int end_bucket) argument 249 hash_iterator_init(struct hash *hash, struct hash_iterator *hi) argument 360 print_nhash(struct hash *hash) argument 380 rmhash(struct hash *hash, const char *word) argument 392 struct hash *hash = hash_init (10000, get_random (), word_hash_function, word_compare_function); local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/include/linux/ |
H A D | hash.h | 36 u64 hash = val; local 39 u64 n = hash; 41 hash -= n; 43 hash -= n; 45 hash += n; 47 hash -= n; 49 hash += n; 51 hash += n; 54 return hash >> (64 - bits); 60 u32 hash local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/drivers/staging/batman-adv/ |
H A D | hash.c | 23 #include "hash.h" 25 /* clears the hash */ 26 static void hash_init(struct hashtable_t *hash) argument 30 hash->elements = 0; 32 for (i = 0 ; i < hash->size; i++) 33 hash->table[i] = NULL; 36 /* remove the hash structure. if hashdata_free_cb != NULL, this function will be 37 * called to remove the elements inside of the hash. if you don't remove the 39 void hash_delete(struct hashtable_t *hash, hashdata_free_cb free_cb) argument 44 for (i = 0; i < hash 61 hash_destroy(struct hashtable_t *hash) argument 72 hash_iterate(struct hashtable_t *hash, struct hash_it_t *iter) argument 143 struct hashtable_t *hash; local 167 hash_add(struct hashtable_t *hash, void *data) argument 207 hash_find(struct hashtable_t *hash, void *keydata) argument 232 hash_remove_bucket(struct hashtable_t *hash, struct hash_it_t *hash_it_t) argument 253 hash_remove(struct hashtable_t *hash, void *data) argument 279 hash_resize(struct hashtable_t *hash, int size) argument [all...] |
H A D | hash.h | 60 /* allocates and clears the hash */ 67 * fiddles with hash-internals. */ 68 void *hash_remove_bucket(struct hashtable_t *hash, struct hash_it_t *hash_it_t); 70 /* remove the hash structure. if hashdata_free_cb != NULL, this function will be 71 * called to remove the elements inside of the hash. if you don't remove the 73 void hash_delete(struct hashtable_t *hash, hashdata_free_cb free_cb); 75 /* free only the hashtable and the hash itself. */ 76 void hash_destroy(struct hashtable_t *hash); 79 int hash_add(struct hashtable_t *hash, void *data); 81 /* removes data from hash, i [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/scripts/basic/ |
H A D | hash.c | 21 * http://www.cse.yorku.ca/~oz/hash.html 26 unsigned long hash = 5381; local 31 hash = ((hash << 5) + hash) + c; 34 return (unsigned int)(hash & ((1 << DYNAMIC_DEBUG_HASH_BITS) - 1)); 39 unsigned long hash = 0; local 44 hash = (hash + (c << 4) + (c >> 4)) * 11; 47 return (unsigned int)(hash [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/wxWidgets-2.8.12/src/common/ |
H A D | hashmap.cpp | 23 /* (http://burtleburtle.net/bob/hash/doobs.html) */ 27 unsigned long hash = 0; local 31 hash += *k++; 32 hash += (hash << 10); 33 hash ^= (hash >> 6); 35 hash += (hash << 3); 36 hash 44 unsigned long hash = 0; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/libxml2-2.7.2/python/tests/ |
H A D | compareNodes.py | 9 # Testing XML Node comparison and Node hash-value 30 # Next check that the hash function for the objects also works ok 31 if not (hash(foonode1) == hash(foonode2)): 32 print "Error hash values for two equal nodes are different" 34 if not (hash(foonode1) != hash(root)): 35 print "Error hash values for two unequal nodes are not different" 37 if hash(foonode1) == hash(roo [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/libxml2-2.7.2/source/python/tests/ |
H A D | compareNodes.py | 9 # Testing XML Node comparison and Node hash-value 30 # Next check that the hash function for the objects also works ok 31 if not (hash(foonode1) == hash(foonode2)): 32 print "Error hash values for two equal nodes are different" 34 if not (hash(foonode1) != hash(root)): 35 print "Error hash values for two unequal nodes are not different" 37 if hash(foonode1) == hash(roo [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/libcryptoxx-5.6.0/ |
H A D | hmac.cpp | 17 HashTransformation &hash = AccessHash(); local 18 unsigned int blockSize = hash.BlockSize(); 21 throw InvalidArgument("HMAC: can only be used with a block-based hash function"); 30 keylength = hash.DigestSize(); 46 HashTransformation &hash = AccessHash(); local 47 hash.Update(AccessIpad(), hash.BlockSize()); 71 HashTransformation &hash = AccessHash(); local 75 hash.Final(AccessInnerHash()); 77 hash [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/netatalk-2.2.5/etc/afpd/ |
H A D | hash.c | 17 * $Id: hash.c,v 1.4 2009-11-19 10:37:43 franklahm Exp $ 26 #include "hash.h" 29 static const char rcsid[] = "$Id: hash.c,v 1.4 2009-11-19 10:37:43 franklahm Exp $"; 121 static void clear_table(hash_t *hash) argument 125 for (i = 0; i < hash->nchains; i++) 126 hash->table[i] = NULL; 136 * the hash table will continue to function exactly as before without having to 150 * chains based on the value of each node's newly exposed hash bit. 154 * the various bookeeping fields of the hash structure. 157 static void grow_table(hash_t *hash) argument 231 shrink_table(hash_t *hash) argument 295 hash_t *hash; local 331 hash_set_allocator(hash_t *hash, hnode_alloc_t al, hnode_free_t fr, void *context) argument 347 hash_free_nodes(hash_t *hash) argument 365 hash_free(hash_t *hash) argument 378 hash_destroy(hash_t *hash) argument 399 hash_init(hash_t *hash, hashcount_t maxcount, hash_comp_t compfun, hash_fun_t hashfun, hnode_t **table, hashcount_t nchains) argument 434 hash_scan_begin(hscan_t *scan, hash_t *hash) argument 483 hash_t *hash = scan->table; local 519 hash_insert(hash_t *hash, hnode_t *node, const void *key) argument 557 hash_lookup(hash_t *hash, const void *key) argument 591 hash_delete(hash_t *hash, hnode_t *node) argument 624 hash_alloc_insert(hash_t *hash, const void *key, void *data) argument 636 hash_delete_free(hash_t *hash, hnode_t *node) argument 647 hash_scan_delete(hash_t *hash, hnode_t *node) argument 677 hash_scan_delfree(hash_t *hash, hnode_t *node) argument 692 hash_verify(hash_t *hash) argument 727 hash_isfull(hash_t *hash) argument 738 hash_isempty(hash_t *hash) argument 807 hash_count(hash_t *hash) argument 813 hash_size(hash_t *hash) argument 857 hash_val_t hash = 0, tmp = 0; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/ipv4/ |
H A D | protocol.c | 16 * Richard Colella : Hang on hash collision 35 * Add a protocol handler to the hash tables 40 int hash, ret; local 42 hash = protocol & (MAX_INET_PROTOS - 1); 45 if (inet_protos[hash]) { 48 inet_protos[hash] = prot; 58 * Remove a protocol from the hash tables. 63 int hash, ret; local 65 hash = protocol & (MAX_INET_PROTOS - 1); 68 if (inet_protos[hash] [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/iserver/libcsc-0.82.3/doc/manl/ |
H A D | csc_hash.l | 10 CSChashNew - create a new libcsc hash table 11 CSChashDel - remove a libcsc hash table 12 CSChashStat - query statistics of a libcsc hash table 13 CSChashEntryPut - put an entry into a libcsc hash table 14 CSChashEntryGet - get an item from a libcsc hash table 15 CSChashEntryDel - remove an entry from a libcsc hash table 16 CSChashEntryNext - find next entry in a libcsc hash table 17 CSChashEntryStat - query the fields of a libcsc hash table entry 18 CSChashRead - read an ASCII format libcsc hash table 19 CSChashWrite - write a libcsc hash tabl [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/db-4.7.25.NC/java/src/com/sleepycat/db/ |
H A D | Hasher.java | 11 An application-specified, database hash function. 15 An application-specified, database-specific hash function. 17 The hash function must handle any key values used by the application 27 The hash value of the byte string. 29 int hash(Database db, byte[] data, int len); method in interface:Hasher
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/amule/aMule-2.3.1/src/ |
H A D | CanceledFileList.h | 33 // Only the file hash is stored. 42 // Check if hash belongs to a canceled file 43 bool IsCanceledFile(const CMD4Hash& hash) const; 44 // Add a hash to the list (returns true if added, false if already in list) 45 bool Add(const CMD4Hash& hash); 46 // Remove a hash from the list (returns true if removed, false if not in list) 47 bool Remove(const CMD4Hash& hash);
|
H A D | CanceledFileList.cpp | 70 CMD4Hash hash; local 71 file.Read(hash.GetHash(), 16); 72 AddDebugLogLineN(logKnownFiles, CFormat(wxT("Canceled file read: %s")) % hash.Encode()); 73 if (!hash.IsEmpty()) { 74 m_canceledFileList.insert(hash); 109 bool CCanceledFileList::IsCanceledFile(const CMD4Hash& hash) const 111 return !hash.IsEmpty() && m_canceledFileList.find(hash) != m_canceledFileList.end(); 115 bool CCanceledFileList::Add(const CMD4Hash& hash) argument 117 return m_canceledFileList.insert(hash) 121 Remove(const CMD4Hash& hash) argument [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/src/router/ppp/pppd/plugins/pppoe/ |
H A D | pppoehash.c | 24 char hash[sizeof(int)]={0,}; local 27 hash[i% sizeof(int)] = hash[i%sizeof(int)] ^ key[i]; 29 i = (*((int*)hash)) ; 39 int hash = hash_con(len, key); local 42 ret = con_ht[hash]; 52 int hash = hash_con(pc->key_len, pc->key); local 55 ret = con_ht[hash]; 64 pc->next = con_ht[hash]; 65 con_ht[hash] 73 int hash = hash_con(len, key); local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/net/ipv6/ |
H A D | protocol.c | 34 int ret, hash = protocol & (MAX_INET_PROTOS - 1); local 38 if (inet6_protos[hash]) { 41 inet6_protos[hash] = prot; 53 * Remove a protocol from the hash tables. 58 int ret, hash = protocol & (MAX_INET_PROTOS - 1); local 62 if (inet6_protos[hash] != prot) { 65 inet6_protos[hash] = NULL;
|
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/timemachine/db-4.7.25.NC/mod_db4/ |
H A D | mm_hash.c | 51 unsigned int hash = 0; local 54 hash = hash * 65599 + *key++; 56 return hash; 62 unsigned int hash = hash_hash((const char *)key, length) % MM_HASH_SIZE; local 64 for (b = table->buckets[ hash ]; b; b = b->next) { 65 if (hash != b->hash) continue; 78 unsigned int hash; local 80 hash 107 unsigned int hash; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/ext3/ |
H A D | hash.c | 2 * linux/fs/ext3/hash.c 37 /* The old legacy hash */ 40 __u32 hash, hash0 = 0x12a3fe2d, hash1 = 0x37abe8f9; local 44 hash = hash1 + (hash0 ^ (((int) *ucp++) * 7152373)); 46 if (hash & 0x80000000) 47 hash -= 0x7fffffff; 49 hash0 = hash; 56 __u32 hash, hash0 = 0x12a3fe2d, hash1 = 0x37abe8f9; local 60 hash = hash1 + (hash0 ^ (((int) *scp++) * 7152373)); 62 if (hash 141 __u32 hash; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/ext4/ |
H A D | hash.c | 2 * linux/fs/ext4/hash.c 37 /* The old legacy hash */ 40 __u32 hash, hash0 = 0x12a3fe2d, hash1 = 0x37abe8f9; local 44 hash = hash1 + (hash0 ^ (((int) *ucp++) * 7152373)); 46 if (hash & 0x80000000) 47 hash -= 0x7fffffff; 49 hash0 = hash; 56 __u32 hash, hash0 = 0x12a3fe2d, hash1 = 0x37abe8f9; local 60 hash = hash1 + (hash0 ^ (((int) *scp++) * 7152373)); 62 if (hash 141 __u32 hash; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/components/opensource/linux/linux-2.6.36/fs/ceph/crush/ |
H A D | hash.c | 3 #include "hash.h" 7 * http://burtleburtle.net/bob/hash/evahash.html 26 __u32 hash = crush_hash_seed ^ a; local 30 crush_hashmix(b, x, hash); 31 crush_hashmix(y, a, hash); 32 return hash; 37 __u32 hash = crush_hash_seed ^ a ^ b; local 40 crush_hashmix(a, b, hash); 41 crush_hashmix(x, a, hash); 42 crush_hashmix(b, y, hash); 48 __u32 hash = crush_hash_seed ^ a ^ b ^ c; local 61 __u32 hash = crush_hash_seed ^ a ^ b ^ c ^ d; local 76 __u32 hash = crush_hash_seed ^ a ^ b ^ c ^ d ^ e; local [all...] |
/netgear-R7000-V1.0.7.12_1.2.5/ap/gpl/samba-3.0.25b/source/iniparser/src/ |
H A D | dictionary.c | 68 @brief Compute the hash key for a string. 72 This hash function has been taken from an Article in Dr Dobbs Journal. 82 unsigned hash ; local 86 for (hash=0, i=0 ; i<len ; i++) { 87 hash += (unsigned)key[i] ; 88 hash += (hash<<10); 89 hash ^= (hash>>6) ; 91 hash 174 unsigned hash ; local 293 unsigned hash ; local 357 unsigned hash ; local [all...] |