blob: cfd32373181fc4fc1e37677ccec6505321a81b2f (
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
61
62
63
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 512
/* These multiplications should be vectorizable with additions when
no vector shift is available. */
__attribute__ ((noinline)) void
foo (int *arr)
{
for (int i = 0; i < N; i++)
arr[i] *= 2;
}
__attribute__ ((noinline)) void
foo2 (int *arr)
{
for (int i = 0; i < N; i++)
arr[i] *= 4;
}
int
main (void)
{
check_vect ();
int data[N];
int i;
for (i = 0; i < N; i++)
{
data[i] = i;
__asm__ volatile ("");
}
foo (data);
for (i = 0; i < N; i++)
{
if (data[i] / 2 != i)
__builtin_abort ();
__asm__ volatile ("");
}
for (i = 0; i < N; i++)
{
data[i] = i;
__asm__ volatile ("");
}
foo2 (data);
for (i = 0; i < N; i++)
{
if (data[i] / 4 != i)
__builtin_abort ();
__asm__ volatile ("");
}
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 2 "vect" } } */
|
