Lines Matching refs:curP
52 int curP = 0;
54 int lastM = curP;
56 curP++;
57 if (curP >= int(descr_cmd.size())) {
60 int typ = descr_cmd[curP]->getType();
64 } while (curP < int(descr_cmd.size()));
66 if (curP >= int(descr_cmd.size())) {
67 curP = descr_cmd.size();
70 if (curP > lastM + 1) {
74 int curD = curP - 1;
192 } // if (curP > lastM + 1)
194 } while (curP < int(descr_cmd.size()));
248 int curP = 0;
250 int lastM = curP;
252 curP++;
253 if (curP >= int(descr_cmd.size())) break;
254 int typ = descr_cmd[curP]->getType();
256 } while (curP < int(descr_cmd.size()));
257 if (curP >= int(descr_cmd.size())) curP = descr_cmd.size();
258 if (curP > lastM + 1) {
261 int curD = curP - 1;
330 } while (curP < int(descr_cmd.size()));
351 int curP = 1;
359 curP = 0;
372 while (curP < num_pd)
374 int curD = off + curP;
380 curP++;
423 curP++;
462 curP++;
478 curP++;
511 dest->descr_cmd[n_d]->associated = curP;
515 curP++;
524 curP++;
558 callsData.piece = curP;
571 curP++;
580 curP++;
614 callsData.piece = curP;
628 curP++;
637 curP += nbInterm + 1;
641 curP++;
643 curD = off + curP;
673 dest->descr_cmd[n_d]->associated = curP - 1;
703 callsData.piece = curP;
761 callsData.piece = curP + k;
791 callsData.piece = curP + nbInterm - 1;
806 curP += nbInterm;