Home
last modified time | relevance | path

Searched refs:recursion_stack (Results 1 – 4 of 4) sorted by relevance

/third_party/boost/boost/regex/v4/
Dperl_matcher_recursive.hpp332 …rator> r(rep->state_id, &next_count, position, this->recursion_stack.size() ? this->recursion_stac… in match_rep()
899 if(recursion_stack.capacity() == 0) in match_recursion()
901 recursion_stack.reserve(50); in match_recursion()
907 …recursion_info<results_type> >::reverse_iterator i = recursion_stack.rbegin(); i != recursion_stac… in match_recursion()
919 recursion_stack.push_back(recursion_info<results_type>()); in match_recursion()
920 recursion_stack.back().preturn_address = pstate->next.p; in match_recursion()
921 recursion_stack.back().results = *m_presult; in match_recursion()
922 recursion_stack.back().repeater_stack = next_count; in match_recursion()
923 recursion_stack.back().location_of_start = position; in match_recursion()
925 recursion_stack.back().idx = static_cast<const re_brace*>(pstate)->index; in match_recursion()
[all …]
Dperl_matcher_non_recursive.hpp351 …p)saved_repeater<BidiIterator>(i, s, position, this->recursion_stack.size() ? this->recursion_stac… in push_repeater_count()
1018 …recursion_info<results_type> >::reverse_iterator i = recursion_stack.rbegin(); i != recursion_stac… in match_recursion()
1034 if(recursion_stack.capacity() == 0) in match_recursion()
1036 recursion_stack.reserve(50); in match_recursion()
1038 recursion_stack.push_back(recursion_info<results_type>()); in match_recursion()
1039 recursion_stack.back().preturn_address = pstate->next.p; in match_recursion()
1040 recursion_stack.back().results = *m_presult; in match_recursion()
1042 recursion_stack.back().idx = static_cast<const re_brace*>(pstate)->index; in match_recursion()
1043 recursion_stack.back().location_of_start = position; in match_recursion()
1063 if(!recursion_stack.empty()) in match_endmark()
[all …]
Dperl_matcher_common.hpp798 int stack_index = recursion_stack.empty() ? -1 : recursion_stack.back().idx; in match_assert_backref()
808 result = !recursion_stack.empty() && ((recursion_stack.back().idx == idx) || (index == 0)); in match_assert_backref()
825 if(!recursion_stack.empty()) in match_accept()
827 return skip_until_paren(recursion_stack.back().idx); in match_accept()
Dperl_matcher.hpp521 std::vector<recursion_info<results_type> > recursion_stack; member in boost::BOOST_REGEX_DETAIL_NS::perl_matcher