File: pr35356-3.c

package info (click to toggle)
gcc-arm-none-eabi 15%3A7-2018-q2-5
  • links: PTS, VCS
  • area: main
  • in suites: buster
  • size: 539,188 kB
  • sloc: ansic: 2,739,935; cpp: 848,238; ada: 602,637; makefile: 62,919; asm: 55,635; xml: 46,238; exp: 23,020; sh: 19,616; python: 6,371; pascal: 3,889; awk: 3,278; perl: 2,691; yacc: 316; ml: 285; f90: 234; lex: 198; objc: 194; haskell: 119
file content (39 lines) | stat: -rw-r--r-- 837 bytes parent folder | download | duplicates (2) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
 
/* { dg-options "-O2 -fgraphite-identity -fdump-tree-graphite-all" } */


int winner, numf2s;
double **tds;
double d, tsum;

typedef struct {
  double y;
} xyz;

xyz *Y;
int ti;

double
match (void)
{
  int tj, tresult;

  for (tj = 0; tj < numf2s; tj++)
    if (tj == winner
	&& Y[tj].y > 0)
      tsum += tds[ti][tj] * d;

  return tsum;
}

/* There should be no loops generated for this testcase, instead we
   should generate the following:

   | if (winner >= 0 && winner < numf2s && Y[winner].y > 0)
   |   tsum += tds[ti][winner] * d;

   For the moment this is XFAILed as this loop is not detected as a
   SCoP by graphite: we depend on data in one of the conditions,
   "Y[winner].y > 0".  This could be fixed when we will use predicates
   for such cases.  */

/* { dg-final { scan-tree-dump-times "loop_1" 0 "graphite" } } */