Lines Matching defs:BRANCH
67 * all nodes except BRANCH implement concatenation; a "next" pointer with
68 * a BRANCH on both ends of it is connecting two alternatives. (Here we
69 * have one of the subtle syntax dependencies: an individual BRANCH (as
73 * particular, the operand of a BRANCH node is the first node of the branch.
86 #define BRANCH 6 /* node Match this alternative, or the next... */
99 * BRANCH The set of branches constituting a single choice are hooked
102 * "next" pointer of the last BRANCH in a choice points to the
105 * branch starts with the operand node of a BRANCH node.
111 * BRANCH structures using BACK. Simple cases (one character
256 scan = r->program+1; /* First BRANCH. */
338 regtail(ret, br); /* BRANCH -> BRANCH. */
382 ret = regnode(BRANCH);
437 reginsert(BRANCH, ret); /* Either x */
440 regtail(ret, regnode(BRANCH)); /* or */
446 next = regnode(BRANCH); /* Either */
449 regtail(next, regnode(BRANCH)); /* or */
453 reginsert(BRANCH, ret); /* Either x */
454 regtail(ret, regnode(BRANCH)); /* or */
691 /* "Operandless" and "op != BRANCH" are synonymous in practice. */
692 if (p == NULL || p == ®dummy || OP(p) != BRANCH)
954 case BRANCH: {
957 if (OP(next) != BRANCH) /* No choice. */
966 } while (scan != NULL && OP(scan) == BRANCH);
1168 case BRANCH:
1169 p = "BRANCH";