Debian Codegraph @

gcc/testsuite/gcc.target/riscv/rvv/autovec/widen/vec-avg-run.c

raw
1 /* { dg-do run { target { riscv_v } } } */
2 /* { dg-additional-options "-std=c99 -fno-vect-cost-model -mrvv-vector-bits=scalable -lm" } */
3
4 #include <limits.h>
5 #include <math.h>
6 #include <assert.h>
7
8 #include "vec-avg-template.h"
9
10 #define SZ 256
11
12 #define RUNS1(TYPE, SCALE) \
13 TYPE a##TYPE[SZ + 1]; \
14 TYPE b##TYPE[SZ + 1]; \
15 TYPE dst##TYPE[SZ + 1]; \
16 for (int cnt = 0, i = -(SZ * SCALE) / 2; i < (SZ * SCALE) / 2; i += SCALE) \
17 { \
18 a##TYPE[cnt] = i; \
19 b##TYPE[cnt] = i + 1; \
20 dst##TYPE[cnt++] = 0; \
21 } \
22 vavg_##TYPE (dst##TYPE, a##TYPE, b##TYPE, SZ); \
23 for (int i = 0; i < SZ; i += SCALE) \
24 assert (dst##TYPE[i] == floor ((a##TYPE[i] + b##TYPE[i]) / 2.0));
25
26 #define RUNU1(TYPE, SCALE) \
27 TYPE a##TYPE[SZ + 1]; \
28 TYPE b##TYPE[SZ + 1]; \
29 TYPE dst##TYPE[SZ + 1]; \
30 for (int cnt = 0, i = 0; i < (SZ * SCALE); i += SCALE) \
31 { \
32 a##TYPE[cnt] = i; \
33 b##TYPE[cnt] = i + 1; \
34 dst##TYPE[cnt++] = 0; \
35 } \
36 vavg_##TYPE (dst##TYPE, a##TYPE, b##TYPE, SZ); \
37 for (int i = 0; i < SZ; i += SCALE) \
38 assert (dst##TYPE[i] == floor ((a##TYPE[i] + b##TYPE[i]) / 2.0));
39
40 #define RUNS2(TYPE, SCALE) \
41 TYPE a2##TYPE[SZ + 1]; \
42 TYPE b2##TYPE[SZ + 1]; \
43 TYPE dst2##TYPE[SZ + 1]; \
44 for (int cnt = 0, i = -(SZ * SCALE) / 2; i < (SZ * SCALE) / 2; i += SCALE) \
45 { \
46 a2##TYPE[cnt] = i; \
47 b2##TYPE[cnt] = i + 1; \
48 dst2##TYPE[cnt++] = 0; \
49 } \
50 vavg2_##TYPE (dst2##TYPE, a2##TYPE, b2##TYPE, SZ); \
51 for (int i = 0; i < SZ; i += SCALE) \
52 assert (dst2##TYPE[i] == ceil ((a2##TYPE[i] + b2##TYPE[i]) / 2.0));
53
54 #define RUNU2(TYPE, SCALE) \
55 TYPE a2##TYPE[SZ + 1]; \
56 TYPE b2##TYPE[SZ + 1]; \
57 TYPE dst2##TYPE[SZ + 1]; \
58 for (int cnt = 0, i = 0; i < (SZ * SCALE); i += SCALE) \
59 { \
60 a2##TYPE[cnt] = i; \
61 b2##TYPE[cnt] = i + 1; \
62 dst2##TYPE[cnt++] = 0; \
63 } \
64 vavg2_##TYPE (dst2##TYPE, a2##TYPE, b2##TYPE, SZ); \
65 for (int i = 0; i < SZ; i += SCALE) \
66 assert (dst2##TYPE[i] == ceil ((a2##TYPE[i] + b2##TYPE[i]) / 2.0));
67
68 #define RUN_ALL() \
69 RUNS1 (int8_t, 1) \
70 RUNS1 (int16_t, 256) \
71 RUNS1 (int32_t, 65536) \
72 RUNU1 (uint8_t, 1) \
73 RUNU1 (uint16_t, 256) \
74 RUNU1 (uint32_t, 65536) \
75 RUNS2 (int8_t, 1) \
76 RUNS2 (int16_t, 256) \
77 RUNS2 (int32_t, 65536) \
78 RUNU2 (uint8_t, 1) \
79 RUNU2 (uint16_t, 256) \
80 RUNU2 (uint32_t, 65536)\
81
82 int main ()
83 {
84 RUN_ALL ()
85 }