Mercurial > hg > CbC > CbC_gcc
view gcc/testsuite/gcc.dg/fold-bopcond-2.c @ 158:494b0b89df80 default tip
...
author | Shinji KONO <kono@ie.u-ryukyu.ac.jp> |
---|---|
date | Mon, 25 May 2020 18:13:55 +0900 |
parents | 04ced10e8804 |
children |
line wrap: on
line source
/* { dg-do compile } */ /* { dg-options "-O3 -fdump-tree-ifcvt" } */ int foo1 (unsigned short a[], unsigned int x) { unsigned int i; for (i = 0; i < 1000; i++) { x = a[i]; a[i] = (unsigned short)(x >= 32768 ? x - 32768 : 0); } return x; } int foo2 (unsigned short a[], unsigned int x) { unsigned int i; for (i = 0; i < 1000; i++) { x = a[i]; a[i] = (unsigned short)(x > 32768 ? x - 32768 : 0); } return x; } int foo3 (unsigned short a[], unsigned int x) { unsigned int i; for (i = 0; i < 1000; i++) { x = a[i]; a[i] = (unsigned short)(x > 1000 ? x - 1000 : 0); } return x; } int foo4 (unsigned short a[], unsigned int x) { unsigned int i; for (i = 0; i < 1000; i++) { x = a[i]; a[i] = (unsigned short)(x >= 2 ? x - 32768 : 32770); } return x; } /* { dg-final { scan-tree-dump-times "MAX_EXPR " 4 "ifcvt" } } */