Mercurial > hg > CbC > CbC_gcc
view gcc/testsuite/gcc.dg/tree-ssa/gen-vect-11c.c @ 145:1830386684a0
gcc-9.2.0
author | anatofuz |
---|---|
date | Thu, 13 Feb 2020 11:34:05 +0900 |
parents | 04ced10e8804 |
children |
line wrap: on
line source
/* { dg-do run { target vect_cmdline_needed } } */ /* { dg-options "-O2 -ftree-vectorize -fdump-tree-vect-details" } */ /* { dg-options "-O2 -ftree-vectorize -fdump-tree-vect-details -mno-vx" { target { s390*-*-* } } } */ /* { dg-options "-O2 -ftree-vectorize -fdump-tree-vect-details -mno-sse" { target { i?86-*-* x86_64-*-* } } } */ #include <stdlib.h> #define N 16 /* One x86_64 mingw a long remains 4 bytes sized, but machine word is 8 bytes. */ #if LONG_MAX == 2147483647 && !defined (_WIN64) typedef short half_word; #else typedef int half_word; #endif int main () { int i; half_word ia[N]; half_word ic[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45}; half_word ib[N] = {0,3,6,9,12,15,18,21,24,27,30,33,36,39,42,45}; /* Not worthwhile, only 2 parts per int */ for (i = 0; i < N; i++) { ia[i] = ib[i] + ic[i]; } /* check results: */ for (i = 0; i < N; i++) { if (ia[i] != ib[i] + ic[i]) abort (); } return 0; } /* { dg-final { scan-tree-dump-times "vectorized 0 loops" 1 "vect" { xfail amdgcn*-*-* } } } */