#include "benode_t.h"
#include "besched_t.h"
#include "beilpsched.h"
+#include "beutil.h"
typedef struct _ilpsched_options_t {
unsigned limit_dead;
#define get_ilpsched_block_attr(block) (&(block)->attr.block_attr)
#define get_ilpsched_node_attr(node) (&(node)->attr.node_attr)
-/* iterate over a list of ir_nodes linked by link field */
-#define foreach_linked_irns(head, iter) for ((iter) = (head); (iter); (iter) = get_irn_link((iter)))
-
/* check if node is considered for ILP scheduling */
#define consider_for_sched(isa, irn) \
(! (is_Block(irn) || \
#include "irnode.h"
#include "bearch.h"
+/* iterate over a list of ir_nodes linked by link field */
+#define foreach_linked_irns(head, iter) for ((iter) = (head); (iter); (iter) = get_irn_link((iter)))
+
/**
* Get an empty set.
* This function always returns the same set.