Lines Matching refs:parens
1206 Otherwise the parens are considered part of the comment */
1629 /* Success!, But we may need to redo the parse knowing how many parens
1675 /* Make enough room for all the known parens, and zero it */
1759 /* Note, RExC_total_parens is 1 + the number of parens in a pattern.
1760 * So its 1 if there are no parens. */
2297 /* assume we don't need to swap parens around before we match */
2952 SV * max_open; /* Max number of unclosed parens */
2979 vFAIL("Too many nested open parens");
4017 /* first guess at number of parens we might encounter */
4325 static const char parens[] = "=!aA<,>Bbt";
4328 if (paren && (p = strchr(parens, paren))) {
4329 U8 node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
4330 int flag = (p - parens) > 3;
4830 * we want to track the range of parens we need to reset each iteration
5973 * number of parens. */
6436 * parens we have seen so far, hence the "<" as opposed
8369 parens would be if they were actually
8429 * replace testing for parens, by using instead subtraction of the fence
8542 * parens evaluated to more than just a (?[...]),
12801 * realignment of parens until a later pass when they are reliable */
12806 * iow it is 1 more than the number of parens seen in