dist/lib/regexec.c

1109   /* If the RE accepts NULL string.  */
1572      2. When 0 <= STR_IDX < MATCH_LAST and `a' accepts
2522       /* The node can accepts `naccepted' bytes.  */
3320      characters which i-th destination state accepts.  */
3452 	      /* There must be exactly one destination which accepts
3457 	      /* j-th destination accepts the word character ch.  */
3482 	      /* There must be exactly one destination which accepts
3487 	      /* j-th destination accepts the word character ch.  */
3496       /* The current state accepts newline character.  */
3500 	    /* k-th destination accepts newline character.  */
3504 	    /* There must be only one destination which accepts
3537   bitset accepts; /* Characters a node can accept.  */
3539   bitset_empty (accepts);
3551 	bitset_set (accepts, node->opr.c);
3554 	  bitset_merge (accepts, node->opr.sbcset);
3560 	    bitset_merge (accepts, dfa->sb_char);
3563 	    bitset_set_all (accepts);
3565 	    bitset_clear (accepts, '\n');
3567 	    bitset_clear (accepts, '\0');
3573 	    memset (accepts, -1, sizeof accepts / 2);
3575 	    bitset_merge (accepts, utf8_sb_map);
3577 	    bitset_clear (accepts, '\n');
3579 	    bitset_clear (accepts, '\0');
3585       /* Check the `accepts' and sift the characters which are not
3591 	      bool accepts_newline = bitset_contain (accepts, NEWLINE_CHAR);
3592 	      bitset_empty (accepts);
3594 		bitset_set (accepts, NEWLINE_CHAR);
3600 	      bitset_empty (accepts);
3609 		  bitset_empty (accepts);
3615 		  any_set |= (accepts[j] &= (dfa->word_char[j] | ~dfa->sb_char[j]));
3619 		  any_set |= (accepts[j] &= dfa->word_char[j]);
3628 		  bitset_empty (accepts);
3634 		  any_set |= (accepts[j] &= ~(dfa->word_char[j] & dfa->sb_char[j]));
3638 		  any_set |= (accepts[j] &= ~dfa->word_char[j]);
3644       /* Then divide `accepts' into DFA states, or create a new
3645 	 state.  Above, we make sure that accepts is not empty.  */
3657 	  /* Enumerate the intersection set of this state and `accepts'.  */
3660 	    has_intersec |= intersec[k] = accepts[k] & dests_ch[j][k];
3665 	  /* Then check if this state is a subset of `accepts'.  */
3669 	      not_subset |= remains[k] = ~accepts[k] & dests_ch[j][k];
3670 	      not_consumed |= accepts[k] = accepts[k] & ~dests_ch[j][k];
3673 	  /* If this state isn't a subset of `accepts', create a
3697 	  bitset_copy (dests_ch[ndests], accepts);
3702 	  bitset_empty (accepts);
3713 /* Check how many bytes the node `dfa->nodes[node_idx]' accepts.
3714    Return the number of the bytes the node accepts.
3788       /* '.' accepts any one character except the following two cases.  */
4017 /* Check whether the node accepts the byte which is IDX-th