Home
last modified time | relevance | path

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

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