This is the mail archive of the
gcc-patches@gcc.gnu.org
mailing list for the GCC project.
Fix bootstrap on 32bit hosts
- From: Jan Hubicka <hubicka at ucw dot cz>
- To: gcc-patches at gcc dot gnu dot org
- Date: Sat, 3 Nov 2012 01:50:34 +0100
- Subject: Fix bootstrap on 32bit hosts
Hi,
my patch on loop bound estimation had missing cast that shows up as a bootstrap problem
on 32bit hosts. Fixed thus as obvious. I am sorry for the breakage.
Honza
Index: ChangeLog
===================================================================
--- ChangeLog (revision 193116)
+++ ChangeLog (working copy)
@@ -1,3 +1,8 @@
+2012-11-02 Jan Hubicka <jh@suse.cz>
+
+ * tree-ssa-loop-niter.c (discover_iteration_bound_by_body_walk): Add
+ missing sign to unsigned.
+
2012-11-02 Andrew Pinski <apinski@cavium.com>
PR rtl-opt/54524
Index: tree-ssa-loop-niter.c
===================================================================
--- tree-ssa-loop-niter.c (revision 193104)
+++ tree-ssa-loop-niter.c (working copy)
@@ -3161,7 +3161,7 @@ discover_iteration_bound_by_body_walk (s
}
gcc_assert (latch_index >= 0);
- if (latch_index < VEC_length (double_int, bounds))
+ if ((unsigned)latch_index < VEC_length (double_int, bounds))
{
if (dump_file && (dump_flags & TDF_DETAILS))
{
Index: testsuite/ChangeLog
===================================================================
--- testsuite/ChangeLog (revision 193116)
+++ testsuite/ChangeLog (working copy)
@@ -1,3 +1,7 @@
+2012-11-02 Jan Hubicka <jh@suse.cz>
+
+ * gcc.dg/tree-ssa/loop-38.c: Correct testcase.
+
2012-11-02 Michael Meissner <meissner@linux.vnet.ibm.com>
* gcc.target/powerpc/pr48258-2.c: Simplfy the acceptance
Index: testsuite/gcc.dg/tree-ssa/loop-38.c
===================================================================
--- testsuite/gcc.dg/tree-ssa/loop-38.c (revision 193104)
+++ testsuite/gcc.dg/tree-ssa/loop-38.c (working copy)
@@ -13,6 +13,6 @@ t(int n)
sum+=b[i];
return sum;
}
-/* { dg-final { scan-tree-dump "Found better loop bound 10" "cunrolli" } } */
-/* { dg-final { scan-tree-dump "Loop 1 iterates at most 10 times" "cunrolli" } } */
+/* { dg-final { scan-tree-dump "Found better loop bound 11" "cunrolli" } } */
+/* { dg-final { scan-tree-dump "Loop 1 iterates at most 11 times" "cunrolli" } } */
/* { dg-final { cleanup-tree-dump "cunrolli" } } */