Searched refs:key (Results 1 - 25 of 1712) sorted by path

1234567891011>>

/freebsd-9.3-release/bin/pax/
H A Dgetoldopt.c28 static char *key; /* Points to next keyletter */ local
35 if (key == NULL) { /* First time */
38 key = argv[1];
39 if (*key == '-')
48 c = *key++;
50 key--;
H A Dtables.c1234 u_int key = 0; local
1267 key += val;
1279 key += val;
1285 return(key % tabsz);
/freebsd-9.3-release/bin/ps/
H A Dkeyword.c259 VAR *v, key; local
266 key.name = p;
267 v = bsearch(&key, var, sizeof(var)/sizeof(VAR) - 1, sizeof(VAR), vcmp);
/freebsd-9.3-release/bin/sh/
H A Dmksyntax.c245 add_one(const char *key, const char *type) argument
247 fprintf(cfile, "\t[SYNBASE + %s] = %s,\n", key, type);
/freebsd-9.3-release/bin/stty/
H A DMakefile5 SRCS= cchar.c gfmt.c key.c modes.c print.c stty.c util.c
H A Dkey.c32 static char sccsid[] = "@(#)key.c 8.3 (Berkeley) 4/2/94";
69 static struct key { struct
102 return (strcmp(((const struct key *)a)->name, ((const struct key *)b)->name));
109 struct key *kp, tmp;
119 if (!(kp = (struct key *)bsearch(&tmp, keys,
120 sizeof(keys)/sizeof(struct key), sizeof(struct key), c_key)))
/freebsd-9.3-release/cddl/contrib/dtracetoolkit/Bin/
H A Dguess.d49 key = copyin(self->buf, arg0);
50 keys[pos] = *(char *)key;
H A Dwpm.d102 this->key = stringof(copyin(self->buf, arg0));
107 /self->buf && (this->key == " " || this->key == "\n" || this->key == "\r") &&
116 /self->buf && (this->key == " " || this->key == "\n" || this->key == "\r")/
/freebsd-9.3-release/cddl/contrib/dtracetoolkit/Misc/
H A Dguess.d49 key = copyin(self->buf, arg0);
50 keys[pos] = *(char *)key;
H A Dwpm.d102 this->key = stringof(copyin(self->buf, arg0));
107 /self->buf && (this->key == " " || this->key == "\n" || this->key == "\r") &&
116 /self->buf && (this->key == " " || this->key == "\n" || this->key == "\r")/
/freebsd-9.3-release/cddl/contrib/opensolaris/cmd/dtrace/test/cmd/scripts/
H A Ddtest.pl691 foreach $key (keys %results) {
692 my $passed = $results{$key}{"passed"};
693 my $bypassed = $results{$key}{"bypassed"};
694 my $failed = $results{$key}{"failed"};
695 my $total = $results{$key}{"total"};
697 logmsg("\n mode: " . $key . "\n");
/freebsd-9.3-release/cddl/contrib/opensolaris/common/ctf/
H A Dctf_hash.c76 ctf_hash_compute(const char *key, size_t len) argument
79 const char *p, *q = key + len;
82 for (p = key; p < q; p++, n++) {
127 * Wrapper for ctf_hash_lookup/ctf_hash_insert: if the key is already in the
129 * If the key is not present, then call ctf_hash_insert() and hash it in.
145 ctf_hash_lookup(ctf_hash_t *hp, ctf_file_t *fp, const char *key, size_t len) argument
152 ulong_t h = ctf_hash_compute(key, len) % hp->h_nbuckets;
159 if (strncmp(key, str, len) == 0 && str[len] == '\0')
/freebsd-9.3-release/cddl/contrib/opensolaris/lib/libdtrace/common/
H A Ddt_aggregate.c201 * tie and will be resolved based on the key comparison.
278 * tie and will be resolved based on the key comparison.
321 * tie and will be resolved based on the key comparison.
955 * equal. We already know that the key layout is the same for the two
1039 * last entry -- that's the representative key. (The order of
1040 * the bundle is values followed by key to accommodate the
1061 * key comparison from the representative key as the
1255 int rev = dt_revsort, key = dt_keysort, keypos = dt_keypos; local
1278 dt_keysort = key;
[all...]
H A Ddt_ident.c83 argc, iskey ? "key" : "arg", argc == 1 ? " " : "s ",
99 iskey ? "key" : "argument", i + 1,
102 iskey ? "key" : "argument",
154 "used as %s index: key #%d\n",
808 dt_idhash_delete(dt_idhash_t *dhp, dt_ident_t *key) argument
811 ulong_t h = dt_strtab_hash(key->di_name, &len) % dhp->dh_hashsz;
816 if (idp == key)
822 assert(idp == key);
H A Ddt_provider.c362 char *key; local
368 key = dt_probe_key(&pd, alloca(keylen));
375 if ((idp = dt_idhash_lookup(pvp->pv_probes, key)) != NULL)
679 char *key = dt_probe_key(pdp, alloca(keylen)); local
681 if ((idp = dt_idhash_lookup(pvp->pv_probes, key)) != NULL)
H A Ddt_strtab.c123 dt_strtab_hash(const char *key, size_t *len) argument
129 for (p = key; *p != '\0'; p++, n++) {
/freebsd-9.3-release/cddl/contrib/opensolaris/lib/libzfs/common/
H A Dlibzfs_fru.c86 fru_strhash(const char *key) argument
91 for (p = key; *p != '\0'; p++) {
/freebsd-9.3-release/cddl/contrib/opensolaris/lib/pyzfs/common/
H A Dioctl.c134 PyObject *key, *value; local
145 while (PyDict_Next(d, &pos, &key, &value)) {
146 char *keystr = PyString_AsString(key);
148 PyErr_SetObject(PyExc_KeyError, key);
H A Duserspace.py117 key = (isgroup, domain, rid)
120 v = acct[key]
125 acct[key] = v
/freebsd-9.3-release/cddl/contrib/opensolaris/tools/ctf/cvt/
H A Dalist.c180 alist_def_print_cb(void *key, void *value) argument
184 printf("%5lu ", (ulong_t)key);
186 printf("%s\n", (char *)key);
192 printf("%s\n", (char *)key);
H A Dhash.c107 hash_add(hash_t *hash, void *key) argument
109 int bucket = hash->h_hashfn(hash->h_nbuckets, key);
111 list_add(&hash->h_buckets[bucket], key);
135 hash_remove(hash_t *hash, void *key) argument
137 int bucket = hash->h_hashfn(hash->h_nbuckets, key);
139 (void) list_remove(&hash->h_buckets[bucket], key,
144 hash_match(hash_t *hash, void *key, int (*fun)(void *, void *), argument
147 int bucket = hash->h_hashfn(hash->h_nbuckets, key);
169 hash_find_iter(hash_t *hash, void *key, int (*fun)(void *, void *), argument
172 int bucket = hash->h_hashfn(hash->h_nbuckets, key);
198 hash_find(hash_t *hash, void *key, void **value) argument
[all...]
H A Dstrtab.c87 strtab_hash(const char *key, size_t *len) argument
93 for (p = key; *p != '\0'; p++, n++) {
/freebsd-9.3-release/contrib/amd/amd/
H A Dam_ops.c374 ops_match(am_opts *fo, char *key, char *g_key, char *path, char *keym, char *map) argument
382 if (!eval_fs_opts(fo, key, g_key, path, keym, map)) {
385 plog(XLOG_USER, "No fs type specified (key = \"%s\", map = \"%s\")", keym, map);
H A Damd.h338 char *key; member in struct:kv
H A Dautil.c151 valid_key(char *key) argument
153 while (*key)
154 if (strchr(invalid_keys, *key++))

Completed in 259 milliseconds

1234567891011>>