Home
last modified time | relevance | path

Searched refs:master_clone (Results 1 – 3 of 3) sorted by relevance

/openbsd-src/gnu/gcc/gcc/
H A Dcgraph.c215 if (!node->master_clone) in cgraph_node()
216 node->master_clone = node; in cgraph_node()
228 node->master_clone = node; in cgraph_node()
567 n->master_clone = new_node; in cgraph_remove_node()
710 if (node->master_clone && node->master_clone->uid != node->uid) in dump_cgraph_node()
711 fprintf (f, "(%i)", node->master_clone->uid); in dump_cgraph_node()
1082 new->master_clone = n->master_clone; in cgraph_clone_node()
1124 if (!n->master_clone) in cgraph_master_clone()
1125 n->master_clone = cgraph_node (n->decl); in cgraph_master_clone()
1127 return n->master_clone; in cgraph_master_clone()
H A Dipa-inline.c580 struct cgraph_node *master_clone, *next; in cgraph_decide_recursive_inlining() local
608 master_clone = cgraph_clone_node (node, node->count, 1, false); in cgraph_decide_recursive_inlining()
609 master_clone->needed = true; in cgraph_decide_recursive_inlining()
610 for (e = master_clone->callees; e; e = e->next_callee) in cgraph_decide_recursive_inlining()
616 && (cgraph_estimate_size_after_inlining (1, node, master_clone) in cgraph_decide_recursive_inlining()
663 cgraph_redirect_edge_callee (curr, master_clone); in cgraph_decide_recursive_inlining()
675 master_clone->global.insns, node->global.insns); in cgraph_decide_recursive_inlining()
680 for (node = cgraph_nodes; node != master_clone; in cgraph_decide_recursive_inlining()
684 if (node->global.inlined_to == master_clone) in cgraph_decide_recursive_inlining()
687 cgraph_remove_node (master_clone); in cgraph_decide_recursive_inlining()
H A Dcgraph.h135 struct cgraph_node *master_clone; member