Searched refs:m_nodes (Results 1 - 21 of 21) sorted by relevance

/netbsd-current/external/gpl3/gcc.old/dist/gcc/
H A Dshortest-paths.h67 m_dist (graph.m_nodes.length ()),
68 m_prev (graph.m_nodes.length ())
72 auto_vec<int> queue (graph.m_nodes.length ());
74 for (unsigned i = 0; i < graph.m_nodes.length (); i++)
107 = static_cast <node_t *> (m_graph.m_nodes[idx_with_min_dist]);
H A Ddigraph.h104 auto_delete_vec<node_t> m_nodes; member in class:digraph
166 FOR_EACH_VEC_ELT (m_nodes, i, n)
175 FOR_EACH_VEC_ELT (m_nodes, i, n)
230 m_nodes.safe_push (node);
H A Dfibonacci_heap.h152 m_nodes (0), m_min (NULL), m_root (NULL),
186 return m_nodes == 0;
192 return m_nodes;
274 size_t m_nodes; member in class:fibonacci_heap
393 m_nodes++;
524 heapa->m_nodes += heapb->m_nodes;
617 m_nodes--;
620 if (m_nodes == 0)
H A Ddigraph.cc78 test_node *result = new test_node (name, m_nodes.length ());
H A Ddominance.c121 unsigned int m_nodes; variable
186 m_nodes = 0;
455 m_nodes = m_dfsnum - 1;
458 gcc_assert (m_nodes == (unsigned int) m_n_basic_blocks - 1);
557 for (TBB v = m_nodes; v > 1; v--)
632 for (TBB v = 2; v <= m_nodes; v++)
/netbsd-current/external/gpl3/gcc/dist/gcc/
H A Dshortest-paths.h95 m_dist (graph.m_nodes.length ()),
96 m_best_edge (graph.m_nodes.length ())
100 auto_vec<int> queue (graph.m_nodes.length ());
102 for (unsigned i = 0; i < graph.m_nodes.length (); i++)
136 = static_cast <node_t *> (m_graph.m_nodes[idx_with_min_dist]);
H A Ddigraph.h104 auto_delete_vec<node_t> m_nodes; member in class:digraph
166 FOR_EACH_VEC_ELT (m_nodes, i, n)
175 FOR_EACH_VEC_ELT (m_nodes, i, n)
230 m_nodes.safe_push (node);
H A Dfibonacci_heap.h152 m_nodes (0), m_min (NULL), m_root (NULL),
186 return m_nodes == 0;
192 return m_nodes;
274 size_t m_nodes; member in class:fibonacci_heap
393 m_nodes++;
524 heapa->m_nodes += heapb->m_nodes;
617 m_nodes--;
620 if (m_nodes == 0)
H A Ddominance.cc121 unsigned int m_nodes; member in class:__anon809::dom_info
186 m_nodes = 0;
455 m_nodes = m_dfsnum - 1;
458 gcc_assert (m_nodes == (unsigned int) m_n_basic_blocks - 1);
557 for (TBB v = m_nodes; v > 1; v--)
632 for (TBB v = 2; v <= m_nodes; v++)
H A Ddigraph.cc78 test_node *result = new test_node (name, m_nodes.length ());
/netbsd-current/external/gpl3/gcc.old/dist/gcc/analyzer/
H A Dreachability.h39 : m_indices (graph.m_nodes.length ())
H A Dsupergraph.cc113 const int start_idx = m_nodes.length ();
148 const unsigned num_snodes = m_nodes.length () - start_idx;
153 const int end_idx = m_nodes.length () - 1;
313 FOR_EACH_VEC_ELT (m_nodes, i, n)
390 m_nodes.length ());
391 m_nodes.safe_push (n);
H A Dengine.cc2019 exploded_node *node = new exploded_node (ps, m_nodes.length ());
2371 m_nodes.length ());
2668 FOR_EACH_VEC_ELT (m_nodes, i, enode)
2743 logger->log ("m_nodes.length (): %i", m_nodes.length ());
2768 fprintf (out, "m_nodes.length (): %i\n", m_nodes.length ());
2797 FOR_EACH_VEC_ELT (m_nodes, i, enode)
3301 FOR_EACH_VEC_ELT (m_nodes, i, enode)
3313 warning_at (&richloc, 0, "%i exploded nodes", m_nodes
[all...]
H A Dsupergraph.h151 int num_nodes () const { return m_nodes.length (); }
156 return m_nodes[idx];
/netbsd-current/external/gpl3/gcc/dist/gcc/analyzer/
H A Dreachability.h39 : m_indices (graph.m_nodes.length ())
H A Dtrimmed-graph.cc133 FOR_EACH_VEC_ELT (inner_graph.m_nodes, i, inner_node)
166 logger->log ("#nodes: %i", m_nodes.length ());
H A Dfeasible-graph.cc174 feasible_node *fnode = new feasible_node (enode, m_nodes.length (),
190 = new infeasible_node (eedge->m_dest, m_nodes.length (), rc);
291 logger->log ("#nodes: %i", m_nodes.length ());
293 logger->log ("#feasible nodes: %i", m_nodes.length () - m_num_infeasible);
H A Dsupergraph.cc161 const int start_idx = m_nodes.length ();
220 const unsigned num_snodes = m_nodes.length () - start_idx;
225 const int end_idx = m_nodes.length () - 1;
392 FOR_EACH_VEC_ELT (m_nodes, i, n)
470 FOR_EACH_VEC_ELT (m_nodes, i, n)
501 m_nodes.length ());
502 m_nodes.safe_push (n);
H A Dengine.cc1053 if (m_eg.m_nodes.length ()
2695 exploded_node *node = new exploded_node (ps, m_nodes.length ());
3248 m_nodes.length ());
4117 FOR_EACH_VEC_ELT (m_nodes, i, enode)
4194 logger->log ("m_nodes.length (): %i", m_nodes.length ());
4219 fprintf (out, "m_nodes.length (): %i\n", m_nodes.length ());
4248 FOR_EACH_VEC_ELT (m_nodes, i, enode)
4282 FOR_EACH_VEC_ELT (m_nodes,
[all...]
H A Dsupergraph.h166 int num_nodes () const { return m_nodes.length (); }
171 return m_nodes[idx];
H A Dstate-purge.cc242 for (auto snode : sg.m_nodes)

Completed in 223 milliseconds