/barrelfish-master/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);
|
/barrelfish-master/usr/replay/ |
H A D | hash.h | 5 * Simple hash table implementation 9 /* hash entry */ 11 /* key, value for hash entry */ 20 /* hash table: each entry is is a pointer to 21 * the head of a linked list of hash entries */ 27 * hash_init: initialize a hash table 37 unsigned long hash_lookup(hash_t *hash, unsigned long key); 43 void hash_insert(hash_t *hash, unsigned long key, unsigned long val); 49 unsigned long hash_delete(hash_t *hash, unsigned long key); 52 * hash_destroy: destroy the hash 63 hash_fn(hash_t *hash, unsigned long key) argument [all...] |
H A D | hash.c | 1 /* simple hash table 6 #include "hash.h" 10 hash_t *hash; local 12 hash = malloc(sizeof(hash_t)); 13 hash->table = calloc(size, sizeof(hash_entry_t *)); 14 if (!hash || !hash->table){ 18 hash->size = size; 20 return hash; 23 void hash_print(hash_t *hash) argument 39 hash_destroy(hash_t *hash) argument 53 hash_insert(hash_t *hash, unsigned long key, unsigned long val) argument 80 hash_lookup(hash_t *hash, unsigned long key) argument 102 hash_delete(hash_t *hash, unsigned long key) argument 134 hash_swap(hash_t *hash, unsigned long key1, unsigned long key2) argument [all...] |
/barrelfish-master/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...] |
/barrelfish-master/lib/openssl-1.0.0d/crypto/lhash/ |
H A D | lhash.c | 59 /* Code for dynamic hash table routines 126 ret->hash=((h == NULL)?(LHASH_HASH_FN_TYPE)lh_strhash:h); 181 unsigned long hash; local 189 rn=getrn(lh,data,&hash); 201 nn->hash=hash; 219 unsigned long hash; local 224 rn=getrn(lh,data,&hash); 250 unsigned long hash; local 255 rn=getrn(lh,data,&hash); 314 unsigned long hash,nni; local 408 unsigned long hash,nn; local [all...] |
/barrelfish-master/lib/openssl-1.0.0d/engines/ccgost/ |
H A D | gostsum.c | 20 int get_line(FILE *f,char *hash,char *filename); 110 fprintf(stderr,"%s: GOST hash sum check failed for '%s'\n", 118 fprintf(stderr,"%s: %d of %d file(f) failed GOST hash sum check\n", 188 int get_line(FILE *f,char *hash,char *filename) argument 191 if (fread(hash,1,64,f)<64) return 0; 192 hash[64]=0; 195 if (hash[i]<'0' || (hash[i]>'9' && hash[i]<'A') || (hash[ [all...] |
/barrelfish-master/lib/openssl-1.0.0d/tools/ |
H A D | c_rehash | 5 # and add symbolic links to their hash values. 111 # Link a certificate to its subject name hash value, each hash is of 112 # the form <hash>.<n> where n is an integer. If the hash value already exists 120 my ($hash, $fprint) = `"$openssl" x509 -hash -fingerprint -noout -in "$fname"`; 121 chomp $hash; 126 # Search for an unused hash filename 127 while(exists $hashlist{"$hash [all...] |
H A D | c_rehash.bak | 5 # and add symbolic links to their hash values. 111 # Link a certificate to its subject name hash value, each hash is of 112 # the form <hash>.<n> where n is an integer. If the hash value already exists 120 my ($hash, $fprint) = `"$openssl" x509 -hash -fingerprint -noout -in "$fname"`; 121 chomp $hash; 126 # Search for an unused hash filename 127 while(exists $hashlist{"$hash [all...] |
H A D | c_rehash.in | 5 # and add symbolic links to their hash values. 111 # Link a certificate to its subject name hash value, each hash is of 112 # the form <hash>.<n> where n is an integer. If the hash value already exists 120 my ($hash, $fprint) = `"$openssl" x509 -hash -fingerprint -noout -in "$fname"`; 121 chomp $hash; 126 # Search for an unused hash filename 127 while(exists $hashlist{"$hash [all...] |
/barrelfish-master/lib/lua/src/ |
H A D | lstring.c | 23 ** compute its hash 70 luaM_reallocvector(L, tb->hash, tb->size, newsize, GCObject *); 71 for (i = tb->size; i < newsize; i++) tb->hash[i] = NULL; 75 GCObject *p = tb->hash[i]; 76 tb->hash[i] = NULL; 79 unsigned int h = lmod(gco2ts(p)->hash, newsize); /* new position */ 80 gch(p)->next = tb->hash[h]; /* chain it */ 81 tb->hash[h] = p; 88 lua_assert(tb->hash[newsize] == NULL && tb->hash[t [all...] |
/barrelfish-master/usr/eclipseclp/Kernel/src/ |
H A D | bip_store.c | 44 * Heap hash tables ("stores") 142 * Get a pointer to the hash table either from a handle 245 * Grow the hash table by HTABLE_EXPAND_FACTOR 276 t_htable_elem **new_slot = &new_htable[elem->hash % new_size]; 299 * Auxiliary function to look up vkey/tkey with hash value hash 303 _htable_find(t_heap_htable *obj, uword hash, value vkey, type tkey, t_htable_elem ***ppslot) argument 307 pslot = &obj->htable[hash % obj->size]; 310 if (pelem->hash == hash 335 uword hash; local 392 uword hash; local 445 uword hash; local 465 uword hash; local 494 uword hash; local 752 uword hash; local 793 uword hash; local 832 uword hash; local [all...] |
/barrelfish-master/lib/lwip2/src/netif/ppp/ |
H A D | chap-md5.c | 67 unsigned char hash[MD5_HASH_SIZE]; local 75 /* Generate hash of ID, secret, challenge */ 81 lwip_md5_finish(&ctx, hash); 84 /* Test if our hash matches the peer's response */ 85 if (memcmp(hash, response, MD5_HASH_SIZE) == 0) {
|
/barrelfish-master/include/lwip2/netif/ppp/ |
H A D | chap-md5.c | 67 unsigned char hash[MD5_HASH_SIZE]; local 75 /* Generate hash of ID, secret, challenge */ 81 lwip_md5_finish(&ctx, hash); 84 /* Test if our hash matches the peer's response */ 85 if (memcmp(hash, response, MD5_HASH_SIZE) == 0) {
|
/barrelfish-master/lib/openssl-1.0.0d/crypto/err/ |
H A D | err.c | 237 void (*cb_thread_release)(LHASH_OF(ERR_STATE) **hash); member in struct:st_ERR_FNS 252 static void int_thread_release(LHASH_OF(ERR_STATE) **hash); 382 LHASH_OF(ERR_STRING_DATA) *hash; 385 hash = ERRFN(err_get)(0); 386 if (!hash) 390 p = lh_ERR_STRING_DATA_retrieve(hash, d); 399 LHASH_OF(ERR_STRING_DATA) *hash; 402 hash = ERRFN(err_get)(1); 403 if (!hash) 407 p = lh_ERR_STRING_DATA_insert(hash, [all...] |
/barrelfish-master/lib/openssl-1.0.0d/engines/vendor_defns/ |
H A D | hw_4758_cca.h | 81 unsigned char * hash, 97 unsigned char * hash,
|
H A D | hw_ubsec.h | 79 int hash, unsigned char *data, int data_len, 86 int hash, unsigned char *data, int data_len,
|
/barrelfish-master/lib/openssl-1.0.0d/crypto/x509/ |
H A D | by_dir.c | 78 unsigned long hash; member in struct:lookup_dir_hashes_st 172 static void by_dir_hash_free(BY_DIR_HASH *hash) argument 174 OPENSSL_free(hash); 180 if ((*a)->hash > (*b)->hash) 182 if ((*a)->hash < (*b)->hash) 340 htmp.hash = h; 440 htmp.hash = h; 449 hent->hash [all...] |
/barrelfish-master/lib/vfs/ |
H A D | vfs_cache.c | 64 * - For each hash, a linked list of entries with matching hashes exists. 99 // http://burtleburtle.net/bob/hash/integer.html 159 // remove from hash collision list 167 // no prev must be first entry for hash, so must be in map 168 size_t hash = hash_key(entry->key, cache->map_size); local 169 assert(cache->map[hash] == entry_index); 170 cache->map[hash] = entry->next; 259 get_new_entry(struct fs_cache *cache, size_t hash, struct cache_entry **entry) argument 316 size_t hash = hash_key(key, cache->map_size); local 317 size_t entry_index = cache->map[hash]; 350 size_t hash = hash_key(key, cache->map_size); local 417 size_t hash = hash_key(key, cache->map_size); local [all...] |
/barrelfish-master/lib/devif/backends/net/mlx4/drivers/infiniband/hw/mthca/ |
H A D | mthca_mcg.c | 54 * If GID is found in MGM or MGM is empty, *index = *hash, *prev = -1 58 * previous entry in hash chain and *mgm holds AMGM entry. 61 * entry in hash chain and *mgm holds end of hash chain. 65 u16 *hash, int *prev, int *index) 80 err = mthca_MGID_HASH(dev, mailbox, hash, &status); 90 mthca_dbg(dev, "Hash for %pI6 is %04x\n", gid, *hash); 92 *index = *hash; 106 if (*index != *hash) { 132 u16 hash; local 63 find_mgm(struct mthca_dev *dev, u8 *gid, struct mthca_mailbox *mgm_mailbox, u16 *hash, int *prev, int *index) argument 239 u16 hash; local [all...] |
/barrelfish-master/usr/eclipseclp/icparc_solvers/rxspencer/ |
H A D | regex2.h | 74 * and a mask to pick out the relevant bit of each byte. A hash code 85 uch hash; /* hash code */ member in struct:__anon1774 90 #define CHadd(cs, c) ((cs)->ptr[(uch)(c)] |= (cs)->mask, (cs)->hash += (c)) 91 #define CHsub(cs, c) ((cs)->ptr[(uch)(c)] &= ~(cs)->mask, (cs)->hash -= (c))
|
/barrelfish-master/lib/cxx/cxx/ |
H A D | debug.cpp | 155 size_t hc = hash<const void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); 188 size_t h = hash<void*>()(q->__c_) % nc; 199 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); 217 size_t hi = hash<void*>()(__i) % static_cast<size_t>(__iend_ - __ibeg_); 250 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); 281 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); 307 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); 334 size_t hc = hash<void*>()(__c) % static_cast<size_t>(__cend_ - __cbeg_); 450 size_t hc = hash<void*>()(c1) % static_cast<size_t>(__cend_ - __cbeg_); 458 hc = hash<voi [all...] |
/barrelfish-master/lib/hashtable/ |
H A D | hashtable.c | 26 * \brief get a hash value for a string 28 * \return the hash value 30 static inline int hash(const char *str, size_t key_len) function 43 * \brief get the index for an given hash in the bucket table 45 * \param hash_value the hash 89 int _hash_value = hash(entry->key, entry->key_len); 146 int _hash_value = hash(key, key_len); 171 int _hash_value = hash(key, key_len); 192 int _hash_value = hash(key, key_len);
|
/barrelfish-master/lib/compiler-rt/builtins/ |
H A D | atomic.c | 105 intptr_t hash = (intptr_t)ptr; local 107 // same memory operation to hash to the same value and therefore use the same 109 hash >>= 4; 110 // Use the next bits as the basis for the hash 111 intptr_t low = hash & SPINLOCK_MASK; 112 // Now use the high(er) set of bits to perturb the hash, so that we don't 114 hash >>= 16; 115 hash ^= low; 117 return locks + (hash & SPINLOCK_MASK);
|
/barrelfish-master/lib/openssl-1.0.0d/demos/engines/zencod/ |
H A D | hw_zencod.h | 70 typedef int t_zencod_dsa_do_sign (unsigned int hash, KEY *data, KEY *random, 72 typedef int t_zencod_dsa_do_verify (unsigned int hash, KEY *data, 116 /* algo : hash algorithm, MD5 or SHA1 */
|
/barrelfish-master/lib/libc/db/test/hash.tests/ |
H A D | driver2.c | 79 info.hash = my_hash; 105 perror("closing hash file");
|