HomeSort by: relevance | last modified time | path
    Searched defs:hash (Results 1 - 25 of 168) sorted by relevancy

1 2 3 4 5 6 7

  /src/lib/libintl/
strhash.c 40 * string hash function by P.J.Weinberger.
48 uint32_t hash = 0, tmp; local in function:__intl_string_hash
51 hash <<= 4;
52 hash += *p;
53 tmp = hash & 0xF0000000;
55 hash ^= tmp;
56 hash ^= tmp >> 24;
59 return hash;
  /src/lib/libc/citrus/
citrus_db_hash.c 57 uint32_t hash = 0, tmp; local in function:_citrus_db_hash_std
61 hash <<= 4;
62 hash += _bcs_tolower(*p);
63 tmp = hash & 0xF0000000;
65 hash ^= tmp;
66 hash ^= tmp >> 24;
70 return hash;
  /src/usr.bin/m4/TEST/
hash.m4 1 # $NetBSD: hash.m4,v 1.4 1995/09/28 05:37:58 tls Exp $
37 # @(#)hash.m4 8.1 (Berkeley) 6/6/93
44 define(hash,<eval(str(substr($1,1),0)%HASHVAL)>) dnl macro
49 define(KEYWORD,<$1,hash($1),>) dnl
  /src/tests/lib/libcrypt/
