File: vect-cond-2.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 (42 lines) | stat: -rw-r--r-- 649 bytes parent folder | download | duplicates (4) 
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
 
/* { dg-require-effective-target vect_condition } */

#include "tree-vect.h"

#define N 16

int c[N] = {3,2,1,10,1,42,3,4,50,9,32,8,11,10,1,2};
int a[N+1] = {0,16,32,48,64,128,256,512,0,16,32,48,64,128,256,512,1024};

__attribute__ ((noinline)) void 
foo (int *x)
{
  int i;
  int curr_a, flag, next_a;

  curr_a = a[0];

  for (i = 0; i < N; i++) 
    {
      flag = *x > c[i];
      next_a = a[i+1];
      curr_a = flag ? curr_a : next_a;
    }

  *x = curr_a;
}

int main (void)
{
  int x = 7;

  check_vect ();

  foo (&x);

  if (x != 256)
    abort ();

  return 0;
}

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