Searched refs:hash (Results 276 - 300 of 401) sorted by relevance

<<11121314151617

/illumos-gate/usr/src/uts/common/io/sfxge/common/
H A Def10_filter.c438 * As the area of the efx_filter_spec_t we need to hash is DWORD
539 * An arbitrary search limit for the software hash table. As per the linux net
554 uint32_t hash; local
569 hash = ef10_filter_hash(spec);
588 i = (hash + depth) & (EFX_EF10_FILTER_TBL_ROWS - 1);
832 unsigned int hash; local
841 hash = ef10_filter_hash(spec);
848 i = (hash + depth) & (EFX_EF10_FILTER_TBL_ROWS - 1);
/illumos-gate/usr/src/lib/pkcs11/pkcs11_tpm/common/
H A Dutility.c624 CK_BYTE * hash)
632 SHA1Final(hash, &ctx);
622 compute_sha(CK_BYTE *data, CK_ULONG_32 len, CK_BYTE * hash) argument
/illumos-gate/usr/src/cmd/msgfmt/
H A Dgnu_handle.c479 msg[nmsg].hash = hash_val;
500 cur_catalog->msg[n].hash,
H A Dgnu_msgs.c142 * Set the hash table
144 idx = get_hash_index(hash_tbl, m[i].hash, hash_size);
177 /* writing hash table */
H A Dgnu_msgs_rev.c147 * Set the hash table
149 idx = get_hash_index(hash_tbl, m[i].hash, hash_size);
182 /* writing hash table */
/illumos-gate/usr/src/cmd/fm/fmd/common/
H A Dfmd_asru.c138 * Lookup an asru in the hash by name and place a hold on it. If the asru is
379 * ahp->ah_lock held and hash it in. We'll then drop the rwlock and
396 * structure and link into the hash.
618 * Open a saved log file and restore it into the ASRU hash. If we can't even
936 fmd_asru_link_t **hash, size_t match_offset, size_t next_offset)
946 for (alp = hash[h]; alp != NULL; alp =
956 for (alp = hash[h]; alp != NULL; alp =
1021 * Lookup an asru in the hash by name and place a hold on it. If the asru is
1104 fmd_asru_link_t **hash, size_t next_offset, char *name)
1111 pp = &hash[
934 fmd_asru_do_hash_apply(fmd_asru_hash_t *ahp, const char *name, void (*func)(fmd_asru_link_t *, void *), void *arg, fmd_asru_link_t **hash, size_t match_offset, size_t next_offset) argument
1103 fmd_asru_do_delete_entry(fmd_asru_hash_t *ahp, fmd_case_t *cp, fmd_asru_link_t **hash, size_t next_offset, char *name) argument
1126 fmd_asru_do_hash_delete(fmd_asru_hash_t *ahp, fmd_case_susp_t *cis, fmd_case_t *cp, fmd_asru_link_t **hash, size_t next_offset, char *nvname) argument
[all...]
/illumos-gate/usr/src/cmd/awk_xpg4/
H A Dawk3.c448 register ushort_t hash; local
451 np = symtab[hashbuck(hash = dohash((wchar_t *)name))];
453 if (np->n_hash == hash && wcscmp(name, np->n_name) == 0)
460 np = emptynode(VAR, hash = wcslen(name));
465 (hash+1) * sizeof (wchar_t));
539 register int hash = 0; local
542 hash += *name++;
543 return (hash);
728 * element using the hash key.
H A Dawk1.c1432 struct reghashq hash; member in struct:regcache
1438 * Generate a hash value of the given wchar string.
1507 insque(&rcp->hash.hq, &reghash[key]);
1508 rcp->hash.regcachep = rcp;
1547 remque(&rcp->hash.hq);
/illumos-gate/usr/src/cmd/cmd-inet/usr.bin/ftp/
H A Dftp.c889 if (hash) {
897 if (hash && bytes > 0) {
919 while (hash && (bytes >= hashbytes)) {
940 if (hash && bytes > 0) {
1240 if (hash) {
1248 if (hash && bytes > 0) {
1296 while (hash && (bytes >= hashbytes)) {
1323 if (hash && bytes > 0) {
/illumos-gate/usr/src/uts/common/sys/fibre-channel/fca/oce/
H A Doce_hw_eth.h654 uint32_t hash[10]; member in struct:mbx_config_nic_rss::__anon7747::__anon7748
662 uint32_t hash[10];
/illumos-gate/usr/src/cmd/make/bin/
H A Dfiles.cc302 if(dir->hash.length >= MAXPATHLEN) {
326 if ((dir->hash.length > 1) || (wcb.get_string()[0] != (int) period_char)) {
H A Drep.cc125 (int) recursive_name->hash.length)) {
/illumos-gate/usr/src/lib/librsm/common/
H A Drsmlib.c400 int hash; local
403 hash = RSM_POLLFD_HASH(segfd);
407 chunk = pollfd_table.buckets[hash];
427 /* insert this into the hash table */
428 chunk->next = pollfd_table.buckets[hash];
429 pollfd_table.buckets[hash] = chunk;
432 chunk, hash, segfd, segrnum));
444 hash, segfd, segrnum, chunk));
501 int hash; local
508 hash
[all...]
/illumos-gate/usr/src/lib/libsqlite/tool/
H A Dlemon.c204 struct action *collide; /* Next action with the same hash */
3017 char **types; /* A hash table of datatypes */
3022 int hash; /* For hashing the name of a type */ local
3046 /* Build a hash table of datatypes. The ".dtnum" field of each symbol
3047 ** is filled in with the hash index plus 1. A ".dtnum" value of 0 is
3070 hash = 0;
3072 hash = hash*53 + stddt[j];
3074 hash = (hash
[all...]
/illumos-gate/usr/src/lib/passwdutil/
H A Dfiles_attr.c703 char *hash = NULL; local
715 hash = crypt(p->data.val_s, salt);
717 if (hash == NULL) {
721 pword = strdup(hash);
/illumos-gate/usr/src/lib/gss_mechs/mech_krb5/krb5/rcache/
H A Drc_mem.c31 * hash could be forwards since we have to search on match, but naaaah
41 rephash = hash(rep, t->hsize);
/illumos-gate/usr/src/lib/libsqlite/src/
H A Dvdbeaux.c630 sqliteHashInit(&p->agg.hash, SQLITE_HASH_BINARY, 0);
684 for(p = sqliteHashFirst(&pAgg->hash); p; p = sqliteHashNext(p)){
710 sqliteHashClear(&pAgg->hash);
809 sqliteHashClear(&p->aSet[i].hash);
H A Dvdbe.c173 pOld = sqliteHashInsert(&p->hash, pElem->zKey, pElem->nKey, pElem);
191 HashElem *pElem = sqliteHashFirst(&p->hash);
194 pElem = sqliteHashFirst(&p->hash);
3740 nRoot = sqliteHashCount(&pSet->hash);
3743 for(j=0, i=sqliteHashFirst(&pSet->hash); i; i=sqliteHashNext(i), j++){
3747 sqliteHashClear(&pSet->hash);
4501 pElem = sqliteHashFind(&p->agg.hash, zKey, nKey);
4577 p->agg.pSearch = sqliteHashFirst(&p->agg.hash);
4627 sqliteHashInit(&p->aSet[k].hash, SQLITE_HASH_BINARY, 1);
4632 sqliteHashInsert(&p->aSet[i].hash, pO
[all...]
/illumos-gate/usr/src/cmd/rcm_daemon/common/
H A Dfilesys_rcm.c114 static uint32_t hash(uint32_t, char *);
701 * To keep the hash table relatively sparse, default values are
731 /* Allocate an empty hash table for the registered special devices */
981 index = hash(cache->hash_size, mt->mnt_special);
1059 index = hash(cache->hash_size, rsrc);
1077 * hash()
1080 * hash table of size 'h'. It seems to spread entries around well enough.
1083 hash(uint32_t h, char *s) function
/illumos-gate/usr/src/cmd/cmd-inet/usr.sbin/in.routed/
H A Dinput.c1261 * Get a peer_hash structure from the hash of known peers. Create a
1281 msglog("no memory for peer hash");
1285 /* Search for peer in existing hash table */
1320 msglog("no memory for peer hash entry");
1381 uchar_t hash[RIP_AUTH_PW_LEN]; local
1472 * Given a good hash value, these are not security
1493 "MD5 RIPv2 hash has %#x"
1507 MD5Final(hash, &md5_ctx);
1508 if (0 == memcmp(hash, na2->au.au_pw, sizeof (hash)))
[all...]
/illumos-gate/usr/src/cmd/sgs/link_audit/common/
H A Dperfcnt.c38 #include "hash.h"
67 static hash *tbl;
/illumos-gate/usr/src/uts/common/os/
H A Ddacf.c154 * 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...]
/illumos-gate/usr/src/lib/krb5/plugins/kdb/db2/libdb2/hash/
H A Ddbm.c57 #include "hash.h"
180 info.hash = NULL;
/illumos-gate/usr/src/cmd/sgs/elfdump/common/
H A Delfdump.c2930 Cache *hash; member in struct:__anon145
3032 GRAB(SHT_HASH, hash);
3261 TEST_ADDR(SHT_HASH, hash);
3930 * Determine an individual hash entry. This may be the initial hash entry,
3979 hash(Cache *cache, Word shnum, const char *file, uint_t flags) function
3987 Word *hash, *chain; local
3998 * Check the hash table data and size.
4012 hash = (Word *)_cache->c_data->d_buf;
4013 bkts = *hash
[all...]
/illumos-gate/usr/src/uts/common/io/sfxge/
H A Dsfxge_tx.c2814 uint32_t hash; local
2820 * now so we can calculate the hash.
2833 thp->th_sport, hash);
2835 index = srsp->srs_tbl[hash %
2839 * Calculate IPv4 4-tuple hash, with
2845 &iphp->ip_src.s_addr, sport, hash);
2847 index = srsp->srs_tbl[hash %
2859 * It does not matter what the hash is
2867 * Find the event queue corresponding to the hash in
2892 uint32_t hash local
[all...]

Completed in 219 milliseconds

<<11121314151617