Lines Matching +defs:top +defs:pos
59 #define INSERT(op, pos) doinsert(p, (sop)(op), HERE()-(pos)+1, pos)
60 #define AHEAD(pos) dofwd(p, pos, HERE()-(pos))
61 #define ASTERN(sop, pos) EMIT(sop, HERE()-pos)
186 - p_ere - ERE parser top level, concatenation and alternation
240 register sopno pos;
249 pos = HERE();
333 INSERT(OPLUS_, pos);
334 ASTERN(O_PLUS, pos);
335 INSERT(OQUEST_, pos);
336 ASTERN(O_QUEST, pos);
339 INSERT(OPLUS_, pos);
340 ASTERN(O_PLUS, pos);
344 INSERT(OCH_, pos); /* offset slightly wrong */
345 ASTERN(OOR1, pos); /* this one's right */
346 AHEAD(pos); /* fix the OCH_ */
361 repeat(p, pos, count, count2);
394 - p_bre - BRE parser top level, anchoring and concatenation
446 register sopno pos;
451 pos = HERE(); /* repetion op, if any, covers from here */
525 INSERT(OPLUS_, pos);
526 ASTERN(O_PLUS, pos);
527 INSERT(OQUEST_, pos);
528 ASTERN(O_QUEST, pos);
539 repeat(p, pos, count, count2);
1058 register cset *top = &p->g->sets[p->g->ncsets];
1063 if (cs == top-1) /* recover only the easy case */
1084 register cset *top = &p->g->sets[p->g->ncsets];
1089 for (cs2 = &p->g->sets[0]; cs2 < top; cs2++)
1099 if (cs2 < top) { /* found one */
1386 == static void doinsert(register struct parse *p, sop op, size_t opnd, sopno pos);
1389 doinsert(p, op, opnd, pos)
1393 sopno pos;
1409 assert(pos > 0);
1411 if (p->pbegin[i] >= pos) {
1414 if (p->pend[i] >= pos) {
1419 memmove((char *)&p->strip[pos+1], (char *)&p->strip[pos],
1420 (HERE()-pos-1)*sizeof(sop));
1421 p->strip[pos] = s;
1426 == static void dofwd(register struct parse *p, sopno pos, sop value);
1429 dofwd(p, pos, value)
1431 register sopno pos;
1439 p->strip[pos] = OP(p->strip[pos]) | value;