| /onnv/onnv-gate/usr/src/cmd/sgs/tools/common/ |
| strhash.c | 32 * classic Bernstein k=33 hash function
41 uint_t hash = 5381; local
45 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
46 return (hash);
|
| /onnv/onnv-gate/usr/src/cmd/sgs/link_audit/common/ |
| hash.h | 30 @(#)SSM2 hash.h 1.2 90/11/13
34 * File: hash.h
61 typedef struct hash { struct
66 } hash; typedef in typeref:struct:hash
68 hash * make_hash(size_t size);
69 hash * make_ihash(size_t size);
70 char ** get_hash(hash * tbl, char * key);
71 char ** find_hash(hash * tbl, const char * key);
72 char * del_hash(hash * tbl, const char * key);
73 size_t operate_hash(hash * tbl, void (*ptr)(), const char * usr_arg)
[all...] |
| /onnv/onnv-gate/usr/src/lib/libnsctl/common/ |
| hash.c | 37 hash_node_t **hash; local
39 hash = (hash_node_t **)calloc(HASH_PRIME, sizeof (hash_node_t *));
40 return (hash);
44 nsc_insert_node(hash_node_t **hash, void *data, const char *key)
61 node->next = hash[ index ];
62 hash[ index ] = node;
71 * Searches the hash to find a node.
78 nsc_lookup(hash_node_t **hash, const char *key)
84 node = hash[ index ];
94 nsc_remove_node(hash_node_t **hash, char *key
160 unsigned int hash, i; local
[all...] |
| /onnv/onnv-gate/usr/src/tools/ctf/cvt/ |
| hash.c | 30 * Routines for manipulating hash tables
39 #include "hash.h"
43 struct hash { struct
94 hash_t *hash; local
96 hash = xmalloc(sizeof (hash_t));
97 hash->h_buckets = xcalloc(sizeof (list_t *) * nbuckets);
98 hash->h_nbuckets = nbuckets;
99 hash->h_hashfn = hashfn ? hashfn : (int (*)())hash_def_hash;
100 hash->h_cmp = cmp ? cmp : (int (*)())hash_def_cmp;
102 return (hash);
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/os/ |
| modhash.c | 27 * mod_hash: flexible hash table implementation.
29 * This is a reasonably fast, reasonably flexible hash table implementation
30 * which features pluggable hash algorithms to support storing arbitrary keys
32 * data. The hash uses chaining to resolve collisions, and does not feature a
33 * mechanism to grow the hash. Care must be taken to pick nchains to be large
35 * hash chains.
37 * The client of the hash is required to supply a number of items to support
38 * the various hash functions:
41 * A destructor is responsible for freeing an object when the hash
47 * - A hashing algorithm which returns a uint_t representing a hash inde
207 uint_t hash = 0; local
[all...] |
| /onnv/onnv-gate/usr/src/lib/libtecla/common/ |
| hash.c | 45 #include "hash.h"
56 StringMem *string_memory; /* Memory used to allocate hash strings */
60 * Define a hash symbol-table entry.
65 Symbol symbol; /* The symbol stored in the hash-entry */
66 HashNode *next; /* The next hash-table entry in a bucket list */
70 * Each hash-table bucket contains a linked list of entries that
71 * hash to the same bucket.
74 HashNode *head; /* The head of the bucket hash-node list */
79 * A hash-table consists of 'size' hash buckets
216 HashTable *hash; \/* The table to be returned *\/ local
[all...] |
| hash.h | 52 * function that deletes the application-data of a hash-table.
65 * symbol-table implementation. Each hash-table entry contains
99 * of objects. One HashMemory object can be shared between multiple hash
104 /* Create a free-list for allocation of hash tables and their nodes */
114 * hash.c.
126 /* Create a new hash-table */
131 /* Delete a reference to a hash-table */
133 HashTable *_del_HashTable(HashTable *hash);
135 /* Add an entry to a hash table */
137 Symbol *_new_HashSymbol(HashTable *hash, const char *key, int code
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/io/drm/ |
| drm_auth.c | 55 int hash; local
57 hash = drm_hash_magic(magic);
58 for (pt = dev->magiclist[hash].head; pt; pt = pt->next) {
71 int hash; local
74 hash = drm_hash_magic(magic);
83 if (dev->magiclist[hash].tail) {
84 dev->magiclist[hash].tail->next = entry;
85 dev->magiclist[hash].tail = entry;
87 dev->magiclist[hash].head = entry;
88 dev->magiclist[hash].tail = entry
100 int hash; local
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/sharefs/ |
| sharetab.h | 69 * Pearson's string hash
74 #define SHARETAB_HASH_IT(hash, path) \
81 (hash) = MOD2((key + len), SHARETAB_HASHES); \
84 (hash) = MOD2(((hash) + (path)[i]), SHARETAB_HASHES); \
85 (hash) = pkp_tab[(hash)]; \
|
| /onnv/onnv-gate/usr/src/cmd/man/src/util/nsgmls.src/include/ |
| Hash.h | 17 class SP_API Hash {
19 static unsigned long hash(const StringC &);
|
| /onnv/onnv-gate/usr/src/cmd/sendmail/db/include/ |
| db_shash.h | 10 /* Hash Headers */
16 * Look up something in a shared memory hash table. The "elt" argument
18 * structure it is that appears in the hash table. The comparison function
20 * begin: address of the beginning of the hash table.
23 * elt: the item for which we are searching in the hash table.
25 * nelems: the number of buckets in the hash table.
26 * hash_func: the hash function that operates on elements of the type of elt
30 * If the element is not in the hash table, this macro exits with result
33 #define HASHLOOKUP(begin, type, field, elt, r, n, hash, cmp) do { \
37 __ndx = hash(elt) % (n);
[all...] |
| /onnv/onnv-gate/usr/src/cmd/nscd/ |
| nscd_dbimpl.c | 37 * based on hash and has table. If the need arises in the future,
51 * This structure defines an instance of the hash entry
77 nscd_hash_t *hash; /* the current hash entry */ member in struct:cookie
84 * Calculate a hash for a string based on the elf_hash
85 * algorithm, hash is case insensitive. Uses tolower
112 * Scan a hash table for a matching hash entry. Assume 'str' is
168 unsigned long hash; local
174 hash = calc_hash(str)
197 unsigned long hash; local
295 unsigned long hash; local
383 nscd_hash_t *hash; local
[all...] |
| /onnv/onnv-gate/usr/src/lib/lvm/libmeta/common/ |
| meta_stat.c | 51 int hash; local
54 hash = 0;
56 hash += *cp;
58 hash &= 0xf;
60 for (scp = statcache_head[hash]; scp != NULL; scp = scp->sc_next)
83 scp->sc_next = statcache_head[hash];
84 statcache_head[hash] = scp;
|
| /onnv/onnv-gate/usr/src/cmd/refer/ |
| inv6.c | 27 int hash = 0, hused = 0; local
47 if (hash < k) {
51 hfreq[hash] = ct;
52 while (hash < k) {
53 hpt[++hash] = lp;
54 hfreq[hash] = 0;
56 hpt[hash] = lp += iflong ? sizeof (long) : sizeof (int);
71 while (hash < nhash)
72 hpt[++hash] = lp;
|
| /onnv/onnv-gate/usr/src/cmd/spell/ |
| hash.h | 36 extern int index[]; /* into dif table based on hi hash bits */
40 unsigned long hash(char *);
|
| /onnv/onnv-gate/usr/src/lib/gss_mechs/mech_krb5/krb5/rcache/ |
| rc_common.c | 24 * static int hash(krb5_donot_replay *rep, int hsize)
25 * returns hash value of *rep, between 0 and hsize - 1
29 hash(krb5_donot_replay *rep, int hsize) function
|
| /onnv/onnv-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/ |
| ProgramInfo.java | 208 int hash = 17; local
209 hash = (37 * hash) + minimumProbeAttributes.hashCode();
210 hash = (37 * hash) + minimumStatementAttributes.hashCode();
211 hash = (37 * hash) + matchingProbeCount;
212 return hash;
|
| /onnv/onnv-gate/usr/src/lib/libsmbfs/smb/ |
| ntlm.h | 49 ntlm_compute_lm_hash(uchar_t *hash, const char *pw);
52 ntlm_compute_nt_hash(uchar_t *hash, const char *pw);
|
| /onnv/onnv-gate/usr/src/uts/common/gssapi/mechs/krb5/include/ |
| old.h | 36 const struct krb5_hash_provider *hash,
42 const struct krb5_hash_provider *hash,
50 const struct krb5_hash_provider *hash,
|
| raw.h | 31 const struct krb5_hash_provider *hash,
37 const struct krb5_hash_provider *hash,
45 const struct krb5_hash_provider *hash,
|
| dk.h | 31 const struct krb5_hash_provider *hash,
38 const struct krb5_hash_provider *hash,
46 krb5_const struct krb5_hash_provider *hash,
59 krb5_const struct krb5_hash_provider *hash,
76 const struct krb5_hash_provider *hash,
82 const struct krb5_hash_provider *hash,
90 const struct krb5_hash_provider *hash,
|
| /onnv/onnv-gate/usr/src/lib/libast/common/hash/ |
| hashlib.h | 27 * hash table library private definitions
45 Hash_hash_f hash; /* name hash routine */ member in struct:__anon36
61 unsigned int hash; /* last lookup hash */
73 Hash_bucket_t** table; /* hash slot table */ \
76 #include <hash.h>
84 #define HASH(r,n,h) if (r->local->hash) h = r->namesize ? (*r->local->hash)(n, r->namesize) : (*r->local->hash)(n);
[all...] |
| /onnv/onnv-gate/usr/src/cmd/perl/5.8.4/distrib/ext/XS/APItest/ |
| APItest.xs | 6 MODULE = XS::APItest:Hash PACKAGE = XS::APItest::Hash
11 exists(hash, key_sv)
16 HV *hash
20 RETVAL = hv_exists(hash, key, UTF8KLEN(key_sv, len));
25 delete(hash, key_sv)
30 HV *hash
35 RETVAL = SvREFCNT_inc(hv_delete(hash, key, UTF8KLEN(key_sv, len), 0));
40 store_ent(hash, key, value)
45 HV *hash
[all...] |
| /onnv/onnv-gate/usr/src/uts/common/gssapi/mechs/krb5/crypto/old/ |
| old_encrypt.c | 38 const struct krb5_hash_provider *hash,
45 hashsize = hash->hashsize;
54 const struct krb5_hash_provider *hash,
67 hashsize = hash->hashsize;
69 krb5_old_encrypt_length(enc, hash, input->length, &enclen);
92 if ((ret = ((*(hash->hash))(context, 1, output, &datain))))
|
| /onnv/onnv-gate/usr/src/lib/libparted/common/libparted/fs/ext2/ |
| ext2_buffer.c | 143 int hash; local
145 hash = ext2_block_hash(block);
146 a = bc->hash[hash];
183 int hash; local
185 hash = ext2_block_hash(bh->block);
186 if (bh->bc->hash[hash] != NULL)
188 bh->next = bh->bc->hash[hash];
201 int hash; local
[all...] |
