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
30
31
32
33
34
35
36
|
/* { dg-do compile } */
/* { dg-options "-c -O2 -ftree-vectorize -fdump-tree-ifcvt-stats" { target *-*-* } } */
#include <stdarg.h>
#define N 16
#define MAX 42
int A[N] = {36,39,42,45,43,32,21,12,23,34,45,56,67,78,89,11};
extern void abort(void);
int main1 ()
{
int i, j;
for (i = 0; i < N; i++)
{
j = A[i];
A[i] = ( j >= MAX ? MAX : 0);
}
/* check results: */
for (i = 0; i < N; i++)
{
if (A[i] > MAX)
abort ();
}
return 0;
}
/* { dg-final { scan-tree-dump-times "Applying if-conversion" 1 "ifcvt" } } */
/* { dg-final { cleanup-tree-dump "ifcvt" } } */
|
