Lines Matching refs:next
107 // plus a "next" pointer, possibly plus an operand. "Next" pointers of
108 // all nodes except kRegExpBranch implement concatenation; a "next" pointer
128 kRegExpBranch = 6, // node Match this alternative, or the next...
129 kRegExpBack = 7, // no Match "", "next" ptr points backward.
143 // hooked together with their "next" pointers, since precedence prevents
145 // "next" pointer of the last kRegExpBranch in a choice points to the
147 // final "next" pointer of each individual branch points; each
150 // kRegExpBack Normal "next" pointers all implicitly point forward;
162 // A node is one char of opcode followed by two chars of "next" pointer.
168 // Using two bytes for the "next" pointer is vast overkill for most things,
579 char* next;
616 next = Node(kRegExpBranch);
618 Tail(ret, next);
621 Tail(next, Node(kRegExpBranch));
631 next = Node(kRegExpNothing);
633 Tail(ret, next);
634 OpTail(ret, next);
810 // Null "next" pointer.
863 // - Tail - set the next-pointer at the end of a node chain
1024 const char* next; // Next node.
1036 next = Next(scan);
1110 if (Match(next)) {
1140 if (Match(next)) {
1158 if (*next != kRegExpBranch) {
1160 next = Operand(scan);
1186 // when we know what character comes next.
1189 if (*next == kRegExpExactly)
1190 nextch = *Operand(next);
1197 if (Match(next))
1217 scan = next;
1283 // - Next - dig the "next" pointer out of a node
1363 const char* next;
1371 next = Next(s);
1372 if (next == NULL) {
1373 // next ptr
1376 printf("(%ld)", (s - fRegExp->program) + (next - s));