Lines Matching defs:in_pos
77 * if in_pos is equal to in_size.
78 * @in_pos: Current position in the input buffer. This must not exceed
88 * the variables in_pos and out_pos are modified by the XZ code.
92 size_t in_pos;
138 * XZ_STREAM_END), b->in_pos and b->out_pos are not modified and the
229 b.in_pos = 0;
236 if (b.in_pos == b.in_size) {
238 b.in_pos = 0;
1272 size_t in_pos;
1532 while (*left > 0 && b->in_pos < b->in_size
1534 copy_size = min(b->in_size - b->in_pos,
1543 memcpy(dict->buf + dict->pos, b->in + b->in_pos, copy_size);
1552 memcpy(b->out + b->out_pos, b->in + b->in_pos,
1558 b->in_pos += copy_size;
1601 if (b->in_pos == b->in_size) return 0;
1603 rc->code = (rc->code << 8) + b->in[b->in_pos++];
1613 return rc->in_pos > rc->in_limit;
1630 rc->code = (rc->code << RC_SHIFT_BITS) + rc->in[rc->in_pos++];
1999 in_avail = b->in_size - b->in_pos;
2007 memcpy(s->temp.buf + s->temp.size, b->in + b->in_pos, tmp);
2016 b->in_pos += tmp;
2023 s->rc.in_pos = 0;
2025 if (!lzma_main(s) || s->rc.in_pos > s->temp.size + tmp)
2028 s->lzma2.compressed -= s->rc.in_pos;
2030 if (s->rc.in_pos < s->temp.size) {
2031 s->temp.size -= s->rc.in_pos;
2032 memmove(s->temp.buf, s->temp.buf + s->rc.in_pos,
2037 b->in_pos += s->rc.in_pos - s->temp.size;
2041 in_avail = b->in_size - b->in_pos;
2044 s->rc.in_pos = b->in_pos;
2047 s->rc.in_limit = b->in_pos + s->lzma2.compressed;
2054 in_avail = s->rc.in_pos - b->in_pos;
2058 b->in_pos = s->rc.in_pos;
2061 in_avail = b->in_size - b->in_pos;
2066 memcpy(s->temp.buf, b->in + b->in_pos, in_avail);
2068 b->in_pos += in_avail;
2083 while (b->in_pos < b->in_size || s->lzma2.sequence == SEQ_LZMA_RUN) {
2117 tmp = b->in[b->in_pos++];
2165 += (uint32_t)b->in[b->in_pos++] << 8;
2171 += (uint32_t)b->in[b->in_pos++] + 1;
2177 = (uint32_t)b->in[b->in_pos++] << 8;
2183 += (uint32_t)b->in[b->in_pos++] + 1;
2188 if (!lzma_props(s, b->in[b->in_pos++]))
2230 || (b->in_pos == b->in_size
2380 /* Saved in_pos and out_pos */
2486 * Fill s->temp by copying data starting from b->in[b->in_pos]. Caller
2494 b->in_size - b->in_pos, s->temp.size - s->temp.pos);
2496 memcpy(s->temp.buf + s->temp.pos, b->in + b->in_pos, copy_size);
2497 b->in_pos += copy_size;
2510 size_t *in_pos, size_t in_size)
2517 while (*in_pos < in_size) {
2518 byte = in[*in_pos];
2519 ++*in_pos;
2556 s->in_start = b->in_pos;
2566 s->block.compressed += b->in_pos - s->in_start;
2621 size_t in_used = b->in_pos - s->in_start;
2639 ret = dec_vli(s, b->in, &b->in_pos, b->in_size);
2689 if (b->in_pos == b->in_size)
2692 if (((s->crc >> s->pos) & 0xFF) != b->in[b->in_pos++])
2712 if (b->in_pos == b->in_size) return 0;
2714 ++b->in_pos;
2890 s->in_start = b->in_pos;
2921 if (b->in_pos == b->in_size)
2925 if (b->in[b->in_pos] == 0) {
2926 s->in_start = b->in_pos++;
2936 = ((uint32_t)b->in[b->in_pos] + 1) * 4;
2968 if (b->in_pos == b->in_size)
2971 if (b->in[b->in_pos++] != 0)
3005 while ((s->index.size + (b->in_pos - s->in_start))
3007 if (b->in_pos == b->in_size) {
3012 if (b->in[b->in_pos++] != 0)
3064 * If single-call decoding fails, we reset b->in_pos and b->out_pos back to
3076 in_start = b->in_pos;
3080 if (ret == XZ_OK && in_start == b->in_pos && out_start == b->out_pos) {
