152   UInt32 posPrev;  member
913   UInt32 posMem = p->opt[cur].posPrev;  in Backward()
921       p->opt[posMem].posPrev = posMem - 1;  in Backward()
925         p->opt[posMem - 1].posPrev = p->opt[cur].posPrev2;  in Backward()
930       UInt32 posPrev = posMem;  in Backward()  local
933       backMem = p->opt[posPrev].backPrev;  in Backward()
934       posMem = p->opt[posPrev].posPrev;  in Backward()
936       p->opt[posPrev].backPrev = backCur;  in Backward()
937       p->opt[posPrev].posPrev = cur;  in Backward()
938       cur = posPrev;  in Backward()
943   p->optimumCurrentIndex  = p->opt[0].posPrev;  in Backward()
960     UInt32 lenRes = opt->posPrev - p->optimumCurrentIndex;  in GetOptimum()
962     p->optimumCurrentIndex = opt->posPrev;  in GetOptimum()
1061   p->opt[1].posPrev = 0;  in GetOptimum()
1084         opt->posPrev = 0;  in GetOptimum()
1119         opt->posPrev = 0;  in GetOptimum()
1146     UInt32 numAvailFull, newLen, numPairs, posPrev, state, posState, startLen;  in GetOptimum()  local
1167     posPrev = curOpt->posPrev;  in GetOptimum()
1170       posPrev--;  in GetOptimum()
1180         state = p->opt[posPrev].state;  in GetOptimum()
1184       state = p->opt[posPrev].state;  in GetOptimum()
1185     if (posPrev == cur - 1)  in GetOptimum()
1198         posPrev = curOpt->posPrev2;  in GetOptimum()
1210       prevOpt = &p->opt[posPrev];  in GetOptimum()
1257       nextOpt->posPrev = cur;  in GetOptimum()
1265     if (matchByte == curByte && !(nextOpt->posPrev < cur && nextOpt->backPrev == 0))  in GetOptimum()
1271         nextOpt->posPrev = cur;  in GetOptimum()
1318             opt->posPrev = cur + 1;  in GetOptimum()
1350           opt->posPrev = cur;  in GetOptimum()
1397                 opt->posPrev = cur + lenTest + 1;  in GetOptimum()
1444           opt->posPrev = cur;  in GetOptimum()
1486                 opt->posPrev = cur + lenTest + 1;  in GetOptimum()