1  /* PR tree-optimization/78574 */
       2  
       3  int a, d, f, g;
       4  int b[1];
       5  short h;
       6  int main() {
       7    long j;
       8    int k, i;
       9    for (; j; j++) {
      10      i = 0;
      11      for (; i < 6; i++) {
      12        int l = a, m = d || g;
      13      L:
      14        l ^ m | a;
      15      }
      16      b[j + 1] = 2;
      17      ++k;
      18      for (; g; g++) {
      19        d ^= h;
      20        if (f)
      21          for (;;)
      22            ;
      23      }
      24    }
      25    if (k)
      26      goto L;
      27  }