mirror/gcc
2
0
Fork 0
mirror of git://gcc.gnu.org/git/gcc.git synced 2025-04-05 10:50:51 +08:00
Code Issues Packages Projects Releases Wiki Activity

re PR middle-end/80421 (Case dispatch is scrambled in switch-statement)

Browse Source 
PR middle-end/80421
	* gcc.c-torture/execute/pr80421.c: New test.

From-SVN: r253662
This commit is contained in:
Jakub Jelinek 2017-10-11 22:51:08 +02:00 committed by Jakub Jelinek
parent 69c328ec60
commit ca38a07b06
2 changed files with 124 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
gcc/testsuite/ChangeLog
View File

@ -1,5 +1,8 @@
2017-10-11 Jakub Jelinek <jakub@redhat.com>
PR middle-end/80421
* gcc.c-torture/execute/pr80421.c: New test.
PR tree-optimization/78558
* gcc.dg/vect/pr78558.c: New test.

121
gcc/testsuite/gcc.c-torture/execute/pr80421.c Normal file
View File

@ -0,0 +1,121 @@
/* PR middle-end/80421 */
__attribute__ ((noinline, noclone)) void
baz (const char *t, ...)
{
asm volatile (""::"r" (t):"memory");
if (*t == 'T')
__builtin_abort ();
}
unsigned int
foo (char x)
{
baz ("x %c\n", x);
switch (x)
{
default:
baz ("case default\n");
if (x == 'D' || x == 'I')
baz ("This should never be reached.\n");
return 0;
case 'D':
baz ("case 'D'\n");
return 0;
case 'I':
baz ("case 'I'\n");
return 0;
}
}
void
bar (void)
{
int a = 2;
int b = 5;
char c[] = {
2, 4, 1, 2, 5, 5, 2, 4, 4, 0, 0, 0, 0, 0, 0, 3, 4, 4, 2, 4,
1, 2, 5, 5, 2, 4, 1, 0, 0, 0, 2, 4, 4, 3, 4, 3, 3, 5, 1, 3,
5, 5, 2, 4, 4, 2, 4, 1, 3, 5, 3, 3, 5, 1, 3, 5, 1, 2, 4, 4,
2, 4, 2, 3, 5, 1, 3, 5, 1, 3, 5, 5, 2, 4, 1, 2, 4, 2, 3, 5,
3, 3, 5, 1, 3, 5, 5, 2, 4, 1, 2, 4, 1, 3, 5, 3, 3, 5, 1, 3,
5, 5, 2, 4, 4, 2, 4, 1, 3, 5, 3, 3, 5, 1, 3, 5, 1, 2, 4, 1,
2, 4, 2, 3, 5, 1, 3, 5, 1, 3, 5, 1, 2, 4, 1, 2, 4, 1, 3, 5,
1, 3, 5, 1, 3, 5, 1, 2, 4, 4, 2, 4, 1, 3, 5, 1, 3, 5, 1, 3,
5, 5, 2, 4, 4, 2, 4, 2, 3, 5, 3, 3, 5, 1, 3, 5, 5, 2, 4, 4,
2, 4, 1, 3, 5, 3, 3, 5, 1, 3, 5, 1, 2, 5, 5, 2, 4, 2, 3, 5,
1, 3, 4, 1, 3, 5, 1, 2, 5, 5, 2, 4, 1, 2, 5, 1, 3, 5, 3, 3,
5, 1, 2, 5, 5, 2, 4, 2, 2, 5, 1, 3, 5, 3, 3, 5, 1, 2, 5, 1,
2, 4, 1, 2, 5, 2, 3, 5, 1, 3, 5, 1, 2, 5, 1, 2, 4, 2, 2, 5,
1, 3, 5, 1, 3, 5, 1, 2, 5, 5, 2, 4, 2, 2, 5, 2, 3, 5, 3, 3,
5, 1, 2, 5, 5, 2, 4, 2, 2, 5, 2, 3, 5, 3, 3, 5, 1, 2, 5, 5,
2, 4, 2, 2, 5, 1, 3, 5, 3, 3, 5, 1, 2, 5, 5, 2, 4, 2, 2, 5,
1, 3, 5, 3, 3, 5, 1, 2, 5, 1, 2, 4, 1, 2, 5, 2, 3, 5, 1, 3,
5, 1, 2, 5, 5, 2, 4, 2, 2, 5, 2, 3, 5, 3, 3, 5, 1, 2, 5, 5,
2, 4, 1, 2, 5, 1, 3, 5, 3, 3, 5, 1, 2, 5, 5, 2, 4, 2, 2, 5,
1, 3, 5, 3, 3, 5, 1, 2, 5, 5, 2, 4, 2, 2, 5, 1, 3, 5, 3, 3,
5, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
};
char *f = c + 390;
int i, j, e, g, h;
char k, l;
i = 26;
j = 25;
k = l = 'M';
h = 2;
while (i > 0)
{
int x = i - a;
x = x > 0 ? x : 0;
x = j - x;
g = x * 3 + h;
switch (f[g])
{
case 1:
--i;
--j;
h = 2;
f -= b * 3;
k = 'M';
break;
case 2:
--i;
h = 0;
f -= b * 3;
k = 'I';
break;
case 3:
--i;
h = 2;
f -= b * 3;
k = 'I';
break;
case 4:
--j;
h = 1;
k = 'D';
break;
case 5:
--j;
h = 2;
k = 'D';
break;
}
if (k == l)
++e;
else
{
foo (l);
l = k;
}
}
}
int
main ()
{
char l = 'D';
foo (l);
bar ();
return 0;
}