fmtlegacy/include/fmt/format-inl.h

972 lines
32 KiB
C
Raw Normal View History

2018-01-06 17:09:50 +00:00
// Formatting library for C++
//
// Copyright (c) 2012 - 2016, Victor Zverovich
// All rights reserved.
//
// For the license information refer to format.h.
2012-12-07 16:31:09 +00:00
2018-03-21 14:50:59 +00:00
#ifndef FMT_FORMAT_INL_H_
#define FMT_FORMAT_INL_H_
2018-01-20 18:28:10 +00:00
#include "format.h"
2013-01-14 23:16:20 +00:00
2014-04-30 13:55:21 +00:00
#include <string.h>
2012-12-12 17:17:28 +00:00
#include <cctype>
2014-07-01 23:23:50 +00:00
#include <cerrno>
2014-04-24 19:37:06 +00:00
#include <climits>
2013-09-07 17:15:08 +00:00
#include <cmath>
#include <cstdarg>
#include <cstddef> // for std::ptrdiff_t
2018-08-26 15:12:35 +00:00
#include <cstring> // for std::memmove
#if !defined(FMT_STATIC_THOUSANDS_SEPARATOR)
# include <locale>
#endif
2013-09-07 17:15:08 +00:00
#if FMT_USE_WINDOWS_H
# if !defined(FMT_HEADER_ONLY) && !defined(WIN32_LEAN_AND_MEAN)
# define WIN32_LEAN_AND_MEAN
# endif
# if defined(NOMINMAX) || defined(FMT_WIN_MINMAX)
# include <windows.h>
# else
# define NOMINMAX
# include <windows.h>
# undef NOMINMAX
# endif
#endif
#if FMT_EXCEPTIONS
# define FMT_TRY try
# define FMT_CATCH(x) catch (x)
#else
# define FMT_TRY if (true)
# define FMT_CATCH(x) if (false)
#endif
#ifdef _MSC_VER
2014-03-11 18:56:24 +00:00
# pragma warning(push)
# pragma warning(disable: 4127) // conditional expression is constant
# pragma warning(disable: 4702) // unreachable code
2015-03-17 01:53:14 +00:00
// Disable deprecation warning for strerror. The latter is not called but
// MSVC fails to detect it.
# pragma warning(disable: 4996)
2014-03-11 18:56:24 +00:00
#endif
// Dummy implementations of strerror_r and strerror_s called if corresponding
// system functions are not available.
2018-02-10 14:28:33 +00:00
inline fmt::internal::null<> strerror_r(int, char *, ...) {
2017-02-19 16:41:38 +00:00
return fmt::internal::null<>();
}
2018-02-10 14:28:33 +00:00
inline fmt::internal::null<> strerror_s(char *, std::size_t, ...) {
2017-02-19 16:41:38 +00:00
return fmt::internal::null<>();
}
2018-05-12 15:33:51 +00:00
FMT_BEGIN_NAMESPACE
2016-06-14 15:11:33 +00:00
2013-09-07 17:15:08 +00:00
namespace {
#ifndef _MSC_VER
# define FMT_SNPRINTF snprintf
#else // _MSC_VER
2014-08-19 15:47:38 +00:00
inline int fmt_snprintf(char *buffer, size_t size, const char *format, ...) {
va_list args;
va_start(args, format);
int result = vsnprintf_s(buffer, size, _TRUNCATE, format, args);
va_end(args);
return result;
}
# define FMT_SNPRINTF fmt_snprintf
2013-09-07 17:15:08 +00:00
#endif // _MSC_VER
#if defined(_WIN32) && defined(__MINGW32__) && !defined(__NO_ISOCEXT)
# define FMT_SWPRINTF snwprintf
#else
# define FMT_SWPRINTF swprintf
#endif // defined(_WIN32) && defined(__MINGW32__) && !defined(__NO_ISOCEXT)
2018-01-14 22:15:59 +00:00
typedef void (*FormatFunc)(internal::buffer &, int, string_view);
// Portable thread-safe version of strerror.
// Sets buffer to point to a string describing the error code.
// This can be either a pointer to a string stored in buffer,
// or a pointer to some static immutable string.
// Returns one of the following values:
// 0 - success
// ERANGE - buffer is not large enough to store the error message
// other - failure
// Buffer should be at least of size 1.
int safe_strerror(
int error_code, char *&buffer, std::size_t buffer_size) FMT_NOEXCEPT {
FMT_ASSERT(buffer != FMT_NULL && buffer_size != 0, "invalid buffer");
2018-05-19 15:57:31 +00:00
class dispatcher {
private:
int error_code_;
char *&buffer_;
std::size_t buffer_size_;
2015-03-21 14:53:39 +00:00
// A noop assignment operator to avoid bogus warnings.
2018-05-19 15:57:31 +00:00
void operator=(const dispatcher &) {}
2015-03-21 14:53:39 +00:00
// Handle the result of XSI-compliant version of strerror_r.
int handle(int result) {
// glibc versions before 2.13 return result in errno.
return result == -1 ? errno : result;
}
// Handle the result of GNU-specific version of strerror_r.
int handle(char *message) {
// If the buffer is full then the message is probably truncated.
if (message == buffer_ && strlen(buffer_) == buffer_size_ - 1)
return ERANGE;
buffer_ = message;
return 0;
}
// Handle the case when strerror_r is not available.
2017-02-19 16:41:38 +00:00
int handle(internal::null<>) {
return fallback(strerror_s(buffer_, buffer_size_, error_code_));
}
// Fallback to strerror_s when strerror_r is not available.
int fallback(int result) {
// If the buffer is full then the message is probably truncated.
return result == 0 && strlen(buffer_) == buffer_size_ - 1 ?
ERANGE : result;
}
// Fallback to strerror if strerror_r and strerror_s are not available.
2017-02-19 16:41:38 +00:00
int fallback(internal::null<>) {
errno = 0;
buffer_ = strerror(error_code_);
return errno;
}
public:
2018-05-19 15:57:31 +00:00
dispatcher(int err_code, char *&buf, std::size_t buf_size)
: error_code_(err_code), buffer_(buf), buffer_size_(buf_size) {}
int run() {
return handle(strerror_r(error_code_, buffer_, buffer_size_));
}
};
2018-05-19 15:57:31 +00:00
return dispatcher(error_code, buffer, buffer_size).run();
}
2018-01-14 22:15:59 +00:00
void format_error_code(internal::buffer &out, int error_code,
string_view message) FMT_NOEXCEPT {
// Report error code making sure that the output fits into
// inline_buffer_size to avoid dynamic memory allocation and potential
// bad_alloc.
out.resize(0);
static const char SEP[] = ": ";
static const char ERROR_STR[] = "error ";
// Subtract 2 to account for terminating null characters in SEP and ERROR_STR.
std::size_t error_code_size = sizeof(SEP) + sizeof(ERROR_STR) - 2;
2017-02-19 14:46:51 +00:00
typedef internal::int_traits<int>::main_type main_type;
main_type abs_value = static_cast<main_type>(error_code);
if (internal::is_negative(error_code)) {
abs_value = 0 - abs_value;
++error_code_size;
}
error_code_size += internal::count_digits(abs_value);
2018-01-14 15:19:23 +00:00
writer w(out);
if (message.size() <= inline_buffer_size - error_code_size) {
w.write(message);
w.write(SEP);
2017-01-22 15:40:21 +00:00
}
w.write(ERROR_STR);
w.write(error_code);
assert(out.size() <= inline_buffer_size);
}
void report_error(FormatFunc func, int error_code,
string_view message) FMT_NOEXCEPT {
memory_buffer full_message;
2014-09-05 15:04:26 +00:00
func(full_message, error_code, message);
// Use Writer::data instead of Writer::c_str to avoid potential memory
// allocation.
std::fwrite(full_message.data(), full_message.size(), 1, stderr);
std::fputc('\n', stderr);
}
} // namespace
2018-10-04 01:22:26 +00:00
FMT_FUNC size_t internal::count_code_points(basic_string_view<char8_t> s) {
2018-09-30 18:39:20 +00:00
const char8_t *data = s.data();
size_t num_code_points = 0;
for (size_t i = 0, size = s.size(); i != size; ++i) {
if ((data[i] & 0xc0) != 0x80)
++num_code_points;
}
return num_code_points;
}
#if !defined(FMT_STATIC_THOUSANDS_SEPARATOR)
2018-11-14 17:39:37 +00:00
namespace internal {
2018-05-21 00:16:34 +00:00
2018-11-14 17:39:37 +00:00
template <typename Locale>
locale_ref::locale_ref(const Locale &loc) : locale_(&loc) {
static_assert(std::is_same<Locale, std::locale>::value, "");
}
template <typename Locale>
Locale locale_ref::get() const {
static_assert(std::is_same<Locale, std::locale>::value, "");
return locale_ ? *static_cast<const std::locale*>(locale_) : std::locale();
}
2018-05-21 00:16:34 +00:00
template <typename Char>
2018-11-14 17:39:37 +00:00
FMT_FUNC Char thousands_sep_impl(locale_ref loc) {
return std::use_facet<std::numpunct<Char> >(
loc.get<std::locale>()).thousands_sep();
}
2018-09-30 18:39:20 +00:00
}
#else
template <typename Char>
FMT_FUNC Char internal::thousands_sep_impl(locale_ref) {
return FMT_STATIC_THOUSANDS_SEPARATOR;
}
#endif
2017-02-19 16:41:38 +00:00
FMT_FUNC void system_error::init(
2017-12-03 15:32:04 +00:00
int err_code, string_view format_str, format_args args) {
2014-12-09 15:45:54 +00:00
error_code_ = err_code;
memory_buffer buffer;
format_system_error(buffer, err_code, vformat(format_str, args));
2014-06-30 21:26:29 +00:00
std::runtime_error &base = *this;
base = std::runtime_error(to_string(buffer));
2014-06-30 21:26:29 +00:00
}
2018-04-22 00:26:24 +00:00
namespace internal {
template <typename T>
2018-04-22 00:26:24 +00:00
int char_traits<char>::format_float(
2018-11-29 00:15:15 +00:00
char *buf, std::size_t size, const char *format, int precision, T value) {
return precision < 0 ?
2018-11-29 00:15:15 +00:00
FMT_SNPRINTF(buf, size, format, value) :
FMT_SNPRINTF(buf, size, format, precision, value);
}
template <typename T>
2018-04-22 00:26:24 +00:00
int char_traits<wchar_t>::format_float(
2018-11-29 00:15:15 +00:00
wchar_t *buf, std::size_t size, const wchar_t *format, int precision,
2018-05-29 03:16:30 +00:00
T value) {
return precision < 0 ?
2018-11-29 00:15:15 +00:00
FMT_SWPRINTF(buf, size, format, value) :
FMT_SWPRINTF(buf, size, format, precision, value);
}
template <typename T>
2018-04-22 00:26:24 +00:00
const char basic_data<T>::DIGITS[] =
"0001020304050607080910111213141516171819"
"2021222324252627282930313233343536373839"
"4041424344454647484950515253545556575859"
"6061626364656667686970717273747576777879"
"8081828384858687888990919293949596979899";
2014-02-19 20:43:55 +00:00
2014-02-19 21:02:22 +00:00
#define FMT_POWERS_OF_10(factor) \
factor * 10, \
factor * 100, \
factor * 1000, \
factor * 10000, \
factor * 100000, \
factor * 1000000, \
factor * 10000000, \
factor * 100000000, \
factor * 1000000000
template <typename T>
2018-04-22 00:26:24 +00:00
const uint32_t basic_data<T>::POWERS_OF_10_32[] = {
2018-08-25 23:08:32 +00:00
1, FMT_POWERS_OF_10(1)
};
template <typename T>
const uint32_t basic_data<T>::ZERO_OR_POWERS_OF_10_32[] = {
0, FMT_POWERS_OF_10(1)
};
template <typename T>
2018-08-25 23:08:32 +00:00
const uint64_t basic_data<T>::ZERO_OR_POWERS_OF_10_64[] = {
0,
2014-02-19 21:02:22 +00:00
FMT_POWERS_OF_10(1),
2017-08-26 16:09:43 +00:00
FMT_POWERS_OF_10(1000000000ull),
10000000000000000000ull
};
2018-04-29 13:33:05 +00:00
// Normalized 64-bit significands of pow(10, k), for k = -348, -340, ..., 340.
// These are generated by support/compute-powers.py.
template <typename T>
const uint64_t basic_data<T>::POW10_SIGNIFICANDS[] = {
2018-08-15 13:54:43 +00:00
0xfa8fd5a0081c0288, 0xbaaee17fa23ebf76, 0x8b16fb203055ac76,
0xcf42894a5dce35ea, 0x9a6bb0aa55653b2d, 0xe61acf033d1a45df,
0xab70fe17c79ac6ca, 0xff77b1fcbebcdc4f, 0xbe5691ef416bd60c,
0x8dd01fad907ffc3c, 0xd3515c2831559a83, 0x9d71ac8fada6c9b5,
0xea9c227723ee8bcb, 0xaecc49914078536d, 0x823c12795db6ce57,
0xc21094364dfb5637, 0x9096ea6f3848984f, 0xd77485cb25823ac7,
0xa086cfcd97bf97f4, 0xef340a98172aace5, 0xb23867fb2a35b28e,
0x84c8d4dfd2c63f3b, 0xc5dd44271ad3cdba, 0x936b9fcebb25c996,
0xdbac6c247d62a584, 0xa3ab66580d5fdaf6, 0xf3e2f893dec3f126,
0xb5b5ada8aaff80b8, 0x87625f056c7c4a8b, 0xc9bcff6034c13053,
0x964e858c91ba2655, 0xdff9772470297ebd, 0xa6dfbd9fb8e5b88f,
0xf8a95fcf88747d94, 0xb94470938fa89bcf, 0x8a08f0f8bf0f156b,
0xcdb02555653131b6, 0x993fe2c6d07b7fac, 0xe45c10c42a2b3b06,
0xaa242499697392d3, 0xfd87b5f28300ca0e, 0xbce5086492111aeb,
0x8cbccc096f5088cc, 0xd1b71758e219652c, 0x9c40000000000000,
0xe8d4a51000000000, 0xad78ebc5ac620000, 0x813f3978f8940984,
0xc097ce7bc90715b3, 0x8f7e32ce7bea5c70, 0xd5d238a4abe98068,
0x9f4f2726179a2245, 0xed63a231d4c4fb27, 0xb0de65388cc8ada8,
0x83c7088e1aab65db, 0xc45d1df942711d9a, 0x924d692ca61be758,
0xda01ee641a708dea, 0xa26da3999aef774a, 0xf209787bb47d6b85,
0xb454e4a179dd1877, 0x865b86925b9bc5c2, 0xc83553c5c8965d3d,
0x952ab45cfa97a0b3, 0xde469fbd99a05fe3, 0xa59bc234db398c25,
0xf6c69a72a3989f5c, 0xb7dcbf5354e9bece, 0x88fcf317f22241e2,
0xcc20ce9bd35c78a5, 0x98165af37b2153df, 0xe2a0b5dc971f303a,
0xa8d9d1535ce3b396, 0xfb9b7cd9a4a7443c, 0xbb764c4ca7a44410,
0x8bab8eefb6409c1a, 0xd01fef10a657842c, 0x9b10a4e5e9913129,
0xe7109bfba19c0c9d, 0xac2820d9623bf429, 0x80444b5e7aa7cf85,
0xbf21e44003acdd2d, 0x8e679c2f5e44ff8f, 0xd433179d9c8cb841,
0x9e19db92b4e31ba9, 0xeb96bf6ebadf77d9, 0xaf87023b9bf0ee6b,
2018-04-29 13:33:05 +00:00
};
// Binary exponents of pow(10, k), for k = -348, -340, ..., 340, corresponding
// to significands above.
template <typename T>
const int16_t basic_data<T>::POW10_EXPONENTS[] = {
-1220, -1193, -1166, -1140, -1113, -1087, -1060, -1034, -1007, -980, -954,
-927, -901, -874, -847, -821, -794, -768, -741, -715, -688, -661,
-635, -608, -582, -555, -529, -502, -475, -449, -422, -396, -369,
-343, -316, -289, -263, -236, -210, -183, -157, -130, -103, -77,
-50, -24, 3, 30, 56, 83, 109, 136, 162, 189, 216,
242, 269, 295, 322, 348, 375, 402, 428, 455, 481, 508,
534, 561, 588, 614, 641, 667, 694, 720, 747, 774, 800,
827, 853, 880, 907, 933, 960, 986, 1013, 1039, 1066
};
template <typename T> const char basic_data<T>::FOREGROUND_COLOR[] = "\x1b[38;2;";
template <typename T> const char basic_data<T>::BACKGROUND_COLOR[] = "\x1b[48;2;";
template <typename T> const char basic_data<T>::RESET_COLOR[] = "\x1b[0m";
template <typename T> const wchar_t basic_data<T>::WRESET_COLOR[] = L"\x1b[0m";
2018-08-29 16:34:57 +00:00
// A handmade floating-point number f * pow(2, e).
class fp {
private:
typedef uint64_t significand_type;
// All sizes are in bits.
static FMT_CONSTEXPR_DECL const int char_size =
std::numeric_limits<unsigned char>::digits;
// Subtract 1 to account for an implicit most significant bit in the
// normalized form.
static FMT_CONSTEXPR_DECL const int double_significand_size =
std::numeric_limits<double>::digits - 1;
static FMT_CONSTEXPR_DECL const uint64_t implicit_bit =
1ull << double_significand_size;
public:
significand_type f;
int e;
static FMT_CONSTEXPR_DECL const int significand_size =
sizeof(significand_type) * char_size;
fp(): f(0), e(0) {}
2018-11-29 00:15:15 +00:00
fp(uint64_t f_val, int e_val): f(f_val), e(e_val) {}
2018-08-29 16:34:57 +00:00
// Constructs fp from an IEEE754 double. It is a template to prevent compile
// errors on platforms where double is not IEEE754.
template <typename Double>
explicit fp(Double d) {
// Assume double is in the format [sign][exponent][significand].
typedef std::numeric_limits<Double> limits;
const int double_size = static_cast<int>(sizeof(Double) * char_size);
2018-08-29 16:34:57 +00:00
const int exponent_size =
double_size - double_significand_size - 1; // -1 for sign
const uint64_t significand_mask = implicit_bit - 1;
const uint64_t exponent_mask = (~0ull >> 1) & ~significand_mask;
const int exponent_bias = (1 << exponent_size) - limits::max_exponent - 1;
auto u = bit_cast<uint64_t>(d);
auto biased_e = (u & exponent_mask) >> double_significand_size;
f = u & significand_mask;
if (biased_e != 0)
f += implicit_bit;
else
biased_e = 1; // Subnormals use biased exponent 1 (min exponent).
e = static_cast<int>(biased_e - exponent_bias - double_significand_size);
}
// Normalizes the value converted from double and multiplied by (1 << SHIFT).
template <int SHIFT = 0>
void normalize() {
// Handle subnormals.
auto shifted_implicit_bit = implicit_bit << SHIFT;
while ((f & shifted_implicit_bit) == 0) {
f <<= 1;
--e;
}
// Subtract 1 to account for hidden bit.
auto offset = significand_size - double_significand_size - SHIFT - 1;
f <<= offset;
e -= offset;
}
// Compute lower and upper boundaries (m^- and m^+ in the Grisu paper), where
// a boundary is a value half way between the number and its predecessor
// (lower) or successor (upper). The upper boundary is normalized and lower
// has the same exponent but may be not normalized.
void compute_boundaries(fp &lower, fp &upper) const {
lower = f == implicit_bit ?
fp((f << 2) - 1, e - 2) : fp((f << 1) - 1, e - 1);
upper = fp((f << 1) + 1, e - 1);
upper.normalize<1>(); // 1 is to account for the exponent shift above.
lower.f <<= lower.e - upper.e;
lower.e = upper.e;
}
};
// Returns an fp number representing x - y. Result may not be normalized.
inline fp operator-(fp x, fp y) {
FMT_ASSERT(x.f >= y.f && x.e == y.e, "invalid operands");
return fp(x.f - y.f, x.e);
}
// Computes an fp number r with r.f = x.f * y.f / pow(2, 64) rounded to nearest
// with half-up tie breaking, r.e = x.e + y.e + 64. Result may not be normalized.
FMT_API fp operator*(fp x, fp y);
// Returns cached power (of 10) c_k = c_k.f * pow(2, c_k.e) such that its
// (binary) exponent satisfies min_exponent <= c_k.e <= min_exponent + 3.
FMT_API fp get_cached_power(int min_exponent, int &pow10_exponent);
2018-04-22 00:26:24 +00:00
FMT_FUNC fp operator*(fp x, fp y) {
// Multiply 32-bit parts of significands.
uint64_t mask = (1ULL << 32) - 1;
uint64_t a = x.f >> 32, b = x.f & mask;
uint64_t c = y.f >> 32, d = y.f & mask;
uint64_t ac = a * c, bc = b * c, ad = a * d, bd = b * d;
// Compute mid 64-bit of result and round.
uint64_t mid = (bd >> 32) + (ad & mask) + (bc & mask) + (1U << 31);
return fp(ac + (ad >> 32) + (bc >> 32) + (mid >> 32), x.e + y.e + 64);
2018-04-22 00:26:24 +00:00
}
FMT_FUNC fp get_cached_power(int min_exponent, int &pow10_exponent) {
const double one_over_log2_10 = 0.30102999566398114; // 1 / log2(10)
int index = static_cast<int>(std::ceil(
2018-05-28 18:25:07 +00:00
(min_exponent + fp::significand_size - 1) * one_over_log2_10));
// Decimal exponent of the first (smallest) cached power of 10.
const int first_dec_exp = -348;
2018-08-15 13:54:43 +00:00
// Difference between 2 consecutive decimal exponents in cached powers of 10.
const int dec_exp_step = 8;
index = (index - first_dec_exp - 1) / dec_exp_step + 1;
pow10_exponent = first_dec_exp + index * dec_exp_step;
return fp(data::POW10_SIGNIFICANDS[index], data::POW10_EXPONENTS[index]);
}
2018-08-25 23:08:32 +00:00
2018-10-14 05:14:36 +00:00
FMT_FUNC bool grisu2_round(
2018-11-29 00:15:15 +00:00
char *buf, size_t &size, size_t max_digits, uint64_t delta,
2018-10-14 05:14:36 +00:00
uint64_t remainder, uint64_t exp, uint64_t diff, int &exp10) {
2018-10-13 14:44:34 +00:00
while (remainder < diff && delta - remainder >= exp &&
(remainder + exp < diff || diff - remainder > remainder + exp - diff)) {
2018-11-29 00:15:15 +00:00
--buf[size - 1];
2018-10-13 14:44:34 +00:00
remainder += exp;
}
2018-10-14 05:14:36 +00:00
if (size > max_digits) {
--size;
++exp10;
2018-11-29 00:15:15 +00:00
if (buf[size] >= '5')
2018-10-14 05:14:36 +00:00
return false;
}
return true;
2018-10-13 14:44:34 +00:00
}
2018-08-25 23:08:32 +00:00
// Generates output using Grisu2 digit-gen algorithm.
2018-10-14 05:14:36 +00:00
FMT_FUNC bool grisu2_gen_digits(
2018-11-29 00:15:15 +00:00
char *buf, size_t &size, uint32_t hi, uint64_t lo, int &exp,
2018-10-14 05:14:36 +00:00
uint64_t delta, const fp &one, const fp &diff, size_t max_digits) {
2018-10-13 14:44:34 +00:00
// Generate digits for the most significant part (hi).
2018-08-26 15:12:35 +00:00
while (exp > 0) {
2018-08-25 23:08:32 +00:00
uint32_t digit = 0;
// This optimization by miloyip reduces the number of integer divisions by
// one per iteration.
2018-08-26 15:12:35 +00:00
switch (exp) {
2018-08-25 23:08:32 +00:00
case 10: digit = hi / 1000000000; hi %= 1000000000; break;
case 9: digit = hi / 100000000; hi %= 100000000; break;
case 8: digit = hi / 10000000; hi %= 10000000; break;
case 7: digit = hi / 1000000; hi %= 1000000; break;
case 6: digit = hi / 100000; hi %= 100000; break;
case 5: digit = hi / 10000; hi %= 10000; break;
case 4: digit = hi / 1000; hi %= 1000; break;
case 3: digit = hi / 100; hi %= 100; break;
case 2: digit = hi / 10; hi %= 10; break;
case 1: digit = hi; hi = 0; break;
default:
FMT_ASSERT(false, "invalid number of digits");
}
if (digit != 0 || size != 0)
2018-11-29 00:15:15 +00:00
buf[size++] = static_cast<char>('0' + digit);
2018-08-26 15:12:35 +00:00
--exp;
2018-08-25 23:08:32 +00:00
uint64_t remainder = (static_cast<uint64_t>(hi) << -one.e) + lo;
2018-10-14 05:14:36 +00:00
if (remainder <= delta || size > max_digits) {
return grisu2_round(
2018-11-29 00:15:15 +00:00
buf, size, max_digits, delta, remainder,
2018-10-14 05:14:36 +00:00
static_cast<uint64_t>(data::POWERS_OF_10_32[exp]) << -one.e,
diff.f, exp);
2018-08-25 23:08:32 +00:00
}
}
2018-10-13 14:44:34 +00:00
// Generate digits for the least significant part (lo).
2018-08-25 23:08:32 +00:00
for (;;) {
lo *= 10;
delta *= 10;
char digit = static_cast<char>(lo >> -one.e);
if (digit != 0 || size != 0)
2018-11-29 00:15:15 +00:00
buf[size++] = static_cast<char>('0' + digit);
2018-08-25 23:08:32 +00:00
lo &= one.f - 1;
2018-08-26 15:12:35 +00:00
--exp;
2018-10-14 05:14:36 +00:00
if (lo < delta || size > max_digits) {
2018-11-29 00:15:15 +00:00
return grisu2_round(buf, size, max_digits, delta, lo, one.f,
2018-10-14 05:14:36 +00:00
diff.f * data::POWERS_OF_10_32[-exp], exp);
2018-08-25 23:08:32 +00:00
}
}
}
2018-10-14 05:14:36 +00:00
#if FMT_CLANG_VERSION
# define FMT_FALLTHROUGH [[clang::fallthrough]];
#elif FMT_GCC_VERSION >= 700
# define FMT_FALLTHROUGH [[gnu::fallthrough]];
#else
# define FMT_FALLTHROUGH
#endif
struct gen_digits_params {
2018-10-17 17:49:30 +00:00
unsigned num_digits;
2018-10-14 05:14:36 +00:00
bool fixed;
bool upper;
bool trailing_zeros;
2018-10-18 03:13:38 +00:00
};
2018-10-14 05:14:36 +00:00
2018-10-18 03:13:38 +00:00
struct prettify_handler {
char *data;
2018-11-30 18:06:52 +00:00
ptrdiff_t size;
2018-10-18 03:13:38 +00:00
buffer &buf;
2018-11-30 18:06:52 +00:00
explicit prettify_handler(buffer &b, ptrdiff_t n)
2018-10-18 03:13:38 +00:00
: data(b.data()), size(n), buf(b) {}
~prettify_handler() {
2018-11-30 18:06:52 +00:00
assert(buf.size() >= to_unsigned(size));
buf.resize(to_unsigned(size));
2018-10-18 03:13:38 +00:00
}
template <typename F>
2018-11-30 18:06:52 +00:00
void insert(ptrdiff_t pos, ptrdiff_t n, F f) {
std::memmove(data + pos + n, data + pos, to_unsigned(size - pos));
2018-10-18 03:13:38 +00:00
f(data + pos);
size += n;
}
2018-11-30 18:06:52 +00:00
void insert(ptrdiff_t pos, char c) {
std::memmove(data + pos + 1, data + pos, to_unsigned(size - pos));
2018-10-18 03:13:38 +00:00
data[pos] = c;
++size;
}
2018-11-30 18:06:52 +00:00
void append(ptrdiff_t n, char c) {
2018-10-18 03:13:38 +00:00
std::uninitialized_fill_n(data + size, n, c);
size += n;
}
void append(char c) { data[size++] = c; }
void remove_trailing(char c) {
while (data[size - 1] == c) --size;
2018-08-29 17:07:29 +00:00
}
2018-10-14 05:14:36 +00:00
};
2018-08-29 17:07:29 +00:00
2018-10-18 03:13:38 +00:00
// Writes the exponent exp in the form "[+-]d{2,3}" to buffer.
template <typename Handler>
FMT_FUNC void write_exponent(int exp, Handler &&h) {
FMT_ASSERT(-1000 < exp && exp < 1000, "exponent out of range");
if (exp < 0) {
h.append('-');
exp = -exp;
} else {
h.append('+');
}
if (exp >= 100) {
h.append(static_cast<char>('0' + exp / 100));
exp %= 100;
const char *d = data::DIGITS + exp * 2;
h.append(d[0]);
h.append(d[1]);
} else {
const char *d = data::DIGITS + exp * 2;
h.append(d[0]);
h.append(d[1]);
}
}
2018-10-23 04:05:59 +00:00
struct fill {
size_t n;
2018-11-29 00:15:15 +00:00
void operator()(char *buf) const {
buf[0] = '0';
buf[1] = '.';
std::uninitialized_fill_n(buf + 2, n, '0');
2018-10-23 04:05:59 +00:00
}
};
2018-10-18 03:13:38 +00:00
// The number is given as v = f * pow(10, exp), where f has size digits.
template <typename Handler>
FMT_FUNC void grisu2_prettify(const gen_digits_params &params,
2018-11-30 18:06:52 +00:00
ptrdiff_t size, int exp, Handler &&handler) {
2018-10-14 05:14:36 +00:00
if (!params.fixed) {
// Insert a decimal point after the first digit and add an exponent.
2018-10-18 03:13:38 +00:00
handler.insert(1, '.');
2018-10-14 05:14:36 +00:00
exp += static_cast<int>(size) - 1;
2018-10-18 03:13:38 +00:00
if (size < params.num_digits)
handler.append(params.num_digits - size, '0');
handler.append(params.upper ? 'E' : 'e');
write_exponent(exp, handler);
2018-10-14 05:14:36 +00:00
return;
}
2018-08-29 16:34:57 +00:00
// pow(10, full_exp - 1) <= v <= pow(10, full_exp).
int int_size = static_cast<int>(size);
2018-08-29 17:07:29 +00:00
int full_exp = int_size + exp;
2018-08-29 16:34:57 +00:00
const int exp_threshold = 21;
if (int_size <= full_exp && full_exp <= exp_threshold) {
// 1234e7 -> 12340000000[.0+]
2018-10-18 03:13:38 +00:00
handler.append(full_exp - int_size, '0');
2018-10-17 17:49:30 +00:00
int num_zeros = static_cast<int>(params.num_digits) - full_exp;
2018-10-14 05:14:36 +00:00
if (num_zeros > 0 && params.trailing_zeros) {
2018-10-18 03:13:38 +00:00
handler.append('.');
handler.append(num_zeros, '0');
}
2018-10-14 05:14:36 +00:00
} else if (full_exp > 0) {
2018-08-29 16:34:57 +00:00
// 1234e-2 -> 12.34[0+]
2018-10-18 03:13:38 +00:00
handler.insert(full_exp, '.');
2018-10-14 05:14:36 +00:00
if (!params.trailing_zeros) {
// Remove trailing zeros.
2018-10-18 03:13:38 +00:00
handler.remove_trailing('0');
} else if (params.num_digits > size) {
2018-10-14 05:14:36 +00:00
// Add trailing zeros.
2018-11-30 18:06:52 +00:00
ptrdiff_t num_zeros = params.num_digits - size;
2018-10-18 03:13:38 +00:00
handler.append(num_zeros, '0');
}
2018-10-14 05:14:36 +00:00
} else {
// 1234e-6 -> 0.001234
2018-10-18 03:13:38 +00:00
handler.insert(0, 2 - full_exp, fill{to_unsigned(-full_exp)});
}
}
struct char_counter {
2018-11-30 18:06:52 +00:00
ptrdiff_t size;
2018-10-18 03:13:38 +00:00
template <typename F>
2018-11-30 18:06:52 +00:00
void insert(ptrdiff_t, ptrdiff_t n, F) { size += n; }
void insert(ptrdiff_t, char) { ++size; }
void append(ptrdiff_t n, char) { size += n; }
2018-10-18 03:13:38 +00:00
void append(char) { ++size; }
void remove_trailing(char) {}
};
// Converts format specifiers into parameters for digit generation and computes
// output buffer size for a number in the range [pow(10, exp - 1), pow(10, exp)
// or 0 if exp == 1.
FMT_FUNC gen_digits_params process_specs(const core_format_specs &specs,
int exp, buffer &buf) {
auto params = gen_digits_params();
int num_digits = specs.precision >= 0 ? specs.precision : 6;
switch (specs.type) {
case 'G':
params.upper = true;
FMT_FALLTHROUGH
case '\0': case 'g':
params.trailing_zeros = (specs.flags & HASH_FLAG) != 0;
if (-4 <= exp && exp < num_digits + 1) {
params.fixed = true;
if (!specs.type && params.trailing_zeros && exp >= 0)
num_digits = exp + 1;
}
break;
case 'F':
params.upper = true;
FMT_FALLTHROUGH
case 'f': {
params.fixed = true;
params.trailing_zeros = true;
int adjusted_min_digits = num_digits + exp;
if (adjusted_min_digits > 0)
num_digits = adjusted_min_digits;
break;
}
case 'E':
params.upper = true;
FMT_FALLTHROUGH
case 'e':
++num_digits;
break;
}
2018-10-18 03:13:38 +00:00
params.num_digits = to_unsigned(num_digits);
2018-11-30 18:06:52 +00:00
char_counter counter{num_digits};
2018-10-18 03:13:38 +00:00
grisu2_prettify(params, params.num_digits, exp - num_digits, counter);
2018-11-30 18:06:52 +00:00
buf.resize(to_unsigned(counter.size));
2018-10-18 03:13:38 +00:00
return params;
2018-08-26 15:12:35 +00:00
}
template <typename Double>
2018-10-14 05:14:36 +00:00
FMT_FUNC typename std::enable_if<sizeof(Double) == sizeof(uint64_t), bool>::type
grisu2_format(Double value, buffer &buf, core_format_specs specs) {
FMT_ASSERT(value >= 0, "value is negative");
2018-10-14 05:14:36 +00:00
if (value == 0) {
2018-10-18 03:13:38 +00:00
gen_digits_params params = process_specs(specs, 1, buf);
const size_t size = 1;
buf[0] = '0';
grisu2_prettify(params, size, 0, prettify_handler(buf, size));
2018-10-14 05:14:36 +00:00
return true;
}
2018-10-14 05:14:36 +00:00
fp fp_value(value);
fp lower, upper; // w^- and w^+ in the Grisu paper.
fp_value.compute_boundaries(lower, upper);
// Find a cached power of 10 close to 1 / upper and use it to scale upper.
const int min_exp = -60; // alpha in Grisu.
int cached_exp = 0; // K in Grisu.
auto cached_pow = get_cached_power( // \tilde{c}_{-k} in Grisu.
min_exp - (upper.e + fp::significand_size), cached_exp);
cached_exp = -cached_exp;
upper = upper * cached_pow; // \tilde{M}^+ in Grisu.
--upper.f; // \tilde{M}^+ - 1 ulp -> M^+_{\downarrow}.
fp one(1ull << -upper.e, upper.e);
// hi (p1 in Grisu) contains the most significant digits of scaled_upper.
// hi = floor(upper / one).
uint32_t hi = static_cast<uint32_t>(upper.f >> -one.e);
int exp = static_cast<int>(count_digits(hi)); // kappa in Grisu.
2018-10-18 03:13:38 +00:00
gen_digits_params params = process_specs(specs, cached_exp + exp, buf);
2018-10-14 05:14:36 +00:00
fp_value.normalize();
fp scaled_value = fp_value * cached_pow;
lower = lower * cached_pow; // \tilde{M}^- in Grisu.
++lower.f; // \tilde{M}^- + 1 ulp -> M^-_{\uparrow}.
uint64_t delta = upper.f - lower.f;
fp diff = upper - scaled_value; // wp_w in Grisu.
// lo (p2 in Grisu) contains the least significants digits of scaled_upper.
// lo = supper % one.
uint64_t lo = upper.f & (one.f - 1);
2018-10-17 15:19:46 +00:00
size_t size = 0;
2018-10-18 03:13:38 +00:00
if (!grisu2_gen_digits(buf.data(), size, hi, lo, exp, delta, one, diff,
2018-10-17 17:49:30 +00:00
params.num_digits)) {
buf.clear();
2018-10-14 05:14:36 +00:00
return false;
}
2018-10-18 03:13:38 +00:00
grisu2_prettify(params, size, cached_exp + exp, prettify_handler(buf, size));
2018-10-14 05:14:36 +00:00
return true;
2018-08-25 23:08:32 +00:00
}
template <typename Double>
2018-11-29 00:15:15 +00:00
void sprintf_format(Double value, internal::buffer &buf,
2018-10-18 03:13:38 +00:00
core_format_specs spec) {
// Buffer capacity must be non-zero, otherwise MSVC's vsnprintf_s will fail.
2018-11-29 00:15:15 +00:00
FMT_ASSERT(buf.capacity() != 0, "empty buffer");
// Build format string.
enum { MAX_FORMAT_SIZE = 10}; // longest format: %#-*.*Lg
char format[MAX_FORMAT_SIZE];
char *format_ptr = format;
*format_ptr++ = '%';
if (spec.has(HASH_FLAG))
*format_ptr++ = '#';
if (spec.precision >= 0) {
*format_ptr++ = '.';
*format_ptr++ = '*';
}
if (std::is_same<Double, long double>::value)
*format_ptr++ = 'L';
*format_ptr++ = spec.type;
*format_ptr = '\0';
// Format using snprintf.
char *start = FMT_NULL;
for (;;) {
2018-11-29 00:15:15 +00:00
std::size_t buffer_size = buf.capacity();
start = &buf[0];
int result = internal::char_traits<char>::format_float(
start, buffer_size, format, spec.precision, value);
if (result >= 0) {
unsigned n = internal::to_unsigned(result);
2018-11-29 00:15:15 +00:00
if (n < buf.capacity()) {
buf.resize(n);
break; // The buffer is large enough - continue with formatting.
}
2018-11-29 00:15:15 +00:00
buf.reserve(n + 1);
} else {
// If result is negative we ask to increase the capacity by at least 1,
// but as std::vector, the buffer grows exponentially.
2018-11-29 00:15:15 +00:00
buf.reserve(buf.capacity() + 1);
}
}
}
2018-04-22 00:26:24 +00:00
} // namespace internal
#if FMT_USE_WINDOWS_H
2014-04-30 14:23:43 +00:00
2017-02-19 14:46:51 +00:00
FMT_FUNC internal::utf8_to_utf16::utf8_to_utf16(string_view s) {
static const char ERROR_MSG[] = "cannot convert string from UTF-8 to UTF-16";
2015-08-07 14:34:58 +00:00
if (s.size() > INT_MAX)
2017-02-19 16:41:38 +00:00
FMT_THROW(windows_error(ERROR_INVALID_PARAMETER, ERROR_MSG));
2015-08-07 14:34:58 +00:00
int s_size = static_cast<int>(s.size());
if (s_size == 0) {
// MultiByteToWideChar does not support zero length, handle separately.
buffer_.resize(1);
buffer_[0] = 0;
return;
}
2015-08-07 14:34:58 +00:00
int length = MultiByteToWideChar(
2018-01-21 02:37:57 +00:00
CP_UTF8, MB_ERR_INVALID_CHARS, s.data(), s_size, FMT_NULL, 0);
2014-04-30 14:23:43 +00:00
if (length == 0)
2017-02-19 16:41:38 +00:00
FMT_THROW(windows_error(GetLastError(), ERROR_MSG));
buffer_.resize(length + 1);
2014-04-30 14:23:43 +00:00
length = MultiByteToWideChar(
2015-08-07 14:34:58 +00:00
CP_UTF8, MB_ERR_INVALID_CHARS, s.data(), s_size, &buffer_[0], length);
2014-04-30 14:23:43 +00:00
if (length == 0)
2017-02-19 16:41:38 +00:00
FMT_THROW(windows_error(GetLastError(), ERROR_MSG));
buffer_[length] = 0;
2014-04-30 14:23:43 +00:00
}
2017-02-19 16:41:38 +00:00
FMT_FUNC internal::utf16_to_utf8::utf16_to_utf8(wstring_view s) {
if (int error_code = convert(s)) {
2017-02-19 16:41:38 +00:00
FMT_THROW(windows_error(error_code,
"cannot convert string from UTF-16 to UTF-8"));
2014-04-30 14:23:43 +00:00
}
}
2017-02-19 16:41:38 +00:00
FMT_FUNC int internal::utf16_to_utf8::convert(wstring_view s) {
2015-08-07 14:08:46 +00:00
if (s.size() > INT_MAX)
return ERROR_INVALID_PARAMETER;
int s_size = static_cast<int>(s.size());
if (s_size == 0) {
// WideCharToMultiByte does not support zero length, handle separately.
buffer_.resize(1);
buffer_[0] = 0;
return 0;
}
2018-01-21 02:37:57 +00:00
int length = WideCharToMultiByte(
CP_UTF8, 0, s.data(), s_size, FMT_NULL, 0, FMT_NULL, FMT_NULL);
2014-04-30 14:23:43 +00:00
if (length == 0)
return GetLastError();
buffer_.resize(length + 1);
2014-04-30 14:23:43 +00:00
length = WideCharToMultiByte(
2018-01-21 02:37:57 +00:00
CP_UTF8, 0, s.data(), s_size, &buffer_[0], length, FMT_NULL, FMT_NULL);
2014-04-30 14:23:43 +00:00
if (length == 0)
return GetLastError();
buffer_[length] = 0;
2014-04-30 14:23:43 +00:00
return 0;
}
2017-02-19 16:41:38 +00:00
FMT_FUNC void windows_error::init(
int err_code, string_view format_str, format_args args) {
2015-02-17 02:11:42 +00:00
error_code_ = err_code;
2017-02-19 14:46:51 +00:00
memory_buffer buffer;
2017-02-17 14:38:53 +00:00
internal::format_windows_error(buffer, err_code, vformat(format_str, args));
2014-06-30 21:26:29 +00:00
std::runtime_error &base = *this;
2017-02-17 14:38:53 +00:00
base = std::runtime_error(to_string(buffer));
2014-06-30 21:26:29 +00:00
}
FMT_FUNC void internal::format_windows_error(
2018-01-15 16:22:31 +00:00
internal::buffer &out, int error_code, string_view message) FMT_NOEXCEPT {
FMT_TRY {
2018-01-06 17:09:50 +00:00
wmemory_buffer buf;
buf.resize(inline_buffer_size);
for (;;) {
2018-01-06 17:09:50 +00:00
wchar_t *system_message = &buf[0];
2016-10-22 15:04:20 +00:00
int result = FormatMessageW(
FORMAT_MESSAGE_FROM_SYSTEM | FORMAT_MESSAGE_IGNORE_INSERTS,
2018-01-21 02:37:57 +00:00
FMT_NULL, error_code, MAKELANGID(LANG_NEUTRAL, SUBLANG_DEFAULT),
system_message, static_cast<uint32_t>(buf.size()), FMT_NULL);
if (result != 0) {
2017-02-19 16:41:38 +00:00
utf16_to_utf8 utf8_message;
if (utf8_message.convert(system_message) == ERROR_SUCCESS) {
2018-01-14 15:19:23 +00:00
writer w(out);
2017-02-17 14:38:53 +00:00
w.write(message);
w.write(": ");
w.write(utf8_message);
return;
}
break;
}
if (GetLastError() != ERROR_INSUFFICIENT_BUFFER)
break; // Can't get error message, report error code instead.
2018-01-06 17:09:50 +00:00
buf.resize(buf.size() * 2);
}
} FMT_CATCH(...) {}
2018-01-06 17:09:50 +00:00
format_error_code(out, error_code, message);
}
#endif // FMT_USE_WINDOWS_H
FMT_FUNC void format_system_error(
2018-01-14 22:15:59 +00:00
internal::buffer &out, int error_code, string_view message) FMT_NOEXCEPT {
FMT_TRY {
memory_buffer buf;
buf.resize(inline_buffer_size);
for (;;) {
char *system_message = &buf[0];
int result = safe_strerror(error_code, system_message, buf.size());
if (result == 0) {
2018-01-14 15:19:23 +00:00
writer w(out);
w.write(message);
w.write(": ");
w.write(system_message);
return;
}
if (result != ERANGE)
break; // Can't get error message, report error code instead.
buf.resize(buf.size() * 2);
}
} FMT_CATCH(...) {}
2018-02-02 00:49:47 +00:00
format_error_code(out, error_code, message);
}
FMT_FUNC void internal::error_handler::on_error(const char *message) {
FMT_THROW(format_error(message));
}
FMT_FUNC void report_system_error(
int error_code, fmt::string_view message) FMT_NOEXCEPT {
report_error(format_system_error, error_code, message);
}
#if FMT_USE_WINDOWS_H
FMT_FUNC void report_windows_error(
int error_code, fmt::string_view message) FMT_NOEXCEPT {
report_error(internal::format_windows_error, error_code, message);
}
2014-04-30 19:38:17 +00:00
#endif
2017-12-03 15:32:04 +00:00
FMT_FUNC void vprint(std::FILE *f, string_view format_str, format_args args) {
memory_buffer buffer;
internal::vformat_to(buffer, format_str,
basic_format_args<buffer_context<char>::type>(args));
std::fwrite(buffer.data(), 1, buffer.size(), f);
2014-06-29 04:56:40 +00:00
}
FMT_FUNC void vprint(std::FILE *f, wstring_view format_str, wformat_args args) {
wmemory_buffer buffer;
internal::vformat_to(buffer, format_str, args);
std::fwrite(buffer.data(), sizeof(wchar_t), buffer.size(), f);
}
2017-12-03 15:32:04 +00:00
FMT_FUNC void vprint(string_view format_str, format_args args) {
2016-08-27 00:23:13 +00:00
vprint(stdout, format_str, args);
2014-09-25 14:08:25 +00:00
}
FMT_FUNC void vprint(wstring_view format_str, wformat_args args) {
vprint(stdout, format_str, args);
}
2018-05-12 15:33:51 +00:00
FMT_END_NAMESPACE
#ifdef _MSC_VER
2014-03-11 18:56:24 +00:00
# pragma warning(pop)
#endif
2018-03-21 14:50:59 +00:00
#endif // FMT_FORMAT_INL_H_