Lines Matching defs:len
1122 static inline uint32_t lzma_get_dist_state(uint32_t len)
1124 return len < DIST_STATES + MATCH_LEN_MIN
1125 ? len - MATCH_LEN_MIN : DIST_STATES - 1;
1302 uint32_t len;
1491 * invalid, false is returned. On success, true is returned and *len is
1494 static int dict_repeat(struct dictionary *dict, uint32_t *len, uint32_t dist)
1501 left = minof(dict->limit - dict->pos, *len);
1502 *len -= left;
1760 /* Decode the length of the match into s->lzma.len. */
1770 s->lzma.len = MATCH_LEN_MIN;
1775 s->lzma.len = MATCH_LEN_MIN + LEN_LOW_SYMBOLS;
1779 s->lzma.len = MATCH_LEN_MIN + LEN_LOW_SYMBOLS
1784 s->lzma.len += rc_bittree(&s->rc, probs, limit) - limit;
1802 probs = s->lzma.dist_slot[lzma_get_dist_state(s->lzma.len)];
1838 s->lzma.len = 1;
1872 if (dict_has_space(&s->dict) && s->lzma.len > 0)
1873 dict_repeat(&s->dict, &s->lzma.len, s->lzma.rep0);
1891 if (!dict_repeat(&s->dict, &s->lzma.len, s->lzma.rep0))
2215 if (s->lzma2.compressed > 0 || s->lzma.len > 0
2280 s->lzma.len = 0;