blob: 258f17e3d366a580cda0a916b7fdac943d8725d4 (
plain)
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
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
|
/* { dg-require-effective-target vect_int } */
/* { dg-require-effective-target vect_condition } */
#include <stdarg.h>
#include "tree-vect.h"
/* PR tree-optimization/119920 */
#define N 32
unsigned int ub[N];
/* Test vectorization of reduction of unsigned-int. */
__attribute__ ((noinline, noipa))
void init(void)
{
#pragma GCC novector
for(int i = 0;i < N; i++)
ub[i] = i;
}
__attribute__ ((noinline, noipa))
void main1 (unsigned int b, unsigned int c)
{
int i;
unsigned int usum = 0;
init();
/* Summation. */
for (i = 0; i < N; i++) {
if ( ub[i] < N/2 )
{
usum += b;
}
else
{
usum += c;
}
}
/* check results: */
/* __builtin_printf("%d : %d\n", usum, (N/2*b + N/2*c)); */
if (usum != N/2*b + N/2*c)
abort ();
}
int main (void)
{
check_vect ();
main1 (0, 0);
main1 (1, 1);
main1 (10, 1);
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 1 "vect" { xfail { vect_no_int_add } } } } */
|
