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