Lines Matching refs:part
3 * This software is part of the ast package *
44 Vcchar_t size; /* Huffman code size in part */
52 ssize_t ptsz; /* actual part size */
54 Vcchar_t* part; /* table index for each part */
56 ssize_t* ppos; /* position of part[] in objs[] */
57 ssize_t* sort; /* for sorting part positions */
152 if(grp->part)
153 free(grp->part);
154 if(!(grp->part = (Vcchar_t*)calloc(2*npts, sizeof(Vcchar_t))) )
156 grp->work = grp->part + npts;
240 Vcchar_t *part = grp->part, *work = grp->work;
322 /* find the table best matching this part */
354 if(p < ntbl) /* tables were moved, reset part indexes */
399 memcpy(part, work, npts);
411 /* select a part size based on the data size. */
443 Vcchar_t *part;
462 /* set desired part size and bounds for number of groups */
483 part = grp->part; npts = grp->npts; ptsz = grp->ptsz;
494 vcioputu(&io, ptsz); /* the part size used */
511 if((n = vcapply(grp->mtf, part, npts, &dt)) < 0 )
523 { if(tbl[part[i]].maxs == 0)
526 sz = tbl[part[i]].size;
527 bt = bits[part[i]];
560 Vcchar_t *part, *dt, *output, *o, *endo, *data;
585 if((ptsz = (ssize_t)vciogetu(&io)) < 0) /* size of each part */
605 /* reconstruct the array of part indices */
611 if((npts = vcapply(grp->mtf, dt, n, &part)) < 0)
621 { dt = o + (k == npts-1 ? endo-o : ptsz); /* end of this part */
622 if(tbl[part[k]].maxs == 0) /* reconstruct a run */
623 { p = tbl[part[k]].runb;
628 { node = trie[part[k]]->node;
629 size = trie[part[k]]->size;
630 ntop = trie[part[k]]->ntop;
704 if(grp->part)
705 free(grp->part);