File: vect-nest-cycle-3.c

package info (click to toggle)
gcc-arm-none-eabi 15%3A14.2.rel1-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,099,328 kB
  • sloc: cpp: 3,627,108; ansic: 2,571,498; ada: 834,230; f90: 235,082; makefile: 79,231; asm: 74,984; xml: 51,692; exp: 39,736; sh: 33,298; objc: 15,629; python: 15,069; fortran: 14,429; pascal: 7,003; awk: 5,070; perl: 3,106; ml: 285; lisp: 253; lex: 204; haskell: 135
file content (56 lines) | stat: -rw-r--r-- 1,007 bytes parent folder | download 
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
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
 
/* { dg-require-effective-target vect_float } */

#include <stdarg.h>
#include "tree-vect.h"

#define N 16
#define DIFF 82

float c[N][N], b[N][N], a[N];

__attribute__ ((noinline)) int 
main1 ()
{
  int i, j;
  float diff;

  /* In inner loop vectorization -funsafe-math-optimizations is needed to 
     vectorize the summation. But in outer loop vectorization the order of
     calculation doesn't change, therefore, there is no need in that flag.  */
  for (i = 0; i < N; i++)
    {
      diff = 2;
      for (j = 0; j < N; j++) 
        diff += (b[j][i] - c[j][i]);

      a[i] = diff;
    }

  /* Check results:  */
#pragma GCC novector
  for (i = 0; i < N; i++)
    if (a[i] != DIFF)
      abort ();

  return 0;
}

int main (void)
{ 
  int i, j;

  check_vect ();
  
  for (i = 0; i < N; i++)
    for (j = 0; j < N; j++)
      {
        b[i][j] = i+j+5;
        c[i][j] = i+j;
      }
         
  main1 ();

  return 0;
}

/* { dg-final { scan-tree-dump-times "OUTER LOOP VECTORIZED" 1 "vect" } } */