HomeSort by: relevance | last modified time | path
    Searched refs:hashname (Results 1 - 4 of 4) sorted by relevancy

  /src/usr.bin/cksum/
cksum.c 114 const char *hashname; member in struct:hash
177 for (hash = hashes; hash->hashname != NULL; hash++)
181 if (hash->hashname == NULL) {
201 while (hashes[i].hashname != NULL) {
202 if (!strcasecmp(hashes[i].hashname, optarg)) {
233 hash->hashname);
340 strncmp(buf, hash->hashname,
341 strlen(hash->hashname)) != 0) {
348 nhash->hashname != NULL;
351 nhash->hashname,
    [all...]
  /src/bin/csh/
exec.c 79 * hash(hashname("name"), i). This is setup automatically
83 * more expensive hashname() only once and the simple hash() several
104 static int hashname(Char *);
207 hashval = hashname(*av);
469 hashval = hash(hashname(str2short(dp->d_name)), i);
497 hashname(Char *cp) function in typeref:typename:int
524 hashval = hashname(name);
  /src/usr.sbin/veriexecgen/
veriexecgen.c 72 const char *hashname; /* algorithm name */ member in struct:hash_t
154 hash_type->hashname);
163 for (hash = hashes; hash->hashname != NULL; hash++)
164 if (strcasecmp(hash_type, hash->hashname) == 0)
416 (void)fprintf(fp, "%s %s %s %s\n", file, hash->hashname,
  /src/usr.bin/vmstat/
vmstat.c 341 const char *histname, *hashname; local in function:main
344 histname = hashname = NULL;
364 hashname = optarg;
508 dohashstat(verbose, todo, hashname);
1935 dohashstat(int verbose, int todo, const char *hashname)
1947 dohashstat_sysctl(verbose, todo, hashname);
1967 if (hashname != NULL) {
1970 hashname) == 0 &&
1976 warnx("%s: no such hash", hashname);
1992 if (hashname != NULL &
    [all...]

Completed in 78 milliseconds