X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=ir%2Fbe%2Fbeinsn.c;h=2f7a290098439a7d04aebbde3906346d27359cff;hb=5474a1c188c9d59eea2c915515980cd9cbab58d8;hp=0ff3955c8519ccdc770ef246d3ada7395066d583;hpb=205396c4f4f5abe7abd6dc2350c8c398a7623afc;p=libfirm diff --git a/ir/be/beinsn.c b/ir/be/beinsn.c index 0ff3955c8..2f7a29009 100644 --- a/ir/be/beinsn.c +++ b/ir/be/beinsn.c @@ -1,37 +1,76 @@ -#ifdef HAVE_CONFIG_H +/* + * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved. + * + * This file is part of libFirm. + * + * This file may be distributed and/or modified under the terms of the + * GNU General Public License version 2 as published by the Free Software + * Foundation and appearing in the file LICENSE.GPL included in the + * packaging of this file. + * + * Licensees holding valid libFirm Professional Edition licenses may use + * this file in accordance with the libFirm Commercial License. + * Agreement provided with the Software. + * + * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE + * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR + * PURPOSE. + */ + +/** + * @file + * @brief A data structure to treat nodes and node-proj collections uniformly. + * @author Sebastian Hack + */ #include "config.h" -#endif #include "irgraph_t.h" #include "irmode_t.h" #include "irnode_t.h" +#include "iredges.h" -#include "besched_t.h" +#include "besched.h" #include "beinsn_t.h" -#include "beirg_t.h" +#include "beirg.h" #include "beabi.h" #include "raw_bitset.h" +/** + * 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; int pre_colored = 0; - insn = obstack_alloc(obst, sizeof(insn[0])); - memset(insn, 0, sizeof(insn[0])); + insn = OALLOCZ(obst, be_insn_t); 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_irn_register_req(p); o.carrier = p; o.irn = irn; o.pos = -(get_Proj_proj(p) + 1); @@ -40,13 +79,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_irn_register_req(irn); o.carrier = irn; o.irn = irn; o.pos = -1; @@ -55,34 +93,35 @@ 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 (arch_irn_consider_in_reg_alloc(env->cls, op)) { + /* found a register use, create an operand */ + 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; + } } insn->has_constraints = insn->in_constraints | insn->out_constraints; - insn->ops = obstack_finish(obst); + insn->ops = (be_operand_t*)obstack_finish(obst); /* Compute the admissible registers bitsets. */ for (i = 0; i < insn->n_ops; ++i) { @@ -99,29 +138,14 @@ be_insn_t *be_scan_insn(const be_insn_env_t *env, ir_node *irn) assert(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); + bitset_t *regs = bitset_obstack_alloc(obst, env->cls->n_regs); + rbitset_copy_to_bitset(req->limited, regs); + op->regs = regs; } else { - arch_put_non_ignore_regs(arch_env, env->cls, op->regs); - if (env->ignore_colors) - bitset_andnot(op->regs, env->ignore_colors); + op->regs = env->allocatable_regs; } } 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->aenv = be_get_birg_arch_env(birg); - 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; -}