+}
+
+static void build_graph_walker(ir_node *irn, void *env) {
+ copy_opt_t *co = env;
+ int pos, max;
+ arch_register_req_t req;
+
+ if (!is_curr_reg_class(co, irn) || arch_irn_is_ignore(co->aenv, irn))
+ return;
+
+ /* Phis */
+ if (is_Reg_Phi(irn))
+ for (pos=0, max=get_irn_arity(irn); pos<max; ++pos) {
+ ir_node *arg = get_irn_n(irn, pos);
+ add_edges(co, irn, arg, co->get_costs(irn, arg, pos));
+ }
+
+ /* Perms */
+ else if (is_Perm_Proj(co->aenv, irn)) {
+ ir_node *arg = get_Perm_src(irn);
+ add_edges(co, irn, arg, co->get_costs(irn, arg, 0));
+ }
+
+ /* 2-address code */
+ else if (is_2addr_code(co->aenv, irn, &req))
+ add_edges(co, irn, req.other_same, co->get_costs(irn, req.other_same, 0));
+}
+
+void co_build_graph_structure(copy_opt_t *co) {
+ obstack_init(&co->obst);
+ co->nodes = new_set(compare_node_t, 32);
+
+ irg_walk_graph(co->irg, build_graph_walker, NULL, co);
+}
+
+void co_free_graph_structure(copy_opt_t *co) {
+ del_set(co->nodes);
+ obstack_free(&co->obst, NULL);
+}
+
+/* co_solve_ilp1() co_solve_ilp2() are implemented in becopyilpX.c */
+
+int co_gs_is_optimizable(copy_opt_t *co, ir_node *irn) {
+ node_t new_node, *n;
+
+ new_node.irn = irn;
+ n = set_find(co->nodes, new_node.irn, sizeof(new_node), HASH_PTR(new_node.irn));
+ if (n) {
+ return (n->count > 0);
+ } else
+ return 0;