/third_party/boost/boost/msm/back/ |
D | favor_compile_time.hpp | 130 BOOST_STATIC_CONSTANT(int, state_id = in init_event_base_case() 132 … self->entries[state_id+1].one_state.push_front(reinterpret_cast<cell>(&Transition::execute)); in init_event_base_case() 151 BOOST_STATIC_CONSTANT(int, state_id = in init_event_base_case() 153 self->entries[state_id+1].one_state.push_front(&Transition::execute); in init_event_base_case() 201 BOOST_STATIC_CONSTANT(int, state_id = (get_state_id<stt,State>::value)); in execute() 203 tofill[state_id+1].one_state.push_back(call_no_transition); in execute() 212 BOOST_STATIC_CONSTANT(int, state_id = (get_state_id<stt,State>::value)); in execute() 214 tofill[state_id+1].one_state.push_back(call_no_transition); in execute() 238 BOOST_STATIC_CONSTANT(int, state_id = (get_state_id<stt,State>::value)); in execute() 240 tofill[state_id+1].one_state.push_front(call_no_transition); in execute() [all …]
|
D | dispatch_table.hpp | 177 BOOST_STATIC_CONSTANT(int, state_id = in init_event_base_case() 179 self->entries[state_id+1] = reinterpret_cast<cell>(&Transition::execute); in init_event_base_case() 199 BOOST_STATIC_CONSTANT(int, state_id = in init_event_base_case() 201 self->entries[state_id+1] = &convert_event_and_forward<Transition>::execute; in init_event_base_case() 218 BOOST_STATIC_CONSTANT(int, state_id = in init_event_base_case() 220 self->entries[state_id+1] = &convert_event_and_forward<Transition>::execute; in init_event_base_case() 241 BOOST_STATIC_CONSTANT(int, state_id = in init_event_base_case() 243 self->entries[state_id+1] = &Transition::execute; in init_event_base_case() 289 BOOST_STATIC_CONSTANT(int, state_id = (get_state_id<stt,State>::value)); in operator ()() 291 tofill_entries[state_id+1] = call_no_transition; in operator ()() [all …]
|
D | tools.hpp | 43 …get_state_name(std::string& name_to_fill, int state_id):m_name(name_to_fill),m_state_id(state_id){} in get_state_name()
|
D | state_machine.hpp | 2251 BOOST_STATIC_CONSTANT(int, state_id = (get_state_id<stt,StateType>::type::value)); in operator ()() 2255 entries[state_id] = &FlagHandler<StateType,Flag>::flag_true; in operator ()() 2265 … helper<StateType>(entries,state_id,::boost::mpl::bool_<composite_no_forward::type::value>()); in operator ()() 2395 BOOST_STATIC_CONSTANT(int, state_id = (get_state_id<stt,State>::value)); in operator ()() 2400 visitor_helper(state_id,::boost::fusion::at_key<State>(self->m_substate_list), in operator ()() 2429 BOOST_STATIC_CONSTANT(int, state_id = (get_state_id<stt,StateType>::type::value)); in operator ()() 2431 visitor_helper<StateType>(state_id); in operator ()() 2492 state_id(id),evt(e),self(self_){} in entry_exit_helper() 2499 if (id == state_id) in helper() 2510 if (id == state_id) in helper() [all …]
|
D | metafunctions.hpp | 927 int state_id = get_state_id<stt,StateType>::type::value; in is_exit_state_active() local 929 … return (std::find(comp.current_state(),comp.current_state()+Composite::nr_regions::value,state_id) in is_exit_state_active()
|
/third_party/boost/boost/regex/v4/ |
D | perl_matcher.hpp | 262 int state_id; member in boost::BOOST_REGEX_DETAIL_NS::repeater_count 268 while(p && (p->state_id != n)) in unwind_until() 270 if(-2 - current_recursion_id == p->state_id) in unwind_until() 273 if(p && (p->state_id < 0)) in unwind_until() 275 p = unwind_until(p->state_id, p, current_recursion_id); in unwind_until() 284 repeater_count(repeater_count** s) : stack(s), next(0), state_id(-1), count(0), start_pos() {} in repeater_count() 289 state_id = i; in repeater_count() 293 if((state_id > next->state_id) && (next->state_id >= 0)) in repeater_count() 298 p = unwind_until(state_id, p, current_recursion_id); in repeater_count() 314 int get_id() { return state_id; } in get_id() [all …]
|
D | w32_regex_traits.hpp | 83 BOOST_REGEX_DECL bool BOOST_REGEX_CALL w32_is_lower(unsigned short ca, lcid_type state_id); 90 BOOST_REGEX_DECL bool BOOST_REGEX_CALL w32_is_upper(unsigned short ca, lcid_type state_id); 94 BOOST_REGEX_DECL std::string BOOST_REGEX_CALL w32_cat_get(const cat_type& cat, lcid_type state_id, … 96 BOOST_REGEX_DECL std::wstring BOOST_REGEX_CALL w32_cat_get(const cat_type& cat, lcid_type state_id,… 101 BOOST_REGEX_DECL std::string BOOST_REGEX_CALL w32_transform(lcid_type state_id, const char* p1, con… 103 BOOST_REGEX_DECL std::wstring BOOST_REGEX_CALL w32_transform(lcid_type state_id, const wchar_t* p1,… 105 …::basic_string<unsigned short> BOOST_REGEX_CALL w32_transform(lcid_type state_id, const unsigned s… 112 BOOST_REGEX_DECL unsigned short BOOST_REGEX_CALL w32_tolower(unsigned short c, lcid_type state_id); 123 BOOST_REGEX_DECL bool BOOST_REGEX_CALL w32_is(lcid_type state_id, boost::uint32_t m, unsigned short… 549 std::size_t state_id = 1u + (std::size_t)BOOST_REGEX_DETAIL_NS::get_default_class_id(p1, p2); in lookup_classname_imp() local [all …]
|
D | states.hpp | 251 int state_id; // Unique identifier for this repeat member 261 int state_id; // identifier of first nested repeat within the recursion. member
|
D | basic_regex_creator.hpp | 735 static_cast<re_repeat*>(state)->state_id = m_repeater_id++; in fixup_pointers() 838 next_rep_id = static_cast<re_repeat*>(p)->state_id; in fixup_recursions() 853 static_cast<re_recurse*>(state)->state_id = next_rep_id - 1; in fixup_recursions() 1453 unsigned state_id = static_cast<re_repeat*>(pt)->state_id; in is_bad_repeat() local 1454 if(state_id >= sizeof(m_bad_repeats) * CHAR_BIT) in is_bad_repeat() 1457 return m_bad_repeats & (one << state_id); in is_bad_repeat() 1475 unsigned state_id = static_cast<re_repeat*>(pt)->state_id; in set_bad_repeat() local 1477 if(state_id <= sizeof(m_bad_repeats) * CHAR_BIT) in set_bad_repeat() 1478 m_bad_repeats |= (one << state_id); in set_bad_repeat()
|
D | perl_matcher_non_recursive.hpp | 56 unsigned int state_id; member 62 saved_state(unsigned i) : state_id(i) {} in saved_state() 356 …s>::push_single_repeat(std::size_t c, const re_repeat* r, BidiIterator last_position, int state_id) in push_single_repeat() argument 366 (void) new (pmp)saved_single_repeat<BidiIterator>(c, r, last_position, state_id); in push_single_repeat() 621 if((m_backup_state->state_id != saved_state_repeater_count) in match_rep() 622 … || (static_cast<saved_repeater<BidiIterator>*>(m_backup_state)->count.get_id() != rep->state_id) in match_rep() 623 || (next_count->get_id() != rep->state_id)) in match_rep() 627 push_repeater_count(rep->state_id, &next_count); in match_rep() 1268 unwinder = s_unwind_table[m_backup_state->state_id]; in unwind()
|
D | cpp_regex_traits.hpp | 874 std::size_t state_id = 1 + BOOST_REGEX_DETAIL_NS::get_default_class_id(p1, p2); in lookup_classname_imp() local 875 BOOST_ASSERT(state_id < sizeof(masks) / sizeof(masks[0])); in lookup_classname_imp() 876 return masks[state_id]; in lookup_classname_imp()
|
/third_party/musl/porting/liteos_m/kernel/src/regex/ |
D | regexec.c | 279 if (reach_pos[trans_i->state_id].pos < pos) in tre_tnfa_run_parallel() 306 reach_pos[trans_i->state_id].pos = pos; in tre_tnfa_run_parallel() 307 reach_pos[trans_i->state_id].tags = &reach_next_i->tags; in tre_tnfa_run_parallel() 404 if (reach_pos[trans_i->state_id].pos < pos) in tre_tnfa_run_parallel() 411 reach_pos[trans_i->state_id].pos = pos; in tre_tnfa_run_parallel() 412 reach_pos[trans_i->state_id].tags = &reach_next_i->tags; in tre_tnfa_run_parallel() 429 assert(reach_pos[trans_i->state_id].pos == pos); in tre_tnfa_run_parallel() 435 *reach_pos[trans_i->state_id].tags)) in tre_tnfa_run_parallel() 438 tmp_iptr = *reach_pos[trans_i->state_id].tags; in tre_tnfa_run_parallel() 439 *reach_pos[trans_i->state_id].tags = tmp_tags; in tre_tnfa_run_parallel() [all …]
|
D | tre.h | 101 int state_id; member
|
/third_party/musl/src/regex/ |
D | regexec.c | 279 if (reach_pos[trans_i->state_id].pos < pos) in tre_tnfa_run_parallel() 306 reach_pos[trans_i->state_id].pos = pos; in tre_tnfa_run_parallel() 307 reach_pos[trans_i->state_id].tags = &reach_next_i->tags; in tre_tnfa_run_parallel() 404 if (reach_pos[trans_i->state_id].pos < pos) in tre_tnfa_run_parallel() 411 reach_pos[trans_i->state_id].pos = pos; in tre_tnfa_run_parallel() 412 reach_pos[trans_i->state_id].tags = &reach_next_i->tags; in tre_tnfa_run_parallel() 429 assert(reach_pos[trans_i->state_id].pos == pos); in tre_tnfa_run_parallel() 435 *reach_pos[trans_i->state_id].tags)) in tre_tnfa_run_parallel() 438 tmp_iptr = *reach_pos[trans_i->state_id].tags; in tre_tnfa_run_parallel() 439 *reach_pos[trans_i->state_id].tags = tmp_tags; in tre_tnfa_run_parallel() [all …]
|
D | tre.h | 100 int state_id; member
|
/third_party/musl/porting/liteos_m_iccarm/kernel/src/regex/ |
D | regexec.c | 279 if (reach_pos[trans_i->state_id].pos < pos) in tre_tnfa_run_parallel() 306 reach_pos[trans_i->state_id].pos = pos; in tre_tnfa_run_parallel() 307 reach_pos[trans_i->state_id].tags = &reach_next_i->tags; in tre_tnfa_run_parallel() 404 if (reach_pos[trans_i->state_id].pos < pos) in tre_tnfa_run_parallel() 411 reach_pos[trans_i->state_id].pos = pos; in tre_tnfa_run_parallel() 412 reach_pos[trans_i->state_id].tags = &reach_next_i->tags; in tre_tnfa_run_parallel() 429 assert(reach_pos[trans_i->state_id].pos == pos); in tre_tnfa_run_parallel() 435 *reach_pos[trans_i->state_id].tags)) in tre_tnfa_run_parallel() 438 tmp_iptr = *reach_pos[trans_i->state_id].tags; in tre_tnfa_run_parallel() 439 *reach_pos[trans_i->state_id].tags = tmp_tags; in tre_tnfa_run_parallel() [all …]
|
D | tre.h | 102 int state_id; member
|
/third_party/musl/porting/uniproton/kernel/src/regex/ |
D | regexec.c | 279 if (reach_pos[trans_i->state_id].pos < pos) in tre_tnfa_run_parallel() 306 reach_pos[trans_i->state_id].pos = pos; in tre_tnfa_run_parallel() 307 reach_pos[trans_i->state_id].tags = &reach_next_i->tags; in tre_tnfa_run_parallel() 404 if (reach_pos[trans_i->state_id].pos < pos) in tre_tnfa_run_parallel() 411 reach_pos[trans_i->state_id].pos = pos; in tre_tnfa_run_parallel() 412 reach_pos[trans_i->state_id].tags = &reach_next_i->tags; in tre_tnfa_run_parallel() 429 assert(reach_pos[trans_i->state_id].pos == pos); in tre_tnfa_run_parallel() 435 *reach_pos[trans_i->state_id].tags)) in tre_tnfa_run_parallel() 438 tmp_iptr = *reach_pos[trans_i->state_id].tags; in tre_tnfa_run_parallel() 439 *reach_pos[trans_i->state_id].tags = tmp_tags; in tre_tnfa_run_parallel() [all …]
|
D | tre.h | 101 int state_id; member
|
/third_party/boost/boost/spirit/home/lex/lexer/ |
D | string_token_def.hpp | 87 std::size_t state_id = lexdef.add_state(state.c_str()); in collect() local 95 (std::size_t(~0) == token_state_ || state_id == token_state_) && in collect() 102 token_state_ = state_id; in collect()
|
D | char_token_def.hpp | 92 std::size_t state_id = lexdef.add_state(state.c_str()); in collect() local 100 (std::size_t(~0) == token_state_ || state_id == token_state_) && in collect() 107 token_state_ = state_id; in collect()
|
D | token_def.hpp | 132 std::size_t state_id = lexdef.add_state(state.c_str()); in collect() local 140 (std::size_t(~0) == token_state_ || state_id == token_state_) && in collect() 147 token_state_ = state_id; in collect()
|
/third_party/boost/boost/spirit/home/lex/lexer/lexertl/ |
D | static_functor_data.hpp | 252 std::size_t state_id = lexertl::detail::get_state_id(new_state in set_state_name() local 258 BOOST_ASSERT(state_id != boost::lexer::npos); in set_state_name() 260 if (state_id != boost::lexer::npos) in set_state_name() 261 state_ = state_id; in set_state_name()
|
D | functor_data.hpp | 227 std::size_t state_id = this->rules_.state(new_state); in set_state_name() local 232 BOOST_ASSERT(state_id != boost::lexer::npos); in set_state_name() 234 if (state_id != boost::lexer::npos) in set_state_name() 235 state_ = state_id; in set_state_name()
|
/third_party/mesa3d/src/gallium/drivers/freedreno/a6xx/ |
D | fd6_emit.c | 488 enum fd6_state_id state_id; in fd6_emit_combined_textures() member 498 debug_assert(s[type].state_id); in fd6_emit_combined_textures() 522 fd6_emit_add_group(emit, tex->stateobj, s[type].state_id, in fd6_emit_combined_textures() 543 fd6_emit_take_group(emit, stateobj, s[type].state_id, in fd6_emit_combined_textures()
|