|
| 1 | +/* -*- mode: c; c-basic-offset: 4; indent-tabs-mode: nil; tab-width: 4 -*- */ |
| 2 | +/* vi: set expandtab shiftwidth=4 tabstop=4: */ |
| 3 | +/** |
| 4 | + * \file |
| 5 | + * RISC-V Vector (RVV) accelerated base64 encoder/decoder implementation |
| 6 | + * |
| 7 | + * Optimizes table lookup using RVV vrgather (encode) and vectorized |
| 8 | + * range comparisons (decode) for significant speedup on rv64gcv hardware. |
| 9 | + * |
| 10 | + * Licensed to the Apache Software Foundation (ASF) under one |
| 11 | + * or more contributor license agreements. See the NOTICE file |
| 12 | + * distributed with this work for additional information |
| 13 | + * regarding copyright ownership. The ASF licenses this file |
| 14 | + * to you under the Apache License, Version 2.0 (the |
| 15 | + * License); you may not use this file except in compliance |
| 16 | + * with the License. You may obtain a copy of the License at |
| 17 | + * |
| 18 | + * http://www.apache.org/licenses/LICENSE-2.0 |
| 19 | + * |
| 20 | + * Unless required by applicable law or agreed to in writing, |
| 21 | + * software distributed under the License is distributed on an |
| 22 | + * AS IS BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY |
| 23 | + * KIND, either express or implied. See the License for the |
| 24 | + * specific language governing permissions and limitations |
| 25 | + * under the License. |
| 26 | + */ |
| 27 | + |
| 28 | +#include "modp_b64_rvv.h" |
| 29 | + |
| 30 | +#if defined(__riscv) && defined(__riscv_vector) |
| 31 | +#include <riscv_vector.h> |
| 32 | +#include <stdint.h> |
| 33 | +#include <stdbool.h> |
| 34 | + |
| 35 | +#ifdef __cplusplus |
| 36 | +extern "C" { |
| 37 | +#endif |
| 38 | + |
| 39 | +/* 64-entry base64 alphabet (A-Z, a-z, 0-9, +, /) */ |
| 40 | +static const uint8_t s_rvv_alphabet[64] = { |
| 41 | + 'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P', |
| 42 | + 'Q','R','S','T','U','V','W','X','Y','Z','a','b','c','d','e','f', |
| 43 | + 'g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v', |
| 44 | + 'w','x','y','z','0','1','2','3','4','5','6','7','8','9','+','/' |
| 45 | +}; |
| 46 | + |
| 47 | +/** |
| 48 | + * rvv_modp_b64_encode - Fully vectorized RVV base64 encode |
| 49 | + * |
| 50 | + * Processes 12 input bytes at a time (producing 16 output bytes): |
| 51 | + * 1. Load 12 bytes into vector (LMUL=1) |
| 52 | + * 2. Extract stride-0/1/2 triplets via vrgather with stride-3 indices |
| 53 | + * 3. Compute all 6-bit index values in vector registers using vsrl/vsll/vand/vor |
| 54 | + * 4. Store 4×4 groups to temp buffer, reload as LMUL=4 |
| 55 | + * 5. Reorder from stride-3-grouped to sequential output via vrgather interleave |
| 56 | + * 6. Table lookup via vrgather from 64-entry alphabet (LMUL=4) |
| 57 | + * |
| 58 | + * The alphabet (64 bytes) is preloaded into LMUL=4 register group. |
| 59 | + */ |
| 60 | +size_t rvv_modp_b64_encode(char* dest, const char* str, size_t len) |
| 61 | +{ |
| 62 | + size_t i = 0; |
| 63 | + uint8_t* p = (uint8_t*)dest; |
| 64 | + |
| 65 | + /* Preload 64-byte alphabet into LMUL=4 register group */ |
| 66 | + size_t vl_alpha = __riscv_vsetvl_e8m4(64); |
| 67 | + vuint8m4_t v_alpha = __riscv_vle8_v_u8m4(s_rvv_alphabet, vl_alpha); |
| 68 | + |
| 69 | + /* Interleave indices: 4×4 stride-3 groups → sequential [0,4,8,12, 1,5,9,13, ...] */ |
| 70 | + static const uint8_t s_interleave[16] = { |
| 71 | + 0, 4, 8, 12, 1, 5, 9, 13, 2, 6, 10, 14, 3, 7, 11, 15 |
| 72 | + }; |
| 73 | + size_t vl16 = __riscv_vsetvl_e8m4(16); |
| 74 | + vuint8m4_t v_interleave = __riscv_vle8_v_u8m4(s_interleave, vl16); |
| 75 | + |
| 76 | + /* Stride-3 gather indices: [0, 3, 6, 9] */ |
| 77 | + size_t vl4 = __riscv_vsetvl_e8m1(4); |
| 78 | + vuint8m1_t v_stride = __riscv_vid_v_u8m1(vl4); |
| 79 | + v_stride = __riscv_vmul_vx_u8m1(v_stride, 3, vl4); |
| 80 | + |
| 81 | + size_t vl12 = __riscv_vsetvl_e8m1(12); |
| 82 | + |
| 83 | + while (i + 12 <= len) { |
| 84 | + vuint8m1_t v_in = __riscv_vle8_v_u8m1((const uint8_t*)(str + i), vl12); |
| 85 | + |
| 86 | + /* Gather stride-0: bytes at [0, 3, 6, 9] → [b0, b3, b6, b9] */ |
| 87 | + vuint8m1_t v_s0 = __riscv_vrgather_vv_u8m1(v_in, v_stride, vl4); |
| 88 | + /* Gather stride-1: bytes at [1, 4, 7, 10] → [b1, b4, b7, b10] */ |
| 89 | + vuint8m1_t v_s1 = __riscv_vrgather_vv_u8m1(v_in, |
| 90 | + __riscv_vadd_vx_u8m1(v_stride, 1, vl4), vl4); |
| 91 | + /* Gather stride-2: bytes at [2, 5, 8, 11] → [b2, b5, b8, b11] */ |
| 92 | + vuint8m1_t v_s2 = __riscv_vrgather_vv_u8m1(v_in, |
| 93 | + __riscv_vadd_vx_u8m1(v_stride, 2, vl4), vl4); |
| 94 | + |
| 95 | + /* ---- Compute 6-bit indices for all 4 positions ---- */ |
| 96 | + |
| 97 | + /* Position 0 (first of triplet): b >> 2 */ |
| 98 | + vuint8m1_t v_p0 = __riscv_vsrl_vx_u8m1(v_s0, 2, vl4); |
| 99 | + |
| 100 | + /* Position 1: ((b & 3) << 4) | (b_next >> 4) */ |
| 101 | + vuint8m1_t v_p1 = __riscv_vor_vv_u8m1( |
| 102 | + __riscv_vsll_vx_u8m1(__riscv_vand_vx_u8m1(v_s0, 3, vl4), 4, vl4), |
| 103 | + __riscv_vsrl_vx_u8m1(v_s1, 4, vl4), vl4); |
| 104 | + |
| 105 | + /* Position 2: ((b & 0xF) << 2) | (b_next >> 6) */ |
| 106 | + vuint8m1_t v_p2 = __riscv_vor_vv_u8m1( |
| 107 | + __riscv_vsll_vx_u8m1(__riscv_vand_vx_u8m1(v_s1, 0xF, vl4), 2, vl4), |
| 108 | + __riscv_vsrl_vx_u8m1(v_s2, 6, vl4), vl4); |
| 109 | + |
| 110 | + /* Position 3 (last of triplet): b & 0x3F */ |
| 111 | + vuint8m1_t v_p3 = __riscv_vand_vx_u8m1(v_s2, 0x3F, vl4); |
| 112 | + |
| 113 | + uint8_t idx_buf[16] __attribute__((aligned(16))); |
| 114 | + __riscv_vse8_v_u8m1(idx_buf, v_p0, vl4); |
| 115 | + __riscv_vse8_v_u8m1(idx_buf + 4, v_p1, vl4); |
| 116 | + __riscv_vse8_v_u8m1(idx_buf + 8, v_p2, vl4); |
| 117 | + __riscv_vse8_v_u8m1(idx_buf + 12, v_p3, vl4); |
| 118 | + |
| 119 | + vuint8m4_t v_idx = __riscv_vrgather_vv_u8m4( |
| 120 | + __riscv_vle8_v_u8m4(idx_buf, vl16), v_interleave, vl16); |
| 121 | + vuint8m4_t v_out = __riscv_vrgather_vv_u8m4(v_alpha, v_idx, vl16); |
| 122 | + __riscv_vse8_v_u8m4(p, v_out, vl16); |
| 123 | + |
| 124 | + p += 16; |
| 125 | + i += 12; |
| 126 | + } |
| 127 | + |
| 128 | + /* Tail processing: remaining bytes (0-11) handled via scalar fallback */ |
| 129 | + { |
| 130 | + size_t remaining = len - i; |
| 131 | + const uint8_t* s = (const uint8_t*)(str + i); |
| 132 | + uint8_t* d = p; |
| 133 | + |
| 134 | + uint8_t t1, t2, t3; |
| 135 | + size_t ti = 0; |
| 136 | + |
| 137 | + if (remaining > 2) { |
| 138 | + for (; ti < remaining - 2; ti += 3) { |
| 139 | + t1 = s[ti]; t2 = s[ti+1]; t3 = s[ti+2]; |
| 140 | + *d++ = s_rvv_alphabet[t1 >> 2]; |
| 141 | + *d++ = s_rvv_alphabet[((t1 & 0x03) << 4) | ((t2 >> 4) & 0x0F)]; |
| 142 | + *d++ = s_rvv_alphabet[((t2 & 0x0F) << 2) | ((t3 >> 6) & 0x03)]; |
| 143 | + *d++ = s_rvv_alphabet[t3 & 0x3F]; |
| 144 | + } |
| 145 | + } |
| 146 | + |
| 147 | + switch (remaining - ti) { |
| 148 | + case 1: |
| 149 | + t1 = s[ti]; |
| 150 | + *d++ = s_rvv_alphabet[t1 >> 2]; |
| 151 | + *d++ = s_rvv_alphabet[(t1 & 0x03) << 4]; |
| 152 | + *d++ = '='; |
| 153 | + *d++ = '='; |
| 154 | + break; |
| 155 | + case 2: |
| 156 | + t1 = s[ti]; t2 = s[ti+1]; |
| 157 | + *d++ = s_rvv_alphabet[t1 >> 2]; |
| 158 | + *d++ = s_rvv_alphabet[((t1 & 0x03) << 4) | ((t2 >> 4) & 0x0F)]; |
| 159 | + *d++ = s_rvv_alphabet[(t2 & 0x0F) << 2]; |
| 160 | + *d++ = '='; |
| 161 | + break; |
| 162 | + default: |
| 163 | + break; |
| 164 | + } |
| 165 | + |
| 166 | + return (size_t)(d - (uint8_t*)dest); |
| 167 | + } |
| 168 | +} |
| 169 | + |
| 170 | +/** |
| 171 | + * rvv_modp_b64_decode - RVV-accelerated base64 decode |
| 172 | + * |
| 173 | + * Processes 16 input bytes at a time (producing 12 output bytes): |
| 174 | + * 1. Load 16 base64 chars into a vector |
| 175 | + * 2. Classify each char into one of 5 ranges (A-Z, a-z, 0-9, +, /) |
| 176 | + * using vectorized comparisons |
| 177 | + * 3. Compute decoded 6-bit values for each range |
| 178 | + * 4. Merge via vmerge chain |
| 179 | + * 5. Pack 4x6-bit -> 3 bytes in scalar |
| 180 | + * |
| 181 | + * Returns number of decoded bytes, or MODP_B64_ERROR on invalid input. |
| 182 | + */ |
| 183 | +#define MODP_B64_RVV_ERROR ((size_t)-1) |
| 184 | + |
| 185 | +size_t rvv_modp_b64_decode(char* dest, const char* src, size_t len) |
| 186 | +{ |
| 187 | + if (len == 0) return 0; |
| 188 | + |
| 189 | + size_t i = 0; |
| 190 | + uint8_t* p = (uint8_t*)dest; |
| 191 | + |
| 192 | + /* Process 16 input bytes (12 output) per iteration */ |
| 193 | + while (i + 16 <= len) { |
| 194 | + size_t vl = __riscv_vsetvl_e8m1(16); |
| 195 | + vuint8m1_t v = __riscv_vle8_v_u8m1((const uint8_t*)(src + i), vl); |
| 196 | + |
| 197 | + /* Range classification masks */ |
| 198 | + vbool8_t m_upper = __riscv_vmsgeu_vx_u8m1_b8(v, 'A', vl); |
| 199 | + m_upper = __riscv_vmand_mm_b8(m_upper, __riscv_vmsleu_vx_u8m1_b8(v, 'Z', vl), vl); |
| 200 | + |
| 201 | + vbool8_t m_lower = __riscv_vmsgeu_vx_u8m1_b8(v, 'a', vl); |
| 202 | + m_lower = __riscv_vmand_mm_b8(m_lower, __riscv_vmsleu_vx_u8m1_b8(v, 'z', vl), vl); |
| 203 | + |
| 204 | + vbool8_t m_digit = __riscv_vmsgeu_vx_u8m1_b8(v, '0', vl); |
| 205 | + m_digit = __riscv_vmand_mm_b8(m_digit, __riscv_vmsleu_vx_u8m1_b8(v, '9', vl), vl); |
| 206 | + |
| 207 | + vbool8_t m_plus = __riscv_vmseq_vx_u8m1_b8(v, '+', vl); |
| 208 | + vbool8_t m_slash = __riscv_vmseq_vx_u8m1_b8(v, '/', vl); |
| 209 | + |
| 210 | + /* Validate: every char must be in one of the 5 ranges */ |
| 211 | + vbool8_t m_valid = __riscv_vmor_mm_b8(m_upper, m_lower, vl); |
| 212 | + m_valid = __riscv_vmor_mm_b8(m_valid, m_digit, vl); |
| 213 | + m_valid = __riscv_vmor_mm_b8(m_valid, m_plus, vl); |
| 214 | + m_valid = __riscv_vmor_mm_b8(m_valid, m_slash, vl); |
| 215 | + |
| 216 | + if (__riscv_vcpop_m_b8(m_valid, vl) != 16) { |
| 217 | + break; /* Invalid char -> scalar fallback */ |
| 218 | + } |
| 219 | + |
| 220 | + /* Compute decoded values per range */ |
| 221 | + vuint8m1_t v_upper_val = __riscv_vsub_vx_u8m1(v, 'A', vl); |
| 222 | + vuint8m1_t v_lower_val = __riscv_vsub_vx_u8m1(v, 'a', vl); |
| 223 | + v_lower_val = __riscv_vadd_vx_u8m1(v_lower_val, 26, vl); |
| 224 | + vuint8m1_t v_digit_val = __riscv_vsub_vx_u8m1(v, '0', vl); |
| 225 | + v_digit_val = __riscv_vadd_vx_u8m1(v_digit_val, 52, vl); |
| 226 | + vuint8m1_t v_plus_val = __riscv_vmv_v_x_u8m1(62, vl); |
| 227 | + vuint8m1_t v_slash_val = __riscv_vmv_v_x_u8m1(63, vl); |
| 228 | + |
| 229 | + /* Merge chain: most specific first, least specific last */ |
| 230 | + vuint8m1_t v_dec; |
| 231 | + v_dec = __riscv_vmerge_vvm_u8m1(v_slash_val, v_plus_val, m_plus, vl); |
| 232 | + v_dec = __riscv_vmerge_vvm_u8m1(v_dec, v_digit_val, m_digit, vl); |
| 233 | + v_dec = __riscv_vmerge_vvm_u8m1(v_dec, v_lower_val, m_lower, vl); |
| 234 | + v_dec = __riscv_vmerge_vvm_u8m1(v_dec, v_upper_val, m_upper, vl); |
| 235 | + |
| 236 | + /* Scalar packing: 4x6-bit -> 3 bytes */ |
| 237 | + uint8_t dec_buf[16] __attribute__((aligned(16))); |
| 238 | + __riscv_vse8_v_u8m1(dec_buf, v_dec, vl); |
| 239 | + |
| 240 | + for (int j = 0; j < 4; j++) { |
| 241 | + uint8_t d0 = dec_buf[j*4]; |
| 242 | + uint8_t d1 = dec_buf[j*4 + 1]; |
| 243 | + uint8_t d2 = dec_buf[j*4 + 2]; |
| 244 | + uint8_t d3 = dec_buf[j*4 + 3]; |
| 245 | + *p++ = (uint8_t)((d0 << 2) | (d1 >> 4)); |
| 246 | + *p++ = (uint8_t)(((d1 & 0x0F) << 4) | (d2 >> 2)); |
| 247 | + *p++ = (uint8_t)(((d2 & 0x03) << 6) | d3); |
| 248 | + } |
| 249 | + i += 16; |
| 250 | + } |
| 251 | + |
| 252 | + /* Scalar fallback for remaining <16 bytes or chunks with errors */ |
| 253 | + { |
| 254 | + size_t remaining = len - i; |
| 255 | + const uint8_t* s = (const uint8_t*)(src + i); |
| 256 | + uint8_t* d = p; |
| 257 | + |
| 258 | + for (size_t si = 0; si + 4 <= remaining; si += 4) { |
| 259 | + uint8_t c0 = s[si], c1 = s[si+1], c2 = s[si+2], c3 = s[si+3]; |
| 260 | + int d0, d1, d2, d3; |
| 261 | + |
| 262 | +#define DECODE_CHAR(c, val) do { if (c >= 'A' && c <= 'Z') val = c - 'A'; else if (c >= 'a' && c <= 'z') val = c - 'a' + 26; else if (c >= '0' && c <= '9') val = c - '0' + 52; else if (c == '+') val = 62; else if (c == '/') val = 63; else return MODP_B64_RVV_ERROR; } while (0) |
| 263 | + |
| 264 | + DECODE_CHAR(c0, d0); DECODE_CHAR(c1, d1); |
| 265 | + DECODE_CHAR(c2, d2); DECODE_CHAR(c3, d3); |
| 266 | + |
| 267 | +#undef DECODE_CHAR |
| 268 | + |
| 269 | + *d++ = (uint8_t)((d0 << 2) | (d1 >> 4)); |
| 270 | + *d++ = (uint8_t)(((d1 & 0x0F) << 4) | (d2 >> 2)); |
| 271 | + *d++ = (uint8_t)(((d2 & 0x03) << 6) | d3); |
| 272 | + } |
| 273 | + return (size_t)(d - (uint8_t*)dest); |
| 274 | + } |
| 275 | +} |
| 276 | + |
| 277 | +#ifdef __cplusplus |
| 278 | +} |
| 279 | +#endif |
| 280 | + |
| 281 | +#endif /* __riscv_vector */ |
0 commit comments