gcc_assert (TREE_CODE (stmt) == COND_EXPR);
- c = TREE_OPERAND (stmt, 0);
+ c = COND_EXPR_COND (stmt);
/* Create temp. for condition. */
if (!is_gimple_condexpr (c))
static void
clean_predicate_lists (struct loop *loop)
{
- unsigned int i;
-
- for (i = 0; i < loop->num_nodes; i++)
- ifc_bbs[i]->aux = NULL;
+#ifdef ENABLE_CHECKING
+ gcc_assert (loop->num_nodes == 2 || loop->num_nodes == 1);
+#endif
+ loop->header->aux = NULL;
+ loop->latch->aux = NULL;
}
/* Basic block BB has two predecessors. Using predecessor's aux field, set
while (phi)
{
- tree next = TREE_CHAIN (phi);
+ tree next = PHI_CHAIN (phi);
replace_phi_with_cond_modify_expr (phi, cond, true_bb, &bsi);
release_phi_node (phi);
phi = next;