- fixed r22803
[libfirm] / ir / be / beinsn.c
index 1215cf7..5efcb69 100644 (file)
@@ -1,5 +1,5 @@
 /*
- * Copyright (C) 1995-2007 University of Karlsruhe.  All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe.  All right reserved.
  *
  * This file is part of libFirm.
  *
  * @author      Sebastian Hack
  * @version     $Id$
  */
-#ifdef HAVE_CONFIG_H
 #include "config.h"
-#endif
 
 #include "irgraph_t.h"
 #include "irmode_t.h"
 #include "irnode_t.h"
+#include "iredges.h"
 
 #include "besched_t.h"
 #include "beinsn_t.h"
 #include "beabi.h"
 #include "raw_bitset.h"
 
+/**
+ * Add machine operands to the instruction uses.
+ *
+ * @param env      the insn construction environment
+ * @param insn     the be_insn that is build
+ * @param mach_op  the machine operand for which uses are added
+ */
+static void add_machine_operands(const be_insn_env_t *env, be_insn_t *insn, ir_node *mach_op) {
+       struct obstack *obst = env->obst;
+       int i, n;
+
+       for (i = 0, n = get_irn_arity(mach_op); i < n; ++i) {
+               ir_node *op = get_irn_n(mach_op, i);
+
+               if (is_irn_machine_operand(op)) {
+                       add_machine_operands(env, insn, op);
+               } else if (arch_irn_consider_in_reg_alloc(env->cls, op)) {
+                       be_operand_t o;
+
+                       /* found a register use, create an operand */
+                       o.req     = arch_get_register_req(mach_op, i);
+                       o.carrier = op;
+                       o.irn     = insn->irn;
+                       o.pos     = i;
+                       o.partner = NULL;
+                       o.has_constraints = arch_register_req_is(o.req, limited);
+                       obstack_grow(obst, &o, sizeof(o));
+                       insn->n_ops++;
+                       insn->in_constraints |= o.has_constraints;
+               }
+       }
+}
+
+/**
+ * Create a be_insn_t for an IR node.
+ *
+ * @param env      the insn construction environment
+ * @param irn      the irn for which the be_insn should be build
+ *
+ * @return the be_insn for the IR node
+ */
 be_insn_t *be_scan_insn(const be_insn_env_t *env, ir_node *irn)
 {
-       const arch_env_t *arch_env = env->aenv;
-       struct obstack *obst       = env->obst;
+       struct obstack *obst = env->obst;
        be_operand_t o;
        be_insn_t *insn;
        int i, n;
@@ -51,12 +90,22 @@ be_insn_t *be_scan_insn(const be_insn_env_t *env, ir_node *irn)
 
        insn->irn       = irn;
        insn->next_insn = sched_next(irn);
-       if(get_irn_mode(irn) == mode_T) {
+       if (get_irn_mode(irn) == mode_T) {
+               const ir_edge_t *edge;
                ir_node *p;
 
-               for(p = sched_next(irn); is_Proj(p); p = sched_next(p)) {
-                       if(arch_irn_consider_in_reg_alloc(arch_env, env->cls, p)) {
-                               o.req             = arch_get_register_req(arch_env, p, -1);
+               /* This instruction might create more than one def. These are handled
+                  by Proj's, find them. */
+               foreach_out_edge(irn, edge) {
+                       p = get_edge_src_irn(edge);
+
+                       /* did not work if the result is a ProjT. This should NOT happen
+                          in the backend, but check it for now. */
+                       assert(get_irn_mode(p) != mode_T);
+
+                       if (arch_irn_consider_in_reg_alloc(env->cls, p)) {
+                               /* found a def: create a new operand */
+                               o.req             = arch_get_register_req(p, -1);
                                o.carrier         = p;
                                o.irn             = irn;
                                o.pos             = -(get_Proj_proj(p) + 1);
@@ -65,13 +114,12 @@ be_insn_t *be_scan_insn(const be_insn_env_t *env, ir_node *irn)
                                obstack_grow(obst, &o, sizeof(o));
                                insn->n_ops++;
                                insn->out_constraints |= o.has_constraints;
-                               pre_colored += arch_get_irn_register(arch_env, p) != NULL;
+                               pre_colored += arch_get_irn_register(p) != NULL;
                        }
                }
-
-               insn->next_insn = p;
-       } else if(arch_irn_consider_in_reg_alloc(arch_env, env->cls, irn)) {
-               o.req     = arch_get_register_req(arch_env, irn, -1);
+       } else if (arch_irn_consider_in_reg_alloc(env->cls, irn)) {
+               /* only one def, create one operand */
+               o.req     = arch_get_register_req(irn, -1);
                o.carrier = irn;
                o.irn     = irn;
                o.pos     = -1;
@@ -80,30 +128,33 @@ be_insn_t *be_scan_insn(const be_insn_env_t *env, ir_node *irn)
                obstack_grow(obst, &o, sizeof(o));
                insn->n_ops++;
                insn->out_constraints |= o.has_constraints;
-               pre_colored += arch_get_irn_register(arch_env, irn) != NULL;
+               pre_colored += arch_get_irn_register(irn) != NULL;
        }
 
-       if(pre_colored > 0) {
+       if (pre_colored > 0) {
                assert(pre_colored == insn->n_ops && "partly pre-colored nodes not supported");
                insn->pre_colored = 1;
        }
        insn->use_start   = insn->n_ops;
 
-       for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
+       /* now collect the uses for this node */
+       for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
                ir_node *op = get_irn_n(irn, i);
 
-               if(!arch_irn_consider_in_reg_alloc(arch_env, env->cls, op))
-                       continue;
-
-               o.req     = arch_get_register_req(arch_env, irn, i);
-               o.carrier = op;
-               o.irn     = irn;
-               o.pos     = i;
-               o.partner = NULL;
-               o.has_constraints = arch_register_req_is(o.req, limited);
-               obstack_grow(obst, &o, sizeof(o));
-               insn->n_ops++;
-               insn->in_constraints |= o.has_constraints;
+               if (is_irn_machine_operand(op)) {
+                       add_machine_operands(env, insn, op);
+               } else if (arch_irn_consider_in_reg_alloc(env->cls, op)) {
+                       /* found a register use, create an operand */
+                       o.req     = arch_get_register_req(irn, i);
+                       o.carrier = op;
+                       o.irn     = irn;
+                       o.pos     = i;
+                       o.partner = NULL;
+                       o.has_constraints = arch_register_req_is(o.req, limited);
+                       obstack_grow(obst, &o, sizeof(o));
+                       insn->n_ops++;
+                       insn->in_constraints |= o.has_constraints;
+               }
        }
 
        insn->has_constraints = insn->in_constraints | insn->out_constraints;
@@ -129,7 +180,7 @@ be_insn_t *be_scan_insn(const be_insn_env_t *env, ir_node *irn)
                if (type & arch_register_req_type_limited) {
                        rbitset_copy_to_bitset(req->limited, op->regs);
                } else {
-                       arch_put_non_ignore_regs(arch_env, env->cls, op->regs);
+                       arch_put_non_ignore_regs(env->cls, op->regs);
                        if (env->ignore_colors)
                                bitset_andnot(op->regs, env->ignore_colors);
                }
@@ -142,7 +193,6 @@ be_insn_env_t *be_insn_env_init(be_insn_env_t *ie, const be_irg_t *birg,
                                 const arch_register_class_t *cls,
                                 struct obstack *obst)
 {
-       ie->aenv = be_get_birg_arch_env(birg);
        ie->cls  = cls;
        ie->obst = obst;
        ie->ignore_colors = bitset_obstack_alloc(obst, cls->n_regs);