Debian Codegraph @

gcc/testsuite/gcc.target/riscv/rvv/autovec/partial/slp_run-16.c

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