#include "simdjson.h" #include "haswell/implementation.h" #include "haswell/dom_parser_implementation.h" // // Stage 1 // #include "haswell/bitmask.h" #include "haswell/simd.h" #include "haswell/bitmanipulation.h" TARGET_HASWELL namespace simdjson { namespace haswell { using namespace simd; struct json_character_block { static really_inline json_character_block classify(const simd::simd8x64 in); really_inline uint64_t whitespace() const { return _whitespace; } really_inline uint64_t op() const { return _op; } really_inline uint64_t scalar() { return ~(op() | whitespace()); } uint64_t _whitespace; uint64_t _op; }; really_inline json_character_block json_character_block::classify(const simd::simd8x64 in) { // These lookups rely on the fact that anything < 127 will match the lower 4 bits, which is why // we can't use the generic lookup_16. auto whitespace_table = simd8::repeat_16(' ', 100, 100, 100, 17, 100, 113, 2, 100, '\t', '\n', 112, 100, '\r', 100, 100); auto op_table = simd8::repeat_16(',', '}', 0, 0, 0xc0u, 0, 0, 0, 0, 0, 0, 0, 0, 0, ':', '{'); // We compute whitespace and op separately. If the code later only use one or the // other, given the fact that all functions are aggressively inlined, we can // hope that useless computations will be omitted. This is namely case when // minifying (we only need whitespace). uint64_t whitespace = in.map([&](simd8 _in) { return _in == simd8(_mm256_shuffle_epi8(whitespace_table, _in)); }).to_bitmask(); uint64_t op = in.map([&](simd8 _in) { // | 32 handles the fact that { } and [ ] are exactly 32 bytes apart return (_in | 32) == simd8(_mm256_shuffle_epi8(op_table, _in-',')); }).to_bitmask(); return { whitespace, op }; } really_inline bool is_ascii(simd8x64 input) { simd8 bits = input.reduce([&](simd8 a,simd8 b) { return a|b; }); return !bits.any_bits_set_anywhere(0b10000000u); } really_inline simd8 must_be_continuation(simd8 prev1, simd8 prev2, simd8 prev3) { simd8 is_second_byte = prev1.saturating_sub(0b11000000u-1); // Only 11______ will be > 0 simd8 is_third_byte = prev2.saturating_sub(0b11100000u-1); // Only 111_____ will be > 0 simd8 is_fourth_byte = prev3.saturating_sub(0b11110000u-1); // Only 1111____ will be > 0 // Caller requires a bool (all 1's). All values resulting from the subtraction will be <= 64, so signed comparison is fine. return simd8(is_second_byte | is_third_byte | is_fourth_byte) > int8_t(0); } #include "generic/stage1/buf_block_reader.h" #include "generic/stage1/json_string_scanner.h" #include "generic/stage1/json_scanner.h" #include "generic/stage1/json_minifier.h" WARN_UNUSED error_code implementation::minify(const uint8_t *buf, size_t len, uint8_t *dst, size_t &dst_len) const noexcept { return haswell::stage1::json_minifier::minify<128>(buf, len, dst, dst_len); } #include "generic/stage1/utf8_lookup2_algorithm.h" #include "generic/stage1/json_structural_indexer.h" WARN_UNUSED error_code dom_parser_implementation::stage1(const uint8_t *_buf, size_t _len, bool streaming) noexcept { this->buf = _buf; this->len = _len; return haswell::stage1::json_structural_indexer::index<128>(_buf, _len, *this, streaming); } } // namespace haswell } // namespace simdjson UNTARGET_REGION // // Stage 2 // #include "haswell/stringparsing.h" #include "haswell/numberparsing.h" TARGET_HASWELL namespace simdjson { namespace haswell { #include "generic/stage2/logger.h" #include "generic/stage2/atomparsing.h" #include "generic/stage2/structural_iterator.h" #include "generic/stage2/structural_parser.h" #include "generic/stage2/streaming_structural_parser.h" WARN_UNUSED error_code dom_parser_implementation::parse(const uint8_t *_buf, size_t _len, dom::document &_doc) noexcept { error_code err = stage1(_buf, _len, false); if (err) { return err; } return stage2(_doc); } } // namespace haswell } // namespace simdjson UNTARGET_REGION