Searched defs:hash (Results 1 - 5 of 5) sorted by relevance

/bionic/libc/stdio/
H A Dflockfile.c42 * we use a hash-table to map FILE* pointers to recursive mutexes
53 /* a node in the hash table */
60 /* use a static hash table. We assume that we're not going to
101 uint32_t hash = (uint32_t)(void*)f; local
104 hash = (hash >> 2) ^ (hash << 17);
105 pnode = &t->buckets[hash % FILE_LOCK_BUCKETS];
127 /* create a new node in the hash table */
/bionic/libc/regex/
H A Dregex2.h97 * and a mask to pick out the relevant bit of each byte. A hash code
108 uch hash; /* hash code */ member in struct:__anon589
113 #define CHadd(cs, c) ((cs)->ptr[(uch)(c)] |= (cs)->mask, (cs)->hash += (c))
114 #define CHsub(cs, c) ((cs)->ptr[(uch)(c)] &= ~(cs)->mask, (cs)->hash -= (c))
/bionic/libc/bionic/
H A Dmalloc_debug_leak.c101 int hash = 0; local
104 hash = (hash * 33) + (backtrace[i] >> 2);
107 return hash;
134 size_t hash = get_hash(backtrace, numEntries); local
135 size_t slot = hash % HASHTABLE_SIZE;
/bionic/libc/netbsd/resolv/
H A Dres_cache.c67 * - the implementation is just a (query-data) => (answer-data) hash table
766 /* use 32-bit FNV hash function */
771 _dnsPacket_hashBytes( DnsPacket* packet, int numBytes, unsigned hash )
777 hash = hash*FNV_MULT ^ *p++;
780 return hash;
785 _dnsPacket_hashQName( DnsPacket* packet, unsigned hash )
813 hash = hash*FNV_MULT ^ *p++;
818 return hash;
834 unsigned hash = FNV_BASIS; local
998 unsigned int hash; /* hash value */ member in struct:Entry
[all...]
/bionic/linker/
H A Dlinker.c392 static Elf32_Sym *_elf_lookup(soinfo *si, unsigned hash, const char *name) argument
400 name, si->name, si->base, hash, hash % si->nbucket);
401 n = hash % si->nbucket;
403 for(n = si->bucket[hash % si->nbucket]; n != 0; n = si->chain[n]){

Completed in 333 milliseconds