1  void bar ();
       2  
       3  int toto()
       4  {
       5    int i,j, b;
       6    int a[100];
       7  
       8    if (i == 20)
       9      {
      10        b = 3;
      11        goto B;
      12      }
      13    else 
      14      {
      15        if (i == 30)
      16  	{
      17            a[i] = b;
      18  
      19  
      20            for (j = 0; j <= 20; j++)
      21              a[j] = b + i;
      22  
      23            B:
      24  
      25            for (j = 0; j <= 20; j++)
      26              a[j+b] = b + i;
      27            
      28            bar ();
      29  	}
      30        else 
      31          {
      32            a[i] = b + 3;
      33          }
      34      }
      35  
      36  
      37    return a[b];
      38  }
      39  
      40  /* { dg-final { scan-tree-dump-times "number of SCoPs: 0" 1 "graphite"} } */