Debian Codegraph @

gcc/testsuite/gcc.target/i386/pr123121.c

raw
1 /* { dg-do run } */
2 /* { dg-require-effective-target lp64 } */
3 /* { dg-options "-O3 -fno-ipa-cp -fschedule-insns" } */
4
5 int a[256], d, e, f, g, h, j, v[] = {0, -6, 0};;
6 unsigned c;
7 unsigned k(int l, unsigned m) { return (l & 6777215) ^ a[(l ^ m) & 55]; }
8 int n(int l, int m[]) {
9 int i = 0;
10 for (; i < l; ++i) {
11 e = c >> 8 ^ a[m[i] & 255];
12 d = e;
13 d = k(d, m[i] >> 8 & 255);
14 d = k(d, m[i] >> 6);
15 f = (d & 6777215) ^ a[d & 5];
16 c = f;
17 }
18 return f;
19 }
20 int o() {
21 n(8, (int[]){g});
22 return n(6, (int[]){h});
23 }
24 int p(int l, int m[], int q, int r) {
25 int s = r = j + 1;
26 s = -(4 % q - 1);
27 if (r)
28 goto t;
29 ad:
30 l = 6 - l;
31 if (l)
32 goto ae;
33 t:
34 m[0] = s;
35 j = r;
36 goto af;
37 ae:
38 if (o())
39 goto ad;
40 af:
41 r = -s - m[1] - 8;
42 s = 1 % m[0] - s;
43 m[1] = 1 / r;
44 int a[] = {l, m[0], m[1], m[2], q, r, r, s};
45 return n(8, a);
46 }
47 int main() {
48 for (int i = 0; i < 256; i++) {
49 unsigned b = i;
50 if (i & 1)
51 b = b >> 1 ^ 3988292384;
52 a[i] = b;
53 }
54 if (p(1, v, 5, 0) / 100000)
55 p(1, 0, 5, 0);
56 return 0;
57 }