Searched refs:hashval (Results 1 - 25 of 49) sorted by relevance

12

/freebsd-9.3-release/crypto/openssl/util/
H A Dfipslink.pl68 my ($hashfile, $hashval);
73 $hashval = `$sha1_exe ${fips_libdir}/$filename`;
75 chomp $hashval;
77 $hashval =~ s/^.*=\s+//;
79 die "Invalid hash received for file" if (length($hashval) != 40);
80 die "***HASH VALUE MISMATCH FOR FILE $filename ***" if ($hashval ne $hashfile);
/freebsd-9.3-release/lib/libc/iconv/
H A Dcitrus_hash.h46 #define _CITRUS_HASH_INSERT(head, elm, field, hashval) \
47 LIST_INSERT_HEAD(&(head)->chh_table[hashval], elm, field)
48 #define _CITRUS_HASH_SEARCH(head, elm, field, matchfunc, key, hashval) \
50 LIST_FOREACH((elm), &(head)->chh_table[hashval], field) \
H A Dcitrus_db.c105 uint32_t hashval, num_entries; local
116 hashval = dl->dl_hashval;
121 hashval = db->db_hashfunc(key)%num_entries;
123 hashval * _CITRUS_DB_ENTRY_SIZE;
125 dl->dl_hashval = hashval;
147 if (be32toh(dex->dex_hash_value) != hashval)
H A Dcitrus_iconv.c194 int hashval, ret = 0; local
201 hashval = hash_func(convname);
203 convname, hashval);
220 _CITRUS_HASH_INSERT(&shared_pool, ci, ci_hash_entry, hashval);
H A Dcitrus_mapper.c315 int hashval, ret; local
322 hashval = hash_func(mapname);
324 hashval);
354 _CITRUS_HASH_INSERT(&ma->ma_cache, cm, cm_entry, hashval);
/freebsd-9.3-release/cddl/contrib/opensolaris/cmd/sgs/tools/common/
H A Dstring_table.c353 uint_t hashval; local
392 hashval = HASHSEED;
394 hashval = ((hashval << 5) + hashval) +
398 for (sthash = stp->st_hashbcks[hashval % stp->st_hbckcnt]; sthash;
402 if (sthash->hi_hashval != hashval)
450 uint_t hashval = HASHSEED; local
467 hashval = ((hashval <<
[all...]
/freebsd-9.3-release/usr.bin/lex/
H A Dsym.c162 int hashval; local
165 hashval = 0;
170 hashval = (hashval << 1) + (unsigned char) str[locstr++];
171 hashval %= hash_size;
174 return hashval;
H A Ddfa.c246 * hashval is the hash value for the dfa corresponding to the state set.
253 int numstates = *ns_addr, nacc, hashval, transsym, nfaccnum; local
293 hashval += state; \
311 nacc = stkend = hashval = 0;
324 hashval += ns;
362 *hv_addr = hashval;
400 int sym, hashval, numstates, dsize; local
569 nset = epsclosure( nset, &numstates, accset, &nacc, &hashval );
571 if ( snstods( nset, numstates, accset, nacc, hashval, &ds ) )
624 accset, &nacc, &hashval );
[all...]
/freebsd-9.3-release/sys/kern/
H A Dvfs_init.c159 uint32_t hashval; local
182 hashval = fnv_32_str(vfc->vfc_name, FNV1_32_INIT);
183 hashval &= 0xff;
188 if (hashval == tvfc->vfc_typenum) {
189 if (hashval == 255 && secondpass == 0) {
190 hashval = 1;
193 hashval++;
198 vfc->vfc_typenum = hashval;
/freebsd-9.3-release/contrib/ncurses/ncurses/tty/
H A Dhashmap.c325 unsigned long hashval = oldhash[i]; local
327 for (sp = hashtab; sp->hashval; sp++)
328 if (sp->hashval == hashval)
330 sp->hashval = hashval; /* in case this is a new entry */
335 unsigned long hashval = newhash[i]; local
337 for (sp = hashtab; sp->hashval; sp++)
338 if (sp->hashval == hashval)
[all...]
/freebsd-9.3-release/sys/gnu/fs/xfs/
H A Dxfs_dir2_trace.c86 (void *)(unsigned long)args->hashval,
101 (void *)(unsigned long)args->hashval,
118 (void *)(unsigned long)args->hashval,
158 (void *)(unsigned long)args->hashval,
174 (void *)(unsigned long)args->hashval,
191 (void *)(unsigned long)args->hashval,
209 (void *)(unsigned long)args->hashval,
H A Dxfs_da_btree.c257 * Update the btree to show the new hashval for this child.
388 node->btree[0].hashval = cpu_to_be32(blk1->hashval);
390 node->btree[1].hashval = cpu_to_be32(blk2->hashval);
464 * (updating last hashval in the process).
520 ((be32_to_cpu(node2->btree[0].hashval) < be32_to_cpu(node1->btree[0].hashval)) ||
521 (be32_to_cpu(node2->btree[be16_to_cpu(node2->hdr.count)-1].hashval) <
522 be32_to_cpu(node1->btree[be16_to_cpu(node1->hdr.count)-1].hashval)))) {
1111 xfs_dahash_t hashval; local
[all...]
H A Dxfs_dir2_block.c294 if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval)
296 if (hash < args->hashval)
301 while (mid >= 0 && be32_to_cpu(blp[mid].hashval) >= args->hashval) {
390 blp[mid].hashval = cpu_to_be32(args->hashval);
680 if ((hash = be32_to_cpu(blp[mid].hashval)) == args->hashval)
682 if (hash < args->hashval)
[all...]
H A Dxfs_dir_leaf.c355 args.hashval = xfs_dir_hash_dot;
371 args.hashval = xfs_dir_hash_dotdot;
381 args.hashval = xfs_da_hashname((char *)(sfe->name),
539 * Save the first resid in a run of equal-hashval entries
690 args.hashval = INT_GET(entry->hashval, ARCH_CONVERT);
745 node->btree[0].hashval = cpu_to_be32(
747 INT_GET(leaf->hdr.count, ARCH_CONVERT)-1].hashval, ARCH_CONVERT));
842 * Update last hashval in each block since we added the name.
844 oldblk->hashval
1696 xfs_dahash_t hashval; local
[all...]
H A Dxfs_attr_leaf.c488 nargs.hashval = xfs_da_hashname((char *)sfe->nameval,
527 * Shortform attribute lists are not stored in hashval sorted order.
598 * It didn't all fit, so we have to sort everything on hashval.
655 if (sbp->hash == cursor->hashval) {
660 } else if (sbp->hash > cursor->hashval) {
680 if (cursor->hashval != sbp->hash) {
681 cursor->hashval = sbp->hash;
814 nargs.hashval = be32_to_cpu(entry->hashval);
870 node->btree[0].hashval
1909 xfs_dahash_t hashval; local
[all...]
H A Dxfs_dir2_node.c226 ASSERT(index == 0 || be32_to_cpu(leaf->ents[index - 1].hashval) <= args->hashval);
228 be32_to_cpu(leaf->ents[index].hashval) >= args->hashval);
331 lep->hashval = cpu_to_be32(args->hashval);
360 ASSERT(be32_to_cpu(leaf->ents[i].hashval) <=
361 be32_to_cpu(leaf->ents[i + 1].hashval));
387 return be32_to_cpu(leaf->ents[be16_to_cpu(leaf->hdr.count) - 1].hashval);
460 index < be16_to_cpu(leaf->hdr.count) && be32_to_cpu(lep->hashval)
[all...]
H A Dxfs_attr.h26 * then that int is used as the index into the Btree. Since the hashval
141 __u32 hashval; /* hash value of next entry to add */ member in struct:attrlist_cursor_kern
H A Dxfs_da_btree.h72 __be32 hashval; /* hash value for this descendant */ member in struct:xfs_da_intnode::xfs_da_node_entry
114 xfs_dahash_t hashval; /* hash value of name */ member in struct:xfs_da_args
177 xfs_dahash_t hashval; /* last hash value in block */ member in struct:xfs_da_state_blk
H A Dxfs_dir.c267 args.hashval = xfs_da_hashname(name, namelen);
326 args.hashval = xfs_da_hashname(name, namelen);
372 args.hashval = xfs_da_hashname(name, namelen);
417 args.hashval = xfs_da_hashname(name, namelen);
509 args.hashval = xfs_da_hashname(name, namelen);
907 * the starting hashval in that block is less than our desired
908 * hashval, then we run with it.
922 if (bp && INT_GET(leaf->entries[0].hashval, ARCH_CONVERT) > cookhash) {
929 cookhash > INT_GET(leaf->entries[INT_GET(leaf->hdr.count, ARCH_CONVERT) - 1].hashval, ARCH_CONVERT)) {
940 * the we start at the top of the Btree and re-find our hashval
[all...]
/freebsd-9.3-release/lib/libc/stdlib/
H A Dhcreate.c158 uint32_t hashval; local
162 hashval = (*__default_hash)(item.key, len);
164 head = &htable[hashval & (htablesize - 1)];
/freebsd-9.3-release/usr.bin/mkstr/
H A Dmkstr.c282 long hashval = 0; local
288 hashval = (hashval << 1) + *cp++;
289 i = hashval % NBUCKETS;
294 if (hp->hval == hashval) {
308 hp->hval = hashval;
/freebsd-9.3-release/bin/sh/
H A Dalias.c291 unsigned int hashval; local
293 hashval = *p << 4;
295 hashval+= *p++;
296 return &atab[hashval % ATABSIZE];
/freebsd-9.3-release/contrib/tcsh/
H A Dsh.exec.c155 int hashval, i; local
265 hashval = havhash ? hashname(*av) : 0;
283 if (!bit(hashval, i))
286 int hashval1 = hash(hashval, i);
647 int hashval; local
650 USE(hashval);
742 hashval = hashname(str2short(dp->d_name));
743 bis(hashval, i);
750 hashval = hashname(str2short(dp->d_name));
751 bis(hashval,
820 int hashval, rehashed, i; local
1087 int hashval, rehashed, i, ex, rval = 0; local
[all...]
H A Dsh.hist.c768 * Histlist. The specified hashval matches the new Hist entry but has not yet
771 insertHistHashTable(struct Hist *np, unsigned hashval) argument
779 assert(hashval == np->Hhash);
786 ((hi = hash2tableIndex(hashval + rehashes, histHashTableLength)),
812 np->Hhash = hashval;
854 /* Search the history hash table for a command matching lp, using hashval as
857 findHistHashTable(struct wordent *lp, unsigned hashval) argument
860 unsigned hi = hashval;
868 else if (hp->Hhash == hashval && heq(lp, &(hp->Hlex)))
874 return findHistHashTable(lp, hashval);
[all...]
/freebsd-9.3-release/contrib/cvs/src/
H A Dhash.c242 int hashval; local
245 hashval = hashp (p->key);
246 if (list->hasharray[hashval] == NULL) /* make a header for list? */
250 list->hasharray[hashval] = q->hashnext = q->hashprev = q;
254 for (q = list->hasharray[hashval]->hashnext;
255 q != list->hasharray[hashval]; q = q->hashnext)
260 q = list->hasharray[hashval];

Completed in 122 milliseconds

12