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

1234567891011

/osnet-11/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...]
/osnet-11/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...]
/osnet-11/usr/src/grub/grub2/grub-core/disk/
H A DAFSplitter.c27 gcry_err_code_t AF_merge (const gcry_md_spec_t * hash, grub_uint8_t * src,
32 diffuse (const gcry_md_spec_t * hash, grub_uint8_t * src, argument
36 grub_uint32_t IV; /* host byte order independend hash IV */
38 grub_size_t fullblocks = size / hash->mdlen;
39 int padding = size % hash->mdlen;
40 grub_uint8_t final[hash->mdlen];
41 grub_uint8_t temp[sizeof (IV) + hash->mdlen];
43 /* hash block the whole data set with different IVs to produce
50 grub_memcpy (temp + sizeof (IV), src + hash->mdlen * i, hash
69 AF_merge(const gcry_md_spec_t * hash, grub_uint8_t * src, grub_uint8_t * dst, grub_size_t blocksize, grub_size_t blocknumbers) argument
[all...]
/osnet-11/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...]
/osnet-11/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;
/osnet-11/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;
H A DProcessState.java300 * Overridden to ensure that equal instances have equal hash codes.
306 int hash = 17;
307 hash = (37 * hash) + processID;
308 hash = (37 * hash) + state.hashCode();
309 hash = (37 * hash) + terminationSignal;
310 hash = (37 * hash)
[all...]
H A DFlow.java187 * Overridden to ensure that equal instances have equal hash codes.
193 int hash = 17;
194 hash = (37 * hash) + kind.hashCode();
195 hash = (37 * hash) + depth;
196 return hash;
H A DProbeInfo.java161 * Overridden to ensure that equal instances have equal hash codes.
167 int hash = 17;
168 hash = (37 * hash) + probeAttributes.hashCode();
169 hash = (37 * hash) + argumentAttributes.hashCode();
170 return hash;
H A DAggregationRecord.java222 * Overridden to ensure that equal records have equal hash codes.
228 int hash = 17;
229 hash = (37 * hash) + tuple.hashCode();
230 hash = (37 * hash) + value.hashCode();
231 return hash;
/osnet-11/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:__anon1135
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...]
H A Dhashscan.c27 * hash table library
33 * hash table sequential scan
72 b->hash &= ~HASH_HIDDEN;
110 if (!(b->hash & HASH_DELETED) && (!(pos->tab->flags & HASH_VALUE) || b->value) && (!pos->flags || !(b->hash & (HASH_HIDDEN|HASH_HIDES)))) break;
111 if (b->hash & HASH_HIDES)
115 if (!(h->hash & HASH_HIDDEN))
117 h->hash |= HASH_HIDDEN;
118 if (!(b->hash & HASH_DELETED)) break;
121 else b->hash
[all...]
H A Dhashview.c27 * hash table library
33 * push/pop/query hash table scope
66 b->name = (p->hash & HASH_HIDES) ? p->name : (char*)b;
67 b->hash |= HASH_HIDES;
79 if (b->hash & HASH_HIDES)
81 b->hash &= ~HASH_HIDES;
H A Dhashdump.c27 * hash table library
49 * dump hash table bucket info
67 if (!(b->hash & HASH_DELETED) && (!(tab->flags & HASH_VALUE) || b->value))
73 if (!(b->hash & HASH_DELETED) && (!(tab->flags & HASH_VALUE) || b->value))
83 if (b->hash & HASH_FLAGS)
86 if (b->hash & HASH_HIDES) sfprintf(sfstderr, "hides|");
87 if (b->hash & HASH_HIDDEN) sfprintf(sfstderr, "hidden|");
88 if (b->hash & HASH_KEEP) sfprintf(sfstderr, "keep|");
89 if (b->hash & HASH_OPAQUED) sfprintf(sfstderr, "opaque|");
130 * dump hash tabl
[all...]
/osnet-11/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...]
/osnet-11/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...]
/osnet-11/usr/src/lib/gss_mechs/mech_krb5/krb5/rcache/
H A Drc_conv.c39 * Generate a printable hash value for a message for use in a replay
40 * record. It is not necessary for this hash function to be
44 * MD5 hash of the message and convert it into uppercase hex
53 char *hash, *ptr; local
65 hash = malloc(cksum.length * 2 + 1);
66 if (!hash) {
71 for (i = 0, ptr = hash; i < cksum.length; i++, ptr += 2)
74 *out = hash;
H A Drc_common.h41 hash(krb5_donot_replay *, unsigned int);
/osnet-11/usr/src/grub/grub2/grub-core/commands/
H A Dhashsum.c32 {"hash", 'h', 0, N_("Specify hash to use."), N_("HASH"), ARG_TYPE_STRING},
33 {"check", 'c', 0, N_("Check hash list file."), N_("FILE"), ARG_TYPE_STRING},
34 {"prefix", 'p', 0, N_("Base directory for hash list."), N_("DIRECTORY"),
63 hash_file (grub_file_t file, const gcry_md_spec_t *hash, void *result) argument
65 grub_uint8_t context[hash->contextsize];
69 hash->init (context);
78 hash->write (context, readbuf, r);
80 hash->final (context);
81 grub_memcpy (result, hash
87 check_list(const gcry_md_spec_t *hash, const char *hashfilename, const char *prefix, int keep, int uncompress) argument
185 const gcry_md_spec_t *hash; local
[all...]
/osnet-11/usr/src/lib/libparted/common/libparted/fs/ext2/
H A Dext2_buffer.c144 int hash; local
146 hash = ext2_block_hash(block);
147 a = bc->hash[hash];
184 int hash; local
186 hash = ext2_block_hash(bh->block);
187 if (bh->bc->hash[hash] != NULL)
189 bh->next = bh->bc->hash[hash];
202 int hash; local
[all...]
/osnet-11/usr/src/grub/grub2/grub-core/lib/xzembed/
H A Dxz_dec_stream.c79 const gcry_md_spec_t *hash; member in struct:xz_dec
127 struct xz_dec_hash hash; member in struct:xz_dec::__anon610
146 * Hash calculated from the Records (matches block.hash in
149 struct xz_dec_hash hash; member in struct:xz_dec::__anon611
237 * the sizes possibly stored in the Block Header. Update the hash and
267 if (s->hash)
268 s->hash->write(s->hash_context,b->out + s->out_start,
286 s->block.hash.unpadded += s->block_header.size
288 s->block.hash.unpadded += s->hash_size;
290 s->block.hash
383 const gcry_md_spec_t *hash = crc32 ? s->crc32 : s->hash; local
[all...]
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/x2p/
H A Dhash.c1 /* $RCSfile: hash.c,v $$Revision: 4.1 $$Date: 92/08/07 18:29:20 $
9 * $Log: hash.c,v $
26 register int hash; local
31 for (s=key, i=0, hash = 0;
33 s++, i++, hash *= 5) {
34 hash += *s * coeff[i];
36 entry = tb->tbl_array[hash & tb->tbl_max];
38 if (entry->hent_hash != hash) /* strings can't be equal */
52 register int hash; local
58 for (s=key, i=0, hash
101 register int hash; local
[all...]
/osnet-11/usr/src/lib/libcpc/common/
H A Dsubr.c162 __cpc_strhash_free(cpc_strhash_t *hash) argument
164 cpc_strhash_t *p = hash, *f;
174 * Insert a new key into the hash table.
183 __cpc_strhash_add(cpc_strhash_t *hash, char *key) argument
187 for (p = hash; p != NULL; p = p->next) {
196 tmp = hash->next;
197 hash->next = p;
203 hash->cur = p;
209 __cpc_strhash_next(cpc_strhash_t *hash) argument
213 if (hash
[all...]
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Attribute/Handlers/demo/
H A Ddemo.pl8 my %z : Demo(hash) :Multi(method,maybe);
9 # my %a : NDemo(hash);
20 my %z : ExplMulti :Demo(hash);
/osnet-11/usr/src/lib/libdhcpsvc/modules/binfiles/tools/
H A Dprintnet.c105 unsigned int image, hash; local
107 for (hash = 0; hash < DN_CIDHASHSZ; hash++) {
109 if (header.dnh_cidhash[hash][image] == DN_NOREC)
112 (void) printf(" hash %4d/%d: ", hash, image);
113 recid = header.dnh_cidhash[hash][image];

Completed in 68 milliseconds

1234567891011