blob: 8ba823b044c1ba1a1b57ebe0c3e82f0633b21749 (
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
64
65
66
67
68
69
70
71
72
73
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 64
#define DOT 43680
signed short X[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
signed int Y[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
/* (short, int)->int->int dot product.
Not detected as a dot-product pattern. */
__attribute__ ((noinline)) int
foo (int len)
{
int i;
int result = 0;
for (i = 0; i < len; i++)
{
result += (X[i] * Y[i]);
}
return result;
}
/* (int, short)->int->int dot product.
Not detected as a dot-product pattern. */
__attribute__ ((noinline)) int
bar (int len)
{
int i;
int result = 0;
for (i = 0; i < len; i++)
{
result += (Y[i] * X[i]);
}
return result;
}
int
main (void)
{
int i;
int dot;
check_vect ();
for (i = 0; i < N; i++)
{
X[i] = i;
Y[i] = N - i;
__asm__ volatile ("");
}
dot = foo (N);
if (dot != DOT)
abort ();
dot = bar (N);
if (dot != DOT)
abort ();
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 2 "vect" { target vect_unpack } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
