Lines Matching defs:opt
316 COptimal opt[kNumOpts];
942 UInt32 posMem = p->opt[cur].posPrev;
943 UInt32 backMem = p->opt[cur].backPrev;
947 if (p->opt[cur].prev1IsChar)
949 MakeAsChar(&p->opt[posMem])
950 p->opt[posMem].posPrev = posMem - 1;
951 if (p->opt[cur].prev2)
953 p->opt[posMem - 1].prev1IsChar = False;
954 p->opt[posMem - 1].posPrev = p->opt[cur].posPrev2;
955 p->opt[posMem - 1].backPrev = p->opt[cur].backPrev2;
962 backMem = p->opt[posPrev].backPrev;
963 posMem = p->opt[posPrev].posPrev;
965 p->opt[posPrev].backPrev = backCur;
966 p->opt[posPrev].posPrev = cur;
971 *backRes = p->opt[0].backPrev;
972 p->optimumCurrentIndex = p->opt[0].posPrev;
995 const COptimal *opt = &p->opt[p->optimumCurrentIndex];
996 UInt32 lenRes = opt->posPrev - p->optimumCurrentIndex;
997 *backRes = opt->backPrev;
998 p->optimumCurrentIndex = opt->posPrev;
1067 p->opt[0].state = (CState)p->state;
1073 p->opt[1].price = GET_PRICE_0(p->isMatch[p->state][posState]) +
1079 MakeAsChar(&p->opt[1]);
1087 if (shortRepPrice < p->opt[1].price)
1089 p->opt[1].price = shortRepPrice;
1090 MakeAsShortRep(&p->opt[1]);
1097 *backRes = p->opt[1].backPrev;
1101 p->opt[1].posPrev = 0;
1103 p->opt[0].backs[i] = reps[i];
1107 p->opt[len--].price = kInfinityPrice;
1120 COptimal *opt = &p->opt[repLen];
1121 if (curAndLenPrice < opt->price)
1123 opt->price = curAndLenPrice;
1124 opt->posPrev = 0;
1125 opt->backPrev = i;
1126 opt->prev1IsChar = False;
1142 COptimal *opt;
1155 opt = &p->opt[len];
1156 if (curAndLenPrice < opt->price)
1158 opt->price = curAndLenPrice;
1159 opt->posPrev = 0;
1160 opt->backPrev = distance + LZMA_NUM_REPS;
1161 opt->prev1IsChar = False;
1180 printf("\nprice[%4X] = %d", position - cur + i, p->opt[i].price);
1215 curOpt = &p->opt[cur];
1222 state = p->opt[curOpt->posPrev2].state;
1229 state = p->opt[posPrev].state;
1233 state = p->opt[posPrev].state;
1259 prevOpt = &p->opt[posPrev];
1301 nextOpt = &p->opt[cur + 1];
1359 COptimal *opt;
1362 p->opt[++lenEnd].price = kInfinityPrice;
1364 opt = &p->opt[offset];
1365 if (curAndLenPrice < opt->price)
1367 opt->price = curAndLenPrice;
1368 opt->posPrev = cur + 1;
1369 opt->backPrev = 0;
1370 opt->prev1IsChar = True;
1371 opt->prev2 = False;
1390 p->opt[++lenEnd].price = kInfinityPrice;
1396 COptimal *opt = &p->opt[cur + lenTest];
1397 if (curAndLenPrice < opt->price)
1399 opt->price = curAndLenPrice;
1400 opt->posPrev = cur;
1401 opt->backPrev = repIndex;
1402 opt->prev1IsChar = False;
1438 COptimal *opt;
1441 p->opt[++lenEnd].price = kInfinityPrice;
1443 opt = &p->opt[offset];
1444 if (curAndLenPrice < opt->price)
1446 opt->price = curAndLenPrice;
1447 opt->posPrev = cur + lenTest + 1;
1448 opt->backPrev = 0;
1449 opt->prev1IsChar = True;
1450 opt->prev2 = True;
1451 opt->posPrev2 = cur;
1452 opt->backPrev2 = repIndex;
1473 p->opt[++lenEnd].price = kInfinityPrice;
1484 COptimal *opt;
1490 opt = &p->opt[cur + lenTest];
1491 if (curAndLenPrice < opt->price)
1493 opt->price = curAndLenPrice;
1494 opt->posPrev = cur;
1495 opt->backPrev = curBack + LZMA_NUM_REPS;
1496 opt->prev1IsChar = False;
1528 COptimal *opt;
1530 p->opt[++lenEnd].price = kInfinityPrice;
1532 opt = &p->opt[offset];
1533 if (curAndLenPrice < opt->price)
1535 opt->price = curAndLenPrice;
1536 opt->posPrev = cur + lenTest + 1;
1537 opt->backPrev = 0;
1538 opt->prev1IsChar = True;
1539 opt->prev2 = True;
1540 opt->posPrev2 = cur;
1541 opt->backPrev2 = curBack + LZMA_NUM_REPS;