/illumos-gate/usr/src/uts/common/os/ |
H A D | sunmdi.c | 429 struct client_hash *hash = NULL; local 436 hash = kmem_zalloc(mdi_client_table_size * sizeof (*hash), 438 vh->vh_client_table = hash; 1368 * Add this client component to our client hash queue 1376 * Attach the client device to the client hash table. Caller 1397 * Attach the client device to the client hash table. 1465 * Remove this client from our hash queue 1676 * Create a hash using strings as keys 1682 uint32_t g, hash local [all...] |
H A D | zone.c | 136 * Pointers to active zone_t's are stored in two hash tables; one 145 * so it is slower than an id or name search via a hash table. 151 * zone hash tables and lists. Zones cannot be created or destroyed 2129 * Compute a hash value based on the contents of the label and the DOI. The 2130 * hash algorithm is somewhat arbitrary, but is based on the observation that 2132 * multiples of the number of hash chains, and thus stirring in some primes 2140 uint_t hash; local 2145 hash = lab->tsl_doi + (lab->tsl_doi << 1); 2152 hash += *up + (*up << ((i % 16) + 1)); 2156 return (hash); [all...] |
/illumos-gate/usr/src/cmd/svc/configd/ |
H A D | rc_node.c | 47 * rc_node_t's are also placed in the cache_hash[] hash table, for rapid 77 * a new node takes the place of the old node in the global hash and the 120 * strings into a hash table and detecting collisions, which takes linear time 127 * the authorizations from one of the sets into the hash table we can merely 129 * This reduces memory requirements and hash table clutter. The enabling set 141 * While entering the enabling strings into the hash table, we keep track 232 * are added to a permcheck_t hash table as noted in the section on 234 * hash table, perm_granted() is called. If the client is authorized, 242 * find no match, so it needs to decide which string in the hash 246 * in the hash tabl 628 uint32_t hash; local [all...] |
/illumos-gate/usr/src/cmd/sgs/rtld/common/ |
H A D | elf.c | 1312 * Compute the elf hash value (as defined in the ELF access library). 1313 * The form of the hash table is: 1350 ulong_t hash = slp->sl_hash; local 1369 hashoff = ((uint_t)hash % buckets) + 2; 1372 * Get the first symbol from the hash chain and initialize the string 1388 * names don't match continue with the next hash entry. 2510 * symbol lookup hash table. 2516 * If we don't have a .hash table there are no symbols
|
/illumos-gate/usr/src/uts/common/io/sfe/ |
H A D | sfe.c | 725 * Use multicast hash table, 732 j = dp->mc_list[i].hash >> (32 - 9); 794 /* Load Multicast hash table */ 831 * determine hardware hash table size in word. 854 /* make hash table */ 857 h = dp->mc_list[i].hash >> hash_shift; 873 /* Load Multicast hash table */
|
H A D | sfe_util.c | 3287 dp->mc_list[cnt].hash =
|
/illumos-gate/usr/src/uts/common/io/fibre-channel/fca/oce/ |
H A D | oce_mbx.c | 1204 bcopy(hkey, fwcmd->params.req.hash, OCE_HKEY_SIZE);
|
/illumos-gate/usr/src/uts/common/io/axf/ |
H A D | axf_usbgem.c | 555 * make hash table to select interresting 560 h = dp->mc_list[i].hash; 579 /* set multicast hash table */ 581 /* need to set up multicast hash table */
|
/illumos-gate/usr/src/lib/libc/port/threads/ |
H A D | synch.c | 464 * Allocate the sleep queue hash table. 867 /* empty queue root; just delete from the hash list */ 1931 uint_t hash = LOCK_HASH(mp); local 1953 for (rlp = table[hash]; rlp != NULL; rlp = rlp->robust_next) { 1965 for (rlpp = &table[hash]; 1991 * the hash table and to the global list. 2029 * Do this by traversing the global list, not the hash table.
|
/illumos-gate/usr/src/cmd/tar/ |
H A D | tar.c | 485 static unsigned int hash(char *str); 5488 * A hash table of file names to be {in,ex}cluded is built. 5531 h = hash(name); 5572 h = hash(name); 5586 h = hash(name); 5601 * Compute a hash from a string. 5605 hash(char *str) function 6234 struct cachenode *next; /* next in hash chain */ 6236 int namehash; /* name's hash signature */ 6547 static timestruc_t modtimes[PATH_MAX+1]; /* hash tabl [all...] |
/illumos-gate/usr/src/cmd/boot/bootadm/ |
H A D | bootadm.c | 3444 * creates sha1 hash of archive 3450 char *hash; local 3454 (void) asprintf(&archive_hash, "%s.hash", archive); 3458 if ((ret = bootadm_digest(archive, &hash)) == BAM_ERROR) { 3466 free(hash); 3470 (void) fprintf(fp, "%s\n", hash); 3472 free(hash); 3789 * Note: we will not create hash here, CREATE_RAMDISK should create it. 6386 bam_error(_("invalid key for mnttab hash: %s\n"), special);
|
/illumos-gate/usr/src/uts/common/io/fibre-channel/ulp/ |
H A D | fcp.c | 6144 int hash; local 6149 hash = FCP_HASH(wwn); 6151 for (ptgt = pptr->port_tgt_hash_table[hash]; ptgt != NULL; 9392 * hash list. 9406 int hash; local 9429 /* add new target entry to the port's hash list */ 9431 hash = FCP_HASH(wwn); 9433 ptgt->tgt_next = pptr->port_tgt_hash_table[hash]; 9434 pptr->port_tgt_hash_table[hash] = ptgt; 14107 int hash; local [all...] |
/illumos-gate/usr/src/lib/libkmf/plugins/kmf_openssl/common/ |
H A D | openssl_spi.c | 1847 uchar_t hash[EVP_MAX_MD_SIZE]; local 1871 (void) EVP_DigestFinal_ex(&ctx, hash, &hashlen); 1876 dsasig = DSA_do_sign(hash, hashlen, dsa); 2491 /* Lookup by key hash */ 2493 /* If key hash isn't SHA1 length then forget it */ 2498 /* Calculate hash of each key and compare */
|
/illumos-gate/usr/src/cmd/geniconvtbl/ |
H A D | geniconvtbl.c | 44 #include "hash.h" 690 * map-hash-lookup 736 hash_value = hash((const char *)(q), source_len,
|
/illumos-gate/usr/src/lib/krb5/plugins/kdb/db2/ |
H A D | kdb_db2.c | 273 hashi.hash = NULL; 1474 /* ignore hash argument. Might have been passed from create */ 1475 else if (!opt || strcmp(opt, "hash")) { 1573 else if (opt && !strcmp(opt, "hash")) { 1669 /* ignore hash argument. Might have been passed from create */ 1670 else if (!opt || strcmp(opt, "hash")) {
|
/illumos-gate/usr/src/uts/common/krtld/ |
H A D | kobj.c | 159 * into the hash table 345 * hash entries. 836 * hash undefined references. 865 * Insert symbols into the hash table. 976 * Insert the symbols into the hash table. 2565 * fill in the hash table. 2686 * Return the hash of the ELF sections that are memory resident. 2692 crypto_es_hash(struct module *mp, char *hash, char *shstrtab) argument 2715 "krtld: crypto_es_hash: updating hash with" 2723 SHA1Final((uchar_t *)hash, [all...] |
/illumos-gate/usr/src/uts/common/io/ |
H A D | tl.c | 99 * endpoint is found by the hash table lookup. This increment is atomic with the 100 * lookup itself and happens while the hash table read lock is held. 136 * Use of hash tables 139 * The driver uses modhash hash table implementation. Each transport uses two 140 * hash tables - one for finding endpoints by acceptor ID and another one for 142 * pair of hash tables since sockets only use TICOTSORD. 144 * All hash tables lookups increment a reference count for returned endpoints, 146 * from the hash by another thread immediately after it is found. 238 * and avoid any hash table lookups. This saves two hash table 5367 mod_hash_t *hash = ux_addr->soua_magic == SOU_MAGIC_IMPLICIT ? local [all...] |
/illumos-gate/usr/src/cmd/cmd-inet/usr.lib/mdnsd/ |
H A D | DNSCommon.c | 1165 const mDNSu8 hash[NSEC3_MAX_HASH_LEN], int *dlen) 1203 digest = hash; 1840 // are kept in the same hash table, we use the same function to make it easy for the callers when 1841 // they walk the hash table to answer LocalOnly/P2P questions 1164 NSEC3HashName(const domainname *name, rdataNSEC3 *nsec3, const mDNSu8 *AnonData, int AnonDataLen, const mDNSu8 hash[NSEC3_MAX_HASH_LEN], int *dlen) argument
|
H A D | mDNS.c | 8292 mDNSu32 hash = q.qnamehash; local 8397 MakeNegativeCacheRecord(m, &m->rec.r, name, hash, q.qtype, q.qclass, negttl, mDNSInterface_Any, qptr->qDNSServer); 8404 cg = CacheGroupForName(m, slot, hash, name); 8457 hash = DomainNameHashValue(name); 8460 //cg = CacheGroupForName(m, slot, hash, name);
|
/illumos-gate/usr/src/cmd/ztest/ |
H A D | ztest.c | 1159 uint64_t hash = object ^ (offset % (ZTEST_RANGE_LOCKS + 1)); local 1160 rll_t *rll = &zd->zd_range_lock[hash & (ZTEST_RANGE_LOCKS - 1)]; 4134 * Generate a known hash collision, and verify that
|
/illumos-gate/usr/src/grub/grub-0.97/docs/ |
H A D | texinfo.tex | 5706 % The technique used is stolen from LaTeX: let \hash be something 5714 \let\hash\relax\let\xeatspaces\relax\parsemargdefxxx#1,;,} 5720 {\xeatspaces{\hash\the\paramno}}% 5721 \edef\paramlist{\paramlist\hash\the\paramno,}% 5738 \let\hash=##% convert placeholders to macro parameter chars
|
/illumos-gate/usr/src/uts/common/io/fibre-channel/fca/qlge/ |
H A D | qlge.c | 5021 hash(k, length, initval) function 5024 register ub4 initval; /* the previous hash, or an arbitrary value */ 5031 c = initval; /* the previous hash value */ 5151 h = hash(key, 12, 0); /* return 32 bit */
|
/illumos-gate/usr/src/common/crypto/sha1/sparc/sun4u/ |
H A D | sha1_asm.s | 2437 ! Compute final hash values for this block and store back to SHA1_CTX
|
/illumos-gate/usr/src/uts/common/io/usbgem/ |
H A D | usbgem.c | 2608 dp->mc_list[cnt].hash =
|
/illumos-gate/usr/src/uts/common/inet/ip/ |
H A D | ip_if.c | 2420 /* Walk the frag hash table. */ 2464 * hash chain. If we try and send any icmp messages 3366 * Allocate sufficient space to contain our fragment hash table and 5063 * Find or create the per-thread hash table used to track object references. 5128 * insert into the hash. 13266 * actually added to the ire hash table. The count is decremented in 17400 uchar_t hash[16]; local 17419 MD5Final(hash, &ctx); 17422 * Map the hash to an interface ID per the basic approach in RFC3041. 17425 bcopy(hash [all...] |