From ed6a0686dfad1f256469171e059ca5f4abab68d5 Mon Sep 17 00:00:00 2001 From: Niels Lohmann Date: Sat, 23 Jun 2018 17:05:04 +0200 Subject: [PATCH] :hammer: small refactoring to improve branch coverage The branch coverage reported by lcov is weird. The code before and after has the same Godbolt assembler, but the code with the lambda has a better branch coverage. --- .../nlohmann/detail/input/binary_reader.hpp | 32 ++++++++++--------- single_include/nlohmann/json.hpp | 32 ++++++++++--------- 2 files changed, 34 insertions(+), 30 deletions(-) diff --git a/include/nlohmann/detail/input/binary_reader.hpp b/include/nlohmann/detail/input/binary_reader.hpp index 9f2a53a5..726e552d 100644 --- a/include/nlohmann/detail/input/binary_reader.hpp +++ b/include/nlohmann/detail/input/binary_reader.hpp @@ -408,22 +408,24 @@ class binary_reader // half-precision floating-point numbers in the C language // is shown in Fig. 3. const int half = (byte1 << 8) + byte2; - const int exp = (half >> 10) & 0x1F; - const int mant = half & 0x3FF; - double val; - if (exp == 0) + const double val = [&half] { - val = std::ldexp(mant, -24); - } - else if (exp != 31) - { - val = std::ldexp(mant + 1024, exp - 25); - } - else - { - val = (mant == 0) ? std::numeric_limits::infinity() - : std::numeric_limits::quiet_NaN(); - } + const int exp = (half >> 10) & 0x1F; + const int mant = half & 0x3FF; + assert(0 <= exp and exp <= 32); + assert(0 <= mant and mant <= 1024); + switch (exp) + { + case 0: + return std::ldexp(mant, -24); + case 31: + return (mant == 0) + ? std::numeric_limits::infinity() + : std::numeric_limits::quiet_NaN(); + default: + return std::ldexp(mant + 1024, exp - 25); + } + }(); return sax->number_float((half & 0x8000) != 0 ? static_cast(-val) : static_cast(val), ""); diff --git a/single_include/nlohmann/json.hpp b/single_include/nlohmann/json.hpp index 4c9f4cd9..f4fc1fda 100644 --- a/single_include/nlohmann/json.hpp +++ b/single_include/nlohmann/json.hpp @@ -6041,22 +6041,24 @@ class binary_reader // half-precision floating-point numbers in the C language // is shown in Fig. 3. const int half = (byte1 << 8) + byte2; - const int exp = (half >> 10) & 0x1F; - const int mant = half & 0x3FF; - double val; - if (exp == 0) + const double val = [&half] { - val = std::ldexp(mant, -24); - } - else if (exp != 31) - { - val = std::ldexp(mant + 1024, exp - 25); - } - else - { - val = (mant == 0) ? std::numeric_limits::infinity() - : std::numeric_limits::quiet_NaN(); - } + const int exp = (half >> 10) & 0x1F; + assert(0 <= exp and exp <= 32); + const int mant = half & 0x3FF; + assert(0 <= mant and mant <= 1024); + switch (exp) + { + case 0: + return std::ldexp(mant, -24); + case 31: + return (mant == 0) + ? std::numeric_limits::infinity() + : std::numeric_limits::quiet_NaN(); + default: + return std::ldexp(mant + 1024, exp - 25); + } + }(); return sax->number_float((half & 0x8000) != 0 ? static_cast(-val) : static_cast(val), "");