| 1 |
/* { dg-do compile } */ |
| 2 |
/* { dg-options "-O2 -mavx -ftree-vectorize -fvect-cost-model=unlimited -fdump-tree-vect-details -mprefer-vector-width=256" } */ |
| 3 |
/* { dg-final { scan-tree-dump-times "vectorized 1 loops" 6 "vect" } } */ |
| 4 |
/* { dg-final { scan-tree-dump-times {(?n)add new stmt:.*MEM <vector\(4\) double>} 1 "vect" } } */ |
| 5 |
/* { dg-final { scan-tree-dump-times {(?n)add new stmt:.*MEM <vector\(8\) float>} 1 "vect" } } */ |
| 6 |
/* { dg-final { scan-tree-dump-times {(?n)add new stmt:.*MEM <vector\(4\) long long int>} 1 "vect" } } */ |
| 7 |
/* { dg-final { scan-tree-dump-times {(?n)add new stmt:.*MEM <vector\(8\) int>} 1 "vect" } } */ |
| 8 |
/* { dg-final { scan-tree-dump-times {(?n)add new stmt:.*MEM <vector\(16\) short int>} 1 "vect" } } */ |
| 9 |
/* { dg-final { scan-tree-dump-times {(?n)add new stmt:.*MEM <vector\(32\) char>} 1 "vect" } } */ |
| 10 |
|
| 11 |
#define N 10000 |
| 12 |
void |
| 13 |
__attribute__((noipa)) |
| 14 |
foo_pd (_Complex double* a) |
| 15 |
{ |
| 16 |
for (int i = 0; i != N; i++) |
| 17 |
a[i] = 1.0 + 2.0i; |
| 18 |
} |
| 19 |
|
| 20 |
void |
| 21 |
__attribute__((noipa)) |
| 22 |
foo_ps (_Complex float* a) |
| 23 |
{ |
| 24 |
for (int i = 0; i != N; i++) |
| 25 |
a[i] = 1.0f + 2.0fi; |
| 26 |
} |
| 27 |
|
| 28 |
void |
| 29 |
__attribute__((noipa)) |
| 30 |
foo_epi64 (_Complex long long* a) |
| 31 |
{ |
| 32 |
for (int i = 0; i != N; i++) |
| 33 |
a[i] = 1 + 2i; |
| 34 |
} |
| 35 |
|
| 36 |
void |
| 37 |
__attribute__((noipa)) |
| 38 |
foo_epi32 (_Complex int* a) |
| 39 |
{ |
| 40 |
for (int i = 0; i != N; i++) |
| 41 |
a[i] = 1 + 2i; |
| 42 |
} |
| 43 |
|
| 44 |
void |
| 45 |
__attribute__((noipa)) |
| 46 |
foo_epi16 (_Complex short* a) |
| 47 |
{ |
| 48 |
for (int i = 0; i != N; i++) |
| 49 |
a[i] = 1 + 2i; |
| 50 |
} |
| 51 |
|
| 52 |
void |
| 53 |
__attribute__((noipa)) |
| 54 |
foo_epi8 (_Complex char* a) |
| 55 |
{ |
| 56 |
for (int i = 0; i != N; i++) |
| 57 |
a[i] = 1 + 2i; |
| 58 |
} |