165   UInt32 posPrev;  member
906   UInt32 posMem = p->opt[cur].posPrev;  in Backward()
914       p->opt[posMem].posPrev = posMem - 1;  in Backward()
918         p->opt[posMem - 1].posPrev = p->opt[cur].posPrev2;  in Backward()
923       UInt32 posPrev = posMem;  in Backward()  local
926       backMem = p->opt[posPrev].backPrev;  in Backward()
927       posMem = p->opt[posPrev].posPrev;  in Backward()
929       p->opt[posPrev].backPrev = backCur;  in Backward()
930       p->opt[posPrev].posPrev = cur;  in Backward()
931       cur = posPrev;  in Backward()
936   p->optimumCurrentIndex  = p->opt[0].posPrev;  in Backward()
953     UInt32 lenRes = opt->posPrev - p->optimumCurrentIndex;  in GetOptimum()
955     p->optimumCurrentIndex = opt->posPrev;  in GetOptimum()
1054   p->opt[1].posPrev = 0;  in GetOptimum()
1077         opt->posPrev = 0;  in GetOptimum()
1112         opt->posPrev = 0;  in GetOptimum()
1139     UInt32 numAvailFull, newLen, numPairs, posPrev, state, posState, startLen;  in GetOptimum()  local
1160     posPrev = curOpt->posPrev;  in GetOptimum()
1163       posPrev--;  in GetOptimum()
1173         state = p->opt[posPrev].state;  in GetOptimum()
1177       state = p->opt[posPrev].state;  in GetOptimum()
1178     if (posPrev == cur - 1)  in GetOptimum()
1191         posPrev = curOpt->posPrev2;  in GetOptimum()
1203       prevOpt = &p->opt[posPrev];  in GetOptimum()
1250       nextOpt->posPrev = cur;  in GetOptimum()
1258     if (matchByte == curByte && !(nextOpt->posPrev < cur && nextOpt->backPrev == 0))  in GetOptimum()
1264         nextOpt->posPrev = cur;  in GetOptimum()
1311             opt->posPrev = cur + 1;  in GetOptimum()
1343           opt->posPrev = cur;  in GetOptimum()
1390                 opt->posPrev = cur + lenTest + 1;  in GetOptimum()
1437           opt->posPrev = cur;  in GetOptimum()
1479                 opt->posPrev = cur + lenTest + 1;  in GetOptimum()