| /plan9/sys/src/cmd/tbl/ |
| H A D | t5.c | 36 table[nlin] = (struct colstr *) alocv((ncol + 2) * sizeof(table[0][0])); in gettbl()
38 table[nlin][icol].rcol = ""; in gettbl()
39 table[nlin][icol].col = ""; in gettbl()
46 table[nlin] = (struct colstr *) alocv((ncol + 2) * sizeof(table[0][0])); in gettbl()
59 table[nlin][icol].col = cstore; in gettbl()
60 table[nlin][icol].rcol = 0; in gettbl()
63 table[nlin][icol].col = in gettbl()
74 table[nlin][icol].rcol = maknew(table[nlin][icol].col); in gettbl()
77 table[nlin][icol].rcol = table[nlin][icol].col; in gettbl()
78 table[nlin][icol].col = ""; in gettbl()
[all …]
|
| H A D | t9.c | 8 for (useln = 0; useln < MAXLIN && table[useln] == 0; useln++) in yetmore()
12 table[0] = table[useln]; in yetmore()
49 table[0][icol].col = dataln; in domore()
50 table[0][icol].rcol = 0; in domore()
56 table[0][icol].rcol = maknew(table[0][icol].col); in domore()
59 table[0][icol].rcol = table[0][icol].col; in domore()
60 table[0][icol].col = ""; in domore()
64 table[0][++icol].col = ""; in domore()
69 table[0][icol].col = ""; in domore()
|
| H A D | t8.c | 3 # define realsplit ((ct=='a'||ct=='n') && table[nl][c].rcol)
23 ss = table[nl][c].col; in putline()
28 ss = table[ip][c].col; in putline()
60 if (vspen(table[nl][c].col)) in putline()
63 if (vspen(table[lf][c].col)) in putline()
73 ss = table[nl][c].col; in putline()
82 if (lf >= 0 && vspen(table[lf][c].col)) in putline()
115 for (lf = prev(nl); lf >= 0 && vspen(table[lf][c].col); lf = prev(lf)) in putline()
122 if (form == 'n' && table[nl][c].rcol && lused[c] == 0) in putline()
126 ss = table[nl][c].col; in putline()
[all …]
|
| H A D | tb.c | 18 rused[c] |= real(table[i][c].rcol); in checkuse()
19 if ( !real(table[i][c].rcol)) in checkuse()
20 used[c] |= real(table[i][c].col); in checkuse()
21 if (table[i][c].rcol) in checkuse()
22 lused[c] |= real(table[i][c].col); in checkuse()
24 used[c] |= real(table[i][c].col); in checkuse()
|
| H A D | t6.c | 26 for (il = prev(ilin); il >= 0 && vspen(table[il][icol].col); il = prev(il)) in maktab()
30 if (filler(table[ilin][icol].col)) in maktab()
37 ss = table[ilin][icol].col; in maktab()
48 if (table[ilin][icol].rcol != 0) { in maktab()
53 if (real(ss = table[ilin][icol].col) && !vspen(ss)) { in maktab()
63 if (text == 0 && real(ss = table[ilin][icol].rcol) && !vspen(ss) && !barent(ss)) { in maktab()
74 if (real(ss = table[ilin][icol].col) && !vspen(ss)) { in maktab()
106 ss = table[ilin][icol-k].col; in maktab()
110 wide(table[ilin][icol-k].col, FN(ilin, icol - k), SZ(ilin, icol - k)); in maktab()
|
| /plan9/sys/src/libsec/port/ |
| H A D | thumb.c | 25 freeThumbprints(Thumbprint *table) in freeThumbprints() argument
28 for(hd = table; hd < table+ThumbTab; hd++){ in freeThumbprints()
34 free(table); in freeThumbprints()
38 okThumbprint(uchar *sum, Thumbprint *table) in okThumbprint() argument
43 for(p = table[i].next; p; p = p->next) in okThumbprint()
50 loadThumbprints(char *file, Thumbprint *table, Thumbprint *crltab) in loadThumbprints() argument
65 loadThumbprints(field[1], table, crltab); in loadThumbprints()
77 entry->next = table[i].next; in loadThumbprints()
78 table[i].next = entry; in loadThumbprints()
86 Thumbprint *table, *crltab = nil; in initThumbprints() local
[all …]
|
| /plan9/sys/src/cmd/unix/drawterm/libsec/ |
| H A D | thumb.c | 25 freeThumbprints(Thumbprint *table) in freeThumbprints() argument
28 for(hd = table; hd < table+ThumbTab; hd++){ in freeThumbprints()
34 free(table); in freeThumbprints()
38 okThumbprint(uchar *sum, Thumbprint *table) in okThumbprint() argument
43 for(p = table[i].next; p; p = p->next) in okThumbprint()
50 loadThumbprints(char *file, Thumbprint *table, Thumbprint *crltab) in loadThumbprints() argument
65 loadThumbprints(field[1], table, crltab); in loadThumbprints()
77 entry->next = table[i].next; in loadThumbprints()
78 table[i].next = entry; in loadThumbprints()
86 Thumbprint *table, *crltab = nil; in initThumbprints() local
[all …]
|
| /plan9/sys/src/cmd/gs/src/ |
| H A D | slzwe.c | 83 lzw_encode_table *table = ss->table.encode; in lzw_reset_encode() local
88 table->hashed[c] = code_eod; in lzw_reset_encode()
90 { lzw_encode *ec = &table->encode[c]; in lzw_reset_encode()
91 register ushort *tc = &table->hashed[encode_hash(code_eod, c)]; in lzw_reset_encode()
93 if ( ++tc == &table->hashed[hash_size] ) in lzw_reset_encode()
94 tc = &table->hashed[0]; in lzw_reset_encode()
98 table->encode[code_eod].prefix = code_reset; /* guarantee no match */ in lzw_reset_encode()
107 ss->table.encode = gs_alloc_struct(st->memory, in s_LZWE_init()
109 if ( ss->table.encode == 0 ) in s_LZWE_init()
125 lzw_encode_table *table = ss->table.encode; in s_LZWE_process() local
[all …]
|
| H A D | gp_macio.c | 717 fond_table *table = malloc(sizeof(fond_table)); in fond_table_new() local
718 if (table != NULL) { in fond_table_new()
719 table->entries = entries; in fond_table_new()
720 table->refs = malloc(entries * sizeof(fond_entry)); in fond_table_new()
721 if (table->refs == NULL) { free(table); table = NULL; } in fond_table_new()
723 return table; in fond_table_new()
726 static void fond_table_free(fond_table *table) in fond_table_free() argument
728 if (table != NULL) { in fond_table_free()
729 if (table->refs) free(table->refs); in fond_table_free()
730 free(table); in fond_table_free()
[all …]
|
| H A D | slzwd.c | 56 register lzw_decode *dc = ss->table.decode; in s_LZWD_reset()
84 ss->table.decode = dc; in s_LZWD_init()
115 lzw_decode *table = ss->table.decode; /* constant pointer */ in s_LZWD_process() local
116 lzw_decode *dc_next = table + next_code; /* invariant */ in s_LZWD_process()
146 c = table[c].prefix, in s_LZWD_process()
151 *q1-- = (dc = &table[c])->datum; in s_LZWD_process()
165 for (; c != eod; c = table[c].prefix) in s_LZWD_process()
255 for (c = prev_code; c != eod; c = table[c].prefix) in s_LZWD_process()
265 len = table[code].len; in s_LZWD_process()
273 dc_next = table + code_0; in s_LZWD_process()
[all …]
|
| H A D | gxctable.c | 36 const gs_const_string *table = pclt->table; in gx_color_interpolate_nearest() local
39 table += fixed2int_var_rounded(pi[0]) * pdim[1]; in gx_color_interpolate_nearest()
45 const byte *p = pclt->table[ia].data + (ib * pdim[2] + ic) * m; in gx_color_interpolate_nearest()
74 clt3.table = pclt->table + ix * pdim[1]; in interpolate_accum()
78 clt3.table += pdim[1]; in interpolate_accum()
91 const byte *pa0 = pclt->table[ia].data + dbc; in interpolate_accum()
93 (ia == pdim[0] - 1 ? pa0 : pclt->table[ia + 1].data + dbc); in interpolate_accum()
|
| H A D | gsiodev.c | 69 gx_io_device **table = in gs_iodev_init() local
76 if (table == 0) in gs_iodev_init()
85 table[i] = iodev; in gs_iodev_init()
86 memcpy(table[i], gx_io_device_table[i], sizeof(gx_io_device)); in gs_iodev_init()
88 io_device_table = table; in gs_iodev_init()
95 if ((code = (table[j]->procs.init)(table[j], mem)) < 0) in gs_iodev_init()
103 gs_free_object(mem, table[i - 1], "gs_iodev_init(iodev)"); in gs_iodev_init()
104 gs_free_object(mem, table, "gs_iodev_init(table)"); in gs_iodev_init()
|
| H A D | gscrdp.c | 189 if (pcrd->RenderTable.lookup.table) { in param_put_cie_render1()
203 gs_param_string *table = in param_put_cie_render1() local
209 if (size == 0 || table == 0) in param_put_cie_render1()
225 table[a].data = pcrd->RenderTable.lookup.table[a].data, in param_put_cie_render1()
226 table[a].size = pcrd->RenderTable.lookup.table[a].size, in param_put_cie_render1()
227 table[a].persistent = true; in param_put_cie_render1()
228 sa.data = table; in param_put_cie_render1()
261 gs_free_object(mem, table, "RenderTableTable"); in param_put_cie_render1()
568 if (pcrd->RenderTable.lookup.table) { in param_get_cie_render1()
570 (void *)pcrd->RenderTable.lookup.table, /* break const */ in param_get_cie_render1()
[all …]
|
| H A D | gxsamplp.h | 31 # define NEXT_MAP map = smap[++smap_index % num_components_per_plane].table.lookup4x1to32
32 # define NEXT_MAP8 map = smap[++smap_index % num_components_per_plane].table.lookup8
45 const sample_lookup_t * ptab = &smap->table; in TEMPLATE_sample_unpack_1()
117 # define NEXT_MAP map = smap[++smap_index % num_components_per_plane].table.lookup2x2to16
127 const sample_lookup_t * ptab = &smap->table; in TEMPLATE_sample_unpack_2()
176 const sample_lookup_t * ptab = &smap->table; in TEMPLATE_sample_unpack_4()
202 const sample_lookup_t * ptab = &smap->table; in TEMPLATE_sample_unpack_8()
|
| H A D | gscolor2.c | 199 return ENUM_CONST_STRING2(pcs->params.indexed.lookup.table.data,
210 gs_const_string table; in RELOC_PTRS_WITH() local
212 table.data = pcs->params.indexed.lookup.table.data; in RELOC_PTRS_WITH()
213 table.size = indexed_table_size(pcs); in RELOC_PTRS_WITH()
214 RELOC_CONST_STRING_VAR(table); in RELOC_PTRS_WITH()
215 pcs->params.indexed.lookup.table.data = table.data; in RELOC_PTRS_WITH()
371 pindexed->lookup.table = *ptbl; in gs_cspace_build_Indexed()
479 const byte *pcomp = pip->lookup.table.data + m * index; in gs_cspace_indexed_lookup()
530 code = sputs(s, (const byte *)&p->lookup.table.size, in gx_serialize_Indexed()
531 sizeof(p->lookup.table.size), &n); in gx_serialize_Indexed()
[all …]
|
| /plan9/sys/src/cmd/gs/zlib/ |
| H A D | inftrees.c | 32 int inflate_table(type, lens, codes, table, bits, work) in inflate_table() argument
36 code FAR * FAR *table;
121 *(*table)++ = this; /* make a table to force an error */
122 *(*table)++ = this;
204 next = *table; /* current table to fill in */
284 (*table)[low].op = (unsigned char)curr;
285 (*table)[low].bits = (unsigned char)root;
286 (*table)[low].val = (unsigned short)(next - *table);
305 next = *table;
325 *table += used;
|
| H A D | algorithm.txt | 21 Duplicated strings are found using a hash table. All input strings of
22 length 3 are inserted in the hash table. A hash index is computed for
53 are inserted in the hash table only when no match was found, or
67 inflate() sets up a first level table that covers some number of bits of
69 stream, and looks it up in the table. The table will tell if the next
71 the value, else it will point to the next level table for which inflate()
75 takes to decode and the time it takes to build the table. If building the
76 table took no time (and if you had infinite memory), then there would only
77 be a first level table to cover all the way to the longest code. However,
78 building the table ends up taking a lot longer for more bits since short
[all …]
|
| H A D | zutil.c | 209 local ptr_table table[MAX_PTR]; variable
232 table[next_ptr].org_ptr = buf; in zcalloc()
237 table[next_ptr++].new_ptr = buf; in zcalloc()
250 if (ptr != table[n].new_ptr) continue; in zcfree()
252 farfree(table[n].org_ptr); in zcfree()
254 table[n-1] = table[n]; in zcfree()
|
| /plan9/sys/src/ape/cmd/pdksh/ |
| H A D | table.h | 7 struct table { struct
114 struct table vars; /* local variables */
115 struct table funs; /* local functions */
138 EXTERN struct table taliases; /* tracked aliases */
139 EXTERN struct table builtins; /* built-in commands */
140 EXTERN struct table aliases; /* aliases */
141 EXTERN struct table keywords; /* keywords */
142 EXTERN struct table homedirs; /* homedir() cache */
|
| H A D | table.c | 9 static void texpand ARGS((struct table *tp, int nsize));
26 register struct table *tp; in tinit()
39 register struct table *tp; in texpand()
73 register struct table *tp; /* table */ in tsearch()
96 register struct table *tp; /* table */ in tenter()
146 struct table *tp;
173 register struct table *tp; in tsort()
193 void tprintinfo ARGS((struct table *tp));
197 struct table *tp; in tprintinfo()
|
| /plan9/sys/src/9/pcboot/ |
| H A D | mmu.c | 497 ulong *table; in mmuwalk() local
500 table = &pdb[PDX(va)]; in mmuwalk()
501 if(!(*table & PTEVALID) && create == 0) in mmuwalk()
510 return table; in mmuwalk()
513 if(*table & PTESIZE) in mmuwalk()
514 panic("mmuwalk2: va %luX entry %luX", va, *table); in mmuwalk()
515 if(!(*table & PTEVALID)){ in mmuwalk()
527 *table = PADDR(map)|PTEWRITE|PTEVALID; in mmuwalk()
529 table = KADDR(PPN(*table)); in mmuwalk()
530 return &table[PTX(va)]; in mmuwalk()
[all …]
|
| /plan9/sys/src/9/pc/ |
| H A D | mmu.c | 488 ulong *table; in mmuwalk() local
491 table = &pdb[PDX(va)]; in mmuwalk()
492 if(!(*table & PTEVALID) && create == 0) in mmuwalk()
501 return table; in mmuwalk()
504 if(*table & PTESIZE) in mmuwalk()
505 panic("mmuwalk2: va %luX entry %luX", va, *table); in mmuwalk()
506 if(!(*table & PTEVALID)){ in mmuwalk()
518 *table = PADDR(map)|PTEWRITE|PTEVALID; in mmuwalk()
520 table = KADDR(PPN(*table)); in mmuwalk()
521 return &table[PTX(va)]; in mmuwalk()
[all …]
|
| /plan9/sys/src/cmd/ |
| H A D | primes.c | 23 uchar table[1000]; variable
32 tabsiz = nelem(table),
121 table[i] = 0; in main()
140 if(table[i>>3] & bittab[i&07]) in main()
164 table[j>>3] |= bittab[j&07]; in mark()
|
| /plan9/sys/src/cmd/disk/prep/ |
| H A D | fdisk.c | 277 Table table; member
456 if(diskwrite(edit->disk, &rtab[i].table, Tablesz, rtab[i].lba, Toffset) < 0) in recover()
494 Table table; in rdpart() local
501 diskread(edit->disk, &table, Tablesz, mbroffset+lba, Toffset); in rdpart()
502 addrecover(table, mbroffset+lba); in rdpart()
504 if(table.magic[0] != Magic0 || table.magic[1] != Magic1) { in rdpart()
509 for(tp=table.entry, ep=tp+NTentry; tp<ep && npart < Mpart; tp++) { in rdpart()
536 Table table; in findmbr() local
539 diskread(edit->disk, &table, Tablesz, 0, Toffset); in findmbr()
540 if(table.magic[0] != Magic0 || table.magic[1] != Magic1) in findmbr()
[all …]
|
| /plan9/sys/src/cmd/venti/srv/ |
| H A D | cmparenas.c | 215 char *table; in readap() local
225 table = malloc(ap->tabsize+1); in readap()
226 if(preadblock(fd, (uchar*)table, ap->tabsize, ap->tabbase) < 0) in readap()
228 table[ap->tabsize] = 0; in readap()
229 return table; in readap()
236 char *p, *q, *table, *table1, *f[10], line[256]; in threadmain() local
268 table = readap(fd, &ap); in threadmain()
270 if(strcmp(table, table1) != 0) in threadmain()
273 nline = atoi(table); in threadmain()
274 p = strchr(table, '\n'); in threadmain()
|