#include "beutil.h"
#include "belive_t.h"
#include "belistsched.h"
+#include "firm/bearch_firm.h"
+
/**
* Scheduling environment for the whole graph.
const struct list_head *sched_head,
int curr_time, pset *ready_set)
{
+ ir_node *res;
+
#if 0
int i, n = pset_count(ready_set);
ir_node *irn;
ready[i++] = irn;
#endif
-
- ir_node *res = pset_first(ready_set);
+ res = pset_first(ready_set);
pset_break(ready_set);
return res;
}
static void list_sched_block(ir_node *block, void *env_ptr);
-void list_sched(ir_graph *irg, const list_sched_selector_t *selector)
+void list_sched(const struct _arch_isa_t *isa, ir_graph *irg)
{
- sched_env_t env;
+ sched_env_t env;
+ const list_sched_selector_t *selector;
- memset(&env, 0, sizeof(env));
- env.selector = selector;
- env.selector_env = selector->init_graph ? selector->init_graph(irg) : NULL;
- env.irg = irg;
+ memset(&env, 0, sizeof(env));
+ selector = env.selector = isa->impl->get_list_sched_selector(isa);
+ env.selector_env = selector->init_graph ? selector->init_graph(isa, irg) : NULL;
+ env.irg = irg;
- /* Assure, that the out edges are computed */
- edges_assure(irg);
+ /* Assure, that the out edges are computed */
+ edges_assure(irg);
- /* Schedule each single block. */
- irg_block_walk_graph(irg, list_sched_block, NULL, &env);
+ /* Schedule each single block. */
+ irg_block_walk_graph(irg, list_sched_block, NULL, &env);
- if(selector->finish_graph)
- selector->finish_graph(env.selector_env, irg);
+ if(selector->finish_graph)
+ selector->finish_graph(env.selector_env, irg);
}
* Environment for a block scheduler.
*/
typedef struct _block_sched_env_t {
- int curr_time;
- pset *ready_set;
- pset *already_scheduled;
- ir_node *block;
- firm_dbg_module_t *dbg;
+ int curr_time;
+ pset *ready_set;
+ pset *already_scheduled;
+ ir_node *block;
+ firm_dbg_module_t *dbg;
} block_sched_env_t;
-
-
-
/**
* Try to put a node in the ready set.
* @param env The block scheduler environment.
*/
static INLINE void make_users_ready(block_sched_env_t *env, ir_node *irn)
{
- int i, n;
const ir_edge_t *edge;
foreach_out_edge(irn, edge) {
*/
static void add_tuple_projs(block_sched_env_t *env, ir_node *irn)
{
- int i, n;
const ir_edge_t *edge;
assert(get_irn_mode(irn) == mode_T && "Mode of node must be tuple");
* Also the outs must have been computed.
*
* @param block The block node.
- * @param env Schedulting environment.
+ * @param env Scheduling environment.
*/
static void list_sched_block(ir_node *block, void *env_ptr)
{
sched_env_t *env = env_ptr;
block_sched_env_t be;
const list_sched_selector_t *selector = env->selector;
-
const ir_edge_t *edge;
ir_node *irn;
- int i, n, j, m;
+ int j, m;
int phi_seen = 0;
sched_info_t *info = get_irn_sched_info(block);
/* Other nodes must have all operands in other blocks to be made
* ready */
else {
- bool ready = true;
+ int ready = 1;
/* Check, if the operands of a node are not local to this block */
for(j = 0, m = get_irn_arity(irn); j < m; ++j) {
ir_node *operand = get_irn_n(irn, j);
if(get_nodes_block(operand) == block) {
- ready = false;
+ ready = 0;
break;
}
}