1  /* { dg-do compile } */
       2  
       3  int
       4  f1 (int *x, int n)
       5  {
       6    int res = 0;
       7    for (int i = 0; i < n; ++i)
       8      res += x[i * 2] == 1 ? 2 : 3;
       9    return res;
      10  }
      11  
      12  int
      13  f2 (int *x)
      14  {
      15    int res = 0;
      16    for (int i = 0; i < 0x83; ++i)
      17      res += x[i * 2] == 1 ? 2 : 3;
      18    return res;
      19  }
      20  
      21  int
      22  f3 (int *x, int n)
      23  {
      24    int res = 0;
      25    for (int i = 0; i < n; ++i)
      26      res += x[i * 2] == 1 ? 2 : 3;
      27    return res + x[0x100];
      28  }
      29  
      30  int
      31  f4 (int *x)
      32  {
      33    int res = 0;
      34    for (int i = 0; i < 0x83; ++i)
      35      res += x[i * 2] == 1 ? 2 : 3;
      36    return res + x[0x100];
      37  }
      38  
      39  int
      40  f5 (int *x, int n, int a)
      41  {
      42    int res = 0;
      43    for (int i = 0; i < n; ++i)
      44      res += x[i * 2] == 1 ? 2 : 3;
      45    x[a] += 1;
      46    return res;
      47  }
      48  
      49  int
      50  f6 (int *x, int a)
      51  {
      52    int res = 0;
      53    for (int i = 0; i < 0x83; ++i)
      54      res += x[i * 2] == 1 ? 2 : 3;
      55    x[a] += 1;
      56    return res;
      57  }