Lines Matching defs:parens

1207         Otherwise the parens are considered part of the comment */
1735         /* Success!, But we may need to redo the parse knowing how many parens
1781             /* Make enough room for all the known parens, and zero it */
1866         /* Note, RExC_total_parens is 1 + the number of parens in a pattern.
1867          * So its 1 if there are no parens. */
2404     /* assume we don't need to swap parens around before we match */
3047     SV * max_open;  /* Max number of unclosed parens */
3074         vFAIL("Too many nested open parens");
4112                     /* first guess at number of parens we might encounter */
4420         static const char parens[] = "=!aA<,>Bbt";
4423         if (paren && (p = strchr(parens, paren))) {
4424             U8 node = ((p - parens) % 2) ? UNLESSM : IFMATCH;
4425             int flag = (p - parens) > 3;
4925      * we want to track the range of parens we need to reset each iteration
6068                      * number of parens. */
6531                          * parens we have seen so far, hence the "<" as opposed
8466                                        parens would be if they were actually
8526      * replace testing for parens, by using instead subtraction of the fence
8639                             * parens evaluated to more than just a (?[...]),
12903      * realignment of parens until a later pass when they are reliable */
12908          * iow it is 1 more than the number of parens seen in