Searched refs:hash (Results 1 - 25 of 510) sorted by relevance

1234567891011>>

/opensolaris-onvv-gate/usr/src/cmd/sgs/tools/common/
H A Dstrhash.c32 * classic Bernstein k=33 hash function
41 uint_t hash = 5381; local
45 hash = ((hash << 5) + hash) + c; /* hash * 33 + c */
46 return (hash);
/opensolaris-onvv-gate/usr/src/cmd/sgs/link_audit/common/
H A Dhash.h36 typedef struct hash { struct
44 } hash; typedef in typeref:struct:hash
46 extern hash *make_hash(size_t);
47 extern hash *make_ihash(size_t);
48 extern char **get_hash(hash *, char *);
49 extern char **find_hash(hash *, const char *);
50 extern char *del_hash(hash *, const char *);
51 extern size_t operate_hash(hash *, void (*)(), const char *);
52 extern void destroy_hash(hash *, int (*)(), const char *);
/opensolaris-onvv-gate/usr/src/uts/common/fs/
H A Dpkp_hash.c28 * Pearson's string hash
59 uint_t hash; local
62 hash = MOD2((key + len), PKP_HASH_SIZE);
65 hash = MOD2((hash + str[i]), PKP_HASH_SIZE);
66 hash = pkp_tab[hash];
69 return (hash);
/opensolaris-onvv-gate/usr/src/lib/libnsctl/common/
H A Dhash.c37 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) argument
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) argument
84 node = hash[ index ];
94 nsc_remove_node(hash_node_t **hash, cha argument
132 nsc_remove_all(hash_node_t **hash, void (*callback)(void *)) argument
160 unsigned int hash, i; local
[all...]
/opensolaris-onvv-gate/usr/src/cmd/perl/5.8.4/distrib/lib/Hash/
H A DUtil.pm16 Hash::Util - A selection of general-utility hash subroutines
25 %hash = (foo => 42, bar => 23);
26 lock_keys(%hash);
27 lock_keys(%hash, @keyset);
28 unlock_keys(%hash);
30 lock_value (%hash, 'foo');
31 unlock_value(%hash, 'foo');
33 lock_hash (%hash);
34 unlock_hash(%hash);
47 5.8.0 introduces the ability to restrict a hash t
[all...]
/opensolaris-onvv-gate/usr/src/tools/ctf/cvt/
H A Dhash.c30 * 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);
106 hash_add(hash_t *hash, void *key) argument
127 hash_remove_cb(void *key1, void *key2, hash_t *hash) argument
133 hash_remove(hash_t *hash, void *key) argument
142 hash_match(hash_t *hash, void *key, int (*fun)(void *, void *), void *private) argument
166 hash_find_iter(hash_t *hash, void *key, int (*fun)(void *, void *), void *private) argument
194 hash_find(hash_t *hash, void *key, void **value) argument
211 hash_iter(hash_t *hash, int (*fun)(void *, void *), void *private) argument
230 hash_count(hash_t *hash) argument
241 hash_free(hash_t *hash, void (*datafree)(void *, void *), void *private) argument
255 hash_stats(hash_t *hash, int verbose) argument
[all...]
/opensolaris-onvv-gate/usr/src/uts/common/os/
H A Dmodhash.c27 * 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
317 mod_hash_destroy_ptrhash(mod_hash_t *hash) argument
393 mod_hash_destroy_idhash(mod_hash_t *hash) argument
474 mod_hash_destroy_hash(mod_hash_t *hash) argument
514 i_mod_hash(mod_hash_t *hash, mod_hash_key_t key) argument
541 i_mod_hash_insert_nosync(mod_hash_t *hash, mod_hash_key_t key, mod_hash_val_t val, mod_hash_hndl_t handle) argument
575 mod_hash_insert(mod_hash_t *hash, mod_hash_key_t key, mod_hash_val_t val) argument
598 mod_hash_insert_reserve(mod_hash_t *hash, mod_hash_key_t key, mod_hash_val_t val, mod_hash_hndl_t handle) argument
628 mod_hash_reserve(mod_hash_t *hash, mod_hash_hndl_t *handlep) argument
640 mod_hash_reserve_nosleep(mod_hash_t *hash, mod_hash_hndl_t *handlep) argument
654 mod_hash_cancel(mod_hash_t *hash, mod_hash_hndl_t *handlep) argument
666 i_mod_hash_remove_nosync(mod_hash_t *hash, mod_hash_key_t key, mod_hash_val_t *val) argument
703 mod_hash_remove(mod_hash_t *hash, mod_hash_key_t key, mod_hash_val_t *val) argument
721 mod_hash_replace(mod_hash_t *hash, mod_hash_key_t key, mod_hash_val_t val) argument
746 mod_hash_destroy(mod_hash_t *hash, mod_hash_key_t key) argument
770 i_mod_hash_find_nosync(mod_hash_t *hash, mod_hash_key_t key, mod_hash_val_t *val) argument
790 mod_hash_find(mod_hash_t *hash, mod_hash_key_t key, mod_hash_val_t *val) argument
802 mod_hash_find_cb(mod_hash_t *hash, mod_hash_key_t key, mod_hash_val_t *val, void (*find_cb)(mod_hash_key_t, mod_hash_val_t)) argument
818 mod_hash_find_cb_rval(mod_hash_t *hash, mod_hash_key_t key, mod_hash_val_t *val, int (*find_cb)(mod_hash_key_t, mod_hash_val_t), int *cb_rval) argument
834 i_mod_hash_walk_nosync(mod_hash_t *hash, uint_t (*callback)(mod_hash_key_t, mod_hash_val_t *, void *), void *arg) argument
862 mod_hash_walk(mod_hash_t *hash, uint_t (*callback)(mod_hash_key_t, mod_hash_val_t *, void *), void *arg) argument
878 i_mod_hash_clear_nosync(mod_hash_t *hash) argument
898 mod_hash_clear(mod_hash_t *hash) argument
[all...]
/opensolaris-onvv-gate/usr/src/lib/libtecla/common/
H A Dhash.c45 #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 bucket
216 HashTable *hash; /* The table to be returned */ local
287 _del_HashTable(HashTable *hash) argument
340 _new_HashSymbol(HashTable *hash, const char *name, int code, void (*fn)(void), void *data, SYM_DEL_FN(*del_fn)) argument
395 _del_HashSymbol(HashTable *hash, const char *name) argument
436 _find_HashSymbol(HashTable *hash, const char *name) argument
478 _new_HashNode(HashTable *hash, const char *name, int code, void (*fn)(void), void *data, SYM_DEL_FN(*del_fn)) argument
535 _del_HashNode(HashTable *hash, HashNode *node) argument
570 _find_HashBucket(HashTable *hash, const char *name) argument
600 _find_HashNode(HashTable *hash, HashBucket *bucket, const char *name, HashNode **prev) argument
675 _clear_HashTable(HashTable *hash) argument
721 _scan_HashTable(HashTable *hash, HASH_SCAN_FN(*scan_fn), void *context) argument
[all...]
H A Dhash.h52 * 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, cons
[all...]
/opensolaris-onvv-gate/usr/src/uts/common/io/drm/
H A Ddrm_auth.c55 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]
100 int hash; local
[all...]
/opensolaris-onvv-gate/usr/src/cmd/man/src/util/nsgmls.src/include/
H A DHash.h19 static unsigned long hash(const StringC &);
/opensolaris-onvv-gate/usr/src/cmd/sendmail/db/include/
H A Ddb_shash.h16 * 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); \
48 * Insert a new entry into the hash tabl
[all...]
/opensolaris-onvv-gate/usr/src/cmd/nscd/
H A Dnscd_dbimpl.c37 * 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
197 unsigned long hash; local
295 unsigned long hash; local
383 nscd_hash_t *hash; local
[all...]
/opensolaris-onvv-gate/usr/src/lib/lvm/libmeta/common/
H A Dmeta_stat.c51 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;
/opensolaris-onvv-gate/usr/src/cmd/refer/
H A Dinv6.c27 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;
/opensolaris-onvv-gate/usr/src/cmd/spell/
H A Dhash.h36 extern int index[]; /* into dif table based on hi hash bits */
40 unsigned long hash(char *);
/opensolaris-onvv-gate/usr/src/lib/gss_mechs/mech_krb5/krb5/rcache/
H A Drc_common.c24 * 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
/opensolaris-onvv-gate/usr/src/lib/libdtrace_jni/java/src/org/opensolaris/os/dtrace/
H A DProgramInfo.java208 int hash = 17;
209 hash = (37 * hash) + minimumProbeAttributes.hashCode();
210 hash = (37 * hash) + minimumStatementAttributes.hashCode();
211 hash = (37 * hash) + matchingProbeCount;
212 return hash;
/opensolaris-onvv-gate/usr/src/lib/libsmbfs/smb/
H A Dntlm.h49 ntlm_compute_lm_hash(uchar_t *hash, const char *pw);
52 ntlm_compute_nt_hash(uchar_t *hash, const char *pw);
/opensolaris-onvv-gate/usr/src/lib/libast/common/hash/
H A Dhashlib.h27 * hash table library private definitions
45 Hash_hash_f hash; /* name hash routine */ member in struct:__anon2849
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)(
[all...]
/opensolaris-onvv-gate/usr/src/uts/common/gssapi/mechs/krb5/include/
H A Dold.h36 const struct krb5_hash_provider *hash,
42 const struct krb5_hash_provider *hash,
50 const struct krb5_hash_provider *hash,
H A Draw.h31 const struct krb5_hash_provider *hash,
37 const struct krb5_hash_provider *hash,
45 const struct krb5_hash_provider *hash,
H A Ddk.h31 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,
/opensolaris-onvv-gate/usr/src/cmd/perl/5.8.4/distrib/lib/Tie/
H A DSubstrHash.pm17 The B<Tie::SubstrHash> package provides a hash-table-like interface to
20 Upon tying a new hash to this package, the developer must specify the
24 duration of the tied hash>. The newly-allocated hash table may now have
29 may seem excessive, the result is a hash table using much less internal
30 memory than an equivalent freely-allocated hash table.
38 The hash does not support exists().
67 $offset = $hash * $rlen;
91 $offset = $hash * $rlen;
119 $offset = $hash *
[all...]
/opensolaris-onvv-gate/usr/src/cmd/perl/5.8.4/distrib/ext/XS/APItest/
H A DAPItest.xs11 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
50 result = hv_store_ent(hash, key, copy, 0);
64 store(hash, key_s
[all...]

Completed in 412 milliseconds

1234567891011>>