Lines Matching defs:BRANCH
74 * all nodes except BRANCH implement concatenation; a "next" pointer with
75 * a BRANCH on both ends of it is connecting two alternatives. (Here we
76 * have one of the subtle syntax dependencies: an individual BRANCH (as
80 * particular, the operand of a BRANCH node is the first node of the branch.
92 #define BRANCH 6 /* node Match this alternative, or the next... */
105 * BRANCH The set of branches constituting a single choice are hooked
108 * "next" pointer of the last BRANCH in a choice points to the
111 * branch starts with the operand node of a BRANCH node.
117 * BRANCH structures using BACK. Simple cases (one character
269 scan = r->program+1; /* First BRANCH. */
349 regtail(ret, br); /* BRANCH -> BRANCH. */
392 ret = regnode(BRANCH);
446 reginsert(BRANCH, ret); /* Either x */
449 regtail(ret, regnode(BRANCH)); /* or */
455 next = regnode(BRANCH); /* Either */
458 regtail(next, regnode(BRANCH)); /* or */
462 reginsert(BRANCH, ret); /* Either x */
463 regtail(ret, regnode(BRANCH)); /* or */
689 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
690 if (p == NULL || p == ®dummy || OP(p) != BRANCH)
932 case BRANCH: {
935 if (OP(next) != BRANCH) /* No choice. */
944 } while (scan != NULL && OP(scan) == BRANCH);
1140 case BRANCH:
1141 p = "BRANCH";