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

12

/ast/src/lib/libast/cdt/
H A Ddthash.c35 /* internal data structure for hash table with chaining */
40 Dtlink_t** htbl; /* hash table slots */
41 ssize_t tblz; /* size of hash table */
44 /* make/resize hash table */
50 Dthash_t *hash = (Dthash_t*)dt->data; local
52 if((n = hash->tblz) > 0 && (hash->type&H_FIXED) )
58 { hash->type |= H_FIXED;
65 n = n < HLOAD(hash->data.size) ? HLOAD(hash
98 Dthash_t *hash = (Dthash_t*)dt->data; local
117 Dthash_t *hash = (Dthash_t*)dt->data; local
132 Dthash_t *hash = (Dthash_t*)dt->data; local
154 Dthash_t *hash = (Dthash_t*)dt->data; local
226 Dthash_t *hash = (Dthash_t*)dt->data; local
262 Dthash_t *hash = (Dthash_t*)dt->data; local
388 Dthash_t *hash = (Dthash_t*)dt->data; local
[all...]
/ast/src/lib/libast/hash/
H A Dhashlib.h27 * hash table library private definitions
45 Hash_hash_f hash; /* name hash routine */ member in struct:__anon262
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...]
H A Dhashlook.c27 * hash table library
33 * hash table lookup
88 if (flags & HASH_BUCKET) n = last->bucket->hash;
96 last->hash = i = HASHVAL(n);
102 if (i == HASHVAL(b->hash) && ((b->hash & (HASH_DELETED|HASH_OPAQUED)) != HASH_DELETED || (flags & (HASH_CREATE|HASH_DELETE|HASH_INSTALL|HASH_RENAME))))
136 n = i = last->hash;
162 if (flags & HASH_OPAQUE) b->hash |= HASH_OPAQUED;
169 if (flags & HASH_OPAQUE) b->hash &= ~HASH_OPAQUED;
184 if (tab->frozen || (b->hash
[all...]
H A Dhashfree.c27 * hash table library
33 * free (remove) a hash table
76 if (p->hash & HASH_FREENAME)
78 p->hash &= ~HASH_FREENAME;
82 if (!(p->hash & HASH_KEEP))
87 else if (p->hash & HASH_HIDES)
89 p->hash &= ~HASH_HIDES;
H A Dhashsize.c27 * hash table library
69 index = new_b->hash;
H A Dhashalloc.c27 * hash table library
30 static const char id_hash[] = "\n@(#)$Id: hash (AT&T Research) 1996-08-11 $\0\n";
37 * create a new hash table
122 tab->root->local->hash = va_arg(ap, Hash_hash_f);
/ast/src/cmd/cs/vcs_src/
H A Dmnt_imount.h23 #include <hash.h>
/ast/src/lib/libvdelta/
H A Dvdsqueeze.c45 int size; /* size of hash table */
46 int* hash; /* hash table */ member in struct:_table_s
153 reg int *link = tab->link, *hash = tab->hash; local
166 { if((m = hash[key&size]) < 0 )
242 if((m = hash[n]) < 0 )
248 hash[n] = curm++;
290 tab.hash = NIL(int*);
292 /* space for the hash tabl
[all...]
H A Dvddelta.c47 int size; /* size of hash table */
48 int* hash; /* hash table */ member in struct:_table_s
165 reg int size = tab->size, *link = tab->link, *hash = tab->hash; local
181 { if((m = hash[key&size]) < 0)
268 if((m = hash[n]) < 0 )
274 hash[n] = curm++;
396 tab.hash = NIL(int*);
430 /* space for the hash tabl
[all...]
/ast/src/cmd/tests/sfio/
H A Dtmwrite.c30 static unsigned long hash = 0xdeadbeef; local
32 return (hash = hash*0xbadbeef + 0xdeadbeef)&LOWBITS;
/ast/src/lib/libast/include/
H A Dhash.h27 * hash table library interface definitions
88 #define hashcover(b) (((b)->hash&HASH_HIDES)?(Hash_bucket_t*)((b)->name):(Hash_bucket_t*)0)
92 #define hashkeep(b) ((b)->hash|=HASH_KEEP)
93 #define hashname(b) ((((b)->hash&HASH_HIDES)?((Hash_bucket_t*)((b)->name)):(b))->name)
125 unsigned int hash; /* hash flags and value */ \
142 typedef struct /* hash scan bucket position */
159 struct Hash_root /* root hash table information */
171 struct Hash_table /* hash table information */
173 Hash_root_t* root; /* root hash tabl
[all...]
/ast/src/cmd/mailx/port/
H A Ddtrenew.c105 { slot = dt->data->htab + HINDEX(dt->data->ntab,e->hash);
114 e->hash = HASH(dt,key,disc);
H A Ddthash.c71 ** Search for an element in a hash table.
79 /* resize the hash table */
109 { chain = slot + HINDEX(nslot,t->hash);
178 /* object, key, hash value */
198 { if(hsh != t->hash)
233 t->hash = hsh;
262 slot = dt->data->htab + HINDEX(dt->data->ntab,t->hash);
H A Ddthdr.h82 #define hash hl._hash macro
96 /* hash start size and load factor */
117 /* hash function */
H A Ddtmethod.c123 { /* set hash table to proper size */
143 list->hash = HASH(dt,key,disc);
/ast/src/cmd/html/
H A Dhtml2rtf.h33 #include <hash.h>
H A Dtroff2html.h35 #include <hash.h>
/ast/src/lib/libmam/
H A Dmam.h32 #include <hash.h>
109 Hash_table_t* rules; /* rule hash */
110 Hash_table_t* vars; /* variable hash */
/ast/src/cmd/ksh93/sh/
H A Dparse.c48 #define hash nvlink.hl._hash macro
50 #define hash nvlink.lh.__hash macro
2045 sfprintf(lexp->kiafile,"%..64d;%c;%.*s;%d;%d;%..64d;%..64d;%c;%d;%s\n",np->hash,type,len,name,first,last,parent,lexp->fscript,pkind,width,attr);
2047 sfprintf(lexp->kiafile,"%..64d;%c;%s;%d;%d;%..64d;%..64d;%c;%d;%s\n",np->hash,type,name,first,last,parent,lexp->fscript,pkind,width,attr);
2049 return(np->hash);
/ast/src/cmd/std/
H A Dtsort.c43 #include <hash.h>
105 error(ERROR_exit(1), "out of space [hash table]");
117 error(ERROR_exit(1), "out of space [hash entry]");
123 error(ERROR_exit(1), "out of space [hash list]");
145 error(ERROR_exit(1), "hash error");
/ast/src/cmd/dsslib/num_t/
H A Dnum_t.c349 * hash/rand -- hashed/random field -- handy for obfuscating sensitive data
354 Cxunsigned_t hash; member in struct:__anon95
382 hp->hash = h;
402 hp->hash = strtoul(details, NiL, 0);
409 h = hp->hash;
423 hp->hash = h;
443 hp->hash = strtoul(details, NiL, 0);
451 h = hp->hash;
465 hp->hash = h;
1137 { "hash_t", "Repeatable string hash
[all...]
/ast/src/lib/libcs/
H A Dcsattr.c31 #include <hash.h>

Completed in 37 milliseconds

12