Lines Matching defs:accepts
1162 /* If the RE accepts NULL string. */
1620 2. When 0 <= STR_IDX < MATCH_LAST and `a' accepts
2573 /* The node can accepts `naccepted' bytes. */
3380 characters which i-th destination state accepts. */
3511 /* There must be exactly one destination which accepts
3516 /* j-th destination accepts the word character ch. */
3542 /* There must be exactly one destination which accepts
3547 /* j-th destination accepts the word character ch. */
3556 /* The current state accepts newline character. */
3560 /* k-th destination accepts newline character. */
3564 /* There must be only one destination which accepts
3597 bitset_t accepts; /* Characters a node can accept. */
3599 bitset_empty (accepts);
3611 bitset_set (accepts, node->opr.c);
3614 bitset_merge (accepts, node->opr.sbcset);
3620 bitset_merge (accepts, dfa->sb_char);
3623 bitset_set_all (accepts);
3625 bitset_clear (accepts, '\n');
3627 bitset_clear (accepts, '\0');
3633 memset (accepts, -1, ASCII_CHARS / CHAR_BIT);
3635 bitset_merge (accepts, utf8_sb_map);
3637 bitset_clear (accepts, '\n');
3639 bitset_clear (accepts, '\0');
3645 /* Check the `accepts' and sift the characters which are not
3651 bool accepts_newline = bitset_contain (accepts, NEWLINE_CHAR);
3652 bitset_empty (accepts);
3654 bitset_set (accepts, NEWLINE_CHAR);
3660 bitset_empty (accepts);
3669 bitset_empty (accepts);
3675 any_set |= (accepts[j] &= (dfa->word_char[j] | ~dfa->sb_char[j]));
3679 any_set |= (accepts[j] &= dfa->word_char[j]);
3688 bitset_empty (accepts);
3694 any_set |= (accepts[j] &= ~(dfa->word_char[j] & dfa->sb_char[j]));
3698 any_set |= (accepts[j] &= ~dfa->word_char[j]);
3704 /* Then divide `accepts' into DFA states, or create a new
3705 state. Above, we make sure that accepts is not empty. */
3717 /* Enumerate the intersection set of this state and `accepts'. */
3720 has_intersec |= intersec[k] = accepts[k] & dests_ch[j][k];
3725 /* Then check if this state is a subset of `accepts'. */
3729 not_subset |= remains[k] = ~accepts[k] & dests_ch[j][k];
3730 not_consumed |= accepts[k] = accepts[k] & ~dests_ch[j][k];
3733 /* If this state isn't a subset of `accepts', create a
3757 bitset_copy (dests_ch[ndests], accepts);
3762 bitset_empty (accepts);
3773 /* Check how many bytes the node `dfa->nodes[node_idx]' accepts.
3774 Return the number of the bytes the node accepts.
3848 /* '.' accepts any one character except the following two cases. */
4078 /* Check whether the node accepts the byte which is IDX-th
