File: vect-ifcvt-11.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 (37 lines) | stat: -rw-r--r-- 708 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
 
/* { dg-require-effective-target vect_condition } */
/* { dg-require-effective-target vect_int } */

#include "tree-vect.h"

#define N 16

extern void abort (void);

int A[N] = {36, 39, 42, 45, 43, 32, 21, 12, 23, 34, 45, 56, 67, 78, 81, 11};
int B[N] = {144,195,210,225,172,128,105,60, 92, 136,225,280,268,390,324,55};

__attribute__((noinline))
void foo ()
{
  for (int i = 0; i < N; i++)
    {
      int m = (A[i] & i) ? 5 : 4;
      A[i] = A[i] * m;
    }
}

int main ()
{

  check_vect ();
  foo ();
  /* check results:  */
#pragma GCC novector
  for (int i = 0; i < N; i++)
    if (A[i] != B[i])
      abort ();

  return 0;
}

/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" } } */