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 Mips implementation of list scheduler selector
23 * @author Matthias Braun, Mehdi
28 #include "mips_scheduler.h"
30 #include "../besched_t.h"
35 #include "gen_mips_regalloc_if.h"
37 #include "mips_new_nodes.h"
39 list_sched_selector_t mips_sched_selector;
44 * This array holds an entry for each register that specifies how much cycles
45 * have to pass before we can access that register again
46 * (because mips will write the register value back in the WB phase of the pipeline)
48 int busy_registers[N_mips_gp_REGS];
54 /* Matze: deprecated and totally broken */
57 static void *mips_scheduler_init_graph(const list_sched_selector_t *vtab, ir_graph *irg)
59 mips_sched_env_t *sched_env = XMALLOCZ(mips_sched_env_t);
61 sched_env->div_set = new_pset(pset_default_ptr_cmp, 4);
66 static void mips_scheduler_finish_graph(void* graph_env)
68 mips_sched_env_t *sched_env = (mips_sched_env_t*) graph_env;
69 del_pset(sched_env->div_set);
72 static void *mips_scheduler_init_block(void *graph_env, ir_node *block)
74 mips_sched_env_t *sched_env = (mips_sched_env_t*) graph_env;
75 assert(pset_count(sched_env->div_set) == 0);
77 // TODO later we might have blocks that don't end in a jump
78 memset(&sched_env->busy_registers, 0, sizeof(sched_env->busy_registers));
79 sched_env->block = block;
80 sched_env->last_nop = NULL;
84 static void mips_scheduler_finish_block(void* graph_env)
86 mips_sched_env_t *sched_env = (mips_sched_env_t*) graph_env;
87 // attach last nop to end node (so that firm doesn't discard it)
88 if(sched_env->last_nop != NULL) {
89 ir_node* end = get_irg_end(get_irn_irg(sched_env->block));
93 sched_env->block = NULL;
96 static int mips_scheduler_to_appear_in_schedule(void *block_env, const ir_node *irn)
98 return is_mips_irn(irn) && !is_mips_zero(irn) && !is_mips_reinterpret_conv(irn) && !is_mips_fallthrough(irn);
101 static void mips_collect_mflohis(pset* set, ir_node* node) {
102 // construct a list of nodes that need to be scheduled before
103 // we are allowed to schedule another div or mul instruction
104 const ir_edge_t *edge, *edge2;
106 if(is_mips_div(node)) {
107 foreach_out_edge(node, edge) {
108 const ir_node* node2 = get_edge_src_irn(edge);
110 assert(is_Proj(node2));
111 foreach_out_edge(node2, edge2) {
112 const ir_node* node3 = get_edge_src_irn(edge2);
113 if(is_mips_mfhi(node3) || is_mips_mflo(node3))
114 pset_insert_ptr(set, node3);
117 } else if(is_mips_mult(node)) {
118 foreach_out_edge(node, edge) {
119 const ir_node* node2 = get_edge_src_irn(edge);
121 if(is_mips_mfhi(node2) || is_mips_mflo(node2))
122 pset_insert_ptr(set, node2);
127 static int mips_scheduler_node_allowed(mips_sched_env_t *sched_env, ir_node* node)
129 if(pset_count(sched_env->div_set) != 0 && (is_mips_div(node) || is_mips_mult(node))) {
136 static ir_node *mips_scheduler_select(void *block_env, nodeset *ready_set, nodeset *live_set)
138 mips_sched_env_t *sched_env = (mips_sched_env_t*) block_env;
139 ir_node *node = NULL;
140 ir_node *block = sched_env->block;
141 ir_node *condjmp = NULL;
142 ir_graph *irg = get_irn_irg(block);
143 int have_non_branch_nodes = 0;
145 // test all nodes in the ready set and take the first non-branch that
147 for (node = nodeset_first(ready_set); node != NULL; node = nodeset_next(ready_set)) {
148 if (arch_irn_class_is(node, branch)) {
149 if (is_irn_forking(node))
154 have_non_branch_nodes = 1;
156 if (mips_scheduler_node_allowed(sched_env, node))
158 nodeset_break(ready_set);
160 // TODO update busy_registers
162 if (is_mips_div(node) || is_mips_mult(node)) {
163 mips_collect_mflohis(sched_env->div_set, node);
164 } else if(is_mips_mflo(node) || is_mips_mfhi(node)) {
165 pset_remove_ptr(sched_env->div_set, node);
172 // if we arrive here no non-branch node was found that we can emit
174 // return a branch if there are just branches left
175 if(!have_non_branch_nodes) {
176 // schedule conditional branches before non-conditional ones
177 if(condjmp != NULL) {
180 node = nodeset_first(ready_set);
181 assert(arch_irn_class_is(node, branch));
182 nodeset_break(ready_set);
187 node = new_rd_mips_nop(NULL, irg, block, mode_M);
195 int mips_to_appear_in_schedule(void *block_env, const ir_node *node)
199 if(!is_mips_irn(node))
201 if(is_mips_zero(node) || is_mips_Immediate(node))
207 list_sched_selector_t mips_selector;
210 * Returns the reg_pressure scheduler with to_appear_in_schedule() overloaded
212 const list_sched_selector_t *mips_get_list_sched_selector(const void *self,
213 list_sched_selector_t *selector)
217 memset(&mips_sched_selector, 0, sizeof(mips_sched_selector));
218 mips_sched_selector.init_graph = mips_scheduler_init_graph;
219 mips_sched_selector.init_block = mips_scheduler_init_block;
220 mips_sched_selector.select = mips_scheduler_select;
221 mips_sched_selector.to_appear_in_schedule = mips_scheduler_to_appear_in_schedule;
222 mips_sched_selector.finish_block = mips_scheduler_finish_block;
223 mips_sched_selector.finish_graph = mips_scheduler_finish_graph;
224 //return &mips_sched_selector;
226 memcpy(&mips_selector, selector, sizeof(mips_selector));
227 mips_selector.to_appear_in_schedule = mips_to_appear_in_schedule;
229 return &mips_selector;
232 const ilp_sched_selector_t *mips_get_ilp_sched_selector(const void *self)