190   UInt32 posPrev;  member
948   UInt32 posMem = p->opt[cur].posPrev;  in Backward()
956       p->opt[posMem].posPrev = posMem - 1;  in Backward()
960         p->opt[posMem - 1].posPrev = p->opt[cur].posPrev2;  in Backward()
965       UInt32 posPrev = posMem;  in Backward()  local
968       backMem = p->opt[posPrev].backPrev;  in Backward()
969       posMem = p->opt[posPrev].posPrev;  in Backward()
971       p->opt[posPrev].backPrev = backCur;  in Backward()
972       p->opt[posPrev].posPrev = cur;  in Backward()
973       cur = posPrev;  in Backward()
978   p->optimumCurrentIndex  = p->opt[0].posPrev;  in Backward()
1000     UInt32 lenRes = opt->posPrev - p->optimumCurrentIndex;  in GetOptimum()
1002     p->optimumCurrentIndex = opt->posPrev;  in GetOptimum()
1101   p->opt[1].posPrev = 0;  in GetOptimum()
1124         opt->posPrev = 0;  in GetOptimum()
1159         opt->posPrev = 0;  in GetOptimum()
1189     UInt32 numAvailFull, newLen, numPairs, posPrev, state, posState, startLen;  in GetOptimum()  local
1210     posPrev = curOpt->posPrev;  in GetOptimum()
1213       posPrev--;  in GetOptimum()
1223         state = p->opt[posPrev].state;  in GetOptimum()
1227       state = p->opt[posPrev].state;  in GetOptimum()
1228     if (posPrev == cur - 1)  in GetOptimum()
1241         posPrev = curOpt->posPrev2;  in GetOptimum()
1253       prevOpt = &p->opt[posPrev];  in GetOptimum()
1300       nextOpt->posPrev = cur;  in GetOptimum()
1308     if (matchByte == curByte && !(nextOpt->posPrev < cur && nextOpt->backPrev == 0))  in GetOptimum()
1314         nextOpt->posPrev = cur;  in GetOptimum()
1361             opt->posPrev = cur + 1;  in GetOptimum()
1393           opt->posPrev = cur;  in GetOptimum()
1440                 opt->posPrev = cur + lenTest + 1;  in GetOptimum()
1488           opt->posPrev = cur;  in GetOptimum()
1531                 opt->posPrev = cur + lenTest + 1;  in GetOptimum()