2 * Copyright (C) 1995-2011 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 additional backend node infos
23 * @author Matthias Braun
25 #ifndef FIRM_BE_BEINFO_H
26 #define FIRM_BE_BEINFO_H
32 * The schedule structure which is present at each ir node.
34 * Currently, only basic blocks are scheduled. The list head of
35 * every block schedule list is the Block list.
40 sched_timestep_t time_step; /**< If a is after b in a schedule, its time step is larger than b's. */
43 struct reg_out_info_t {
44 const arch_register_t *reg;
45 const arch_register_req_t *req;
48 struct backend_info_t {
49 sched_info_t sched_info;
50 const arch_register_req_t **in_reqs;
51 reg_out_info_t *out_infos;
52 arch_irn_flags_t flags;
55 static inline backend_info_t *be_get_info(const ir_node *node)
57 return (backend_info_t*) node->backend_info;
60 void be_info_init(void);
61 void be_info_free(void);
62 void be_info_init_irg(ir_graph *irg);
63 void be_info_new_node(ir_graph *irg, ir_node *node);
64 void be_info_duplicate(const ir_node *old_node, ir_node *new_node);
65 int be_info_initialized(const ir_graph *irg);
67 int be_nodes_equal(const ir_node *node1, const ir_node *node2);