Mercurial > hg > CbC > CbC_gcc
view gcc/testsuite/gcc.dg/vect/vect-strided-u16-i4.c @ 131:84e7813d76e9
gcc-8.2
author | mir3636 |
---|---|
date | Thu, 25 Oct 2018 07:37:49 +0900 |
parents | 04ced10e8804 |
children |
line wrap: on
line source
/* { dg-require-effective-target vect_int } */ #include <stdarg.h> #include "tree-vect.h" #define N 128 typedef struct { unsigned short a; unsigned short b; unsigned short c; unsigned short d; } s; __attribute__ ((noinline)) int main1 (s *arr) { int i; s *ptr = arr; s res[N]; unsigned short x, y, z, w; for (i = 0; i < N; i++) { x = ptr->b - ptr->a; y = ptr->d - ptr->c; res[i].c = x + y; z = ptr->a + ptr->c; w = ptr->b + ptr->d; res[i].a = z + w; res[i].d = x + y; res[i].b = x + y; ptr++; } /* check results: */ for (i = 0; i < N; i++) { if (res[i].c != arr[i].b - arr[i].a + arr[i].d - arr[i].c || res[i].a != arr[i].a + arr[i].c + arr[i].b + arr[i].d || res[i].d != arr[i].b - arr[i].a + arr[i].d - arr[i].c || res[i].b != arr[i].b - arr[i].a + arr[i].d - arr[i].c) abort (); } return 0; } int main (void) { int i; s arr[N]; check_vect (); for (i = 0; i < N; i++) { arr[i].a = i; arr[i].b = i * 2; arr[i].c = 17; arr[i].d = i+34; asm volatile ("" ::: "memory"); } main1 (arr); return 0; } /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { target vect_strided4 } } } */