1  void bar ();
       2  
       3  int toto()
       4  {
       5    int i,j, b;
       6    int a[100];
       7  
       8    for (j = 0; j <= 20; j++)
       9      {
      10        a[j] = b + i;
      11        
      12        if (j * i == b)
      13          break;
      14  
      15        a[j+b] = b + i;
      16      }
      17  
      18    a[i] = b + 3;
      19  
      20  
      21    return a[b];
      22  }
      23  
      24  /* { dg-final { scan-tree-dump-times "number of SCoPs: 0" 1 "graphite"} } */