+2015-11-05 Richard Biener <rguenther@suse.de>
+
+ * gcc.dg/tree-ssa/loadpre2.c: Avoid undefined behavior due to
+ uninitialized variables.
+ * gcc.dg/tree-ssa/loadpre21.c: Likewise.
+ * gcc.dg/tree-ssa/loadpre22.c: Likewise.
+ * gcc.dg/tree-ssa/loadpre23.c: Likewise.
+ * gcc.dg/tree-ssa/loadpre24.c: Likewise.
+ * gcc.dg/tree-ssa/loadpre25.c: Likewise.
+ * gcc.dg/tree-ssa/loadpre4.c: Likewise.
+ * gcc.dg/ipa/inlinehint-2.c: Likewise.
+ * gcc.dg/ipa/pure-const-2.c: Likewise.
+ * gcc.dg/tree-ssa/loop-1.c: Likewise.
+ * gcc.dg/tree-ssa/loop-23.c: Likewise.
+ * gcc.dg/tree-ssa/pr22051-2.c: Likewise.
+ * gcc.dg/tree-ssa/ssa-pre-3.c: Likewise.
+ * gcc.dg/tree-ssa/ssa-sccvn-3.c: Likewise.
+ * gcc.dg/vect/pr30858.c: Likewise.
+ * gcc.dg/vect/pr33866.c: Likewise.
+ * gcc.dg/vect/pr37027.c: Likewise.
+ * c-c++-common/ubsan/null-10.c: Likewise.
+ * gcc.target/i386/incoming-8.c: Likewise.
+
2015-11-04 Eric Botcazou <ebotcazou@adacore.com>
* gnat.dg/slice9.adb: New test.
/* { dg-options "-fsanitize=null -w" } */
/* { dg-shouldfail "ubsan" } */
+short x;
+
int
main (void)
{
- short *p = 0, *u;
+ short *p = 0, *u = &x;
*(u + *p) = 23;
return 0;
}
t(int s, void **p)
{
int i;
- for (i;i<10000;i+=s)
+ for (i=0;i<10000;i+=s)
p[i]=0;
}
int
{
char *d=__builtin_alloca (n);
int i;
- int sum;
+ int sum = 0;
for (i=0;i<n;i++)
d[i] = c[i];
for (i=0;i<n;i++)
/* { dg-options "-O2 -fdump-tree-pre-stats" } */
int main(int *a, int argc)
{
- int b;
int i;
- int d, e;
+ int e;
/* Should be able to hoist this out of the loop. */
for (i = 0; i < argc; i++)
{
e = *a;
}
- return d + e;
+ return e;
}
/* { dg-final { scan-tree-dump-times "Eliminated: 1" 1 "pre"} } */
typedef int type[2];
int main(type *a, int argc)
{
- int b;
int i;
- int d, e;
+ int e;
/* Should be able to hoist this out of the loop. */
for (i = 0; i < argc; i++)
{
e = (*a)[0];
}
- return d + e;
+ return e;
}
/* { dg-final { scan-tree-dump-times "Eliminated: 1" 1 "pre"} } */
typedef int type[2];
int main(type *a, int argc)
{
- int b;
int i;
- int d, e;
+ int e;
/* Should be able to hoist this out of the loop. */
for (i = 0; i < argc; i++)
{
e = (*a)[argc];
}
- return d + e;
+ return e;
}
/* { dg-final { scan-tree-dump-times "Eliminated: 1" 1 "pre"} } */
int foo(int argc)
{
- int b;
int c;
int i;
- int d, e;
+ int e;
for (i = 0; i < argc; i++)
{
e = x.a;
x.a = 9;
}
- return d + e;
+ return e;
}
/* { dg-final { scan-tree-dump-times "Eliminated: 1" 1 "pre" } } */
int foo(int argc)
{
- int b;
- int c;
int i;
- int d, e;
+ int e;
for (i = 0; i < argc; i++)
{
e = a;
a = 9;
}
- return d + e;
+ return e;
}
/* We will move the load of a out of the loop. */
struct X { int i; };
int foo(struct X *a, int argc)
{
- int b;
- int c;
int i;
- int d, e;
+ int e;
for (i = 0; i < argc; i++)
{
e = a->i;
a->i = 9;
}
- return d + e;
+ return e;
}
/* { dg-final { scan-tree-dump-times "Eliminated: 1" 1 "pre" } } */
/* { dg-options "-O2 -fdump-tree-pre-stats" } */
int main(int *a, int argc)
{
- int b;
- int c;
int i;
- int d, e;
+ int e;
for (i = 0; i < argc; i++)
{
e = *a;
*a = 9;
}
- return d + e;
+ return e;
}
/* { dg-final { scan-tree-dump-times "Eliminated: 1" 1 "pre" } } */
int xxx(void)
{
int x = 45;
- int sum;
+ int sum = 0;
while (x >>= 1)
sum += foo (x) * 2;
int foo(void)
{
int i;
- int sum;
+ int sum = 0;
/* This loop used to appear to be too large for unrolling. */
for (i = 0; i < 4; i++)
/* { dg-do compile } */
/* { dg-options "-O2 -fdump-tree-optimized -w" } */
-
-
-
void *arf ();
int
-foo()
+foo(void (*q)(void))
{
- void (*q)(void);
int r = q;
if (r != 0)
/* { dg-do compile } */
/* { dg-options "-O2 -fdump-tree-pre-stats" } */
-unsigned foo1 (unsigned a, unsigned b)
+unsigned foo1 (unsigned a, unsigned b, unsigned j, unsigned k)
{
- unsigned i, j, k;
+ unsigned i;
for (i = 0; i != a; i++)
{
j += 4*b;
/* { dg-do compile } */
-/* { dg-options "-O2 -fdump-tree-fre1-stats" } */
+/* { dg-options "-O2 -fdump-tree-fre1" } */
+int *p;
int main(int argc, char **argv)
{
- int *p;
int result;
*p = 2;
if (argc)
return result;
}
/* We should eliminate result = *p by saying it has the value 2. */
-/* { dg-final { scan-tree-dump-times "Eliminated: 1" 1 "fre1"} } */
+/* { dg-final { scan-tree-dump "return 2;" "fre1"} } */
int
foo (int ko)
{
- int j,i;
+ int j,i = 0;
for (j = 0; j < ko; j++)
i += (i > 10) ? -5 : 7;
return i;
fill_iter_info iter_info;
int i, j;
iter_info.coords = (long *) points;
- for (i = 0, num_points = 0; j < (int) start[1]; j++, num_points++)
+ for (j = i = 0, num_points = 0; j < (int) start[1]; j++, num_points++)
{
points[num_points][0] = i + start[0];
points[num_points][1] = j + start[1];
foo (void)
{
int i;
- int sum1;
- int sum2;
+ int sum1 = 0;
+ int sum2 = 0;
for (i = 0; i < 16; i++)
{
foo (float f)
{
float array[128];
- float x;
+ float x = 0.;
int i;
for (i = 0; i < sizeof(array) / sizeof(*array); i++)
array[i] = f;