Lines Matching defs:BRANCH
73 * all nodes except BRANCH implement concatenation; a "next" pointer with
74 * a BRANCH on both ends of it is connecting two alternatives. (Here we
75 * have one of the subtle syntax dependencies: an individual BRANCH (as
79 * particular, the operand of a BRANCH node is the first node of the branch.
91 #define BRANCH 6 /* node Match this alternative, or the next... */
106 * BRANCH The set of branches constituting a single choice are hooked
109 * "next" pointer of the last BRANCH in a choice points to the
112 * branch starts with the operand node of a BRANCH node.
118 * BRANCH structures using BACK. Simple cases (one character
259 scan = r->program+1; /* First BRANCH. */
341 regtail(ret, br); /* BRANCH -> BRANCH. */
385 ret = regnode(BRANCH);
441 reginsert(BRANCH, ret); /* Either x */
444 regtail(ret, regnode(BRANCH)); /* or */
450 next = regnode(BRANCH); /* Either */
453 regtail(next, regnode(BRANCH)); /* or */
457 reginsert(BRANCH, ret); /* Either x */
458 regtail(ret, regnode(BRANCH)); /* or */
760 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
761 if (p == NULL || p == ®dummy || OP(p) != BRANCH)
1031 case BRANCH: {
1034 if (OP(next) != BRANCH) /* No choice. */
1043 } while (scan != NULL && OP(scan) == BRANCH);
1236 case BRANCH:
1237 p = "BRANCH";