| 1 |
/* { dg-do run { target { riscv_v } } } */ |
| 2 |
/* { dg-additional-options "-mrvv-vector-bits=scalable" } */ |
| 3 |
|
| 4 |
#include "slp-3.c" |
| 5 |
|
| 6 |
#define LIMIT 128 |
| 7 |
|
| 8 |
void __attribute__ ((optimize (0))) |
| 9 |
f_golden (int8_t *restrict a, int8_t *restrict b, int n) |
| 10 |
{ |
| 11 |
for (int i = 0; i < n; ++i) |
| 12 |
{ |
| 13 |
a[i * 8] = b[i * 8 + 1] + 1; |
| 14 |
a[i * 8 + 1] = b[i * 8 + 7] + 2; |
| 15 |
a[i * 8 + 2] = b[i * 8 + 1] + 3; |
| 16 |
a[i * 8 + 3] = b[i * 8 + 7] + 4; |
| 17 |
a[i * 8 + 4] = b[i * 8 + 1] + 5; |
| 18 |
a[i * 8 + 5] = b[i * 8 + 7] + 6; |
| 19 |
a[i * 8 + 6] = b[i * 8 + 1] + 7; |
| 20 |
a[i * 8 + 7] = b[i * 8 + 7] + 8; |
| 21 |
} |
| 22 |
} |
| 23 |
|
| 24 |
int |
| 25 |
main (void) |
| 26 |
{ |
| 27 |
#define RUN(NUM) \ |
| 28 |
int8_t a_##NUM[NUM * 8 + 8] = {0}; \ |
| 29 |
int8_t a_golden_##NUM[NUM * 8 + 8] = {0}; \ |
| 30 |
int8_t b_##NUM[NUM * 8 + 8] = {0}; \ |
| 31 |
for (int i = 0; i < NUM * 8 + 8; i++) \ |
| 32 |
{ \ |
| 33 |
if (i % NUM == 0) \ |
| 34 |
b_##NUM[i] = (i + NUM) % LIMIT; \ |
| 35 |
else \ |
| 36 |
b_##NUM[i] = (i - NUM) % (-LIMIT); \ |
| 37 |
} \ |
| 38 |
f (a_##NUM, b_##NUM, NUM); \ |
| 39 |
f_golden (a_golden_##NUM, b_##NUM, NUM); \ |
| 40 |
for (int i = 0; i < NUM * 8 + 8; i++) \ |
| 41 |
{ \ |
| 42 |
if (a_##NUM[i] != a_golden_##NUM[i]) \ |
| 43 |
__builtin_abort (); \ |
| 44 |
} |
| 45 |
|
| 46 |
RUN (3); |
| 47 |
RUN (5); |
| 48 |
RUN (15); |
| 49 |
RUN (16); |
| 50 |
RUN (17); |
| 51 |
RUN (31); |
| 52 |
RUN (32); |
| 53 |
RUN (33); |
| 54 |
RUN (63); |
| 55 |
RUN (64); |
| 56 |
RUN (65); |
| 57 |
RUN (127); |
| 58 |
RUN (128); |
| 59 |
RUN (129); |
| 60 |
RUN (239); |
| 61 |
RUN (359); |
| 62 |
RUN (498); |
| 63 |
RUN (799); |
| 64 |
RUN (977); |
| 65 |
RUN (5789); |
| 66 |
return 0; |
| 67 |
} |