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"
36 #include "raw_bitset.h"
38 be_insn_t *be_scan_insn(be_chordal_env_t *const env, ir_node *const irn)
40 struct obstack *const obst = &env->obst;
44 be_insn_t *insn = OALLOCZ(obst, be_insn_t);
46 bool has_constraints = false;
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 arch_register_req_t const *const req = arch_get_irn_register_req(p);
64 if (arch_register_req_is(req, limited)) {
65 o.regs = req->limited;
66 has_constraints = true;
68 o.regs = env->allocatable_regs->data;
69 has_constraints |= req->width > 1;
73 obstack_grow(obst, &o, sizeof(o));
77 } else if (arch_irn_consider_in_reg_alloc(env->cls, irn)) {
78 /* only one def, create one operand */
79 arch_register_req_t const *const req = arch_get_irn_register_req(irn);
80 if (arch_register_req_is(req, limited)) {
81 o.regs = req->limited;
82 has_constraints = true;
84 o.regs = env->allocatable_regs->data;
85 has_constraints |= req->width > 1;
89 obstack_grow(obst, &o, sizeof(o));
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 arch_register_req_t const *const req = arch_get_irn_register_req_in(irn, i);
102 if (arch_register_req_is(req, limited)) {
103 o.regs = req->limited;
104 has_constraints = true;
106 o.regs = env->allocatable_regs->data;
110 obstack_grow(obst, &o, sizeof(o));
115 if (!has_constraints)
118 insn->ops = (be_operand_t*)obstack_finish(obst);