boost_mirror/multiprecision
1
0
Fork 0
mirror of https://github.com/boostorg/multiprecision.git synced 2025-05-12 14:01:48 +00:00
Code Issues Packages Projects Releases Wiki Activity
multiprecision/performance/performance_test.hpp

721 lines
24 KiB
C++
Raw Blame History

///////////////////////////////////////////////////////////////
// Copyright 2011-9 John Maddock. Distributed under the Boost
// Software License, Version 1.0. (See accompanying file
// LICENSE_1_0.txt or copy at https://www.boost.org/LICENSE_1_0.txt
#define BOOST_CHRONO_HEADER_ONLY
#ifdef _MSC_VER
#define _SCL_SECURE_NO_WARNINGS
#endif
#if !defined(TEST_MPF) && !defined(TEST_MPZ) && \
!defined(TEST_CPP_DEC_FLOAT) && !defined(TEST_MPFR) && !defined(TEST_MPQ) && !defined(TEST_TOMMATH) && \
!defined(TEST_TOMMATH_BOOST_RATIONAL) && !defined(TEST_MPZ_BOOST_RATIONAL) && !defined(TEST_CPP_INT) && \
!defined(TEST_CPP_INT_RATIONAL) && !defined(TEST_CPP_BIN_FLOAT)
#define TEST_MPF
#define TEST_MPZ
#define TEST_MPQ
#define TEST_MPFR
#define TEST_CPP_DEC_FLOAT
#define TEST_MPQ
#define TEST_TOMMATH
#define TEST_CPP_INT
#define TEST_CPP_INT_RATIONAL
#define TEST_CPP_BIN_FLOAT
#ifdef _MSC_VER
#pragma message("CAUTION!!: No backend type specified so testing everything.... this will take some time!!")
#endif
#ifdef __GNUC__
#pragma warning "CAUTION!!: No backend type specified so testing everything.... this will take some time!!"
#endif
#endif
#include <boost/chrono.hpp>
#include <vector>
#include <map>
#include <string>
#include <cstring>
#include <cctype>
#include <iostream>
#include <iomanip>
#include <boost/random/mersenne_twister.hpp>
#include <boost/random/uniform_int.hpp>
#include <boost/multiprecision/number.hpp>
template <class Clock>
struct stopwatch
{
typedef typename Clock::duration duration;
stopwatch()
{
m_start = Clock::now();
}
duration elapsed()
{
return Clock::now() - m_start;
}
void reset()
{
m_start = Clock::now();
}
private:
typename Clock::time_point m_start;
};
extern unsigned bits_wanted; // for integer types
template <class T, int Type>
struct tester
{
tester()
{
a.assign(500, 0);
for (int i = 0; i < 500; ++i)
{
b.push_back(generate_random());
c.push_back(generate_random());
small.push_back(gen());
}
}
double test_add()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned j = 0; j < b.size(); ++j)
a[j] = b[j] + c[j];
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_subtract()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned j = 0; j < b.size(); ++j)
a[j] = b[j] - c[j];
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_add_int()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned j = 0; j < b.size(); ++j)
a[j] = b[j] + 1;
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_subtract_int()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned j = 0; j < b.size(); ++j)
a[j] = b[j] - 1;
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_multiply()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned k = 0; k < b.size(); ++k)
a[k] = b[k] * c[k];
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_multiply_int()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned j = 0; j < b.size(); ++j)
a[j] = b[j] * 3;
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_divide()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned j = 0; j < b.size(); ++j)
a[j] = b[j] / c[j] + b[j] / small[j];
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_divide_int()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned j = 0; j < b.size(); ++j)
a[j] = b[j] / 3;
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_str(const boost::mpl::false_&)
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < b.size(); ++i)
a[i] = boost::lexical_cast<T>(boost::lexical_cast<std::string>(b[i]));
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_str(const boost::mpl::true_&)
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < b.size(); ++i)
a[i].assign(b[i].str());
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_str()
{
return test_str(boost::is_class<T>());
}
//
// The following tests only work for integer types:
//
double test_mod()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned i = 0; i < b.size(); ++i)
a[i] = b[i] % c[i] + b[i] % small[i];
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_mod_int()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned i = 0; i < b.size(); ++i)
a[i] = b[i] % 254;
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_or()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned i = 0; i < b.size(); ++i)
a[i] = b[i] | c[i];
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_or_int()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned i = 0; i < b.size(); ++i)
a[i] = b[i] | 234;
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_and()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned i = 0; i < b.size(); ++i)
a[i] = b[i] & c[i];
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_and_int()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned i = 0; i < b.size(); ++i)
a[i] = b[i] & 234;
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_xor()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned i = 0; i < b.size(); ++i)
a[i] = b[i] ^ c[i];
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_xor_int()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned i = 0; i < b.size(); ++i)
a[i] = b[i] ^ 234;
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_complement()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned i = 0; i < b.size(); ++i)
a[i] = ~b[i];
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_left_shift()
{
int max_shift = std::numeric_limits<T>::is_bounded ? std::numeric_limits<T>::digits : bits_wanted;
int shift = 0;
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned i = 0; i < b.size(); ++i)
a[i] = b[i] << (shift++ % max_shift);
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_right_shift()
{
int max_shift = 2 + std::numeric_limits<T>::is_bounded ? std::numeric_limits<T>::digits : bits_wanted;
int shift = 0;
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned i = 0; i < b.size(); ++i)
a[i] = b[i] >> (shift++) % max_shift;
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_gcd()
{
using boost::integer::gcd;
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned i = 0; i < b.size(); ++i)
a[i] = gcd(b[i], c[i]);
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_powm()
{
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 25; ++i)
{
for (unsigned i = 0; i < b.size(); ++i)
a[i] = powm(b[i], b[i] / 2, c[i]);
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
double test_construct()
{
std::allocator<T> alloc;
T* pt = alloc.allocate(1000);
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned j = 0; j < 1000; ++j)
new (pt + j) T();
for (unsigned j = 0; j < 1000; ++j)
std::allocator_traits<std::allocator<T> >::destroy(alloc, pt + j);
}
double result = boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
alloc.deallocate(pt, 1000);
return result;
}
double test_construct_unsigned()
{
std::allocator<T> alloc;
T* pt = alloc.allocate(1000);
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned j = 0; j < 1000; ++j)
new (pt + j) T(j);
for (unsigned j = 0; j < 1000; ++j)
std::allocator_traits<std::allocator<T> >::destroy(alloc, pt + j);
}
double result = boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
alloc.deallocate(pt, 1000);
return result;
}
double test_construct_unsigned_ll()
{
std::allocator<T> alloc;
T* pt = alloc.allocate(1000);
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned long long j = 0; j < 1000; ++j)
new (pt + j) T(j);
for (unsigned j = 0; j < 1000; ++j)
std::allocator_traits<std::allocator<T> >::destroy(alloc, pt + j);
}
double result = boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
alloc.deallocate(pt, 1000);
return result;
}
//
// Hetero operations:
//
template <class U>
static U get_hetero_test_value(boost::mpl::false_ const&)
{
return U(2) / 3;
}
template <class U>
static U get_hetero_test_value(boost::mpl::true_ const&)
{
return (std::numeric_limits<U>::max)() >> 4;
}
template <class U>
static U get_hetero_test_value()
{
return get_hetero_test_value<U>(boost::is_integral<U>());
}
template <class U>
double test_multiply_hetero()
{
static const U val = get_hetero_test_value<U>();
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned j = 0; j < b.size(); ++j)
a[j] = b[j] * val;
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
template <class U>
double test_inplace_multiply_hetero()
{
static const U val = get_hetero_test_value<U>();
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned j = 0; j < b.size(); ++j)
a[j] = b[j], a[j] *= val;
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
template <class U>
double test_add_hetero()
{
static const U val = get_hetero_test_value<U>();
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned j = 0; j < b.size(); ++j)
a[j] = b[j] + val;
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
template <class U>
double test_inplace_add_hetero()
{
static const U val = get_hetero_test_value<U>();
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned j = 0; j < b.size(); ++j)
a[j] = b[j], a[j] += val;
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
template <class U>
double test_subtract_hetero()
{
static const U val = get_hetero_test_value<U>();
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned j = 0; j < b.size(); ++j)
a[j] = b[j] - val;
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
template <class U>
double test_inplace_subtract_hetero()
{
static const U val = get_hetero_test_value<U>();
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned j = 0; j < b.size(); ++j)
a[j] = b[j], a[j] -= val;
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
template <class U>
double test_divide_hetero()
{
static const U val = get_hetero_test_value<U>();
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned j = 0; j < b.size(); ++j)
a[j] = b[j] / val;
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
template <class U>
double test_inplace_divide_hetero()
{
static const U val = get_hetero_test_value<U>();
stopwatch<boost::chrono::high_resolution_clock> w;
for (unsigned i = 0; i < 1000; ++i)
{
for (unsigned j = 0; j < b.size(); ++j)
a[j] = b[j], a[j] /= val;
}
return boost::chrono::duration_cast<boost::chrono::duration<double> >(w.elapsed()).count();
}
private:
T generate_random()
{
return generate_random(boost::mpl::int_<Type>());
}
T generate_random(const boost::mpl::int_<boost::multiprecision::number_kind_floating_point>&)
{
T val = gen();
T prev_val = -1;
while (val != prev_val)
{
val *= (gen.max)();
prev_val = val;
val += gen();
}
int e;
val = frexp(val, &e);
typedef typename T::backend_type::exponent_type e_type;
static boost::random::uniform_int_distribution<e_type> ui(-30, 30);
return ldexp(val, static_cast<int>(ui(gen)));
}
T generate_random(const boost::mpl::int_<boost::multiprecision::number_kind_integer>&)
{
typedef boost::random::mt19937::result_type random_type;
T max_val;
unsigned digits;
if (std::numeric_limits<T>::is_bounded)
{
max_val = (std::numeric_limits<T>::max)();
digits = std::numeric_limits<T>::digits;
}
else
{
max_val = T(1) << bits_wanted;
digits = bits_wanted;
}
unsigned bits_per_r_val = std::numeric_limits<random_type>::digits - 1;
while ((random_type(1) << bits_per_r_val) > (gen.max)())
--bits_per_r_val;
unsigned terms_needed = digits / bits_per_r_val + 1;
T val = 0;
for (unsigned i = 0; i < terms_needed; ++i)
{
val *= (gen.max)();
val += gen();
}
val %= max_val;
return val;
}
T generate_random(const boost::mpl::int_<boost::multiprecision::number_kind_rational>&)
{
typedef boost::random::mt19937::result_type random_type;
typedef typename boost::multiprecision::component_type<T>::type IntType;
IntType max_val;
unsigned digits;
if (std::numeric_limits<IntType>::is_bounded)
{
max_val = (std::numeric_limits<IntType>::max)();
digits = std::numeric_limits<IntType>::digits;
}
else
{
max_val = IntType(1) << bits_wanted;
digits = bits_wanted;
}
unsigned bits_per_r_val = std::numeric_limits<random_type>::digits - 1;
while ((random_type(1) << bits_per_r_val) > (gen.max)())
--bits_per_r_val;
unsigned terms_needed = digits / bits_per_r_val + 1;
IntType val = 0;
IntType denom = 0;
for (unsigned i = 0; i < terms_needed; ++i)
{
val *= (gen.max)();
val += gen();
}
for (unsigned i = 0; i < terms_needed; ++i)
{
denom *= (gen.max)();
denom += gen();
}
if (denom == 0)
denom = 1;
val %= max_val;
denom %= max_val;
return T(val, denom);
}
std::vector<T> a, b, c, small;
static boost::random::mt19937 gen;
};
template <class N, int V>
boost::random::mt19937 tester<N, V>::gen;
inline const char* category_name(const boost::mpl::int_<boost::multiprecision::number_kind_integer>&)
{
return "integer";
}
inline const char* category_name(const boost::mpl::int_<boost::multiprecision::number_kind_floating_point>&)
{
return "float";
}
inline const char* category_name(const boost::mpl::int_<boost::multiprecision::number_kind_rational>&)
{
return "rational";
}
//
// Keys in order are:
// Category
// Operator
// Type
// Precision
// Time
//
extern std::map<std::string, std::map<std::string, std::map<std::string, std::map<int, double> > > > result_table;
inline void report_result(const char* cat, const char* type, const char* op, unsigned precision, double time)
{
std::cout << std::left << std::setw(15) << type << std::setw(10) << precision << std::setw(35) << op << time << std::endl;
result_table[cat][op][type][precision] = time;
}
template <class Number, int N>
void test_int_ops(tester<Number, N>& t, const char* type, unsigned precision, const boost::mpl::int_<boost::multiprecision::number_kind_integer>&)
{
const char* cat = "integer";
report_result(cat, type, "%", precision, t.test_mod());
report_result(cat, type, "|", precision, t.test_or());
report_result(cat, type, "&", precision, t.test_and());
report_result(cat, type, "^", precision, t.test_xor());
//report_result(cat, type, "~", precision, t.test_complement());
report_result(cat, type, "<<", precision, t.test_left_shift());
report_result(cat, type, ">>", precision, t.test_right_shift());
// integer ops:
report_result(cat, type, "%(int)", precision, t.test_mod_int());
report_result(cat, type, "|(int)", precision, t.test_or_int());
report_result(cat, type, "&(int)", precision, t.test_and_int());
report_result(cat, type, "^(int)", precision, t.test_xor_int());
report_result(cat, type, "gcd", precision, t.test_gcd());
report_result(cat, type, "powm", precision, t.test_powm());
}
template <class Number, int N, class U>
void test_int_ops(tester<Number, N>&, const char*, unsigned, const U&)
{
}
template <class Number>
void test(const char* type, unsigned precision)
{
bits_wanted = precision;
tester<Number, boost::multiprecision::number_category<Number>::value> t;
const char* cat = category_name(typename boost::multiprecision::number_category<Number>::type());
//
// call t.test_multiply() first so that the destination operands are
// forced to perform whatever memory allocation may be needed. That way
// we measure only algorithm performance, and not memory allocation effects.
//
t.test_multiply();
//
// Now the actual tests:
//
report_result(cat, type, "+", precision, t.test_add());
report_result(cat, type, "-", precision, t.test_subtract());
report_result(cat, type, "*", precision, t.test_multiply());
report_result(cat, type, "/", precision, t.test_divide());
report_result(cat, type, "str", precision, t.test_str());
// integer ops:
report_result(cat, type, "+(int)", precision, t.test_add_int());
report_result(cat, type, "-(int)", precision, t.test_subtract_int());
report_result(cat, type, "*(int)", precision, t.test_multiply_int());
report_result(cat, type, "/(int)", precision, t.test_divide_int());
// construction and destruction:
report_result(cat, type, "construct", precision, t.test_construct());
report_result(cat, type, "construct(unsigned)", precision, t.test_construct_unsigned());
report_result(cat, type, "construct(unsigned long long)", precision, t.test_construct_unsigned_ll());
test_int_ops(t, type, precision, typename boost::multiprecision::number_category<Number>::type());
// Hetero ops:
report_result(cat, type, "+(unsigned long long)", precision, t.template test_add_hetero<unsigned long long>());
report_result(cat, type, "-(unsigned long long)", precision, t.template test_subtract_hetero<unsigned long long>());
report_result(cat, type, "*(unsigned long long)", precision, t.template test_multiply_hetero<unsigned long long>());
report_result(cat, type, "/(unsigned long long)", precision, t.template test_divide_hetero<unsigned long long>());
report_result(cat, type, "+=(unsigned long long)", precision, t.template test_inplace_add_hetero<unsigned long long>());
report_result(cat, type, "-=(unsigned long long)", precision, t.template test_inplace_subtract_hetero<unsigned long long>());
report_result(cat, type, "*=(unsigned long long)", precision, t.template test_inplace_multiply_hetero<unsigned long long>());
report_result(cat, type, "/=(unsigned long long)", precision, t.template test_inplace_divide_hetero<unsigned long long>());
}
void test01();
void test02();
void test03();
void test04();
void test05();
void test06();
void test07();
void test08();
void test09();
void test10();
void test11();
void test12();
void test13();
void test14();
void test15();
void test16();
void test17();
void test18();
void test19();
void test20();
void test21();
void test22();
void test23();
void test24();
void test25();
void test26();
void test27();
void test28();
void test29();
void test30();
void test31();
void test32();
void test33();
void test34();
void test35();
void test36();
void test37();
void test38();
void test39();
Reference in New Issue View Git Blame Copy Permalink