mirror of
https://github.com/boostorg/json.git
synced 2025-05-11 13:44:06 +00:00
1177 lines
30 KiB
C++
1177 lines
30 KiB
C++
//
|
|
// Copyright (c) 2019 Vinnie Falco (vinnie.falco@gmail.com)
|
|
//
|
|
// Distributed under the Boost Software License, Version 1.0. (See accompanying
|
|
// file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
|
|
//
|
|
// Official repository: https://github.com/boostorg/json
|
|
//
|
|
|
|
#include <boost/json/detail/config.hpp>
|
|
|
|
#if defined(BOOST_JSON_USE_SSE2)
|
|
# define RAPIDJSON_SSE2
|
|
# define SSE2_ARCH_SUFFIX "/sse2"
|
|
#else
|
|
# define SSE2_ARCH_SUFFIX ""
|
|
#endif
|
|
|
|
#ifdef BOOST_JSON_HAS_NLOHMANN_JSON
|
|
# include "lib/nlohmann/single_include/nlohmann/json.hpp"
|
|
#endif // BOOST_JSON_HAS_NLOHMANN_JSON
|
|
|
|
#ifdef BOOST_JSON_HAS_RAPIDJSON
|
|
# include "lib/rapidjson/include/rapidjson/rapidjson.h"
|
|
# include "lib/rapidjson/include/rapidjson/document.h"
|
|
# include "lib/rapidjson/include/rapidjson/writer.h"
|
|
# include "lib/rapidjson/include/rapidjson/stringbuffer.h"
|
|
#endif // BOOST_JSON_HAS_RAPIDJSON
|
|
|
|
#include <boost/json.hpp>
|
|
#include <boost/json/basic_parser_impl.hpp>
|
|
#include <algorithm>
|
|
#include <chrono>
|
|
#include <fstream>
|
|
#include <iostream>
|
|
#include <memory>
|
|
#include <numeric>
|
|
#include <cstdio>
|
|
#include <vector>
|
|
|
|
#include "test_suite.hpp"
|
|
|
|
/* References
|
|
|
|
https://github.com/nst/JSONTestSuite
|
|
|
|
http://seriot.ch/parsing_json.php
|
|
*/
|
|
|
|
std::string s_tests = "ps";
|
|
std::string s_impls = "busorn";
|
|
std::size_t s_trials = 6;
|
|
std::string s_branch = "";
|
|
std::string s_alloc = "p";
|
|
std::string s_num_mode = "i";
|
|
std::string s_file_io = "n";
|
|
|
|
namespace boost {
|
|
namespace json {
|
|
|
|
using clock_type = std::chrono::steady_clock;
|
|
|
|
::test_suite::debug_stream dout(std::cerr);
|
|
std::stringstream strout;
|
|
|
|
#if defined(__clang__)
|
|
string_view toolset = "clang";
|
|
#elif defined(__GNUC__)
|
|
string_view toolset = "gcc";
|
|
#elif defined(_MSC_VER)
|
|
string_view toolset = "msvc";
|
|
#else
|
|
string_view toolset = "unknown";
|
|
#endif
|
|
|
|
#if BOOST_JSON_ARCH == 32
|
|
string_view arch = "x86" SSE2_ARCH_SUFFIX;
|
|
#elif BOOST_JSON_ARCH == 64
|
|
string_view arch = "x64" SSE2_ARCH_SUFFIX;
|
|
#else
|
|
#error Unknown architecture.
|
|
#endif
|
|
|
|
//----------------------------------------------------------
|
|
|
|
struct file_item
|
|
{
|
|
string_view name;
|
|
std::string text;
|
|
};
|
|
|
|
using file_list = std::vector<file_item>;
|
|
|
|
class any_impl
|
|
{
|
|
std::string name_;
|
|
parse_options popts_;
|
|
bool with_file_io_ = false;
|
|
|
|
public:
|
|
any_impl(
|
|
string_view base_name,
|
|
bool is_boost,
|
|
bool is_pool,
|
|
bool with_file_io,
|
|
parse_options const& popts)
|
|
: popts_(popts)
|
|
, with_file_io_(with_file_io)
|
|
{
|
|
std::string extra;
|
|
switch( popts_.numbers )
|
|
{
|
|
case number_precision::precise:
|
|
extra = "precise numbers";
|
|
break;
|
|
case number_precision::none:
|
|
extra = "no numbers";
|
|
break;
|
|
default:
|
|
break;
|
|
}
|
|
|
|
if( with_file_io_ )
|
|
{
|
|
if( !extra.empty() )
|
|
extra += '+';
|
|
extra += "file IO";
|
|
}
|
|
|
|
if( is_pool )
|
|
{
|
|
if( !extra.empty() )
|
|
extra = '+' + extra;
|
|
extra = "pool" + extra;
|
|
}
|
|
|
|
if( !extra.empty() )
|
|
extra = " (" + extra + ')';
|
|
|
|
if( is_boost && !s_branch.empty() )
|
|
extra += ' ' + s_branch;
|
|
|
|
name_ = base_name;
|
|
name_ += extra;
|
|
}
|
|
|
|
virtual ~any_impl() = default;
|
|
|
|
virtual
|
|
clock_type::duration
|
|
parse(string_view s, std::size_t repeat) const = 0;
|
|
|
|
virtual
|
|
clock_type::duration
|
|
parse(file_item const& fi, std::size_t repeat) const = 0;
|
|
|
|
virtual
|
|
clock_type::duration
|
|
serialize(string_view s, std::size_t repeat) const = 0;
|
|
|
|
string_view
|
|
name() const noexcept
|
|
{
|
|
return name_;
|
|
}
|
|
|
|
bool
|
|
with_file_io() const noexcept
|
|
{
|
|
return with_file_io_;
|
|
}
|
|
|
|
parse_options const&
|
|
get_parse_options() const noexcept
|
|
{
|
|
return popts_;
|
|
}
|
|
};
|
|
|
|
using impl_ptr = std::unique_ptr<any_impl const>;
|
|
using impl_list = std::vector<impl_ptr>;
|
|
|
|
std::string
|
|
load_file(char const* path)
|
|
{
|
|
FILE* f = fopen(path, "rb");
|
|
fseek(f, 0, SEEK_END);
|
|
auto const size = ftell(f);
|
|
std::string s;
|
|
s.resize(size);
|
|
fseek(f, 0, SEEK_SET);
|
|
auto const nread =
|
|
fread(&s[0], 1, size, f);
|
|
s.resize(nread);
|
|
fclose(f);
|
|
return s;
|
|
}
|
|
|
|
struct sample
|
|
{
|
|
std::size_t calls;
|
|
std::size_t millis;
|
|
std::size_t mbs;
|
|
};
|
|
|
|
// Returns the number of invocations per second
|
|
template<
|
|
class Rep,
|
|
class Period,
|
|
class F>
|
|
sample
|
|
run_for(std::chrono::duration<Rep, Period> interval, F&& f)
|
|
{
|
|
clock_type::duration elapsed(0);
|
|
std::size_t n = 0;
|
|
do
|
|
{
|
|
elapsed += f();
|
|
++n;
|
|
}
|
|
while(elapsed < interval);
|
|
return { n, static_cast<std::size_t>(
|
|
std::chrono::duration_cast<
|
|
std::chrono::milliseconds>(
|
|
elapsed).count()), 0 };
|
|
}
|
|
|
|
std::size_t
|
|
megabytes_per_second(
|
|
file_item const& file, std::size_t calls, std::size_t millis)
|
|
{
|
|
double result = file.text.size();
|
|
result /= 1024 * 1024; // size in megabytes
|
|
result *= calls;
|
|
result /= millis; // mb per ms
|
|
result *= 1000; // mb per s
|
|
return static_cast<std::size_t>(0.5 + result); // round up
|
|
}
|
|
|
|
std::ostream&
|
|
print_prefix(
|
|
std::ostream& os, file_item const& file, any_impl const& impl,
|
|
string_view verb)
|
|
{
|
|
return os << verb << " " << file.name << "," << toolset << " " <<
|
|
arch << "," << impl.name();
|
|
}
|
|
|
|
void
|
|
bench(
|
|
string_view verb,
|
|
file_list const& vf,
|
|
impl_list const& vi, std::size_t Trials)
|
|
{
|
|
std::vector<sample> trial;
|
|
for(unsigned i = 0; i < vf.size(); ++i)
|
|
{
|
|
for(unsigned j = 0; j < vi.size(); ++j)
|
|
{
|
|
trial.clear();
|
|
std::size_t repeat = 1;
|
|
auto const f = [&]
|
|
{
|
|
if(verb == "Parse")
|
|
{
|
|
if( vi[j]->with_file_io() )
|
|
return vi[j]->parse(vf[i], repeat);
|
|
else
|
|
return vi[j]->parse(vf[i].text, repeat);
|
|
}
|
|
|
|
BOOST_ASSERT( verb == "Serialize" );
|
|
if( vi[j]->with_file_io() )
|
|
return clock_type::duration::zero();
|
|
else
|
|
return vi[j]->serialize(vf[i].text, repeat);
|
|
};
|
|
// helps with the caching, which reduces noise; also, we determine
|
|
// if this configuration should be skipped altogether
|
|
auto const elapsed = f();
|
|
if( elapsed == std::chrono::milliseconds::zero() )
|
|
{
|
|
print_prefix(dout, vf[i], *vi[j], verb)
|
|
<< "," << "N/A"
|
|
<< "," << "N/A"
|
|
<< "," << "N/A"
|
|
<< "\n";
|
|
print_prefix(strout, vf[i], *vi[j], verb)
|
|
<< "," << "N/A" << "\n";
|
|
continue;
|
|
}
|
|
|
|
repeat = 1000;
|
|
for(unsigned k = 0; k < Trials; ++k)
|
|
{
|
|
auto result = run_for(std::chrono::seconds(5), f);
|
|
result.calls *= repeat;
|
|
result.mbs = megabytes_per_second(
|
|
vf[i], result.calls, result.millis);
|
|
print_prefix(dout, vf[i], *vi[j], verb)
|
|
<< "," << result.calls
|
|
<< "," << result.millis
|
|
<< "," << result.mbs
|
|
<< "\n";
|
|
trial.push_back(result);
|
|
// adjust repeat to avoid overlong tests
|
|
repeat = 250 * result.calls / result.millis;
|
|
}
|
|
|
|
// clean up the samples
|
|
std::sort(
|
|
trial.begin(),
|
|
trial.end(),
|
|
[](sample const& lhs, sample const& rhs)
|
|
{
|
|
return lhs.mbs < rhs.mbs;
|
|
});
|
|
if(Trials >= 6)
|
|
{
|
|
// discard worst 2
|
|
trial.erase(trial.begin(), trial.begin() + 2);
|
|
// discard best 1
|
|
trial.resize(trial.size() - 1);
|
|
}
|
|
else if(Trials > 3)
|
|
{
|
|
trial.erase(trial.begin(), trial.begin() + Trials - 3);
|
|
}
|
|
// average
|
|
auto const calls = std::accumulate(
|
|
trial.begin(), trial.end(),
|
|
std::size_t{},
|
|
[](std::size_t lhs, sample const& rhs)
|
|
{
|
|
return lhs + rhs.calls;
|
|
});
|
|
auto const millis = std::accumulate(
|
|
trial.begin(), trial.end(),
|
|
std::size_t{},
|
|
[](std::size_t lhs, sample const& rhs)
|
|
{
|
|
return lhs + rhs.millis;
|
|
});
|
|
auto const mbs = megabytes_per_second(vf[i], calls, millis);
|
|
print_prefix(strout, vf[i], *vi[j], verb) << "," << mbs << "\n";
|
|
}
|
|
}
|
|
}
|
|
|
|
//----------------------------------------------------------
|
|
|
|
class boost_impl : public any_impl
|
|
{
|
|
bool is_pool_;
|
|
|
|
public:
|
|
boost_impl(bool is_pool, bool with_file_io, parse_options const& popts)
|
|
: any_impl("boost", true, is_pool, with_file_io, popts)
|
|
, is_pool_(is_pool)
|
|
{}
|
|
|
|
clock_type::duration
|
|
parse(
|
|
string_view s,
|
|
std::size_t repeat) const override
|
|
{
|
|
auto const start = clock_type::now();
|
|
parser p( {}, get_parse_options() );
|
|
while(repeat--)
|
|
{
|
|
monotonic_resource mr;
|
|
storage_ptr sp;
|
|
if( is_pool_ )
|
|
sp = &mr;
|
|
p.reset( std::move(sp) );
|
|
|
|
p.write( s.data(), s.size() );
|
|
auto jv = p.release();
|
|
(void)jv;
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
|
|
clock_type::duration
|
|
parse(file_item const& fi, std::size_t repeat) const override
|
|
{
|
|
auto const start = clock_type::now();
|
|
stream_parser p( {}, get_parse_options() );
|
|
char s[ BOOST_JSON_STACK_BUFFER_SIZE];
|
|
while(repeat--)
|
|
{
|
|
monotonic_resource mr;
|
|
storage_ptr sp;
|
|
if( is_pool_ )
|
|
sp = &mr;
|
|
p.reset( std::move(sp) );
|
|
|
|
FILE* f = fopen(fi.name.data(), "rb");
|
|
|
|
while( true )
|
|
{
|
|
std::size_t const sz = fread(s, 1, sizeof(s), f);
|
|
if( ferror(f) )
|
|
break;
|
|
|
|
p.write(s, sz);
|
|
|
|
if( feof(f) )
|
|
break;
|
|
}
|
|
|
|
p.finish();
|
|
auto jv = p.release();
|
|
(void)jv;
|
|
|
|
fclose(f);
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
|
|
clock_type::duration
|
|
serialize(
|
|
string_view s,
|
|
std::size_t repeat) const override
|
|
{
|
|
monotonic_resource mr;
|
|
storage_ptr sp;
|
|
if( is_pool_ )
|
|
sp = &mr;
|
|
auto jv = json::parse( s, std::move(sp) );
|
|
|
|
auto const start = clock_type::now();
|
|
serializer sr;
|
|
string out;
|
|
out.reserve(512);
|
|
while(repeat--)
|
|
{
|
|
sr.reset(&jv);
|
|
out.clear();
|
|
for(;;)
|
|
{
|
|
out.grow(sr.read(
|
|
out.end(),
|
|
out.capacity() -
|
|
out.size()).size());
|
|
if(sr.done())
|
|
break;
|
|
out.reserve(
|
|
out.capacity() + 1);
|
|
}
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
};
|
|
|
|
//----------------------------------------------------------
|
|
|
|
class boost_null_impl : public any_impl
|
|
{
|
|
struct null_parser
|
|
{
|
|
struct handler
|
|
{
|
|
constexpr static std::size_t max_object_size = std::size_t(-1);
|
|
constexpr static std::size_t max_array_size = std::size_t(-1);
|
|
constexpr static std::size_t max_key_size = std::size_t(-1);
|
|
constexpr static std::size_t max_string_size = std::size_t(-1);
|
|
|
|
bool on_document_begin(system::error_code&) { return true; }
|
|
bool on_document_end(system::error_code&) { return true; }
|
|
bool on_object_begin(system::error_code&) { return true; }
|
|
bool on_object_end(std::size_t, system::error_code&) { return true; }
|
|
bool on_array_begin(system::error_code&) { return true; }
|
|
bool on_array_end(std::size_t, system::error_code&) { return true; }
|
|
bool on_key_part(string_view, std::size_t, system::error_code&) { return true; }
|
|
bool on_key( string_view, std::size_t, system::error_code&) { return true; }
|
|
bool on_string_part(string_view, std::size_t, system::error_code&) { return true; }
|
|
bool on_string(string_view, std::size_t, system::error_code&) { return true; }
|
|
bool on_number_part(string_view, system::error_code&) { return true; }
|
|
bool on_int64(std::int64_t, string_view, system::error_code&) { return true; }
|
|
bool on_uint64(std::uint64_t, string_view, system::error_code&) { return true; }
|
|
bool on_double(double, string_view, system::error_code&) { return true; }
|
|
bool on_bool(bool, system::error_code&) { return true; }
|
|
bool on_null(system::error_code&) { return true; }
|
|
bool on_comment_part(string_view, system::error_code&) { return true; }
|
|
bool on_comment(string_view, system::error_code&) { return true; }
|
|
};
|
|
|
|
basic_parser<handler> p_;
|
|
|
|
null_parser(parse_options const& popts)
|
|
: p_(popts)
|
|
{
|
|
}
|
|
|
|
void
|
|
reset()
|
|
{
|
|
p_.reset();
|
|
}
|
|
|
|
std::size_t
|
|
write(
|
|
char const* data,
|
|
std::size_t size,
|
|
system::error_code& ec)
|
|
{
|
|
auto const n = p_.write_some(
|
|
false, data, size, ec);
|
|
if(! ec && n < size)
|
|
ec = error::extra_data;
|
|
return n;
|
|
}
|
|
|
|
std::size_t
|
|
write_some(
|
|
char const* data,
|
|
std::size_t size,
|
|
system::error_code& ec)
|
|
{
|
|
return p_.write_some(
|
|
true, data, size, ec);
|
|
}
|
|
|
|
void
|
|
finish(system::error_code& ec)
|
|
{
|
|
p_.write_some(false, nullptr, 0, ec);
|
|
}
|
|
};
|
|
|
|
public:
|
|
boost_null_impl(bool with_file_io, parse_options const& popts)
|
|
: any_impl("boost (null)", true, false, with_file_io, popts)
|
|
{}
|
|
|
|
clock_type::duration
|
|
parse(
|
|
string_view s,
|
|
std::size_t repeat) const override
|
|
{
|
|
auto const start = clock_type::now();
|
|
null_parser p( get_parse_options() );
|
|
while(repeat--)
|
|
{
|
|
p.reset();
|
|
system::error_code ec;
|
|
p.write(s.data(), s.size(), ec);
|
|
if( ec.failed() )
|
|
throw system::system_error( ec );
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
|
|
clock_type::duration
|
|
parse(file_item const& fi, std::size_t repeat) const override
|
|
{
|
|
auto const start = clock_type::now();
|
|
null_parser p( get_parse_options() );
|
|
char s[ BOOST_JSON_STACK_BUFFER_SIZE];
|
|
while(repeat--)
|
|
{
|
|
p.reset();
|
|
|
|
FILE* f = fopen(fi.name.data(), "rb");
|
|
|
|
system::error_code ec;
|
|
while( true )
|
|
{
|
|
std::size_t const sz = fread(s, 1, sizeof(s), f);
|
|
if( ferror(f) )
|
|
{
|
|
ec = std::io_errc::stream;
|
|
break;
|
|
}
|
|
|
|
p.write_some( s, sz, ec );
|
|
if( ec.failed() )
|
|
break;
|
|
|
|
if( feof(f) )
|
|
break;
|
|
}
|
|
|
|
fclose(f);
|
|
|
|
if( ec.failed() )
|
|
throw system::system_error( ec );
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
|
|
clock_type::duration
|
|
serialize(
|
|
string_view, std::size_t) const override
|
|
{
|
|
return clock_type::duration(0);
|
|
}
|
|
};
|
|
|
|
//----------------------------------------------------------
|
|
|
|
class boost_simple_impl : public any_impl
|
|
{
|
|
bool is_pool_;
|
|
|
|
public:
|
|
boost_simple_impl(
|
|
bool is_pool, bool with_file_io, parse_options const& popts)
|
|
: any_impl("boost (convenient)", true, is_pool, with_file_io, popts)
|
|
, is_pool_(is_pool)
|
|
{}
|
|
|
|
clock_type::duration
|
|
parse(
|
|
string_view s,
|
|
std::size_t repeat) const override
|
|
{
|
|
auto const start = clock_type::now();
|
|
while(repeat--)
|
|
{
|
|
monotonic_resource mr;
|
|
storage_ptr sp;
|
|
if( is_pool_ )
|
|
sp = &mr;
|
|
|
|
auto jv = json::parse( s, std::move(sp), get_parse_options() );
|
|
(void)jv;
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
|
|
clock_type::duration
|
|
parse(file_item const& fi, std::size_t repeat) const override
|
|
{
|
|
auto const start = clock_type::now();
|
|
while(repeat--)
|
|
{
|
|
std::ifstream is( fi.name, std::ios::in | std::ios::binary );
|
|
|
|
monotonic_resource mr;
|
|
storage_ptr sp;
|
|
if( is_pool_ )
|
|
sp = &mr;
|
|
|
|
auto jv = json::parse( is, std::move(sp), get_parse_options() );
|
|
(void)jv;
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
|
|
clock_type::duration
|
|
serialize(
|
|
string_view s,
|
|
std::size_t repeat) const override
|
|
{
|
|
monotonic_resource mr;
|
|
storage_ptr sp;
|
|
if( is_pool_ )
|
|
sp = &mr;
|
|
auto jv = json::parse( s, std::move(sp) );
|
|
|
|
auto const start = clock_type::now();
|
|
std::string out;
|
|
while(repeat--)
|
|
out = json::serialize(jv);
|
|
return clock_type::now() - start;
|
|
}
|
|
};
|
|
|
|
class boost_operator_impl : public any_impl
|
|
{
|
|
bool is_pool_;
|
|
|
|
public:
|
|
boost_operator_impl(
|
|
bool is_pool, bool with_file_io, parse_options const& popts)
|
|
: any_impl("boost (operators)", true, is_pool, with_file_io, popts)
|
|
, is_pool_(is_pool)
|
|
{}
|
|
|
|
clock_type::duration
|
|
parse(string_view s, std::size_t repeat) const override
|
|
{
|
|
std::istringstream is(s);
|
|
is.exceptions(std::ios::failbit);
|
|
|
|
auto const start = clock_type::now();
|
|
while(repeat--)
|
|
{
|
|
monotonic_resource mr;
|
|
storage_ptr sp;
|
|
if( is_pool_ )
|
|
sp = &mr;
|
|
|
|
value jv( std::move(sp) );
|
|
is.seekg(0);
|
|
is >> get_parse_options() >> jv;
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
|
|
clock_type::duration
|
|
parse(file_item const& fi, std::size_t repeat) const override
|
|
{
|
|
auto const start = clock_type::now();
|
|
while(repeat--)
|
|
{
|
|
monotonic_resource mr;
|
|
storage_ptr sp;
|
|
if( is_pool_ )
|
|
sp = &mr;
|
|
|
|
std::ifstream is( fi.name, std::ios::in | std::ios::binary );
|
|
is.exceptions(std::ios::failbit);
|
|
|
|
value jv( std::move(sp) );
|
|
is >> get_parse_options() >> jv;
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
|
|
clock_type::duration
|
|
serialize(
|
|
string_view s,
|
|
std::size_t repeat) const override
|
|
{
|
|
monotonic_resource mr;
|
|
storage_ptr sp;
|
|
if( is_pool_ )
|
|
sp = &mr;
|
|
|
|
auto jv = json::parse( s, std::move(sp) );
|
|
|
|
auto const start = clock_type::now();
|
|
std::string out;
|
|
while(repeat--)
|
|
{
|
|
std::ostringstream os;
|
|
os.exceptions(std::ios::failbit);
|
|
os << jv;
|
|
out = os.str();
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
};
|
|
|
|
//----------------------------------------------------------
|
|
|
|
#ifdef BOOST_JSON_HAS_RAPIDJSON
|
|
struct rapidjson_crt_impl : public any_impl
|
|
{
|
|
rapidjson_crt_impl(bool with_file_io)
|
|
: any_impl("rapidjson", false, false, with_file_io, parse_options() )
|
|
{}
|
|
|
|
clock_type::duration
|
|
parse(
|
|
string_view s, std::size_t repeat) const override
|
|
{
|
|
using namespace rapidjson;
|
|
auto const start = clock_type::now();
|
|
while(repeat--)
|
|
{
|
|
CrtAllocator alloc;
|
|
GenericDocument<
|
|
UTF8<>, CrtAllocator> d(&alloc);
|
|
d.Parse(s.data(), s.size());
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
|
|
clock_type::duration
|
|
parse(file_item const& fi, std::size_t repeat) const override
|
|
{
|
|
using namespace rapidjson;
|
|
|
|
auto const start = clock_type::now();
|
|
char* s = new char[ fi.text.size() ];
|
|
std::unique_ptr<char[]> holder(s);
|
|
|
|
while(repeat--)
|
|
{
|
|
FILE* f = fopen(fi.name.data(), "rb");
|
|
std::size_t const sz = fread(s, 1, fi.text.size(), f);
|
|
|
|
CrtAllocator alloc;
|
|
GenericDocument<
|
|
UTF8<>, CrtAllocator> d(&alloc);
|
|
d.Parse(s, sz);
|
|
|
|
fclose(f);
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
|
|
clock_type::duration
|
|
serialize(string_view s, std::size_t repeat) const override
|
|
{
|
|
using namespace rapidjson;
|
|
CrtAllocator alloc;
|
|
GenericDocument<
|
|
UTF8<>, CrtAllocator> d(&alloc);
|
|
d.Parse(s.data(), s.size());
|
|
|
|
auto const start = clock_type::now();
|
|
rapidjson::StringBuffer st;
|
|
while(repeat--)
|
|
{
|
|
st.Clear();
|
|
rapidjson::Writer<
|
|
rapidjson::StringBuffer> wr(st);
|
|
d.Accept(wr);
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
};
|
|
|
|
struct rapidjson_memory_impl : public any_impl
|
|
{
|
|
rapidjson_memory_impl(bool with_file_io)
|
|
: any_impl("rapidjson", false, true, with_file_io, parse_options() )
|
|
{}
|
|
|
|
clock_type::duration
|
|
parse(
|
|
string_view s, std::size_t repeat) const override
|
|
{
|
|
auto const start = clock_type::now();
|
|
while(repeat--)
|
|
{
|
|
rapidjson::Document d;
|
|
d.Parse(s.data(), s.size());
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
|
|
clock_type::duration
|
|
parse(file_item const& fi, std::size_t repeat) const override
|
|
{
|
|
using namespace rapidjson;
|
|
|
|
auto const start = clock_type::now();
|
|
char* s = new char[ fi.text.size() ];
|
|
std::unique_ptr<char[]> holder(s);
|
|
|
|
while(repeat--)
|
|
{
|
|
FILE* f = fopen(fi.name.data(), "rb");
|
|
std::size_t const sz = fread(s, 1, fi.text.size(), f);
|
|
|
|
rapidjson::Document d;
|
|
d.Parse(s, sz);
|
|
|
|
fclose(f);
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
|
|
clock_type::duration
|
|
serialize(string_view s, std::size_t repeat) const override
|
|
{
|
|
rapidjson::Document d;
|
|
d.Parse(s.data(), s.size());
|
|
|
|
auto const start = clock_type::now();
|
|
rapidjson::StringBuffer st;
|
|
while(repeat--)
|
|
{
|
|
st.Clear();
|
|
rapidjson::Writer<
|
|
rapidjson::StringBuffer> wr(st);
|
|
d.Accept(wr);
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
};
|
|
#endif // BOOST_JSON_HAS_RAPIDJSON
|
|
|
|
//----------------------------------------------------------
|
|
|
|
#ifdef BOOST_JSON_HAS_NLOHMANN_JSON
|
|
struct nlohmann_impl : public any_impl
|
|
{
|
|
nlohmann_impl(bool with_file_io)
|
|
: any_impl("nlohmann", false, false, with_file_io, parse_options() )
|
|
{}
|
|
|
|
clock_type::duration
|
|
parse(string_view s, std::size_t repeat) const override
|
|
{
|
|
auto const start = clock_type::now();
|
|
while(repeat--)
|
|
{
|
|
auto jv = nlohmann::json::parse(
|
|
s.begin(), s.end());
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
|
|
clock_type::duration
|
|
parse(file_item const& fi, std::size_t repeat) const override
|
|
{
|
|
auto const start = clock_type::now();
|
|
char* s = new char[ fi.text.size() ];
|
|
std::unique_ptr<char[]> holder(s);
|
|
|
|
while(repeat--)
|
|
{
|
|
FILE* f = fopen(fi.name.data(), "rb");
|
|
std::size_t const sz = fread(s, 1, fi.text.size(), f);
|
|
|
|
auto jv = nlohmann::json::parse(s, s + sz);
|
|
|
|
fclose(f);
|
|
}
|
|
return clock_type::now() - start;
|
|
}
|
|
|
|
clock_type::duration
|
|
serialize(string_view s, std::size_t repeat) const override
|
|
{
|
|
auto jv = nlohmann::json::parse(
|
|
s.begin(), s.end());
|
|
|
|
auto const start = clock_type::now();
|
|
while(repeat--)
|
|
auto st = jv.dump();
|
|
return clock_type::now() - start;
|
|
}
|
|
};
|
|
#endif // BOOST_JSON_HAS_NLOHMANN_JSON
|
|
|
|
} // json
|
|
} // boost
|
|
|
|
//
|
|
|
|
using namespace boost::json;
|
|
|
|
static bool parse_option( char const* s )
|
|
{
|
|
if( *s == 0 )
|
|
return false;
|
|
|
|
char opt = *s++;
|
|
|
|
if( *s++ != ':' )
|
|
return false;
|
|
|
|
switch( opt )
|
|
{
|
|
case 't':
|
|
s_tests = s;
|
|
break;
|
|
|
|
case 'i':
|
|
s_impls = s;
|
|
break;
|
|
|
|
case 'n':
|
|
{
|
|
int k = std::atoi( s );
|
|
|
|
if( k > 0 )
|
|
s_trials = k;
|
|
else
|
|
return false;
|
|
}
|
|
break;
|
|
|
|
case 'b':
|
|
s_branch = s;
|
|
break;
|
|
|
|
case 'a':
|
|
s_alloc = s;
|
|
break;
|
|
|
|
case 'm':
|
|
s_num_mode = s;
|
|
break;
|
|
|
|
case 'f':
|
|
s_file_io = s;
|
|
break;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
bool add_impl(impl_list & vi, char kind, char alloc, char io, char num)
|
|
{
|
|
parse_options popts;
|
|
switch(num)
|
|
{
|
|
case 'i':
|
|
popts.numbers = number_precision::imprecise;
|
|
break;
|
|
case 'p':
|
|
popts.numbers = number_precision::precise;
|
|
break;
|
|
case 'n':
|
|
popts.numbers = number_precision::none;
|
|
break;
|
|
default:
|
|
return false;
|
|
}
|
|
bool const with_file_io = io == 'y';
|
|
bool const is_pool = alloc == 'p';
|
|
|
|
impl_ptr impl;
|
|
switch( kind )
|
|
{
|
|
case 'b':
|
|
impl = std::make_unique<boost_impl>(is_pool, with_file_io, popts);
|
|
break;
|
|
|
|
case 'u':
|
|
impl = std::make_unique<boost_null_impl>(with_file_io, popts);
|
|
break;
|
|
|
|
case 's':
|
|
impl = std::make_unique<boost_simple_impl>(
|
|
is_pool, with_file_io, popts);
|
|
break;
|
|
|
|
case 'o':
|
|
impl = std::make_unique<boost_operator_impl>(
|
|
is_pool, with_file_io, popts);
|
|
break;
|
|
|
|
#ifdef BOOST_JSON_HAS_RAPIDJSON
|
|
case 'r':
|
|
if(is_pool)
|
|
impl = std::make_unique<rapidjson_memory_impl>(with_file_io);
|
|
else
|
|
impl = std::make_unique<rapidjson_crt_impl>(with_file_io);
|
|
break;
|
|
#endif // BOOST_JSON_HAS_RAPIDJSON
|
|
|
|
#ifdef BOOST_JSON_HAS_NLOHMANN_JSON
|
|
case 'n':
|
|
impl = std::make_unique<nlohmann_impl>(with_file_io);
|
|
break;
|
|
#endif // BOOST_JSON_HAS_NLOHMANN_JSON
|
|
|
|
default:
|
|
std::cerr << "Unknown implementation: '" << kind << "'\n";
|
|
return false;
|
|
}
|
|
|
|
vi.emplace_back( std::move(impl) );
|
|
return true;
|
|
}
|
|
|
|
static bool do_test( file_list const & vf, impl_list const & vi, char test )
|
|
{
|
|
switch( test )
|
|
{
|
|
case 'p':
|
|
bench("Parse", vf, vi, s_trials);
|
|
break;
|
|
|
|
case 's':
|
|
bench("Serialize", vf, vi, s_trials);
|
|
break;
|
|
|
|
default:
|
|
std::cerr << "Unknown test type: '" << test << "'\n";
|
|
return false;
|
|
}
|
|
|
|
return true;
|
|
}
|
|
|
|
int
|
|
main(
|
|
int const argc,
|
|
char const* const* const argv)
|
|
{
|
|
if( argc < 2 )
|
|
{
|
|
std::cerr <<
|
|
"Usage: bench [options...] <file>...\n"
|
|
"\n"
|
|
"Options: -t:[p][s] Test parsing, serialization or both\n"
|
|
" (default both)\n"
|
|
" -i:[b][u][s][o][r][n] Test the specified implementations\n"
|
|
" (b: Boost.JSON)\n"
|
|
" (u: Boost.JSON, null parser)\n"
|
|
" (s: Boost.JSON, convenient functions)\n"
|
|
" (o: Boost.JSON, stream operators)\n"
|
|
#ifdef BOOST_JSON_HAS_RAPIDJSON
|
|
" (r: RapidJSON)\n"
|
|
#endif // BOOST_JSON_HAS_RAPIDJSON
|
|
#ifdef BOOST_JSON_HAS_NLOHMANN_JSON
|
|
" (n: nlohmann/json)\n"
|
|
#endif // BOOST_JSON_HAS_NLOHMANN_JSON
|
|
" (default all)\n"
|
|
" -a:(p|d) Memory allocation strategy\n"
|
|
" (p: memory pool)\n"
|
|
" (d: default strategy)\n"
|
|
" (default memory pool)\n"
|
|
" -n:<number> Number of trials (default 6)\n"
|
|
" -b:<branch> Branch label for boost implementations\n"
|
|
" -m:(i|p|n) Number parsing mode\n"
|
|
" (i: imprecise)\n"
|
|
" (p: precise)\n"
|
|
" (n: none)\n"
|
|
" (default imprecise)\n"
|
|
" -f:(y|n) Include file IO into consideration when testing parsers\n"
|
|
" (y: yes)\n"
|
|
" (n: no)\n"
|
|
" (default no)\n"
|
|
;
|
|
|
|
return 4;
|
|
}
|
|
|
|
file_list vf;
|
|
|
|
for( int i = 1; i < argc; ++i )
|
|
{
|
|
char const* s = argv[ i ];
|
|
|
|
if( *s == '-' )
|
|
{
|
|
if( !parse_option( s+1 ) )
|
|
std::cerr << "Unrecognized or incorrect option: '" << s << "'\n";
|
|
}
|
|
else
|
|
{
|
|
vf.emplace_back( file_item{ argv[i], load_file( s ) } );
|
|
}
|
|
}
|
|
|
|
try
|
|
{
|
|
impl_list vi;
|
|
|
|
for( char impl: s_impls )
|
|
for( char alloc: s_alloc )
|
|
for( char num: s_num_mode )
|
|
for( char io: s_file_io )
|
|
add_impl( vi, impl, alloc, io, num );
|
|
|
|
// remove duplicate implementations
|
|
std::sort(
|
|
vi.begin(),
|
|
vi.end(),
|
|
[](impl_ptr const& l, impl_ptr const& r)
|
|
{
|
|
return l->name() < r->name();
|
|
});
|
|
auto const it = std::unique(
|
|
vi.begin(),
|
|
vi.end(),
|
|
[](impl_ptr const& l, impl_ptr const& r)
|
|
{
|
|
return l->name() == r->name();
|
|
});
|
|
vi.erase( it, vi.end() );
|
|
|
|
for( char ch: s_tests )
|
|
do_test( vf, vi, ch );
|
|
|
|
dout << "\n" << strout.str();
|
|
}
|
|
catch(boost::system::system_error const& se)
|
|
{
|
|
dout << se.what() << std::endl;
|
|
}
|
|
|
|
return 0;
|
|
}
|