Lines Matching refs:parse

446   struct parser_state parse;  member
1585 dfa->parse.depth--; in addtok_mb()
1595 dfa->parse.depth++; in addtok_mb()
1598 if (dfa->parse.depth > dfa->depth) in addtok_mb()
1599 dfa->depth = dfa->parse.depth; in addtok_mb()
1822 if ((0 <= dfa->parse.tok && dfa->parse.tok < NOTCHAR) in atom()
1823 || dfa->parse.tok >= CSET in atom()
1824 || dfa->parse.tok == BEG || dfa->parse.tok == BACKREF in atom()
1825 || dfa->parse.tok == BEGLINE || dfa->parse.tok == ENDLINE in atom()
1826 || dfa->parse.tok == BEGWORD || dfa->parse.tok == ENDWORD in atom()
1827 || dfa->parse.tok == LIMWORD || dfa->parse.tok == NOTLIMWORD in atom()
1828 || dfa->parse.tok == ANYCHAR || dfa->parse.tok == MBCSET) in atom()
1830 if (dfa->parse.tok == ANYCHAR && dfa->localeinfo.using_utf8) in atom()
1842 addtok (dfa, dfa->parse.tok); in atom()
1843 dfa->parse.tok = lex (dfa); in atom()
1845 else if (dfa->parse.tok == WCHAR) in atom()
1865 dfa->parse.tok = lex (dfa); in atom()
1867 else if (dfa->parse.tok == LPAREN) in atom()
1869 dfa->parse.tok = lex (dfa); in atom()
1871 if (dfa->parse.tok != RPAREN) in atom()
1873 dfa->parse.tok = lex (dfa); in atom()
1917 while (dfa->parse.tok == QMARK || dfa->parse.tok == STAR in closure()
1918 || dfa->parse.tok == PLUS || dfa->parse.tok == REPMN) in closure()
1919 if (dfa->parse.tok == REPMN && (dfa->lex.minrep || dfa->lex.maxrep)) in closure()
1939 dfa->parse.tok = lex (dfa); in closure()
1941 else if (dfa->parse.tok == REPMN) in closure()
1944 dfa->parse.tok = lex (dfa); in closure()
1949 addtok (dfa, dfa->parse.tok); in closure()
1950 dfa->parse.tok = lex (dfa); in closure()
1958 while (dfa->parse.tok != RPAREN && dfa->parse.tok != OR in branch()
1959 && dfa->parse.tok >= 0) in branch()
1970 while (dfa->parse.tok == OR) in regexp()
1972 dfa->parse.tok = lex (dfa); in regexp()
1994 d->parse.tok = lex (d); in dfaparse()
1995 d->parse.depth = d->depth; in dfaparse()
1999 if (d->parse.tok != END) in dfaparse()