#include <limits.h>
-#include "misc.h"
-#include "obstack.h"
+#include "obst.h"
#include "debug.h"
#include "irgraph_t.h"
{
const arch_register_class_t *cls;
ir_node *op = NULL;
- int i, n;
if(get_irn_arity(start) == 0)
return 0;
{
ir_node *irn;
- for(irn = nodeset_first(env->inserted); irn; irn = nodeset_next(env->inserted)) {
+ foreach_nodeset(env->inserted, irn) {
int i, n;
ir_node *tgt;
/* reroute the edges, remove from schedule and make it invisible. */
edges_reroute(irn, tgt, env->irg);
- sched_remove(irn);
+ if (sched_is_scheduled(irn))
+ sched_remove(irn);
for(i = -1, n = get_irn_arity(irn); i < n; ++i)
set_irn_n(irn, i, new_r_Bad(env->irg));
}