/*
- * Copyright (C) 1995-2007 University of Karlsruhe. All right reserved.
+ * Copyright (C) 1995-2008 University of Karlsruhe. All right reserved.
*
* This file is part of libFirm.
*
* @date 20.10.2004
* @version $Id$
*/
-#ifdef HAVE_CONFIG_H
#include "config.h"
-#endif
#include <stdio.h>
#include <stdarg.h>
#include <string.h>
#include <limits.h>
-#include "benode_t.h"
+#include "benode.h"
#include "be_t.h"
#include "obst.h"
#include "irtools.h"
#include "bemodule.h"
-#include "besched_t.h"
+#include "besched.h"
#include "beutil.h"
#include "belive_t.h"
#include "belistsched.h"
#include "beschedmris.h"
#include "beschedrss.h"
-#include "bearch_t.h"
+#include "bearch.h"
#include "bestat.h"
-#include "beirg_t.h"
+#include "beirg.h"
-#include <libcore/lc_opts.h>
-#include <libcore/lc_opts_enum.h>
+#include "lc_opts.h"
+#include "lc_opts_enum.h"
DEBUG_ONLY(static firm_dbg_module_t *dbg = NULL);
-#define BE_SCHED_NODE(irn) (be_is_Keep(irn) || be_is_CopyKeep(irn) || be_is_RegParams(irn))
+#define BE_SCHED_NODE(irn) (be_is_Keep(irn) || be_is_CopyKeep(irn) || be_is_Start(irn))
enum {
BE_SCHED_SELECT_TRIVIAL,
} list_sched_options_t;
static list_sched_options_t list_sched_options = {
- BE_SCHED_SELECT_HEUR, /* mueller heuristic selector */
+ BE_SCHED_SELECT_NORMAL, /* mueller heuristic selector */
BE_SCHED_PREP_NONE, /* no scheduling preparation */
};
typedef struct _sched_env_t {
sched_irn_t *sched_info; /**< scheduling info per node */
const list_sched_selector_t *selector; /**< The node selector. */
- const arch_env_t *arch_env; /**< The architecture environment. */
- const ir_graph *irg; /**< The graph to schedule. */
void *selector_env; /**< A pointer to give to the selector. */
} sched_env_t;
/**
* Returns non-zero if a node must be placed in the schedule.
*/
-static INLINE int must_appear_in_schedule(const list_sched_selector_t *sel, void *block_env, const ir_node *irn)
+static inline int must_appear_in_schedule(const list_sched_selector_t *sel, void *block_env, const ir_node *irn)
{
int res = -1;
/**
* Returns non-zero if the node is already scheduled
*/
-static INLINE int is_already_scheduled(block_sched_env_t *env, ir_node *n)
+static inline int is_already_scheduled(block_sched_env_t *env, ir_node *n)
{
int idx = get_irn_idx(n);
/**
* Mark a node as already scheduled
*/
-static INLINE void set_already_scheduled(block_sched_env_t *env, ir_node *n)
+static inline void set_already_scheduled(block_sched_env_t *env, ir_node *n)
{
int idx = get_irn_idx(n);
* @param irn The node to make ready.
* @return 1, if the node could be made ready, 0 else.
*/
-static INLINE int make_ready(block_sched_env_t *env, ir_node *pred, ir_node *irn)
+static inline int make_ready(block_sched_env_t *env, ir_node *pred, ir_node *irn)
{
int i, n;
/* if irn is an End we have keep-alives and op might be a block, skip that */
if (is_Block(op)) {
- assert(get_irn_op(irn) == op_End);
+ assert(is_End(irn));
continue;
}
/**
* Returns the number of not yet schedules users.
*/
-static INLINE int get_irn_not_sched_user(block_sched_env_t *env, ir_node *n) {
+static inline int get_irn_not_sched_user(block_sched_env_t *env, ir_node *n)
+{
int idx = get_irn_idx(n);
assert(idx < ARR_LEN(env->sched_info));
/**
* Sets the number of not yet schedules users.
*/
-static INLINE void set_irn_not_sched_user(block_sched_env_t *env, ir_node *n, int num) {
+static inline void set_irn_not_sched_user(block_sched_env_t *env, ir_node *n, int num)
+{
int idx = get_irn_idx(n);
assert(idx < ARR_LEN(env->sched_info));
/**
* Add @p num to the number of not yet schedules users and returns the result.
*/
-static INLINE int add_irn_not_sched_user(block_sched_env_t *env, ir_node *n, int num) {
+static inline int add_irn_not_sched_user(block_sched_env_t *env, ir_node *n, int num)
+{
int idx = get_irn_idx(n);
assert(idx < ARR_LEN(env->sched_info));
/**
* Returns the number of users of a node having mode datab.
*/
-static int get_num_successors(ir_node *irn) {
+static int get_num_successors(ir_node *irn)
+{
int sum = 0;
const ir_edge_t *edge;
* Adds irn to @p live, updates all inputs that this user is scheduled
* and counts all of its non scheduled users.
*/
-static void update_sched_liveness(block_sched_env_t *env, ir_node *irn) {
+static void update_sched_liveness(block_sched_env_t *env, ir_node *irn)
+{
int i;
/* ignore Projs */
{
sched_env_t *env = env_ptr;
const list_sched_selector_t *selector = env->selector;
- ir_node *start_node = get_irg_start(get_irn_irg(block));
block_sched_env_t be;
const ir_edge_t *edge;
/* Then one can add all nodes are ready to the set. */
foreach_out_edge(block, edge) {
- ir_node *irn = get_edge_src_irn(edge);
+ ir_node *irn = get_edge_src_irn(edge);
+ ir_opcode code = get_irn_opcode(irn);
int users;
- /* Skip the end node because of keepalive edges. */
- if (get_irn_opcode(irn) == iro_End)
+ if (code == iro_End) {
+ /* Skip the end node because of keep-alive edges. */
continue;
+ } else if (code == iro_Block) {
+ /* A Block-Block edge. This should be the MacroBlock
+ * edge, ignore it. */
+ assert(get_Block_MacroBlock(irn) == block && "Block-Block edge found");
+ continue;
+ }
users = get_irn_n_edges(irn);
if (users == 0)
transfer data flow from the predecessors to this block.
*/
add_to_sched(&be, irn);
- }
- else if (irn == start_node) {
+ } else if (be_is_Start(irn)) {
/* The start block will be scheduled as the first node */
add_to_sched(&be, irn);
-#ifdef SCHEDULE_PROJS
- add_tuple_projs(&be, irn);
-#endif
- }
- else {
+ } else {
/* Other nodes must have all operands in other blocks to be made
- * ready */
+ * ready */
int ready = 1;
/* Check, if the operands of a node are not local to this block */
/* Iterate over all remaining nodes */
while (ir_nodeset_size(&be.cands) > 0) {
ir_nodeset_iterator_t iter;
- /* collect statistics about amount of ready nodes */
- be_do_stat_sched_ready(block, &be.cands);
/* Keeps must be scheduled immediately */
foreach_ir_nodeset(&be.cands, irn, iter) {
}
/* List schedule a graph. */
-void list_sched(be_irg_t *birg, be_options_t *be_opts)
+void list_sched(ir_graph *irg)
{
- const arch_env_t *arch_env = birg->main_env->arch_env;
- ir_graph *irg = birg->irg;
-
int num_nodes;
sched_env_t env;
mris_env_t *mris = NULL;
list_sched_selector_t sel;
- (void)be_opts;
-
/* Select a scheduler based on backend options */
switch (list_sched_options.select) {
case BE_SCHED_SELECT_TRIVIAL: sel = trivial_selector; break;
case BE_SCHED_SELECT_HEUR: sel = heuristic_selector; break;
case BE_SCHED_SELECT_NORMAL: sel = normal_selector; break;
default:
- case BE_SCHED_SELECT_HMUCHNIK: sel = trivial_selector; break;
+ case BE_SCHED_SELECT_HMUCHNIK: sel = heuristic_selector; break;
}
#if 1
*/
/* Assure, that we have no dangling out-edges to deleted stuff */
- edges_deactivate(birg->irg);
- edges_activate(birg->irg);
+ edges_deactivate(irg);
+ edges_activate(irg);
#endif
switch (list_sched_options.prep) {
case BE_SCHED_PREP_MRIS:
- mris = be_sched_mris_preprocess(birg);
+ mris = be_sched_mris_preprocess(irg);
break;
case BE_SCHED_PREP_RSS:
- rss_schedule_preparation(birg);
+ rss_schedule_preparation(irg);
break;
default:
break;
/* initialize environment for list scheduler */
memset(&env, 0, sizeof(env));
- env.selector = arch_env->isa->impl->get_list_sched_selector(arch_env->isa, &sel);
- env.arch_env = arch_env;
- env.irg = irg;
+ env.selector = arch_env_get_list_sched_selector(be_get_irg_arch_env(irg), &sel);
env.sched_info = NEW_ARR_F(sched_irn_t, num_nodes);
memset(env.sched_info, 0, num_nodes * sizeof(env.sched_info[0]));
if (env.selector->init_graph)
- env.selector_env = env.selector->init_graph(env.selector, birg);
+ env.selector_env = env.selector->init_graph(env.selector, irg);
/* Schedule each single block. */
irg_block_walk_graph(irg, list_sched_block, NULL, &env);
}
/* List schedule a block. */
-void list_sched_single_block(const be_irg_t *birg, ir_node *block,
- be_options_t *be_opts)
+void list_sched_single_block(ir_graph *irg, ir_node *block)
{
- const arch_env_t *arch_env = birg->main_env->arch_env;
- ir_graph *irg = birg->irg;
-
int num_nodes;
sched_env_t env;
list_sched_selector_t sel;
- (void)be_opts;
-
/* Select a scheduler based on backend options */
switch (list_sched_options.select) {
case BE_SCHED_SELECT_TRIVIAL: sel = trivial_selector; break;
}
/* Assure, that the out edges are computed */
- edges_deactivate(birg->irg);
- edges_activate(birg->irg);
+ edges_deactivate(irg);
+ edges_activate(irg);
num_nodes = get_irg_last_idx(irg);
/* initialize environment for list scheduler */
memset(&env, 0, sizeof(env));
- env.selector = arch_env->isa->impl->get_list_sched_selector(arch_env->isa, &sel);
- env.arch_env = arch_env;
- env.irg = irg;
+ env.selector = arch_env_get_list_sched_selector(be_get_irg_arch_env(irg), &sel);
env.sched_info = NEW_ARR_F(sched_irn_t, num_nodes);
memset(env.sched_info, 0, num_nodes * sizeof(env.sched_info[0]));
if (env.selector->init_graph)
- env.selector_env = env.selector->init_graph(env.selector, birg);
+ env.selector_env = env.selector->init_graph(env.selector, irg);
/* Schedule block. */
list_sched_block(block, &env);
DEL_ARR_F(env.sched_info);
}
-/**
- * Register list scheduler options.
- */
-void be_init_listsched(void) {
- lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
+BE_REGISTER_MODULE_CONSTRUCTOR(be_init_listsched);
+void be_init_listsched(void)
+{
+ lc_opt_entry_t *be_grp = lc_opt_get_grp(firm_opt_get_root(), "be");
lc_opt_entry_t *sched_grp = lc_opt_get_grp(be_grp, "listsched");
lc_opt_add_table(sched_grp, list_sched_option_table);
FIRM_DBG_REGISTER(dbg, "firm.be.sched");
}
-
-BE_REGISTER_MODULE_CONSTRUCTOR(be_init_listsched);
projects / libfirm / blobdiff