* @file
* @brief A data structure to treat nodes and node-proj collections uniformly.
* @author Sebastian Hack
- * @version $Id$
*/
#include "config.h"
#include "irnode_t.h"
#include "iredges.h"
+#include "bechordal_t.h"
#include "besched.h"
#include "beinsn_t.h"
-#include "beirg.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)
+be_insn_t *be_scan_insn(be_chordal_env_t const *const env, ir_node *const irn)
{
struct obstack *obst = env->obst;
be_operand_t o;
- be_insn_t *insn;
int i, n;
- int pre_colored = 0;
- insn = OALLOCZ(obst, be_insn_t);
+ be_insn_t *insn = OALLOCZ(obst, be_insn_t);
+
+ bool has_constraints = false;
- insn->irn = irn;
- insn->next_insn = sched_next(irn);
+ insn->irn = irn;
if (get_irn_mode(irn) == mode_T) {
- const ir_edge_t *edge;
ir_node *p;
/* This instruction might create more than one def. These are handled
if (arch_irn_consider_in_reg_alloc(env->cls, p)) {
/* found a def: create a new operand */
- o.req = arch_get_register_req_out(p);
+ o.req = arch_get_irn_register_req(p);
o.carrier = p;
- o.irn = irn;
- o.pos = -(get_Proj_proj(p) + 1);
o.partner = NULL;
- o.has_constraints = arch_register_req_is(o.req, limited);
obstack_grow(obst, &o, sizeof(o));
insn->n_ops++;
- insn->out_constraints |= o.has_constraints;
- pre_colored += arch_get_irn_register(p) != NULL;
+ has_constraints |= arch_register_req_is(o.req, limited) | (o.req->width > 1);
}
}
} else if (arch_irn_consider_in_reg_alloc(env->cls, irn)) {
/* only one def, create one operand */
- o.req = arch_get_register_req_out(irn);
+ o.req = arch_get_irn_register_req(irn);
o.carrier = irn;
- o.irn = irn;
- o.pos = -1;
o.partner = NULL;
- o.has_constraints = arch_register_req_is(o.req, limited);
obstack_grow(obst, &o, sizeof(o));
insn->n_ops++;
- insn->out_constraints |= o.has_constraints;
- pre_colored += arch_get_irn_register(irn) != NULL;
+ has_constraints |= arch_register_req_is(o.req, limited) | (o.req->width > 1);
}
- 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;
+ insn->use_start = insn->n_ops;
/* 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 (is_irn_machine_operand(op)) {
- add_machine_operands(env, insn, op);
- } else if (arch_irn_consider_in_reg_alloc(env->cls, op)) {
+ 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.req = arch_get_irn_register_req_in(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;
+ has_constraints |= arch_register_req_is(o.req, limited);
}
}
- insn->has_constraints = insn->in_constraints | insn->out_constraints;
- insn->ops = obstack_finish(obst);
+ if (!has_constraints)
+ return NULL;
+
+ insn->ops = (be_operand_t*)obstack_finish(obst);
/* Compute the admissible registers bitsets. */
for (i = 0; i < insn->n_ops; ++i) {
- be_operand_t *op = &insn->ops[i];
- const arch_register_req_t *req = op->req;
- const arch_register_class_t *cls = req->cls;
- arch_register_req_type_t type = req->type;
-
- /* If there is no special requirement, we allow current class here */
- if (cls == NULL && req->type == arch_register_req_type_none) {
- cls = env->cls;
- type = arch_register_req_type_normal;
- }
-
- assert(cls == env->cls);
+ be_operand_t *const op = &insn->ops[i];
+ arch_register_req_t const *const req = op->req;
+ assert(req->cls == env->cls);
- op->regs = bitset_obstack_alloc(obst, env->cls->n_regs);
-
- if (type & arch_register_req_type_limited) {
- rbitset_copy_to_bitset(req->limited, op->regs);
- } else {
- arch_put_non_ignore_regs(env->cls, op->regs);
- if (env->ignore_colors)
- bitset_andnot(op->regs, env->ignore_colors);
- }
+ op->regs = arch_register_req_is(req, limited) ?
+ req->limited : env->allocatable_regs->data;
}
return insn;
}
-
-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->cls = cls;
- ie->obst = obst;
- ie->ignore_colors = bitset_obstack_alloc(obst, cls->n_regs);
- be_abi_put_ignore_regs(birg->abi, cls, ie->ignore_colors);
-
- return ie;
-}
projects / libfirm / blobdiff