/ast/src/lib/libast/aso/ |
H A D | asolock.c | 33 asolock(unsigned int volatile* lock, unsigned int key, int type) 37 if (key) 41 return *lock == 0 ? 0 : asocasint(lock, key, 0) == key ? 0 : -1; 43 return *lock == key ? 0 : asocasint(lock, 0, key) == 0 ? 0 : -1; 45 if (*lock == key) 49 for (k = 0; asocasint(lock, 0, key) != 0; ASOLOOP(k));
|
/ast/src/cmd/dsslib/ip_t/ |
H A D | ptmatch.c | 32 Ptprefix_t key; local 34 key.min = key.max = addr; 35 return (Ptprefix_t*)dtsearch(tab->dict, &key);
|
H A D | ptvmatch.c | 32 Ptvprefix_t key; local 34 key.min = key.max = addr; 35 return (Ptvprefix_t*)dtsearch(tab->dict, &key);
|
H A D | ptopen.c | 120 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 D | ptvopen.c | 139 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 D | aso.c | 27 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/3d/ |
H A D | lib.c | 203 * return 6 char lower case hash of key 204 * end is end of key string 206 * state.key.value is set to key value 207 * if `no<key>' then state.key.invert gets value and state.key.value="" 208 * otherwise state.key.invert=0 209 * state.key.next is set to next key i 213 getkey(register const char* key, register const char* end, int alt) argument 341 search(Table_t* tab, const char* key, int keysize, const char* val, int valsize) argument [all...] |
/ast/src/lib/libtksh/tcl/ |
H A D | tclFHandle.c | 29 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...] |
H A D | tclHash.c | 42 char *key)); 44 char *key, int *newPtr)); 46 char *key)); 48 char *key, int *newPtr)); 52 char *key)); 54 char *key, int *newPtr)); 56 char *key)); 58 char *key, int *newPtr)); 416 * Given a hash table with string keys, and a string key, find 417 * the entry with a matching key [all...] |
/ast/src/cmd/sort/ |
H A D | main.c | 33 * key coders 46 "[+?The default sort key is an entire line. Default ordering is " 53 "[k:key?Restrict the sort key to a string beginning at \apos1\a and " 58 "are present they override all the global ordering options for this key. " 187 "[+keys?List the canonical key for each record.]" 204 "instead of last character of the key. A missing character count in " 206 "the end of the key. Thus +1 -1.3 is the same as \b-k\b 2,2.3 and +1r -3 " 287 Rskey_t* key; /* rskeyopen() context */ member in struct:Sort_s 468 register Rskey_t* key local 819 dumpkey(Rs_t* rs, unsigned char* dat, size_t datlen, unsigned char* key, size_t keylen, Rsdisc_t* disc) argument 846 register Rskey_t* key; local [all...] |
/ast/src/cmd/tests/cdt/ |
H A D | tbags.c | 24 long key; member in struct:_obj_s 32 return (int)(o1->key - o2->key); 38 return (unsigned int)(o->key/8); /* cause hash collisions */ 46 sprintf(buf,"%ld,%ld", obj->key, obj->ord); 67 { Obj[i+k].key = i; 106 terror("%s: dtappend (key=%d,ord=%d) failed", name, obj->key, obj->ord); 109 mid = ((N_OBJ/R_OBJ)/2) * R_OBJ; /* key for middle group */ 110 proto.key [all...] |
H A D | trhbags.c | 24 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)
|
/ast/src/lib/libast/comp/ |
H A D | conf.sh | 270 *VERSION*)key=${standard}${section} ;; 271 *) key= ;; 273 case $key in 274 ''|*_) key=${key}${name} ;; 275 *) key=${key}_${name} ;; 277 eval sys='$'CONF_call_${key} 285 key=${sys}_${key} [all...] |
H A D | tsearch.c | 63 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/cmd/sortlib/glean/ |
H A D | glean.c | 32 "sort key. If there is no main sort key then all records are in one " 33 "category. If the \bmin\b key sorts less than the current category " 34 "minimum or if the \bmax\b key sorts greater than the category maximum " 39 "key \ak1\a and the second using sort key \ak2\a.]" 47 "[m:min?Mimima \bsort\b(1) key specification.]:[sort-key]" 48 "[M:max?Maxima \bsort\b(1) key specification.]:[sort-key]" 79 Data_t key; member in struct:Category_s 106 Data_t key; member in struct:State_s 274 rs_disc(Rskey_t* key, const char* options) argument [all...] |
/ast/src/lib/libast/misc/ |
H A D | setenviron.c | 51 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/cmd/kshlib/dbm_t/ |
H A D | dbm_t.c | 34 "option adds a trailing NUL to each key.]" 41 "[z:zero?When used with \b-c\b, a \b\\0\b byte is appended to each key.]" 66 datum key; member in struct:dbm_array 107 if(((char*)ap->key.dptr)[ap->key.dsize-ap->addzero]) 109 ap->namlen = check_size(&ap->name,ap->namlen, ap->key.dsize); 110 memcpy(ap->name,ap->key.dptr,ap->key.dsize); 111 ap->name[ap->key.dsize] = 0; 115 ap->node.nvname = ap->key [all...] |
/ast/src/cmd/cs/ |
H A D | dbm.c | 33 * get key return value for key 34 * next [``value''] return next key in scan with optional value 36 * put key [value] put [delete] value for key 153 datum key; local 163 while (tokscan(nxt, &nxt, " %s %s %s", &cmd, &key.dptr, &val.dptr) > 0) 165 key.dsize = strlen(key.dptr) + 1; 173 n = sfsprintf(ret, sizeof(ret), "I closed\n", key [all...] |
/ast/src/lib/librecsort/ |
H A D | rs-verify.c | 55 { k = obj->data; obj->data = obj->key; obj->key = k; 58 k = p->data; p->data = p->key; p->key = k; 64 k = obj->data; obj->data = obj->key; obj->key = k; 66 k = p->data; p->data = p->key; p->key = k; 95 { if(rs->disc->defkeyf && obj->key) 96 vmfree(rs->vm,obj->key); [all...] |
/ast/src/cmd/cs/vcs_src/ |
H A D | ifs_func.c | 30 char *key; member in struct:DataEntry 97 DataEntryInsert( fpath, key, data, len ) 99 char *key; 107 strcmp( ent->key, key ) == 0 ) { 118 ent->key = strdup( key ); 129 DataEntryDelete( fpath, key ) 131 char *key; 138 strcmp( ent->key, ke [all...] |
/ast/src/cmd/std/ |
H A D | locale.c | 577 list_locale(Sfio_t* sp, Keyword_t* key, Lc_t* lc, unsigned int flags) argument 597 if (key) 606 sfprintf(sp, "%s=", key->name); 625 * print the numeric value i for key 629 number(Sfio_t* sp, register Keyword_t* key, int i, unsigned int flags) argument 635 sfprintf(sp, "%s=%d\n", key->name, i); 688 * print the string value(s) v[n] for key 692 string(Sfio_t* sp, register Keyword_t* key, char** v, int n, unsigned int flags) argument 700 sfprintf(sp, "%s=", key->name); 727 * extact and list info for key wit 731 extract(Sfio_t* sp, register Keyword_t* key, void* data, unsigned int flags) argument 857 list_keyword(Sfio_t* sp, register Keyword_t* key, char* value, unsigned int flags) argument 961 scan(Sfio_t* sp, Keyword_t* key, unsigned long flags) argument 999 Keyword_t* key; local [all...] |
/ast/src/lib/libast/path/ |
H A D | pathtemp.c | 91 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...] |
H A D | pathkey.c | 27 * 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...] |
/ast/src/cmd/kshlib/dbm/ |
H A D | dbm.c | 195 "\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/coshell/ |
H A D | event.c | 141 #define KEY_MAX 64 /* max key length + 1 */ 412 * apply request r to one key 416 apply(State_t* state, Connection_t* con, int id, int index, datum key, datum val, Data_t* dat) argument 428 if (!(n = dbm_store(state->dbm, key, val, DBM_INSERT)) || n > 0 && !dbm_store(state->dbm, key, val, DBM_REPLACE)) 429 log(state, con, 'L', "%s cleared", key.dptr); 431 log(state, con, 'W', "%s unchanged", key.dptr); 435 log(state, con, 'E', "%s io error", key.dptr); 439 if (!dbm_delete(state->dbm, key)) 441 log(state, con, 'L', "%s deleted", key 551 datum key; local 617 datum key; local 664 datum key; local 1005 datum key; local [all...] |