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