nsz Git - libfirm/blob - ir/be/beinsn.c

   1 #ifdef HAVE_CONFIG_H
   2 #include <config.h>
   3 #endif
   4
   5 #include "irgraph_t.h"
   6 #include "irmode_t.h"
   7 #include "irnode_t.h"
   8
   9 #include "besched_t.h"
  10 #include "beinsn_t.h"
  11 #include "beabi.h"
  12 #include "raw_bitset.h"
  13
  14 be_insn_t *be_scan_insn(const be_insn_env_t *env, ir_node *irn)
  15 {
  16         const arch_env_t *arch_env = env->aenv;
  17         struct obstack *obst       = env->obst;
  18         be_operand_t o;
  19         be_insn_t *insn;
  20         int i, n;
  21         int pre_colored = 0;
  22
  23         insn = obstack_alloc(obst, sizeof(insn[0]));
  24         memset(insn, 0, sizeof(insn[0]));
  25
  26         insn->irn       = irn;
  27         insn->next_insn = sched_next(irn);
  28         if(get_irn_mode(irn) == mode_T) {
  29                 ir_node *p;
  30
  31                 for(p = sched_next(irn); is_Proj(p); p = sched_next(p)) {
  32                         if(arch_irn_consider_in_reg_alloc(arch_env, env->cls, p)) {
  33                                 o.req             = arch_get_register_req(arch_env, p, -1);
  34                                 o.carrier         = p;
  35                                 o.irn             = irn;
  36                                 o.pos             = -(get_Proj_proj(p) + 1);
  37                                 o.partner         = NULL;
  38                                 o.has_constraints = arch_register_req_is(o.req, limited);
  39                                 obstack_grow(obst, &o, sizeof(o));
  40                                 insn->n_ops++;
  41                                 insn->out_constraints |= o.has_constraints;
  42                                 pre_colored += arch_get_irn_register(arch_env, p) != NULL;
  43                         }
  44                 }
  45
  46                 insn->next_insn = p;
  47         } else if(arch_irn_consider_in_reg_alloc(arch_env, env->cls, irn)) {
  48                 o.req     = arch_get_register_req(arch_env, irn, -1);
  49                 o.carrier = irn;
  50                 o.irn     = irn;
  51                 o.pos     = -1;
  52                 o.partner = NULL;
  53                 o.has_constraints = arch_register_req_is(o.req, limited);
  54                 obstack_grow(obst, &o, sizeof(o));
  55                 insn->n_ops++;
  56                 insn->out_constraints |= o.has_constraints;
  57                 pre_colored += arch_get_irn_register(arch_env, irn) != NULL;
  58         }
  59
  60         if(pre_colored > 0) {
  61                 assert(pre_colored == insn->n_ops && "partly pre-colored nodes not supported");
  62                 insn->pre_colored = 1;
  63         }
  64         insn->use_start   = insn->n_ops;
  65
  66         for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
  67                 ir_node *op = get_irn_n(irn, i);
  68
  69                 if(!arch_irn_consider_in_reg_alloc(arch_env, env->cls, op))
  70                         continue;
  71
  72                 o.req     = arch_get_register_req(arch_env, irn, i);
  73                 o.carrier = op;
  74                 o.irn     = irn;
  75                 o.pos     = i;
  76                 o.partner = NULL;
  77                 o.has_constraints = arch_register_req_is(o.req, limited);
  78                 obstack_grow(obst, &o, sizeof(o));
  79                 insn->n_ops++;
  80                 insn->in_constraints |= o.has_constraints;
  81         }
  82
  83         insn->has_constraints = insn->in_constraints | insn->out_constraints;
  84         insn->ops = obstack_finish(obst);
  85
  86         /* Compute the admissible registers bitsets. */
  87         for (i = 0; i < insn->n_ops; ++i) {
  88                 be_operand_t *op = &insn->ops[i];
  89                 const arch_register_req_t *req = op->req;
  90
  91 #if 0
  92                 // Matze: can we do without this?
  93                 if (req->cls == NULL && req->type == arch_register_req_type_none) {
  94                         req->cls  = env->cls;
  95                         req->type = arch_register_req_type_normal;
  96                 }
  97 #endif
  98
  99                 assert(req->cls == env->cls);
 100
 101                 op->regs = bitset_obstack_alloc(obst, env->cls->n_regs);
 102
 103                 if (arch_register_req_is(req, limited)) {
 104                         rbitset_copy_to_bitset(req->limited, op->regs);
 105                 } else {
 106                         arch_put_non_ignore_regs(arch_env, env->cls, op->regs);
 107                         if (env->ignore_colors)
 108                                 bitset_andnot(op->regs, env->ignore_colors);
 109                 }
 110         }
 111
 112         return insn;
 113 }
 114
 115 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)
 116 {
 117         ie->aenv = birg->main_env->arch_env;
 118         ie->cls  = cls;
 119         ie->obst = obst;
 120         ie->ignore_colors = bitset_obstack_alloc(obst, cls->n_regs);
 121         be_abi_put_ignore_regs(birg->abi, cls, ie->ignore_colors);
 122
 123         return ie;
 124 }