* 1) Simplest case (phi with a non-phi arg):
* A single copy is inserted.
*
- * 2) Phi chain (phi (with phi-arg)* with non=phi arg):
+ * 2) Phi chain (phi (with phi-arg)* with non-phi arg):
* Several copies are placed, each after returning from recursion.
*
* 3) Phi-loop:
/* In case this is a 'normal' phi we insert at the
* end of the pred block before cf nodes */
- last_cpy = sched_skip(pred_blk, 0, sched_skip_cf_predicator, sde->aenv);
+ last_cpy = sched_skip(pred_blk, 0, sched_skip_cf_predicator, (void *)sde->aenv);
last_cpy = sched_next(last_cpy);
/* If we detect a loop stop recursion. */