1 /* This exposed a bug in tree-ssa-ccp.c.  Since 'j' and 'i' are never
2    defined, CCP was not traversing the edges out of the if(), which caused
3    the PHI node for 'k' at the top of the while to only be visited once.
4    This ended up causing CCP to think that 'k' was the constant '1'.  */
main()5 main()
6 {
7   int i, j, k;
8 
9   k = 0;
10   while (k < 10)
11     {
12       k++;
13       if (j > i)
14 	j = 5;
15       else
16 	j =3;
17     }
18 
19   if (k != 10)
20     abort ();
21 
22   return 0;
23 }
24