Searched defs:table (Results 1 - 25 of 27) sorted by relevance

12

/ast/src/lib/libast/string/
H A Dfmtint.c31 static const char table[]= variable
112 memcpy(buff+k,table+3*m,3);
/ast/src/cmd/nmake/
H A DTABLE.mk2 * table ... :TABLE: [class=name] [format={lower,upper}]
6 * if map==1 then do $(.TABLE.MAP. $(table) [name=name]) otherwise
7 * define variables in table name of the form [(class|table)_]name=1[value]
10 * set TABLE.list=1 or TABLE.list.name=1 to list the table variables
18 local table=$(I) class format ignore map name novariables options list state $(~$(I)) $(>)
24 : $(.TABLE.MAP. $(table) $(name))
26 if TABLE.list || "$(TABLE.list.$(table))"
30 class := $(table)_
48 table macro
[all...]
H A Dmain.c133 * 14 hash table usage
179 * 0x00000020 force external archive table of contents generation
217 Tables_t table; /* hash table info */ variable
413 hashclear(table.var, HASH_ALLOCATE);
419 hashset(table.var, HASH_ALLOCATE);
H A Doption.c61 static Option_t options[] = /* option table */
320 Hash_table_t* table; member in struct:Optstate_s
334 if (!(op = (Option_t*)hashget(opt.table, name)) && (strchr(name, '-') || strchr(name, '_')))
339 op = (Option_t*)hashget(opt.table, sfstruse(internal.tmp));
351 hashput(opt.table, op->name, (char*)op);
358 hashput(opt.table, strdup(sfstruse(internal.tmp)), (char*)op);
368 hashput(opt.table, strdup(buf), (char*)op);
372 hashput(opt.table, strdup(buf), (char*)op);
377 * initialize the option hash table
385 opt.table
[all...]
/ast/src/lib/libexpr/
H A Dexcc.c541 global(Dt_t* table, void* object, void* handle) argument
/ast/src/cmd/paxlib/calib/
H A Dcamap.c55 tr(int in, int out, const char *header, const unsigned char *table) argument
75 *cp = table[*cp];
87 unsigned char table[256]; local
104 table[n] = n;
118 table[m] = n;
128 r = tr(in,out,header,table);
/ast/src/lib/libz/
H A Dinftrees.c22 The code lengths are lens[0..codes-1]. The result starts at *table,
26 -1 is an invalid code, and +1 means that ENOUGH isn't enough. table
28 requested root table index bits, and on return it is the actual root
29 table index bits. It will differ if the request is greater than the
35 code FAR * FAR *table, unsigned FAR *bits, unsigned short FAR *work)
37 int inflate_table(type, lens, codes, table, bits, work)
41 code FAR * FAR *table;
49 unsigned root; /* number of index bits for root table */
50 unsigned curr; /* number of index bits for current table */
51 unsigned drop; /* code bits to drop for sub-table */
34 inflate_table(codetype type, unsigned short FAR *lens, unsigned codes, code FAR * FAR *table, unsigned FAR *bits, unsigned short FAR *work) argument
[all...]
H A Dzutil.c208 local ptr_table table[MAX_PTR]; variable
209 /* This table is used to remember the original form of pointers
211 * Since ZLIB_MSDOS is not a preemptive multitasking OS, this table is not
231 table[next_ptr].org_ptr = buf;
236 table[next_ptr++].new_ptr = buf;
249 if (ptr != table[n].new_ptr) continue;
251 farfree(table[n].org_ptr);
253 table[n-1] = table[n];
/ast/src/lib/libtk/generic/
H A DtkImgGIF.c533 static int table[2][(1<< MAX_LWZ_BITS)];
552 table[0][i] = 0;
553 table[1][i] = i;
556 table[0][i] = table[1][0] = 0;
578 table[0][i] = 0;
579 table[1][i] = i;
583 table[0][i] = table[1][i] = 0;
615 *sp++ = table[
530 static int table[2][(1<< MAX_LWZ_BITS)]; local
[all...]
/ast/src/cmd/ksh93/sh/
H A Dstring.c46 * <table> is searched for string <sp> and corresponding value is returned
50 const Shtable_t *sh_locate(register const char *sp,const Shtable_t *table,int size) argument
58 tp=table;
H A Dnvtree.c39 Namval_t *table; member in struct:nvdir
165 dp->table = sh.last_table;
180 dp->table = sh.last_table;
245 dp->table = np;
295 if(dp->table && dp->otable && !nv_isattr(dp->table,NV_MINIMAL))
297 sptr = dp->table->nvenv;
298 dp->table->nvenv = (char*)dp->otable;
301 sh.last_table = dp->table;
304 if(dp->table
[all...]
H A Dnvdisc.c1268 struct table struct
1278 struct table *tp = (struct table *)fp;
1287 struct table *tp = (struct table *)fp;
1294 struct table *tp = (struct table*)fp;
1295 struct table *ntp = (struct table*)nv_clone_disc(fp,0);
1299 memcpy((void*)ntp,(void*)fp,sizeof(struct table));
[all...]
H A Dparse.c169 static unsigned char *table; local
172 if(!table)
174 table = calloc(1,256);
176 table[c] = 1;
178 table[c] = 2;
180 table[c] = 3;
182 for(cp=(unsigned char*)str; c= *cp++; n=table[c])
184 if(table[c] < n)
H A Dname.c583 nr.table = shp->last_table;
1172 if(n && ap && !ap->table)
1173 ap->table = dtopen(&_Nvdisc,Dtoset);
1174 if(ap && ap->table && (nq=nv_search(sub,ap->table,n)))
3336 if(!ap->table)
3337 ap->table = dtopen(&_Nvdisc,Dtoset);
3338 if(ap->table)
3339 mp = nv_search(nv_getsub(np),ap->table,NV_ADD);
3481 np->nvalue.nrp->table
3635 register Namval_t *table; local
[all...]
/ast/src/cmd/codexlib/lzd/
H A Dlzd.c56 Table_t table[MAXMAX]; member in struct:State_s
116 state->table[state->free_code].z_ch = suf_code;
117 state->table[state->free_code].next = old_code;
198 push(state, state->table[c].z_ch);
199 c = state->table[c].next;
/ast/src/lib/libvcodex/Vcdelta/
H A Dvcdhdr.h81 Vcdtable_t* table; /* code table for compression */ member in struct:_vcdiff_s
96 (vcd)->table = NIL(Vcdtable_t*), \
/ast/src/lib/libvdelta/vd01/
H A Dvddelta01.c51 int size; /* size of hash table */
52 Match_t** table; /* hash table */ member in struct:_table_s
172 reg Match_t *base = tab->base, **table = tab->table; local
193 { if(!(m = table[key&size]) )
283 if(!(m = table[n]) )
289 table[n] = curm++;
341 tab.table = NIL(Match_t**);
373 /* space for the hash table element
[all...]
/ast/src/lib/libdss/
H A Dtag.c33 * read table data from following lines in the current file
36 * the first line of the header section defines the table tag
42 * <!- external header and table -!>
46 * <!- inline header external table -!>
52 * <!- inline header and table -!>
282 * table data builtin
286 table(Tag_t* tag, Tagframe_t* fp, Tags_t* cp, Tags_t* tags, Tagdisc_t* disc) function
415 "#TABLE#", "Read delimited table data.",
416 0,(Tagbeg_f)table,0,0,
H A Dcxopen.c39 static Cxtable_t table; variable
988 cx->table = &table;
1257 (*disc->errorf)(NiL, disc, 2, "%s: no member table", type->name);
2288 table.opcode['+'] = CX_ADD;
2289 table.opcode['&'] = CX_AND;
2290 table.opcode['/'] = CX_DIV;
2291 table.opcode['>'] = CX_GT;
2292 table.opcode['~'] = CX_INV;
2293 table
[all...]
/ast/src/lib/libast/include/
H A Dhash.h27 * hash table library interface definitions
36 #define HASH_FIXED (1L<<1) /* fixed table size */
38 #define HASH_RESIZE (1L<<2) /* table has been resized */
41 #define HASH_STATIC (1L<<5) /* static table allocation */
152 Hash_table_t* table; /* last lookup table */ member in struct:__anon270
159 struct Hash_root /* root hash table information */
171 struct Hash_table /* hash table information */
173 Hash_root_t* root; /* root hash table information */
174 int size; /* table siz
[all...]
/ast/src/cmd/ksh93/include/
H A Dname.h89 Namval_t *table; member in struct:Namref
163 #define nv_reftable(n) ((n)->nvalue.nrp->table)
H A Dnval.h96 Dt_t *table; /* for subscripts */ member in struct:Namarray
147 #define NV_TABLE 0x800 /* node is a dictionary table */
/ast/src/cmd/at/
H A Datd.c149 } table; member in struct:__anon39
202 if (!(usr = name ? (User_t*)dtmatch(state->table.user.handle, name) : (User_t*)dtmatch(state->table.uid.handle, &uid)))
231 dtinsert(state->table.user.handle, usr);
232 dtinsert(state->table.uid.handle, usr);
294 if (!(que = (Queue_t*)dtmatch(state->table.queue.handle, s)))
304 que = (Queue_t*)dtinsert(state->table.queue.handle, que);
308 if (!que->owner && !(que->owner = dtopen(&state->table.owner.discipline, Dtset)))
418 for (que = (Queue_t*)dtfirst(state->table.queue.handle); que && que->specific; que = (Queue_t*)dtnext(state->table
[all...]
/ast/src/cmd/3d/
H A D3d.h230 #define TABLE_MAX (1<<(TABBITS+7))/* max 3d table image size */
234 #define TABBITS 5 /* max vpath,vmap table index bits (<6) */
377 Map_t table[TABSIZE]; member in struct:__anon4
392 Table_t* table; member in struct:__anon5
499 } table; member in struct:__anon7
/ast/src/cmd/codexlib/lzh/
H A Dlzh.c148 make_table(State_t* state, int nchar, ui1* bitlen, int tablebits, ui2* table, ui4 tablesize) argument
192 (*state->codex->disc->errorf)(NiL, state->codex->disc, 2, "%s: invalid compression table", state->codex->meth->name);
196 /* shift data for make table. */
211 table[i] = 0;
213 /* create table and tree */
227 (*state->codex->disc->errorf)(NiL, state->codex->disc, 2, "%s: compression table overflow", state->codex->meth->name);
231 /* code in table */
234 table[i++] = j;
238 /* code not in table */
240 p = &table[
[all...]

Completed in 55 milliseconds

12