#ifndef SIMDJSON_WESTMERE_SIMD_H #define SIMDJSON_WESTMERE_SIMD_H #ifndef SIMDJSON_CONDITIONAL_INCLUDE #include "simdjson/westmere/base.h" #include "simdjson/westmere/bitmask.h" #include "simdjson/internal/simdprune_tables.h" #endif // SIMDJSON_CONDITIONAL_INCLUDE namespace simdjson { namespace westmere { namespace simd { template struct base { using simd_t = __m128i; simd_t value; // Zero constructor simdjson_inline base() : value{simd_t()} {} // Conversion from SIMD register simdjson_inline base(const simd_t _value) : value(_value) {} // Conversion to SIMD register simdjson_inline operator const simd_t&() const { return this->value; } simdjson_inline operator simd_t&() { return this->value; } // Bit operations simdjson_inline Child operator|(const Child other) const { return _mm_or_si128(*this, other); } simdjson_inline Child operator&(const Child other) const { return _mm_and_si128(*this, other); } simdjson_inline Child operator^(const Child other) const { return _mm_xor_si128(*this, other); } simdjson_inline Child bit_andnot(const Child other) const { return _mm_andnot_si128(other, *this); } simdjson_inline Child& operator|=(const Child other) { auto this_cast = static_cast(this); *this_cast = *this_cast | other; return *this_cast; } simdjson_inline Child& operator&=(const Child other) { auto this_cast = static_cast(this); *this_cast = *this_cast & other; return *this_cast; } simdjson_inline Child& operator^=(const Child other) { auto this_cast = static_cast(this); *this_cast = *this_cast ^ other; return *this_cast; } }; template> struct base8: base> { using typename base>::simd_t; static constexpr const int LANES = sizeof(simd_t); using bitmask_t = uint16_t; static_assert(sizeof(bitmask_t)*8 == LANES, "Bitmask type's bits must equal the simd type's bytes"); simdjson_inline base8() : base>() {} simdjson_inline base8(const simd_t _value) : base>(_value) {} friend simdjson_inline Mask operator==(const simd8 lhs, const simd8 rhs) { return _mm_cmpeq_epi8(lhs, rhs); } template simdjson_inline simd8 prev(const simd8 prev_chunk) const { return _mm_alignr_epi8(*this, prev_chunk, 16 - N); } }; // SIMD byte mask type (returned by things like eq and gt) template<> struct simd8: base8 { using typename base8::simd_t; static simdjson_inline simd8 splat(bool _value) { return _mm_set1_epi8(uint8_t(-(!!_value))); } simdjson_inline simd8() : base8() {} simdjson_inline simd8(const simd_t _value) : base8(_value) {} // Splat constructor simdjson_inline simd8(bool _value) : base8(splat(_value)) {} simdjson_inline auto to_bitmask() const { return _mm_movemask_epi8(*this); } simdjson_inline bool any() const { return !_mm_testz_si128(*this, *this); } simdjson_inline simd8 operator~() const { return *this ^ true; } }; template struct base8_numeric: base8 { using typename base8::simd_t; using base8::LANES; static simdjson_inline simd8 splat(T _value) { return _mm_set1_epi8(_value); } static simdjson_inline simd8 zero() { return _mm_setzero_si128(); } static simdjson_inline simd8 load(const T values[16]) { return _mm_loadu_si128(reinterpret_cast(values)); } // Repeat 16 values as many times as necessary (usually for lookup tables) static simdjson_inline simd8 repeat_16( T v0, T v1, T v2, T v3, T v4, T v5, T v6, T v7, T v8, T v9, T v10, T v11, T v12, T v13, T v14, T v15 ) { return simd8( v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10,v11,v12,v13,v14,v15 ); } simdjson_inline base8_numeric() : base8() {} simdjson_inline base8_numeric(const simd_t _value) : base8(_value) {} // Store to array simdjson_inline void store(T dst[16]) const { return _mm_storeu_si128(reinterpret_cast(dst), *this); } // Override to distinguish from bool version simdjson_inline simd8 operator~() const { return *this ^ 0xFFu; } // Addition/subtraction are the same for signed and unsigned simdjson_inline simd8 operator+(const simd8 other) const { return _mm_add_epi8(*this, other); } simdjson_inline simd8 operator-(const simd8 other) const { return _mm_sub_epi8(*this, other); } simdjson_inline simd8& operator+=(const simd8 other) { *this = *this + other; return *static_cast*>(this); } simdjson_inline simd8& operator-=(const simd8 other) { *this = *this - other; return *static_cast*>(this); } // Perform a lookup assuming the value is between 0 and 16 (undefined behavior for out of range values) simdjson_inline simd8 lookup_16(const simd8& lookup_table) const { return _mm_shuffle_epi8(lookup_table, *this); } // Perform a lookup based on the lower 4 bits of each lane. (Platform-dependent behavior for // non-ASCII values--may look up the lower 4 bits on some platforms, and return 0 on others.) simdjson_inline simd8 lookup_low_nibble_ascii(const simd8& lookup_table) const { return lookup_16(lookup_table); } // Copies to 'output" all bytes corresponding to a 0 in the mask (interpreted as a bitset). // Passing a 0 value for mask would be equivalent to writing out every byte to output. // Only the first 16 - bitmask::count_ones(mask) bytes of the result are significant but 16 bytes // get written. // Design consideration: it seems like a function with the // signature simd8 compress(uint32_t mask) would be // sensible, but the AVX ISA makes this kind of approach difficult. template simdjson_inline void compress(uint16_t mask, L * output) const { using internal::thintable_epi8; using internal::BitsSetTable256mul2; using internal::pshufb_combine_table; // this particular implementation was inspired by work done by @animetosho // we do it in two steps, first 8 bytes and then second 8 bytes uint8_t mask1 = uint8_t(mask); // least significant 8 bits uint8_t mask2 = uint8_t(mask >> 8); // most significant 8 bits // next line just loads the 64-bit values thintable_epi8[mask1] and // thintable_epi8[mask2] into a 128-bit register, using only // two instructions on most compilers. simd_t shufmask = _mm_set_epi64x(thintable_epi8[mask2], thintable_epi8[mask1]); // we increment by 0x08 the second half of the mask shufmask = _mm_add_epi8(shufmask, _mm_set_epi32(0x08080808, 0x08080808, 0, 0)); // this is the version "nearly pruned" simd_t pruned = _mm_shuffle_epi8(*this, shufmask); // we still need to put the two halves together. // we compute the popcount of the first half: int pop1 = BitsSetTable256mul2[mask1]; // then load the corresponding mask, what it does is to write // only the first pop1 bytes from the first 8 bytes, and then // it fills in with the bytes from the second 8 bytes + some filling // at the end. simd_t compactmask = _mm_loadu_si128(reinterpret_cast(pshufb_combine_table + pop1 * 8)); simd_t answer = _mm_shuffle_epi8(pruned, compactmask); _mm_storeu_si128(reinterpret_cast(output), answer); } }; // Signed bytes template<> struct simd8 : base8_numeric { simdjson_inline simd8() : base8_numeric() {} simdjson_inline simd8(const simd_t _value) : base8_numeric(_value) {} // Splat constructor simdjson_inline simd8(int8_t _value) : simd8(splat(_value)) {} // Array constructor simdjson_inline simd8(const int8_t* values) : simd8(load(values)) {} // Member-by-member initialization simdjson_inline simd8( int8_t v0, int8_t v1, int8_t v2, int8_t v3, int8_t v4, int8_t v5, int8_t v6, int8_t v7, int8_t v8, int8_t v9, int8_t v10, int8_t v11, int8_t v12, int8_t v13, int8_t v14, int8_t v15 ) : simd8(_mm_setr_epi8( v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10,v11,v12,v13,v14,v15 )) {} // Repeat 16 values as many times as necessary (usually for lookup tables) simdjson_inline static simd8 repeat_16( int8_t v0, int8_t v1, int8_t v2, int8_t v3, int8_t v4, int8_t v5, int8_t v6, int8_t v7, int8_t v8, int8_t v9, int8_t v10, int8_t v11, int8_t v12, int8_t v13, int8_t v14, int8_t v15 ) { return simd8( v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10,v11,v12,v13,v14,v15 ); } // Order-sensitive comparisons simdjson_inline simd8 max_val(const simd8 other) const { return _mm_max_epi8(*this, other); } simdjson_inline simd8 min_val(const simd8 other) const { return _mm_min_epi8(*this, other); } simdjson_inline simd8 operator>(const simd8 other) const { return _mm_cmpgt_epi8(*this, other); } simdjson_inline simd8 operator<(const simd8 other) const { return _mm_cmpgt_epi8(other, *this); } }; // Unsigned bytes template<> struct simd8: base8_numeric { simdjson_inline simd8() : base8_numeric() {} simdjson_inline simd8(const simd_t _value) : base8_numeric(_value) {} // Splat constructor simdjson_inline simd8(uint8_t _value) : simd8(splat(_value)) {} // Array constructor simdjson_inline simd8(const uint8_t* values) : simd8(load(values)) {} // Member-by-member initialization simdjson_inline simd8( uint8_t v0, uint8_t v1, uint8_t v2, uint8_t v3, uint8_t v4, uint8_t v5, uint8_t v6, uint8_t v7, uint8_t v8, uint8_t v9, uint8_t v10, uint8_t v11, uint8_t v12, uint8_t v13, uint8_t v14, uint8_t v15 ) : simd8(_mm_setr_epi8( v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10,v11,v12,v13,v14,v15 )) {} // Repeat 16 values as many times as necessary (usually for lookup tables) simdjson_inline static simd8 repeat_16( uint8_t v0, uint8_t v1, uint8_t v2, uint8_t v3, uint8_t v4, uint8_t v5, uint8_t v6, uint8_t v7, uint8_t v8, uint8_t v9, uint8_t v10, uint8_t v11, uint8_t v12, uint8_t v13, uint8_t v14, uint8_t v15 ) { return simd8( v0, v1, v2, v3, v4, v5, v6, v7, v8, v9, v10,v11,v12,v13,v14,v15 ); } // Saturated math simdjson_inline simd8 saturating_add(const simd8 other) const { return _mm_adds_epu8(*this, other); } simdjson_inline simd8 saturating_sub(const simd8 other) const { return _mm_subs_epu8(*this, other); } // Order-specific operations simdjson_inline simd8 max_val(const simd8 other) const { return _mm_max_epu8(*this, other); } simdjson_inline simd8 min_val(const simd8 other) const { return _mm_min_epu8(*this, other); } // Same as >, but only guarantees true is nonzero (< guarantees true = -1) simdjson_inline simd8 gt_bits(const simd8 other) const { return this->saturating_sub(other); } // Same as <, but only guarantees true is nonzero (< guarantees true = -1) simdjson_inline simd8 lt_bits(const simd8 other) const { return other.saturating_sub(*this); } simdjson_inline simd8 operator<=(const simd8 other) const { return other.max_val(*this) == other; } simdjson_inline simd8 operator>=(const simd8 other) const { return other.min_val(*this) == other; } simdjson_inline simd8 operator>(const simd8 other) const { return this->gt_bits(other).any_bits_set(); } simdjson_inline simd8 operator<(const simd8 other) const { return this->gt_bits(other).any_bits_set(); } // Bit-specific operations simdjson_inline simd8 bits_not_set() const { return *this == uint8_t(0); } simdjson_inline simd8 bits_not_set(simd8 bits) const { return (*this & bits).bits_not_set(); } simdjson_inline simd8 any_bits_set() const { return ~this->bits_not_set(); } simdjson_inline simd8 any_bits_set(simd8 bits) const { return ~this->bits_not_set(bits); } simdjson_inline bool is_ascii() const { return _mm_movemask_epi8(*this) == 0; } simdjson_inline bool bits_not_set_anywhere() const { return _mm_testz_si128(*this, *this); } simdjson_inline bool any_bits_set_anywhere() const { return !bits_not_set_anywhere(); } simdjson_inline bool bits_not_set_anywhere(simd8 bits) const { return _mm_testz_si128(*this, bits); } simdjson_inline bool any_bits_set_anywhere(simd8 bits) const { return !bits_not_set_anywhere(bits); } template simdjson_inline simd8 shr() const { return simd8(_mm_srli_epi16(*this, N)) & uint8_t(0xFFu >> N); } template simdjson_inline simd8 shl() const { return simd8(_mm_slli_epi16(*this, N)) & uint8_t(0xFFu << N); } // Get one of the bits and make a bitmask out of it. // e.g. value.get_bit<7>() gets the high bit template simdjson_inline int get_bit() const { return _mm_movemask_epi8(_mm_slli_epi16(*this, 7-N)); } }; template struct simd8x64 { static constexpr int NUM_CHUNKS = 64 / sizeof(simd8); static_assert(NUM_CHUNKS == 4, "Westmere kernel should use four registers per 64-byte block."); const simd8 chunks[NUM_CHUNKS]; simd8x64(const simd8x64& o) = delete; // no copy allowed simd8x64& operator=(const simd8& other) = delete; // no assignment allowed simd8x64() = delete; // no default constructor allowed simdjson_inline simd8x64(const simd8 chunk0, const simd8 chunk1, const simd8 chunk2, const simd8 chunk3) : chunks{chunk0, chunk1, chunk2, chunk3} {} simdjson_inline simd8x64(const T ptr[64]) : chunks{simd8::load(ptr), simd8::load(ptr+16), simd8::load(ptr+32), simd8::load(ptr+48)} {} simdjson_inline simd8x64(simd8x64&& o) noexcept = default; simdjson_inline simd8x64& operator=(simd8x64&& other) noexcept = default; simdjson_inline void store(T ptr[64]) const { this->chunks[0].store(ptr+sizeof(simd8)*0); this->chunks[1].store(ptr+sizeof(simd8)*1); this->chunks[2].store(ptr+sizeof(simd8)*2); this->chunks[3].store(ptr+sizeof(simd8)*3); } simdjson_inline simd8 reduce_or() const { return (this->chunks[0] | this->chunks[1]) | (this->chunks[2] | this->chunks[3]); } simdjson_inline uint64_t compress(uint64_t mask, T * output) const { this->chunks[0].compress(uint16_t(mask), output); this->chunks[1].compress(uint16_t(mask >> 16), output + 16 - bitmask::count_ones(mask & 0xFFFF)); this->chunks[2].compress(uint16_t(mask >> 32), output + 32 - bitmask::count_ones(mask & 0xFFFFFFFF)); this->chunks[3].compress(uint16_t(mask >> 48), output + 48 - bitmask::count_ones(mask & 0xFFFFFFFFFFFF)); return 64 - bitmask::count_ones(mask); } simdjson_inline uint64_t to_bitmask() const { uint64_t r0 = uint32_t(this->chunks[0].to_bitmask() ); uint64_t r1 = this->chunks[1].to_bitmask() ; uint64_t r2 = this->chunks[2].to_bitmask() ; uint64_t r3 = this->chunks[3].to_bitmask() ; return r0 | (r1 << 16) | (r2 << 32) | (r3 << 48); } simdjson_inline uint64_t eq(const T m) const { const simd8 mask = simd8::splat(m); return simd8x64( this->chunks[0] == mask, this->chunks[1] == mask, this->chunks[2] == mask, this->chunks[3] == mask ).to_bitmask(); } simdjson_inline uint64_t eq(const simd8x64 &other) const { return simd8x64( this->chunks[0] == other.chunks[0], this->chunks[1] == other.chunks[1], this->chunks[2] == other.chunks[2], this->chunks[3] == other.chunks[3] ).to_bitmask(); } simdjson_inline uint64_t lteq(const T m) const { const simd8 mask = simd8::splat(m); return simd8x64( this->chunks[0] <= mask, this->chunks[1] <= mask, this->chunks[2] <= mask, this->chunks[3] <= mask ).to_bitmask(); } simdjson_inline simd8x64 lookup_16(const simd8& lookup_table) const { return { this->chunks[0].lookup_16(lookup_table), this->chunks[1].lookup_16(lookup_table), this->chunks[2].lookup_16(lookup_table), this->chunks[3].lookup_16(lookup_table), }; } simdjson_inline simd8x64 lookup_low_nibble_ascii(const simd8& lookup_table) const { return { this->chunks[0].lookup_low_nibble_ascii(lookup_table), this->chunks[1].lookup_low_nibble_ascii(lookup_table), this->chunks[2].lookup_low_nibble_ascii(lookup_table), this->chunks[3].lookup_low_nibble_ascii(lookup_table) }; } simdjson_inline simd8x64 operator&(const simd8x64& other) const { return { this->chunks[0] & other.chunks[0], this->chunks[1] & other.chunks[1], this->chunks[2] & other.chunks[2], this->chunks[3] & other.chunks[3] }; } simdjson_inline simd8x64 operator&(const simd8& other) const { return { this->chunks[0] & other, this->chunks[1] & other, this->chunks[2] & other, this->chunks[3] & other }; } simdjson_inline simd8x64 operator|(const simd8x64& other) const { return { this->chunks[0] | other.chunks[0], this->chunks[1] | other.chunks[1], this->chunks[2] | other.chunks[2], this->chunks[3] | other.chunks[3] }; } simdjson_inline simd8x64 operator|(const simd8& other) const { return { this->chunks[0] | other, this->chunks[1] | other, this->chunks[2] | other, this->chunks[3] | other }; } simdjson_inline simd8x64 operator^(const simd8x64& other) const { return { this->chunks[0] ^ other.chunks[0], this->chunks[1] ^ other.chunks[1], this->chunks[2] ^ other.chunks[2], this->chunks[3] ^ other.chunks[3] }; } simdjson_inline simd8x64 operator^(const simd8& other) const { return { this->chunks[0] ^ other, this->chunks[1] ^ other, this->chunks[2] ^ other, this->chunks[3] ^ other }; } simdjson_inline simd8x64 bit_andnot(const simd8x64& other) const { return { this->chunks[0].bit_andnot(other.chunks[0]), this->chunks[1].bit_andnot(other.chunks[1]), this->chunks[2].bit_andnot(other.chunks[2]), this->chunks[3].bit_andnot(other.chunks[3]) }; } simdjson_inline simd8x64 bit_andnot(const simd8& other) const { return { this->chunks[0].bit_andnot(other), this->chunks[1].bit_andnot(other), this->chunks[2].bit_andnot(other), this->chunks[3].bit_andnot(other) }; } template simdjson_inline simd8x64 shr() const noexcept { return { this->chunks[0].template shr(), this->chunks[1].template shr(), this->chunks[2].template shr(), this->chunks[3].template shr() }; } template simdjson_inline simd8x64 shl() const noexcept { return { this->chunks[0].template shl(), this->chunks[1].template shl(), this->chunks[2].template shl(), this->chunks[3].template shl() }; } simdjson_inline simd8x64 any_bits_set(const simd8& bits) const { return { this->chunks[0].any_bits_set(bits), this->chunks[1].any_bits_set(bits), this->chunks[2].any_bits_set(bits), this->chunks[3].any_bits_set(bits) }; } simdjson_inline simd8x64 any_bits_set(const simd8x64& bits) const { return { this->chunks[0].any_bits_set(bits.chunks[0]), this->chunks[1].any_bits_set(bits.chunks[1]), this->chunks[2].any_bits_set(bits.chunks[2]), this->chunks[3].any_bits_set(bits.chunks[3]) }; } simdjson_inline simd8x64 no_bits_set(const simd8& bits) const { return { this->chunks[0].no_bits_set(bits), this->chunks[1].no_bits_set(bits), this->chunks[2].no_bits_set(bits), this->chunks[3].no_bits_set(bits) }; } simdjson_inline simd8x64 no_bits_set(const simd8x64& bits) const { return { this->chunks[0].no_bits_set(bits.chunks[0]), this->chunks[1].no_bits_set(bits.chunks[1]), this->chunks[2].no_bits_set(bits.chunks[2]), this->chunks[3].no_bits_set(bits.chunks[3]) }; } }; // struct simd8x64 } // namespace simd } // namespace westmere } // namespace simdjson #endif // SIMDJSON_WESTMERE_SIMD_INPUT_H