| /aosp_15_r20/external/sdv/vsomeip/third_party/boost/regex/include/boost/regex/v4/ |
| D | perl_matcher_recursive.hpp | 332 …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 …]
|
| D | perl_matcher_non_recursive.hpp | 351 …repeater<BidiIterator>(i, s, position, this->recursion_stack.empty() ? (INT_MIN + 3) : this->recur… 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 …]
|
| D | perl_matcher_common.hpp | 798 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()
|
| D | perl_matcher.hpp | 531 std::vector<recursion_info<results_type> > recursion_stack; member in boost::BOOST_REGEX_DETAIL_NS::perl_matcher
|
| /aosp_15_r20/external/sdv/vsomeip/third_party/boost/regex/include/boost/regex/v5/ |
| D | perl_matcher_non_recursive.hpp | 341 …repeater<BidiIterator>(i, s, position, this->recursion_stack.empty() ? (INT_MIN + 3) : this->recur… in push_repeater_count()
1008 …recursion_info<results_type> >::reverse_iterator i = recursion_stack.rbegin(); i != recursion_stac… in match_recursion()
1024 if(recursion_stack.capacity() == 0) in match_recursion()
1026 recursion_stack.reserve(50); in match_recursion()
1028 recursion_stack.push_back(recursion_info<results_type>()); in match_recursion()
1029 recursion_stack.back().preturn_address = pstate->next.p; in match_recursion()
1030 recursion_stack.back().results = *m_presult; in match_recursion()
1032 recursion_stack.back().idx = static_cast<const re_brace*>(pstate)->index; in match_recursion()
1033 recursion_stack.back().location_of_start = position; in match_recursion()
1053 if(!recursion_stack.empty()) in match_endmark()
[all …]
|
| D | perl_matcher_common.hpp | 753 int stack_index = recursion_stack.empty() ? -1 : recursion_stack.back().idx; in match_assert_backref()
763 result = !recursion_stack.empty() && ((recursion_stack.back().idx == idx) || (index == 0)); in match_assert_backref()
780 if(!recursion_stack.empty()) in match_accept()
782 return skip_until_paren(recursion_stack.back().idx); in match_accept()
|
| D | perl_matcher.hpp | 485 std::vector<recursion_info<results_type> > recursion_stack; member in boost::BOOST_REGEX_DETAIL_NS::perl_matcher
|
| /aosp_15_r20/external/tensorflow/tensorflow/python/module/ |
| H A D | module.py | 367 recursion_stack=None): argument
402 if recursion_stack is None:
403 recursion_stack = []
412 if module_id in recursion_stack:
448 recursion_stack.append(module_id)
461 recursion_stack=recursion_stack)
467 recursion_stack.pop()
|
| /aosp_15_r20/external/tensorflow/tensorflow/core/grappler/utils/ |
| H A D | graph_view.cc | 1461 std::vector<RecursionStackEntry>* recursion_stack, in SortTopologically()
1475 recursion_stack->push_back({fanout_index, ENTER}); in SortTopologically()
1482 std::vector<RecursionStackEntry>* recursion_stack, in SortTopologically() argument
1489 push_onto_stack(curr_index, regular_fanout.node_index_, recursion_stack, in SortTopologically()
1496 recursion_stack, traversal_state, edges_in_cycle); in SortTopologically()
1502 push_onto_stack(curr_index, extra_fanout, recursion_stack, in SortTopologically()
1513 std::vector<RecursionStackEntry> recursion_stack; in SortTopologically() local
1518 recursion_stack.push_back({root_index, ENTER}); in SortTopologically()
1520 while (!recursion_stack.empty()) { in SortTopologically()
1521 auto curr_entry = recursion_stack.back(); in SortTopologically()
[all …]
|
| /aosp_15_r20/external/perfetto/src/protozero/protoc_plugin/ |
| H A D | cppgen_plugin.cc | 231 std::stack<const Descriptor*> recursion_stack; in Generate() local
233 recursion_stack.push(file->message_type(i)); in Generate()
235 while (!recursion_stack.empty()) { in Generate()
236 const Descriptor* msg = recursion_stack.top(); in Generate()
237 recursion_stack.pop(); in Generate()
246 recursion_stack.push(msg->nested_type(i)); in Generate()
265 recursion_stack.push(field->message_type()); in Generate()
|