* gcc.dg/tree-ssa/data-dep-1.c: Skip test for avr-*-* too much code.
* gcc.dg/tree-ssa/ldist-3.c: Ditto.
* gcc.dg/tree-ssa/ldist-5.c: Ditto.
* gcc.dg/tree-ssa/ifc-
20040816-2 .c: Adjust for int size < 4 bytes.
* gcc.dg/tree-ssa/pr32540-1.c: Ditto.
* gcc.dg/tree-ssa/pr32540-2.c: Ditto.
* gcc.dg/tree-ssa/ssa-lim-5.c: Ditto.
* gcc.dg/tree-ssa/pr23115.c: Adjust test for double size < 8 bytes.
From-SVN: r136058
+2008-05-27 Andy Hutchinson <hutchinsonandy@aim.com>
+
+ * gcc.dg/tree-ssa/data-dep-1.c: Skip test for avr-*-* too much code.
+ * gcc.dg/tree-ssa/ldist-3.c: Ditto.
+ * gcc.dg/tree-ssa/ldist-5.c: Ditto.
+ * gcc.dg/tree-ssa/ifc-20040816-2 .c: Adjust for int size < 4 bytes.
+ * gcc.dg/tree-ssa/pr32540-1.c: Ditto.
+ * gcc.dg/tree-ssa/pr32540-2.c: Ditto.
+ * gcc.dg/tree-ssa/ssa-lim-5.c: Ditto.
+ * gcc.dg/tree-ssa/pr23115.c: Adjust test for double size < 8 bytes.
+
2008-05-27 H.J. Lu <hongjiu.lu@intel.com>
PR target/35767
/* { dg-do compile } */
+/* { dg-skip-if "too much code for avr" { "avr-*-*" } { "*" } { "" } } */
/* { dg-options "-O2 -ftree-loop-linear -fdump-tree-ltrans-all" } */
int foo (int n, int m)
{
unsigned int pi;
int tmp_r, tmp_i, tmp_k;
+#if __SIZEOF_INT__ >= 4
for (pi = 0; pi < (512)*(512); pi++) {
+#else
+ for (pi = 0; pi < (32)*(32); pi++) {
+#endif
int zr = zr_in[pi];
int zi = zi_in[pi];
int zk = zk_in[pi];
/* { dg-do compile } */
+/* { dg-skip-if "too much code for avr" { "avr-*-*" } { "*" } { "" } } */
/* { dg-options "-O2 -ftree-loop-distribution -fdump-tree-ldist-all" } */
int loop1 (int k)
/* { dg-do compile } */
+/* { dg-skip-if "too much code for avr" { "avr-*-*" } { "*" } { "" } } */
/* { dg-options "-O2 -ftree-loop-distribution -fdump-tree-ldist-all" } */
int loop1 (int k)
{
long j;
double R, n, x;
-
+#if __SIZEOF_DOUBLE__ >= 8
n = 1.e300;
x = -1.e300;
+#else
+ n = 1.e30;
+ x = -1.e30;
+#endif
for( j=0; j < 2; j++ )
{
x = MAX2(x,p[j]);
if (f()) options |= 0x1 << 13;
if (f()) options |= 0x1 << 14;
if (f()) options |= 0x1 << 15;
+#if(__SIZEOF_INT__ >= 4)
if (f()) options |= 0x1 << 16;
if (f()) options |= 0x1 << 17;
if (f()) options |= 0x1 << 18;
if (f()) options |= 0x1 << 24;
if (f()) options |= 0x1 << 25;
if (f()) options |= 0x1 << 26;
+#endif
if (f()) *t = options;
}
if (f()) options |= 0x1 << 13;
if (f()) options |= 0x1 << 14;
if (f()) options |= 0x1 << 15;
+#if(__SIZEOF_INT__ >= 4)
if (f()) options |= 0x1 << 16;
if (f()) options |= 0x1 << 17;
if (f()) options |= 0x1 << 18;
if (f()) options |= 0x1 << 24;
if (f()) options |= 0x1 << 25;
if (f()) options |= 0x1 << 26;
+#endif
if (f()) *t = options;
}
+
int foo(struct BUF1 * p)
{
-
int i = 0;
+#if(__SIZEOF_INT__ >= 4)
for (i = 0; i < 1024*1024; i++)
+#else
+ for (i = 0; i < 128*128; i++)
+#endif
p->b1 = 1;
+
if (p->b1 != 1)
link_error ();
return 0;