Lines Matching defs:cur

225 		uint32_t *restrict back_res, uint32_t cur)
227 coder->opts_end_index = cur;
229 uint32_t pos_mem = coder->opts[cur].pos_prev;
230 uint32_t back_mem = coder->opts[cur].back_prev;
233 if (coder->opts[cur].prev_1_is_literal) {
237 if (coder->opts[cur].prev_2) {
241 = coder->opts[cur].pos_prev_2;
243 = coder->opts[cur].back_prev_2;
254 coder->opts[pos_prev].pos_prev = cur;
255 cur = pos_prev;
257 } while (cur != 0);
445 uint32_t len_end, uint32_t position, const uint32_t cur,
450 uint32_t pos_prev = coder->opts[cur].pos_prev;
453 if (coder->opts[cur].prev_1_is_literal) {
456 if (coder->opts[cur].prev_2) {
457 state = coder->opts[coder->opts[cur].pos_prev_2].state;
459 if (coder->opts[cur].back_prev_2 < REPS)
474 if (pos_prev == cur - 1) {
475 if (is_short_rep(coder->opts[cur]))
481 if (coder->opts[cur].prev_1_is_literal
482 && coder->opts[cur].prev_2) {
483 pos_prev = coder->opts[cur].pos_prev_2;
484 pos = coder->opts[cur].back_prev_2;
487 pos = coder->opts[cur].back_prev;
512 coder->opts[cur].state = state;
515 coder->opts[cur].backs[i] = reps[i];
517 const uint32_t cur_price = coder->opts[cur].price;
531 if (cur_and_1_price < coder->opts[cur + 1].price) {
532 coder->opts[cur + 1].price = cur_and_1_price;
533 coder->opts[cur + 1].pos_prev = cur;
534 make_literal(&coder->opts[cur + 1]);
544 && !(coder->opts[cur + 1].pos_prev < cur
545 && coder->opts[cur + 1].back_prev == 0)) {
550 if (short_rep_price <= coder->opts[cur + 1].price) {
551 coder->opts[cur + 1].price = short_rep_price;
552 coder->opts[cur + 1].pos_prev = cur;
553 make_short_rep(&coder->opts[cur + 1]);
580 const uint32_t offset = cur + 1 + len_test;
591 coder->opts[offset].pos_prev = cur + 1;
610 while (len_end < cur + len_test)
622 if (cur_and_len_price < coder->opts[cur + len_test].price) {
623 coder->opts[cur + len_test].price = cur_and_len_price;
624 coder->opts[cur + len_test].pos_prev = cur;
625 coder->opts[cur + len_test].back_prev = rep_index;
626 coder->opts[cur + len_test].prev_1_is_literal = false;
668 const uint32_t offset = cur + len_test + 1 + len_test_2;
679 coder->opts[offset].pos_prev = cur + len_test + 1;
683 coder->opts[offset].pos_prev_2 = cur;
707 while (len_end < cur + new_len)
720 if (cur_and_len_price < coder->opts[cur + len_test].price) {
721 coder->opts[cur + len_test].price = cur_and_len_price;
722 coder->opts[cur + len_test].pos_prev = cur;
723 coder->opts[cur + len_test].back_prev
725 coder->opts[cur + len_test].prev_1_is_literal = false;
767 const uint32_t offset = cur + len_test + 1 + len_test_2;
778 coder->opts[offset].pos_prev = cur + len_test + 1;
782 coder->opts[offset].pos_prev_2 = cur;
837 uint32_t cur;
838 for (cur = 1; cur < len_end; ++cur) {
839 assert(cur < OPTS);
848 position + cur, cur, mf->nice_len,
849 my_min(mf_avail(mf) + 1, OPTS - 1 - cur));
852 backward(coder, len_res, back_res, cur);