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;
45 be_insn_t *insn = OALLOCZ(obst, be_insn_t);
48 if (get_irn_mode(irn) == mode_T) {
51 /* This instruction might create more than one def. These are handled
52 by Proj's, find them. */
53 foreach_out_edge(irn, edge) {
54 p = get_edge_src_irn(edge);
56 /* did not work if the result is a ProjT. This should NOT happen
57 in the backend, but check it for now. */
58 assert(get_irn_mode(p) != mode_T);
60 if (arch_irn_consider_in_reg_alloc(env->cls, p)) {
61 /* found a def: create a new operand */
62 o.req = arch_get_irn_register_req(p);
65 o.pos = -(get_Proj_proj(p) + 1);
67 o.has_constraints = arch_register_req_is(o.req, limited) | (o.req->width > 1);
68 obstack_grow(obst, &o, sizeof(o));
70 insn->has_constraints |= o.has_constraints;
73 } else if (arch_irn_consider_in_reg_alloc(env->cls, irn)) {
74 /* only one def, create one operand */
75 o.req = arch_get_irn_register_req(irn);
80 o.has_constraints = arch_register_req_is(o.req, limited) | (o.req->width > 1);
81 obstack_grow(obst, &o, sizeof(o));
83 insn->has_constraints |= o.has_constraints;
86 insn->use_start = insn->n_ops;
88 /* now collect the uses for this node */
89 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
90 ir_node *op = get_irn_n(irn, i);
92 if (arch_irn_consider_in_reg_alloc(env->cls, op)) {
93 /* found a register use, create an operand */
94 o.req = arch_get_irn_register_req_in(irn, i);
99 o.has_constraints = arch_register_req_is(o.req, limited);
100 obstack_grow(obst, &o, sizeof(o));
102 insn->has_constraints |= o.has_constraints;
106 insn->ops = (be_operand_t*)obstack_finish(obst);
108 /* Compute the admissible registers bitsets. */
109 for (i = 0; i < insn->n_ops; ++i) {
110 be_operand_t *const op = &insn->ops[i];
111 arch_register_req_t const *const req = op->req;
112 assert(req->cls == env->cls);
114 if (req->type & arch_register_req_type_limited) {
115 bitset_t *regs = bitset_obstack_alloc(obst, env->cls->n_regs);
116 rbitset_copy_to_bitset(req->limited, regs);
119 op->regs = env->allocatable_regs;