File: pr78997.c

package info (click to toggle)
gcc-riscv64-unknown-elf 8.3.0.2019.08%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 680,956 kB
  • sloc: ansic: 3,237,715; cpp: 896,882; ada: 772,854; f90: 144,254; asm: 68,788; makefile: 67,456; sh: 29,743; exp: 28,045; objc: 15,273; fortran: 11,885; python: 7,369; pascal: 5,375; awk: 3,725; perl: 2,872; yacc: 316; xml: 311; ml: 285; lex: 198; haskell: 122
file content (106 lines) | stat: -rw-r--r-- 2,013 bytes parent folder | download | duplicates (6)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
/* { dg-do compile } */

int printf (const char *, ...);

static short f, p, q, s, u, aa, ab, ac;
static int b, c, d, e, h, k, l, m, n, o, r, t, v, w, x, y, z, ad, ae, af, ag, ah, ai, aj, ak, al, am, an;
int a, ao, ap, aq, ar, g, as, at, au, av, aw, ax, ay;

void foo ()
{ 
  int ba[2], i, j, bb;
  while (b)
    { 
      b++;
      while (b)
	{ 
	  for (; aw; aw++)
	    for (; q; q++)
	      { 
		short bc[20];
		if (k)
		  for (i = 0; i < 4; i++)
		    for (j = 0; j < 4; j++)
		      if (p)
			bc[i * 4 + j] = 8;
		for (; ad; ad--)
		  t = bc[1];
	      }
	  for (bb = 0; bb < 5; bb++)
	    if (m && v)
	      { 
		printf ("%d", n);
		v = g && v;
		n = 0;
	      }
	  ab &= ba[0];
	  aw = l;
	  aa++;
	  x++;
	  while (1)
	    { 
	      int bd[] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1};
	      ap = a ? ba[1] : 0;
	      if (ba[0] && o < ax)
		{ 
		  int be[] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1};
		  for (; ae; ae++)
		    { 
		      e ^= ba[b] ^ aa;
		      f = r;
		      for (; y; y++)
			aj &= u | ag;
		      int e[] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1};
		      if (a)
			{ 
			  r = c;
			  aj &= ag |= aq;
			}
		      av = ai * u;
		      af = c;
		    }
		  au = d;
		  p++;
		  u = aj;
		  a = ba[1];
		  at = ar = af != ai && l;
		  as = ax = f;
		  ao = ak ? 0 : ah;
		  aw = ao;
		}
	      ay = c;
	      int bf[] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1};
	      if (w < f)
		{ 
		  int bg[] = {0};
		  if (aw)
		    break;
		}
	      else
		aw = aa | (h &= ag) >> d, c = b = z && am;
	      for (; w; w--)
		l = ac ^= al |= b;
	      for (; k; k = 0)
		{ 
		  int bh = m | s && n;
		  m = bh;
		  for (; t; t--)
		    f = q ^= (c < (e < ah));
		}
	      d = an |= b;
	      if (v)
		{ 
		  int bi[] = {0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,1,1};
		  if (aw)
		    break;
		}
	    }
	}
    }
}

int main ()
{ 
  foo ();
  return 0;
}