+
+ // check that all projs/keeps are behind their nodes
+ if(is_Proj(node)) {
+ ir_node *prev = sched_prev(node);
+ while(is_Proj(prev))
+ prev = sched_prev(prev);
+ if(get_Proj_pred(node) != prev) {
+ ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
+ node, block, get_irg_dump_name(env->irg));
+ env->problem_found = 1;
+ }
+ }
+ if(be_is_Keep(node)) {
+ int arity = get_irn_arity(node);
+ int problem = 0;
+ for(i = 0; i < arity; ++i) {
+ ir_node *in = get_irn_n(node, i);
+ ir_node *succ = sched_next(in);
+ while(succ != node && !sched_is_end(succ)) {
+ /* the node in between has to be another input of the
+ * keep or a Proj */
+ int i2;
+ int found = 0;
+
+ if(is_Proj(succ)) {
+ succ = sched_next(succ);
+ continue;
+ }
+
+ for(i2 = 0; i2 < arity; ++i2) {
+ ir_node *in2 = get_irn_n(node, i2);
+ if(in2 == succ) {
+ found = 1;
+ break;
+ }
+ }
+ if(!found)
+ problem = 1;
+
+ succ = sched_next(succ);
+ }
+ }
+ if(problem) {
+ ir_fprintf(stderr, "%+F not scheduled after its pred node in block %+F (%s)\n",
+ node, block, get_irg_dump_name(env->irg));
+ env->problem_found = 1;
+ }
+ }