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"
36 #include "raw_bitset.h"
39 * Create a be_insn_t for an IR node.
41 * @param env the insn construction environment
42 * @param irn the irn for which the be_insn should be build
44 * @return the be_insn for the IR node
46 be_insn_t *be_scan_insn(const be_insn_env_t *env, ir_node *irn)
48 struct obstack *obst = env->obst;
54 insn = OALLOCZ(obst, be_insn_t);
57 insn->next_insn = sched_next(irn);
58 if (get_irn_mode(irn) == mode_T) {
61 /* This instruction might create more than one def. These are handled
62 by Proj's, find them. */
63 foreach_out_edge(irn, edge) {
64 p = get_edge_src_irn(edge);
66 /* did not work if the result is a ProjT. This should NOT happen
67 in the backend, but check it for now. */
68 assert(get_irn_mode(p) != mode_T);
70 if (arch_irn_consider_in_reg_alloc(env->cls, p)) {
71 /* found a def: create a new operand */
72 o.req = arch_get_irn_register_req(p);
75 o.pos = -(get_Proj_proj(p) + 1);
77 o.has_constraints = arch_register_req_is(o.req, limited) | (o.req->width > 1);
78 obstack_grow(obst, &o, sizeof(o));
80 insn->out_constraints |= o.has_constraints;
81 pre_colored += arch_get_irn_register(p) != NULL;
84 } else if (arch_irn_consider_in_reg_alloc(env->cls, irn)) {
85 /* only one def, create one operand */
86 o.req = arch_get_irn_register_req(irn);
91 o.has_constraints = arch_register_req_is(o.req, limited) | (o.req->width > 1);
92 obstack_grow(obst, &o, sizeof(o));
94 insn->out_constraints |= o.has_constraints;
95 pre_colored += arch_get_irn_register(irn) != NULL;
98 if (pre_colored > 0) {
99 assert(pre_colored == insn->n_ops && "partly pre-colored nodes not supported");
100 insn->pre_colored = 1;
102 insn->use_start = insn->n_ops;
104 /* now collect the uses for this node */
105 for (i = 0, n = get_irn_arity(irn); i < n; ++i) {
106 ir_node *op = get_irn_n(irn, i);
108 if (arch_irn_consider_in_reg_alloc(env->cls, op)) {
109 /* found a register use, create an operand */
110 o.req = arch_get_irn_register_req_in(irn, i);
115 o.has_constraints = arch_register_req_is(o.req, limited);
116 obstack_grow(obst, &o, sizeof(o));
118 insn->in_constraints |= o.has_constraints;
122 insn->has_constraints = insn->in_constraints | insn->out_constraints;
123 insn->ops = (be_operand_t*)obstack_finish(obst);
125 /* Compute the admissible registers bitsets. */
126 for (i = 0; i < insn->n_ops; ++i) {
127 be_operand_t *op = &insn->ops[i];
128 const arch_register_req_t *req = op->req;
129 const arch_register_class_t *cls = req->cls;
130 arch_register_req_type_t type = req->type;
132 /* If there is no special requirement, we allow current class here */
133 if (cls == NULL && req->type == arch_register_req_type_none) {
135 type = arch_register_req_type_normal;
138 assert(cls == env->cls);
140 if (type & arch_register_req_type_limited) {
141 bitset_t *regs = bitset_obstack_alloc(obst, env->cls->n_regs);
142 rbitset_copy_to_bitset(req->limited, regs);
145 op->regs = env->allocatable_regs;