2 * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
4 * This file is part of libFirm.
6 * This file may be distributed and/or modified under the terms of the
7 * GNU General Public License version 2 as published by the Free Software
8 * Foundation and appearing in the file LICENSE.GPL included in the
9 * packaging of this file.
11 * Licensees holding valid libFirm Professional Edition licenses may use
12 * this file in accordance with the libFirm Commercial License.
13 * Agreement provided with the Software.
15 * This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
16 * WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * @brief A data structure to treat nodes and node-proj collections uniformly.
23 * @author Sebastian Hack
27 #include "irgraph_t.h"
32 #include "bechordal_t.h"
37 #include "raw_bitset.h"
39 be_insn_t *be_scan_insn(be_chordal_env_t const *const env, ir_node *const irn)
41 struct obstack *obst = env->obst;
46 be_insn_t *insn = OALLOCZ(obst, be_insn_t);
49 if (get_irn_mode(irn) == mode_T) {
52 /* This instruction might create more than one def. These are handled
53 by Proj's, find them. */
54 foreach_out_edge(irn, edge) {
55 p = get_edge_src_irn(edge);
57 /* did not work if the result is a ProjT. This should NOT happen
58 in the backend, but check it for now. */
59 assert(get_irn_mode(p) != mode_T);
61 if (arch_irn_consider_in_reg_alloc(env->cls, p)) {
62 /* found a def: create a new operand */
63 o.req = arch_get_irn_register_req(p);
66 o.pos = -(get_Proj_proj(p) + 1);
68 o.has_constraints = arch_register_req_is(o.req, limited) | (o.req->width > 1);
69 obstack_grow(obst, &o, sizeof(o));
71 insn->has_constraints |= o.has_constraints;
72 pre_colored += arch_get_irn_register(p) != NULL;
75 } else if (arch_irn_consider_in_reg_alloc(env->cls, irn)) {
76 /* only one def, create one operand */
77 o.req = arch_get_irn_register_req(irn);
82 o.has_constraints = arch_register_req_is(o.req, limited) | (o.req->width > 1);
83 obstack_grow(obst, &o, sizeof(o));
85 insn->has_constraints |= o.has_constraints;
86 pre_colored += arch_get_irn_register(irn) != NULL;
89 if (pre_colored > 0) {
90 assert(pre_colored == insn->n_ops && "partly pre-colored nodes not supported");
91 insn->pre_colored = 1;
93 insn->use_start = insn->n_ops;
95 /* now collect the uses for this node */
96 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
97 ir_node *op = get_irn_n(irn, i);
99 if (arch_irn_consider_in_reg_alloc(env->cls, op)) {
100 /* found a register use, create an operand */
101 o.req = arch_get_irn_register_req_in(irn, i);
106 o.has_constraints = arch_register_req_is(o.req, limited);
107 obstack_grow(obst, &o, sizeof(o));
109 insn->has_constraints |= o.has_constraints;
113 insn->ops = (be_operand_t*)obstack_finish(obst);
115 /* Compute the admissible registers bitsets. */
116 for (i = 0; i < insn->n_ops; ++i) {
117 be_operand_t *const op = &insn->ops[i];
118 arch_register_req_t const *const req = op->req;
119 assert(req->cls == env->cls);
121 if (req->type & arch_register_req_type_limited) {
122 bitset_t *regs = bitset_obstack_alloc(obst, env->cls->n_regs);
123 rbitset_copy_to_bitset(req->limited, regs);
126 op->regs = env->allocatable_regs;