Searched defs:repeat (Results 1 - 4 of 4) sorted by relevance

/PHP_5_4/ext/ereg/regex/
H A Dregcomp.c363 repeat(p, pos, count, count2);
541 repeat(p, pos, count, count2);
908 - repeat - generate code for a bounded repetition, recursively if needed
909 == static void repeat(register struct parse *p, sopno start, int from, int to);
912 repeat(p, start, from, to) function
939 repeat(p, start+1, 1, to);
959 repeat(p, copy, 1, to-1);
967 repeat(p, copy, from-1, to-1);
971 repeat(p, copy, from-1, to);
/PHP_5_4/
H A Drun-tests.php499 $repeat = substr($argv[$i],0,1) == '-'; variable
501 while ($repeat) {
509 if ($repeat) {
528 $repeat = false; variable
649 // repeat check with full switch
652 $repeat = true; variable
/PHP_5_4/ext/mbstring/oniguruma/
H A Dregexec.c316 int num; /* repeat id */
317 } repeat; member in union:_StackType::__anon79
626 stk->u.repeat.num = (id);\
627 stk->u.repeat.pcode = (pat);\
628 stk->u.repeat.count = 0;\
779 STACK_AT(stk->u.repeat_inc.si)->u.repeat.count--;\
801 STACK_AT(stk->u.repeat_inc.si)->u.repeat.count--;\
821 STACK_AT(stk->u.repeat_inc.si)->u.repeat.count--;\
991 if (k->u.repeat.num == (id)) {\
2722 stkp->u.repeat
[all...]
H A Dregparse.c2259 } repeat; member in union:__anon95::__anon96
2359 tok->u.repeat.lower = low;
2360 tok->u.repeat.upper = up;
2990 tok->u.repeat.lower = 0;
2991 tok->u.repeat.upper = REPEAT_INFINITE;
2998 tok->u.repeat.lower = 1;
2999 tok->u.repeat.upper = REPEAT_INFINITE;
3006 tok->u.repeat.lower = 0;
3007 tok->u.repeat.upper = 1;
3012 tok->u.repeat
[all...]

Completed in 19 milliseconds