* @brief Primitive list scheduling with different node selectors.
* @author Sebastian Hack
* @date 20.10.2004
- * @version $Id$
*/
#include "config.h"
#include "obst.h"
#include "list.h"
-#include "iterator.h"
#include "iredges_t.h"
#include "irgwalk.h"
#include "irnode_t.h"
#include "irmode_t.h"
#include "irdump.h"
-#include "irprintf_t.h"
+#include "irprintf.h"
#include "array.h"
#include "debug.h"
#include "irtools.h"
#include "belistsched.h"
#include "bearch.h"
#include "bestat.h"
-#include "beirg.h"
#include "lc_opts.h"
#include "lc_opts_enum.h"
static void selected(block_sched_env_t *env, ir_node *node)
{
- const ir_edge_t *edge;
-
/* notify the selector about the finally selected node. */
if (env->selector->node_selected)
env->selector->node_selected(env->selector_block_env, node);
const list_sched_selector_t *selector = env->selector;
block_sched_env_t be;
- const ir_edge_t *edge;
ir_nodeset_t *cands = &be.cands;
/* Initialize the block's list head that will hold the schedule. */
add_to_sched(&be, irn);
}
+ ir_nodeset_destroy(cands);
+
if (selector->finish_block)
selector->finish_block(be.selector_block_env);
}