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
  13 be_insn_t *be_scan_insn(const be_insn_env_t *env, ir_node *irn)
  14 {
  15         const arch_env_t *arch_env = env->aenv;
  16         struct obstack *obst       = env->obst;
  17         be_operand_t o;
  18         be_insn_t *insn;
  19         int i, n;
  20         int pre_colored = 0;
  21
  22         insn = obstack_alloc(obst, sizeof(insn[0]));
  23         memset(insn, 0, sizeof(insn[0]));
  24
  25         insn->irn       = irn;
  26         insn->next_insn = sched_next(irn);
  27         if(get_irn_mode(irn) == mode_T) {
  28                 ir_node *p;
  29
  30                 for(p = sched_next(irn); is_Proj(p); p = sched_next(p)) {
  31                         if(arch_irn_consider_in_reg_alloc(arch_env, env->cls, p)) {
  32                                 arch_get_register_req(arch_env, &o.req, p, -1);
  33                                 o.carrier         = p;
  34                                 o.irn             = irn;
  35                                 o.pos             = -(get_Proj_proj(p) + 1);
  36                                 o.partner         = NULL;
  37                                 o.has_constraints = arch_register_req_is(&o.req, limited);
  38                                 obstack_grow(obst, &o, sizeof(o));
  39                                 insn->n_ops++;
  40                                 insn->out_constraints |= o.has_constraints;
  41                                 pre_colored += arch_get_irn_register(arch_env, p) != NULL;
  42                         }
  43                 }
  44
  45                 insn->next_insn = p;
  46         }
  47         else if(arch_irn_consider_in_reg_alloc(arch_env, env->cls, irn)) {
  48                 arch_get_register_req(arch_env, &o.req, 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         insn->pre_colored = pre_colored == insn->n_ops && insn->n_ops > 0;
  61         insn->use_start   = insn->n_ops;
  62
  63         for(i = 0, n = get_irn_arity(irn); i < n; ++i) {
  64                 ir_node *op = get_irn_n(irn, i);
  65
  66                 if(!arch_irn_consider_in_reg_alloc(arch_env, env->cls, op))
  67                         continue;
  68
  69                 arch_get_register_req(arch_env, &o.req, irn, i);
  70                 o.carrier = op;
  71                 o.irn     = irn;
  72                 o.pos     = i;
  73                 o.partner = NULL;
  74                 o.has_constraints = arch_register_req_is(&o.req, limited);
  75                 obstack_grow(obst, &o, sizeof(o));
  76                 insn->n_ops++;
  77                 insn->in_constraints |= o.has_constraints;
  78         }
  79
  80         insn->has_constraints = insn->in_constraints | insn->out_constraints;
  81         insn->ops = obstack_finish(obst);
  82
  83         /* Compute the admissible registers bitsets. */
  84         for (i = 0; i < insn->n_ops; ++i) {
  85                 be_operand_t *op = &insn->ops[i];
  86
  87                 if (op->req.cls == NULL && op->req.type == arch_register_req_type_none) {
  88                         op->req.cls  = env->cls;
  89                         op->req.type = arch_register_req_type_normal;
  90                 }
  91
  92                 assert(op->req.cls == env->cls);
  93                 op->regs = bitset_obstack_alloc(obst, env->cls->n_regs);
  94
  95                 if (arch_register_req_is(&op->req, limited))
  96                         op->req.limited(op->req.limited_env, op->regs);
  97                 else {
  98                         arch_put_non_ignore_regs(arch_env, env->cls, op->regs);
  99                         if (env->ignore_colors)
 100                                 bitset_andnot(op->regs, env->ignore_colors);
 101                 }
 102         }
 103
 104         return insn;
 105 }
 106
 107 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)
 108 {
 109         ie->aenv = birg->main_env->arch_env;
 110         ie->cls  = cls;
 111         ie->obst = obst;
 112         ie->ignore_colors = bitset_obstack_alloc(obst, cls->n_regs);
 113         be_abi_put_ignore_regs(birg->abi, cls, ie->ignore_colors);
 114         return ie;
 115 }