Lines Matching defs:current
158 Group_t current;
238 mp->current.beg[n] = mp->current.end[n] = 0;
306 if (g < MAXGROUP && (!r || g > mp->current.groups))
307 mp->current.beg[g] = mp->current.end[g] = 0;
316 mp->current.groups = oldg;
334 if (!mp->current.beg[n] || mp->current.beg[n] > olds)
335 mp->current.beg[n] = olds;
336 if (s > mp->current.end[n])
337 mp->current.end[n] = s;
339 error(-4, "subgroup#%d n=%d beg=%p end=%p len=%d", __LINE__, n, mp->current.beg[n], mp->current.end[n], mp->current.end[n] - mp->current.beg[n]);
346 if (!mp->current.beg[n] || mp->current.beg[n] > olds)
347 mp->current.beg[n] = olds;
348 if (s > mp->current.end[n])
349 mp->current.end[n] = s;
351 error(-4, "subgroup#%d n=%d beg=%p end=%p len=%d", __LINE__, n, mp->current.beg[n], mp->current.end[n], mp->current.end[n] - mp->current.beg[n]);
358 mp->current.groups = oldg;
387 mp->current.next_s = (flags & STR_MAXIMAL) ? e : olds;
389 mp->current.groups = g;
390 if (!pc && (!mp->best.next_s || (flags & STR_MAXIMAL) && mp->current.next_s > mp->best.next_s || !(flags & STR_MAXIMAL) && mp->current.next_s < mp->best.next_s))
392 mp->best = mp->current;
405 error(-2, "backref#%d n=%d g=%d beg=%p end=%p len=%d", __LINE__, n, g, mp->current.beg[n], mp->current.end[n], mp->current.end[n] - mp->current.beg[n]);
407 if (n <= g && mp->current.beg[n])
408 pc = *mp->current.beg[n];
442 mp->current.next_s = olds;
444 mp->current.groups = g;
448 mp->best = mp->current;
696 error(-2, "backref#%d n=%d g=%d beg=%p end=%p len=%d", __LINE__, n, g, mp->current.beg[n], mp->current.end[n], mp->current.end[n] - mp->current.beg[n]);
698 if (n <= g && (oldp = mp->current.beg[n]))
700 while (oldp < mp->current.end[n])
769 match.current.groups = 0;
773 match.current = match.best;
774 match.current.groups++;
775 match.current.end[0] = match.current.next_s;
777 error(-1, "match i=%d s=\"%s\" p=\"%s\" flags=%o groups=%d next=\"%s\"", i, s, p, flags, match.current.groups, match.current.next_s);
785 if ((flags & STR_RIGHT) && match.current.next_s != e)
789 match.current.beg[0] = s;
791 if (n > match.current.groups)
792 n = match.current.groups;
795 sub[i * 2] = match.current.end[i] ? match.current.beg[i] - s : 0;
796 sub[i * 2 + 1] = match.current.end[i] ? match.current.end[i] - s : 0;