Lines Matching refs:regops

106 perl source, we will call the nodes in a regex program "regops".
114 The "next" pointers of all regops except C<BRANCH> implement concatenation;
202 The regops are defined in F<regnodes.h> which is generated from
204 of distinct regops is restricted to 256, with about a quarter already
338 fit in the normal 16 bits available.  There are two special regops that
475 the node goes. The C<regnext> of an C<END> regop is unused, as C<END> regops mean
657 constructs. The C<TAIL> regops which are used during parsing to mark the end
658 of branches and the end of groups are examples of this. These regops are used
739 the possible states are the regops themselves, plus a number of additional
772 Nearly all regops that involve looking at the input string have
839                                   * data that the regops need. Often the
877 what array. During compilation regops that need special structures stored