blob: 60a4fc85481693ff76923f4c66d42b98c0fdc435 (
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
|
/* { dg-require-effective-target vect_int } */
#include <stdarg.h>
#include "tree-vect.h"
#define N 64
unsigned char uX[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
unsigned short uY[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
unsigned int uresult[N];
signed char X[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
signed short Y[N] __attribute__ ((__aligned__(__BIGGEST_ALIGNMENT__)));
int result[N];
/* Unsigned type promotion (hi->si) */
__attribute__ ((noinline)) int
foo1(int len) {
int i;
for (i=0; i<len; i++) {
uX[i] = 5;
uresult[i] = (unsigned int)uY[i];
}
}
/* Signed type promotion (hi->si) */
__attribute__ ((noinline)) int
foo2(int len) {
int i;
for (i=0; i<len; i++) {
uX[i] = 5;
result[i] = (int)Y[i];
}
}
int main (void)
{
int i;
check_vect ();
for (i=0; i<N; i++) {
X[i] = 16-i;
uX[i] = 16-i;
__asm__ volatile ("");
}
foo1 (N);
for (i=0; i<N; i++) {
if (uresult[i] != (unsigned short)uY[i])
abort ();
}
foo2 (N);
for (i=0; i<N; i++) {
if (result[i] != (short)Y[i])
abort ();
}
return 0;
}
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 2 "vect" { target vect_unpack } } } */
/* { dg-final { cleanup-tree-dump "vect" } } */
|
