/* ??? deprecated, use sequences instead. */
reorder_insns (NEXT_INSN (last), get_last_insn (), dest_right_flag);
+ /* All cleanups must be on the function_obstack. */
+ push_obstacks_nochange ();
+ resume_temporary_allocation ();
+
/* convert flag, which is an rtx, into a tree. */
cond = make_node (RTL_EXPR);
TREE_TYPE (cond) = integer_type_node;
left_cleanups, right_cleanups);
new_cleanups = fold (new_cleanups);
+ pop_obstacks ();
+
/* Now add in the conditionalized cleanups. */
cleanups_this_call
= tree_cons (NULL_TREE, new_cleanups, cleanups_this_call);
/* reverse them so that we can build them in the right order. */
cleanups = nreverse (cleanups);
+ /* All cleanups must be on the function_obstack. */
+ push_obstacks_nochange ();
+ resume_temporary_allocation ();
+
while (cleanups)
{
if (new_cleanups)
cleanups = TREE_CHAIN (cleanups);
}
+
+ pop_obstacks ();
}
return new_cleanups;
emit_move_insn (flag, const1_rtx);
emit_insns (seq2);
+ /* All cleanups must be on the function_obstack. */
+ push_obstacks_nochange ();
+ resume_temporary_allocation ();
+
/* convert flag, which is an rtx, into a tree. */
cond = make_node (RTL_EXPR);
TREE_TYPE (cond) = integer_type_node;
cleanups, integer_zero_node);
new_cleanups = fold (new_cleanups);
+ pop_obstacks ();
+
/* Now add in the conditionalized cleanups. */
cleanups_this_call
= tree_cons (NULL_TREE, new_cleanups, cleanups_this_call);
emit_move_insn (flag, const1_rtx);
emit_insns (seq2);
+ /* All cleanups must be on the function_obstack. */
+ push_obstacks_nochange ();
+ resume_temporary_allocation ();
+
/* convert flag, which is an rtx, into a tree. */
cond = make_node (RTL_EXPR);
TREE_TYPE (cond) = integer_type_node;
cleanups, integer_zero_node);
new_cleanups = fold (new_cleanups);
+ pop_obstacks ();
+
/* Now add in the conditionalized cleanups. */
cleanups_this_call
= tree_cons (NULL_TREE, new_cleanups, cleanups_this_call);