Lines Matching defs:opt

478   COptimal opt[kNumOpts];

1174 UInt32 dist = p->opt[cur].dist;
1175 unsigned len = (unsigned)p->opt[cur].len;
1176 unsigned extra = (unsigned)p->opt[cur].extra;
1182 p->opt[wr].len = (UInt32)len;
1187 p->opt[wr].dist = dist;
1192 p->opt[wr].dist = 0;
1195 p->opt[wr].dist = MARK_LIT;
1196 p->opt[wr].len = 1;
1208 p->opt[wr].dist = dist;
1209 p->opt[wr].len = (UInt32)len;
1308 p->opt[0].state = (CState)p->state;
1314 p->opt[1].price = GET_PRICE_0(p->isMatch[p->state][posState]) +
1320 MakeAs_Lit(&p->opt[1])
1329 if (shortRepPrice < p->opt[1].price)
1331 p->opt[1].price = shortRepPrice;
1332 MakeAs_ShortRep(&p->opt[1])
1336 p->backRes = p->opt[1].dist;
1341 p->opt[1].len = 1;
1343 p->opt[0].reps[0] = reps[0];
1344 p->opt[0].reps[1] = reps[1];
1345 p->opt[0].reps[2] = reps[2];
1346 p->opt[0].reps[3] = reps[3];
1360 COptimal *opt = &p->opt[repLen];
1361 if (price2 < opt->price)
1363 opt->price = price2;
1364 opt->len = (UInt32)repLen;
1365 opt->dist = (UInt32)i;
1366 opt->extra = 0;
1389 COptimal *opt;
1404 opt = &p->opt[len];
1406 if (price < opt->price)
1408 opt->price = price;
1409 opt->len = (UInt32)len;
1410 opt->dist = dist + LZMA_NUM_REPS;
1411 opt->extra = 0;
1433 printf("\nprice[%4X] = %u", position - cur + i, p->opt[i].price);
1460 UInt32 price = p->opt[cur].price;
1464 UInt32 price2 = p->opt[j].price;
1491 curOpt = &p->opt[cur];
1495 // we need that check here, if skip_items in p->opt are possible
1505 state = (unsigned)p->opt[prev].state;
1526 state = (unsigned)p->opt[prev].state;
1533 prevOpt = &p->opt[prev];
1600 nextOpt = &p->opt[(size_t)cur + 1];
1603 // here we can allow skip_items in p->opt, if we don't check (nextOpt->price < kInfinityPrice)
1644 nextOpt->len < 2 // we can check nextOpt->len, if skip items are not allowed in p->opt
1697 COptimal *opt;
1702 opt = &p->opt[offset];
1704 if (price2 < opt->price)
1706 opt->price = price2;
1707 opt->len = (UInt32)len;
1708 opt->dist = 0;
1709 opt->extra = 1;
1748 COptimal *opt = &p->opt[cur + len2];
1749 if (price2 < opt->price)
1751 opt->price = price2;
1752 opt->len = (UInt32)len2;
1753 opt->dist = (UInt32)repIndex;
1754 opt->extra = 0;
1806 COptimal *opt;
1811 opt = &p->opt[offset];
1813 if (price2 < opt->price)
1815 opt->price = price2;
1816 opt->len = (UInt32)len2;
1817 opt->extra = (CExtra)(len + 1);
1818 opt->dist = (UInt32)repIndex;
1866 COptimal *opt;
1874 opt = &p->opt[cur + len];
1875 if (price < opt->price)
1877 opt->price = price;
1878 opt->len = (UInt32)len;
1879 opt->dist = dist + LZMA_NUM_REPS;
1880 opt->extra = 0;
1927 COptimal *opt;
1931 opt = &p->opt[offset];
1933 if (price2 < opt->price)
1935 opt->price = price2;
1936 opt->len = (UInt32)len2;
1937 opt->extra = (CExtra)(len + 1);
1938 opt->dist = dist + LZMA_NUM_REPS;
1958 p->opt[last].price = kInfinityPrice;
2438 const COptimal *opt = &p->opt[oci];
2439 len = opt->len;
2440 p->backRes = opt->dist;
2821 p->opt[i].price = kInfinityPrice;