// floating_point_test.cpp -----------------------------------------------------------// // Copyright Beman Dawes 2015 // Distributed under the Boost Software License, Version 1.0. // See http://www.boost.org/LICENSE_1_0.txt // See library home page at http://www.boost.org/libs/endian //--------------------------------------------------------------------------------------// #include //#define BOOST_ENDIAN_LOG #include #include #include #include #include #include #include #include #include #include #include using namespace boost::endian; using std::cout; using std::endl; using std::hex; using std::dec; using std::numeric_limits; namespace { // to_big() and to_little() provide convenient independent functions for // creating test values of known endianness. template T to_big(T x) { # ifdef BOOST_LITTLE_ENDIAN std::reverse(reinterpret_cast(&x), reinterpret_cast(&x) + sizeof(T)); # endif return x; } template T to_little(T x) { # ifdef BOOST_BIG_ENDIAN std::reverse(reinterpret_cast(&x), reinterpret_cast(&x) + sizeof(T)); # endif return x; } template struct test_case { std::string desc; T value; // native value and representation std::string big; // as hex characters; invariant size() == 2*sizeof(T) std::string little; // as hex characters; invariant size() == 2*sizeof(T) // big and little endian expected values are held as strings so representation is // independent of platform endianness and readers do not have to perform mental // gymnastics to reason about what the expected representation is for a platform. const test_case& assign(const std::string& desc_, const T& value_, const std::string& big_, const std::string& little_) { desc = desc_; std::memcpy(&value, &value_, sizeof(T)); // use memcpy in case copy assignment or // copy construction alters representation big = big_; little = little_; return *this; } }; // to_big_inplace() and to_little_inplace() provide convenient independent functions to // aid creating test values of known endianness. They do so in place to avoid the // possibility that floating point assignment or copy construction modifies the // representation, such as for normalization. template void to_big_inplace(T& x) { # ifdef BOOST_LITTLE_ENDIAN std::reverse(reinterpret_cast(&x), reinterpret_cast(&x) + sizeof(T)); # endif } template void to_little_inplace(T& x) { # ifdef BOOST_BIG_ENDIAN std::reverse(reinterpret_cast(&x), reinterpret_cast(&x) + sizeof(T)); # endif } template std::string to_hex(const T& x) { const char hex[] = { '0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f' }; std::string tmp; const unsigned char* p = reinterpret_cast(&x); const unsigned char* e = p + sizeof(T); for (; p < e; ++p) { tmp += hex[*p >> 4]; // high-order nibble tmp += hex[*p & 0x0f]; // low-order nibble } return tmp; } const std::size_t n_test_cases = 16; boost::array, n_test_cases> float_test_cases; boost::array, n_test_cases> double_test_cases; void build_auto_test_cases() { using namespace boost::math::constants; int i = 0; // template for cut-and-paste of new values // float_test_cases[i].assign("", , "", ""); // double_test_cases[i++].assign("", , "", ""); float_test_cases[i].assign("numeric_limits::min()", numeric_limits::min(), "00800000", "00008000"); double_test_cases[i++].assign("numeric_limits::min()", numeric_limits::min(), "0010000000000000", "0000000000001000"); float_test_cases[i].assign("numeric_limits::max()", numeric_limits::max(), "7f7fffff", "ffff7f7f"); double_test_cases[i++].assign("numeric_limits::max()", numeric_limits::max(), "7fefffffffffffff", "ffffffffffffef7f"); float_test_cases[i].assign("numeric_limits::lowest()", numeric_limits::lowest(), "ff7fffff", "ffff7fff"); double_test_cases[i++].assign("numeric_limits::lowest()", numeric_limits::lowest(), "ffefffffffffffff", "ffffffffffffefff"); float_test_cases[i].assign("numeric_limits::epsilon()", numeric_limits::epsilon(), "34000000", "00000034"); double_test_cases[i++].assign("numeric_limits::epsilon()", numeric_limits::epsilon(), "3cb0000000000000", "000000000000b03c"); float_test_cases[i].assign("numeric_limits::round_error()", numeric_limits::round_error(), "3f000000", "0000003f"); double_test_cases[i++].assign("numeric_limits::round_error()", numeric_limits::round_error(), "3fe0000000000000", "000000000000e03f"); float_test_cases[i].assign("numeric_limits::infinity()", numeric_limits::infinity(), "7f800000", "0000807f"); double_test_cases[i++].assign("numeric_limits::infinity()", numeric_limits::infinity(), "7ff0000000000000", "000000000000f07f"); float_test_cases[i].assign("-numeric_limits::infinity()", -numeric_limits::infinity(), "ff800000", "000080ff"); double_test_cases[i++].assign("-numeric_limits::infinity()", -numeric_limits::infinity(), "fff0000000000000", "000000000000f0ff"); float_test_cases[i].assign("numeric_limits::quiet_NaN()", numeric_limits::quiet_NaN(), "7fc00000", "0000c07f"); double_test_cases[i++].assign("numeric_limits::quiet_NaN()", numeric_limits::quiet_NaN(), "7ff8000000000000", "000000000000f87f"); float_test_cases[i].assign("numeric_limits::signaling_NaN()", numeric_limits::signaling_NaN(), "7fc00001", "0100c07f"); double_test_cases[i++].assign("numeric_limits::signaling_NaN()", numeric_limits::signaling_NaN(), "7ff8000000000001", "010000000000f87f"); float_test_cases[i].assign("numeric_limits::denorm_min()", numeric_limits::denorm_min(), "00000001", "01000000"); double_test_cases[i++].assign("numeric_limits::denorm_min()", numeric_limits::denorm_min(), "0000000000000001", "0100000000000000"); float_test_cases[i].assign("0.0f", 0.0f, "00000000", "00000000"); double_test_cases[i++].assign("0.0", 0.0, "0000000000000000", "0000000000000000"); float_test_cases[i].assign("-0.0f", -0.0f, "80000000", "00000080"); double_test_cases[i++].assign("-0.0", -0.0, "8000000000000000", "0000000000000080"); float_test_cases[i].assign("1.0f", 1.0f, "3f800000", "0000803f"); double_test_cases[i++].assign("1.0", 1.0, "3ff0000000000000", "000000000000f03f"); float_test_cases[i].assign("-1.0f", -1.0f, "bf800000", "000080bf"); double_test_cases[i++].assign("-1.0", -1.0, "bff0000000000000", "000000000000f0bf"); uint32_t vf1 (0x12345678U); float_test_cases[i].assign("native uint32_t 0x12345678U as float", *reinterpret_cast(&vf1), "12345678", "78563412"); uint64_t vd1 (0x0123456789abcdefULL); double_test_cases[i++].assign("native uint64_t 0x0123456789abcdefULL as double", *reinterpret_cast(&vd1), "0123456789abcdef", "efcdab8967452301"); float_test_cases[i].assign("pi()", pi(), "40490fdb", "db0f4940"); double_test_cases[i++].assign("pi()", pi(), "400921fb54442d18", "182d4454fb210940"); BOOST_ASSERT(i == n_test_cases); } template void show_value(const char* desc, const T& value) { cout << " " << desc << " " << value << ", native 0x" << to_hex(value) << ", big 0x" << to_hex(native_to_big(value)) << ", little 0x" << to_hex(native_to_little(value)) << "\n"; } template void report_limits(const char* type) { using namespace boost::math::constants; cout << "\nHeader values for std::numeric_limits<" << type << ">\n\n"; cout << " is_specialized " << numeric_limits::is_specialized << "\n"; cout << " is_signed " << numeric_limits::is_signed << "\n"; cout << " is_integer " << numeric_limits::is_integer << "\n"; cout << " is_exact " << numeric_limits::is_exact << "\n"; cout << " is_iec559 " << numeric_limits::is_iec559 << "\n"; cout << " is_bounded " << numeric_limits::is_bounded << "\n"; cout << " is_modulo " << numeric_limits::is_modulo << "\n"; cout << " traps " << numeric_limits::traps << "\n"; cout << " tinyness_before " << numeric_limits::tinyness_before << "\n"; cout << " round_style " << numeric_limits::round_style << "\n"; cout << " has_infinity " << numeric_limits::has_infinity << "\n"; cout << " has_quiet_NaN " << numeric_limits::has_quiet_NaN << "\n"; cout << " has_signaling_NaN " << numeric_limits::has_signaling_NaN << "\n"; cout << " has_denorm " << numeric_limits::has_denorm << "\n"; cout << " digits " << numeric_limits::digits << "\n"; cout << " digits10 " << numeric_limits::digits10 << "\n"; cout << " max_digits10 " << numeric_limits::max_digits10 << "\n"; cout << " radix " << numeric_limits::radix << "\n"; cout << " min_exponent " << numeric_limits::min_exponent << "\n"; cout << " min_exponent10 " << numeric_limits::min_exponent10 << "\n"; cout << " max_exponent " << numeric_limits::max_exponent << "\n"; cout << " max_exponent10 " << numeric_limits::max_exponent10 << "\n"; show_value("min()", numeric_limits::min()); show_value("max()", numeric_limits::max()); show_value("lowest()", numeric_limits::lowest()); show_value("epsilon()", numeric_limits::epsilon()); show_value("round_error()", numeric_limits::round_error()); show_value("infinity()", numeric_limits::infinity()); show_value("-infinity()", -numeric_limits::infinity()); show_value("quiet_NaN()", numeric_limits::quiet_NaN()); show_value("signaling_NaN()", numeric_limits::signaling_NaN()); show_value("denorm_min()", numeric_limits::denorm_min()); show_value("0.0", static_cast(0.0)); show_value("-0.0", static_cast(-0.0)); show_value("1.0", static_cast(1.0)); show_value("-1.0", static_cast(-1.0)); show_value("pi()", pi()); } template void auto_test(const char* msg, const boost::array, n_test_cases>& cases) { cout << "auto test " << msg << " ..." << endl; for (int i = 0; i < n_test_cases; ++i) { cout << " " << cases[i].desc << endl; BOOST_TEST_EQ(to_hex(native_to_big(cases[i].value)), cases[i].big); BOOST_TEST_EQ(to_hex(native_to_little(cases[i].value)), cases[i].little); BOOST_TEST_MEM_EQ(endian_reverse(endian_reverse(cases[i].value)), cases[i].value); } } } // unnamed namespace //--------------------------------------------------------------------------------------// int cpp_main(int, char *[]) { cout << "byte swap intrinsics: " BOOST_ENDIAN_INTRINSIC_MSG << endl; //#define BOOST_ENDIAN_FORCE_ERROR #ifdef BOOST_ENDIAN_FORCE_ERROR BOOST_TEST_MEM_EQ(1.0f, 1.0); BOOST_TEST_MEM_EQ(1.0f, 1.1f); BOOST_TEST_MEM_EQ(1.0, 1.1); #endif build_auto_test_cases(); report_limits("float"); auto_test("float", float_test_cases); report_limits("double"); auto_test("double", double_test_cases); cout << "\n done" << endl; return ::boost::endian::report_errors(); } #include