/illumos-gate/usr/src/uts/common/fs/zfs/ |
H A D | sa.c | 406 uint64_t lot_num, uint64_t hash, boolean_t zapadd, dmu_tx_t *tx) 420 tb->lot_hash = hash; 448 /* verify we don't have a hash collision */ 450 for (; findtb && findtb->lot_hash == hash; 462 sa_find_layout(objset_t *os, uint64_t hash, sa_attr_type_t *attrs, argument 471 tbsearch.lot_hash = hash; 475 for (; tb && tb->lot_hash == hash; 485 avl_numnodes(&sa->sa_layout_num_tree), hash, B_TRUE, tx); 649 uint64_t hash; local 721 for (i = 0, len_idx = 0, hash 405 sa_add_layout_entry(objset_t *os, sa_attr_type_t *attrs, int attr_count, uint64_t lot_num, uint64_t hash, boolean_t zapadd, dmu_tx_t *tx) argument [all...] |
/illumos-gate/usr/src/lib/libsldap/common/ |
H A D | ns_mapping.c | 33 * Calculate a hash for a string 34 * Based on elf_hash algorithm, hash is case insensitive 55 * Scan a hash table hit for a matching hash entry. 75 * Find an entry in the hash table 83 unsigned long hash; local 88 hash = ns_hash(str) % NS_HASH_MAX; 89 idx = config->hashTbl[hash]; 124 * Remove a hash table entry. 142 * destroy the hash tabl 174 unsigned long hash; local [all...] |
/illumos-gate/usr/src/cmd/perl/contrib/Sun/Solaris/Kstat/ |
H A D | Kstat.xs | 32 * scripts this module presents the information as a nested hash data structure. 173 * corresponding perl hash. All such conversion functions are in the following 440 * The following struct => hash functions are all only present on the sparc 716 * structure to find the appropriate function. We use a perl hash to manage the 735 /* Create new hash */ 794 * This module converts the flat list returned by kstat_read() into a perl hash 800 * Given module, instance and name keys return a pointer to the hash tied to 801 * the bottommost hash. If the hash already exists, we just return a pointer 802 * to it, otherwise we create the hash an [all...] |
/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/cmd-inet/usr.bin/ftp/ |
H A D | cmds.c | 813 oldhash = hash, hash = 0; 823 verbose = oldverbose; hash = oldhash; 902 onoff(hash), onoff(sendport)); 937 * Toggle hash mark printing during transfers. 943 hash = !hash; 944 (void) printf("Hash mark printing %s", onoff(hash)); 945 code = hash; 946 if (hash) [all...] |
/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])
|
H A D | devinfo_devlink.c | 475 CACHE(hdp)->hash = calloc(hash_sz, sizeof (cache_link_t *)); 476 if (CACHE(hdp)->hash == NULL) { 1060 * Don't bother removing links from hash table chains, 1061 * as we are freeing the hash table itself. 1070 assert((CACHE(hdp)->hash == NULL) ^ (CACHE(hdp)->hash_sz != 0)); 1072 free(CACHE(hdp)->hash); 1073 CACHE(hdp)->hash = NULL; 1149 for (; *pp != NULL; pp = &(*pp)->hash) { 1151 *pp = clp->hash; 1152 clp->hash [all...] |
/illumos-gate/usr/src/lib/libnisdb/yptol/ |
H A D | map_ctrl.c | 41 * Both will have the same hash value so when one is locked 57 extern int hash(char *s); 63 * map_id_list: hash table for map lists 242 /* Work out hash value */ 243 map->hash_val = hash(name); 516 * Index in the hash table is computed from the original 517 * hash function: make sure yptol_newlock is set to false. 520 index = hash(map_name);
|
/illumos-gate/usr/src/cmd/rcm_daemon/common/ |
H A D | svm_rcm.c | 49 * metadevice has an entry of type deventry_t which is accessed by a hash 120 struct deventry *next; /* next entry with same hash */ 150 deventry_t **hashline; /* hash table */ 151 int32_t size; /* sizer of hash table */ 189 static uint32_t hash(uint32_t h, char *s); 1116 hash_index = hash(cache->size, devname); 1119 gettext("SVM: can't hash device.")); 1125 /* if the hash table slot is empty, then this is easy */ 1130 /* if the hash table slot isn't empty, find the immediate successor */ 1146 gettext("SVM: can't create hash lin 2345 hash(uint32_t h, char *s) function 2349 int hash, i; local [all...] |
/illumos-gate/usr/src/cmd/abi/spectrans/spec2map/ |
H A D | bucket.c | 63 * create_lists -- initialize the bucket list and hash map. 638 * new_hashmap -- create the hash. 647 errlog(FATAL, "out of memory creating a hash-map of " 694 int hash = checksum(version_name); local 699 if (Hashhead.hh_last != NULL && Hashhead.hh_last->h_hash == hash && 706 if (current->h_hash == hash &&
|
/illumos-gate/usr/src/cmd/bart/ |
H A D | create.c | 644 * to update the md5 hash buffer, and outputs the chunks 645 * to stdout. When stdin is exhausted, the hash is computed, 648 * returns: The md5 hash of stdin, or NULL if unsuccessful for any reason. 654 unsigned char hash[MD5_DIGEST_LENGTH]; local 667 /* got some data. Now update hash */ 671 /* done passing through data, calculate hash */ 672 MD5Final(hash, &ctx); 675 (void) sprintf(hash_str + (i*2), "%2.2x", hash[i]);
|
/illumos-gate/usr/src/cmd/sgs/rtld/common/ |
H A D | config_elf.c | 443 elf_config_ent(const char *name, Word hash, int id, const char **alternate) argument 449 bkt = hash % config->c_hashtbl[0]; 456 if ((obj->co_hash != hash) || (strcmp(name, str) != 0) ||
|
/illumos-gate/usr/src/cmd/nscd/ |
H A D | cache.c | 345 * cis hash function 358 * ces hash function 371 * one-at-a-time hash function 421 * Find entry in the hash table 425 * return entry in the hash location without checking the keys 429 hash_find(nsc_db_t *nscdb, nsc_entry_t *entry, uint_t *hash, argument 435 *hash = nscdb->gethash(&entry->key, nscdb->htsize); 439 hashentry = nscdb->htable[*hash]; 450 #define HASH_REMOVE(nscdb, entry, hash, cmp) \ 452 if (entry == hash_find(nscdb, entry, &hash, cm 2054 uint_t hash; local 2076 uint_t hash; local [all...] |
/illumos-gate/usr/src/lib/nsswitch/files/common/ |
H A D | files_common.c | 392 uint_t hash, line, f; local 429 hash = fhp->fh_hash_func[hashop](args, 1, NULL, 0); 430 for (hp = htab[hash % fhp->fh_size].h_first; hp != NULL; 432 if (hp->h_hash != hash) 576 * Populate the hash tables in reverse order so that the hash chains
|
/illumos-gate/usr/src/cmd/cmd-inet/usr.sbin/in.routed/ |
H A D | rtquery.c | 558 uchar_t hash[RIP_AUTH_MD5_LEN]; local 724 MD5Final(hash, &md5_ctx); 725 (void) printf(gettext(" %s hash\n"), 726 memcmp(hash, na->au.au_pw, sizeof (hash)) ? 731 "authentication entry missing hash\n"));
|
/illumos-gate/usr/src/uts/common/fs/zfs/sys/ |
H A D | zap_leaf.h | 46 * block size (1<<l->l_bs) - hash entry size (2) * number of hash 72 * The leaf hash table has block size / 2^5 (32) number of entries, 81 * The chunks start immediately after the hash table. The end of the 82 * hash table is at l_hash + HASH_NUMENTRIES, which we simply cast to a 108 uint64_t lh_prefix; /* hash prefix of this leaf */ 121 * The header is followed by a hash table with 122 * ZAP_LEAF_HASH_NUMENTRIES(zap) entries. The hash table is 135 uint16_t le_next; /* next entry in hash chain */ 141 uint64_t le_hash; /* hash valu [all...] |
/illumos-gate/usr/src/uts/common/gssapi/mechs/krb5/crypto/ |
H A D | encrypt.c | 211 (context, krb5_enctypes_list[i].enc, krb5_enctypes_list[i].hash,
|
/illumos-gate/usr/src/uts/common/inet/ilb/ |
H A D | ilb_conn.h | 37 * Struct of the conn hash table bucket 39 * ilb_connp: the first conn hash entry in the bucket 41 * ilb_conn_cnt: number of conn hash entries in this bucket 85 * conn_hash: back pointer to the conn hash table bucket 107 * Struct (an entry in the conn hash table) to store a NAT info of a 128 /* Client to server, hash and check info */ 146 /* Server to client, hash and check info */ 178 * Struct of the sticky hash table bucket 180 * sticky_head: the sticky hash list of this bucket 182 * sticki_cnt: number of sticky hash entrie 220 ilb_sticky_hash_t *hash; member in struct:ilb_sticky_s [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...] |
/illumos-gate/usr/src/uts/common/fs/sockfs/ |
H A D | nl7curi.h | 124 struct uri_desc_s *hash; /* Hash *next */ member in struct:uri_desc_s 153 /* Hash the (char)c to the hash accumulator (uint32_t)hv */ 156 #define URI_TEMP (uri_desc_t *)-1 /* Temp (nocache) uri_t.hash pointer */
|
/illumos-gate/usr/src/tools/cscope-fast/ |
H A D | global.h | 280 int hash(char *s);
|
/illumos-gate/usr/src/tools/protocmp/ |
H A D | depend.c | 44 #define HASH(name) (hash(name) % HASH_SIZE)
|
/illumos-gate/usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/ |
H A D | hash.h | 50 * @(#)hash.h 8.4 (Berkeley) 11/2/95 81 int32_t magic; /* Magic NO for hash tables */ 92 int32_t nkeys; /* Number of keys in hash table */ 94 int32_t h_charkey; /* value of hash(CHARKEY) */ 103 u_int32_t (*hash) __P((const void *, size_t)); /* Hash Function */ member in struct:htab
|
/illumos-gate/usr/src/lib/libast/common/hash/ |
H A D | hashalloc.c | 27 * 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);
|
/illumos-gate/usr/src/uts/common/io/myri10ge/firmware/ |
H A D | myri10ge_mcp.h | 63 /* Place hash value at the top so it gets written before length. 66 uint32_t hash; member in struct:mcp_slot_8 72 /* Two bits of length in mcp_slot are used to indicate hash type. */ 338 * data1 = hash type
|