Mercurial > hg > CbC > CbC_gcc
view gcc/testsuite/gcc.dg/vect/vect-widen-mult-const-s16.c @ 158:494b0b89df80 default tip
...
author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
---|---|
date | Mon, 25 May 2020 18:13:55 +0900 |
parents | 1830386684a0 |
children |
line wrap: on
line source
/* Disabling epilogues until we find a better way to deal with scans. */ /* { dg-additional-options "--param vect-epilogues-nomask=0" } */ /* { dg-require-effective-target vect_int } */ /* { dg-additional-options "-fno-ipa-icf" } */ #include "tree-vect.h" #define N 32 __attribute__ ((noinline)) void foo (int *__restrict a, short *__restrict b, int n) { int i; for (i = 0; i < n; i++) a[i] = b[i] * 2333; for (i = 0; i < n; i++) if (a[i] != b[i] * 2333) abort (); } __attribute__ ((noinline)) void bar (int *__restrict a, short *__restrict b, int n) { int i; for (i = 0; i < n; i++) a[i] = b[i] * (short) 2333; for (i = 0; i < n; i++) if (a[i] != b[i] * (short) 2333) abort (); } int main (void) { int i; int a[N]; short b[N]; check_vect (); for (i = 0; i < N; i++) { a[i] = 0; b[i] = i; __asm__ volatile (""); } foo (a, b, N); bar (a, b, N); return 0; } /* { dg-final { scan-tree-dump-times "vectorized 1 loops" 2 "vect" { target vect_widen_mult_hi_to_si } } } */ /* { dg-final { scan-tree-dump-times {vect_recog_widen_mult_pattern: detected:[^\n]* 2333} 2 "vect" { target vect_widen_mult_hi_to_si_pattern } } } */ /* { dg-final { scan-tree-dump-times {widen_mult pattern recognized:[^\n]* 2333} 2 "vect" { target vect_widen_mult_hi_to_si_pattern } } } */