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