===================================================================
@@ -2,10 +2,12 @@
/* { 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;
}
===================================================================
@@ -5,7 +5,7 @@ int
t(int s, void **p)
{
int i;
- for (i;i<10000;i+=s)
+ for (i=0;i<10000;i+=s)
p[i]=0;
}
int
===================================================================
@@ -5,7 +5,7 @@ int i_am_pure(char *c, int n)
{
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++)
===================================================================
@@ -2,16 +2,15 @@
/* { 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"} } */
===================================================================
@@ -3,16 +3,15 @@
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"} } */
===================================================================
@@ -3,16 +3,15 @@
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"} } */
===================================================================
@@ -8,17 +8,16 @@ struct {
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" } } */
===================================================================
@@ -5,17 +5,15 @@ int a;
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. */
===================================================================
@@ -3,17 +3,15 @@
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" } } */
===================================================================
@@ -2,17 +2,15 @@
/* { 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" } } */
===================================================================
@@ -24,7 +24,7 @@ int foo (int x);
int xxx(void)
{
int x = 45;
- int sum;
+ int sum = 0;
while (x >>= 1)
sum += foo (x) * 2;
===================================================================
@@ -7,7 +7,7 @@ int bla(int);
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++)
===================================================================
@@ -1,14 +1,10 @@
/* { 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)
===================================================================
@@ -2,7 +2,7 @@
/* { dg-options "-O2 -fdump-tree-pre-stats" } */
unsigned foo1 (unsigned a, unsigned b)
{
- unsigned i, j, k;
+ unsigned i, j = 0, k = 0;
for (i = 0; i != a; i++)
{
j += 4*b;
===================================================================
@@ -1,8 +1,8 @@
/* { 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)
@@ -11,4 +11,4 @@ int main(int argc, char **argv)
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"} } */
===================================================================
@@ -4,7 +4,7 @@
int
foo (int ko)
{
- int j,i;
+ int j,i = 0;
for (j = 0; j < ko; j++)
i += (i > 10) ? -5 : 7;
return i;
===================================================================
@@ -18,7 +18,7 @@ void test_select_fill_hyper_simple (long
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];
===================================================================
@@ -18,8 +18,8 @@ void
foo (void)
{
int i;
- int sum1;
- int sum2;
+ int sum1 = 0;
+ int sum2 = 0;
for (i = 0; i < 16; i++)
{
===================================================================
@@ -6,7 +6,7 @@ float
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;