/illumos-gate/usr/src/common/ficl/ |
H A D | dictionary.c | 17 * 29 jun 1998 (sadler) added variable sized hash table support 70 * has been successfully defined (ie linked into a hash). It 357 word->hash = ficlHashCode(name); 450 * of ficlCells capacity, and no hashing (hash size == 1). 485 ficlHash *hash; local 488 hash = (ficlHash *)dictionary->here; 492 hash->size = bucketCount; 493 ficlHashReset(hash); 494 return (hash); 510 * Empty the dictionary, reset its hash tabl 516 ficlHash *hash; local 618 ficlHash *hash; local 859 ficlHash *hash = dictionary->compilationWordlist; local [all...] |
/illumos-gate/usr/src/boot/sys/boot/common/ |
H A D | load_elf.c | 1007 unsigned long hash; local 1009 hash = elf_hash(name); 1010 COPYOUT(&ef->buckets[hash % ef->nbuckets], &symnum, sizeof(symnum));
|
/illumos-gate/usr/src/lib/pkcs11/pkcs11_softtoken/common/ |
H A D | softKeysUtil.c | 634 /* U = hash function output bits */ 857 CK_BYTE hash[SHA512_DIGEST_LENGTH]; /* space enough for all mechs */ local 998 OBJ_SEC_VALUE_LEN(basekey_p), hash, &hash_len); 1035 (hash + hash_len - secret_key_len),
|
/illumos-gate/usr/src/lib/libshell/common/sh/ |
H A D | parse.c | 47 #define hash nvlink.hl._hash macro 1922 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); 1924 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); 1926 return(np->hash);
|
/illumos-gate/usr/src/lib/libdevinfo/ |
H A D | devinfo_devlink.h | 103 struct cache_link *hash; /* next link on same hash chain */ member in struct:cache_link 127 uint_t hash_sz; /* number of hash chains */ 128 cache_link_t **hash; /* hash table */ member in struct:cache 208 #define MIN_HASH_SIZE 1024 /* Min number of chains in hash table */ 250 #define CACHE_HASH(h, i) (CACHE(h)->hash[i])
|
/illumos-gate/usr/src/lib/libelfsign/common/ |
H A D | elfsignlib.c | 894 elfsign_hash_common(ELFsign_t ess, uchar_t *hash, size_t *hash_len, argument 902 /* The buffer must be large enough to hold the hash */ 906 bzero(hash, *hash_len); 946 * throw this section into the hash 957 cryptodebug("elfsign_hash: updating hash " 968 SHA1Final(hash, &ctx); 975 tohexstr(hash, *hash_len, hashstr, hashstr_len); 976 cryptodebug("hash value is: %s", hashstr); 986 * elfsign_hash - return the hash of the ELF sections affecting execution. 989 * OUT: hash, hash_le 992 elfsign_hash(ELFsign_t ess, uchar_t *hash, size_t *hash_len) argument 1005 elfsign_hash_mem_resident(ELFsign_t ess, uchar_t *hash, size_t *hash_len) argument 1027 uchar_t hash[SIG_MAX_LENGTH]; local [all...] |
/illumos-gate/usr/src/lib/libsqlite/src/ |
H A D | vdbeInt.h | 177 HashElem *pSearch; /* The hash element for pCurrent */ 178 Hash hash; /* Hash table of all aggregate elements */ member in struct:Agg 195 Hash hash; /* A set is just a hash table */ member in struct:Set 196 HashElem *prev; /* Previously accessed hash elemen */
|
/illumos-gate/usr/src/lib/libtecla/common/ |
H A D | history.c | 74 * History lines are recorded in a hash table, such that repeated 77 * Start by defining the size of the hash table. This should be a 85 * Each history line will be represented in the hash table by a 90 GlhHashBucket *bucket; /* The parent hash-table bucket of this node */ 92 /* parent hash-table bucket. */ 106 static int _glh_is_line(GlhHashNode *hash, const char *line, size_t n); 108 static void _glh_return_line(GlhHashNode *hash, char *line, size_t dim); 111 * All history lines which hash to a given bucket in the hash table, are 125 GlhHashBucket bucket[GLH_HASH_SIZE]; /* The buckets of the hash tabl 180 GlhLineHash hash; /* A hash-table of reference-counted history lines */ member in struct:GlHistory 2383 _glh_is_line(GlhHashNode *hash, const char *line, size_t n) argument 2467 _glh_return_line(GlhHashNode *hash, char *line, size_t dim) argument [all...] |
/illumos-gate/usr/src/common/ctf/ |
H A D | ctf_create.c | 58 ctf_dtdef_t **hash = ctf_alloc(hashlen * sizeof (ctf_dtdef_t *)); local 62 if (hash == NULL) 74 ctf_free(hash, hashlen * sizeof (ctf_dtdef_t *)); 80 bzero(hash, hashlen * sizeof (ctf_dtdef_t *)); 81 fp->ctf_dthash = hash; 1322 * If the non-empty name was not found in the appropriate hash, search
|
/illumos-gate/usr/src/cmd/cmd-inet/usr.lib/wpad/ |
H A D | wpa.c | 793 uint8_t hash[SHA1_MAC_LEN]; local 794 hmac_sha1(key, 16, buf, len, hash); 795 (void) memcpy(mic, hash, MD5_MAC_LEN);
|
/illumos-gate/usr/src/cmd/sgs/elfdump/common/ |
H A D | fake_shdr.c | 600 * Read the hash nbucket/nchain values from the start of the hash 604 * values, *total contains the number of elements in the hash table, 1095 SINFO hash; member in struct:__anon1431 1219 sec.hash.type = SINFO_T_HASH; 1220 sec.hash.vaddr = dyn->d_un.d_ptr; 1371 * fan out: Disqualifying the .dynsym will disqualify the hash 1389 * The length of the hash section is encoded in its first two 1394 * If we don't have a hash table, or cannot read nbuckets and 1397 if (sec.hash [all...] |
/illumos-gate/usr/src/cmd/cmd-crypto/elfsign/ |
H A D | elfsign.c | 501 uchar_t hash[SIG_MAX_LENGTH]; local 577 * so the hash doesn't change 588 bzero(hash, sizeof (hash)); 589 if (elfsign_hash(cmd_info.ess, hash, &hash_len) != ELFSIGN_SUCCESS) { 590 es_error(gettext("Unable to calculate hash of ELF object %s"), 598 hash, hash_len, sig, &sig_len)) { 649 bzero(hash, hash_len);
|
/illumos-gate/usr/src/cmd/fs.d/nfs/statd/ |
H A D | sm_proc.c | 406 unsigned int hash; local 468 SMHASH(new->id.mon_id.mon_name, hash); 469 mutex_lock(&mon_table[hash].lock); 470 monitor_q = mon_table[hash].sm_monhdp; 472 /* If mon_table hash list is empty. */ 475 (void) printf("\nAdding to monitor_q hash %d\n", hash); 477 mon_table[hash].sm_monhdp = new; 478 mutex_unlock(&mon_table[hash].lock); 515 mutex_unlock(&mon_table[hash] 560 unsigned int hash; local 637 unsigned int hash; local 845 int hash; local [all...] |
/illumos-gate/usr/src/cmd/ipf/tools/ |
H A D | ipf_y.y | 944 | hash '/' YY_NUMBER { hashed = 1; 948 | hash '=' '(' addrlist ')' { hashed = 1; 1078 hash: IPFY_HASH { yyexpectaddr = 0; yycont = NULL; yyresetdict(); } label 1651 { "hash", IPFY_HASH },
|
/illumos-gate/usr/src/cmd/sgs/pvs/common/ |
H A D | pvs.c | 680 * hash - ELF hash of name 689 gvers_find(const char *name, unsigned long hash, APlist *lst) argument 695 if ((vdp->vd_hash == hash) && 707 * hash - ELF hash of name 717 gvers_desc(const char *name, unsigned long hash, APlist **lst, const char *file) argument 721 if ((vdp = gvers_find(name, hash, *lst)) == NULL) { 730 vdp->vd_hash = hash; 742 * hash 755 gvers_depend(const char *name, unsigned long hash, GVer_desc *vdp, APlist **lst, const char *file) argument [all...] |
/illumos-gate/usr/src/cmd/sgs/rtld/common/ |
H A D | cap.c | 1004 uint_t hash = sgs_str_hash(name); local 1009 if (pnavl_recorded(&capavl, name, hash, &where)) 1014 pnp->pn_hash = hash;
|
/illumos-gate/usr/src/cmd/tsol/tnd/ |
H A D | tnd.c | 156 * This is a table of hash tables to keep 158 * a separate hash bucket structure, instead mantain 159 * a pointer to the hash chain. 170 * This is a hash table which keeps fully resolved 172 * a separate hash bucket structure, instead 173 * mantain a pointer to the hash chain. 924 * Search the hash chain for the address. If not found, 925 * add the entry to the hash table. If necessary, 926 * construct the hash table. 933 unsigned char hash; local 1032 unsigned char hash; local 1108 unsigned char hash; local 1149 unsigned char hash; local 1172 unsigned char hash; local 1209 unsigned char hash; local 1225 unsigned char hash; local 1257 unsigned char hash; local [all...] |
/illumos-gate/usr/src/uts/common/inet/ip/ |
H A D | ip_mroute.c | 116 * mfctable is a fixed size hash table of mfc buckets strcuts (struct mfcb). 125 * When the last walker of the hash bucket exits all the mfc structs 1339 /* Insert new entry at head of hash chain */ 1395 * go thorugh the hash bucket and free all the entries marked condemned. 1439 uint_t hash; local 1444 hash = MFCHASH(origin.s_addr, mcastgrp.s_addr); 1453 MFCB_REFHOLD(&ipst->ips_mfcs[hash]); 1456 for (rt = ipst->ips_mfcs[hash].mfcb_mfc; rt; rt = rt->mfc_next) { 1471 MFCB_REFRELE(&ipst->ips_mfcs[hash]); 1479 ipst->ips_mfcs[hash] 1668 uint_t hash; local 1916 uint_t hash; local [all...] |
H A D | tnet.c | 263 uint_t hash; local 269 hash = rp->rtsa_doi + (rp->rtsa_doi << 1); 275 hash += *up + (*up << ((i % 16) + 1)); 279 return (hash); 562 "found gcgrp(1) in hash(2)", tsol_gcgrp_t *, gcgrp, 581 char *, "inserted gcgrp(1) in hash(2)", 608 "removed inactive gcgrp(1) from hash(2)",
|
/illumos-gate/usr/src/uts/common/fs/ |
H A D | dnlc.c | 61 * for future reference. Each hash chain is ordered by LRU 62 * Cache is indexed by hash value obtained from (vp, name) 96 * NC_MOVETOFRONT is the move-to-front threshold: if the hash lookup 98 * its hash chain. The idea is to make sure that the most frequently 100 * front of their hash chains). 120 * from each hash chain), before having to cycle around and retry. 146 static int nc_hashsz; /* size of hash table */ 147 static int nc_hashmask; /* size of hash table minus 1 */ 241 * Remove entry from hash queue 267 * Cached directory free space hash functio 440 int hash; local 507 int hash; local 588 int hash, depth; local 669 int hash; local 972 dnlc_search(vnode_t *dp, const char *name, uchar_t namlen, int hash) argument 1149 int hash; local 1290 int hash; local 1592 int hash; local 1790 int hash; local [all...] |
/illumos-gate/usr/src/uts/common/fs/sockfs/ |
H A D | nl7chttp.c | 698 * pointer "*hash" points to the current text hash. 703 * **hpp == **epp), and "*hash" will be updated. 706 * line and "*hash" wont be updated. 717 ttree_line_parse(ttree_t *t, char **cpp, char **epp, char **hpp, uint32_t *hash) argument 729 uint32_t hv; /* hash value */ 731 if (hash != NULL) 732 hv = *hash; 829 hash != NULL) { 840 * Return updated hash valu [all...] |
/illumos-gate/usr/src/uts/common/fs/ufs/ |
H A D | ufs_acl.c | 1833 * signature - the signature for the acl for lookup in the hash table 1841 int hash; local 1850 hash = SI_HASH(signature); 1851 for (tspp = &si_cachea[hash]; *tspp; tspp = &(*tspp)->s_next) { 1888 hash = SI_HASH(sp->s_shadow); 1889 for (tspp = &si_cachei[hash]; *tspp; tspp = &(*tspp)->s_forw) { 1907 * Alloc the hash buckets for the si cache & initialize
|
/illumos-gate/usr/src/uts/common/os/ |
H A D | callout.c | 81 #define CALLOUT_HASH_INSERT(hash, cp, cnext, cprev) \ 83 callout_hash_t *hashp = &(hash); \ 94 #define CALLOUT_HASH_APPEND(hash, cp, cnext, cprev) \ 96 callout_hash_t *hashp = &(hash); \ 107 #define CALLOUT_HASH_DELETE(hash, cp, cnext, cprev) \ 109 callout_hash_t *hashp = &(hash); \ 125 * - callouts are queued in a FIFO manner in the ID hash table. 136 * hash table buckets: 144 * them. Keeping these callout lists in the rear of the hash 166 #define CALLOUT_LIST_INSERT(hash, c 319 callout_list_get(callout_table_t *ct, hrtime_t expiration, int flags, int hash) argument 754 int hash; local 864 int i, hash, clflags; local 988 int hash, clflags; local 1284 int hash, flags; local [all...] |
H A D | dacf.c | 154 * This is the lookup table for the hash tables that dacf manages. Given an 155 * op id and devspec type, one can obtain the hash for that type of data. 197 * initialize the dacf framework by creating the various hash tables. 231 * Set up a hash table with no key destructor. The 238 hbuf, /* hash name */ 239 DACF_RULE_HASHSIZE, /* # hash elems */ 242 mod_hash_bystr, NULL, /* hash alg & data */ 253 dacf_module_hash = mod_hash_create_strhash("dacf module hash", 262 dacf_info_hash = mod_hash_create_ptrhash("dacf info hash", 315 mod_hash_t *hash; local [all...] |
H A D | kcpc.c | 122 long hash; local 138 for (hash = 0; hash < CPC_HASH_BUCKETS; hash++) 139 mutex_init(&kcpc_ctx_llock[hash], 814 long hash; local 820 hash = CPC_HASH_CTX(ctx); 821 mutex_enter(&kcpc_ctx_llock[hash]); 822 ctx->kc_next = kcpc_ctx_list[hash]; 823 kcpc_ctx_list[hash] 896 long hash = CPC_HASH_CTX(ctx); local 1579 long hash; local [all...] |