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;
43 be_insn_t *insn = OALLOCZ(obst, be_insn_t);
45 bool has_constraints = false;
47 const arch_register_class_t *cls = env->cls;
49 be_foreach_definition(irn, cls, p, req,
50 /* found a def: create a new operand */
51 if (arch_register_req_is(req, limited)) {
52 o.regs = req->limited;
53 has_constraints = true;
55 o.regs = env->allocatable_regs->data;
56 has_constraints |= req->width > 1;
60 obstack_grow(obst, &o, sizeof(o));
64 insn->use_start = insn->n_ops;
66 /* now collect the uses for this node */
67 be_foreach_use(irn, cls, in_req, op, op_req,
68 /* found a register use, create an operand */
69 if (arch_register_req_is(in_req, limited)) {
70 o.regs = in_req->limited;
71 has_constraints = true;
73 o.regs = env->allocatable_regs->data;
77 obstack_grow(obst, &o, sizeof(o));
84 insn->ops = (be_operand_t*)obstack_finish(obst);