|
| 1 | +#include "node_simd.h" |
| 2 | + |
| 3 | +#if NODE_HAS_SIMD_NEON |
| 4 | +#include <arm_neon.h> |
| 5 | +#endif |
| 6 | + |
| 7 | +namespace node { |
| 8 | +namespace simd { |
| 9 | + |
| 10 | +#if NODE_HAS_SIMD_NEON |
| 11 | +uint32_t utf8_byte_length(const uint8_t* data, size_t length) { |
| 12 | + uint64_t result{0}; |
| 13 | + |
| 14 | + const int lanes = sizeof(uint8x16_t); |
| 15 | + const int max_sra_count = 256 / lanes; // Avoid overflowing vaddvq_u8. |
| 16 | + const int unrolls = max_sra_count; |
| 17 | + const int unrolled_lanes = lanes * unrolls; |
| 18 | + |
| 19 | + const uint8_t *unroll_end = data + (length / unrolled_lanes) * unrolled_lanes; |
| 20 | + uint32_t length_after_unroll = length % unrolled_lanes; |
| 21 | + for (; data < unroll_end;) { |
| 22 | + uint8x16_t acc = {}; |
| 23 | + for (int i = 0; i < unrolls; ++i, data += lanes) { |
| 24 | + uint8x16_t chunk = vld1q_u8(data); |
| 25 | + acc = vsraq_n_u8(acc, chunk, 7); |
| 26 | + } |
| 27 | + result += vaddvq_u8(acc); |
| 28 | + } |
| 29 | + |
| 30 | + const uint8_t *simd_end = data + (length_after_unroll / lanes) * lanes; |
| 31 | + uint32_t length_after_simd = length % lanes; |
| 32 | + uint8x16_t acc = {}; |
| 33 | + for (; data < simd_end; data += lanes) { |
| 34 | + uint8x16_t chunk = vld1q_u8(data); |
| 35 | + acc = vsraq_n_u8(acc, chunk, 7); |
| 36 | + } |
| 37 | + result += vaddvq_u8(acc); |
| 38 | + |
| 39 | + const uint8_t *scalar_end = data + length_after_simd; |
| 40 | + for (; data < scalar_end; data += 1) { |
| 41 | + result += *data >> 7; |
| 42 | + } |
| 43 | + |
| 44 | + return result + length; |
| 45 | +} |
| 46 | +#else |
| 47 | +uint32_t utf8_byte_length(const uint8_t* data, size_t length) { |
| 48 | + uint32_t result = 0; |
| 49 | + for (uint32_t i = 0; i < length; ++i) { |
| 50 | + result += (data[i] >> 7); |
| 51 | + } |
| 52 | + result += length; |
| 53 | + return result; |
| 54 | +} |
| 55 | +#endif |
| 56 | + |
| 57 | +} // namespace simd |
| 58 | +} // namespace node |
0 commit comments