Lines Matching refs:bp
54 unsigned char* bp;
96 #define GETCHAR(p) ((p)->bp < (p)->be ? (int)*(p)->bp++ : fill(p))
104 state->bp = state->buf;
105 if ((r = sfrd(state->codex->sp, state->bp, sizeof(state->buf), &state->codex->sfdisc)) <= 0)
107 state->be = state->bp;
110 state->be = state->bp + r;
111 return *state->bp++;
132 *state->bp++ = state->data->map[b >> 18];
133 *state->bp++ = state->data->map[(b >> 12) & 077];
134 *state->bp++ = x == 3 && state->data->pad ? state->data->pad : state->data->map[(b >> 6) & 077];
135 *state->bp++ = state->data->pad ? state->data->pad : state->data->map[b & 077];
138 if ((state->bl - state->bp) < UUOUT * UUCHUNK || state->bp > state->buf + !!state->bb)
141 *state->bb = state->data->map[((state->bp - state->bb - x) / UUOUT) * UUIN + 1];
144 if (*(state->bp - 1) == '\n')
145 state->bp--;
149 if (*(state->bp - 1) != '\n')
150 *state->bp++ = '\n';
152 x = state->bp - state->buf;
153 state->bp = state->buf;
154 state->bl = state->bp + UUOUT * UUCHUNK;
235 state->bp = state->buf;
239 state->be = state->bp + (sizeof(state->buf) / n) * n;
242 state->bb = state->bp;
243 *state->bp++ = state->data->map[UUIN * UUCHUNK];
245 state->bl = state->bp + UUOUT * UUCHUNK;
250 state->be = state->bp;
463 *state->bp++ = state->data->map[b >> 18];
464 *state->bp++ = state->data->map[(b >> 12) & 077];
465 *state->bp++ = state->data->map[(b >> 6) & 077];
466 *state->bp++ = state->data->map[b & 077];
467 } while (state->bp < state->bl);
469 *state->bp++ = '\n';
470 if (state->bp >= state->be)
472 if (sfwr(sp, state->buf, state->bp - state->buf, disc) != (state->bp - state->buf))
474 state->bp = state->buf;
478 state->bb = state->bp;
479 *state->bp++ = state->data->map[UUIN * UUCHUNK];
481 state->bl = state->bp + UUOUT * UUCHUNK;