+ clear_defs(current_node);
+ set_uses(current_node);
+
+ op = get_irn_op(current_node);
+ peephole_node = (peephole_opt_func)op->ops.generic;
+ if (peephole_node == NULL)
+ continue;
+
+ DB((dbg, LEVEL_2, "optimize %+F\n", current_node));
+ peephole_node(current_node);
+ assert(!is_Bad(current_node));
+ }
+}
+
+/**
+ * Check whether the node has only one user. Explicitly ignore the anchor.
+ */
+bool be_has_only_one_user(ir_node *node)
+{
+ int n = get_irn_n_edges(node);
+ int n_users;
+
+ if (n <= 1)
+ return 1;
+
+ n_users = 0;
+ foreach_out_edge(node, edge) {
+ ir_node *src = get_edge_src_irn(edge);
+ /* ignore anchor and keep-alive edges */
+ if (is_Anchor(src) || is_End(src))
+ continue;
+ n_users++;
+ }
+
+ return n_users == 1;
+}
+
+static inline bool overlapping_regs(const arch_register_t *reg0,
+ const arch_register_req_t *req0, const arch_register_t *reg1,
+ const arch_register_req_t *req1)
+{
+ if (reg0 == NULL || reg1 == NULL)
+ return false;
+ return reg0->global_index < (unsigned)reg1->global_index + req1->width
+ && reg1->global_index < (unsigned)reg0->global_index + req0->width;
+}
+
+bool be_can_move_down(ir_heights_t *heights, const ir_node *node,
+ const ir_node *before)
+{
+ assert(get_nodes_block(node) == get_nodes_block(before));
+ assert(sched_get_time_step(node) < sched_get_time_step(before));
+
+ int node_arity = get_irn_arity(node);
+ ir_node *schedpoint = sched_next(node);
+
+ while (schedpoint != before) {
+ /* schedpoint must not use our computed values */
+ if (heights_reachable_in_block(heights, schedpoint, node))
+ return false;
+
+ /* schedpoint must not overwrite registers of our inputs */
+ unsigned n_outs = arch_get_irn_n_outs(schedpoint);
+ for (int i = 0; i < node_arity; ++i) {
+ ir_node *in = get_irn_n(node, i);
+ const arch_register_t *reg = arch_get_irn_register(in);
+ if (reg == NULL)
+ continue;
+ const arch_register_req_t *in_req
+ = arch_get_irn_register_req_in(node, i);
+ for (unsigned o = 0; o < n_outs; ++o) {
+ const arch_register_t *outreg
+ = arch_get_irn_register_out(schedpoint, o);
+ const arch_register_req_t *outreq
+ = arch_get_irn_register_req_out(schedpoint, o);
+ if (overlapping_regs(reg, in_req, outreg, outreq))
+ return false;
+ }
+ }
+
+ schedpoint = sched_next(schedpoint);
+ }
+ return true;
+}
+
+bool be_can_move_up(ir_heights_t *heights, const ir_node *node,
+ const ir_node *after)
+{
+ unsigned n_outs = arch_get_irn_n_outs(node);
+ const ir_node *node_block = get_nodes_block(node);
+ const ir_node *after_block = get_block_const(after);
+ const ir_node *schedpoint;
+ if (node_block != after_block) {
+ /* currently we can move up exactly 1 block */
+ assert(get_Block_cfgpred_block(node_block, 0) == after_block);
+ ir_node *first = sched_first(node_block);
+
+ /* do not move nodes changing memory */
+ if (is_memop(node)) {
+ ir_node *meminput = get_memop_mem(node);
+ if (!is_NoMem(meminput))
+ return false;
+ }
+
+ /* make sure we can move to the beginning of the succ block */
+ if (node != first && !be_can_move_up(heights, node, sched_prev(first)))
+ return false;
+
+ /* check if node overrides any of live-in values of other successors */
+ ir_graph *irg = get_irn_irg(node);
+ be_lv_t *lv = be_get_irg_liveness(irg);
+ foreach_block_succ(after_block, edge) {
+ ir_node *succ = get_edge_src_irn(edge);
+ if (succ == node_block)
+ continue;
+
+ be_lv_foreach(lv, succ, be_lv_state_in, live_node) {
+ const arch_register_t *reg = arch_get_irn_register(live_node);
+ const arch_register_req_t *req = arch_get_irn_register_req(live_node);
+ for (unsigned o = 0; o < n_outs; ++o) {
+ const arch_register_t *outreg
+ = arch_get_irn_register_out(node, o);
+ const arch_register_req_t *outreq
+ = arch_get_irn_register_req_out(node, o);
+ if (overlapping_regs(outreg, outreq, reg, req))
+ return false;
+ }
+ }
+ sched_foreach(succ, phi) {
+ if (!is_Phi(phi))
+ break;
+ const arch_register_t *reg = arch_get_irn_register(phi);
+ const arch_register_req_t *req = arch_get_irn_register_req(phi);
+ for (unsigned o = 0; o < n_outs; ++o) {
+ const arch_register_t *outreg
+ = arch_get_irn_register_out(node, o);
+ const arch_register_req_t *outreq
+ = arch_get_irn_register_req_out(node, o);
+ if (overlapping_regs(outreg, outreq, reg, req))
+ return false;
+ }