49   size_t oshift;       /* output shift */  member
147     p->oshift = p->factor * p->ishift;  in start()
149     p->oshift = p->shift * p->segment;  in start()
150     p->ishift = p->oshift / p->factor;  in start()
153   assert(p->oshift <= p->segment);  in start()
181       p->segment, p->index, p->ishift, p->oindex, p->oshift, p->overlap);  in start()
241       while (p->oindex < p->oshift && oindex < *osamp) {  in flow()
248       if (p->oindex >= p->oshift && oindex<*osamp) {  in flow()
249         p->oindex -= p->oshift;  in flow()
252         for (i = 0; i + p->oshift < p->segment; i++)  in flow()
253           p->obuf[i] = p->obuf[i + p->oshift];  in flow()