Lines Matching refs:state
114 // Push a state on the stack.
127 // Parser state of containing expression, if any.
153 // Abort if index is larger than what has been parsed up till this state.
214 RegExpTree* ParseCharacterClass(const RegExpBuilder* state);
273 RegExpParserState* state);
274 RegExpParserState* ParseOpenParenthesis(RegExpParserState* state);
535 // Used to store current state while parsing subexpressions.
538 RegExpParserState* state = &initial_state;
545 if (state->IsSubexpression()) {
549 DCHECK_EQ(INITIAL, state->group_type());
553 if (!state->IsSubexpression()) {
556 DCHECK_NE(INITIAL, state->group_type());
565 int capture_index = state->capture_index();
566 SubexpressionType group_type = state->group_type();
570 if (state->IsNamedCapture()) {
571 CreateNamedCaptureAtIndex(state->capture_name(),
585 capture_index, state->lookaround_type());
588 // Restore previous state.
589 state = state->previous_state();
590 builder = state->builder();
644 state = ParseOpenParenthesis(state CHECK_FAILED);
645 builder = state->builder();
685 if (state->IsInsideCaptureGroup(index)) {
775 ParseNamedBackReference(builder, state CHECK_FAILED);
868 RegExpParserState* state) {
869 RegExpLookaround::Type lookaround_type = state->lookaround_type();
923 // Store current state and begin new disjunction parsing.
925 state, subexpr_type, lookaround_type, captures_started_, capture_name,
926 state->builder()->flags(), zone());
956 // Important: The scanner has to be in a consistent state when calling
1138 // This final advance goes back into the state of pointing at the next
1177 RegExpBuilder* builder, RegExpParserState* state) {
1190 if (state->IsInsideCaptureGroup(name)) {