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
32 #include "mips_scheduler.h"
34 #include "../besched_t.h"
39 #include "gen_mips_regalloc_if.h"
41 #include "mips_new_nodes.h"
43 list_sched_selector_t mips_sched_selector;
48 * This array holds an entry for each register that specifies how much cycles
49 * have to pass before we can access that register again
50 * (because mips will write the register value back in the WB phase of the pipeline)
52 int busy_registers[N_mips_gp_REGS];
58 /* Matze: deprecated and totally broken */
61 static void *mips_scheduler_init_graph(const list_sched_selector_t *vtab, ir_graph *irg)
63 mips_sched_env_t *sched_env = XMALLOCZ(mips_sched_env_t);
65 sched_env->div_set = new_pset(pset_default_ptr_cmp, 4);
70 static void mips_scheduler_finish_graph(void* graph_env)
72 mips_sched_env_t *sched_env = (mips_sched_env_t*) graph_env;
73 del_pset(sched_env->div_set);
76 static void *mips_scheduler_init_block(void *graph_env, ir_node *block)
78 mips_sched_env_t *sched_env = (mips_sched_env_t*) graph_env;
79 assert(pset_count(sched_env->div_set) == 0);
81 // TODO later we might have blocks that don't end in a jump
82 memset(&sched_env->busy_registers, 0, sizeof(sched_env->busy_registers));
83 sched_env->block = block;
84 sched_env->last_nop = NULL;
88 static void mips_scheduler_finish_block(void* graph_env)
90 mips_sched_env_t *sched_env = (mips_sched_env_t*) graph_env;
91 // attach last nop to end node (so that firm doesn't discard it)
92 if(sched_env->last_nop != NULL) {
93 ir_node* end = get_irg_end(get_irn_irg(sched_env->block));
97 sched_env->block = NULL;
100 static int mips_scheduler_to_appear_in_schedule(void *block_env, const ir_node *irn)
102 return is_mips_irn(irn) && !is_mips_zero(irn) && !is_mips_reinterpret_conv(irn) && !is_mips_fallthrough(irn);
105 static void mips_collect_mflohis(pset* set, ir_node* node) {
106 // construct a list of nodes that need to be scheduled before
107 // we are allowed to schedule another div or mul instruction
108 const ir_edge_t *edge, *edge2;
110 if(is_mips_div(node)) {
111 foreach_out_edge(node, edge) {
112 const ir_node* node2 = get_edge_src_irn(edge);
114 assert(is_Proj(node2));
115 foreach_out_edge(node2, edge2) {
116 const ir_node* node3 = get_edge_src_irn(edge2);
117 if(is_mips_mfhi(node3) || is_mips_mflo(node3))
118 pset_insert_ptr(set, node3);
121 } else if(is_mips_mult(node)) {
122 foreach_out_edge(node, edge) {
123 const ir_node* node2 = get_edge_src_irn(edge);
125 if(is_mips_mfhi(node2) || is_mips_mflo(node2))
126 pset_insert_ptr(set, node2);
131 static int mips_scheduler_node_allowed(mips_sched_env_t *sched_env, ir_node* node)
133 if(pset_count(sched_env->div_set) != 0 && (is_mips_div(node) || is_mips_mult(node))) {
140 static ir_node *mips_scheduler_select(void *block_env, nodeset *ready_set, nodeset *live_set)
142 mips_sched_env_t *sched_env = (mips_sched_env_t*) block_env;
143 ir_node *node = NULL;
144 ir_node *block = sched_env->block;
145 ir_node *condjmp = NULL;
146 ir_graph *irg = get_irn_irg(block);
147 int have_non_branch_nodes = 0;
149 // test all nodes in the ready set and take the first non-branch that
151 for (node = nodeset_first(ready_set); node != NULL; node = nodeset_next(ready_set)) {
152 if (arch_irn_class_is(node, branch)) {
153 if (is_irn_forking(node))
158 have_non_branch_nodes = 1;
160 if (mips_scheduler_node_allowed(sched_env, node))
162 nodeset_break(ready_set);
164 // TODO update busy_registers
166 if (is_mips_div(node) || is_mips_mult(node)) {
167 mips_collect_mflohis(sched_env->div_set, node);
168 } else if(is_mips_mflo(node) || is_mips_mfhi(node)) {
169 pset_remove_ptr(sched_env->div_set, node);
176 // if we arrive here no non-branch node was found that we can emit
178 // return a branch if there are just branches left
179 if(!have_non_branch_nodes) {
180 // schedule conditional branches before non-conditional ones
181 if(condjmp != NULL) {
184 node = nodeset_first(ready_set);
185 assert(arch_irn_class_is(node, branch));
186 nodeset_break(ready_set);
191 node = new_rd_mips_nop(NULL, irg, block, mode_M);
199 int mips_to_appear_in_schedule(void *block_env, const ir_node *node)
203 if(!is_mips_irn(node))
205 if(is_mips_zero(node) || is_mips_Immediate(node))
211 list_sched_selector_t mips_selector;
214 * Returns the reg_pressure scheduler with to_appear_in_schedule() overloaded
216 const list_sched_selector_t *mips_get_list_sched_selector(const void *self,
217 list_sched_selector_t *selector)
221 memset(&mips_sched_selector, 0, sizeof(mips_sched_selector));
222 mips_sched_selector.init_graph = mips_scheduler_init_graph;
223 mips_sched_selector.init_block = mips_scheduler_init_block;
224 mips_sched_selector.select = mips_scheduler_select;
225 mips_sched_selector.to_appear_in_schedule = mips_scheduler_to_appear_in_schedule;
226 mips_sched_selector.finish_block = mips_scheduler_finish_block;
227 mips_sched_selector.finish_graph = mips_scheduler_finish_graph;
228 //return &mips_sched_selector;
230 memcpy(&mips_selector, selector, sizeof(mips_selector));
231 mips_selector.to_appear_in_schedule = mips_to_appear_in_schedule;
233 return &mips_selector;
236 const ilp_sched_selector_t *mips_get_ilp_sched_selector(const void *self)