+2007-08-01 Daniel Jacobowitz <dan@codesourcery.com>
+
+ PR tree-optimization/32919
+ * tree-ssa-sccvn.c (visit_phi): Do not visit abnormal PHIs.
+ * tree-ssa-coalesce.c (ssa_conflicts_dump): New.
+ (coalesce_ssa_name): Call it.
+
2007-08-01 Sandra Loosemore <sandra@codesourcery.com>
David Ung <davidu@mips.com>
+2007-08-01 Daniel Jacobowitz <dan@codesourcery.com>
+
+ PR tree-optimization/32919
+ * gcc.c-torture/compile/pr32919.c: New.
+
2007-08-01 Nick Clifton <nickc@redhat.com>
* gcc.c-torture/execute/execute.exp: Change copyright header to
--- /dev/null
+void _IO_vfprintf_internal ( char *f )
+{
+ static const void *const step0_jumps[] = { &&do_form_unknown, &&do_flag_plus, &&do_form_float };
+ const void * ptr = step0_jumps[0];
+ do {
+ char spec;
+ spec = (*++f);
+ goto *ptr;
+do_flag_plus:
+ read_int (&f);
+do_number:
+ _itoa_word (spec);
+do_form_float:
+ if (ptr != ((void *)0))
+ {
+ spec = 'x';
+ goto do_number;
+ }
+ if (spec != 'S')
+ __strnlen ();
+ return;
+ do_form_unknown:;
+ }
+ while (*f != '\0');
+}
+
}
+/* Dump a conflicts graph. */
+
+static void
+ssa_conflicts_dump (FILE *file, ssa_conflicts_p ptr)
+{
+ unsigned x;
+
+ fprintf (file, "\nConflict graph:\n");
+
+ for (x = 0; x < ptr->size; x++)
+ if (ptr->conflicts[x])
+ {
+ fprintf (dump_file, "%d: ", x);
+ dump_bitmap (file, ptr->conflicts[x]);
+ }
+}
+
+
/* This structure is used to efficiently record the current status of live
SSA_NAMES when building a conflict graph.
LIVE_BASE_VAR has a bit set for each base variable which has at least one
/* Build a conflict graph. */
graph = build_ssa_conflict_graph (liveinfo);
delete_tree_live_info (liveinfo);
+ if (dump_file && (dump_flags & TDF_DETAILS))
+ ssa_conflicts_dump (dump_file, graph);
sort_coalesce_list (cl);
bool allsame = true;
int i;
+ /* TODO: We could check for this in init_sccvn, and replace this
+ with a gcc_assert. */
+ if (SSA_NAME_OCCURS_IN_ABNORMAL_PHI (PHI_RESULT (phi)))
+ return set_ssa_val_to (PHI_RESULT (phi), PHI_RESULT (phi));
+
/* See if all non-TOP arguments have the same value. TOP is
equivalent to everything, so we can ignore it. */
for (i = 0; i < PHI_NUM_ARGS (phi); i++)