File: pr65206.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 (22 lines) | stat: -rw-r--r-- 767 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
 
/* { dg-do compile } */
/* { dg-require-effective-target vect_double } */
/* { dg-additional-options "-fno-trapping-math -fno-allow-store-data-races" } */
/* { dg-additional-options "-mavx" { target avx } } */

#define N 1024

double a[N], b[N];

void foo ()
{
  for (int i = 0; i < N; ++i)
    if (b[i] < 3.)
      a[i] += b[i];
}

/* We get a .MASK_STORE because while the load of a[i] does not trap
   the store would introduce store data races.  Make sure we still
   can handle the data dependence with zero distance.  */

/* { dg-final { scan-tree-dump-not "versioning for alias required" "vect" { target { vect_masked_store || avx } } } } */
/* { dg-final { scan-tree-dump "vectorized 1 loops in function" "vect" { target { vect_masked_store || avx } } } } */