| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| trimmed-graph.cc | 101 const exploded_node *inner_node = worklist.pop (); local
104 FOR_EACH_VEC_ELT (inner_node->m_preds, i, inner_pred)
119 exploded_node *inner_node; local
121 FOR_EACH_VEC_ELT (inner_graph.m_nodes, i, inner_node)
122 if (m_enodes.contains (inner_node))
124 trimmed_node *tnode = new trimmed_node (inner_node);
126 m_map_from_enode_to_tnode.put (inner_node, tnode);
|
| feasible-graph.h | 72 base_feasible_node (const exploded_node *inner_node, unsigned index)
73 : m_inner_node (inner_node), m_index (index)
86 feasible_node (const exploded_node *inner_node, unsigned index,
89 : base_feasible_node (inner_node, index),
122 infeasible_node (const exploded_node *inner_node, unsigned index,
124 : base_feasible_node (inner_node, index),
|
| trimmed-graph.h | 60 trimmed_node (const exploded_node *inner_node)
61 : m_inner_node (inner_node) {}
|
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| trimmed-graph.cc | 113 const exploded_node *inner_node = worklist.pop (); local
116 FOR_EACH_VEC_ELT (inner_node->m_preds, i, inner_pred)
131 exploded_node *inner_node; local
133 FOR_EACH_VEC_ELT (inner_graph.m_nodes, i, inner_node)
134 if (m_enodes.contains (inner_node))
136 trimmed_node *tnode = new trimmed_node (inner_node);
138 m_map_from_enode_to_tnode.put (inner_node, tnode);
|
| feasible-graph.h | 70 base_feasible_node (const exploded_node *inner_node, unsigned index)
71 : m_inner_node (inner_node), m_index (index)
84 feasible_node (const exploded_node *inner_node, unsigned index,
87 : base_feasible_node (inner_node, index),
117 infeasible_node (const exploded_node *inner_node, unsigned index,
119 : base_feasible_node (inner_node, index),
|
| trimmed-graph.h | 60 trimmed_node (const exploded_node *inner_node)
61 : m_inner_node (inner_node) {}
|
| /src/external/bsd/kyua-cli/dist/utils/config/ |
| nodes.cpp | 51 config::detail::inner_node::inner_node(const bool dynamic_) : function in class:config::detail::inner_node
58 config::detail::inner_node::~inner_node(void)
71 config::detail::inner_node::copy_into(inner_node* node) const
101 config::detail::inner_node::lookup_ro(const tree_key& key,
116 const inner_node& child = dynamic_cast< const inner_node& >(
146 config::detail::inner_node::lookup_rw(const tree_key& key
[all...] |
| tree.cpp | 251 const detail::inner_node& child =
252 dynamic_cast< const detail::inner_node& >(*raw_node);
|