t_crypt.c 73 const char *hash; member in struct:__anondf4c2ba30108
143 for (size_t i = 0; tests[i].hash; i++) {
144 char *hash = crypt(tests[i].pw, tests[i].hash); local in function:ATF_TC_BODY
145 if (!hash) {
149 if (strcmp(hash, "*0") == 0 && strlen(tests[i].hash) < 13)
151 if (strcmp(hash, tests[i].hash))
153 i, hash, tests[i].hash)
    [all...]
  /src/games/battlestar/
parse.c 47 static int hash(const char *);
63 hash(const char *s) function in typeref:typename:int
80 for (wp = hashtab[hash(s)]; wp != NULL; wp = wp->next)
92 hashval = hash(wp->string);
  /src/sys/external/bsd/drm/dist/bsd-core/
drm_auth.c 49 int hash = drm_hash_magic(magic); local in function:drm_find_file
53 for (pt = dev->magiclist[hash].head; pt; pt = pt->next) {
63 * Inserts the given magic number into the hash table of used magic number
69 int hash; local in function:drm_add_magic
76 hash = drm_hash_magic(magic);
84 if (dev->magiclist[hash].tail) {
85 dev->magiclist[hash].tail->next = entry;
86 dev->magiclist[hash].tail = entry;
88 dev->magiclist[hash].head = entry;
89 dev->magiclist[hash].tail = entry
103 int hash; local in function:drm_remove_magic
    [all...]
  /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/core/
nouveau_nvkm_core_ramht.c 34 u32 hash = 0; local in function:nvkm_ramht_hash
37 hash ^= (handle & ((1 << ramht->bits) - 1));
41 hash ^= chid << (ramht->bits - 4);
42 return hash;
  /src/sys/external/bsd/drm2/drm/
drm_vm.c 99 struct drm_hash_item *hash; local in function:drm_legacy_mmap_paddr_locked
109 if (drm_ht_find_item(&dev->map_hash, page_offset, &hash))
112 struct drm_local_map *const map = drm_hash_entry(hash,
113 struct drm_map_list, hash)->map;
  /src/sys/fs/ntfs/
ntfs_ihash.c 54 static u_long ntfs_nthash; /* size of hash table - 1 */
60 * Initialize inode hash table.
71 * Reinitialize inode hash table.
78 struct nthashhead *oldhash, *hash; local in function:ntfs_nthashreinit
82 hash = hashinit(desiredvnodes, HASH_LIST, true, &mask);
87 ntfs_nthashtbl = hash;
93 LIST_INSERT_HEAD(&hash[val], ip, i_hash);
101 * Free the inode hash table. Called from ntfs_done(), only needed
134 * Insert the ntnode into the hash table.
149 * Remove the inode from the hash table
    [all...]
  /src/tests/crypto/opencrypto/
h_gcm.c 46 const unsigned char hash[16] = { variable in typeref:typename:const unsigned char[16]
91 if (memcmp(macbuf, hash, sizeof(hash)))
92 errx(1, "hash failed");
122 if (memcmp(macbuf, hash, sizeof(hash)))
123 errx(1, "hash failed");
  /src/usr.sbin/ypserv/revnetgroup/
hash.c 1 /* $NetBSD: hash.c,v 1.5 2009/04/19 06:06:40 lukem Exp $ */
38 __RCSID("$NetBSD: hash.c,v 1.5 2009/04/19 06:06:40 lukem Exp $");
47 #include "hash.h"
49 u_int32_t hash(const void *, size_t);
54 * This hash function is stolen directly from the
61 * OZ's original sdbm hash
64 hash(const void *keyarg, size_t len) function in typeref:typename:u_int32_t
109 * Generate a hash value for a given key (character string).
119 return(hash((const void *)key, strlen(key)) & HASH_MASK);
122 /* Find an entry in the hash table (may be hanging off a linked list). *
    [all...]
  /src/usr.bin/mail/
vars.c 83 * Hash the passed string and return an index into
84 * the variable or group hash table.
87 hash(const char *name) function in typeref:typename:PUBLIC int
107 for (vp = variables[hash(name)]; vp != NULL; vp = vp->v_link)
122 h = hash(name);
157 for (gh = groups[hash(name)]; gh != NULL; gh = gh->g_link)
  /src/sys/external/bsd/gnu-efi/dist/gnuefi/
elf_ia32_efi.lds 10 /* .hash and/or .gnu.hash MUST come first! */
11 .hash : { *(.hash) }
12 .gnu.hash : { *(.gnu.hash) }
elf_ia32_fbsd_efi.lds 10 /* .hash and/or .gnu.hash MUST come first! */
11 .hash : { *(.hash) }
12 .gnu.hash : { *(.gnu.hash) }
elf_ia64_efi.lds 10 /* .hash and/or .gnu.hash MUST come first! */
11 .hash : { *(.hash) }
12 .gnu.hash : { *(.gnu.hash) }
elf_x86_64_efi.lds 11 /* .hash and/or .gnu.hash MUST come first! */
12 .hash : { *(.hash) }
13 .gnu.hash : { *(.gnu.hash) }
elf_x86_64_fbsd_efi.lds 11 /* .hash and/or .gnu.hash MUST come first! */
12 .hash : { *(.hash) }
13 .gnu.hash : { *(.gnu.hash) }
  /src/games/adventure/
vocab.c 137 int hash, i; local in function:vocab
140 for (hash = 0, s = word, i = 0; i < 5 && *s; i++) /* some kind of hash*/
141 hash += *s++; /* add all chars in the word */
142 hash = (hash * 3719) & 077777; /* pulled that one out of a hat */
143 hash %= HTSIZE; /* put it into range of table */
145 for (adr = hash;; adr++) { /* look for entry in table */
187 if (adr + 1 == hash || hash == 0
    [all...]
  /src/libexec/ld.elf_so/
symver.c 139 const Elf_Word hash = vna->vna_hash; local in function:check_object_provided_version
154 dbg(("hash: 0x%x, vd_hash: 0x%x", hash, vd->vd_hash));
155 if (hash == vd->vd_hash) {
284 obj->vertab[vernum].hash = vna->vna_hash;
290 dbg(("verneed: vernum: %d, hash: 0x%x, name: %s, "
292 obj->vertab[vernum].hash, obj->vertab[vernum].name,
316 obj->vertab[vernum].hash = vd->vd_hash;
320 dbg(("verdef: vernum: %d, hash: 0x%x, name: %s",
321 vernum, obj->vertab[vernum].hash,
    [all...]
  /src/sys/net/agr/
if_agrether_hash.c 34 #include <sys/hash.h>
48 #define HASH(p, l, h) hash32_buf((p), (l), (h))
76 uint32_t hash = HASH32_BUF_INIT; local in function:agrether_hashmbuf
83 return hash;
86 hash = HASH(&eh->ether_dhost, sizeof(eh->ether_dhost), hash);
87 hash = HASH(&eh->ether_shost, sizeof(eh->ether_shost), hash);
    [all...]
  /src/tests/lib/libc/hash/
t_sha2.c 57 const char *hash; member in struct:testvector
186 ATF_CHECK_STREQ(test256[i].hash, output);
213 ATF_CHECK_STREQ(test384[i].hash, output);
240 ATF_CHECK_STREQ(test512[i].hash, output);
  /src/lib/libperfuse/
subr.c 36 #include <sys/hash.h>
281 uint32_t hash; local in function:perfuse_nidhash
283 hash = hash32_buf(&nodeid, sizeof(nodeid), HASH32_BUF_INIT);
285 return &ps->ps_nidhash[hash % ps->ps_nnidhash];
  /src/sbin/fsck_lfs/
vnode.c 161 int hash; local in function:vget
165 hash = ((unsigned long)fs + ino) & (VNODE_HASH_MAX - 1);
166 LIST_FOREACH(vp, &getvnodelist[hash], v_getvnodes) {
172 LIST_INSERT_HEAD(&getvnodelist[hash], vp, v_getvnodes);
  /src/sys/external/bsd/compiler_rt/dist/lib/builtins/
atomic.c 110 intptr_t hash = (intptr_t)ptr; local in function:lock_for_pointer
112 // same memory operation to hash to the same value and therefore use the same
114 hash >>= 4;
115 // Use the next bits as the basis for the hash
116 intptr_t low = hash & SPINLOCK_MASK;
117 // Now use the high(er) set of bits to perturb the hash, so that we don't
119 hash >>= 16;
120 hash ^= low;
122 return locks + (hash & SPINLOCK_MASK);
  /src/sys/external/bsd/drm2/dist/drm/nouveau/nvkm/engine/fifo/
nouveau_nvkm_engine_fifo_dmanv40.c 155 int hash; local in function:nv40_fifo_dma_object_ctor
168 hash = nvkm_ramht_insert(imem->ramht, object, chan->base.chid, 4,
171 return hash;

Completed in 81 milliseconds

1 2 3 4 5 6 7