| 1 |
/* { dg-do compile { target { ! riscv_abi_e } } } */ |
| 2 |
/* { dg-add-options riscv_v } */ |
| 3 |
/* { dg-additional-options "-O3 -mrvv-max-lmul=m8" } */ |
| 4 |
/* { dg-final { check-function-bodies "**" "" } } */ |
| 5 |
|
| 6 |
#define MIN_VECTOR_BYTES (__riscv_v_min_vlen / 8) |
| 7 |
|
| 8 |
/* Vectorise with no loop. |
| 9 |
** f1: |
| 10 |
** ( |
| 11 |
** vsetivli\s+zero,\d+,e8,m1,ta,ma |
| 12 |
** | |
| 13 |
** li\s+a\d+,\d+ |
| 14 |
** vsetvli\s+zero,a\d+,e8,m1,ta,ma |
| 15 |
** ) |
| 16 |
** vmv\.v\.x\s+v\d+,a1 |
| 17 |
** vse8\.v\s+v\d+,0\(a0\) |
| 18 |
** ret |
| 19 |
*/ |
| 20 |
void * |
| 21 |
f1 (void *a, int const b) |
| 22 |
{ |
| 23 |
return __builtin_memset (a, b, MIN_VECTOR_BYTES - 1); |
| 24 |
} |
| 25 |
|
| 26 |
/* Vectorised code should use smallest lmul known to fit length. |
| 27 |
** f2: |
| 28 |
** ( |
| 29 |
** vsetivli\s+zero,\d+,e8,m1,ta,ma |
| 30 |
** | |
| 31 |
** li\s+a\d+,\d+ |
| 32 |
** vsetvli\s+zero,a\d+,e8,m1,ta,ma |
| 33 |
** ) |
| 34 |
** vmv\.v\.x\s+v\d+,a1 |
| 35 |
** vse8\.v\s+v\d+,0\(a0\) |
| 36 |
** ret |
| 37 |
*/ |
| 38 |
void * |
| 39 |
f2 (void *a, int const b) |
| 40 |
{ |
| 41 |
return __builtin_memset (a, b, MIN_VECTOR_BYTES); |
| 42 |
} |
| 43 |
|
| 44 |
/* Vectorise+inline operations up to requested lmul. |
| 45 |
** f3: |
| 46 |
** ( |
| 47 |
** vsetivli\s+zero,\d+,e8,m8,ta,ma |
| 48 |
** | |
| 49 |
** li\s+a\d+,\d+ |
| 50 |
** vsetvli\s+zero,a\d+,e8,m8,ta,ma |
| 51 |
** ) |
| 52 |
** vmv\.v\.x\s+v\d+,a1 |
| 53 |
** vse8\.v\s+v\d+,0\(a0\) |
| 54 |
** ret |
| 55 |
*/ |
| 56 |
void * |
| 57 |
f3 (void *a, int const b) |
| 58 |
{ |
| 59 |
return __builtin_memset (a, b, MIN_VECTOR_BYTES * 8); |
| 60 |
} |
| 61 |
|
| 62 |
/* Don't vectorise if the move is too large for requested lmul. |
| 63 |
** f4: |
| 64 |
** li\s+a2,\d+ |
| 65 |
** tail\s+memset(?:@plt)? |
| 66 |
*/ |
| 67 |
void * |
| 68 |
f4 (void *a, int const b) |
| 69 |
{ |
| 70 |
return __builtin_memset (a, b, MIN_VECTOR_BYTES * 8 + 1); |
| 71 |
} |