Home
last modified time | relevance | path

Searched refs:add_edge (Results 1 – 25 of 37) sorted by relevance

12

/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Ddigraph.h102 void add_edge (edge_t *edge);
238 digraph<GraphTraits>::add_edge (edge_t *edge) in add_edge() function
H A Dgraphds.h56 struct graph_edge *add_edge (struct graph *, int, int);
H A Dmcf.cc364 add_edge (fixup_graph_type *fixup_graph, int src, int dest, gcov_type cost) in add_edge() function
387 fixup_edge_p curr_edge = add_edge (fixup_graph, src, dest, cost); in add_fixup_edge()
401 fixup_edge_p curr_edge = add_edge (fixup_graph, src, dest, cost); in add_rfixup_edge()
H A Ddigraph.cc86 add_edge (result); in add_test_edge()
H A Dgraphds.cc70 add_edge (struct graph *g, int f, int t) in add_edge() function
H A Dcfgloopanal.cc142 add_edge (g, src, dest)->data = e; in mark_irreducible_loops()
H A Dgraphite-scop-detection.cc1435 add_edge (g, i, j); in build_alias_set()
1436 add_edge (g, j, i); in build_alias_set()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Ddigraph.h102 void add_edge (edge_t *edge);
238 digraph<GraphTraits>::add_edge (edge_t *edge) in add_edge() function
H A Dgraphds.h56 struct graph_edge *add_edge (struct graph *, int, int);
H A Ddigraph.cc86 add_edge (result); in add_test_edge()
H A Dmcf.c364 add_edge (fixup_graph_type *fixup_graph, int src, int dest, gcov_type cost) in add_edge() function
387 fixup_edge_p curr_edge = add_edge (fixup_graph, src, dest, cost); in add_fixup_edge()
401 fixup_edge_p curr_edge = add_edge (fixup_graph, src, dest, cost); in add_rfixup_edge()
H A Dcfgloopanal.c142 add_edge (g, src, dest)->data = e; in mark_irreducible_loops()
H A Dgraphds.c70 add_edge (struct graph *g, int f, int t) in add_edge() function
H A Dgraphite-scop-detection.c1437 add_edge (g, i, j); in build_alias_set()
1438 add_edge (g, j, i); in build_alias_set()
H A Dtree-loop-distribution.c434 e = add_edge (rdg, idef, use); in create_rdg_edges_for_scalar()
460 e = add_edge (rdg, c, v); in create_edge_for_control_dependence()
2192 struct graph_edge *e = add_edge (pg, i, j); in add_partition_graph_edge()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/analyzer/
H A Dsupergraph.cc246 add_edge (sedge); in supergraph()
412 add_edge (new_edge); in add_cfg_edge()
424 add_edge (new_edge); in add_call_superedge()
436 add_edge (new_edge); in add_return_superedge()
H A Dengine.cc1291 = eg.add_edge (const_cast<exploded_node *> (this), next, NULL, in on_longjmp()
1870 add_edge (m_origin, enode, NULL, change); in add_function_entry()
2060 exploded_graph::add_edge (exploded_node *src, exploded_node *dest, in add_edge() function in ana::exploded_graph
2067 digraph<eg_traits>::add_edge (e); in add_edge()
2268 add_edge (node_2, node, NULL, change); in process_worklist()
2281 add_edge (node, node_2, NULL, change); in process_worklist()
2326 add_edge (node, merged_enode, NULL, change); in process_worklist()
2334 add_edge (node_2, merged_enode, NULL, change); in process_worklist()
2478 add_edge (node, next, NULL, change); in process_node()
2488 add_edge (node, next, NULL, change); in process_node()
[all …]
H A Dsm-signal.cc245 eg->add_edge (src_enode, dst_enode, NULL, state_change (), in impl_transition()
H A Dexploded-graph.h750 exploded_edge *add_edge (exploded_node *src, exploded_node *dest,
/netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/
H A Dsupergraph.cc211 add_edge (sedge); in supergraph()
318 add_edge (sedge); in supergraph()
522 add_edge (new_edge); in add_cfg_edge()
534 add_edge (new_edge); in add_call_superedge()
546 add_edge (new_edge); in add_return_superedge()
H A Dengine.cc1696 = eg.add_edge (const_cast<exploded_node *> (this), next, NULL, in on_longjmp()
2534 add_edge (m_origin, enode, NULL, edge_info); in add_function_entry()
2736 exploded_graph::add_edge (exploded_node *src, exploded_node *dest, in add_edge() function in ana::exploded_graph
2744 digraph<eg_traits>::add_edge (e); in add_edge()
2991 eg->add_edge (eg->get_origin (), enode, NULL, info); in add_tainted_args_callback()
3144 add_edge (node_2, node, NULL); in process_worklist()
3157 add_edge (node, node_2, NULL); in process_worklist()
3202 add_edge (node, merged_enode, NULL); in process_worklist()
3210 add_edge (node_2, merged_enode, NULL); in process_worklist()
3445 add_edge (it->m_input_enode, next, NULL); in maybe_process_run_of_before_supernode_enodes()
[all …]
H A Dtrimmed-graph.cc156 add_edge (tedge); in trimmed_graph()
H A Dfeasible-graph.cc192 add_edge (new infeasible_edge (src_fnode, dst_fnode, eedge)); in add_feasibility_problem()
H A Dsm-signal.cc283 eg->add_edge (src_enode, dst_enode, NULL, /*state_change (),*/ in impl_transition()
H A Dexploded-graph.h832 exploded_edge *add_edge (exploded_node *src, exploded_node *dest,

12