Searched defs:key (Results 1 - 25 of 83) sorted by relevance

1234

/ast/src/cmd/dsslib/ip_t/
H A Dptmatch.c32 Ptprefix_t key; local
34 key.min = key.max = addr;
35 return (Ptprefix_t*)dtsearch(tab->dict, &key);
H A Dptvmatch.c32 Ptvprefix_t key; local
34 key.min = key.max = addr;
35 return (Ptvprefix_t*)dtsearch(tab->dict, &key);
H A Dptopen.c120 Ptprefix_t key; local
123 key.min = key.max = min ? (min - 1) : min;
124 if (!(xp = (Ptprefix_t*)dtsearch(tab->dict, &key)))
125 xp = (Ptprefix_t*)dtnext(tab->dict, &key);
126 key.min = min;
127 key.max = max;
131 if (key.min >= xp->min && key.max <= xp->max)
133 if (key
160 Ptprefix_t key; local
[all...]
H A Dptvopen.c139 Ptvprefix_t key; local
146 key.min = key.max = tab->r[3];
149 key.min = key.max = min;
150 if (!(xp = (Ptvprefix_t*)dtsearch(tab->dict, &key)))
151 xp = (Ptvprefix_t*)dtnext(tab->dict, &key);
152 key.min = min;
153 key.max = max;
157 if (fvcmp(tab->size, key
193 Ptvprefix_t key; local
[all...]
/ast/src/lib/libast/astsa/
H A Daso.c27 asolock(unsigned int volatile* lock, unsigned int key, int type) argument
31 if (key)
37 if (*lock != key)
43 if (*lock != key)
47 *lock = key;
52 *lock = key;
/ast/src/cmd/mailx/port/
H A Ddtrenew.c84 reg char* key; local
113 key = KEY(obj,disc);
114 e->hash = HASH(dt,key,disc);
H A Ddtlist.c86 reg char *key, *k; local
117 key = (char*)obj;
123 key = KEY(obj,disc);
131 if(CMP(dt,key,k,disc) == 0)
H A Ddtmethod.c141 { reg char* key = (char*)OBJ(list,disc); local
142 key = KEY((Void_t*)key,disc);
143 list->hash = HASH(dt,key,disc);
H A Ddtstkq.c175 { reg char *k, *key = KEY(obj,disc); local
178 if(CMP(dt,key,k,disc) == 0)
H A Ddttree.c88 reg char *key, *k; local
133 /* object and key */
135 key = (char*)obj;
141 key = KEY(obj,disc);
150 if((cmp = CMP(dt,key,k,disc)) == 0)
155 if((cmp = CMP(dt,key,k,disc)) <= 0)
171 if((cmp = CMP(dt,key,k,disc)) >= 0)
H A Ddthash.c132 reg char *key, *k; local
178 /* object, key, hash value */
180 key = (char*)obj;
186 key = KEY(obj,disc);
192 { hsh = HASH(dt,key,disc);
201 if(CMP(dt,key,k,disc) == 0)
/ast/src/lib/libast/misc/
H A Dsetenviron.c51 char* key = (char*)akey; local
116 if (!key)
120 t = key;
134 *p = key;
135 return (s = strchr(key, '=')) ? s + 1 : (char*)0;
141 if (!(s = strchr(key, '=')))
145 *p = key;
/ast/src/lib/libcmd/
H A Dpids.c59 key(void* handle, Sffmt_t* fp, const char* arg, char** ps, Sflong_t* pn) function
121 sfkeyprintf(sfstdout, format, format, key, NiL);
H A Dvmstate.c70 key(void* handle, Sffmt_t* fp, const char* arg, char** ps, Sflong_t* pn) function
194 sfkeyprintf(sfstdout, &state, state.format, key, NiL);
/ast/src/lib/librecsort/
H A Drsopen.c45 int rsinit(reg Rs_t* rs, Rsmethod_t* meth, ssize_t c_max, int type, Rskey_t* key) argument
47 int rsinit(rs, meth, c_max, type, key)
52 Rskey_t* key; /* key coder state */
78 rs->key = rs->disc->version < 20111011L ? (Rskey_t*)((char*)rs->disc - sizeof(Rskey_t)) : key;
/ast/src/lib/libast/cdt/
H A Ddtopen.c157 int dtuserlock(Dt_t* dt, unsigned int key, int type) argument
160 return asolock(&dt->data->user.lock, key, ASO_LOCK);
162 return asolock(&dt->data->user.lock, key, ASO_UNLOCK);
163 else return asolock(&dt->data->user.lock, key, ASO_TRYLOCK);
166 Void_t* dtuserdata(Dt_t* dt, Void_t* data, unsigned int key) argument
168 if(key == 0)
170 else if(dtuserlock(dt, key, 1) < 0 )
174 dtuserlock(dt, key, -1);
H A Ddtlist.c172 Void_t *key, *o, *k; local
262 /* define key to match */
264 { key = obj;
267 else key = _DTKEY(disc, obj);
273 { h = NIL(Dtlink_t*); /* track first/last obj with same key */
276 if(_DTCMP(dt, key, k, disc) != 0)
/ast/src/lib/libtksh/tcl/
H A DtclFHandle.c29 FileHashKey key; /* Hash key for a given file. */ member in struct:FileHandle
71 FileHashKey key;
80 key.osHandle = osHandle;
81 key.type = type;
82 entryPtr = Tcl_CreateHashEntry(&fileTable, (char *) &key, &new);
86 newHandlePtr->key = key;
139 entryPtr = Tcl_FindHashEntry(&fileTable, (char *) &handlePtr->key);
176 *typePtr = handlePtr->key
70 FileHashKey key; local
[all...]
/ast/src/lib/libast/comp/
H A Dtsearch.c63 Void_t* key; member in struct:_tree_s
90 { { sizeof(Dtlink_t), -1, /* object is key */
103 Void_t* tsearch(const Void_t* key, Void_t** rootp, argument
106 Void_t* tsearch(key, rootp, comparf)
107 Void_t* key;
122 if(!(o = (Tree_t*)dtmatch(dt,key)) )
125 o->key = (Void_t*)key;
134 return (Void_t*)(&o->key);
139 Void_t* tfind(const Void_t* key, Void_ argument
165 tdelete(const Void_t* key, Void_t** rootp, int(*comparf)(const Void_t*, const Void_t*) ) argument
[all...]
/ast/src/lib/libast/path/
H A Dpathkey.c27 * generate 14 char lookup key for lang path in key
30 * if key==0 then space is malloc'd
44 pathkey(char* key, char* attr, const char* lang, const char* tool, const char* path) argument
46 return pathkey_20100601(lang, tool, path, key, 16, attr, PATH_MAX);
54 pathkey_20100601(const char* lang, const char* tool, const char* apath, char* key, size_t keysize, char* attr, size_t attrsize) argument
75 if (!key)
76 key = buf;
81 k = key;
293 sfsprintf(key, 1
[all...]
H A Dpathtemp.c91 uint32_t key; member in struct:__anon300
108 uint32_t key; local
152 tmp.key = (tmp.seed = (tmp.rng = dir ? (uint32_t)strtoul(dir, NiL, 0) : (uint32_t)1) != 0)? (uint32_t)0x63c63cd9L : 0;
301 if (!tmp.key)
302 tmp.key = (tmp.rng >> 16) | ((tmp.rng & 0xffff) << 16);
303 tmp.rng ^= tmp.key;
317 key = tmp.rng * tmp.key + tv.tv_nsec;
320 tmp.key = tmp.rng * key
[all...]
/ast/src/lib/libast/regex/
H A Dregcache.c87 Key_t key; local
134 for (i = 0; i < sizeof(key) && pattern[i]; i++)
135 ((char*)&key)[i] = pattern[i];
136 for (; i < sizeof(key); i++)
137 ((char*)&key)[i] = 0;
145 else if (*(Key_t*)matchstate.cache[i]->pattern == key && !strcmp(matchstate.cache[i]->pattern, pattern) && matchstate.cache[i]->reflags == reflags)
/ast/src/lib/libcs/
H A Dcsauth.c48 char* key = 0; local
116 messagef((state->id, NiL, -1, "auth: `%-.*s': key write error", n - 1, tmp));
121 messagef((state->id, NiL, -1, "auth: key read error"));
162 key = tmp;
214 if (key) remove(key);
/ast/src/cmd/kshlib/dbm/
H A Ddbm.c195 "\n[ key ]\n"
209 datum key; local
229 if (error_info.errors || (key.dptr = *argv++) && *argv)
240 else if (key.dptr)
242 key.dsize = strlen(key.dptr) + 1;
243 val = dbm_fetch(state.dbm, key);
280 "return the first key in the implementation defined order. If \avalue\a "
283 "\n[ key [ value ] ]\n"
296 datum key; local
[all...]
/ast/src/cmd/tests/cdt/
H A Dtrhbags.c24 long key; member in struct:_obj_s
32 return (int)(o1->key - o2->key);
38 return (unsigned int)(o->key);
56 { Obj[k].key = i;
68 terror("Insert %d,%d", Obj[i].key, Obj[i].ord);
75 count = n = 0; /* count the group of elements with key == 0 */
77 if(o->key == 0)

Completed in 38 milliseconds

1234