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;
1266 size_t in_pos;
1526 while (*left > 0 && b->in_pos < b->in_size
1528 copy_size = minof(b->in_size - b->in_pos,
1537 memcpy(dict->buf + dict->pos, b->in + b->in_pos, copy_size);
1546 memcpy(b->out + b->out_pos, b->in + b->in_pos,
1552 b->in_pos += copy_size;
1595 if (b->in_pos == b->in_size) return 0;
1597 rc->code = (rc->code << 8) + b->in[b->in_pos++];
1607 return rc->in_pos > rc->in_limit;
1624 rc->code = (rc->code << RC_SHIFT_BITS) + rc->in[rc->in_pos++];
1993 in_avail = b->in_size - b->in_pos;
2001 memcpy(s->temp.buf + s->temp.size, b->in + b->in_pos, tmp);
2010 b->in_pos += tmp;
2017 s->rc.in_pos = 0;
2019 if (!lzma_main(s) || s->rc.in_pos > s->temp.size + tmp)
2022 s->lzma2.compressed -= s->rc.in_pos;
2024 if (s->rc.in_pos < s->temp.size) {
2025 s->temp.size -= s->rc.in_pos;
2026 memmove(s->temp.buf, s->temp.buf + s->rc.in_pos,
2031 b->in_pos += s->rc.in_pos - s->temp.size;
2035 in_avail = b->in_size - b->in_pos;
2038 s->rc.in_pos = b->in_pos;
2041 s->rc.in_limit = b->in_pos + s->lzma2.compressed;
2048 in_avail = s->rc.in_pos - b->in_pos;
2052 b->in_pos = s->rc.in_pos;
2055 in_avail = b->in_size - b->in_pos;
2060 memcpy(s->temp.buf, b->in + b->in_pos, in_avail);
2062 b->in_pos += in_avail;
2077 while (b->in_pos < b->in_size || s->lzma2.sequence == SEQ_LZMA_RUN) {
2111 tmp = b->in[b->in_pos++];
2159 += (uint32_t)b->in[b->in_pos++] << 8;
2165 += (uint32_t)b->in[b->in_pos++] + 1;
2171 = (uint32_t)b->in[b->in_pos++] << 8;
2177 += (uint32_t)b->in[b->in_pos++] + 1;
2182 if (!lzma_props(s, b->in[b->in_pos++]))
2223 || (b->in_pos == b->in_size
2373 /* Saved in_pos and out_pos */
2479 * Fill s->temp by copying data starting from b->in[b->in_pos]. Caller
2486 size_t copy_size = minof(b->in_size - b->in_pos, s->temp.size - s->temp.pos);
2488 memcpy(s->temp.buf + s->temp.pos, b->in + b->in_pos, copy_size);
2489 b->in_pos += copy_size;
2502 size_t *in_pos, size_t in_size)
2509 while (*in_pos < in_size) {
2510 byte = in[*in_pos];
2511 ++*in_pos;
2548 s->in_start = b->in_pos;
2558 s->block.compressed += b->in_pos - s->in_start;
2614 size_t in_used = b->in_pos - s->in_start;
2632 ret = dec_vli(s, b->in, &b->in_pos, b->in_size);
2682 if (b->in_pos == b->in_size)
2685 if (((s->crc >> s->pos) & 0xFF) != b->in[b->in_pos++])
2705 if (b->in_pos == b->in_size) return 0;
2707 ++b->in_pos;
2883 s->in_start = b->in_pos;
2914 if (b->in_pos == b->in_size)
2918 if (b->in[b->in_pos] == 0) {
2919 s->in_start = b->in_pos++;
2929 = ((uint32_t)b->in[b->in_pos] + 1) * 4;
2961 if (b->in_pos == b->in_size)
2964 if (b->in[b->in_pos++] != 0)
2998 while ((s->index.size + (b->in_pos - s->in_start))
3000 if (b->in_pos == b->in_size) {
3005 if (b->in[b->in_pos++] != 0)
3057 * If single-call decoding fails, we reset b->in_pos and b->out_pos back to
3069 in_start = b->in_pos;
3073 if (ret == XZ_OK && in_start == b->in_pos && out_start == b->out_pos) {