Home
last modified time | relevance | path

Searched refs:inner_node (Results 1 – 6 of 6) sorted by relevance

/netbsd-src/external/bsd/kyua-cli/dist/utils/config/
H A Dnodes.cpp51 config::detail::inner_node::inner_node(const bool dynamic_) : in inner_node() function in config::detail::inner_node
58 config::detail::inner_node::~inner_node(void) in ~inner_node()
71 config::detail::inner_node::copy_into(inner_node* node) const in copy_into()
101 config::detail::inner_node::lookup_ro(const tree_key& key, in lookup_ro()
116 const inner_node& child = dynamic_cast< const inner_node& >( in lookup_ro()
146 config::detail::inner_node::lookup_rw(const tree_key& key, in lookup_rw()
177 inner_node& child = dynamic_cast< inner_node& >( in lookup_rw()
194 config::detail::inner_node::all_properties(properties_map& properties, in all_properties()
206 inner_node& child = dynamic_cast< inner_node& >(*(*iter).second); in all_properties()
215 inner_node(false) in static_inner_node()
[all …]
H A Dnodes.ipp76 class inner_node : public base_node {
90 void copy_into(inner_node* new_node) const;
93 inner_node(const bool);
94 virtual ~inner_node(void) = 0;
110 class static_inner_node : public config::detail::inner_node {
126 class dynamic_inner_node : public config::detail::inner_node {
H A Dtree.cpp251 const detail::inner_node& child = in all_properties()
252 dynamic_cast< const detail::inner_node& >(*raw_node); in all_properties()
/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/
H A Dtrimmed-graph.cc113 const exploded_node *inner_node = worklist.pop (); in trimmed_graph() local
116 FOR_EACH_VEC_ELT (inner_node->m_preds, i, inner_pred) in trimmed_graph()
131 exploded_node *inner_node; in trimmed_graph() local
133 FOR_EACH_VEC_ELT (inner_graph.m_nodes, i, inner_node) in trimmed_graph()
134 if (m_enodes.contains (inner_node)) in trimmed_graph()
136 trimmed_node *tnode = new trimmed_node (inner_node); in trimmed_graph()
138 m_map_from_enode_to_tnode.put (inner_node, tnode); in trimmed_graph()
H A Dfeasible-graph.h70 base_feasible_node (const exploded_node *inner_node, unsigned index) in base_feasible_node() argument
71 : m_inner_node (inner_node), m_index (index) in base_feasible_node()
84 feasible_node (const exploded_node *inner_node, unsigned index, in feasible_node() argument
87 : base_feasible_node (inner_node, index), in feasible_node()
117 infeasible_node (const exploded_node *inner_node, unsigned index, in infeasible_node() argument
119 : base_feasible_node (inner_node, index), in infeasible_node()
H A Dtrimmed-graph.h60 trimmed_node (const exploded_node *inner_node) in trimmed_node() argument
61 : m_inner_node (inner_node) {} in trimmed_node()