From 4700500920e7ad05a174b98d1e6bb36a0e6548ce Mon Sep 17 00:00:00 2001 From: Dmitry Arkhipov Date: Mon, 29 May 2023 15:38:05 +0300 Subject: [PATCH] use Charconv for precise parsing --- CMakeLists.txt | 3 + build/Jamfile | 2 + include/boost/json/basic_parser_impl.hpp | 15 +- .../json/detail/charconv/chars_format.hpp | 22 + .../charconv/detail/compute_float64.hpp | 201 +++++ .../json/detail/charconv/detail/config.hpp | 59 ++ .../detail/charconv/detail/emulated128.hpp | 187 +++++ .../detail/fast_float/ascii_number.hpp | 283 +++++++ .../charconv/detail/fast_float/bigint.hpp | 623 +++++++++++++++ .../fast_float/constexpr_feature_detect.hpp | 34 + .../detail/fast_float/decimal_to_binary.hpp | 196 +++++ .../detail/fast_float/digit_comparison.hpp | 442 +++++++++++ .../charconv/detail/fast_float/fast_float.hpp | 48 ++ .../charconv/detail/fast_float/fast_table.hpp | 708 ++++++++++++++++++ .../detail/fast_float/float_common.hpp | 560 ++++++++++++++ .../detail/fast_float/parse_number.hpp | 237 ++++++ .../charconv/detail/from_chars_float_impl.hpp | 172 +++++ .../detail/from_chars_integer_impl.hpp | 252 +++++++ .../charconv/detail/from_chars_result.hpp | 39 + .../charconv/detail/integer_search_trees.hpp | 240 ++++++ .../json/detail/charconv/detail/parser.hpp | 378 ++++++++++ .../charconv/detail/significand_tables.hpp | 667 +++++++++++++++++ .../boost/json/detail/charconv/from_chars.hpp | 33 + .../json/detail/charconv/impl/from_chars.ipp | 47 ++ include/boost/json/detail/charconv/limits.hpp | 86 +++ include/boost/json/src.hpp | 1 + test/Jamfile | 6 +- test/limits.cpp | 17 +- 28 files changed, 5548 insertions(+), 10 deletions(-) create mode 100644 include/boost/json/detail/charconv/chars_format.hpp create mode 100644 include/boost/json/detail/charconv/detail/compute_float64.hpp create mode 100644 include/boost/json/detail/charconv/detail/config.hpp create mode 100644 include/boost/json/detail/charconv/detail/emulated128.hpp create mode 100644 include/boost/json/detail/charconv/detail/fast_float/ascii_number.hpp create mode 100644 include/boost/json/detail/charconv/detail/fast_float/bigint.hpp create mode 100644 include/boost/json/detail/charconv/detail/fast_float/constexpr_feature_detect.hpp create mode 100644 include/boost/json/detail/charconv/detail/fast_float/decimal_to_binary.hpp create mode 100644 include/boost/json/detail/charconv/detail/fast_float/digit_comparison.hpp create mode 100644 include/boost/json/detail/charconv/detail/fast_float/fast_float.hpp create mode 100644 include/boost/json/detail/charconv/detail/fast_float/fast_table.hpp create mode 100644 include/boost/json/detail/charconv/detail/fast_float/float_common.hpp create mode 100644 include/boost/json/detail/charconv/detail/fast_float/parse_number.hpp create mode 100644 include/boost/json/detail/charconv/detail/from_chars_float_impl.hpp create mode 100644 include/boost/json/detail/charconv/detail/from_chars_integer_impl.hpp create mode 100644 include/boost/json/detail/charconv/detail/from_chars_result.hpp create mode 100644 include/boost/json/detail/charconv/detail/integer_search_trees.hpp create mode 100644 include/boost/json/detail/charconv/detail/parser.hpp create mode 100644 include/boost/json/detail/charconv/detail/significand_tables.hpp create mode 100644 include/boost/json/detail/charconv/from_chars.hpp create mode 100644 include/boost/json/detail/charconv/impl/from_chars.ipp create mode 100644 include/boost/json/detail/charconv/limits.hpp diff --git a/CMakeLists.txt b/CMakeLists.txt index 6883bbb7..5c4209bc 100644 --- a/CMakeLists.txt +++ b/CMakeLists.txt @@ -53,6 +53,9 @@ endif() function(boost_json_setup_properties target) + if(MSVC) + target_compile_features(${target} PRIVATE _SCL_SECURE_NO_WARNINGS) + endif() target_compile_features(${target} PUBLIC cxx_constexpr) target_compile_definitions(${target} PUBLIC BOOST_JSON_NO_LIB=1) diff --git a/build/Jamfile b/build/Jamfile index d591a9bb..3eb4d55d 100644 --- a/build/Jamfile +++ b/build/Jamfile @@ -69,9 +69,11 @@ project boost/json shared:BOOST_JSON_DYN_LINK=1 static:BOOST_JSON_STATIC_LINK=1 BOOST_JSON_SOURCE + msvc:_SCL_SECURE_NO_WARNINGS : usage-requirements shared:BOOST_JSON_DYN_LINK=1 static:BOOST_JSON_STATIC_LINK=1 + msvc:_SCL_SECURE_NO_WARNINGS : source-location ../src ; diff --git a/include/boost/json/basic_parser_impl.hpp b/include/boost/json/basic_parser_impl.hpp index b708f595..d3f165e6 100644 --- a/include/boost/json/basic_parser_impl.hpp +++ b/include/boost/json/basic_parser_impl.hpp @@ -15,6 +15,7 @@ #include #include #include +#include #include #include #include @@ -2677,16 +2678,20 @@ finish_dub: if( precise_parsing ) { char const* data = begin; + std::size_t full_size = size; // if we previously suspended or if the current input ends with the // number, we need to copy the current part of the number to the // temporary buffer - if(BOOST_JSON_UNLIKELY( num_buf_.size() || !cs )) + if(BOOST_JSON_UNLIKELY( num_buf_.size() )) { - num_buf_.grow( size + 1 ); - num_buf_.append( begin, size ); - data = num_buf_.append( "\0", 1 ); + data = num_buf_.append( begin, size ); + full_size = num_buf_.size(); } - d = std::strtod( data, nullptr ); + auto const err = detail::charconv::from_chars( + data, data + full_size, d ); + BOOST_ASSERT( err.ec != std::errc::invalid_argument ); + BOOST_ASSERT( err.ptr == data + full_size ); + (void)err; } else d = detail::dec_to_float( diff --git a/include/boost/json/detail/charconv/chars_format.hpp b/include/boost/json/detail/charconv/chars_format.hpp new file mode 100644 index 00000000..e59f99df --- /dev/null +++ b/include/boost/json/detail/charconv/chars_format.hpp @@ -0,0 +1,22 @@ +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt + +#ifndef BOOST_JSON_DETAIL_CHARCONV_CHARS_FORMAT_HPP +#define BOOST_JSON_DETAIL_CHARCONV_CHARS_FORMAT_HPP + +namespace boost { namespace json { namespace detail { namespace charconv { + +// Floating-point format for primitive numerical conversion +// chars_format is a bitmask type (16.3.3.3.3) +enum class chars_format : unsigned +{ + scientific = 1 << 0, + fixed = 1 << 1, + hex = 1 << 2, + general = fixed | scientific +}; + +}}}} // Namespaces + +#endif // BOOST_JSON_DETAIL_CHARCONV_CHARS_FORMAT_HPP diff --git a/include/boost/json/detail/charconv/detail/compute_float64.hpp b/include/boost/json/detail/charconv/detail/compute_float64.hpp new file mode 100644 index 00000000..3df9dc2b --- /dev/null +++ b/include/boost/json/detail/charconv/detail/compute_float64.hpp @@ -0,0 +1,201 @@ +// Copyright 2020-2023 Daniel Lemire +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_COMPUTE_FLOAT64_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_COMPUTE_FLOAT64_HPP + +#include +#include +#include +#include +#include +#include +#include +#include + +namespace boost { namespace json { namespace detail { namespace charconv { namespace detail { + +static constexpr double powers_of_ten[] = { + 1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, + 1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19, 1e20, 1e21, 1e22 +}; + +// Attempts to compute i * 10^(power) exactly; and if "negative" is true, negate the result. +// +// This function will only work in some cases, when it does not work, success is +// set to false. This should work *most of the time* (like 99% of the time). +// We assume that power is in the [-325, 308] interval. +inline double compute_float64(std::int64_t power, std::uint64_t i, bool negative, bool& success) noexcept +{ + static constexpr auto smallest_power = -325; + static constexpr auto largest_power = 308; + + // We start with a fast path + // It was described in Clinger WD. + // How to read floating point numbers accurately. + // ACM SIGPLAN Notices. 1990 +#if (FLT_EVAL_METHOD != 1) && (FLT_EVAL_METHOD != 0) + if (0 <= power && power <= 22 && i <= UINT64_C(9007199254740991)) +#else + if (-22 <= power && power <= 22 && i <= UINT64_C(9007199254740991)) +#endif + { + // The general idea is as follows. + // If 0 <= s < 2^53 and if 10^0 <= p <= 10^22 then + // 1) Both s and p can be represented exactly as 64-bit floating-point + // values + // (binary64). + // 2) Because s and p can be represented exactly as floating-point values, + // then s * p + // and s / p will produce correctly rounded values. + + auto d = static_cast(i); + + if (power < 0) + { + d = d / powers_of_ten[-power]; + } + else + { + d = d * powers_of_ten[power]; + } + + if (negative) + { + d = -d; + } + + success = true; + return d; + } + + // When 22 < power && power < 22 + 16, we could + // hope for another, secondary fast path. It was + // described by David M. Gay in "Correctly rounded + // binary-decimal and decimal-binary conversions." (1990) + // If you need to compute i * 10^(22 + x) for x < 16, + // first compute i * 10^x, if you know that result is exact + // (e.g., when i * 10^x < 2^53), + // then you can still proceed and do (i * 10^x) * 10^22. + // Is this worth your time? + // You need 22 < power *and* power < 22 + 16 *and* (i * 10^(x-22) < 2^53) + // for this second fast path to work. + // If you have 22 < power *and* power < 22 + 16, and then you + // optimistically compute "i * 10^(x-22)", there is still a chance that you + // have wasted your time if i * 10^(x-22) >= 2^53. It makes the use cases of + // this optimization maybe less common than we would like. Source: + // http://www.exploringbinary.com/fast-path-decimal-to-floating-point-conversion/ + // also used in RapidJSON: https://rapidjson.org/strtod_8h_source.html + + if (i == 0 || power < smallest_power) + { + return negative ? -0.0 : 0.0; + } + else if (power > largest_power) + { + return negative ? -HUGE_VAL : HUGE_VAL; + } + + const std::uint64_t factor_significand = significand_64[power - smallest_power]; + const std::int64_t exponent = (((152170 + 65536) * power) >> 16) + 1024 + 63; + int leading_zeros = boost::core::countl_zero(i); + i <<= static_cast(leading_zeros); + + uint128 product = umul128(i, factor_significand); + std::uint64_t low = product.low; + std::uint64_t high = product.high; + + // We know that upper has at most one leading zero because + // both i and factor_mantissa have a leading one. This means + // that the result is at least as large as ((1<<63)*(1<<63))/(1<<64). + // + // As long as the first 9 bits of "upper" are not "1", then we + // know that we have an exact computed value for the leading + // 55 bits because any imprecision would play out as a +1, in the worst case. + // Having 55 bits is necessary because we need 53 bits for the mantissa, + // but we have to have one rounding bit and, we can waste a bit if the most + // significant bit of the product is zero. + // + // We expect this next branch to be rarely taken (say 1% of the time). + // When (upper & 0x1FF) == 0x1FF, it can be common for + // lower + i < lower to be true (proba. much higher than 1%). + if (BOOST_UNLIKELY((high & 0x1FF) == 0x1FF) && (low + i < low)) + { + const std::uint64_t factor_significand_low = significand_128[power - smallest_power]; + product = umul128(i, factor_significand_low); + //const std::uint64_t product_low = product.low; + const std::uint64_t product_middle2 = product.high; + const std::uint64_t product_middle1 = low; + std::uint64_t product_high = high; + const std::uint64_t product_middle = product_middle1 + product_middle2; + + if (product_middle < product_middle1) + { + product_high++; + } + + // Commented out because possibly unneeded + // See: https://arxiv.org/pdf/2212.06644.pdf + /* + // we want to check whether mantissa *i + i would affect our result + // This does happen, e.g. with 7.3177701707893310e+15 + if (((product_middle + 1 == 0) && ((product_high & 0x1FF) == 0x1FF) && (product_low + i < product_low))) + { + success = false; + return 0; + } + */ + + low = product_middle; + high = product_high; + } + + // The final significand should be 53 bits with a leading 1 + // We shift it so that it occupies 54 bits with a leading 1 + const std::uint64_t upper_bit = high >> 63; + std::uint64_t significand = high >> (upper_bit + 9); + leading_zeros += static_cast(1 ^ upper_bit); + + // If we have lots of trailing zeros we may fall between two values + if (BOOST_UNLIKELY((low == 0) && ((high & 0x1FF) == 0) && ((significand & 3) == 1))) + { + // if significand & 1 == 1 we might need to round up + success = false; + return 0; + } + + significand += significand & 1; + significand >>= 1; + + // Here the significand < (1<<53), unless there is an overflow + if (significand >= (UINT64_C(1) << 53)) + { + significand = (UINT64_C(1) << 52); + leading_zeros--; + } + + significand &= ~(UINT64_C(1) << 52); + const std::uint64_t real_exponent = exponent - leading_zeros; + + // We have to check that real_exponent is in range, otherwise fail + if (BOOST_UNLIKELY((real_exponent < 1) || (real_exponent > 2046))) + { + success = false; + return 0; + } + + significand |= real_exponent << 52; + significand |= ((static_cast(negative) << 63)); + + double d; + std::memcpy(&d, &significand, sizeof(d)); + + success = true; + return d; +} + +}}}}} // Namespaces + +#endif // BOOST_JSON_DETAIL_CHARCONV_DETAIL_COMPUTE_FLOAT64_HPP diff --git a/include/boost/json/detail/charconv/detail/config.hpp b/include/boost/json/detail/charconv/detail/config.hpp new file mode 100644 index 00000000..8413186e --- /dev/null +++ b/include/boost/json/detail/charconv/detail/config.hpp @@ -0,0 +1,59 @@ +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_CONFIG_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_CONFIG_HPP + +#include +#include +#include + +// Use 128 bit integers and supress warnings for using extensions +#if defined(BOOST_HAS_INT128) +# define BOOST_JSON_INT128_MAX (boost::int128_type)(((boost::uint128_type) 1 << 127) - 1) +# define BOOST_JSON_UINT128_MAX ((2 * (boost::uint128_type) BOOST_JSON_INT128_MAX) + 1) +#endif + +#ifndef BOOST_NO_CXX14_CONSTEXPR +# define BOOST_JSON_CXX14_CONSTEXPR BOOST_CXX14_CONSTEXPR +# define BOOST_JSON_CXX14_CONSTEXPR_NO_INLINE BOOST_CXX14_CONSTEXPR +#else +# define BOOST_JSON_CXX14_CONSTEXPR inline +# define BOOST_JSON_CXX14_CONSTEXPR_NO_INLINE +#endif + +#if defined(__GNUC__) && __GNUC__ == 5 +# define BOOST_JSON_GCC5_CONSTEXPR inline +#else +# define BOOST_JSON_GCC5_CONSTEXPR BOOST_JSON_CXX14_CONSTEXPR +#endif + +// Inclue intrinsics if available +#if defined(BOOST_MSVC) +# include +# if defined(_WIN64) +# define BOOST_JSON_HAS_MSVC_64BIT_INTRINSICS +# else +# define BOOST_JSON_HAS_MSVC_32BIT_INTRINSICS +# endif +#endif + +// Suppress additional buffer overrun check. +// I have no idea why MSVC thinks some functions here are vulnerable to the buffer overrun +// attacks. No, they aren't. +#if defined(__GNUC__) || defined(__clang__) + #define BOOST_JSON_SAFEBUFFERS +#elif defined(_MSC_VER) + #define BOOST_JSON_SAFEBUFFERS __declspec(safebuffers) +#else + #define BOOST_JSON_SAFEBUFFERS +#endif + +#if defined(__has_builtin) + #define BOOST_JSON_HAS_BUILTIN(x) __has_builtin(x) +#else + #define BOOST_JSON_HAS_BUILTIN(x) false +#endif + +#endif // BOOST_JSON_DETAIL_CHARCONV_DETAIL_CONFIG_HPP diff --git a/include/boost/json/detail/charconv/detail/emulated128.hpp b/include/boost/json/detail/charconv/detail/emulated128.hpp new file mode 100644 index 00000000..5156313a --- /dev/null +++ b/include/boost/json/detail/charconv/detail/emulated128.hpp @@ -0,0 +1,187 @@ +// Copyright 2020-2023 Daniel Lemire +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt + +// If the architecture (e.g. ARM) does not have __int128 we need to emulate it + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_EMULATED128_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_EMULATED128_HPP + +#include +#include +#include + +namespace boost { namespace json { namespace detail { namespace charconv { namespace detail { + +// Compilers might support built-in 128-bit integer types. However, it seems that +// emulating them with a pair of 64-bit integers actually produces a better code, +// so we avoid using those built-ins. That said, they are still useful for +// implementing 64-bit x 64-bit -> 128-bit multiplication. + +struct uint128 +{ + std::uint64_t high; + std::uint64_t low; + + uint128& operator+=(std::uint64_t n) & noexcept + { + #if BOOST_JSON_HAS_BUILTIN(__builtin_addcll) + + unsigned long long carry; + low = __builtin_addcll(low, n, 0, &carry); + high = __builtin_addcll(high, 0, carry, &carry); + + #elif BOOST_JSON_HAS_BUILTIN(__builtin_ia32_addcarryx_u64) + + unsigned long long result; + auto carry = __builtin_ia32_addcarryx_u64(0, low, n, &result); + low = result; + __builtin_ia32_addcarryx_u64(carry, high, 0, &result); + high = result; + + #elif defined(BOOST_MSVC) && defined(_M_X64) + + auto carry = _addcarry_u64(0, low, n, &low); + _addcarry_u64(carry, high, 0, &high); + + #else + + auto sum = low + n; + high += (sum < low ? 1 : 0); + low = sum; + + #endif + return *this; + } +}; + +static inline std::uint64_t umul64(std::uint32_t x, std::uint32_t y) noexcept +{ +#if defined(BOOST_JSON_HAS_MSVC_32BIT_INTRINSICS) + return __emulu(x, y); +#else + return x * static_cast(y); +#endif +} + +// Get 128-bit result of multiplication of two 64-bit unsigned integers. +BOOST_JSON_SAFEBUFFERS inline uint128 umul128(std::uint64_t x, std::uint64_t y) noexcept +{ + #if defined(BOOST_HAS_INT128) + + auto result = static_cast(x) * static_cast(y); + return {static_cast(result >> 64), static_cast(result)}; + + #elif defined(BOOST_JSON_HAS_MSVC_64BIT_INTRINSICS) + + std::uint64_t high; + std::uint64_t low = _umul128(x, y, &high); + return {high, low}; + + // https://developer.arm.com/documentation/dui0802/a/A64-General-Instructions/UMULH + #elif defined(__arm__) + + std::uint64_t high = __umulh(x, y); + std::uint64_t low = x * y; + return {high, low}; + + #else + + auto a = static_cast(x >> 32); + auto b = static_cast(x); + auto c = static_cast(y >> 32); + auto d = static_cast(y); + + auto ac = umul64(a, c); + auto bc = umul64(b, c); + auto ad = umul64(a, d); + auto bd = umul64(b, d); + + auto intermediate = (bd >> 32) + static_cast(ad) + static_cast(bc); + + return {ac + (intermediate >> 32) + (ad >> 32) + (bc >> 32), + (intermediate << 32) + static_cast(bd)}; + + #endif +} + +BOOST_JSON_SAFEBUFFERS inline std::uint64_t umul128_upper64(std::uint64_t x, std::uint64_t y) noexcept +{ + #if defined(BOOST_HAS_INT128) + + auto result = static_cast(x) * static_cast(y); + return static_cast(result >> 64); + + #elif defined(BOOST_JSON_HAS_MSVC_64BIT_INTRINSICS) + + return __umulh(x, y); + + #else + + auto a = static_cast(x >> 32); + auto b = static_cast(x); + auto c = static_cast(y >> 32); + auto d = static_cast(y); + + auto ac = umul64(a, c); + auto bc = umul64(b, c); + auto ad = umul64(a, d); + auto bd = umul64(b, d); + + auto intermediate = (bd >> 32) + static_cast(ad) + static_cast(bc); + + return ac + (intermediate >> 32) + (ad >> 32) + (bc >> 32); + + #endif +} + +// Get upper 128-bits of multiplication of a 64-bit unsigned integer and a 128-bit +// unsigned integer. +BOOST_JSON_SAFEBUFFERS inline uint128 umul192_upper128(std::uint64_t x, uint128 y) noexcept +{ + auto r = umul128(x, y.high); + r += umul128_upper64(x, y.low); + return r; +} + +// Get upper 64-bits of multiplication of a 32-bit unsigned integer and a 64-bit +// unsigned integer. +inline std::uint64_t umul96_upper64(std::uint32_t x, std::uint64_t y) noexcept +{ + #if defined(BOOST_HAS_INT128) || defined(BOOST_JSON_HAS_MSVC_64BIT_INTRINSICS) + + return umul128_upper64(static_cast(x) << 32, y); + + #else + + auto yh = static_cast(y >> 32); + auto yl = static_cast(y); + + auto xyh = umul64(x, yh); + auto xyl = umul64(x, yl); + + return xyh + (xyl >> 32); + + #endif +} + +// Get lower 128-bits of multiplication of a 64-bit unsigned integer and a 128-bit +// unsigned integer. +BOOST_JSON_SAFEBUFFERS inline uint128 umul192_lower128(std::uint64_t x, uint128 y) noexcept +{ + auto high = x * y.high; + auto highlow = umul128(x, y.low); + return {high + highlow.high, highlow.low}; +} + +// Get lower 64-bits of multiplication of a 32-bit unsigned integer and a 64-bit +// unsigned integer. +inline std::uint64_t umul96_lower64(std::uint32_t x, std::uint64_t y) noexcept +{ + return x * y; +} + +}}}}} // Namespaces + +#endif // BOOST_JSON_DETAIL_CHARCONV_DETAIL_EMULATED128_HPP diff --git a/include/boost/json/detail/charconv/detail/fast_float/ascii_number.hpp b/include/boost/json/detail/charconv/detail/fast_float/ascii_number.hpp new file mode 100644 index 00000000..bec6402d --- /dev/null +++ b/include/boost/json/detail/charconv/detail/fast_float/ascii_number.hpp @@ -0,0 +1,283 @@ +// Copyright 2020-2023 Daniel Lemire +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt +// +// Derivative of: https://github.com/fastfloat/fast_float + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_ASCII_NUMBER_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_ASCII_NUMBER_HPP + +#include +#include +#include +#include +#include + +namespace boost { namespace json { namespace detail { namespace charconv { namespace detail { namespace fast_float { + +// Next function can be micro-optimized, but compilers are entirely +// able to optimize it well. +template +BOOST_FORCEINLINE constexpr bool is_integer(UC c) noexcept { + return !(c > UC('9') || c < UC('0')); +} + +BOOST_FORCEINLINE constexpr uint64_t byteswap(uint64_t val) { + return (val & 0xFF00000000000000) >> 56 + | (val & 0x00FF000000000000) >> 40 + | (val & 0x0000FF0000000000) >> 24 + | (val & 0x000000FF00000000) >> 8 + | (val & 0x00000000FF000000) << 8 + | (val & 0x0000000000FF0000) << 24 + | (val & 0x000000000000FF00) << 40 + | (val & 0x00000000000000FF) << 56; +} + +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +uint64_t read_u64(const char *chars) { + if (cpp20_and_in_constexpr()) { + uint64_t val = 0; + for(int i = 0; i < 8; ++i) { + val |= uint64_t(*chars) << (i*8); + ++chars; + } + return val; + } + uint64_t val; + ::memcpy(&val, chars, sizeof(uint64_t)); +#ifdef BOOST_JSON_BIG_ENDIAN + // Need to read as-if the number was in little-endian order. + val = byteswap(val); +#endif + return val; +} + +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +void write_u64(uint8_t *chars, uint64_t val) { + if (cpp20_and_in_constexpr()) { + for(int i = 0; i < 8; ++i) { + *chars = uint8_t(val); + val >>= 8; + ++chars; + } + return; + } +#ifdef BOOST_JSON_BIG_ENDIAN + // Need to read as-if the number was in little-endian order. + val = byteswap(val); +#endif + ::memcpy(chars, &val, sizeof(uint64_t)); +} + +// credit @aqrit +BOOST_FORCEINLINE BOOST_JSON_CXX14_CONSTEXPR_NO_INLINE +uint32_t parse_eight_digits_unrolled(uint64_t val) { + constexpr uint64_t mask = 0x000000FF000000FF; + constexpr uint64_t mul1 = 0x000F424000000064; // 100 + (1000000ULL << 32) + constexpr uint64_t mul2 = 0x0000271000000001; // 1 + (10000ULL << 32) + val -= 0x3030303030303030; + val = (val * 10) + (val >> 8); // val = (val * 2561) >> 8; + val = (((val & mask) * mul1) + (((val >> 16) & mask) * mul2)) >> 32; + return uint32_t(val); +} + +BOOST_FORCEINLINE constexpr +uint32_t parse_eight_digits_unrolled(const char16_t *) noexcept { + return 0; +} + +BOOST_FORCEINLINE constexpr +uint32_t parse_eight_digits_unrolled(const char32_t *) noexcept { + return 0; +} + +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +uint32_t parse_eight_digits_unrolled(const char *chars) noexcept { + return parse_eight_digits_unrolled(read_u64(chars)); +} + +// credit @aqrit +BOOST_FORCEINLINE constexpr bool is_made_of_eight_digits_fast(uint64_t val) noexcept { + return !((((val + 0x4646464646464646) | (val - 0x3030303030303030)) & 0x8080808080808080)); +} + +BOOST_FORCEINLINE constexpr +bool is_made_of_eight_digits_fast(const char16_t *) noexcept { + return false; +} + +BOOST_FORCEINLINE constexpr +bool is_made_of_eight_digits_fast(const char32_t *) noexcept { + return false; +} + +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +bool is_made_of_eight_digits_fast(const char *chars) noexcept { + return is_made_of_eight_digits_fast(read_u64(chars)); +} + +template +struct parsed_number_string_t { + int64_t exponent{0}; + uint64_t mantissa{0}; + UC const * lastmatch{nullptr}; + bool negative{false}; + bool valid{false}; + bool too_many_digits{false}; + // contains the range of the significant digits + span integer{}; // non-nullable + span fraction{}; // nullable +}; +using byte_span = span; +using parsed_number_string = parsed_number_string_t; +// Assuming that you use no more than 19 digits, this will +// parse an ASCII string. +template +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +parsed_number_string_t parse_number_string(UC const *p, UC const * pend, parse_options_t options) noexcept { + chars_format const fmt = options.format; + UC const decimal_point = options.decimal_point; + + parsed_number_string_t answer; + answer.valid = false; + answer.too_many_digits = false; + answer.negative = (*p == UC('-')); + if (*p == UC('-')) // C++17 20.19.3.(7.1) explicitly forbids '+' sign here + { + ++p; + if (p == pend) { + return answer; + } + if (!is_integer(*p) && (*p != decimal_point)) { // a sign must be followed by an integer or the dot + return answer; + } + } + UC const * const start_digits = p; + + uint64_t i = 0; // an unsigned int avoids signed overflows (which are bad) + + while ((p != pend) && is_integer(*p)) { + // a multiplication by 10 is cheaper than an arbitrary integer + // multiplication + i = 10 * i + + uint64_t(*p - UC('0')); // might overflow, we will handle the overflow later + ++p; + } + UC const * const end_of_integer_part = p; + int64_t digit_count = int64_t(end_of_integer_part - start_digits); + answer.integer = span(start_digits, size_t(digit_count)); + int64_t exponent = 0; + if ((p != pend) && (*p == decimal_point)) { + ++p; + UC const * before = p; + // can occur at most twice without overflowing, but let it occur more, since + // for integers with many digits, digit parsing is the primary bottleneck. + if (std::is_same::value) { + while ((std::distance(p, pend) >= 8) && is_made_of_eight_digits_fast(p)) { + i = i * 100000000 + parse_eight_digits_unrolled(p); // in rare cases, this will overflow, but that's ok + p += 8; + } + } + while ((p != pend) && is_integer(*p)) { + uint8_t digit = uint8_t(*p - UC('0')); + ++p; + i = i * 10 + digit; // in rare cases, this will overflow, but that's ok + } + exponent = before - p; + answer.fraction = span(before, size_t(p - before)); + digit_count -= exponent; + } + // we must have encountered at least one integer! + if (digit_count == 0) { + return answer; + } + int64_t exp_number = 0; // explicit exponential part + if (((unsigned)fmt & (unsigned)chars_format::scientific) && (p != pend) && ((UC('e') == *p) || (UC('E') == *p))) { + UC const * location_of_e = p; + ++p; + bool neg_exp = false; + if ((p != pend) && (UC('-') == *p)) { + neg_exp = true; + ++p; + } else if ((p != pend) && (UC('+') == *p)) { // '+' on exponent is allowed by C++17 20.19.3.(7.1) + ++p; + } + if ((p == pend) || !is_integer(*p)) { + if(!((unsigned)fmt & (unsigned)chars_format::fixed)) { + // We are in error. + return answer; + } + // Otherwise, we will be ignoring the 'e'. + p = location_of_e; + } else { + while ((p != pend) && is_integer(*p)) { + uint8_t digit = uint8_t(*p - UC('0')); + if (exp_number < 0x10000000) { + exp_number = 10 * exp_number + digit; + } + ++p; + } + if(neg_exp) { exp_number = - exp_number; } + exponent += exp_number; + } + } else { + // If it scientific and not fixed, we have to bail out. + if(((unsigned)fmt & (unsigned)chars_format::scientific) && !((unsigned)fmt & (unsigned)chars_format::fixed)) + { + return answer; + } + } + answer.lastmatch = p; + answer.valid = true; + + // If we frequently had to deal with long strings of digits, + // we could extend our code by using a 128-bit integer instead + // of a 64-bit integer. However, this is uncommon. + // + // We can deal with up to 19 digits. + if (digit_count > 19) { // this is uncommon + // It is possible that the integer had an overflow. + // We have to handle the case where we have 0.0000somenumber. + // We need to be mindful of the case where we only have zeroes... + // E.g., 0.000000000...000. + UC const * start = start_digits; + while ((start != pend) && (*start == UC('0') || *start == decimal_point)) { + if(*start == UC('0')) { digit_count --; } + start++; + } + if (digit_count > 19) { + answer.too_many_digits = true; + // Let us start again, this time, avoiding overflows. + // We don't need to check if is_integer, since we use the + // pre-tokenized spans from above. + i = 0; + p = answer.integer.ptr; + UC const * int_end = p + answer.integer.len(); + constexpr uint64_t minimal_nineteen_digit_integer{1000000000000000000}; + while((i < minimal_nineteen_digit_integer) && (p != int_end)) { + i = i * 10 + uint64_t(*p - UC('0')); + ++p; + } + if (i >= minimal_nineteen_digit_integer) { // We have a big integers + exponent = end_of_integer_part - p + exp_number; + } else { // We have a value with a fractional component. + p = answer.fraction.ptr; + UC const * frac_end = p + answer.fraction.len(); + while((i < minimal_nineteen_digit_integer) && (p != frac_end)) { + i = i * 10 + uint64_t(*p - UC('0')); + ++p; + } + exponent = answer.fraction.ptr - p + exp_number; + } + // We have now corrected both exponent and i, to a truncated value + } + } + answer.exponent = exponent; + answer.mantissa = i; + return answer; +} + +}}}}}} // namespace s + +#endif diff --git a/include/boost/json/detail/charconv/detail/fast_float/bigint.hpp b/include/boost/json/detail/charconv/detail/fast_float/bigint.hpp new file mode 100644 index 00000000..fc294813 --- /dev/null +++ b/include/boost/json/detail/charconv/detail/fast_float/bigint.hpp @@ -0,0 +1,623 @@ +// Copyright 2020-2023 Daniel Lemire +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt +// +// Derivative of: https://github.com/fastfloat/fast_float + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_BIGINT_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_BIGINT_HPP + +#include +#include +#include +#include +#include + +namespace boost { namespace json { namespace detail { namespace charconv { namespace detail { namespace fast_float { + +// the limb width: we want efficient multiplication of double the bits in +// limb, or for 64-bit limbs, at least 64-bit multiplication where we can +// extract the high and low parts efficiently. this is every 64-bit +// architecture except for sparc, which emulates 128-bit multiplication. +// we might have platforms where `CHAR_BIT` is not 8, so let's avoid +// doing `8 * sizeof(limb)`. +#if defined(BOOST_JSON_FASTFLOAT_64BIT) && !defined(__sparc) +#define BOOST_JSON_FASTFLOAT_64BIT_LIMB 1 +typedef uint64_t limb; +constexpr size_t limb_bits = 64; +#else +#define BOOST_JSON_FASTFLOAT_32BIT_LIMB +typedef uint32_t limb; +constexpr size_t limb_bits = 32; +#endif + +typedef span limb_span; + +// number of bits in a bigint. this needs to be at least the number +// of bits required to store the largest bigint, which is +// `log2(10**(digits + max_exp))`, or `log2(10**(767 + 342))`, or +// ~3600 bits, so we round to 4000. +constexpr size_t bigint_bits = 4000; +constexpr size_t bigint_limbs = bigint_bits / limb_bits; + +// vector-like type that is allocated on the stack. the entire +// buffer is pre-allocated, and only the length changes. +template +struct stackvec { + limb data[size]; + // we never need more than 150 limbs + uint16_t length{0}; + + stackvec() = default; + stackvec(const stackvec &) = delete; + stackvec &operator=(const stackvec &) = delete; + stackvec(stackvec &&) = delete; + stackvec &operator=(stackvec &&other) = delete; + + // create stack vector from existing limb span. + BOOST_JSON_FASTFLOAT_CONSTEXPR20 stackvec(limb_span s) { + try_extend(s); + } + + BOOST_JSON_CXX14_CONSTEXPR limb& operator[](size_t index) noexcept { + BOOST_ASSERT(index < length); + return data[index]; + } + BOOST_JSON_CXX14_CONSTEXPR const limb& operator[](size_t index) const noexcept { + BOOST_ASSERT(index < length); + return data[index]; + } + // index from the end of the container + BOOST_JSON_CXX14_CONSTEXPR const limb& rindex(size_t index) const noexcept { + BOOST_ASSERT(index < length); + size_t rindex = length - index - 1; + return data[rindex]; + } + + // set the length, without bounds checking. + BOOST_JSON_CXX14_CONSTEXPR void set_len(size_t len) noexcept { + length = uint16_t(len); + } + constexpr size_t len() const noexcept { + return length; + } + constexpr bool is_empty() const noexcept { + return length == 0; + } + constexpr size_t capacity() const noexcept { + return size; + } + // append item to vector, without bounds checking + BOOST_JSON_CXX14_CONSTEXPR void push_unchecked(limb value) noexcept { + data[length] = value; + length++; + } + // append item to vector, returning if item was added + BOOST_JSON_CXX14_CONSTEXPR bool try_push(limb value) noexcept { + if (len() < capacity()) { + push_unchecked(value); + return true; + } else { + return false; + } + } + // add items to the vector, from a span, without bounds checking + BOOST_JSON_FASTFLOAT_CONSTEXPR20 void extend_unchecked(limb_span s) noexcept { + limb* ptr = data + length; + std::copy_n(s.ptr, s.len(), ptr); + set_len(len() + s.len()); + } + // try to add items to the vector, returning if items were added + BOOST_JSON_FASTFLOAT_CONSTEXPR20 bool try_extend(limb_span s) noexcept { + if (len() + s.len() <= capacity()) { + extend_unchecked(s); + return true; + } else { + return false; + } + } + // resize the vector, without bounds checking + // if the new size is longer than the vector, assign value to each + // appended item. + BOOST_JSON_FASTFLOAT_CONSTEXPR20 + void resize_unchecked(size_t new_len, limb value) noexcept { + if (new_len > len()) { + size_t count = new_len - len(); + limb* first = data + len(); + limb* last = first + count; + ::std::fill(first, last, value); + set_len(new_len); + } else { + set_len(new_len); + } + } + // try to resize the vector, returning if the vector was resized. + BOOST_JSON_FASTFLOAT_CONSTEXPR20 bool try_resize(size_t new_len, limb value) noexcept { + if (new_len > capacity()) { + return false; + } else { + resize_unchecked(new_len, value); + return true; + } + } + // check if any limbs are non-zero after the given index. + // this needs to be done in reverse order, since the index + // is relative to the most significant limbs. + BOOST_JSON_CXX14_CONSTEXPR bool nonzero(size_t index) const noexcept { + while (index < len()) { + if (rindex(index) != 0) { + return true; + } + index++; + } + return false; + } + // normalize the big integer, so most-significant zero limbs are removed. + BOOST_JSON_CXX14_CONSTEXPR void normalize() noexcept { + while (len() > 0 && rindex(0) == 0) { + length--; + } + } +}; + +BOOST_FORCEINLINE BOOST_JSON_CXX14_CONSTEXPR_NO_INLINE +uint64_t empty_hi64(bool& truncated) noexcept { + truncated = false; + return 0; +} + +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +uint64_t uint64_hi64(uint64_t r0, bool& truncated) noexcept { + truncated = false; + int shl = leading_zeroes(r0); + return r0 << shl; +} + +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +uint64_t uint64_hi64(uint64_t r0, uint64_t r1, bool& truncated) noexcept { + int shl = leading_zeroes(r0); + if (shl == 0) { + truncated = r1 != 0; + return r0; + } else { + int shr = 64 - shl; + truncated = (r1 << shl) != 0; + return (r0 << shl) | (r1 >> shr); + } +} + +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +uint64_t uint32_hi64(uint32_t r0, bool& truncated) noexcept { + return uint64_hi64(r0, truncated); +} + +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +uint64_t uint32_hi64(uint32_t r0, uint32_t r1, bool& truncated) noexcept { + uint64_t x0 = r0; + uint64_t x1 = r1; + return uint64_hi64((x0 << 32) | x1, truncated); +} + +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +uint64_t uint32_hi64(uint32_t r0, uint32_t r1, uint32_t r2, bool& truncated) noexcept { + uint64_t x0 = r0; + uint64_t x1 = r1; + uint64_t x2 = r2; + return uint64_hi64(x0, (x1 << 32) | x2, truncated); +} + +// add two small integers, checking for overflow. +// we want an efficient operation. for msvc, where +// we don't have built-in intrinsics, this is still +// pretty fast. +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +limb scalar_add(limb x, limb y, bool& overflow) noexcept { + limb z; +// gcc and clang +#if defined(__has_builtin) + #if __has_builtin(__builtin_add_overflow) + if (!cpp20_and_in_constexpr()) { + overflow = __builtin_add_overflow(x, y, &z); + return z; + } + #endif +#endif + + // generic, this still optimizes correctly on MSVC. + z = x + y; + overflow = z < x; + return z; +} + +// multiply two small integers, getting both the high and low bits. +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +limb scalar_mul(limb x, limb y, limb& carry) noexcept { +#ifdef BOOST_JSON_FASTFLOAT_64BIT_LIMB + #if defined(__SIZEOF_INT128__) + // GCC and clang both define it as an extension. + __uint128_t z = __uint128_t(x) * __uint128_t(y) + __uint128_t(carry); + carry = limb(z >> limb_bits); + return limb(z); + #else + // fallback, no native 128-bit integer multiplication with carry. + // on msvc, this optimizes identically, somehow. + value128 z = full_multiplication(x, y); + bool overflow; + z.low = scalar_add(z.low, carry, overflow); + z.high += uint64_t(overflow); // cannot overflow + carry = z.high; + return z.low; + #endif +#else + uint64_t z = uint64_t(x) * uint64_t(y) + uint64_t(carry); + carry = limb(z >> limb_bits); + return limb(z); +#endif +} + +// add scalar value to bigint starting from offset. +// used in grade school multiplication +template +inline BOOST_JSON_FASTFLOAT_CONSTEXPR20 +bool small_add_from(stackvec& vec, limb y, size_t start) noexcept { + size_t index = start; + limb carry = y; + bool overflow; + while (carry != 0 && index < vec.len()) { + vec[index] = scalar_add(vec[index], carry, overflow); + carry = limb(overflow); + index += 1; + } + if (carry != 0) { + BOOST_JSON_FASTFLOAT_TRY(vec.try_push(carry)); + } + return true; +} + +// add scalar value to bigint. +template +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +bool small_add(stackvec& vec, limb y) noexcept { + return small_add_from(vec, y, 0); +} + +// multiply bigint by scalar value. +template +inline BOOST_JSON_FASTFLOAT_CONSTEXPR20 +bool small_mul(stackvec& vec, limb y) noexcept { + limb carry = 0; + for (size_t index = 0; index < vec.len(); index++) { + vec[index] = scalar_mul(vec[index], y, carry); + } + if (carry != 0) { + BOOST_JSON_FASTFLOAT_TRY(vec.try_push(carry)); + } + return true; +} + +// add bigint to bigint starting from index. +// used in grade school multiplication +template +BOOST_JSON_FASTFLOAT_CONSTEXPR20 +bool large_add_from(stackvec& x, limb_span y, size_t start) noexcept { + // the effective x buffer is from `xstart..x.len()`, so exit early + // if we can't get that current range. + if (x.len() < start || y.len() > x.len() - start) { + BOOST_JSON_FASTFLOAT_TRY(x.try_resize(y.len() + start, 0)); + } + + bool carry = false; + for (size_t index = 0; index < y.len(); index++) { + limb xi = x[index + start]; + limb yi = y[index]; + bool c1 = false; + bool c2 = false; + xi = scalar_add(xi, yi, c1); + if (carry) { + xi = scalar_add(xi, 1, c2); + } + x[index + start] = xi; + carry = c1 | c2; + } + + // handle overflow + if (carry) { + BOOST_JSON_FASTFLOAT_TRY(small_add_from(x, 1, y.len() + start)); + } + return true; +} + +// add bigint to bigint. +template +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +bool large_add_from(stackvec& x, limb_span y) noexcept { + return large_add_from(x, y, 0); +} + +// grade-school multiplication algorithm +template +BOOST_JSON_FASTFLOAT_CONSTEXPR20 +bool long_mul(stackvec& x, limb_span y) noexcept { + limb_span xs = limb_span(x.data, x.len()); + stackvec z(xs); + limb_span zs = limb_span(z.data, z.len()); + + if (y.len() != 0) { + limb y0 = y[0]; + BOOST_JSON_FASTFLOAT_TRY(small_mul(x, y0)); + for (size_t index = 1; index < y.len(); index++) { + limb yi = y[index]; + stackvec zi; + if (yi != 0) { + // re-use the same buffer throughout + zi.set_len(0); + BOOST_JSON_FASTFLOAT_TRY(zi.try_extend(zs)); + BOOST_JSON_FASTFLOAT_TRY(small_mul(zi, yi)); + limb_span zis = limb_span(zi.data, zi.len()); + BOOST_JSON_FASTFLOAT_TRY(large_add_from(x, zis, index)); + } + } + } + + x.normalize(); + return true; +} + +// grade-school multiplication algorithm +template +BOOST_JSON_FASTFLOAT_CONSTEXPR20 +bool large_mul(stackvec& x, limb_span y) noexcept { + if (y.len() == 1) { + BOOST_JSON_FASTFLOAT_TRY(small_mul(x, y[0])); + } else { + BOOST_JSON_FASTFLOAT_TRY(long_mul(x, y)); + } + return true; +} + +template +struct pow5_tables { + static constexpr uint32_t large_step = 135; + static constexpr uint64_t small_power_of_5[] = { + 1UL, 5UL, 25UL, 125UL, 625UL, 3125UL, 15625UL, 78125UL, 390625UL, + 1953125UL, 9765625UL, 48828125UL, 244140625UL, 1220703125UL, + 6103515625UL, 30517578125UL, 152587890625UL, 762939453125UL, + 3814697265625UL, 19073486328125UL, 95367431640625UL, 476837158203125UL, + 2384185791015625UL, 11920928955078125UL, 59604644775390625UL, + 298023223876953125UL, 1490116119384765625UL, 7450580596923828125UL, + }; +#ifdef BOOST_JSON_FASTFLOAT_64BIT_LIMB + constexpr static limb large_power_of_5[] = { + 1414648277510068013UL, 9180637584431281687UL, 4539964771860779200UL, + 10482974169319127550UL, 198276706040285095UL}; +#else + constexpr static limb large_power_of_5[] = { + 4279965485U, 329373468U, 4020270615U, 2137533757U, 4287402176U, + 1057042919U, 1071430142U, 2440757623U, 381945767U, 46164893U}; +#endif +}; + +template +constexpr uint32_t pow5_tables::large_step; + +template +constexpr uint64_t pow5_tables::small_power_of_5[]; + +template +constexpr limb pow5_tables::large_power_of_5[]; + +// big integer type. implements a small subset of big integer +// arithmetic, using simple algorithms since asymptotically +// faster algorithms are slower for a small number of limbs. +// all operations assume the big-integer is normalized. +struct bigint : pow5_tables<> { + // storage of the limbs, in little-endian order. + stackvec vec; + + BOOST_JSON_FASTFLOAT_CONSTEXPR20 bigint(): vec() {} + bigint(const bigint &) = delete; + bigint &operator=(const bigint &) = delete; + bigint(bigint &&) = delete; + bigint &operator=(bigint &&other) = delete; + + BOOST_JSON_FASTFLOAT_CONSTEXPR20 bigint(uint64_t value): vec() { +#ifdef BOOST_JSON_FASTFLOAT_64BIT_LIMB + vec.push_unchecked(value); +#else + vec.push_unchecked(uint32_t(value)); + vec.push_unchecked(uint32_t(value >> 32)); +#endif + vec.normalize(); + } + + // get the high 64 bits from the vector, and if bits were truncated. + // this is to get the significant digits for the float. + BOOST_JSON_FASTFLOAT_CONSTEXPR20 uint64_t hi64(bool& truncated) const noexcept { +#ifdef BOOST_JSON_FASTFLOAT_64BIT_LIMB + if (vec.len() == 0) { + return empty_hi64(truncated); + } else if (vec.len() == 1) { + return uint64_hi64(vec.rindex(0), truncated); + } else { + uint64_t result = uint64_hi64(vec.rindex(0), vec.rindex(1), truncated); + truncated |= vec.nonzero(2); + return result; + } +#else + if (vec.len() == 0) { + return empty_hi64(truncated); + } else if (vec.len() == 1) { + return uint32_hi64(vec.rindex(0), truncated); + } else if (vec.len() == 2) { + return uint32_hi64(vec.rindex(0), vec.rindex(1), truncated); + } else { + uint64_t result = uint32_hi64(vec.rindex(0), vec.rindex(1), vec.rindex(2), truncated); + truncated |= vec.nonzero(3); + return result; + } +#endif + } + + // compare two big integers, returning the large value. + // assumes both are normalized. if the return value is + // negative, other is larger, if the return value is + // positive, this is larger, otherwise they are equal. + // the limbs are stored in little-endian order, so we + // must compare the limbs in ever order. + BOOST_JSON_FASTFLOAT_CONSTEXPR20 int compare(const bigint& other) const noexcept { + if (vec.len() > other.vec.len()) { + return 1; + } else if (vec.len() < other.vec.len()) { + return -1; + } else { + for (size_t index = vec.len(); index > 0; index--) { + limb xi = vec[index - 1]; + limb yi = other.vec[index - 1]; + if (xi > yi) { + return 1; + } else if (xi < yi) { + return -1; + } + } + return 0; + } + } + + // shift left each limb n bits, carrying over to the new limb + // returns true if we were able to shift all the digits. + BOOST_JSON_FASTFLOAT_CONSTEXPR20 bool shl_bits(size_t n) noexcept { + // Internally, for each item, we shift left by n, and add the previous + // right shifted limb-bits. + // For example, we transform (for u8) shifted left 2, to: + // b10100100 b01000010 + // b10 b10010001 b00001000 + BOOST_ASSERT(n != 0); + BOOST_ASSERT(n < sizeof(limb) * 8); + + size_t shl = n; + size_t shr = limb_bits - shl; + limb prev = 0; + for (size_t index = 0; index < vec.len(); index++) { + limb xi = vec[index]; + vec[index] = (xi << shl) | (prev >> shr); + prev = xi; + } + + limb carry = prev >> shr; + if (carry != 0) { + return vec.try_push(carry); + } + return true; + } + + // move the limbs left by `n` limbs. + BOOST_JSON_FASTFLOAT_CONSTEXPR20 bool shl_limbs(size_t n) noexcept { + BOOST_ASSERT(n != 0); + if (n + vec.len() > vec.capacity()) { + return false; + } else if (!vec.is_empty()) { + // move limbs + limb* dst = vec.data + n; + const limb* src = vec.data; + std::copy_backward(src, src + vec.len(), dst + vec.len()); + // fill in empty limbs + limb* first = vec.data; + limb* last = first + n; + ::std::fill(first, last, 0); + vec.set_len(n + vec.len()); + return true; + } else { + return true; + } + } + + // move the limbs left by `n` bits. + BOOST_JSON_FASTFLOAT_CONSTEXPR20 bool shl(size_t n) noexcept { + size_t rem = n % limb_bits; + size_t div = n / limb_bits; + if (rem != 0) { + BOOST_JSON_FASTFLOAT_TRY(shl_bits(rem)); + } + if (div != 0) { + BOOST_JSON_FASTFLOAT_TRY(shl_limbs(div)); + } + return true; + } + + // get the number of leading zeros in the bigint. + BOOST_JSON_FASTFLOAT_CONSTEXPR20 int ctlz() const noexcept { + if (vec.is_empty()) { + return 0; + } else { +#ifdef BOOST_JSON_FASTFLOAT_64BIT_LIMB + return leading_zeroes(vec.rindex(0)); +#else + // no use defining a specialized leading_zeroes for a 32-bit type. + uint64_t r0 = vec.rindex(0); + return leading_zeroes(r0 << 32); +#endif + } + } + + // get the number of bits in the bigint. + BOOST_JSON_FASTFLOAT_CONSTEXPR20 int bit_length() const noexcept { + int lz = ctlz(); + return int(limb_bits * vec.len()) - lz; + } + + BOOST_JSON_FASTFLOAT_CONSTEXPR20 bool mul(limb y) noexcept { + return small_mul(vec, y); + } + + BOOST_JSON_FASTFLOAT_CONSTEXPR20 bool add(limb y) noexcept { + return small_add(vec, y); + } + + // multiply as if by 2 raised to a power. + BOOST_JSON_FASTFLOAT_CONSTEXPR20 bool pow2(uint32_t exp) noexcept { + return shl(exp); + } + + // multiply as if by 5 raised to a power. + BOOST_JSON_FASTFLOAT_CONSTEXPR20 bool pow5(uint32_t exp) noexcept { + // multiply by a power of 5 + constexpr size_t large_length = sizeof(large_power_of_5) / sizeof(limb); + limb_span large = limb_span(large_power_of_5, large_length); + while (exp >= large_step) { + BOOST_JSON_FASTFLOAT_TRY(large_mul(vec, large)); + exp -= large_step; + } +#ifdef BOOST_JSON_FASTFLOAT_64BIT_LIMB + constexpr uint32_t small_step = 27; + constexpr limb max_native = 7450580596923828125UL; +#else + constexpr uint32_t small_step = 13; + constexpr limb max_native = 1220703125U; +#endif + while (exp >= small_step) { + BOOST_JSON_FASTFLOAT_TRY(small_mul(vec, max_native)); + exp -= small_step; + } + if (exp != 0) { + // Work around clang bug https://godbolt.org/z/zedh7rrhc + // This is similar to https://github.com/llvm/llvm-project/issues/47746, + // except the workaround described there don't work here + BOOST_JSON_FASTFLOAT_TRY( + small_mul(vec, limb(((void)small_power_of_5[0], small_power_of_5[exp]))) + ); + } + + return true; + } + + // multiply as if by 10 raised to a power. + BOOST_JSON_FASTFLOAT_CONSTEXPR20 bool pow10(uint32_t exp) noexcept { + BOOST_JSON_FASTFLOAT_TRY(pow5(exp)); + return pow2(exp); + } +}; + +}}}}}} // namespace fast_float + +#endif diff --git a/include/boost/json/detail/charconv/detail/fast_float/constexpr_feature_detect.hpp b/include/boost/json/detail/charconv/detail/fast_float/constexpr_feature_detect.hpp new file mode 100644 index 00000000..2e0ac71e --- /dev/null +++ b/include/boost/json/detail/charconv/detail/fast_float/constexpr_feature_detect.hpp @@ -0,0 +1,34 @@ +// Copyright 2020-2023 Daniel Lemire +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt +// +// Derivative of: https://github.com/fastfloat/fast_float + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_CONSTEXPR_FEATURE_DETECT_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_CONSTEXPR_FEATURE_DETECT_HPP + +#ifdef __has_include +#if __has_include() +#include +#endif +#endif + +#if defined(__cpp_lib_bit_cast) && __cpp_lib_bit_cast >= 201806L +# define BOOST_JSON_HAS_BIT_CAST +#endif + +#if defined(__cpp_lib_is_constant_evaluated) && __cpp_lib_is_constant_evaluated >= 201811L +# define BOOST_JSON_HAS_IS_CONSTANT_EVALUATED +#endif + +// Testing for relevant C++20 constexpr library features +#if defined(BOOST_JSON_HAS_IS_CONSTANT_EVALUATED) \ + && defined(BOOST_JSON_HAS_BIT_CAST) \ + && __cpp_lib_constexpr_algorithms >= 201806L /*For std::copy and std::fill*/ +#define BOOST_JSON_FASTFLOAT_CONSTEXPR20 constexpr +#else +#define BOOST_JSON_FASTFLOAT_CONSTEXPR20 +#endif + +#endif // BOOST_JSON_DETAIL_CHARCONV_FASTFLOAT_CONSTEXPR_FEATURE_DETECT_HPP diff --git a/include/boost/json/detail/charconv/detail/fast_float/decimal_to_binary.hpp b/include/boost/json/detail/charconv/detail/fast_float/decimal_to_binary.hpp new file mode 100644 index 00000000..3855d261 --- /dev/null +++ b/include/boost/json/detail/charconv/detail/fast_float/decimal_to_binary.hpp @@ -0,0 +1,196 @@ +// Copyright 2020-2023 Daniel Lemire +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt +// +// Derivative of: https://github.com/fastfloat/fast_float + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_DECIMAL_TO_BINARY_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_DECIMAL_TO_BINARY_HPP + +#include +#include +#include +#include +#include +#include +#include +#include + +namespace boost { namespace json { namespace detail { namespace charconv { namespace detail { namespace fast_float { + +// This will compute or rather approximate w * 5**q and return a pair of 64-bit words approximating +// the result, with the "high" part corresponding to the most significant bits and the +// low part corresponding to the least significant bits. +// +template +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +value128 compute_product_approximation(int64_t q, uint64_t w) { + const int index = 2 * int(q - powers::smallest_power_of_five); + // For small values of q, e.g., q in [0,27], the answer is always exact because + // The line value128 firstproduct = full_multiplication(w, power_of_five_128[index]); + // gives the exact answer. + value128 firstproduct = full_multiplication(w, powers::power_of_five_128[index]); + static_assert((bit_precision >= 0) && (bit_precision <= 64), " precision should be in (0,64]"); + constexpr uint64_t precision_mask = (bit_precision < 64) ? + (uint64_t(0xFFFFFFFFFFFFFFFF) >> bit_precision) + : uint64_t(0xFFFFFFFFFFFFFFFF); + if((firstproduct.high & precision_mask) == precision_mask) { // could further guard with (lower + w < lower) + // regarding the second product, we only need secondproduct.high, but our expectation is that the compiler will optimize this extra work away if needed. + value128 secondproduct = full_multiplication(w, powers::power_of_five_128[index + 1]); + firstproduct.low += secondproduct.high; + if(secondproduct.high > firstproduct.low) { + firstproduct.high++; + } + } + return firstproduct; +} + +namespace detail { +/** + * For q in (0,350), we have that + * f = (((152170 + 65536) * q ) >> 16); + * is equal to + * floor(p) + q + * where + * p = log(5**q)/log(2) = q * log(5)/log(2) + * + * For negative values of q in (-400,0), we have that + * f = (((152170 + 65536) * q ) >> 16); + * is equal to + * -ceil(p) + q + * where + * p = log(5**-q)/log(2) = -q * log(5)/log(2) + */ + constexpr BOOST_FORCEINLINE int32_t power(int32_t q) noexcept { + return (((152170 + 65536) * q) >> 16) + 63; + } +} // namespace detail + +// create an adjusted mantissa, biased by the invalid power2 +// for significant digits already multiplied by 10 ** q. +template +BOOST_FORCEINLINE BOOST_JSON_CXX14_CONSTEXPR_NO_INLINE +adjusted_mantissa compute_error_scaled(int64_t q, uint64_t w, int lz) noexcept { + int hilz = int(w >> 63) ^ 1; + adjusted_mantissa answer; + answer.mantissa = w << hilz; + int bias = binary::mantissa_explicit_bits() - binary::minimum_exponent(); + answer.power2 = int32_t(detail::power(int32_t(q)) + bias - hilz - lz - 62 + invalid_am_bias); + return answer; +} + +// w * 10 ** q, without rounding the representation up. +// the power2 in the exponent will be adjusted by invalid_am_bias. +template +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +adjusted_mantissa compute_error(int64_t q, uint64_t w) noexcept { + int lz = leading_zeroes(w); + w <<= lz; + value128 product = compute_product_approximation(q, w); + return compute_error_scaled(q, product.high, lz); +} + +// w * 10 ** q +// The returned value should be a valid ieee64 number that simply need to be packed. +// However, in some very rare cases, the computation will fail. In such cases, we +// return an adjusted_mantissa with a negative power of 2: the caller should recompute +// in such cases. +template +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +adjusted_mantissa compute_float(int64_t q, uint64_t w) noexcept { + adjusted_mantissa answer; + if ((w == 0) || (q < binary::smallest_power_of_ten())) { + answer.power2 = 0; + answer.mantissa = 0; + // result should be zero + return answer; + } + if (q > binary::largest_power_of_ten()) { + // we want to get infinity: + answer.power2 = binary::infinite_power(); + answer.mantissa = 0; + return answer; + } + // At this point in time q is in [powers::smallest_power_of_five, powers::largest_power_of_five]. + + // We want the most significant bit of i to be 1. Shift if needed. + int lz = leading_zeroes(w); + w <<= lz; + + // The required precision is binary::mantissa_explicit_bits() + 3 because + // 1. We need the implicit bit + // 2. We need an extra bit for rounding purposes + // 3. We might lose a bit due to the "upperbit" routine (result too small, requiring a shift) + + value128 product = compute_product_approximation(q, w); + // The computed 'product' is always sufficient. + // Mathematical proof: + // Noble Mushtak and Daniel Lemire, Fast Number Parsing Without Fallback (to appear) + // See script/mushtak_lemire.py + + // The "compute_product_approximation" function can be slightly slower than a branchless approach: + // value128 product = compute_product(q, w); + // but in practice, we can win big with the compute_product_approximation if its additional branch + // is easily predicted. Which is best is data specific. + int upperbit = int(product.high >> 63); + + answer.mantissa = product.high >> (upperbit + 64 - binary::mantissa_explicit_bits() - 3); + + answer.power2 = int32_t(detail::power(int32_t(q)) + upperbit - lz - binary::minimum_exponent()); + if (answer.power2 <= 0) { // we have a subnormal? + // Here have that answer.power2 <= 0 so -answer.power2 >= 0 + if(-answer.power2 + 1 >= 64) { // if we have more than 64 bits below the minimum exponent, you have a zero for sure. + answer.power2 = 0; + answer.mantissa = 0; + // result should be zero + return answer; + } + // next line is safe because -answer.power2 + 1 < 64 + answer.mantissa >>= -answer.power2 + 1; + // Thankfully, we can't have both "round-to-even" and subnormals because + // "round-to-even" only occurs for powers close to 0. + answer.mantissa += (answer.mantissa & 1); // round up + answer.mantissa >>= 1; + // There is a weird scenario where we don't have a subnormal but just. + // Suppose we start with 2.2250738585072013e-308, we end up + // with 0x3fffffffffffff x 2^-1023-53 which is technically subnormal + // whereas 0x40000000000000 x 2^-1023-53 is normal. Now, we need to round + // up 0x3fffffffffffff x 2^-1023-53 and once we do, we are no longer + // subnormal, but we can only know this after rounding. + // So we only declare a subnormal if we are smaller than the threshold. + answer.power2 = (answer.mantissa < (uint64_t(1) << binary::mantissa_explicit_bits())) ? 0 : 1; + return answer; + } + + // usually, we round *up*, but if we fall right in between and and we have an + // even basis, we need to round down + // We are only concerned with the cases where 5**q fits in single 64-bit word. + if ((product.low <= 1) && (q >= binary::min_exponent_round_to_even()) && (q <= binary::max_exponent_round_to_even()) && + ((answer.mantissa & 3) == 1) ) { // we may fall between two floats! + // To be in-between two floats we need that in doing + // answer.mantissa = product.high >> (upperbit + 64 - binary::mantissa_explicit_bits() - 3); + // ... we dropped out only zeroes. But if this happened, then we can go back!!! + if((answer.mantissa << (upperbit + 64 - binary::mantissa_explicit_bits() - 3)) == product.high) { + answer.mantissa &= ~uint64_t(1); // flip it so that we do not round up + } + } + + answer.mantissa += (answer.mantissa & 1); // round up + answer.mantissa >>= 1; + if (answer.mantissa >= (uint64_t(2) << binary::mantissa_explicit_bits())) { + answer.mantissa = (uint64_t(1) << binary::mantissa_explicit_bits()); + answer.power2++; // undo previous addition + } + + answer.mantissa &= ~(uint64_t(1) << binary::mantissa_explicit_bits()); + if (answer.power2 >= binary::infinite_power()) { // infinity + answer.power2 = binary::infinite_power(); + answer.mantissa = 0; + } + return answer; +} + +}}}}}} // namespace fast_float + +#endif diff --git a/include/boost/json/detail/charconv/detail/fast_float/digit_comparison.hpp b/include/boost/json/detail/charconv/detail/fast_float/digit_comparison.hpp new file mode 100644 index 00000000..630ab678 --- /dev/null +++ b/include/boost/json/detail/charconv/detail/fast_float/digit_comparison.hpp @@ -0,0 +1,442 @@ +// Copyright 2020-2023 Daniel Lemire +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt +// +// Derivative of: https://github.com/fastfloat/fast_float + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_DIGIT_COMPARISON_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_DIGIT_COMPARISON_HPP + +#include +#include +#include +#include +#include +#include +#include + +namespace boost { namespace json { namespace detail { namespace charconv { namespace detail { namespace fast_float { + +// 1e0 to 1e19 +constexpr static uint64_t powers_of_ten_uint64[] = { + 1UL, 10UL, 100UL, 1000UL, 10000UL, 100000UL, 1000000UL, 10000000UL, 100000000UL, + 1000000000UL, 10000000000UL, 100000000000UL, 1000000000000UL, 10000000000000UL, + 100000000000000UL, 1000000000000000UL, 10000000000000000UL, 100000000000000000UL, + 1000000000000000000UL, 10000000000000000000UL}; + +// calculate the exponent, in scientific notation, of the number. +// this algorithm is not even close to optimized, but it has no practical +// effect on performance: in order to have a faster algorithm, we'd need +// to slow down performance for faster algorithms, and this is still fast. +template +BOOST_FORCEINLINE BOOST_JSON_CXX14_CONSTEXPR_NO_INLINE +int32_t scientific_exponent(parsed_number_string_t & num) noexcept { + uint64_t mantissa = num.mantissa; + int32_t exponent = int32_t(num.exponent); + while (mantissa >= 10000) { + mantissa /= 10000; + exponent += 4; + } + while (mantissa >= 100) { + mantissa /= 100; + exponent += 2; + } + while (mantissa >= 10) { + mantissa /= 10; + exponent += 1; + } + return exponent; +} + +// this converts a native floating-point number to an extended-precision float. +template +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +adjusted_mantissa to_extended(T value) noexcept { + using equiv_uint = typename binary_format::equiv_uint; + constexpr equiv_uint exponent_mask = binary_format::exponent_mask(); + constexpr equiv_uint mantissa_mask = binary_format::mantissa_mask(); + constexpr equiv_uint hidden_bit_mask = binary_format::hidden_bit_mask(); + + adjusted_mantissa am; + int32_t bias = binary_format::mantissa_explicit_bits() - binary_format::minimum_exponent(); + equiv_uint bits; +#ifdef BOOST_JSON_HAS_BIT_CAST + bits = std::bit_cast(value); +#else + ::memcpy(&bits, &value, sizeof(T)); +#endif + if ((bits & exponent_mask) == 0) { + // denormal + am.power2 = 1 - bias; + am.mantissa = bits & mantissa_mask; + } else { + // normal + am.power2 = int32_t((bits & exponent_mask) >> binary_format::mantissa_explicit_bits()); + am.power2 -= bias; + am.mantissa = (bits & mantissa_mask) | hidden_bit_mask; + } + + return am; +} + +// get the extended precision value of the halfway point between b and b+u. +// we are given a native float that represents b, so we need to adjust it +// halfway between b and b+u. +template +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +adjusted_mantissa to_extended_halfway(T value) noexcept { + adjusted_mantissa am = to_extended(value); + am.mantissa <<= 1; + am.mantissa += 1; + am.power2 -= 1; + return am; +} + +// round an extended-precision float to the nearest machine float. +template +BOOST_FORCEINLINE BOOST_JSON_CXX14_CONSTEXPR_NO_INLINE +void round(adjusted_mantissa& am, callback cb) noexcept { + int32_t mantissa_shift = 64 - binary_format::mantissa_explicit_bits() - 1; + if (-am.power2 >= mantissa_shift) { + // have a denormal float + int32_t shift = -am.power2 + 1; + cb(am, std::min(shift, 64)); + // check for round-up: if rounding-nearest carried us to the hidden bit. + am.power2 = (am.mantissa < (uint64_t(1) << binary_format::mantissa_explicit_bits())) ? 0 : 1; + return; + } + + // have a normal float, use the default shift. + cb(am, mantissa_shift); + + // check for carry + if (am.mantissa >= (uint64_t(2) << binary_format::mantissa_explicit_bits())) { + am.mantissa = (uint64_t(1) << binary_format::mantissa_explicit_bits()); + am.power2++; + } + + // check for infinite: we could have carried to an infinite power + am.mantissa &= ~(uint64_t(1) << binary_format::mantissa_explicit_bits()); + if (am.power2 >= binary_format::infinite_power()) { + am.power2 = binary_format::infinite_power(); + am.mantissa = 0; + } +} + +template +BOOST_FORCEINLINE BOOST_JSON_CXX14_CONSTEXPR_NO_INLINE +void round_nearest_tie_even(adjusted_mantissa& am, int32_t shift, callback cb) noexcept { + const uint64_t mask + = (shift == 64) + ? UINT64_MAX + : (uint64_t(1) << shift) - 1; + const uint64_t halfway + = (shift == 0) + ? 0 + : uint64_t(1) << (shift - 1); + uint64_t truncated_bits = am.mantissa & mask; + bool is_above = truncated_bits > halfway; + bool is_halfway = truncated_bits == halfway; + + // shift digits into position + if (shift == 64) { + am.mantissa = 0; + } else { + am.mantissa >>= shift; + } + am.power2 += shift; + + bool is_odd = (am.mantissa & 1) == 1; + am.mantissa += uint64_t(cb(is_odd, is_halfway, is_above)); +} + +BOOST_FORCEINLINE BOOST_JSON_CXX14_CONSTEXPR_NO_INLINE +void round_down(adjusted_mantissa& am, int32_t shift) noexcept { + if (shift == 64) { + am.mantissa = 0; + } else { + am.mantissa >>= shift; + } + am.power2 += shift; +} +template +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +void skip_zeros(UC const * & first, UC const * last) noexcept { + uint64_t val; + while (!cpp20_and_in_constexpr() && std::distance(first, last) >= int_cmp_len()) { + ::memcpy(&val, first, sizeof(uint64_t)); + if (val != int_cmp_zeros()) { + break; + } + first += int_cmp_len(); + } + while (first != last) { + if (*first != UC('0')) { + break; + } + first++; + } +} + +// determine if any non-zero digits were truncated. +// all characters must be valid digits. +template +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +bool is_truncated(UC const * first, UC const * last) noexcept { + // do 8-bit optimizations, can just compare to 8 literal 0s. + uint64_t val; + while (!cpp20_and_in_constexpr() && std::distance(first, last) >= int_cmp_len()) { + ::memcpy(&val, first, sizeof(uint64_t)); + if (val != int_cmp_zeros()) { + return true; + } + first += int_cmp_len(); + } + while (first != last) { + if (*first != UC('0')) { + return true; + } + ++first; + } + return false; +} +template +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +bool is_truncated(span s) noexcept { + return is_truncated(s.ptr, s.ptr + s.len()); +} + +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +void parse_eight_digits(const char16_t*& , limb& , size_t& , size_t& ) noexcept { + // currently unused +} + +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +void parse_eight_digits(const char32_t*& , limb& , size_t& , size_t& ) noexcept { + // currently unused +} + +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +void parse_eight_digits(const char*& p, limb& value, size_t& counter, size_t& count) noexcept { + value = value * 100000000 + parse_eight_digits_unrolled(p); + p += 8; + counter += 8; + count += 8; +} + +template +BOOST_FORCEINLINE BOOST_JSON_CXX14_CONSTEXPR_NO_INLINE +void parse_one_digit(UC const *& p, limb& value, size_t& counter, size_t& count) noexcept { + value = value * 10 + limb(*p - UC('0')); + p++; + counter++; + count++; +} + +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +void add_native(bigint& big, limb power, limb value) noexcept { + big.mul(power); + big.add(value); +} + +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +void round_up_bigint(bigint& big, size_t& count) noexcept { + // need to round-up the digits, but need to avoid rounding + // ....9999 to ...10000, which could cause a false halfway point. + add_native(big, 10, 1); + count++; +} + +// parse the significant digits into a big integer +template +inline BOOST_JSON_FASTFLOAT_CONSTEXPR20 +void parse_mantissa(bigint& result, parsed_number_string_t& num, size_t max_digits, size_t& digits) noexcept { + // try to minimize the number of big integer and scalar multiplication. + // therefore, try to parse 8 digits at a time, and multiply by the largest + // scalar value (9 or 19 digits) for each step. + size_t counter = 0; + digits = 0; + limb value = 0; +#ifdef BOOST_JSON_FASTFLOAT_64BIT_LIMB + constexpr size_t step = 19; +#else + constexpr size_t step = 9; +#endif + + // process all integer digits. + UC const * p = num.integer.ptr; + UC const * pend = p + num.integer.len(); + skip_zeros(p, pend); + // process all digits, in increments of step per loop + while (p != pend) { + if (std::is_same::value) { + while ((std::distance(p, pend) >= 8) && (step - counter >= 8) && (max_digits - digits >= 8)) { + parse_eight_digits(p, value, counter, digits); + } + } + while (counter < step && p != pend && digits < max_digits) { + parse_one_digit(p, value, counter, digits); + } + if (digits == max_digits) { + // add the temporary value, then check if we've truncated any digits + add_native(result, limb(powers_of_ten_uint64[counter]), value); + bool truncated = is_truncated(p, pend); + if (num.fraction.ptr != nullptr) { + truncated |= is_truncated(num.fraction); + } + if (truncated) { + round_up_bigint(result, digits); + } + return; + } else { + add_native(result, limb(powers_of_ten_uint64[counter]), value); + counter = 0; + value = 0; + } + } + + // add our fraction digits, if they're available. + if (num.fraction.ptr != nullptr) { + p = num.fraction.ptr; + pend = p + num.fraction.len(); + if (digits == 0) { + skip_zeros(p, pend); + } + // process all digits, in increments of step per loop + while (p != pend) { + if (std::is_same::value) { + while ((std::distance(p, pend) >= 8) && (step - counter >= 8) && (max_digits - digits >= 8)) { + parse_eight_digits(p, value, counter, digits); + } + } + while (counter < step && p != pend && digits < max_digits) { + parse_one_digit(p, value, counter, digits); + } + if (digits == max_digits) { + // add the temporary value, then check if we've truncated any digits + add_native(result, limb(powers_of_ten_uint64[counter]), value); + bool truncated = is_truncated(p, pend); + if (truncated) { + round_up_bigint(result, digits); + } + return; + } else { + add_native(result, limb(powers_of_ten_uint64[counter]), value); + counter = 0; + value = 0; + } + } + } + + if (counter != 0) { + add_native(result, limb(powers_of_ten_uint64[counter]), value); + } +} + +template +inline BOOST_JSON_FASTFLOAT_CONSTEXPR20 +adjusted_mantissa positive_digit_comp(bigint& bigmant, int32_t exponent) noexcept { + bigmant.pow10(uint32_t(exponent)); + adjusted_mantissa answer; + bool truncated; + answer.mantissa = bigmant.hi64(truncated); + int bias = binary_format::mantissa_explicit_bits() - binary_format::minimum_exponent(); + answer.power2 = bigmant.bit_length() - 64 + bias; + + round(answer, [truncated](adjusted_mantissa& a, int32_t shift) { + round_nearest_tie_even(a, shift, [truncated](bool is_odd, bool is_halfway, bool is_above) -> bool { + return is_above || (is_halfway && truncated) || (is_odd && is_halfway); + }); + }); + + return answer; +} + +// the scaling here is quite simple: we have, for the real digits `m * 10^e`, +// and for the theoretical digits `n * 2^f`. Since `e` is always negative, +// to scale them identically, we do `n * 2^f * 5^-f`, so we now have `m * 2^e`. +// we then need to scale by `2^(f- e)`, and then the two significant digits +// are of the same magnitude. +template +inline BOOST_JSON_FASTFLOAT_CONSTEXPR20 +adjusted_mantissa negative_digit_comp(bigint& bigmant, adjusted_mantissa am, int32_t exponent) noexcept { + bigint& real_digits = bigmant; + int32_t real_exp = exponent; + + // get the value of `b`, rounded down, and get a bigint representation of b+h + adjusted_mantissa am_b = am; + // gcc7 buf: use a lambda to remove the noexcept qualifier bug with -Wnoexcept-type. + round(am_b, [](adjusted_mantissa&a, int32_t shift) { round_down(a, shift); }); + T b; + to_float(false, am_b, b); + adjusted_mantissa theor = to_extended_halfway(b); + bigint theor_digits(theor.mantissa); + int32_t theor_exp = theor.power2; + + // scale real digits and theor digits to be same power. + int32_t pow2_exp = theor_exp - real_exp; + uint32_t pow5_exp = uint32_t(-real_exp); + if (pow5_exp != 0) { + theor_digits.pow5(pow5_exp); + } + if (pow2_exp > 0) { + theor_digits.pow2(uint32_t(pow2_exp)); + } else if (pow2_exp < 0) { + real_digits.pow2(uint32_t(-pow2_exp)); + } + + // compare digits, and use it to director rounding + int ord = real_digits.compare(theor_digits); + adjusted_mantissa answer = am; + round(answer, [ord](adjusted_mantissa& a, int32_t shift) { + round_nearest_tie_even(a, shift, [ord](bool is_odd, bool, bool) -> bool { + if (ord > 0) { + return true; + } else if (ord < 0) { + return false; + } else { + return is_odd; + } + }); + }); + + return answer; +} + +// parse the significant digits as a big integer to unambiguously round +// the significant digits. here, we are trying to determine how to round +// an extended float representation close to `b+h`, halfway between `b` +// (the float rounded-down) and `b+u`, the next positive float. this +// algorithm is always correct, and uses one of two approaches. when +// the exponent is positive relative to the significant digits (such as +// 1234), we create a big-integer representation, get the high 64-bits, +// determine if any lower bits are truncated, and use that to direct +// rounding. in case of a negative exponent relative to the significant +// digits (such as 1.2345), we create a theoretical representation of +// `b` as a big-integer type, scaled to the same binary exponent as +// the actual digits. we then compare the big integer representations +// of both, and use that to direct rounding. +template +inline BOOST_JSON_FASTFLOAT_CONSTEXPR20 +adjusted_mantissa digit_comp(parsed_number_string_t& num, adjusted_mantissa am) noexcept { + // remove the invalid exponent bias + am.power2 -= invalid_am_bias; + + int32_t sci_exp = scientific_exponent(num); + size_t max_digits = binary_format::max_digits(); + size_t digits = 0; + bigint bigmant; + parse_mantissa(bigmant, num, max_digits, digits); + // can't underflow, since digits is at most max_digits. + int32_t exponent = sci_exp + 1 - int32_t(digits); + if (exponent >= 0) { + return positive_digit_comp(bigmant, exponent); + } else { + return negative_digit_comp(bigmant, am, exponent); + } +} + +}}}}}} // namespace fast_float + +#endif diff --git a/include/boost/json/detail/charconv/detail/fast_float/fast_float.hpp b/include/boost/json/detail/charconv/detail/fast_float/fast_float.hpp new file mode 100644 index 00000000..8a470215 --- /dev/null +++ b/include/boost/json/detail/charconv/detail/fast_float/fast_float.hpp @@ -0,0 +1,48 @@ +// Copyright 2020-2023 Daniel Lemire +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt +// +// Derivative of: https://github.com/fastfloat/fast_float + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_FAST_FLOAT_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_FAST_FLOAT_HPP + +#include + +namespace boost { namespace json { namespace detail { namespace charconv { namespace detail { namespace fast_float { +/** + * This function parses the character sequence [first,last) for a number. It parses floating-point numbers expecting + * a locale-indepent format equivalent to what is used by std::strtod in the default ("C") locale. + * The resulting floating-point value is the closest floating-point values (using either float or double), + * using the "round to even" convention for values that would otherwise fall right in-between two values. + * That is, we provide exact parsing according to the IEEE standard. + * + * Given a successful parse, the pointer (`ptr`) in the returned value is set to point right after the + * parsed number, and the `value` referenced is set to the parsed value. In case of error, the returned + * `ec` contains a representative error, otherwise the default (`std::errc()`) value is stored. + * + * The implementation does not throw and does not allocate memory (e.g., with `new` or `malloc`). + * + * Like the C++17 standard, the `fast_float::from_chars` functions take an optional last argument of + * the type `fast_float::chars_format`. It is a bitset value: we check whether + * `fmt & fast_float::chars_format::fixed` and `fmt & fast_float::chars_format::scientific` are set + * to determine whether we allow the fixed point and scientific notation respectively. + * The default is `fast_float::chars_format::general` which allows both `fixed` and `scientific`. + */ +template +BOOST_JSON_FASTFLOAT_CONSTEXPR20 +from_chars_result_t from_chars(UC const * first, UC const * last, + T &value, chars_format fmt = chars_format::general) noexcept; + +/** + * Like from_chars, but accepts an `options` argument to govern number parsing. + */ +template +BOOST_JSON_FASTFLOAT_CONSTEXPR20 +from_chars_result_t from_chars_advanced(UC const * first, UC const * last, + T &value, parse_options_t options) noexcept; + +}}}}}} // namespace fast_float +#include +#endif // BOOST_JSON_DETAIL_CHARCONV_FASTFLOAT_FAST_FLOAT_H diff --git a/include/boost/json/detail/charconv/detail/fast_float/fast_table.hpp b/include/boost/json/detail/charconv/detail/fast_float/fast_table.hpp new file mode 100644 index 00000000..5deec592 --- /dev/null +++ b/include/boost/json/detail/charconv/detail/fast_float/fast_table.hpp @@ -0,0 +1,708 @@ +// Copyright 2020-2023 Daniel Lemire +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt +// +// Derivative of: https://github.com/fastfloat/fast_float + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_FAST_TABLE_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_FAST_TABLE_HPP + +#include +#include + +namespace boost { namespace json { namespace detail { namespace charconv { namespace detail { namespace fast_float { + +/** + * When mapping numbers from decimal to binary, + * we go from w * 10^q to m * 2^p but we have + * 10^q = 5^q * 2^q, so effectively + * we are trying to match + * w * 2^q * 5^q to m * 2^p. Thus the powers of two + * are not a concern since they can be represented + * exactly using the binary notation, only the powers of five + * affect the binary significand. + */ + +/** + * The smallest non-zero float (binary64) is 2^-1074. + * We take as input numbers of the form w x 10^q where w < 2^64. + * We have that w * 10^-343 < 2^(64-344) 5^-343 < 2^-1076. + * However, we have that + * (2^64-1) * 10^-342 = (2^64-1) * 2^-342 * 5^-342 > 2^-1074. + * Thus it is possible for a number of the form w * 10^-342 where + * w is a 64-bit value to be a non-zero floating-point number. + ********* + * Any number of form w * 10^309 where w>= 1 is going to be + * infinite in binary64 so we never need to worry about powers + * of 5 greater than 308. + */ +template +struct powers_template { + +constexpr static int smallest_power_of_five = binary_format::smallest_power_of_ten(); +constexpr static int largest_power_of_five = binary_format::largest_power_of_ten(); +constexpr static int number_of_entries = 2 * (largest_power_of_five - smallest_power_of_five + 1); +// Powers of five from 5^-342 all the way to 5^308 rounded toward one. +constexpr static uint64_t power_of_five_128[number_of_entries] = { + 0xeef453d6923bd65a,0x113faa2906a13b3f, + 0x9558b4661b6565f8,0x4ac7ca59a424c507, + 0xbaaee17fa23ebf76,0x5d79bcf00d2df649, + 0xe95a99df8ace6f53,0xf4d82c2c107973dc, + 0x91d8a02bb6c10594,0x79071b9b8a4be869, + 0xb64ec836a47146f9,0x9748e2826cdee284, + 0xe3e27a444d8d98b7,0xfd1b1b2308169b25, + 0x8e6d8c6ab0787f72,0xfe30f0f5e50e20f7, + 0xb208ef855c969f4f,0xbdbd2d335e51a935, + 0xde8b2b66b3bc4723,0xad2c788035e61382, + 0x8b16fb203055ac76,0x4c3bcb5021afcc31, + 0xaddcb9e83c6b1793,0xdf4abe242a1bbf3d, + 0xd953e8624b85dd78,0xd71d6dad34a2af0d, + 0x87d4713d6f33aa6b,0x8672648c40e5ad68, + 0xa9c98d8ccb009506,0x680efdaf511f18c2, + 0xd43bf0effdc0ba48,0x212bd1b2566def2, + 0x84a57695fe98746d,0x14bb630f7604b57, + 0xa5ced43b7e3e9188,0x419ea3bd35385e2d, + 0xcf42894a5dce35ea,0x52064cac828675b9, + 0x818995ce7aa0e1b2,0x7343efebd1940993, + 0xa1ebfb4219491a1f,0x1014ebe6c5f90bf8, + 0xca66fa129f9b60a6,0xd41a26e077774ef6, + 0xfd00b897478238d0,0x8920b098955522b4, + 0x9e20735e8cb16382,0x55b46e5f5d5535b0, + 0xc5a890362fddbc62,0xeb2189f734aa831d, + 0xf712b443bbd52b7b,0xa5e9ec7501d523e4, + 0x9a6bb0aa55653b2d,0x47b233c92125366e, + 0xc1069cd4eabe89f8,0x999ec0bb696e840a, + 0xf148440a256e2c76,0xc00670ea43ca250d, + 0x96cd2a865764dbca,0x380406926a5e5728, + 0xbc807527ed3e12bc,0xc605083704f5ecf2, + 0xeba09271e88d976b,0xf7864a44c633682e, + 0x93445b8731587ea3,0x7ab3ee6afbe0211d, + 0xb8157268fdae9e4c,0x5960ea05bad82964, + 0xe61acf033d1a45df,0x6fb92487298e33bd, + 0x8fd0c16206306bab,0xa5d3b6d479f8e056, + 0xb3c4f1ba87bc8696,0x8f48a4899877186c, + 0xe0b62e2929aba83c,0x331acdabfe94de87, + 0x8c71dcd9ba0b4925,0x9ff0c08b7f1d0b14, + 0xaf8e5410288e1b6f,0x7ecf0ae5ee44dd9, + 0xdb71e91432b1a24a,0xc9e82cd9f69d6150, + 0x892731ac9faf056e,0xbe311c083a225cd2, + 0xab70fe17c79ac6ca,0x6dbd630a48aaf406, + 0xd64d3d9db981787d,0x92cbbccdad5b108, + 0x85f0468293f0eb4e,0x25bbf56008c58ea5, + 0xa76c582338ed2621,0xaf2af2b80af6f24e, + 0xd1476e2c07286faa,0x1af5af660db4aee1, + 0x82cca4db847945ca,0x50d98d9fc890ed4d, + 0xa37fce126597973c,0xe50ff107bab528a0, + 0xcc5fc196fefd7d0c,0x1e53ed49a96272c8, + 0xff77b1fcbebcdc4f,0x25e8e89c13bb0f7a, + 0x9faacf3df73609b1,0x77b191618c54e9ac, + 0xc795830d75038c1d,0xd59df5b9ef6a2417, + 0xf97ae3d0d2446f25,0x4b0573286b44ad1d, + 0x9becce62836ac577,0x4ee367f9430aec32, + 0xc2e801fb244576d5,0x229c41f793cda73f, + 0xf3a20279ed56d48a,0x6b43527578c1110f, + 0x9845418c345644d6,0x830a13896b78aaa9, + 0xbe5691ef416bd60c,0x23cc986bc656d553, + 0xedec366b11c6cb8f,0x2cbfbe86b7ec8aa8, + 0x94b3a202eb1c3f39,0x7bf7d71432f3d6a9, + 0xb9e08a83a5e34f07,0xdaf5ccd93fb0cc53, + 0xe858ad248f5c22c9,0xd1b3400f8f9cff68, + 0x91376c36d99995be,0x23100809b9c21fa1, + 0xb58547448ffffb2d,0xabd40a0c2832a78a, + 0xe2e69915b3fff9f9,0x16c90c8f323f516c, + 0x8dd01fad907ffc3b,0xae3da7d97f6792e3, + 0xb1442798f49ffb4a,0x99cd11cfdf41779c, + 0xdd95317f31c7fa1d,0x40405643d711d583, + 0x8a7d3eef7f1cfc52,0x482835ea666b2572, + 0xad1c8eab5ee43b66,0xda3243650005eecf, + 0xd863b256369d4a40,0x90bed43e40076a82, + 0x873e4f75e2224e68,0x5a7744a6e804a291, + 0xa90de3535aaae202,0x711515d0a205cb36, + 0xd3515c2831559a83,0xd5a5b44ca873e03, + 0x8412d9991ed58091,0xe858790afe9486c2, + 0xa5178fff668ae0b6,0x626e974dbe39a872, + 0xce5d73ff402d98e3,0xfb0a3d212dc8128f, + 0x80fa687f881c7f8e,0x7ce66634bc9d0b99, + 0xa139029f6a239f72,0x1c1fffc1ebc44e80, + 0xc987434744ac874e,0xa327ffb266b56220, + 0xfbe9141915d7a922,0x4bf1ff9f0062baa8, + 0x9d71ac8fada6c9b5,0x6f773fc3603db4a9, + 0xc4ce17b399107c22,0xcb550fb4384d21d3, + 0xf6019da07f549b2b,0x7e2a53a146606a48, + 0x99c102844f94e0fb,0x2eda7444cbfc426d, + 0xc0314325637a1939,0xfa911155fefb5308, + 0xf03d93eebc589f88,0x793555ab7eba27ca, + 0x96267c7535b763b5,0x4bc1558b2f3458de, + 0xbbb01b9283253ca2,0x9eb1aaedfb016f16, + 0xea9c227723ee8bcb,0x465e15a979c1cadc, + 0x92a1958a7675175f,0xbfacd89ec191ec9, + 0xb749faed14125d36,0xcef980ec671f667b, + 0xe51c79a85916f484,0x82b7e12780e7401a, + 0x8f31cc0937ae58d2,0xd1b2ecb8b0908810, + 0xb2fe3f0b8599ef07,0x861fa7e6dcb4aa15, + 0xdfbdcece67006ac9,0x67a791e093e1d49a, + 0x8bd6a141006042bd,0xe0c8bb2c5c6d24e0, + 0xaecc49914078536d,0x58fae9f773886e18, + 0xda7f5bf590966848,0xaf39a475506a899e, + 0x888f99797a5e012d,0x6d8406c952429603, + 0xaab37fd7d8f58178,0xc8e5087ba6d33b83, + 0xd5605fcdcf32e1d6,0xfb1e4a9a90880a64, + 0x855c3be0a17fcd26,0x5cf2eea09a55067f, + 0xa6b34ad8c9dfc06f,0xf42faa48c0ea481e, + 0xd0601d8efc57b08b,0xf13b94daf124da26, + 0x823c12795db6ce57,0x76c53d08d6b70858, + 0xa2cb1717b52481ed,0x54768c4b0c64ca6e, + 0xcb7ddcdda26da268,0xa9942f5dcf7dfd09, + 0xfe5d54150b090b02,0xd3f93b35435d7c4c, + 0x9efa548d26e5a6e1,0xc47bc5014a1a6daf, + 0xc6b8e9b0709f109a,0x359ab6419ca1091b, + 0xf867241c8cc6d4c0,0xc30163d203c94b62, + 0x9b407691d7fc44f8,0x79e0de63425dcf1d, + 0xc21094364dfb5636,0x985915fc12f542e4, + 0xf294b943e17a2bc4,0x3e6f5b7b17b2939d, + 0x979cf3ca6cec5b5a,0xa705992ceecf9c42, + 0xbd8430bd08277231,0x50c6ff782a838353, + 0xece53cec4a314ebd,0xa4f8bf5635246428, + 0x940f4613ae5ed136,0x871b7795e136be99, + 0xb913179899f68584,0x28e2557b59846e3f, + 0xe757dd7ec07426e5,0x331aeada2fe589cf, + 0x9096ea6f3848984f,0x3ff0d2c85def7621, + 0xb4bca50b065abe63,0xfed077a756b53a9, + 0xe1ebce4dc7f16dfb,0xd3e8495912c62894, + 0x8d3360f09cf6e4bd,0x64712dd7abbbd95c, + 0xb080392cc4349dec,0xbd8d794d96aacfb3, + 0xdca04777f541c567,0xecf0d7a0fc5583a0, + 0x89e42caaf9491b60,0xf41686c49db57244, + 0xac5d37d5b79b6239,0x311c2875c522ced5, + 0xd77485cb25823ac7,0x7d633293366b828b, + 0x86a8d39ef77164bc,0xae5dff9c02033197, + 0xa8530886b54dbdeb,0xd9f57f830283fdfc, + 0xd267caa862a12d66,0xd072df63c324fd7b, + 0x8380dea93da4bc60,0x4247cb9e59f71e6d, + 0xa46116538d0deb78,0x52d9be85f074e608, + 0xcd795be870516656,0x67902e276c921f8b, + 0x806bd9714632dff6,0xba1cd8a3db53b6, + 0xa086cfcd97bf97f3,0x80e8a40eccd228a4, + 0xc8a883c0fdaf7df0,0x6122cd128006b2cd, + 0xfad2a4b13d1b5d6c,0x796b805720085f81, + 0x9cc3a6eec6311a63,0xcbe3303674053bb0, + 0xc3f490aa77bd60fc,0xbedbfc4411068a9c, + 0xf4f1b4d515acb93b,0xee92fb5515482d44, + 0x991711052d8bf3c5,0x751bdd152d4d1c4a, + 0xbf5cd54678eef0b6,0xd262d45a78a0635d, + 0xef340a98172aace4,0x86fb897116c87c34, + 0x9580869f0e7aac0e,0xd45d35e6ae3d4da0, + 0xbae0a846d2195712,0x8974836059cca109, + 0xe998d258869facd7,0x2bd1a438703fc94b, + 0x91ff83775423cc06,0x7b6306a34627ddcf, + 0xb67f6455292cbf08,0x1a3bc84c17b1d542, + 0xe41f3d6a7377eeca,0x20caba5f1d9e4a93, + 0x8e938662882af53e,0x547eb47b7282ee9c, + 0xb23867fb2a35b28d,0xe99e619a4f23aa43, + 0xdec681f9f4c31f31,0x6405fa00e2ec94d4, + 0x8b3c113c38f9f37e,0xde83bc408dd3dd04, + 0xae0b158b4738705e,0x9624ab50b148d445, + 0xd98ddaee19068c76,0x3badd624dd9b0957, + 0x87f8a8d4cfa417c9,0xe54ca5d70a80e5d6, + 0xa9f6d30a038d1dbc,0x5e9fcf4ccd211f4c, + 0xd47487cc8470652b,0x7647c3200069671f, + 0x84c8d4dfd2c63f3b,0x29ecd9f40041e073, + 0xa5fb0a17c777cf09,0xf468107100525890, + 0xcf79cc9db955c2cc,0x7182148d4066eeb4, + 0x81ac1fe293d599bf,0xc6f14cd848405530, + 0xa21727db38cb002f,0xb8ada00e5a506a7c, + 0xca9cf1d206fdc03b,0xa6d90811f0e4851c, + 0xfd442e4688bd304a,0x908f4a166d1da663, + 0x9e4a9cec15763e2e,0x9a598e4e043287fe, + 0xc5dd44271ad3cdba,0x40eff1e1853f29fd, + 0xf7549530e188c128,0xd12bee59e68ef47c, + 0x9a94dd3e8cf578b9,0x82bb74f8301958ce, + 0xc13a148e3032d6e7,0xe36a52363c1faf01, + 0xf18899b1bc3f8ca1,0xdc44e6c3cb279ac1, + 0x96f5600f15a7b7e5,0x29ab103a5ef8c0b9, + 0xbcb2b812db11a5de,0x7415d448f6b6f0e7, + 0xebdf661791d60f56,0x111b495b3464ad21, + 0x936b9fcebb25c995,0xcab10dd900beec34, + 0xb84687c269ef3bfb,0x3d5d514f40eea742, + 0xe65829b3046b0afa,0xcb4a5a3112a5112, + 0x8ff71a0fe2c2e6dc,0x47f0e785eaba72ab, + 0xb3f4e093db73a093,0x59ed216765690f56, + 0xe0f218b8d25088b8,0x306869c13ec3532c, + 0x8c974f7383725573,0x1e414218c73a13fb, + 0xafbd2350644eeacf,0xe5d1929ef90898fa, + 0xdbac6c247d62a583,0xdf45f746b74abf39, + 0x894bc396ce5da772,0x6b8bba8c328eb783, + 0xab9eb47c81f5114f,0x66ea92f3f326564, + 0xd686619ba27255a2,0xc80a537b0efefebd, + 0x8613fd0145877585,0xbd06742ce95f5f36, + 0xa798fc4196e952e7,0x2c48113823b73704, + 0xd17f3b51fca3a7a0,0xf75a15862ca504c5, + 0x82ef85133de648c4,0x9a984d73dbe722fb, + 0xa3ab66580d5fdaf5,0xc13e60d0d2e0ebba, + 0xcc963fee10b7d1b3,0x318df905079926a8, + 0xffbbcfe994e5c61f,0xfdf17746497f7052, + 0x9fd561f1fd0f9bd3,0xfeb6ea8bedefa633, + 0xc7caba6e7c5382c8,0xfe64a52ee96b8fc0, + 0xf9bd690a1b68637b,0x3dfdce7aa3c673b0, + 0x9c1661a651213e2d,0x6bea10ca65c084e, + 0xc31bfa0fe5698db8,0x486e494fcff30a62, + 0xf3e2f893dec3f126,0x5a89dba3c3efccfa, + 0x986ddb5c6b3a76b7,0xf89629465a75e01c, + 0xbe89523386091465,0xf6bbb397f1135823, + 0xee2ba6c0678b597f,0x746aa07ded582e2c, + 0x94db483840b717ef,0xa8c2a44eb4571cdc, + 0xba121a4650e4ddeb,0x92f34d62616ce413, + 0xe896a0d7e51e1566,0x77b020baf9c81d17, + 0x915e2486ef32cd60,0xace1474dc1d122e, + 0xb5b5ada8aaff80b8,0xd819992132456ba, + 0xe3231912d5bf60e6,0x10e1fff697ed6c69, + 0x8df5efabc5979c8f,0xca8d3ffa1ef463c1, + 0xb1736b96b6fd83b3,0xbd308ff8a6b17cb2, + 0xddd0467c64bce4a0,0xac7cb3f6d05ddbde, + 0x8aa22c0dbef60ee4,0x6bcdf07a423aa96b, + 0xad4ab7112eb3929d,0x86c16c98d2c953c6, + 0xd89d64d57a607744,0xe871c7bf077ba8b7, + 0x87625f056c7c4a8b,0x11471cd764ad4972, + 0xa93af6c6c79b5d2d,0xd598e40d3dd89bcf, + 0xd389b47879823479,0x4aff1d108d4ec2c3, + 0x843610cb4bf160cb,0xcedf722a585139ba, + 0xa54394fe1eedb8fe,0xc2974eb4ee658828, + 0xce947a3da6a9273e,0x733d226229feea32, + 0x811ccc668829b887,0x806357d5a3f525f, + 0xa163ff802a3426a8,0xca07c2dcb0cf26f7, + 0xc9bcff6034c13052,0xfc89b393dd02f0b5, + 0xfc2c3f3841f17c67,0xbbac2078d443ace2, + 0x9d9ba7832936edc0,0xd54b944b84aa4c0d, + 0xc5029163f384a931,0xa9e795e65d4df11, + 0xf64335bcf065d37d,0x4d4617b5ff4a16d5, + 0x99ea0196163fa42e,0x504bced1bf8e4e45, + 0xc06481fb9bcf8d39,0xe45ec2862f71e1d6, + 0xf07da27a82c37088,0x5d767327bb4e5a4c, + 0x964e858c91ba2655,0x3a6a07f8d510f86f, + 0xbbe226efb628afea,0x890489f70a55368b, + 0xeadab0aba3b2dbe5,0x2b45ac74ccea842e, + 0x92c8ae6b464fc96f,0x3b0b8bc90012929d, + 0xb77ada0617e3bbcb,0x9ce6ebb40173744, + 0xe55990879ddcaabd,0xcc420a6a101d0515, + 0x8f57fa54c2a9eab6,0x9fa946824a12232d, + 0xb32df8e9f3546564,0x47939822dc96abf9, + 0xdff9772470297ebd,0x59787e2b93bc56f7, + 0x8bfbea76c619ef36,0x57eb4edb3c55b65a, + 0xaefae51477a06b03,0xede622920b6b23f1, + 0xdab99e59958885c4,0xe95fab368e45eced, + 0x88b402f7fd75539b,0x11dbcb0218ebb414, + 0xaae103b5fcd2a881,0xd652bdc29f26a119, + 0xd59944a37c0752a2,0x4be76d3346f0495f, + 0x857fcae62d8493a5,0x6f70a4400c562ddb, + 0xa6dfbd9fb8e5b88e,0xcb4ccd500f6bb952, + 0xd097ad07a71f26b2,0x7e2000a41346a7a7, + 0x825ecc24c873782f,0x8ed400668c0c28c8, + 0xa2f67f2dfa90563b,0x728900802f0f32fa, + 0xcbb41ef979346bca,0x4f2b40a03ad2ffb9, + 0xfea126b7d78186bc,0xe2f610c84987bfa8, + 0x9f24b832e6b0f436,0xdd9ca7d2df4d7c9, + 0xc6ede63fa05d3143,0x91503d1c79720dbb, + 0xf8a95fcf88747d94,0x75a44c6397ce912a, + 0x9b69dbe1b548ce7c,0xc986afbe3ee11aba, + 0xc24452da229b021b,0xfbe85badce996168, + 0xf2d56790ab41c2a2,0xfae27299423fb9c3, + 0x97c560ba6b0919a5,0xdccd879fc967d41a, + 0xbdb6b8e905cb600f,0x5400e987bbc1c920, + 0xed246723473e3813,0x290123e9aab23b68, + 0x9436c0760c86e30b,0xf9a0b6720aaf6521, + 0xb94470938fa89bce,0xf808e40e8d5b3e69, + 0xe7958cb87392c2c2,0xb60b1d1230b20e04, + 0x90bd77f3483bb9b9,0xb1c6f22b5e6f48c2, + 0xb4ecd5f01a4aa828,0x1e38aeb6360b1af3, + 0xe2280b6c20dd5232,0x25c6da63c38de1b0, + 0x8d590723948a535f,0x579c487e5a38ad0e, + 0xb0af48ec79ace837,0x2d835a9df0c6d851, + 0xdcdb1b2798182244,0xf8e431456cf88e65, + 0x8a08f0f8bf0f156b,0x1b8e9ecb641b58ff, + 0xac8b2d36eed2dac5,0xe272467e3d222f3f, + 0xd7adf884aa879177,0x5b0ed81dcc6abb0f, + 0x86ccbb52ea94baea,0x98e947129fc2b4e9, + 0xa87fea27a539e9a5,0x3f2398d747b36224, + 0xd29fe4b18e88640e,0x8eec7f0d19a03aad, + 0x83a3eeeef9153e89,0x1953cf68300424ac, + 0xa48ceaaab75a8e2b,0x5fa8c3423c052dd7, + 0xcdb02555653131b6,0x3792f412cb06794d, + 0x808e17555f3ebf11,0xe2bbd88bbee40bd0, + 0xa0b19d2ab70e6ed6,0x5b6aceaeae9d0ec4, + 0xc8de047564d20a8b,0xf245825a5a445275, + 0xfb158592be068d2e,0xeed6e2f0f0d56712, + 0x9ced737bb6c4183d,0x55464dd69685606b, + 0xc428d05aa4751e4c,0xaa97e14c3c26b886, + 0xf53304714d9265df,0xd53dd99f4b3066a8, + 0x993fe2c6d07b7fab,0xe546a8038efe4029, + 0xbf8fdb78849a5f96,0xde98520472bdd033, + 0xef73d256a5c0f77c,0x963e66858f6d4440, + 0x95a8637627989aad,0xdde7001379a44aa8, + 0xbb127c53b17ec159,0x5560c018580d5d52, + 0xe9d71b689dde71af,0xaab8f01e6e10b4a6, + 0x9226712162ab070d,0xcab3961304ca70e8, + 0xb6b00d69bb55c8d1,0x3d607b97c5fd0d22, + 0xe45c10c42a2b3b05,0x8cb89a7db77c506a, + 0x8eb98a7a9a5b04e3,0x77f3608e92adb242, + 0xb267ed1940f1c61c,0x55f038b237591ed3, + 0xdf01e85f912e37a3,0x6b6c46dec52f6688, + 0x8b61313bbabce2c6,0x2323ac4b3b3da015, + 0xae397d8aa96c1b77,0xabec975e0a0d081a, + 0xd9c7dced53c72255,0x96e7bd358c904a21, + 0x881cea14545c7575,0x7e50d64177da2e54, + 0xaa242499697392d2,0xdde50bd1d5d0b9e9, + 0xd4ad2dbfc3d07787,0x955e4ec64b44e864, + 0x84ec3c97da624ab4,0xbd5af13bef0b113e, + 0xa6274bbdd0fadd61,0xecb1ad8aeacdd58e, + 0xcfb11ead453994ba,0x67de18eda5814af2, + 0x81ceb32c4b43fcf4,0x80eacf948770ced7, + 0xa2425ff75e14fc31,0xa1258379a94d028d, + 0xcad2f7f5359a3b3e,0x96ee45813a04330, + 0xfd87b5f28300ca0d,0x8bca9d6e188853fc, + 0x9e74d1b791e07e48,0x775ea264cf55347e, + 0xc612062576589dda,0x95364afe032a819e, + 0xf79687aed3eec551,0x3a83ddbd83f52205, + 0x9abe14cd44753b52,0xc4926a9672793543, + 0xc16d9a0095928a27,0x75b7053c0f178294, + 0xf1c90080baf72cb1,0x5324c68b12dd6339, + 0x971da05074da7bee,0xd3f6fc16ebca5e04, + 0xbce5086492111aea,0x88f4bb1ca6bcf585, + 0xec1e4a7db69561a5,0x2b31e9e3d06c32e6, + 0x9392ee8e921d5d07,0x3aff322e62439fd0, + 0xb877aa3236a4b449,0x9befeb9fad487c3, + 0xe69594bec44de15b,0x4c2ebe687989a9b4, + 0x901d7cf73ab0acd9,0xf9d37014bf60a11, + 0xb424dc35095cd80f,0x538484c19ef38c95, + 0xe12e13424bb40e13,0x2865a5f206b06fba, + 0x8cbccc096f5088cb,0xf93f87b7442e45d4, + 0xafebff0bcb24aafe,0xf78f69a51539d749, + 0xdbe6fecebdedd5be,0xb573440e5a884d1c, + 0x89705f4136b4a597,0x31680a88f8953031, + 0xabcc77118461cefc,0xfdc20d2b36ba7c3e, + 0xd6bf94d5e57a42bc,0x3d32907604691b4d, + 0x8637bd05af6c69b5,0xa63f9a49c2c1b110, + 0xa7c5ac471b478423,0xfcf80dc33721d54, + 0xd1b71758e219652b,0xd3c36113404ea4a9, + 0x83126e978d4fdf3b,0x645a1cac083126ea, + 0xa3d70a3d70a3d70a,0x3d70a3d70a3d70a4, + 0xcccccccccccccccc,0xcccccccccccccccd, + 0x8000000000000000,0x0, + 0xa000000000000000,0x0, + 0xc800000000000000,0x0, + 0xfa00000000000000,0x0, + 0x9c40000000000000,0x0, + 0xc350000000000000,0x0, + 0xf424000000000000,0x0, + 0x9896800000000000,0x0, + 0xbebc200000000000,0x0, + 0xee6b280000000000,0x0, + 0x9502f90000000000,0x0, + 0xba43b74000000000,0x0, + 0xe8d4a51000000000,0x0, + 0x9184e72a00000000,0x0, + 0xb5e620f480000000,0x0, + 0xe35fa931a0000000,0x0, + 0x8e1bc9bf04000000,0x0, + 0xb1a2bc2ec5000000,0x0, + 0xde0b6b3a76400000,0x0, + 0x8ac7230489e80000,0x0, + 0xad78ebc5ac620000,0x0, + 0xd8d726b7177a8000,0x0, + 0x878678326eac9000,0x0, + 0xa968163f0a57b400,0x0, + 0xd3c21bcecceda100,0x0, + 0x84595161401484a0,0x0, + 0xa56fa5b99019a5c8,0x0, + 0xcecb8f27f4200f3a,0x0, + 0x813f3978f8940984,0x4000000000000000, + 0xa18f07d736b90be5,0x5000000000000000, + 0xc9f2c9cd04674ede,0xa400000000000000, + 0xfc6f7c4045812296,0x4d00000000000000, + 0x9dc5ada82b70b59d,0xf020000000000000, + 0xc5371912364ce305,0x6c28000000000000, + 0xf684df56c3e01bc6,0xc732000000000000, + 0x9a130b963a6c115c,0x3c7f400000000000, + 0xc097ce7bc90715b3,0x4b9f100000000000, + 0xf0bdc21abb48db20,0x1e86d40000000000, + 0x96769950b50d88f4,0x1314448000000000, + 0xbc143fa4e250eb31,0x17d955a000000000, + 0xeb194f8e1ae525fd,0x5dcfab0800000000, + 0x92efd1b8d0cf37be,0x5aa1cae500000000, + 0xb7abc627050305ad,0xf14a3d9e40000000, + 0xe596b7b0c643c719,0x6d9ccd05d0000000, + 0x8f7e32ce7bea5c6f,0xe4820023a2000000, + 0xb35dbf821ae4f38b,0xdda2802c8a800000, + 0xe0352f62a19e306e,0xd50b2037ad200000, + 0x8c213d9da502de45,0x4526f422cc340000, + 0xaf298d050e4395d6,0x9670b12b7f410000, + 0xdaf3f04651d47b4c,0x3c0cdd765f114000, + 0x88d8762bf324cd0f,0xa5880a69fb6ac800, + 0xab0e93b6efee0053,0x8eea0d047a457a00, + 0xd5d238a4abe98068,0x72a4904598d6d880, + 0x85a36366eb71f041,0x47a6da2b7f864750, + 0xa70c3c40a64e6c51,0x999090b65f67d924, + 0xd0cf4b50cfe20765,0xfff4b4e3f741cf6d, + 0x82818f1281ed449f,0xbff8f10e7a8921a4, + 0xa321f2d7226895c7,0xaff72d52192b6a0d, + 0xcbea6f8ceb02bb39,0x9bf4f8a69f764490, + 0xfee50b7025c36a08,0x2f236d04753d5b4, + 0x9f4f2726179a2245,0x1d762422c946590, + 0xc722f0ef9d80aad6,0x424d3ad2b7b97ef5, + 0xf8ebad2b84e0d58b,0xd2e0898765a7deb2, + 0x9b934c3b330c8577,0x63cc55f49f88eb2f, + 0xc2781f49ffcfa6d5,0x3cbf6b71c76b25fb, + 0xf316271c7fc3908a,0x8bef464e3945ef7a, + 0x97edd871cfda3a56,0x97758bf0e3cbb5ac, + 0xbde94e8e43d0c8ec,0x3d52eeed1cbea317, + 0xed63a231d4c4fb27,0x4ca7aaa863ee4bdd, + 0x945e455f24fb1cf8,0x8fe8caa93e74ef6a, + 0xb975d6b6ee39e436,0xb3e2fd538e122b44, + 0xe7d34c64a9c85d44,0x60dbbca87196b616, + 0x90e40fbeea1d3a4a,0xbc8955e946fe31cd, + 0xb51d13aea4a488dd,0x6babab6398bdbe41, + 0xe264589a4dcdab14,0xc696963c7eed2dd1, + 0x8d7eb76070a08aec,0xfc1e1de5cf543ca2, + 0xb0de65388cc8ada8,0x3b25a55f43294bcb, + 0xdd15fe86affad912,0x49ef0eb713f39ebe, + 0x8a2dbf142dfcc7ab,0x6e3569326c784337, + 0xacb92ed9397bf996,0x49c2c37f07965404, + 0xd7e77a8f87daf7fb,0xdc33745ec97be906, + 0x86f0ac99b4e8dafd,0x69a028bb3ded71a3, + 0xa8acd7c0222311bc,0xc40832ea0d68ce0c, + 0xd2d80db02aabd62b,0xf50a3fa490c30190, + 0x83c7088e1aab65db,0x792667c6da79e0fa, + 0xa4b8cab1a1563f52,0x577001b891185938, + 0xcde6fd5e09abcf26,0xed4c0226b55e6f86, + 0x80b05e5ac60b6178,0x544f8158315b05b4, + 0xa0dc75f1778e39d6,0x696361ae3db1c721, + 0xc913936dd571c84c,0x3bc3a19cd1e38e9, + 0xfb5878494ace3a5f,0x4ab48a04065c723, + 0x9d174b2dcec0e47b,0x62eb0d64283f9c76, + 0xc45d1df942711d9a,0x3ba5d0bd324f8394, + 0xf5746577930d6500,0xca8f44ec7ee36479, + 0x9968bf6abbe85f20,0x7e998b13cf4e1ecb, + 0xbfc2ef456ae276e8,0x9e3fedd8c321a67e, + 0xefb3ab16c59b14a2,0xc5cfe94ef3ea101e, + 0x95d04aee3b80ece5,0xbba1f1d158724a12, + 0xbb445da9ca61281f,0x2a8a6e45ae8edc97, + 0xea1575143cf97226,0xf52d09d71a3293bd, + 0x924d692ca61be758,0x593c2626705f9c56, + 0xb6e0c377cfa2e12e,0x6f8b2fb00c77836c, + 0xe498f455c38b997a,0xb6dfb9c0f956447, + 0x8edf98b59a373fec,0x4724bd4189bd5eac, + 0xb2977ee300c50fe7,0x58edec91ec2cb657, + 0xdf3d5e9bc0f653e1,0x2f2967b66737e3ed, + 0x8b865b215899f46c,0xbd79e0d20082ee74, + 0xae67f1e9aec07187,0xecd8590680a3aa11, + 0xda01ee641a708de9,0xe80e6f4820cc9495, + 0x884134fe908658b2,0x3109058d147fdcdd, + 0xaa51823e34a7eede,0xbd4b46f0599fd415, + 0xd4e5e2cdc1d1ea96,0x6c9e18ac7007c91a, + 0x850fadc09923329e,0x3e2cf6bc604ddb0, + 0xa6539930bf6bff45,0x84db8346b786151c, + 0xcfe87f7cef46ff16,0xe612641865679a63, + 0x81f14fae158c5f6e,0x4fcb7e8f3f60c07e, + 0xa26da3999aef7749,0xe3be5e330f38f09d, + 0xcb090c8001ab551c,0x5cadf5bfd3072cc5, + 0xfdcb4fa002162a63,0x73d9732fc7c8f7f6, + 0x9e9f11c4014dda7e,0x2867e7fddcdd9afa, + 0xc646d63501a1511d,0xb281e1fd541501b8, + 0xf7d88bc24209a565,0x1f225a7ca91a4226, + 0x9ae757596946075f,0x3375788de9b06958, + 0xc1a12d2fc3978937,0x52d6b1641c83ae, + 0xf209787bb47d6b84,0xc0678c5dbd23a49a, + 0x9745eb4d50ce6332,0xf840b7ba963646e0, + 0xbd176620a501fbff,0xb650e5a93bc3d898, + 0xec5d3fa8ce427aff,0xa3e51f138ab4cebe, + 0x93ba47c980e98cdf,0xc66f336c36b10137, + 0xb8a8d9bbe123f017,0xb80b0047445d4184, + 0xe6d3102ad96cec1d,0xa60dc059157491e5, + 0x9043ea1ac7e41392,0x87c89837ad68db2f, + 0xb454e4a179dd1877,0x29babe4598c311fb, + 0xe16a1dc9d8545e94,0xf4296dd6fef3d67a, + 0x8ce2529e2734bb1d,0x1899e4a65f58660c, + 0xb01ae745b101e9e4,0x5ec05dcff72e7f8f, + 0xdc21a1171d42645d,0x76707543f4fa1f73, + 0x899504ae72497eba,0x6a06494a791c53a8, + 0xabfa45da0edbde69,0x487db9d17636892, + 0xd6f8d7509292d603,0x45a9d2845d3c42b6, + 0x865b86925b9bc5c2,0xb8a2392ba45a9b2, + 0xa7f26836f282b732,0x8e6cac7768d7141e, + 0xd1ef0244af2364ff,0x3207d795430cd926, + 0x8335616aed761f1f,0x7f44e6bd49e807b8, + 0xa402b9c5a8d3a6e7,0x5f16206c9c6209a6, + 0xcd036837130890a1,0x36dba887c37a8c0f, + 0x802221226be55a64,0xc2494954da2c9789, + 0xa02aa96b06deb0fd,0xf2db9baa10b7bd6c, + 0xc83553c5c8965d3d,0x6f92829494e5acc7, + 0xfa42a8b73abbf48c,0xcb772339ba1f17f9, + 0x9c69a97284b578d7,0xff2a760414536efb, + 0xc38413cf25e2d70d,0xfef5138519684aba, + 0xf46518c2ef5b8cd1,0x7eb258665fc25d69, + 0x98bf2f79d5993802,0xef2f773ffbd97a61, + 0xbeeefb584aff8603,0xaafb550ffacfd8fa, + 0xeeaaba2e5dbf6784,0x95ba2a53f983cf38, + 0x952ab45cfa97a0b2,0xdd945a747bf26183, + 0xba756174393d88df,0x94f971119aeef9e4, + 0xe912b9d1478ceb17,0x7a37cd5601aab85d, + 0x91abb422ccb812ee,0xac62e055c10ab33a, + 0xb616a12b7fe617aa,0x577b986b314d6009, + 0xe39c49765fdf9d94,0xed5a7e85fda0b80b, + 0x8e41ade9fbebc27d,0x14588f13be847307, + 0xb1d219647ae6b31c,0x596eb2d8ae258fc8, + 0xde469fbd99a05fe3,0x6fca5f8ed9aef3bb, + 0x8aec23d680043bee,0x25de7bb9480d5854, + 0xada72ccc20054ae9,0xaf561aa79a10ae6a, + 0xd910f7ff28069da4,0x1b2ba1518094da04, + 0x87aa9aff79042286,0x90fb44d2f05d0842, + 0xa99541bf57452b28,0x353a1607ac744a53, + 0xd3fa922f2d1675f2,0x42889b8997915ce8, + 0x847c9b5d7c2e09b7,0x69956135febada11, + 0xa59bc234db398c25,0x43fab9837e699095, + 0xcf02b2c21207ef2e,0x94f967e45e03f4bb, + 0x8161afb94b44f57d,0x1d1be0eebac278f5, + 0xa1ba1ba79e1632dc,0x6462d92a69731732, + 0xca28a291859bbf93,0x7d7b8f7503cfdcfe, + 0xfcb2cb35e702af78,0x5cda735244c3d43e, + 0x9defbf01b061adab,0x3a0888136afa64a7, + 0xc56baec21c7a1916,0x88aaa1845b8fdd0, + 0xf6c69a72a3989f5b,0x8aad549e57273d45, + 0x9a3c2087a63f6399,0x36ac54e2f678864b, + 0xc0cb28a98fcf3c7f,0x84576a1bb416a7dd, + 0xf0fdf2d3f3c30b9f,0x656d44a2a11c51d5, + 0x969eb7c47859e743,0x9f644ae5a4b1b325, + 0xbc4665b596706114,0x873d5d9f0dde1fee, + 0xeb57ff22fc0c7959,0xa90cb506d155a7ea, + 0x9316ff75dd87cbd8,0x9a7f12442d588f2, + 0xb7dcbf5354e9bece,0xc11ed6d538aeb2f, + 0xe5d3ef282a242e81,0x8f1668c8a86da5fa, + 0x8fa475791a569d10,0xf96e017d694487bc, + 0xb38d92d760ec4455,0x37c981dcc395a9ac, + 0xe070f78d3927556a,0x85bbe253f47b1417, + 0x8c469ab843b89562,0x93956d7478ccec8e, + 0xaf58416654a6babb,0x387ac8d1970027b2, + 0xdb2e51bfe9d0696a,0x6997b05fcc0319e, + 0x88fcf317f22241e2,0x441fece3bdf81f03, + 0xab3c2fddeeaad25a,0xd527e81cad7626c3, + 0xd60b3bd56a5586f1,0x8a71e223d8d3b074, + 0x85c7056562757456,0xf6872d5667844e49, + 0xa738c6bebb12d16c,0xb428f8ac016561db, + 0xd106f86e69d785c7,0xe13336d701beba52, + 0x82a45b450226b39c,0xecc0024661173473, + 0xa34d721642b06084,0x27f002d7f95d0190, + 0xcc20ce9bd35c78a5,0x31ec038df7b441f4, + 0xff290242c83396ce,0x7e67047175a15271, + 0x9f79a169bd203e41,0xf0062c6e984d386, + 0xc75809c42c684dd1,0x52c07b78a3e60868, + 0xf92e0c3537826145,0xa7709a56ccdf8a82, + 0x9bbcc7a142b17ccb,0x88a66076400bb691, + 0xc2abf989935ddbfe,0x6acff893d00ea435, + 0xf356f7ebf83552fe,0x583f6b8c4124d43, + 0x98165af37b2153de,0xc3727a337a8b704a, + 0xbe1bf1b059e9a8d6,0x744f18c0592e4c5c, + 0xeda2ee1c7064130c,0x1162def06f79df73, + 0x9485d4d1c63e8be7,0x8addcb5645ac2ba8, + 0xb9a74a0637ce2ee1,0x6d953e2bd7173692, + 0xe8111c87c5c1ba99,0xc8fa8db6ccdd0437, + 0x910ab1d4db9914a0,0x1d9c9892400a22a2, + 0xb54d5e4a127f59c8,0x2503beb6d00cab4b, + 0xe2a0b5dc971f303a,0x2e44ae64840fd61d, + 0x8da471a9de737e24,0x5ceaecfed289e5d2, + 0xb10d8e1456105dad,0x7425a83e872c5f47, + 0xdd50f1996b947518,0xd12f124e28f77719, + 0x8a5296ffe33cc92f,0x82bd6b70d99aaa6f, + 0xace73cbfdc0bfb7b,0x636cc64d1001550b, + 0xd8210befd30efa5a,0x3c47f7e05401aa4e, + 0x8714a775e3e95c78,0x65acfaec34810a71, + 0xa8d9d1535ce3b396,0x7f1839a741a14d0d, + 0xd31045a8341ca07c,0x1ede48111209a050, + 0x83ea2b892091e44d,0x934aed0aab460432, + 0xa4e4b66b68b65d60,0xf81da84d5617853f, + 0xce1de40642e3f4b9,0x36251260ab9d668e, + 0x80d2ae83e9ce78f3,0xc1d72b7c6b426019, + 0xa1075a24e4421730,0xb24cf65b8612f81f, + 0xc94930ae1d529cfc,0xdee033f26797b627, + 0xfb9b7cd9a4a7443c,0x169840ef017da3b1, + 0x9d412e0806e88aa5,0x8e1f289560ee864e, + 0xc491798a08a2ad4e,0xf1a6f2bab92a27e2, + 0xf5b5d7ec8acb58a2,0xae10af696774b1db, + 0x9991a6f3d6bf1765,0xacca6da1e0a8ef29, + 0xbff610b0cc6edd3f,0x17fd090a58d32af3, + 0xeff394dcff8a948e,0xddfc4b4cef07f5b0, + 0x95f83d0a1fb69cd9,0x4abdaf101564f98e, + 0xbb764c4ca7a4440f,0x9d6d1ad41abe37f1, + 0xea53df5fd18d5513,0x84c86189216dc5ed, + 0x92746b9be2f8552c,0x32fd3cf5b4e49bb4, + 0xb7118682dbb66a77,0x3fbc8c33221dc2a1, + 0xe4d5e82392a40515,0xfabaf3feaa5334a, + 0x8f05b1163ba6832d,0x29cb4d87f2a7400e, + 0xb2c71d5bca9023f8,0x743e20e9ef511012, + 0xdf78e4b2bd342cf6,0x914da9246b255416, + 0x8bab8eefb6409c1a,0x1ad089b6c2f7548e, + 0xae9672aba3d0c320,0xa184ac2473b529b1, + 0xda3c0f568cc4f3e8,0xc9e5d72d90a2741e, + 0x8865899617fb1871,0x7e2fa67c7a658892, + 0xaa7eebfb9df9de8d,0xddbb901b98feeab7, + 0xd51ea6fa85785631,0x552a74227f3ea565, + 0x8533285c936b35de,0xd53a88958f87275f, + 0xa67ff273b8460356,0x8a892abaf368f137, + 0xd01fef10a657842c,0x2d2b7569b0432d85, + 0x8213f56a67f6b29b,0x9c3b29620e29fc73, + 0xa298f2c501f45f42,0x8349f3ba91b47b8f, + 0xcb3f2f7642717713,0x241c70a936219a73, + 0xfe0efb53d30dd4d7,0xed238cd383aa0110, + 0x9ec95d1463e8a506,0xf4363804324a40aa, + 0xc67bb4597ce2ce48,0xb143c6053edcd0d5, + 0xf81aa16fdc1b81da,0xdd94b7868e94050a, + 0x9b10a4e5e9913128,0xca7cf2b4191c8326, + 0xc1d4ce1f63f57d72,0xfd1c2f611f63a3f0, + 0xf24a01a73cf2dccf,0xbc633b39673c8cec, + 0x976e41088617ca01,0xd5be0503e085d813, + 0xbd49d14aa79dbc82,0x4b2d8644d8a74e18, + 0xec9c459d51852ba2,0xddf8e7d60ed1219e, + 0x93e1ab8252f33b45,0xcabb90e5c942b503, + 0xb8da1662e7b00a17,0x3d6a751f3b936243, + 0xe7109bfba19c0c9d,0xcc512670a783ad4, + 0x906a617d450187e2,0x27fb2b80668b24c5, + 0xb484f9dc9641e9da,0xb1f9f660802dedf6, + 0xe1a63853bbd26451,0x5e7873f8a0396973, + 0x8d07e33455637eb2,0xdb0b487b6423e1e8, + 0xb049dc016abc5e5f,0x91ce1a9a3d2cda62, + 0xdc5c5301c56b75f7,0x7641a140cc7810fb, + 0x89b9b3e11b6329ba,0xa9e904c87fcb0a9d, + 0xac2820d9623bf429,0x546345fa9fbdcd44, + 0xd732290fbacaf133,0xa97c177947ad4095, + 0x867f59a9d4bed6c0,0x49ed8eabcccc485d, + 0xa81f301449ee8c70,0x5c68f256bfff5a74, + 0xd226fc195c6a2f8c,0x73832eec6fff3111, + 0x83585d8fd9c25db7,0xc831fd53c5ff7eab, + 0xa42e74f3d032f525,0xba3e7ca8b77f5e55, + 0xcd3a1230c43fb26f,0x28ce1bd2e55f35eb, + 0x80444b5e7aa7cf85,0x7980d163cf5b81b3, + 0xa0555e361951c366,0xd7e105bcc332621f, + 0xc86ab5c39fa63440,0x8dd9472bf3fefaa7, + 0xfa856334878fc150,0xb14f98f6f0feb951, + 0x9c935e00d4b9d8d2,0x6ed1bf9a569f33d3, + 0xc3b8358109e84f07,0xa862f80ec4700c8, + 0xf4a642e14c6262c8,0xcd27bb612758c0fa, + 0x98e7e9cccfbd7dbd,0x8038d51cb897789c, + 0xbf21e44003acdd2c,0xe0470a63e6bd56c3, + 0xeeea5d5004981478,0x1858ccfce06cac74, + 0x95527a5202df0ccb,0xf37801e0c43ebc8, + 0xbaa718e68396cffd,0xd30560258f54e6ba, + 0xe950df20247c83fd,0x47c6b82ef32a2069, + 0x91d28b7416cdd27e,0x4cdc331d57fa5441, + 0xb6472e511c81471d,0xe0133fe4adf8e952, + 0xe3d8f9e563a198e5,0x58180fddd97723a6, + 0x8e679c2f5e44ff8f,0x570f09eaa7ea7648,}; +}; + +template +constexpr uint64_t powers_template::power_of_five_128[number_of_entries]; + +using powers = powers_template<>; + +}}}}}} // namespace fast_float + +#endif diff --git a/include/boost/json/detail/charconv/detail/fast_float/float_common.hpp b/include/boost/json/detail/charconv/detail/fast_float/float_common.hpp new file mode 100644 index 00000000..5c3a9ac0 --- /dev/null +++ b/include/boost/json/detail/charconv/detail/fast_float/float_common.hpp @@ -0,0 +1,560 @@ +// Copyright 2020-2023 Daniel Lemire +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt +// +// Derivative of: https://github.com/fastfloat/fast_float + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_FLOAT_COMMON_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_FLOAT_COMMON_HPP + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +namespace boost { namespace json { namespace detail { namespace charconv { namespace detail { namespace fast_float { + + +template +struct parse_options_t { + constexpr explicit parse_options_t(chars_format fmt = chars_format::general, + UC dot = UC('.')) + : format(fmt), decimal_point(dot) {} + + /** Which number formats are accepted */ + chars_format format; + /** The character used as decimal point */ + UC decimal_point; +}; +using parse_options = parse_options_t; + +}}}}}} + +#ifdef BOOST_JSON_HAS_BIT_CAST +#include +#endif + +#if (defined(__x86_64) || defined(__x86_64__) || defined(_M_X64) \ + || defined(__amd64) || defined(__aarch64__) || defined(_M_ARM64) \ + || defined(__MINGW64__) \ + || defined(__s390x__) \ + || (defined(__ppc64__) || defined(__PPC64__) || defined(__ppc64le__) || defined(__PPC64LE__)) ) +#define BOOST_JSON_FASTFLOAT_64BIT 1 +#elif (defined(__i386) || defined(__i386__) || defined(_M_IX86) \ + || defined(__arm__) || defined(_M_ARM) || defined(__ppc__) \ + || defined(__MINGW32__) || defined(__EMSCRIPTEN__)) +#define BOOST_JSON_FASTFLOAT_32BIT 1 +#else + // Need to check incrementally, since SIZE_MAX is a size_t, avoid overflow. + // We can never tell the register width, but the SIZE_MAX is a good approximation. + // UINTPTR_MAX and INTPTR_MAX are optional, so avoid them for max portability. + #if SIZE_MAX == 0xffff + #error Unknown platform (16-bit, unsupported) + #elif SIZE_MAX == 0xffffffff + #define BOOST_JSON_FASTFLOAT_32BIT 1 + #elif SIZE_MAX == 0xffffffffffffffff + #define BOOST_JSON_FASTFLOAT_64BIT 1 + #else + #error Unknown platform (not 32-bit, not 64-bit?) + #endif +#endif + +#if ((defined(_WIN32) || defined(_WIN64)) && !defined(__clang__)) +#include +#endif + +#if defined(_MSC_VER) && !defined(__clang__) +#define BOOST_JSON_FASTFLOAT_VISUAL_STUDIO 1 +#endif + +// rust style `try!()` macro, or `?` operator +#define BOOST_JSON_FASTFLOAT_TRY(x) { if (!(x)) return false; } + +namespace boost { namespace json { namespace detail { namespace charconv { namespace detail { namespace fast_float { + +BOOST_FORCEINLINE constexpr bool cpp20_and_in_constexpr() { +#ifdef BOOST_JSON_HAS_IS_CONSTANT_EVALUATED + return std::is_constant_evaluated(); +#else + return false; +#endif +} + +// Compares two ASCII strings in a case insensitive manner. +template +inline BOOST_JSON_CXX14_CONSTEXPR_NO_INLINE bool +fastfloat_strncasecmp(UC const * input1, UC const * input2, size_t length) { + char running_diff{0}; + for (size_t i = 0; i < length; ++i) { + running_diff |= (char(input1[i]) ^ char(input2[i])); + } + return (running_diff == 0) || (running_diff == 32); +} + +#ifndef FLT_EVAL_METHOD +#error "FLT_EVAL_METHOD should be defined, please include cfloat." +#endif + +// a pointer and a length to a contiguous block of memory +template +struct span { + const T* ptr; + size_t length; + constexpr span(const T* _ptr, size_t _length) : ptr(_ptr), length(_length) {} + constexpr span() : ptr(nullptr), length(0) {} + + constexpr size_t len() const noexcept { + return length; + } + + BOOST_JSON_CXX14_CONSTEXPR const T& operator[](size_t index) const noexcept { + BOOST_ASSERT(index < length); + return ptr[index]; + } +}; + +struct value128 { + uint64_t low; + uint64_t high; + constexpr value128(uint64_t _low, uint64_t _high) : low(_low), high(_high) {} + constexpr value128() : low(0), high(0) {} +}; + +/* Helper C++11 constexpr generic implementation of leading_zeroes */ +BOOST_FORCEINLINE constexpr +int leading_zeroes_generic(uint64_t input_num, int last_bit = 0) { + return ( + ((input_num & uint64_t(0xffffffff00000000)) && (input_num >>= 32, last_bit |= 32)), + ((input_num & uint64_t( 0xffff0000)) && (input_num >>= 16, last_bit |= 16)), + ((input_num & uint64_t( 0xff00)) && (input_num >>= 8, last_bit |= 8)), + ((input_num & uint64_t( 0xf0)) && (input_num >>= 4, last_bit |= 4)), + ((input_num & uint64_t( 0xc)) && (input_num >>= 2, last_bit |= 2)), + ((input_num & uint64_t( 0x2)) && (input_num >>= 1, last_bit |= 1)), + 63 - last_bit + ); +} + +/* result might be undefined when input_num is zero */ +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +int leading_zeroes(uint64_t input_num) { + assert(input_num > 0); + if (cpp20_and_in_constexpr()) { + return leading_zeroes_generic(input_num); + } +#ifdef BOOST_JSON_FASTFLOAT_VISUAL_STUDIO + #if defined(_M_X64) || defined(_M_ARM64) + unsigned long leading_zero = 0; + // Search the mask data from most significant bit (MSB) + // to least significant bit (LSB) for a set bit (1). + _BitScanReverse64(&leading_zero, input_num); + return (int)(63 - leading_zero); + #else + return leading_zeroes_generic(input_num); + #endif +#else + return __builtin_clzll(input_num); +#endif +} + +// slow emulation routine for 32-bit +BOOST_FORCEINLINE constexpr uint64_t emulu(uint32_t x, uint32_t y) { + return x * (uint64_t)y; +} + +BOOST_FORCEINLINE BOOST_JSON_CXX14_CONSTEXPR_NO_INLINE +uint64_t umul128_generic(uint64_t ab, uint64_t cd, uint64_t *hi) { + uint64_t ad = emulu((uint32_t)(ab >> 32), (uint32_t)cd); + uint64_t bd = emulu((uint32_t)ab, (uint32_t)cd); + uint64_t adbc = ad + emulu((uint32_t)ab, (uint32_t)(cd >> 32)); + uint64_t adbc_carry = !!(adbc < ad); + uint64_t lo = bd + (adbc << 32); + *hi = emulu((uint32_t)(ab >> 32), (uint32_t)(cd >> 32)) + (adbc >> 32) + + (adbc_carry << 32) + !!(lo < bd); + return lo; +} + +#ifdef BOOST_JSON_FASTFLOAT_32BIT + +// slow emulation routine for 32-bit +#if !defined(__MINGW64__) +BOOST_FORCEINLINE BOOST_JSON_CXX14_CONSTEXPR_NO_INLINE +uint64_t _umul128(uint64_t ab, uint64_t cd, uint64_t *hi) { + return umul128_generic(ab, cd, hi); +} +#endif // !__MINGW64__ + +#endif // BOOST_JSON_FASTFLOAT_32BIT + + +// compute 64-bit a*b +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +value128 full_multiplication(uint64_t a, uint64_t b) { + if (cpp20_and_in_constexpr()) { + value128 answer; + answer.low = umul128_generic(a, b, &answer.high); + return answer; + } + value128 answer; +#if defined(_M_ARM64) && !defined(__MINGW32__) + // ARM64 has native support for 64-bit multiplications, no need to emulate + // But MinGW on ARM64 doesn't have native support for 64-bit multiplications + answer.high = __umulh(a, b); + answer.low = a * b; +#elif defined(BOOST_JSON_FASTFLOAT_32BIT) || (defined(_WIN64) && !defined(__clang__)) + answer.low = _umul128(a, b, &answer.high); // _umul128 not available on ARM64 +#elif defined(BOOST_JSON_FASTFLOAT_64BIT) + __uint128_t r = ((__uint128_t)a) * b; + answer.low = uint64_t(r); + answer.high = uint64_t(r >> 64); +#else + answer.low = umul128_generic(a, b, &answer.high); +#endif + return answer; +} + +struct adjusted_mantissa { + uint64_t mantissa{0}; + int32_t power2{0}; // a negative value indicates an invalid result + adjusted_mantissa() = default; + constexpr bool operator==(const adjusted_mantissa &o) const { + return mantissa == o.mantissa && power2 == o.power2; + } + constexpr bool operator!=(const adjusted_mantissa &o) const { + return mantissa != o.mantissa || power2 != o.power2; + } +}; + +// Bias so we can get the real exponent with an invalid adjusted_mantissa. +constexpr static int32_t invalid_am_bias = -0x8000; + +// used for binary_format_lookup_tables::max_mantissa +constexpr uint64_t constant_55555 = 5 * 5 * 5 * 5 * 5; + +template +struct binary_format_lookup_tables; + +template struct binary_format : binary_format_lookup_tables { + using equiv_uint = typename std::conditional::type; + + static inline constexpr int mantissa_explicit_bits(); + static inline constexpr int minimum_exponent(); + static inline constexpr int infinite_power(); + static inline constexpr int sign_index(); + static inline constexpr int min_exponent_fast_path(); // used when fegetround() == FE_TONEAREST + static inline constexpr int max_exponent_fast_path(); + static inline constexpr int max_exponent_round_to_even(); + static inline constexpr int min_exponent_round_to_even(); + static inline constexpr uint64_t max_mantissa_fast_path(int64_t power); + static inline constexpr uint64_t max_mantissa_fast_path(); // used when fegetround() == FE_TONEAREST + static inline constexpr int largest_power_of_ten(); + static inline constexpr int smallest_power_of_ten(); + static inline constexpr T exact_power_of_ten(int64_t power); + static inline constexpr size_t max_digits(); + static inline constexpr equiv_uint exponent_mask(); + static inline constexpr equiv_uint mantissa_mask(); + static inline constexpr equiv_uint hidden_bit_mask(); +}; + +template +struct binary_format_lookup_tables { + static constexpr double powers_of_ten[] = { + 1e0, 1e1, 1e2, 1e3, 1e4, 1e5, 1e6, 1e7, 1e8, 1e9, 1e10, 1e11, + 1e12, 1e13, 1e14, 1e15, 1e16, 1e17, 1e18, 1e19, 1e20, 1e21, 1e22}; + + // Largest integer value v so that (5**index * v) <= 1<<53. + // 0x10000000000000 == 1 << 53 + static constexpr std::uint64_t max_mantissa[] = { + UINT64_C(0x10000000000000), + UINT64_C(0x10000000000000) / UINT64_C(5), + UINT64_C(0x10000000000000) / (UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x10000000000000) / (UINT64_C(5) * UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x10000000000000) / (UINT64_C(5) * UINT64_C(5) * UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x10000000000000) / (constant_55555), + UINT64_C(0x10000000000000) / (constant_55555 * UINT64_C(5)), + UINT64_C(0x10000000000000) / (constant_55555 * UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x10000000000000) / (constant_55555 * UINT64_C(5) * UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x10000000000000) / (constant_55555 * UINT64_C(5) * UINT64_C(5) * UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x10000000000000) / (constant_55555 * constant_55555), + UINT64_C(0x10000000000000) / (constant_55555 * constant_55555 * UINT64_C(5)), + UINT64_C(0x10000000000000) / (constant_55555 * constant_55555 * UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x10000000000000) / (constant_55555 * constant_55555 * UINT64_C(5) * UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x10000000000000) / (constant_55555 * constant_55555 * constant_55555), + UINT64_C(0x10000000000000) / (constant_55555 * constant_55555 * constant_55555 * UINT64_C(5)), + UINT64_C(0x10000000000000) / (constant_55555 * constant_55555 * constant_55555 * UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x10000000000000) / (constant_55555 * constant_55555 * constant_55555 * UINT64_C(5) * UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x10000000000000) / (constant_55555 * constant_55555 * constant_55555 * UINT64_C(5) * UINT64_C(5) * UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x10000000000000) / (constant_55555 * constant_55555 * constant_55555 * constant_55555), + UINT64_C(0x10000000000000) / (constant_55555 * constant_55555 * constant_55555 * constant_55555 * UINT64_C(5)), + UINT64_C(0x10000000000000) / (constant_55555 * constant_55555 * constant_55555 * constant_55555 * UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x10000000000000) / (constant_55555 * constant_55555 * constant_55555 * constant_55555 * UINT64_C(5) * UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x10000000000000) / (constant_55555 * constant_55555 * constant_55555 * constant_55555 * UINT64_C(5) * UINT64_C(5) * UINT64_C(5) * UINT64_C(5))}; +}; + +template +constexpr double binary_format_lookup_tables::powers_of_ten[]; + +template +constexpr uint64_t binary_format_lookup_tables::max_mantissa[]; + +template +struct binary_format_lookup_tables { + static constexpr float powers_of_ten[] = {1e0f, 1e1f, 1e2f, 1e3f, 1e4f, 1e5f, + 1e6f, 1e7f, 1e8f, 1e9f, 1e10f}; + + // Largest integer value v so that (5**index * v) <= 1<<24. + // 0x1000000 == 1<<24 + static constexpr uint64_t max_mantissa[] = { + UINT64_C(0x1000000), + UINT64_C(0x1000000) / UINT64_C(5), + UINT64_C(0x1000000) / (UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x1000000) / (UINT64_C(5) * UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x1000000) / (UINT64_C(5) * UINT64_C(5) * UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x1000000) / (constant_55555), + UINT64_C(0x1000000) / (constant_55555 * UINT64_C(5)), + UINT64_C(0x1000000) / (constant_55555 * UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x1000000) / (constant_55555 * UINT64_C(5) * UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x1000000) / (constant_55555 * UINT64_C(5) * UINT64_C(5) * UINT64_C(5) * UINT64_C(5)), + UINT64_C(0x1000000) / (constant_55555 * constant_55555), + UINT64_C(0x1000000) / (constant_55555 * constant_55555 * UINT64_C(5))}; +}; + +template +constexpr float binary_format_lookup_tables::powers_of_ten[]; + +template +constexpr uint64_t binary_format_lookup_tables::max_mantissa[]; + +template <> inline constexpr int binary_format::min_exponent_fast_path() { +#if (FLT_EVAL_METHOD != 1) && (FLT_EVAL_METHOD != 0) + return 0; +#else + return -22; +#endif +} + +template <> inline constexpr int binary_format::min_exponent_fast_path() { +#if (FLT_EVAL_METHOD != 1) && (FLT_EVAL_METHOD != 0) + return 0; +#else + return -10; +#endif +} + +template <> inline constexpr int binary_format::mantissa_explicit_bits() { + return 52; +} +template <> inline constexpr int binary_format::mantissa_explicit_bits() { + return 23; +} + +template <> inline constexpr int binary_format::max_exponent_round_to_even() { + return 23; +} + +template <> inline constexpr int binary_format::max_exponent_round_to_even() { + return 10; +} + +template <> inline constexpr int binary_format::min_exponent_round_to_even() { + return -4; +} + +template <> inline constexpr int binary_format::min_exponent_round_to_even() { + return -17; +} + +template <> inline constexpr int binary_format::minimum_exponent() { + return -1023; +} +template <> inline constexpr int binary_format::minimum_exponent() { + return -127; +} + +template <> inline constexpr int binary_format::infinite_power() { + return 0x7FF; +} +template <> inline constexpr int binary_format::infinite_power() { + return 0xFF; +} + +template <> inline constexpr int binary_format::sign_index() { return 63; } +template <> inline constexpr int binary_format::sign_index() { return 31; } + +template <> inline constexpr int binary_format::max_exponent_fast_path() { + return 22; +} +template <> inline constexpr int binary_format::max_exponent_fast_path() { + return 10; +} + +template <> inline constexpr uint64_t binary_format::max_mantissa_fast_path() { + return uint64_t(2) << mantissa_explicit_bits(); +} +template <> inline constexpr uint64_t binary_format::max_mantissa_fast_path(int64_t power) { + // caller is responsible to ensure that + // power >= 0 && power <= 22 + // + // Work around clang bug https://godbolt.org/z/zedh7rrhc + return (void)max_mantissa[0], max_mantissa[power]; +} +template <> inline constexpr uint64_t binary_format::max_mantissa_fast_path() { + return uint64_t(2) << mantissa_explicit_bits(); +} +template <> inline constexpr uint64_t binary_format::max_mantissa_fast_path(int64_t power) { + // caller is responsible to ensure that + // power >= 0 && power <= 10 + // + // Work around clang bug https://godbolt.org/z/zedh7rrhc + return (void)max_mantissa[0], max_mantissa[power]; +} + +template <> +inline constexpr double binary_format::exact_power_of_ten(int64_t power) { + // Work around clang bug https://godbolt.org/z/zedh7rrhc + return (void)powers_of_ten[0], powers_of_ten[power]; +} +template <> +inline constexpr float binary_format::exact_power_of_ten(int64_t power) { + // Work around clang bug https://godbolt.org/z/zedh7rrhc + return (void)powers_of_ten[0], powers_of_ten[power]; +} + + +template <> +inline constexpr int binary_format::largest_power_of_ten() { + return 308; +} +template <> +inline constexpr int binary_format::largest_power_of_ten() { + return 38; +} + +template <> +inline constexpr int binary_format::smallest_power_of_ten() { + return -342; +} +template <> +inline constexpr int binary_format::smallest_power_of_ten() { + return -65; +} + +template <> inline constexpr size_t binary_format::max_digits() { + return 769; +} +template <> inline constexpr size_t binary_format::max_digits() { + return 114; +} + +template <> inline constexpr binary_format::equiv_uint + binary_format::exponent_mask() { + return 0x7F800000; +} +template <> inline constexpr binary_format::equiv_uint + binary_format::exponent_mask() { + return 0x7FF0000000000000; +} + +template <> inline constexpr binary_format::equiv_uint + binary_format::mantissa_mask() { + return 0x007FFFFF; +} +template <> inline constexpr binary_format::equiv_uint + binary_format::mantissa_mask() { + return 0x000FFFFFFFFFFFFF; +} + +template <> inline constexpr binary_format::equiv_uint + binary_format::hidden_bit_mask() { + return 0x00800000; +} +template <> inline constexpr binary_format::equiv_uint + binary_format::hidden_bit_mask() { + return 0x0010000000000000; +} + +template +BOOST_FORCEINLINE BOOST_JSON_FASTFLOAT_CONSTEXPR20 +void to_float(bool negative, adjusted_mantissa am, T &value) { + using uint = typename binary_format::equiv_uint; + uint word = (uint)am.mantissa; + word |= uint(am.power2) << binary_format::mantissa_explicit_bits(); + word |= uint(negative) << binary_format::sign_index(); +#ifdef BOOST_JSON_HAS_BIT_CAST + value = std::bit_cast(word); +#else + ::memcpy(&value, &word, sizeof(T)); +#endif +} + +template +static constexpr uint64_t int_cmp_zeros() +{ + static_assert((sizeof(UC) == 1) || (sizeof(UC) == 2) || (sizeof(UC) == 4), "Unsupported character size"); + return (sizeof(UC) == 1) ? 0x3030303030303030 : (sizeof(UC) == 2) ? (uint64_t(UC('0')) << 48 | uint64_t(UC('0')) << 32 | uint64_t(UC('0')) << 16 | UC('0')) : (uint64_t(UC('0')) << 32 | UC('0')); +} +template +static constexpr int int_cmp_len() +{ + return sizeof(uint64_t) / sizeof(UC); +} +template +static constexpr UC const * str_const_nan() +{ + return nullptr; +} +template<> +constexpr char const * str_const_nan() +{ + return "nan"; +} +template<> +constexpr wchar_t const * str_const_nan() +{ + return L"nan"; +} +template<> +constexpr char16_t const * str_const_nan() +{ + return u"nan"; +} +template<> +constexpr char32_t const * str_const_nan() +{ + return U"nan"; +} +template +static constexpr UC const * str_const_inf() +{ + return nullptr; +} +template<> +constexpr char const * str_const_inf() +{ + return "infinity"; +} +template<> +constexpr wchar_t const * str_const_inf() +{ + return L"infinity"; +} +template<> +constexpr char16_t const * str_const_inf() +{ + return u"infinity"; +} +template<> +constexpr char32_t const * str_const_inf() +{ + return U"infinity"; +} + +}}}}}} // namespaces + +#endif diff --git a/include/boost/json/detail/charconv/detail/fast_float/parse_number.hpp b/include/boost/json/detail/charconv/detail/fast_float/parse_number.hpp new file mode 100644 index 00000000..a4944a28 --- /dev/null +++ b/include/boost/json/detail/charconv/detail/fast_float/parse_number.hpp @@ -0,0 +1,237 @@ +// Copyright 2020-2023 Daniel Lemire +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt +// +// Derivative of: https://github.com/fastfloat/fast_float + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_PARSE_NUMBER_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_FASTFLOAT_PARSE_NUMBER_HPP + +#include +#include +#include +#include + +#include +#include +#include +#include + +namespace boost { namespace json { namespace detail { namespace charconv { namespace detail { namespace fast_float { + + +namespace detail { +/** + * Special case +inf, -inf, nan, infinity, -infinity. + * The case comparisons could be made much faster given that we know that the + * strings a null-free and fixed. + **/ + +#if defined(__GNUC__) && __GNUC__ < 5 && !defined(__clang__) +# pragma GCC diagnostic push +# pragma GCC diagnostic ignored "-Wmissing-field-initializers" +#endif + +template +from_chars_result_t BOOST_JSON_CXX14_CONSTEXPR +parse_infnan(UC const * first, UC const * last, T &value) noexcept { + from_chars_result_t answer{}; + answer.ptr = first; + answer.ec = std::errc(); // be optimistic + bool minusSign = false; + if (*first == UC('-')) { // assume first < last, so dereference without checks; C++17 20.19.3.(7.1) explicitly forbids '+' here + minusSign = true; + ++first; + } + if (last - first >= 3) { + if (fastfloat_strncasecmp(first, str_const_nan(), 3)) { + answer.ptr = (first += 3); + value = minusSign ? -std::numeric_limits::quiet_NaN() : std::numeric_limits::quiet_NaN(); + // Check for possible nan(n-char-seq-opt), C++17 20.19.3.7, C11 7.20.1.3.3. At least MSVC produces nan(ind) and nan(snan). + if(first != last && *first == UC('(')) { + for(UC const * ptr = first + 1; ptr != last; ++ptr) { + if (*ptr == UC(')')) { + answer.ptr = ptr + 1; // valid nan(n-char-seq-opt) + break; + } + else if(!((UC('a') <= *ptr && *ptr <= UC('z')) || (UC('A') <= *ptr && *ptr <= UC('Z')) || (UC('0') <= *ptr && *ptr <= UC('9')) || *ptr == UC('_'))) + break; // forbidden char, not nan(n-char-seq-opt) + } + } + return answer; + } + if (fastfloat_strncasecmp(first, str_const_inf(), 3)) { + if ((last - first >= 8) && fastfloat_strncasecmp(first + 3, str_const_inf() + 3, 5)) { + answer.ptr = first + 8; + } else { + answer.ptr = first + 3; + } + value = minusSign ? -std::numeric_limits::infinity() : std::numeric_limits::infinity(); + return answer; + } + } + answer.ec = std::errc::invalid_argument; + return answer; +} + +#if defined(__GNUC__) && __GNUC__ < 5 && !defined(__clang__) +# pragma GCC diagnostic pop +#endif + +/** + * Returns true if the floating-pointing rounding mode is to 'nearest'. + * It is the default on most system. This function is meant to be inexpensive. + * Credit : @mwalcott3 + */ +BOOST_FORCEINLINE bool rounds_to_nearest() noexcept { + // https://lemire.me/blog/2020/06/26/gcc-not-nearest/ +#if (FLT_EVAL_METHOD != 1) && (FLT_EVAL_METHOD != 0) + return false; +#endif + // See + // A fast function to check your floating-point rounding mode + // https://lemire.me/blog/2022/11/16/a-fast-function-to-check-your-floating-point-rounding-mode/ + // + // This function is meant to be equivalent to : + // prior: #include + // return fegetround() == FE_TONEAREST; + // However, it is expected to be much faster than the fegetround() + // function call. + // + // The volatile keywoard prevents the compiler from computing the function + // at compile-time. + // There might be other ways to prevent compile-time optimizations (e.g., asm). + // The value does not need to be std::numeric_limits::min(), any small + // value so that 1 + x should round to 1 would do (after accounting for excess + // precision, as in 387 instructions). + static volatile float fmin = (std::numeric_limits::min)(); + float fmini = fmin; // we copy it so that it gets loaded at most once. + // + // Explanation: + // Only when fegetround() == FE_TONEAREST do we have that + // fmin + 1.0f == 1.0f - fmin. + // + // FE_UPWARD: + // fmin + 1.0f > 1 + // 1.0f - fmin == 1 + // + // FE_DOWNWARD or FE_TOWARDZERO: + // fmin + 1.0f == 1 + // 1.0f - fmin < 1 + // + // Note: This may fail to be accurate if fast-math has been + // enabled, as rounding conventions may not apply. + #ifdef BOOST_JSON_FASTFLOAT_VISUAL_STUDIO + # pragma warning(push) + // todo: is there a VS warning? + // see https://stackoverflow.com/questions/46079446/is-there-a-warning-for-floating-point-equality-checking-in-visual-studio-2013 + #elif defined(__clang__) + # pragma clang diagnostic push + # pragma clang diagnostic ignored "-Wfloat-equal" + #elif defined(__GNUC__) + # pragma GCC diagnostic push + # pragma GCC diagnostic ignored "-Wfloat-equal" + #endif + return (fmini + 1.0f == 1.0f - fmini); + #ifdef BOOST_JSON_FASTFLOAT_VISUAL_STUDIO + # pragma warning(pop) + #elif defined(__clang__) + # pragma clang diagnostic pop + #elif defined(__GNUC__) + # pragma GCC diagnostic pop + #endif +} + +} // namespace detail + +template +BOOST_JSON_FASTFLOAT_CONSTEXPR20 +from_chars_result_t from_chars(UC const * first, UC const * last, + T &value, chars_format fmt /*= chars_format::general*/) noexcept { + return from_chars_advanced(first, last, value, parse_options_t{fmt}); +} + +template +BOOST_JSON_FASTFLOAT_CONSTEXPR20 +from_chars_result_t from_chars_advanced(UC const * first, UC const * last, + T &value, parse_options_t options) noexcept { + + static_assert (std::is_same::value || std::is_same::value, "only float and double are supported"); + static_assert (std::is_same::value || + std::is_same::value || + std::is_same::value || + std::is_same::value , "only char, wchar_t, char16_t and char32_t are supported"); + + from_chars_result_t answer; + if (first == last) { + answer.ec = std::errc::invalid_argument; + answer.ptr = first; + return answer; + } + parsed_number_string_t pns = parse_number_string(first, last, options); + if (!pns.valid) { + return detail::parse_infnan(first, last, value); + } + answer.ec = std::errc(); // be optimistic + answer.ptr = pns.lastmatch; + // The implementation of the Clinger's fast path is convoluted because + // we want round-to-nearest in all cases, irrespective of the rounding mode + // selected on the thread. + // We proceed optimistically, assuming that detail::rounds_to_nearest() returns + // true. + if (binary_format::min_exponent_fast_path() <= pns.exponent && pns.exponent <= binary_format::max_exponent_fast_path() && !pns.too_many_digits) { + // Unfortunately, the conventional Clinger's fast path is only possible + // when the system rounds to the nearest float. + // + // We expect the next branch to almost always be selected. + // We could check it first (before the previous branch), but + // there might be performance advantages at having the check + // be last. + if(!cpp20_and_in_constexpr() && detail::rounds_to_nearest()) { + // We have that fegetround() == FE_TONEAREST. + // Next is Clinger's fast path. + if (pns.mantissa <=binary_format::max_mantissa_fast_path()) { + value = T(pns.mantissa); + if (pns.exponent < 0) { value = value / binary_format::exact_power_of_ten(-pns.exponent); } + else { value = value * binary_format::exact_power_of_ten(pns.exponent); } + if (pns.negative) { value = -value; } + return answer; + } + } else { + // We do not have that fegetround() == FE_TONEAREST. + // Next is a modified Clinger's fast path, inspired by Jakub Jelínek's proposal + if (pns.exponent >= 0 && pns.mantissa <=binary_format::max_mantissa_fast_path(pns.exponent)) { +#if defined(__clang__) + // Clang may map 0 to -0.0 when fegetround() == FE_DOWNWARD + if(pns.mantissa == 0) { + value = pns.negative ? -0. : 0.; + return answer; + } +#endif + value = T(pns.mantissa) * binary_format::exact_power_of_ten(pns.exponent); + if (pns.negative) { value = -value; } + return answer; + } + } + } + adjusted_mantissa am = compute_float>(pns.exponent, pns.mantissa); + if(pns.too_many_digits && am.power2 >= 0) { + if(am != compute_float>(pns.exponent, pns.mantissa + 1)) { + am = compute_error>(pns.exponent, pns.mantissa); + } + } + // If we called compute_float>(pns.exponent, pns.mantissa) and we have an invalid power (am.power2 < 0), + // then we need to go the long way around again. This is very uncommon. + if(am.power2 < 0) { am = digit_comp(pns, am); } + to_float(pns.negative, am, value); + // Test for over/underflow. + if ((pns.mantissa != 0 && am.mantissa == 0 && am.power2 == 0) || am.power2 == binary_format::infinite_power()) { + answer.ec = std::errc::result_out_of_range; + } + return answer; +} + +}}}}}} // namespace fast_float + +#endif diff --git a/include/boost/json/detail/charconv/detail/from_chars_float_impl.hpp b/include/boost/json/detail/charconv/detail/from_chars_float_impl.hpp new file mode 100644 index 00000000..6ca5a250 --- /dev/null +++ b/include/boost/json/detail/charconv/detail/from_chars_float_impl.hpp @@ -0,0 +1,172 @@ +// Copyright 2022 Peter Dimov +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_FROM_CHARS_FLOAT_IMPL_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_FROM_CHARS_FLOAT_IMPL_HPP + +#include +#include +#include +#include +#include +#include +#include +#include + +namespace boost { namespace json { namespace detail { namespace charconv { namespace detail { + +#ifdef BOOST_MSVC +# pragma warning(push) +# pragma warning(disable: 4244) // Implict converion when BOOST_IF_CONSTEXPR expands to if +#elif defined(__GNUC__) && __GNUC__ < 5 && !defined(__clang__) +# pragma GCC diagnostic push +# pragma GCC diagnostic ignored "-Wmissing-field-initializers" +#endif + +template +from_chars_result from_chars_strtod_impl(const char* first, const char* last, T& value, char* buffer) noexcept +{ + // For strto(f/d) + // Floating point value corresponding to the contents of str on success. + // If the converted value falls out of range of corresponding return type, range error occurs and HUGE_VAL, HUGE_VALF or HUGE_VALL is returned. + // If no conversion can be performed, 0 is returned and *str_end is set to str. + + std::memcpy(buffer, first, static_cast(last - first)); + buffer[last - first] = '\0'; + + char* str_end; + T return_value {}; + BOOST_IF_CONSTEXPR (std::is_same::value) + { + return_value = std::strtof(buffer, &str_end); + if (return_value == HUGE_VALF) + { + return {last, std::errc::result_out_of_range}; + } + } + else BOOST_IF_CONSTEXPR (std::is_same::value) + { + return_value = std::strtod(buffer, &str_end); + if (return_value == HUGE_VAL) + { + return {last, std::errc::result_out_of_range}; + } + } + else + { + return_value = std::strtold(buffer, &str_end); + if (return_value == HUGE_VALL) + { + return {last, std::errc::result_out_of_range}; + } + } + + // Since this is a fallback routine we are safe to check for 0 + if (return_value == 0 && str_end == last) + { + return {first, std::errc::result_out_of_range}; + } + + value = return_value; + return {first + (str_end - buffer), std::errc()}; +} + +template +inline from_chars_result from_chars_strtod(const char* first, const char* last, T& value) noexcept +{ + if (last - first < 1024) + { + char buffer[1024]; + return from_chars_strtod_impl(first, last, value, buffer); + } + + // If the string to be parsed does not fit into the 1024 byte static buffer than we have to allocate a buffer. + // malloc is used here because it does not throw on allocation failure. + + char* buffer = static_cast(std::malloc(last - first + 1)); + if (buffer == nullptr) + { + return {first, std::errc::not_enough_memory}; + } + + auto r = from_chars_strtod_impl(first, last, value, buffer); + std::free(buffer); + + return r; +} + +template +from_chars_result from_chars_float_impl(const char* first, const char* last, T& value, chars_format fmt) noexcept +{ + bool sign {}; + std::uint64_t significand {}; + std::int64_t exponent {}; + + auto r = charconv::detail::parser(first, last, sign, significand, exponent, fmt); + if (r.ec != std::errc()) + { + return r; + } + else if (significand == 0) + { + value = sign ? static_cast(-0.0L) : static_cast(0.0L); + return r; + } + else if (exponent == -1) + { + // A full length significand e.g. -1985444280612224 with a power of -1 sometimes + // fails in compute_float64 but is trivial to calculate + // Found investigating GitHub issue #47 + value = (sign ? -static_cast(significand) : static_cast(significand)) / 10; + } + + bool success {}; + T return_val {}; + return_val = compute_float64(exponent, significand, sign, success); + + if (!success) + { + if (significand == 1 && exponent == 0) + { + value = 1; + r.ptr = last; + r.ec = std::errc(); + } + else + { + if (return_val == HUGE_VAL || return_val == -HUGE_VAL) + { + value = return_val; + r.ec = std::errc::result_out_of_range; + } + else if (exponent < -342) + { + value = sign ? -0.0 : 0.0; + r.ec = std::errc::result_out_of_range; + } + else + { + r = from_chars_strtod(first, r.ptr, value); + } + } + } + else + { + value = return_val; + } + + return r; +} + + +#ifdef BOOST_MSVC +# pragma warning(pop) +#elif defined(__GNUC__) && __GNUC__ < 5 && !defined(__clang__) +# pragma GCC diagnostic pop +#endif + +}}}}} // Namespace boost::charconv::detail + +#endif // BOOST_JSON_DETAIL_CHARCONV_DETAIL_FROM_CHARS_FLOAT_IMPL_HPP diff --git a/include/boost/json/detail/charconv/detail/from_chars_integer_impl.hpp b/include/boost/json/detail/charconv/detail/from_chars_integer_impl.hpp new file mode 100644 index 00000000..f709ab7e --- /dev/null +++ b/include/boost/json/detail/charconv/detail/from_chars_integer_impl.hpp @@ -0,0 +1,252 @@ +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_FROM_CHARS_INTEGER_IMPL_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_FROM_CHARS_INTEGER_IMPL_HPP + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +namespace boost { namespace json { namespace detail { namespace charconv { namespace detail { + +static constexpr unsigned char uchar_values[] = + {255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 255, 255, 255, 255, 255, 255, + 255, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, + 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 255, 255, 255, 255, 255, + 255, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, + 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, + 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255, 255}; + +static_assert(sizeof(uchar_values) == 256, "uchar_values should represent all 256 values of unsigned char"); + +// Convert characters for 0-9, A-Z, a-z to 0-35. Anything else is 255 +constexpr unsigned char digit_from_char(char val) noexcept +{ + return uchar_values[static_cast(val)]; +} + +#ifdef BOOST_MSVC +# pragma warning(push) +# pragma warning(disable: 4146) // unary minus operator applied to unsigned type, result still unsigned +# pragma warning(disable: 4189) // 'is_negative': local variable is initialized but not referenced + +#elif defined(__clang__) +# pragma clang diagnostic push +# pragma clang diagnostic ignored "-Wconstant-conversion" + +#elif defined(__GNUC__) && (__GNUC__ < 7) +# pragma GCC diagnostic push +# pragma GCC diagnostic ignored "-Woverflow" + +#elif defined(__GNUC__) && (__GNUC__ >= 7) +# pragma GCC diagnostic push +# pragma GCC diagnostic ignored "-Wmaybe-uninitialized" + +#endif + +template +BOOST_CXX14_CONSTEXPR from_chars_result from_chars_integer_impl(const char* first, const char* last, Integer& value, int base) noexcept +{ + Unsigned_Integer result = 0; + Unsigned_Integer overflow_value = 0; + Unsigned_Integer max_digit = 0; + + // Check pre-conditions + if (!((first <= last) && (base >= 2 && base <= 36))) + { + return {first, std::errc::invalid_argument}; + } + + Unsigned_Integer unsigned_base = static_cast(base); + + // Strip sign if the type is signed + // Negative sign will be appended at the end of parsing + BOOST_ATTRIBUTE_UNUSED bool is_negative = false; + auto next = first; + + #ifdef BOOST_HAS_INT128 + BOOST_IF_CONSTEXPR (std::is_same::value || std::is_signed::value) + #else + BOOST_IF_CONSTEXPR (std::is_signed::value) + #endif + { + if (next != last) + { + if (*next == '-') + { + is_negative = true; + ++next; + } + else if (*next == '+') + { + return {next, std::errc::invalid_argument}; + } + } + + #ifdef BOOST_HAS_INT128 + BOOST_IF_CONSTEXPR (std::is_same::value) + { + overflow_value = BOOST_JSON_INT128_MAX; + max_digit = BOOST_JSON_INT128_MAX; + } + else + #endif + { + overflow_value = (std::numeric_limits::max)(); + max_digit = (std::numeric_limits::max)(); + } + + if (is_negative) + { + ++overflow_value; + ++max_digit; + } + } + else + { + if (next != last && (*next == '-' || *next == '+')) + { + return {first, std::errc::invalid_argument}; + } + + #ifdef BOOST_HAS_INT128 + BOOST_IF_CONSTEXPR (std::is_same::value) + { + overflow_value = BOOST_JSON_UINT128_MAX; + max_digit = BOOST_JSON_UINT128_MAX; + } + else + #endif + { + overflow_value = (std::numeric_limits::max)(); + max_digit = (std::numeric_limits::max)(); + } + } + + #ifdef BOOST_HAS_INT128 + BOOST_IF_CONSTEXPR (std::is_same::value) + { + overflow_value /= unsigned_base; + max_digit %= unsigned_base; + overflow_value *= 2; // Overflow value would cause INT128_MIN in non-base10 to fail + } + else + #endif + { + overflow_value /= unsigned_base; + max_digit %= unsigned_base; + } + + // If the only character was a sign abort now + if (next == last) + { + return {first, std::errc::invalid_argument}; + } + + bool overflowed = false; + + std::ptrdiff_t nc = last - next; + constexpr std::ptrdiff_t nd = std::numeric_limits::digits10; + + { + std::ptrdiff_t i = 0; + + for( ; i < nd && i < nc; ++i ) + { + // overflow is not possible in the first nd characters + + const unsigned char current_digit = digit_from_char(*next); + + if (current_digit >= unsigned_base) + { + break; + } + + result = static_cast(result * unsigned_base + current_digit); + ++next; + } + + for( ; i < nc; ++i ) + { + const unsigned char current_digit = digit_from_char(*next); + + if (current_digit >= unsigned_base) + { + break; + } + + if (result < overflow_value || (result == overflow_value && current_digit <= max_digit)) + { + result = static_cast(result * unsigned_base + current_digit); + } + else + { + // Required to keep updating the value of next, but the result is garbage + overflowed = true; + } + + ++next; + } + } + + // Return the parsed value, adding the sign back if applicable + // If we have overflowed then we do not return the result + if (overflowed) + { + return {next, std::errc::result_out_of_range}; + } + + value = static_cast(result); + #ifdef BOOST_HAS_INT128 + BOOST_IF_CONSTEXPR (std::is_same::value || std::is_signed::value) + #else + BOOST_IF_CONSTEXPR (std::is_signed::value) + #endif + { + if (is_negative) + { + value = -(static_cast(value)); + } + } + + return {next, std::errc()}; +} + +#ifdef BOOST_MSVC +# pragma warning(pop) +#elif defined(__clang__) && defined(__APPLE__) +# pragma clang diagnostic pop +#elif defined(__GNUC__) && (__GNUC__ < 7 || __GNUC__ >= 9) +# pragma GCC diagnostic pop +#endif + +// Only from_chars for integer types is constexpr (as of C++23) +template +BOOST_JSON_GCC5_CONSTEXPR from_chars_result from_chars(const char* first, const char* last, Integer& value, int base = 10) noexcept +{ + using Unsigned_Integer = typename std::make_unsigned::type; + return detail::from_chars_integer_impl(first, last, value, base); +} + +}}}}} // Namespaces + +#endif // BOOST_JSON_DETAIL_CHARCONV_DETAIL_FROM_CHARS_INTEGER_IMPL_HPP diff --git a/include/boost/json/detail/charconv/detail/from_chars_result.hpp b/include/boost/json/detail/charconv/detail/from_chars_result.hpp new file mode 100644 index 00000000..7b7b7edf --- /dev/null +++ b/include/boost/json/detail/charconv/detail/from_chars_result.hpp @@ -0,0 +1,39 @@ +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_FROM_CHARS_RESULT_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_FROM_CHARS_RESULT_HPP + +#include + +namespace boost { namespace json { namespace detail { namespace charconv { + +// 22.13.3, Primitive numerical input conversion + +template +struct from_chars_result_t +{ + const UC* ptr; + + // Values: + // 0 = no error + // EINVAL = invalid_argument + // ERANGE = result_out_of_range + std::errc ec; + + friend constexpr bool operator==(const from_chars_result_t& lhs, const from_chars_result_t& rhs) noexcept + { + return lhs.ptr == rhs.ptr && lhs.ec == rhs.ec; + } + + friend constexpr bool operator!=(const from_chars_result_t& lhs, const from_chars_result_t& rhs) noexcept + { + return !(lhs == rhs); + } +}; +using from_chars_result = from_chars_result_t; + +}}}} // Namespaces + +#endif // BOOST_JSON_DETAIL_CHARCONV_DETAIL_FROM_CHARS_RESULT_HPP diff --git a/include/boost/json/detail/charconv/detail/integer_search_trees.hpp b/include/boost/json/detail/charconv/detail/integer_search_trees.hpp new file mode 100644 index 00000000..8703c915 --- /dev/null +++ b/include/boost/json/detail/charconv/detail/integer_search_trees.hpp @@ -0,0 +1,240 @@ +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_INTEGER_SEARCH_TREES_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_INTEGER_SEARCH_TREES_HPP + +// https://stackoverflow.com/questions/1489830/efficient-way-to-determine-number-of-digits-in-an-integer?page=1&tab=scoredesc#tab-top +// https://graphics.stanford.edu/~seander/bithacks.html + +#include +#include +#include +#include + +namespace boost { namespace json { namespace detail { namespace charconv { namespace detail { + +// Generic solution +template +BOOST_JSON_CXX14_CONSTEXPR int num_digits(T x) noexcept +{ + int digits = 0; + + while (x) + { + x /= 10; + ++digits; + } + + return digits; +} + +template <> +BOOST_JSON_CXX14_CONSTEXPR int num_digits(std::uint32_t x) noexcept +{ + if (x >= UINT32_C(10000)) + { + if (x >= UINT32_C(10000000)) + { + if (x >= UINT32_C(100000000)) + { + if (x >= UINT32_C(1000000000)) + { + return 10; + } + return 9; + } + return 8; + } + + else if (x >= UINT32_C(100000)) + { + if (x >= UINT32_C(1000000)) + { + return 7; + } + return 6; + } + return 5; + } + else if (x >= UINT32_C(100)) + { + if (x >= UINT32_C(1000)) + { + return 4; + } + return 3; + } + else if (x >= UINT32_C(10)) + { + return 2; + } + + return 1; +} + +template <> +BOOST_JSON_CXX14_CONSTEXPR int num_digits(std::uint64_t x) noexcept +{ + if (x >= UINT64_C(10000000000)) + { + if (x >= UINT64_C(100000000000000)) + { + if (x >= UINT64_C(10000000000000000)) + { + if (x >= UINT64_C(100000000000000000)) + { + if (x >= UINT64_C(1000000000000000000)) + { + if (x >= UINT64_C(10000000000000000000)) + { + return 20; + } + return 19; + } + return 18; + } + return 17; + } + else if (x >= UINT64_C(1000000000000000)) + { + return 16; + } + return 15; + } + if (x >= UINT64_C(1000000000000)) + { + if (x >= UINT64_C(10000000000000)) + { + return 14; + } + return 13; + } + if (x >= UINT64_C(100000000000)) + { + return 12; + } + return 11; + } + else if (x >= UINT64_C(100000)) + { + if (x >= UINT64_C(10000000)) + { + if (x >= UINT64_C(100000000)) + { + if (x >= UINT64_C(1000000000)) + { + return 10; + } + return 9; + } + return 8; + } + if (x >= UINT64_C(1000000)) + { + return 7; + } + return 6; + } + if (x >= UINT64_C(100)) + { + if (x >= UINT64_C(1000)) + { + if (x >= UINT64_C(10000)) + { + return 5; + } + return 4; + } + return 3; + } + if (x >= UINT64_C(10)) + { + return 2; + } + return 1; +} + +#ifdef BOOST_HAS_INT128 +static constexpr std::array powers_of_10 = +{{ + UINT64_C(1), UINT64_C(10), UINT64_C(100), UINT64_C(1000), UINT64_C(10000), UINT64_C(100000), UINT64_C(1000000), + UINT64_C(10000000), UINT64_C(100000000), UINT64_C(1000000000), UINT64_C(10000000000), UINT64_C(100000000000), + UINT64_C(1000000000000), UINT64_C(10000000000000), UINT64_C(100000000000000), UINT64_C(1000000000000000), + UINT64_C(10000000000000000), UINT64_C(100000000000000000), UINT64_C(1000000000000000000), UINT64_C(10000000000000000000) +}}; + +// Assume that if someone is using 128 bit ints they are favoring the top end of the range +// Max value is 340,282,366,920,938,463,463,374,607,431,768,211,455 (39 digits) +BOOST_JSON_CXX14_CONSTEXPR int num_digits(boost::uint128_type x) noexcept +{ + // There is not literal for boost::uint128_type so we need to calculate them using the max value of the + // std::uint64_t powers of 10 + constexpr boost::uint128_type digits_39 = static_cast(UINT64_C(10000000000000000000)) * + static_cast(UINT64_C(10000000000000000000)); + + constexpr boost::uint128_type digits_38 = digits_39 / 10; + constexpr boost::uint128_type digits_37 = digits_38 / 10; + constexpr boost::uint128_type digits_36 = digits_37 / 10; + constexpr boost::uint128_type digits_35 = digits_36 / 10; + constexpr boost::uint128_type digits_34 = digits_35 / 10; + constexpr boost::uint128_type digits_33 = digits_34 / 10; + constexpr boost::uint128_type digits_32 = digits_33 / 10; + constexpr boost::uint128_type digits_31 = digits_32 / 10; + constexpr boost::uint128_type digits_30 = digits_31 / 10; + constexpr boost::uint128_type digits_29 = digits_30 / 10; + constexpr boost::uint128_type digits_28 = digits_29 / 10; + constexpr boost::uint128_type digits_27 = digits_28 / 10; + constexpr boost::uint128_type digits_26 = digits_27 / 10; + constexpr boost::uint128_type digits_25 = digits_26 / 10; + constexpr boost::uint128_type digits_24 = digits_25 / 10; + constexpr boost::uint128_type digits_23 = digits_24 / 10; + constexpr boost::uint128_type digits_22 = digits_23 / 10; + constexpr boost::uint128_type digits_21 = digits_22 / 10; + + return (x >= digits_39) ? 39 : + (x >= digits_38) ? 38 : + (x >= digits_37) ? 37 : + (x >= digits_36) ? 36 : + (x >= digits_35) ? 35 : + (x >= digits_34) ? 34 : + (x >= digits_33) ? 33 : + (x >= digits_32) ? 32 : + (x >= digits_31) ? 31 : + (x >= digits_30) ? 30 : + (x >= digits_29) ? 29 : + (x >= digits_28) ? 28 : + (x >= digits_27) ? 27 : + (x >= digits_26) ? 26 : + (x >= digits_25) ? 25 : + (x >= digits_24) ? 24 : + (x >= digits_23) ? 23 : + (x >= digits_22) ? 22 : + (x >= digits_21) ? 21 : + (x >= powers_of_10[19]) ? 20 : + (x >= powers_of_10[18]) ? 19 : + (x >= powers_of_10[17]) ? 18 : + (x >= powers_of_10[16]) ? 17 : + (x >= powers_of_10[15]) ? 16 : + (x >= powers_of_10[14]) ? 15 : + (x >= powers_of_10[13]) ? 14 : + (x >= powers_of_10[12]) ? 13 : + (x >= powers_of_10[11]) ? 12 : + (x >= powers_of_10[10]) ? 11 : + (x >= powers_of_10[9]) ? 10 : + (x >= powers_of_10[8]) ? 9 : + (x >= powers_of_10[7]) ? 8 : + (x >= powers_of_10[6]) ? 7 : + (x >= powers_of_10[5]) ? 6 : + (x >= powers_of_10[4]) ? 5 : + (x >= powers_of_10[3]) ? 4 : + (x >= powers_of_10[2]) ? 3 : + (x >= powers_of_10[1]) ? 2 : + (x >= powers_of_10[0]) ? 1 : 0; +} +#endif + +}}}}} // Namespace boost::json::detail::charconv::detail + +#endif // BOOST_JSON_DETAIL_CHARCONV_DETAIL_INTEGER_SEARCH_TREES_HPP diff --git a/include/boost/json/detail/charconv/detail/parser.hpp b/include/boost/json/detail/charconv/detail/parser.hpp new file mode 100644 index 00000000..b24f47fa --- /dev/null +++ b/include/boost/json/detail/charconv/detail/parser.hpp @@ -0,0 +1,378 @@ +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_PARSER_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_PARSER_HPP + +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#if defined(__GNUC__) && __GNUC__ < 5 && !defined(__clang__) +# pragma GCC diagnostic push +# pragma GCC diagnostic ignored "-Wmissing-field-initializers" +#endif + +namespace boost { namespace json { namespace detail { namespace charconv { namespace detail { + +inline bool is_integer_char(char c) noexcept +{ + return (c >= '0') && (c <= '9'); +} + +inline bool is_hex_char(char c) noexcept +{ + return is_integer_char(c) || (((c >= 'a') && (c <= 'f')) || ((c >= 'A') && (c <= 'F'))); +} + +inline bool is_delimiter(char c, chars_format fmt) noexcept +{ + if (fmt != chars_format::hex) + { + return !is_integer_char(c) && c != 'e' && c != 'E'; + } + + return !is_hex_char(c) && c != 'p' && c != 'P'; +} + +template +inline from_chars_result parser(const char* first, const char* last, bool& sign, Unsigned_Integer& significand, Integer& exponent, chars_format fmt = chars_format::general) noexcept +{ + if (first > last) + { + return {first, std::errc::invalid_argument}; + } + + auto next = first; + bool all_zeros = true; + + // First extract the sign + if (*next == '-') + { + sign = true; + ++next; + } + else if (*next == '+') + { + return {next, std::errc::invalid_argument}; + } + else + { + sign = false; + } + + // Ignore leading zeros (e.g. 00005 or -002.3e+5) + while (*next == '0' && next != last) + { + ++next; + } + + // If the number is 0 we can abort now + char exp_char; + char capital_exp_char; + if (fmt != chars_format::hex) + { + exp_char = 'e'; + capital_exp_char = 'E'; + } + else + { + exp_char = 'p'; + capital_exp_char = 'P'; + } + + if (next == last || *next == exp_char || *next == -capital_exp_char) + { + significand = 0; + exponent = 0; + return {next, std::errc()}; + } + + // Next we get the significand + constexpr std::size_t significand_buffer_size = limits::max_chars10 - 1; // Base 10 or 16 + char significand_buffer[significand_buffer_size] {}; + std::size_t i = 0; + std::size_t dot_position = 0; + Integer extra_zeros = 0; + Integer leading_zero_powers = 0; + const auto char_validation_func = (fmt != charconv::chars_format::hex) ? is_integer_char : is_hex_char; + const int base = (fmt != charconv::chars_format::hex) ? 10 : 16; + + while (char_validation_func(*next) && next != last && i < significand_buffer_size) + { + all_zeros = false; + significand_buffer[i] = *next; + ++next; + ++i; + } + + bool fractional = false; + if (next == last) + { + // if fmt is chars_format::scientific the e is required + if (fmt == chars_format::scientific) + { + return {first, std::errc::invalid_argument}; + } + + exponent = 0; + std::size_t offset = i; + + from_chars_result r = from_chars(significand_buffer, significand_buffer + offset, significand, base); + switch (r.ec) + { + case std::errc::invalid_argument: + return {first, std::errc::invalid_argument}; + case std::errc::result_out_of_range: + return {next, std::errc::result_out_of_range}; + default: + return {next, std::errc()}; + } + } + else if (*next == '.') + { + ++next; + fractional = true; + dot_position = i; + + // Process the fractional part if we have it + // + // if fmt is chars_format::scientific the e is required + // if fmt is chars_format::fixed and not scientific the e is disallowed + // if fmt is chars_format::general (which is scientific and fixed) the e is optional + + // If we have the value 0.00001 we can continue to chop zeros and adjust the exponent + // so that we get the useful parts of the fraction + if (all_zeros) + { + while (*next == '0' && next != last) + { + ++next; + --leading_zero_powers; + } + + if (next == last) + { + return {last, std::errc()}; + } + } + + while (char_validation_func(*next) && next != last && i < significand_buffer_size) + { + significand_buffer[i] = *next; + ++next; + ++i; + } + } + + if (i == significand_buffer_size) + { + // We can not process any more significant figures into the significand so skip to the end + // or the exponent part and capture the additional orders of magnitude for the exponent + bool found_dot = false; + while ((char_validation_func(*next) || *next == '.') && next != last) + { + ++next; + if (!fractional && !found_dot) + { + ++extra_zeros; + } + if (*next == '.') + { + found_dot = true; + } + } + } + + if (next == last || is_delimiter(*next, fmt)) + { + if (fmt == chars_format::scientific) + { + return {first, std::errc::invalid_argument}; + } + if (dot_position != 0 || fractional) + { + exponent = static_cast(dot_position) - i + extra_zeros + leading_zero_powers; + } + else + { + exponent = extra_zeros + leading_zero_powers; + } + std::size_t offset = i; + + from_chars_result r = from_chars(significand_buffer, significand_buffer + offset, significand, base); + switch (r.ec) + { + case std::errc::invalid_argument: + return {first, std::errc::invalid_argument}; + case std::errc::result_out_of_range: + return {next, std::errc::result_out_of_range}; + default: + return {next, std::errc()}; + } + } + else if (*next == exp_char || *next == capital_exp_char) + { + // Would be a number without a significand e.g. e+03 + if (next == first) + { + return {next, std::errc::invalid_argument}; + } + + ++next; + if (fmt == chars_format::fixed) + { + return {first, std::errc::invalid_argument}; + } + + exponent = i - 1; + std::size_t offset = i; + bool round = false; + // If more digits are present than representable in the significand of the target type + // we set the maximum + if (offset > significand_buffer_size) + { + offset = significand_buffer_size - 1; + i = significand_buffer_size; + if (significand_buffer[offset] == '5' || + significand_buffer[offset] == '6' || + significand_buffer[offset] == '7' || + significand_buffer[offset] == '8' || + significand_buffer[offset] == '9') + { + round = true; + } + } + + // If the significand is 0 from chars will return std::errc::invalid_argument because there is nothing in the buffer, + // but it is a valid value. We need to continue parsing to get the correct value of ptr even + // though we know we could bail now. + // + // See GitHub issue #29: https://github.com/cppalliance/charconv/issues/29 + if (offset != 0) + { + from_chars_result r = from_chars(significand_buffer, significand_buffer + offset, significand, base); + switch (r.ec) + { + case std::errc::invalid_argument: + return {first, std::errc::invalid_argument}; + case std::errc::result_out_of_range: + return {next, std::errc::result_out_of_range}; + default: + break; + } + + if (round) + { + significand += 1; + } + } + } + else + { + return {first, std::errc::invalid_argument}; + } + + // Finally we get the exponent + constexpr std::size_t exponent_buffer_size = 6; // Float128 min exp is −16382 + char exponent_buffer[exponent_buffer_size] {}; + Integer significand_digits = i; + i = 0; + + // Get the sign first + if (*next == '-') + { + exponent_buffer[i] = *next; + ++next; + ++i; + } + else if (*next == '+') + { + ++next; + } + + // Next strip any leading zeros + while (*next == '0') + { + ++next; + } + + // Process the significant values + while (is_integer_char(*next) && next != last && i < exponent_buffer_size) + { + exponent_buffer[i] = *next; + ++next; + ++i; + } + + // If the exponent can't fit in the buffer the number is not representable + if (next != last && i == exponent_buffer_size) + { + return {next, std::errc::result_out_of_range}; + } + + // If the exponent was e+00 or e-00 + if (i == 0 || (i == 1 && exponent_buffer[0] == '-')) + { + if (fractional) + { + exponent = static_cast(dot_position) - significand_digits; + } + else + { + exponent = extra_zeros; + } + + return {next, std::errc()}; + } + + const auto r = from_chars(exponent_buffer, exponent_buffer + i, exponent); + + exponent += leading_zero_powers; + + switch (r.ec) + { + case std::errc::invalid_argument: + return {first, std::errc::invalid_argument}; + case std::errc::result_out_of_range: + return {next, std::errc::result_out_of_range}; + default: + if (fractional) + { + // Need to take the offset from 1.xxx because compute_floatXXX assumes the significand is an integer + // so the exponent is off by the number of digits in the significand - 1 + if (fmt == chars_format::hex) + { + // In hex the number of digits parsed is possibly less than the number of digits in base10 + exponent -= num_digits(significand) - dot_position; + } + else + { + exponent -= significand_digits - dot_position; + } + } + else + { + exponent += extra_zeros; + } + return {next, std::errc()}; + } +} + +}}}}} // Namespaces + +#if defined(__GNUC__) && __GNUC__ < 5 && !defined(__clang__) +# pragma GCC diagnostic pop +#endif + +#endif // BOOST_JSON_DETAIL_CHARCONV_DETAIL_PARSER_HPP diff --git a/include/boost/json/detail/charconv/detail/significand_tables.hpp b/include/boost/json/detail/charconv/detail/significand_tables.hpp new file mode 100644 index 00000000..13249c90 --- /dev/null +++ b/include/boost/json/detail/charconv/detail/significand_tables.hpp @@ -0,0 +1,667 @@ +// Copyright 2020-2023 Daniel Lemire +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt + +#ifndef BOOST_JSON_DETAIL_CHARCONV_DETAIL_SIGNIFICAND_TABLES_HPP +#define BOOST_JSON_DETAIL_CHARCONV_DETAIL_SIGNIFICAND_TABLES_HPP + +#include + +// The significand of a floating point number is often referred to as the mantissa. +// Using the term mantissa is discouraged by IEEE 1516 + +namespace boost { namespace json { namespace detail { namespace charconv { namespace detail { + + // The significands of powers of ten from -308 to 308, extended out to sixty four + // bits. The array contains the powers of ten approximated + // as a 64-bit significand. It goes from 10^BOOST_CHARCONV_FASTFLOAT_SMALLEST_POWER to + // 10^BOOST_CHARCONV_FASTFLOAT_LARGEST_POWER (inclusively). + // The significand is truncated, and never rounded up. + // Uses about 5KB. +static constexpr std::uint64_t significand_64[] = { + 0xa5ced43b7e3e9188, 0xcf42894a5dce35ea, + 0x818995ce7aa0e1b2, 0xa1ebfb4219491a1f, + 0xca66fa129f9b60a6, 0xfd00b897478238d0, + 0x9e20735e8cb16382, 0xc5a890362fddbc62, + 0xf712b443bbd52b7b, 0x9a6bb0aa55653b2d, + 0xc1069cd4eabe89f8, 0xf148440a256e2c76, + 0x96cd2a865764dbca, 0xbc807527ed3e12bc, + 0xeba09271e88d976b, 0x93445b8731587ea3, + 0xb8157268fdae9e4c, 0xe61acf033d1a45df, + 0x8fd0c16206306bab, 0xb3c4f1ba87bc8696, + 0xe0b62e2929aba83c, 0x8c71dcd9ba0b4925, + 0xaf8e5410288e1b6f, 0xdb71e91432b1a24a, + 0x892731ac9faf056e, 0xab70fe17c79ac6ca, + 0xd64d3d9db981787d, 0x85f0468293f0eb4e, + 0xa76c582338ed2621, 0xd1476e2c07286faa, + 0x82cca4db847945ca, 0xa37fce126597973c, + 0xcc5fc196fefd7d0c, 0xff77b1fcbebcdc4f, + 0x9faacf3df73609b1, 0xc795830d75038c1d, + 0xf97ae3d0d2446f25, 0x9becce62836ac577, + 0xc2e801fb244576d5, 0xf3a20279ed56d48a, + 0x9845418c345644d6, 0xbe5691ef416bd60c, + 0xedec366b11c6cb8f, 0x94b3a202eb1c3f39, + 0xb9e08a83a5e34f07, 0xe858ad248f5c22c9, + 0x91376c36d99995be, 0xb58547448ffffb2d, + 0xe2e69915b3fff9f9, 0x8dd01fad907ffc3b, + 0xb1442798f49ffb4a, 0xdd95317f31c7fa1d, + 0x8a7d3eef7f1cfc52, 0xad1c8eab5ee43b66, + 0xd863b256369d4a40, 0x873e4f75e2224e68, + 0xa90de3535aaae202, 0xd3515c2831559a83, + 0x8412d9991ed58091, 0xa5178fff668ae0b6, + 0xce5d73ff402d98e3, 0x80fa687f881c7f8e, + 0xa139029f6a239f72, 0xc987434744ac874e, + 0xfbe9141915d7a922, 0x9d71ac8fada6c9b5, + 0xc4ce17b399107c22, 0xf6019da07f549b2b, + 0x99c102844f94e0fb, 0xc0314325637a1939, + 0xf03d93eebc589f88, 0x96267c7535b763b5, + 0xbbb01b9283253ca2, 0xea9c227723ee8bcb, + 0x92a1958a7675175f, 0xb749faed14125d36, + 0xe51c79a85916f484, 0x8f31cc0937ae58d2, + 0xb2fe3f0b8599ef07, 0xdfbdcece67006ac9, + 0x8bd6a141006042bd, 0xaecc49914078536d, + 0xda7f5bf590966848, 0x888f99797a5e012d, + 0xaab37fd7d8f58178, 0xd5605fcdcf32e1d6, + 0x855c3be0a17fcd26, 0xa6b34ad8c9dfc06f, + 0xd0601d8efc57b08b, 0x823c12795db6ce57, + 0xa2cb1717b52481ed, 0xcb7ddcdda26da268, + 0xfe5d54150b090b02, 0x9efa548d26e5a6e1, + 0xc6b8e9b0709f109a, 0xf867241c8cc6d4c0, + 0x9b407691d7fc44f8, 0xc21094364dfb5636, + 0xf294b943e17a2bc4, 0x979cf3ca6cec5b5a, + 0xbd8430bd08277231, 0xece53cec4a314ebd, + 0x940f4613ae5ed136, 0xb913179899f68584, + 0xe757dd7ec07426e5, 0x9096ea6f3848984f, + 0xb4bca50b065abe63, 0xe1ebce4dc7f16dfb, + 0x8d3360f09cf6e4bd, 0xb080392cc4349dec, + 0xdca04777f541c567, 0x89e42caaf9491b60, + 0xac5d37d5b79b6239, 0xd77485cb25823ac7, + 0x86a8d39ef77164bc, 0xa8530886b54dbdeb, + 0xd267caa862a12d66, 0x8380dea93da4bc60, + 0xa46116538d0deb78, 0xcd795be870516656, + 0x806bd9714632dff6, 0xa086cfcd97bf97f3, + 0xc8a883c0fdaf7df0, 0xfad2a4b13d1b5d6c, + 0x9cc3a6eec6311a63, 0xc3f490aa77bd60fc, + 0xf4f1b4d515acb93b, 0x991711052d8bf3c5, + 0xbf5cd54678eef0b6, 0xef340a98172aace4, + 0x9580869f0e7aac0e, 0xbae0a846d2195712, + 0xe998d258869facd7, 0x91ff83775423cc06, + 0xb67f6455292cbf08, 0xe41f3d6a7377eeca, + 0x8e938662882af53e, 0xb23867fb2a35b28d, + 0xdec681f9f4c31f31, 0x8b3c113c38f9f37e, + 0xae0b158b4738705e, 0xd98ddaee19068c76, + 0x87f8a8d4cfa417c9, 0xa9f6d30a038d1dbc, + 0xd47487cc8470652b, 0x84c8d4dfd2c63f3b, + 0xa5fb0a17c777cf09, 0xcf79cc9db955c2cc, + 0x81ac1fe293d599bf, 0xa21727db38cb002f, + 0xca9cf1d206fdc03b, 0xfd442e4688bd304a, + 0x9e4a9cec15763e2e, 0xc5dd44271ad3cdba, + 0xf7549530e188c128, 0x9a94dd3e8cf578b9, + 0xc13a148e3032d6e7, 0xf18899b1bc3f8ca1, + 0x96f5600f15a7b7e5, 0xbcb2b812db11a5de, + 0xebdf661791d60f56, 0x936b9fcebb25c995, + 0xb84687c269ef3bfb, 0xe65829b3046b0afa, + 0x8ff71a0fe2c2e6dc, 0xb3f4e093db73a093, + 0xe0f218b8d25088b8, 0x8c974f7383725573, + 0xafbd2350644eeacf, 0xdbac6c247d62a583, + 0x894bc396ce5da772, 0xab9eb47c81f5114f, + 0xd686619ba27255a2, 0x8613fd0145877585, + 0xa798fc4196e952e7, 0xd17f3b51fca3a7a0, + 0x82ef85133de648c4, 0xa3ab66580d5fdaf5, + 0xcc963fee10b7d1b3, 0xffbbcfe994e5c61f, + 0x9fd561f1fd0f9bd3, 0xc7caba6e7c5382c8, + 0xf9bd690a1b68637b, 0x9c1661a651213e2d, + 0xc31bfa0fe5698db8, 0xf3e2f893dec3f126, + 0x986ddb5c6b3a76b7, 0xbe89523386091465, + 0xee2ba6c0678b597f, 0x94db483840b717ef, + 0xba121a4650e4ddeb, 0xe896a0d7e51e1566, + 0x915e2486ef32cd60, 0xb5b5ada8aaff80b8, + 0xe3231912d5bf60e6, 0x8df5efabc5979c8f, + 0xb1736b96b6fd83b3, 0xddd0467c64bce4a0, + 0x8aa22c0dbef60ee4, 0xad4ab7112eb3929d, + 0xd89d64d57a607744, 0x87625f056c7c4a8b, + 0xa93af6c6c79b5d2d, 0xd389b47879823479, + 0x843610cb4bf160cb, 0xa54394fe1eedb8fe, + 0xce947a3da6a9273e, 0x811ccc668829b887, + 0xa163ff802a3426a8, 0xc9bcff6034c13052, + 0xfc2c3f3841f17c67, 0x9d9ba7832936edc0, + 0xc5029163f384a931, 0xf64335bcf065d37d, + 0x99ea0196163fa42e, 0xc06481fb9bcf8d39, + 0xf07da27a82c37088, 0x964e858c91ba2655, + 0xbbe226efb628afea, 0xeadab0aba3b2dbe5, + 0x92c8ae6b464fc96f, 0xb77ada0617e3bbcb, + 0xe55990879ddcaabd, 0x8f57fa54c2a9eab6, + 0xb32df8e9f3546564, 0xdff9772470297ebd, + 0x8bfbea76c619ef36, 0xaefae51477a06b03, + 0xdab99e59958885c4, 0x88b402f7fd75539b, + 0xaae103b5fcd2a881, 0xd59944a37c0752a2, + 0x857fcae62d8493a5, 0xa6dfbd9fb8e5b88e, + 0xd097ad07a71f26b2, 0x825ecc24c873782f, + 0xa2f67f2dfa90563b, 0xcbb41ef979346bca, + 0xfea126b7d78186bc, 0x9f24b832e6b0f436, + 0xc6ede63fa05d3143, 0xf8a95fcf88747d94, + 0x9b69dbe1b548ce7c, 0xc24452da229b021b, + 0xf2d56790ab41c2a2, 0x97c560ba6b0919a5, + 0xbdb6b8e905cb600f, 0xed246723473e3813, + 0x9436c0760c86e30b, 0xb94470938fa89bce, + 0xe7958cb87392c2c2, 0x90bd77f3483bb9b9, + 0xb4ecd5f01a4aa828, 0xe2280b6c20dd5232, + 0x8d590723948a535f, 0xb0af48ec79ace837, + 0xdcdb1b2798182244, 0x8a08f0f8bf0f156b, + 0xac8b2d36eed2dac5, 0xd7adf884aa879177, + 0x86ccbb52ea94baea, 0xa87fea27a539e9a5, + 0xd29fe4b18e88640e, 0x83a3eeeef9153e89, + 0xa48ceaaab75a8e2b, 0xcdb02555653131b6, + 0x808e17555f3ebf11, 0xa0b19d2ab70e6ed6, + 0xc8de047564d20a8b, 0xfb158592be068d2e, + 0x9ced737bb6c4183d, 0xc428d05aa4751e4c, + 0xf53304714d9265df, 0x993fe2c6d07b7fab, + 0xbf8fdb78849a5f96, 0xef73d256a5c0f77c, + 0x95a8637627989aad, 0xbb127c53b17ec159, + 0xe9d71b689dde71af, 0x9226712162ab070d, + 0xb6b00d69bb55c8d1, 0xe45c10c42a2b3b05, + 0x8eb98a7a9a5b04e3, 0xb267ed1940f1c61c, + 0xdf01e85f912e37a3, 0x8b61313bbabce2c6, + 0xae397d8aa96c1b77, 0xd9c7dced53c72255, + 0x881cea14545c7575, 0xaa242499697392d2, + 0xd4ad2dbfc3d07787, 0x84ec3c97da624ab4, + 0xa6274bbdd0fadd61, 0xcfb11ead453994ba, + 0x81ceb32c4b43fcf4, 0xa2425ff75e14fc31, + 0xcad2f7f5359a3b3e, 0xfd87b5f28300ca0d, + 0x9e74d1b791e07e48, 0xc612062576589dda, + 0xf79687aed3eec551, 0x9abe14cd44753b52, + 0xc16d9a0095928a27, 0xf1c90080baf72cb1, + 0x971da05074da7bee, 0xbce5086492111aea, + 0xec1e4a7db69561a5, 0x9392ee8e921d5d07, + 0xb877aa3236a4b449, 0xe69594bec44de15b, + 0x901d7cf73ab0acd9, 0xb424dc35095cd80f, + 0xe12e13424bb40e13, 0x8cbccc096f5088cb, + 0xafebff0bcb24aafe, 0xdbe6fecebdedd5be, + 0x89705f4136b4a597, 0xabcc77118461cefc, + 0xd6bf94d5e57a42bc, 0x8637bd05af6c69b5, + 0xa7c5ac471b478423, 0xd1b71758e219652b, + 0x83126e978d4fdf3b, 0xa3d70a3d70a3d70a, + 0xcccccccccccccccc, 0x8000000000000000, + 0xa000000000000000, 0xc800000000000000, + 0xfa00000000000000, 0x9c40000000000000, + 0xc350000000000000, 0xf424000000000000, + 0x9896800000000000, 0xbebc200000000000, + 0xee6b280000000000, 0x9502f90000000000, + 0xba43b74000000000, 0xe8d4a51000000000, + 0x9184e72a00000000, 0xb5e620f480000000, + 0xe35fa931a0000000, 0x8e1bc9bf04000000, + 0xb1a2bc2ec5000000, 0xde0b6b3a76400000, + 0x8ac7230489e80000, 0xad78ebc5ac620000, + 0xd8d726b7177a8000, 0x878678326eac9000, + 0xa968163f0a57b400, 0xd3c21bcecceda100, + 0x84595161401484a0, 0xa56fa5b99019a5c8, + 0xcecb8f27f4200f3a, 0x813f3978f8940984, + 0xa18f07d736b90be5, 0xc9f2c9cd04674ede, + 0xfc6f7c4045812296, 0x9dc5ada82b70b59d, + 0xc5371912364ce305, 0xf684df56c3e01bc6, + 0x9a130b963a6c115c, 0xc097ce7bc90715b3, + 0xf0bdc21abb48db20, 0x96769950b50d88f4, + 0xbc143fa4e250eb31, 0xeb194f8e1ae525fd, + 0x92efd1b8d0cf37be, 0xb7abc627050305ad, + 0xe596b7b0c643c719, 0x8f7e32ce7bea5c6f, + 0xb35dbf821ae4f38b, 0xe0352f62a19e306e, + 0x8c213d9da502de45, 0xaf298d050e4395d6, + 0xdaf3f04651d47b4c, 0x88d8762bf324cd0f, + 0xab0e93b6efee0053, 0xd5d238a4abe98068, + 0x85a36366eb71f041, 0xa70c3c40a64e6c51, + 0xd0cf4b50cfe20765, 0x82818f1281ed449f, + 0xa321f2d7226895c7, 0xcbea6f8ceb02bb39, + 0xfee50b7025c36a08, 0x9f4f2726179a2245, + 0xc722f0ef9d80aad6, 0xf8ebad2b84e0d58b, + 0x9b934c3b330c8577, 0xc2781f49ffcfa6d5, + 0xf316271c7fc3908a, 0x97edd871cfda3a56, + 0xbde94e8e43d0c8ec, 0xed63a231d4c4fb27, + 0x945e455f24fb1cf8, 0xb975d6b6ee39e436, + 0xe7d34c64a9c85d44, 0x90e40fbeea1d3a4a, + 0xb51d13aea4a488dd, 0xe264589a4dcdab14, + 0x8d7eb76070a08aec, 0xb0de65388cc8ada8, + 0xdd15fe86affad912, 0x8a2dbf142dfcc7ab, + 0xacb92ed9397bf996, 0xd7e77a8f87daf7fb, + 0x86f0ac99b4e8dafd, 0xa8acd7c0222311bc, + 0xd2d80db02aabd62b, 0x83c7088e1aab65db, + 0xa4b8cab1a1563f52, 0xcde6fd5e09abcf26, + 0x80b05e5ac60b6178, 0xa0dc75f1778e39d6, + 0xc913936dd571c84c, 0xfb5878494ace3a5f, + 0x9d174b2dcec0e47b, 0xc45d1df942711d9a, + 0xf5746577930d6500, 0x9968bf6abbe85f20, + 0xbfc2ef456ae276e8, 0xefb3ab16c59b14a2, + 0x95d04aee3b80ece5, 0xbb445da9ca61281f, + 0xea1575143cf97226, 0x924d692ca61be758, + 0xb6e0c377cfa2e12e, 0xe498f455c38b997a, + 0x8edf98b59a373fec, 0xb2977ee300c50fe7, + 0xdf3d5e9bc0f653e1, 0x8b865b215899f46c, + 0xae67f1e9aec07187, 0xda01ee641a708de9, + 0x884134fe908658b2, 0xaa51823e34a7eede, + 0xd4e5e2cdc1d1ea96, 0x850fadc09923329e, + 0xa6539930bf6bff45, 0xcfe87f7cef46ff16, + 0x81f14fae158c5f6e, 0xa26da3999aef7749, + 0xcb090c8001ab551c, 0xfdcb4fa002162a63, + 0x9e9f11c4014dda7e, 0xc646d63501a1511d, + 0xf7d88bc24209a565, 0x9ae757596946075f, + 0xc1a12d2fc3978937, 0xf209787bb47d6b84, + 0x9745eb4d50ce6332, 0xbd176620a501fbff, + 0xec5d3fa8ce427aff, 0x93ba47c980e98cdf, + 0xb8a8d9bbe123f017, 0xe6d3102ad96cec1d, + 0x9043ea1ac7e41392, 0xb454e4a179dd1877, + 0xe16a1dc9d8545e94, 0x8ce2529e2734bb1d, + 0xb01ae745b101e9e4, 0xdc21a1171d42645d, + 0x899504ae72497eba, 0xabfa45da0edbde69, + 0xd6f8d7509292d603, 0x865b86925b9bc5c2, + 0xa7f26836f282b732, 0xd1ef0244af2364ff, + 0x8335616aed761f1f, 0xa402b9c5a8d3a6e7, + 0xcd036837130890a1, 0x802221226be55a64, + 0xa02aa96b06deb0fd, 0xc83553c5c8965d3d, + 0xfa42a8b73abbf48c, 0x9c69a97284b578d7, + 0xc38413cf25e2d70d, 0xf46518c2ef5b8cd1, + 0x98bf2f79d5993802, 0xbeeefb584aff8603, + 0xeeaaba2e5dbf6784, 0x952ab45cfa97a0b2, + 0xba756174393d88df, 0xe912b9d1478ceb17, + 0x91abb422ccb812ee, 0xb616a12b7fe617aa, + 0xe39c49765fdf9d94, 0x8e41ade9fbebc27d, + 0xb1d219647ae6b31c, 0xde469fbd99a05fe3, + 0x8aec23d680043bee, 0xada72ccc20054ae9, + 0xd910f7ff28069da4, 0x87aa9aff79042286, + 0xa99541bf57452b28, 0xd3fa922f2d1675f2, + 0x847c9b5d7c2e09b7, 0xa59bc234db398c25, + 0xcf02b2c21207ef2e, 0x8161afb94b44f57d, + 0xa1ba1ba79e1632dc, 0xca28a291859bbf93, + 0xfcb2cb35e702af78, 0x9defbf01b061adab, + 0xc56baec21c7a1916, 0xf6c69a72a3989f5b, + 0x9a3c2087a63f6399, 0xc0cb28a98fcf3c7f, + 0xf0fdf2d3f3c30b9f, 0x969eb7c47859e743, + 0xbc4665b596706114, 0xeb57ff22fc0c7959, + 0x9316ff75dd87cbd8, 0xb7dcbf5354e9bece, + 0xe5d3ef282a242e81, 0x8fa475791a569d10, + 0xb38d92d760ec4455, 0xe070f78d3927556a, + 0x8c469ab843b89562, 0xaf58416654a6babb, + 0xdb2e51bfe9d0696a, 0x88fcf317f22241e2, + 0xab3c2fddeeaad25a, 0xd60b3bd56a5586f1, + 0x85c7056562757456, 0xa738c6bebb12d16c, + 0xd106f86e69d785c7, 0x82a45b450226b39c, + 0xa34d721642b06084, 0xcc20ce9bd35c78a5, + 0xff290242c83396ce, 0x9f79a169bd203e41, + 0xc75809c42c684dd1, 0xf92e0c3537826145, + 0x9bbcc7a142b17ccb, 0xc2abf989935ddbfe, + 0xf356f7ebf83552fe, 0x98165af37b2153de, + 0xbe1bf1b059e9a8d6, 0xeda2ee1c7064130c, + 0x9485d4d1c63e8be7, 0xb9a74a0637ce2ee1, + 0xe8111c87c5c1ba99, 0x910ab1d4db9914a0, + 0xb54d5e4a127f59c8, 0xe2a0b5dc971f303a, + 0x8da471a9de737e24, 0xb10d8e1456105dad, + 0xdd50f1996b947518, 0x8a5296ffe33cc92f, + 0xace73cbfdc0bfb7b, 0xd8210befd30efa5a, + 0x8714a775e3e95c78, 0xa8d9d1535ce3b396, + 0xd31045a8341ca07c, 0x83ea2b892091e44d, + 0xa4e4b66b68b65d60, 0xce1de40642e3f4b9, + 0x80d2ae83e9ce78f3, 0xa1075a24e4421730, + 0xc94930ae1d529cfc, 0xfb9b7cd9a4a7443c, + 0x9d412e0806e88aa5, 0xc491798a08a2ad4e, + 0xf5b5d7ec8acb58a2, 0x9991a6f3d6bf1765, + 0xbff610b0cc6edd3f, 0xeff394dcff8a948e, + 0x95f83d0a1fb69cd9, 0xbb764c4ca7a4440f, + 0xea53df5fd18d5513, 0x92746b9be2f8552c, + 0xb7118682dbb66a77, 0xe4d5e82392a40515, + 0x8f05b1163ba6832d, 0xb2c71d5bca9023f8, + 0xdf78e4b2bd342cf6, 0x8bab8eefb6409c1a, + 0xae9672aba3d0c320, 0xda3c0f568cc4f3e8, + 0x8865899617fb1871, 0xaa7eebfb9df9de8d, + 0xd51ea6fa85785631, 0x8533285c936b35de, + 0xa67ff273b8460356, 0xd01fef10a657842c, + 0x8213f56a67f6b29b, 0xa298f2c501f45f42, + 0xcb3f2f7642717713, 0xfe0efb53d30dd4d7, + 0x9ec95d1463e8a506, 0xc67bb4597ce2ce48, + 0xf81aa16fdc1b81da, 0x9b10a4e5e9913128, + 0xc1d4ce1f63f57d72, 0xf24a01a73cf2dccf, + 0x976e41088617ca01, 0xbd49d14aa79dbc82, + 0xec9c459d51852ba2, 0x93e1ab8252f33b45, + 0xb8da1662e7b00a17, 0xe7109bfba19c0c9d, + 0x906a617d450187e2, 0xb484f9dc9641e9da, + 0xe1a63853bbd26451, 0x8d07e33455637eb2, + 0xb049dc016abc5e5f, 0xdc5c5301c56b75f7, + 0x89b9b3e11b6329ba, 0xac2820d9623bf429, + 0xd732290fbacaf133, 0x867f59a9d4bed6c0, + 0xa81f301449ee8c70, 0xd226fc195c6a2f8c, + 0x83585d8fd9c25db7, 0xa42e74f3d032f525, + 0xcd3a1230c43fb26f, 0x80444b5e7aa7cf85, + 0xa0555e361951c366, 0xc86ab5c39fa63440, + 0xfa856334878fc150, 0x9c935e00d4b9d8d2, + 0xc3b8358109e84f07, 0xf4a642e14c6262c8, + 0x98e7e9cccfbd7dbd, 0xbf21e44003acdd2c, + 0xeeea5d5004981478, 0x95527a5202df0ccb, + 0xbaa718e68396cffd, 0xe950df20247c83fd, + 0x91d28b7416cdd27e, 0xb6472e511c81471d, + 0xe3d8f9e563a198e5, 0x8e679c2f5e44ff8f +}; + + // A complement to significand_64 + // complete to a 128-bit significand. + // Uses about 5KB but is rarely accessed. +static constexpr std::uint64_t significand_128[] = { + 0x419ea3bd35385e2d, 0x52064cac828675b9, + 0x7343efebd1940993, 0x1014ebe6c5f90bf8, + 0xd41a26e077774ef6, 0x8920b098955522b4, + 0x55b46e5f5d5535b0, 0xeb2189f734aa831d, + 0xa5e9ec7501d523e4, 0x47b233c92125366e, + 0x999ec0bb696e840a, 0xc00670ea43ca250d, + 0x380406926a5e5728, 0xc605083704f5ecf2, + 0xf7864a44c633682e, 0x7ab3ee6afbe0211d, + 0x5960ea05bad82964, 0x6fb92487298e33bd, + 0xa5d3b6d479f8e056, 0x8f48a4899877186c, + 0x331acdabfe94de87, 0x9ff0c08b7f1d0b14, + 0x7ecf0ae5ee44dd9, 0xc9e82cd9f69d6150, + 0xbe311c083a225cd2, 0x6dbd630a48aaf406, + 0x92cbbccdad5b108, 0x25bbf56008c58ea5, + 0xaf2af2b80af6f24e, 0x1af5af660db4aee1, + 0x50d98d9fc890ed4d, 0xe50ff107bab528a0, + 0x1e53ed49a96272c8, 0x25e8e89c13bb0f7a, + 0x77b191618c54e9ac, 0xd59df5b9ef6a2417, + 0x4b0573286b44ad1d, 0x4ee367f9430aec32, + 0x229c41f793cda73f, 0x6b43527578c1110f, + 0x830a13896b78aaa9, 0x23cc986bc656d553, + 0x2cbfbe86b7ec8aa8, 0x7bf7d71432f3d6a9, + 0xdaf5ccd93fb0cc53, 0xd1b3400f8f9cff68, + 0x23100809b9c21fa1, 0xabd40a0c2832a78a, + 0x16c90c8f323f516c, 0xae3da7d97f6792e3, + 0x99cd11cfdf41779c, 0x40405643d711d583, + 0x482835ea666b2572, 0xda3243650005eecf, + 0x90bed43e40076a82, 0x5a7744a6e804a291, + 0x711515d0a205cb36, 0xd5a5b44ca873e03, + 0xe858790afe9486c2, 0x626e974dbe39a872, + 0xfb0a3d212dc8128f, 0x7ce66634bc9d0b99, + 0x1c1fffc1ebc44e80, 0xa327ffb266b56220, + 0x4bf1ff9f0062baa8, 0x6f773fc3603db4a9, + 0xcb550fb4384d21d3, 0x7e2a53a146606a48, + 0x2eda7444cbfc426d, 0xfa911155fefb5308, + 0x793555ab7eba27ca, 0x4bc1558b2f3458de, + 0x9eb1aaedfb016f16, 0x465e15a979c1cadc, + 0xbfacd89ec191ec9, 0xcef980ec671f667b, + 0x82b7e12780e7401a, 0xd1b2ecb8b0908810, + 0x861fa7e6dcb4aa15, 0x67a791e093e1d49a, + 0xe0c8bb2c5c6d24e0, 0x58fae9f773886e18, + 0xaf39a475506a899e, 0x6d8406c952429603, + 0xc8e5087ba6d33b83, 0xfb1e4a9a90880a64, + 0x5cf2eea09a55067f, 0xf42faa48c0ea481e, + 0xf13b94daf124da26, 0x76c53d08d6b70858, + 0x54768c4b0c64ca6e, 0xa9942f5dcf7dfd09, + 0xd3f93b35435d7c4c, 0xc47bc5014a1a6daf, + 0x359ab6419ca1091b, 0xc30163d203c94b62, + 0x79e0de63425dcf1d, 0x985915fc12f542e4, + 0x3e6f5b7b17b2939d, 0xa705992ceecf9c42, + 0x50c6ff782a838353, 0xa4f8bf5635246428, + 0x871b7795e136be99, 0x28e2557b59846e3f, + 0x331aeada2fe589cf, 0x3ff0d2c85def7621, + 0xfed077a756b53a9, 0xd3e8495912c62894, + 0x64712dd7abbbd95c, 0xbd8d794d96aacfb3, + 0xecf0d7a0fc5583a0, 0xf41686c49db57244, + 0x311c2875c522ced5, 0x7d633293366b828b, + 0xae5dff9c02033197, 0xd9f57f830283fdfc, + 0xd072df63c324fd7b, 0x4247cb9e59f71e6d, + 0x52d9be85f074e608, 0x67902e276c921f8b, + 0xba1cd8a3db53b6, 0x80e8a40eccd228a4, + 0x6122cd128006b2cd, 0x796b805720085f81, + 0xcbe3303674053bb0, 0xbedbfc4411068a9c, + 0xee92fb5515482d44, 0x751bdd152d4d1c4a, + 0xd262d45a78a0635d, 0x86fb897116c87c34, + 0xd45d35e6ae3d4da0, 0x8974836059cca109, + 0x2bd1a438703fc94b, 0x7b6306a34627ddcf, + 0x1a3bc84c17b1d542, 0x20caba5f1d9e4a93, + 0x547eb47b7282ee9c, 0xe99e619a4f23aa43, + 0x6405fa00e2ec94d4, 0xde83bc408dd3dd04, + 0x9624ab50b148d445, 0x3badd624dd9b0957, + 0xe54ca5d70a80e5d6, 0x5e9fcf4ccd211f4c, + 0x7647c3200069671f, 0x29ecd9f40041e073, + 0xf468107100525890, 0x7182148d4066eeb4, + 0xc6f14cd848405530, 0xb8ada00e5a506a7c, + 0xa6d90811f0e4851c, 0x908f4a166d1da663, + 0x9a598e4e043287fe, 0x40eff1e1853f29fd, + 0xd12bee59e68ef47c, 0x82bb74f8301958ce, + 0xe36a52363c1faf01, 0xdc44e6c3cb279ac1, + 0x29ab103a5ef8c0b9, 0x7415d448f6b6f0e7, + 0x111b495b3464ad21, 0xcab10dd900beec34, + 0x3d5d514f40eea742, 0xcb4a5a3112a5112, + 0x47f0e785eaba72ab, 0x59ed216765690f56, + 0x306869c13ec3532c, 0x1e414218c73a13fb, + 0xe5d1929ef90898fa, 0xdf45f746b74abf39, + 0x6b8bba8c328eb783, 0x66ea92f3f326564, + 0xc80a537b0efefebd, 0xbd06742ce95f5f36, + 0x2c48113823b73704, 0xf75a15862ca504c5, + 0x9a984d73dbe722fb, 0xc13e60d0d2e0ebba, + 0x318df905079926a8, 0xfdf17746497f7052, + 0xfeb6ea8bedefa633, 0xfe64a52ee96b8fc0, + 0x3dfdce7aa3c673b0, 0x6bea10ca65c084e, + 0x486e494fcff30a62, 0x5a89dba3c3efccfa, + 0xf89629465a75e01c, 0xf6bbb397f1135823, + 0x746aa07ded582e2c, 0xa8c2a44eb4571cdc, + 0x92f34d62616ce413, 0x77b020baf9c81d17, + 0xace1474dc1d122e, 0xd819992132456ba, + 0x10e1fff697ed6c69, 0xca8d3ffa1ef463c1, + 0xbd308ff8a6b17cb2, 0xac7cb3f6d05ddbde, + 0x6bcdf07a423aa96b, 0x86c16c98d2c953c6, + 0xe871c7bf077ba8b7, 0x11471cd764ad4972, + 0xd598e40d3dd89bcf, 0x4aff1d108d4ec2c3, + 0xcedf722a585139ba, 0xc2974eb4ee658828, + 0x733d226229feea32, 0x806357d5a3f525f, + 0xca07c2dcb0cf26f7, 0xfc89b393dd02f0b5, + 0xbbac2078d443ace2, 0xd54b944b84aa4c0d, + 0xa9e795e65d4df11, 0x4d4617b5ff4a16d5, + 0x504bced1bf8e4e45, 0xe45ec2862f71e1d6, + 0x5d767327bb4e5a4c, 0x3a6a07f8d510f86f, + 0x890489f70a55368b, 0x2b45ac74ccea842e, + 0x3b0b8bc90012929d, 0x9ce6ebb40173744, + 0xcc420a6a101d0515, 0x9fa946824a12232d, + 0x47939822dc96abf9, 0x59787e2b93bc56f7, + 0x57eb4edb3c55b65a, 0xede622920b6b23f1, + 0xe95fab368e45eced, 0x11dbcb0218ebb414, + 0xd652bdc29f26a119, 0x4be76d3346f0495f, + 0x6f70a4400c562ddb, 0xcb4ccd500f6bb952, + 0x7e2000a41346a7a7, 0x8ed400668c0c28c8, + 0x728900802f0f32fa, 0x4f2b40a03ad2ffb9, + 0xe2f610c84987bfa8, 0xdd9ca7d2df4d7c9, + 0x91503d1c79720dbb, 0x75a44c6397ce912a, + 0xc986afbe3ee11aba, 0xfbe85badce996168, + 0xfae27299423fb9c3, 0xdccd879fc967d41a, + 0x5400e987bbc1c920, 0x290123e9aab23b68, + 0xf9a0b6720aaf6521, 0xf808e40e8d5b3e69, + 0xb60b1d1230b20e04, 0xb1c6f22b5e6f48c2, + 0x1e38aeb6360b1af3, 0x25c6da63c38de1b0, + 0x579c487e5a38ad0e, 0x2d835a9df0c6d851, + 0xf8e431456cf88e65, 0x1b8e9ecb641b58ff, + 0xe272467e3d222f3f, 0x5b0ed81dcc6abb0f, + 0x98e947129fc2b4e9, 0x3f2398d747b36224, + 0x8eec7f0d19a03aad, 0x1953cf68300424ac, + 0x5fa8c3423c052dd7, 0x3792f412cb06794d, + 0xe2bbd88bbee40bd0, 0x5b6aceaeae9d0ec4, + 0xf245825a5a445275, 0xeed6e2f0f0d56712, + 0x55464dd69685606b, 0xaa97e14c3c26b886, + 0xd53dd99f4b3066a8, 0xe546a8038efe4029, + 0xde98520472bdd033, 0x963e66858f6d4440, + 0xdde7001379a44aa8, 0x5560c018580d5d52, + 0xaab8f01e6e10b4a6, 0xcab3961304ca70e8, + 0x3d607b97c5fd0d22, 0x8cb89a7db77c506a, + 0x77f3608e92adb242, 0x55f038b237591ed3, + 0x6b6c46dec52f6688, 0x2323ac4b3b3da015, + 0xabec975e0a0d081a, 0x96e7bd358c904a21, + 0x7e50d64177da2e54, 0xdde50bd1d5d0b9e9, + 0x955e4ec64b44e864, 0xbd5af13bef0b113e, + 0xecb1ad8aeacdd58e, 0x67de18eda5814af2, + 0x80eacf948770ced7, 0xa1258379a94d028d, + 0x96ee45813a04330, 0x8bca9d6e188853fc, + 0x775ea264cf55347d, 0x95364afe032a819d, + 0x3a83ddbd83f52204, 0xc4926a9672793542, + 0x75b7053c0f178293, 0x5324c68b12dd6338, + 0xd3f6fc16ebca5e03, 0x88f4bb1ca6bcf584, + 0x2b31e9e3d06c32e5, 0x3aff322e62439fcf, + 0x9befeb9fad487c2, 0x4c2ebe687989a9b3, + 0xf9d37014bf60a10, 0x538484c19ef38c94, + 0x2865a5f206b06fb9, 0xf93f87b7442e45d3, + 0xf78f69a51539d748, 0xb573440e5a884d1b, + 0x31680a88f8953030, 0xfdc20d2b36ba7c3d, + 0x3d32907604691b4c, 0xa63f9a49c2c1b10f, + 0xfcf80dc33721d53, 0xd3c36113404ea4a8, + 0x645a1cac083126e9, 0x3d70a3d70a3d70a3, + 0xcccccccccccccccc, 0x0, + 0x0, 0x0, + 0x0, 0x0, + 0x0, 0x0, + 0x0, 0x0, + 0x0, 0x0, + 0x0, 0x0, + 0x0, 0x0, + 0x0, 0x0, + 0x0, 0x0, + 0x0, 0x0, + 0x0, 0x0, + 0x0, 0x0, + 0x0, 0x0, + 0x0, 0x4000000000000000, + 0x5000000000000000, 0xa400000000000000, + 0x4d00000000000000, 0xf020000000000000, + 0x6c28000000000000, 0xc732000000000000, + 0x3c7f400000000000, 0x4b9f100000000000, + 0x1e86d40000000000, 0x1314448000000000, + 0x17d955a000000000, 0x5dcfab0800000000, + 0x5aa1cae500000000, 0xf14a3d9e40000000, + 0x6d9ccd05d0000000, 0xe4820023a2000000, + 0xdda2802c8a800000, 0xd50b2037ad200000, + 0x4526f422cc340000, 0x9670b12b7f410000, + 0x3c0cdd765f114000, 0xa5880a69fb6ac800, + 0x8eea0d047a457a00, 0x72a4904598d6d880, + 0x47a6da2b7f864750, 0x999090b65f67d924, + 0xfff4b4e3f741cf6d, 0xbff8f10e7a8921a4, + 0xaff72d52192b6a0d, 0x9bf4f8a69f764490, + 0x2f236d04753d5b4, 0x1d762422c946590, + 0x424d3ad2b7b97ef5, 0xd2e0898765a7deb2, + 0x63cc55f49f88eb2f, 0x3cbf6b71c76b25fb, + 0x8bef464e3945ef7a, 0x97758bf0e3cbb5ac, + 0x3d52eeed1cbea317, 0x4ca7aaa863ee4bdd, + 0x8fe8caa93e74ef6a, 0xb3e2fd538e122b44, + 0x60dbbca87196b616, 0xbc8955e946fe31cd, + 0x6babab6398bdbe41, 0xc696963c7eed2dd1, + 0xfc1e1de5cf543ca2, 0x3b25a55f43294bcb, + 0x49ef0eb713f39ebe, 0x6e3569326c784337, + 0x49c2c37f07965404, 0xdc33745ec97be906, + 0x69a028bb3ded71a3, 0xc40832ea0d68ce0c, + 0xf50a3fa490c30190, 0x792667c6da79e0fa, + 0x577001b891185938, 0xed4c0226b55e6f86, + 0x544f8158315b05b4, 0x696361ae3db1c721, + 0x3bc3a19cd1e38e9, 0x4ab48a04065c723, + 0x62eb0d64283f9c76, 0x3ba5d0bd324f8394, + 0xca8f44ec7ee36479, 0x7e998b13cf4e1ecb, + 0x9e3fedd8c321a67e, 0xc5cfe94ef3ea101e, + 0xbba1f1d158724a12, 0x2a8a6e45ae8edc97, + 0xf52d09d71a3293bd, 0x593c2626705f9c56, + 0x6f8b2fb00c77836c, 0xb6dfb9c0f956447, + 0x4724bd4189bd5eac, 0x58edec91ec2cb657, + 0x2f2967b66737e3ed, 0xbd79e0d20082ee74, + 0xecd8590680a3aa11, 0xe80e6f4820cc9495, + 0x3109058d147fdcdd, 0xbd4b46f0599fd415, + 0x6c9e18ac7007c91a, 0x3e2cf6bc604ddb0, + 0x84db8346b786151c, 0xe612641865679a63, + 0x4fcb7e8f3f60c07e, 0xe3be5e330f38f09d, + 0x5cadf5bfd3072cc5, 0x73d9732fc7c8f7f6, + 0x2867e7fddcdd9afa, 0xb281e1fd541501b8, + 0x1f225a7ca91a4226, 0x3375788de9b06958, + 0x52d6b1641c83ae, 0xc0678c5dbd23a49a, + 0xf840b7ba963646e0, 0xb650e5a93bc3d898, + 0xa3e51f138ab4cebe, 0xc66f336c36b10137, + 0xb80b0047445d4184, 0xa60dc059157491e5, + 0x87c89837ad68db2f, 0x29babe4598c311fb, + 0xf4296dd6fef3d67a, 0x1899e4a65f58660c, + 0x5ec05dcff72e7f8f, 0x76707543f4fa1f73, + 0x6a06494a791c53a8, 0x487db9d17636892, + 0x45a9d2845d3c42b6, 0xb8a2392ba45a9b2, + 0x8e6cac7768d7141e, 0x3207d795430cd926, + 0x7f44e6bd49e807b8, 0x5f16206c9c6209a6, + 0x36dba887c37a8c0f, 0xc2494954da2c9789, + 0xf2db9baa10b7bd6c, 0x6f92829494e5acc7, + 0xcb772339ba1f17f9, 0xff2a760414536efb, + 0xfef5138519684aba, 0x7eb258665fc25d69, + 0xef2f773ffbd97a61, 0xaafb550ffacfd8fa, + 0x95ba2a53f983cf38, 0xdd945a747bf26183, + 0x94f971119aeef9e4, 0x7a37cd5601aab85d, + 0xac62e055c10ab33a, 0x577b986b314d6009, + 0xed5a7e85fda0b80b, 0x14588f13be847307, + 0x596eb2d8ae258fc8, 0x6fca5f8ed9aef3bb, + 0x25de7bb9480d5854, 0xaf561aa79a10ae6a, + 0x1b2ba1518094da04, 0x90fb44d2f05d0842, + 0x353a1607ac744a53, 0x42889b8997915ce8, + 0x69956135febada11, 0x43fab9837e699095, + 0x94f967e45e03f4bb, 0x1d1be0eebac278f5, + 0x6462d92a69731732, 0x7d7b8f7503cfdcfe, + 0x5cda735244c3d43e, 0x3a0888136afa64a7, + 0x88aaa1845b8fdd0, 0x8aad549e57273d45, + 0x36ac54e2f678864b, 0x84576a1bb416a7dd, + 0x656d44a2a11c51d5, 0x9f644ae5a4b1b325, + 0x873d5d9f0dde1fee, 0xa90cb506d155a7ea, + 0x9a7f12442d588f2, 0xc11ed6d538aeb2f, + 0x8f1668c8a86da5fa, 0xf96e017d694487bc, + 0x37c981dcc395a9ac, 0x85bbe253f47b1417, + 0x93956d7478ccec8e, 0x387ac8d1970027b2, + 0x6997b05fcc0319e, 0x441fece3bdf81f03, + 0xd527e81cad7626c3, 0x8a71e223d8d3b074, + 0xf6872d5667844e49, 0xb428f8ac016561db, + 0xe13336d701beba52, 0xecc0024661173473, + 0x27f002d7f95d0190, 0x31ec038df7b441f4, + 0x7e67047175a15271, 0xf0062c6e984d386, + 0x52c07b78a3e60868, 0xa7709a56ccdf8a82, + 0x88a66076400bb691, 0x6acff893d00ea435, + 0x583f6b8c4124d43, 0xc3727a337a8b704a, + 0x744f18c0592e4c5c, 0x1162def06f79df73, + 0x8addcb5645ac2ba8, 0x6d953e2bd7173692, + 0xc8fa8db6ccdd0437, 0x1d9c9892400a22a2, + 0x2503beb6d00cab4b, 0x2e44ae64840fd61d, + 0x5ceaecfed289e5d2, 0x7425a83e872c5f47, + 0xd12f124e28f77719, 0x82bd6b70d99aaa6f, + 0x636cc64d1001550b, 0x3c47f7e05401aa4e, + 0x65acfaec34810a71, 0x7f1839a741a14d0d, + 0x1ede48111209a050, 0x934aed0aab460432, + 0xf81da84d5617853f, 0x36251260ab9d668e, + 0xc1d72b7c6b426019, 0xb24cf65b8612f81f, + 0xdee033f26797b627, 0x169840ef017da3b1, + 0x8e1f289560ee864e, 0xf1a6f2bab92a27e2, + 0xae10af696774b1db, 0xacca6da1e0a8ef29, + 0x17fd090a58d32af3, 0xddfc4b4cef07f5b0, + 0x4abdaf101564f98e, 0x9d6d1ad41abe37f1, + 0x84c86189216dc5ed, 0x32fd3cf5b4e49bb4, + 0x3fbc8c33221dc2a1, 0xfabaf3feaa5334a, + 0x29cb4d87f2a7400e, 0x743e20e9ef511012, + 0x914da9246b255416, 0x1ad089b6c2f7548e, + 0xa184ac2473b529b1, 0xc9e5d72d90a2741e, + 0x7e2fa67c7a658892, 0xddbb901b98feeab7, + 0x552a74227f3ea565, 0xd53a88958f87275f, + 0x8a892abaf368f137, 0x2d2b7569b0432d85, + 0x9c3b29620e29fc73, 0x8349f3ba91b47b8f, + 0x241c70a936219a73, 0xed238cd383aa0110, + 0xf4363804324a40aa, 0xb143c6053edcd0d5, + 0xdd94b7868e94050a, 0xca7cf2b4191c8326, + 0xfd1c2f611f63a3f0, 0xbc633b39673c8cec, + 0xd5be0503e085d813, 0x4b2d8644d8a74e18, + 0xddf8e7d60ed1219e, 0xcabb90e5c942b503, + 0x3d6a751f3b936243, 0xcc512670a783ad4, + 0x27fb2b80668b24c5, 0xb1f9f660802dedf6, + 0x5e7873f8a0396973, 0xdb0b487b6423e1e8, + 0x91ce1a9a3d2cda62, 0x7641a140cc7810fb, + 0xa9e904c87fcb0a9d, 0x546345fa9fbdcd44, + 0xa97c177947ad4095, 0x49ed8eabcccc485d, + 0x5c68f256bfff5a74, 0x73832eec6fff3111, + 0xc831fd53c5ff7eab, 0xba3e7ca8b77f5e55, + 0x28ce1bd2e55f35eb, 0x7980d163cf5b81b3, + 0xd7e105bcc332621f, 0x8dd9472bf3fefaa7, + 0xb14f98f6f0feb951, 0x6ed1bf9a569f33d3, + 0xa862f80ec4700c8, 0xcd27bb612758c0fa, + 0x8038d51cb897789c, 0xe0470a63e6bd56c3, + 0x1858ccfce06cac74, 0xf37801e0c43ebc8, + 0xd30560258f54e6ba, 0x47c6b82ef32a2069, + 0x4cdc331d57fa5441, 0xe0133fe4adf8e952, + 0x58180fddd97723a6, 0x570f09eaa7ea7648 +}; + +}}}}} // Namespaces + +#endif // BOOST_JSON_DETAIL_CHARCONV_DETAIL_SIGNIFICAND_TABLES_HPP diff --git a/include/boost/json/detail/charconv/from_chars.hpp b/include/boost/json/detail/charconv/from_chars.hpp new file mode 100644 index 00000000..81626d53 --- /dev/null +++ b/include/boost/json/detail/charconv/from_chars.hpp @@ -0,0 +1,33 @@ +// Copyright 2022 Peter Dimov +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt + +#ifndef BOOST_JSON_DETAIL_CHARCONV_FROM_CHARS_HPP_INCLUDED +#define BOOST_JSON_DETAIL_CHARCONV_FROM_CHARS_HPP_INCLUDED + +#include +#include +#include +#include + +namespace boost { namespace json { namespace detail { namespace charconv { + +//---------------------------------------------------------------------------------------------------------------------- +// Floating Point +//---------------------------------------------------------------------------------------------------------------------- + +namespace detail { + +std::errc errno_to_errc(int errno_value) noexcept; + +} // Namespace detail + +BOOST_JSON_DECL from_chars_result from_chars(const char* first, const char* last, double& value, chars_format fmt = chars_format::general) noexcept; + +} // namespace charconv +} // namespace detail +} // namespace json +} // namespace boost + +#endif // #ifndef BOOST_JSON_DETAIL_CHARCONV_FROM_CHARS_HPP_INCLUDED diff --git a/include/boost/json/detail/charconv/impl/from_chars.ipp b/include/boost/json/detail/charconv/impl/from_chars.ipp new file mode 100644 index 00000000..e3ae6482 --- /dev/null +++ b/include/boost/json/detail/charconv/impl/from_chars.ipp @@ -0,0 +1,47 @@ +// Copyright 2022 Peter Dimov +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt + +// https://stackoverflow.com/questions/38060411/visual-studio-2015-wont-suppress-error-c4996 +#ifndef _SCL_SECURE_NO_WARNINGS +# define _SCL_SECURE_NO_WARNINGS +#endif +#ifndef NO_WARN_MBCS_MFC_DEPRECATION +# define NO_WARN_MBCS_MFC_DEPRECATION +#endif + +#include +#include +#include +#include +#include +#include +#include +#include + +#if defined(__GNUC__) && __GNUC__ < 5 +# pragma GCC diagnostic ignored "-Wmissing-field-initializers" +#endif + +std::errc boost::json::detail::charconv::detail::errno_to_errc(int errno_value) noexcept +{ + switch (errno_value) + { + case EINVAL: + return std::errc::invalid_argument; + case ERANGE: + return std::errc::result_out_of_range; + default: + return std::errc(); + } +} + +boost::json::detail::charconv::from_chars_result boost::json::detail::charconv::from_chars(const char* first, const char* last, double& value, boost::json::detail::charconv::chars_format fmt) noexcept +{ + if (fmt != boost::json::detail::charconv::chars_format::hex) + { + return boost::json::detail::charconv::detail::fast_float::from_chars(first, last, value, fmt); + } + return boost::json::detail::charconv::detail::from_chars_float_impl(first, last, value, fmt); +} diff --git a/include/boost/json/detail/charconv/limits.hpp b/include/boost/json/detail/charconv/limits.hpp new file mode 100644 index 00000000..f5a2d7b9 --- /dev/null +++ b/include/boost/json/detail/charconv/limits.hpp @@ -0,0 +1,86 @@ +// Copyright 2023 Matt Borland +// Distributed under the Boost Software License, Version 1.0. +// https://www.boost.org/LICENSE_1_0.txt + +#ifndef BOOST_JSON_DETAIL_CHARCONV_LIMITS_HPP +#define BOOST_JSON_DETAIL_CHARCONV_LIMITS_HPP + +#include +#include +#include + +namespace boost { namespace json { namespace detail { namespace charconv { + +// limits::max_chars10: the minimum size of the buffer that needs to be +// passed to to_chars to guarantee successful conversion for all values of +// type T, when either no base is passed, or base 10 is passed +// +// limits::max_chars: the minimum size of the buffer that needs to be +// passed to to_chars to guarantee successful conversion for all values of +// type T, for any value of base + +namespace detail +{ + +constexpr int exp_digits( int exp ) +{ + return exp < 100? 2: exp < 1000? 3: exp < 10000? 4: 5; +} + +#if defined(BOOST_HAS_INT128) + +template struct is_int128: std::is_same {}; +template struct is_uint128: std::is_same {}; + +#else + +template struct is_int128: std::false_type {}; +template struct is_uint128: std::false_type {}; + +#endif + +} // namespace detail + +template struct limits +{ + static constexpr int max_chars10 = + + // int128_t + detail::is_int128::value? 38+2: // digits10 + 1 + sign + + // uint128_t + detail::is_uint128::value? 38+1: // digits10 + 1 + + // integral + std::numeric_limits::is_integer? std::numeric_limits::digits10 + 1 + std::numeric_limits::is_signed: + + // floating point + std::numeric_limits::max_digits10 + 3 + 2 + detail::exp_digits( std::numeric_limits::max_exponent10 ); // -1.(max_digits10)e+(max_exp) + + static constexpr int max_chars = + + // int128_t + detail::is_int128::value? 127+2: // digits + 1 + sign + + // uint128_t + detail::is_uint128::value? 128+1: // digits + 1 + + // integral + std::numeric_limits::is_integer? std::numeric_limits::digits + 1 + std::numeric_limits::is_signed: + + // floating point + std::numeric_limits::max_digits10 + 3 + 2 + detail::exp_digits( std::numeric_limits::max_exponent10 ); // as above +}; + +#if defined(BOOST_NO_CXX17_INLINE_VARIABLES) + +// Definitions of in-class constexpr members are allowed but deprecated in C++17 + +template constexpr int limits::max_chars10; +template constexpr int limits::max_chars; + +#endif // defined(BOOST_NO_CXX17_INLINE_VARIABLES) + +}}}} // namespace boost::charconv + +#endif // BOOST_JSON_DETAIL_CHARCONV_LIMITS_HPP diff --git a/include/boost/json/src.hpp b/include/boost/json/src.hpp index 190bbeff..e28eb61a 100644 --- a/include/boost/json/src.hpp +++ b/include/boost/json/src.hpp @@ -55,5 +55,6 @@ in a translation unit of the program. #include #include +#include #endif diff --git a/test/Jamfile b/test/Jamfile index b2302f93..ac89586b 100644 --- a/test/Jamfile +++ b/test/Jamfile @@ -56,7 +56,11 @@ local SOURCES = ryu/d2s_test.cpp ; -project : requirements . ; +project + : requirements + . + msvc:_SCL_SECURE_NO_WARNINGS + ; for local f in $(SOURCES) { diff --git a/test/limits.cpp b/test/limits.cpp index 81b7ff96..c75d8a50 100644 --- a/test/limits.cpp +++ b/test/limits.cpp @@ -353,20 +353,29 @@ public: testNumber() { // very long floating point number - std::array buffer; + std::array buffer; buffer.fill('0'); buffer.data()[1] = '.'; - error_code ec; parse_options precise; precise.precise_parsing = true; + + stream_parser p( {}, precise ); + error_code ec; + p.write( buffer.data(), 1, ec ); BOOST_TEST_THROWS_WITH_LOCATION( - parse( {buffer.data(), buffer.size()}, ec, {}, precise )); + p.write( buffer.data() + 1, buffer.size() - 1, ec )); BOOST_TEST( !ec ); // now we make the number one character shorter - auto jv = parse( {buffer.data(), buffer.size() - 1}, ec, {}, precise ); + p.reset(); + p.write( buffer.data(), 1, ec ); BOOST_TEST( !ec ); + + p.write( buffer.data() + 1, buffer.size() - 2, ec ); + BOOST_TEST( !ec ); + + auto jv = p.release(); BOOST_TEST( jv.as_double() == 0 ); }