File: pr56443.c

package info (click to toggle)
gcc-riscv64-unknown-elf 8.3.0.2019.08%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 680,956 kB
  • sloc: ansic: 3,237,715; cpp: 896,882; ada: 772,854; f90: 144,254; asm: 68,788; makefile: 67,456; sh: 29,743; exp: 28,045; objc: 15,273; fortran: 11,885; python: 7,369; pascal: 5,375; awk: 3,725; perl: 2,872; yacc: 316; xml: 311; ml: 285; lex: 198; haskell: 122
file content (29 lines) | stat: -rw-r--r-- 596 bytes parent folder | download | duplicates (10) 
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
 
/* PR tree-optimization/56443 */
/* { dg-do run } */
/* { dg-options "-ftree-vectorize" } */

extern void abort (void);
typedef int myint __attribute__ ((__aligned__ (16)));

int a1[1024] __attribute__ ((__aligned__ (16)));
int a2[1024] __attribute__ ((__aligned__ (16)));

__attribute__((noinline, noclone)) void
test (int n, myint * __restrict__ p1, myint * __restrict__ p2)
{
  while (n--)
    *p1++ = *p2++ + 1;
}

int
main ()
{
  int n;
  for (n = 0; n < 1024; n++)
    a2[n] = n;
  test (1024, a1, a2);
  for (n = 0; n < 1024; n++)
    if (a1[n] != a2[n] + 1)
      abort ();
  return 0;
}