File: pr43430-1.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 (38 lines) | stat: -rw-r--r-- 792 bytes parent folder | download | duplicates (6) 
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
 
/* { dg-require-effective-target vect_int } */

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

#define N 16

typedef int myint;
myint data_ch1[N + 1] =
  { 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30 };
myint data_ch2[N + 1] =
  { 0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30 };
#define SUM 480

__attribute__ ((noinline)) int
foo (myint * s1, myint * s2, int stride)
{
  int score = 0;
  int x;
  for (x = 0; x < N; x++)
    score += ((s1[x] - s1[x + stride] + s2[x + stride]) >= 0 ?
	      s1[x] + s2[x + stride] :
	      s2[x + stride]);

  if (score != SUM)
    abort ();

  return 0;
}

int
main (void)
{
  check_vect ();
  return foo (data_ch1, data_ch2, 1);
}

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