Lines Matching defs:BRANCH
69 * all nodes except BRANCH implement concatenation; a "next" pointer with
70 * a BRANCH on both ends of it is connecting two alternatives. (Here we
71 * have one of the subtle syntax dependencies: an individual BRANCH (as
75 * particular, the operand of a BRANCH node is the first node of the branch.
88 #define BRANCH 6 /* node Match this alternative, or the next... */
101 * BRANCH The set of branches constituting a single choice are hooked
104 * "next" pointer of the last BRANCH in a choice points to the
107 * branch starts with the operand node of a BRANCH node.
113 * BRANCH structures using BACK. Simple cases (one character
258 scan = r->program+1; /* First BRANCH. */
340 regtail(ret, br); /* BRANCH -> BRANCH. */
384 ret = regnode(BRANCH);
439 reginsert(BRANCH, ret); /* Either x */
442 regtail(ret, regnode(BRANCH)); /* or */
448 next = regnode(BRANCH); /* Either */
451 regtail(next, regnode(BRANCH)); /* or */
455 reginsert(BRANCH, ret); /* Either x */
456 regtail(ret, regnode(BRANCH)); /* or */
693 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
694 if (p == NULL || p == ®dummy || OP(p) != BRANCH)
956 case BRANCH: {
959 if (OP(next) != BRANCH) /* No choice. */
968 } while (scan != NULL && OP(scan) == BRANCH);
1170 case BRANCH:
1171 p = "BRANCH";