/*
- * Copyright 2014 Facebook, Inc.
+ * Copyright 2015 Facebook, Inc.
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
#include <folly/Range.h>
#include <boost/implicit_cast.hpp>
+#include <algorithm>
#include <type_traits>
#include <limits>
#include <string>
// V8 JavaScript implementation
#include <double-conversion/double-conversion.h>
-#define FOLLY_RANGE_CHECK(condition, message) \
- ((condition) ? (void)0 : throw std::range_error( \
- (__FILE__ "(" + std::to_string((long long int) __LINE__) + "): " \
- + (message)).c_str()))
+#define FOLLY_RANGE_CHECK_STRINGIZE(x) #x
+#define FOLLY_RANGE_CHECK_STRINGIZE2(x) FOLLY_RANGE_CHECK_STRINGIZE(x)
+
+// Android doesn't support std::to_string so just use a placeholder there.
+#ifdef __ANDROID__
+#define FOLLY_RANGE_CHECK_TO_STRING(x) std::string("N/A")
+#else
+#define FOLLY_RANGE_CHECK_TO_STRING(x) std::to_string(x)
+#endif
+
+#define FOLLY_RANGE_CHECK(condition, message, src) \
+ ((condition) ? (void)0 : throw std::range_error( \
+ (std::string(__FILE__ "(" FOLLY_RANGE_CHECK_STRINGIZE2(__LINE__) "): ") \
+ + (message) + ": '" + (src) + "'").c_str()))
+
+#define FOLLY_RANGE_CHECK_BEGIN_END(condition, message, b, e) \
+ FOLLY_RANGE_CHECK(condition, message, std::string((b), (e) - (b)))
+
+#define FOLLY_RANGE_CHECK_STRINGPIECE(condition, message, sp) \
+ FOLLY_RANGE_CHECK(condition, message, std::string((sp).data(), (sp).size()))
namespace folly {
+/**
+ * The identity conversion function.
+ * to<T>(T) returns itself for all types T.
+ */
+template <class Tgt, class Src>
+typename std::enable_if<std::is_same<Tgt, Src>::value, Tgt>::type
+to(const Src & value) {
+ return value;
+}
+
+template <class Tgt, class Src>
+typename std::enable_if<std::is_same<Tgt, Src>::value, Tgt>::type
+to(Src && value) {
+ return std::move(value);
+}
+
/*******************************************************************************
* Integral to integral
******************************************************************************/
+/**
+ * Unchecked conversion from integral to boolean. This is different from the
+ * other integral conversions because we use the C convention of treating any
+ * non-zero value as true, instead of range checking.
+ */
+template <class Tgt, class Src>
+typename std::enable_if<
+ std::is_integral<Src>::value
+ && !std::is_same<Tgt, Src>::value
+ && std::is_same<Tgt, bool>::value,
+ Tgt>::type
+to(const Src & value) {
+ return value != 0;
+}
+
/**
* Checked conversion from integral to integral. The checks are only
* performed when meaningful, e.g. conversion from int to long goes
*/
template <class Tgt, class Src>
typename std::enable_if<
- std::is_integral<Src>::value && std::is_integral<Tgt>::value,
+ std::is_integral<Src>::value
+ && !std::is_same<Tgt, Src>::value
+ && !std::is_same<Tgt, bool>::value
+ && std::is_integral<Tgt>::value,
Tgt>::type
to(const Src & value) {
/* static */ if (std::numeric_limits<Tgt>::max()
< std::numeric_limits<Src>::max()) {
FOLLY_RANGE_CHECK(
(!greater_than<Tgt, std::numeric_limits<Tgt>::max()>(value)),
- "Overflow"
- );
+ "Overflow",
+ FOLLY_RANGE_CHECK_TO_STRING(value));
}
/* static */ if (std::is_signed<Src>::value &&
(!std::is_signed<Tgt>::value || sizeof(Src) > sizeof(Tgt))) {
FOLLY_RANGE_CHECK(
(!less_than<Tgt, std::numeric_limits<Tgt>::min()>(value)),
- "Negative overflow"
- );
+ "Negative overflow",
+ FOLLY_RANGE_CHECK_TO_STRING(value));
}
return static_cast<Tgt>(value);
}
template <class Tgt, class Src>
typename std::enable_if<
- std::is_floating_point<Tgt>::value && std::is_floating_point<Src>::value,
+ std::is_floating_point<Tgt>::value
+ && std::is_floating_point<Src>::value
+ && !std::is_same<Tgt, Src>::value,
Tgt>::type
to(const Src & value) {
/* static */ if (std::numeric_limits<Tgt>::max() <
std::numeric_limits<Src>::max()) {
FOLLY_RANGE_CHECK(value <= std::numeric_limits<Tgt>::max(),
- "Overflow");
+ "Overflow",
+ FOLLY_RANGE_CHECK_TO_STRING(value));
FOLLY_RANGE_CHECK(value >= -std::numeric_limits<Tgt>::max(),
- "Negative overflow");
+ "Negative overflow",
+ FOLLY_RANGE_CHECK_TO_STRING(value));
}
return boost::implicit_cast<Tgt>(value);
}
typename std::tuple_element<
sizeof...(Ts),
std::tuple<T, Ts...> >::type const&
- getLastElement(const T& v, const Ts&... vs) {
+ getLastElement(const T&, const Ts&... vs) {
return getLastElement(vs...);
}
template <typename IntegerType>
constexpr unsigned int
digitsEnough() {
- return ceil((double(sizeof(IntegerType) * CHAR_BIT) * M_LN2) / M_LN10);
+ return (unsigned int)(ceil(sizeof(IntegerType) * CHAR_BIT * M_LN2 / M_LN10));
}
-inline unsigned int
-unsafeTelescope128(char * buffer, unsigned int room, unsigned __int128 x) {
+inline size_t
+unsafeTelescope128(char * buffer, size_t room, unsigned __int128 x) {
typedef unsigned __int128 Usrc;
- unsigned int p = room - 1;
+ size_t p = room - 1;
while (x >= (Usrc(1) << 64)) { // Using 128-bit division while needed
const auto y = x / 10;
*/
inline uint32_t digits10(uint64_t v) {
+#ifdef __x86_64__
+
+ // For this arch we can get a little help from specialized CPU instructions
+ // which can count leading zeroes; 64 minus that is appx. log (base 2).
+ // Use that to approximate base-10 digits (log_10) and then adjust if needed.
+
+ // 10^i, defined for i 0 through 19.
+ // This is 20 * 8 == 160 bytes, which fits neatly into 5 cache lines
+ // (assuming a cache line size of 64).
+ static const uint64_t powersOf10[20] FOLLY_ALIGNED(64) = {
+ 1, 10, 100, 1000, 10000, 100000, 1000000, 10000000, 100000000, 1000000000,
+ 10000000000, 100000000000, 1000000000000, 10000000000000, 100000000000000,
+ 1000000000000000, 10000000000000000, 100000000000000000,
+ 1000000000000000000, 10000000000000000000UL
+ };
+
+ // "count leading zeroes" operation not valid; for 0; special case this.
+ if UNLIKELY (! v) {
+ return 1;
+ }
+
+ // bits is in the ballpark of log_2(v).
+ const uint8_t leadingZeroes = __builtin_clzll(v);
+ const auto bits = 63 - leadingZeroes;
+
+ // approximate log_10(v) == log_10(2) * bits.
+ // Integer magic below: 77/256 is appx. 0.3010 (log_10(2)).
+ // The +1 is to make this the ceiling of the log_10 estimate.
+ const uint32_t minLength = 1 + ((bits * 77) >> 8);
+
+ // return that log_10 lower bound, plus adjust if input >= 10^(that bound)
+ // in case there's a small error and we misjudged length.
+ return minLength + (uint32_t) (UNLIKELY (v >= powersOf10[minLength]));
+
+#else
+
uint32_t result = 1;
for (;;) {
if (LIKELY(v < 10)) return result;
v /= 10000U;
result += 4;
}
+
+#endif
}
/**
return folly::StringPiece(value).size();
}
+template <>
+inline size_t estimateSpaceNeeded(std::nullptr_t /* value */) {
+ return 0;
+}
+
template<class Src>
typename std::enable_if<
std::is_pointer<Src>::value &&
toAppend(__int128 value, Tgt * result) {
typedef unsigned __int128 Usrc;
char buffer[detail::digitsEnough<unsigned __int128>() + 1];
- unsigned int p;
+ size_t p;
if (value < 0) {
p = detail::unsafeTelescope128(buffer, sizeof(buffer), Usrc(-value));
void
toAppend(unsigned __int128 value, Tgt * result) {
char buffer[detail::digitsEnough<unsigned __int128>()];
- unsigned int p;
+ size_t p;
p = detail::unsafeTelescope128(buffer, sizeof(buffer), value);
size_t>::type
estimateSpaceNeeded(Src value) {
if (value < 0) {
- return 1 + digits10(static_cast<uint64_t>(-value));
+ // When "value" is the smallest negative, negating it would evoke
+ // undefined behavior, so, instead of writing "-value" below, we write
+ // "~static_cast<uint64_t>(value) + 1"
+ return 1 + digits10(~static_cast<uint64_t>(value) + 1);
}
return digits10(static_cast<uint64_t>(value));
return estimateSpaceNeeded(static_cast<Intermediate>(value));
}
-#if defined(__clang__) || __GNUC_PREREQ(4, 7)
-// std::underlying_type became available by gcc 4.7.0
-
/**
* Enumerated values get appended as integers.
*/
static_cast<typename std::underlying_type<Src>::type>(value));
}
-#else
-
-/**
- * Enumerated values get appended as integers.
- */
-template <class Tgt, class Src>
-typename std::enable_if<
- std::is_enum<Src>::value && IsSomeString<Tgt>::value>::type
-toAppend(Src value, Tgt * result) {
- /* static */ if (Src(-1) < 0) {
- /* static */ if (sizeof(Src) <= sizeof(int)) {
- toAppend(static_cast<int>(value), result);
- } else {
- toAppend(static_cast<long>(value), result);
- }
- } else {
- /* static */ if (sizeof(Src) <= sizeof(int)) {
- toAppend(static_cast<unsigned int>(value), result);
- } else {
- toAppend(static_cast<unsigned long>(value), result);
- }
- }
-}
-
-template <class Src>
-typename std::enable_if<
- std::is_enum<Src>::value, size_t>::type
-estimateSpaceNeeded(Src value) {
- /* static */ if (Src(-1) < 0) {
- /* static */ if (sizeof(Src) <= sizeof(int)) {
- return estimateSpaceNeeded(static_cast<int>(value));
- } else {
- return estimateSpaceNeeded(static_cast<long>(value));
- }
- } else {
- /* static */ if (sizeof(Src) <= sizeof(int)) {
- return estimateSpaceNeeded(static_cast<unsigned int>(value));
- } else {
- return estimateSpaceNeeded(static_cast<unsigned long>(value));
- }
- }
-}
-
-#endif // gcc 4.7 onwards
-
/*******************************************************************************
* Conversions from floating-point types to string types.
******************************************************************************/
+namespace detail {
+constexpr int kConvMaxDecimalInShortestLow = -6;
+constexpr int kConvMaxDecimalInShortestHigh = 21;
+} // folly::detail
+
/** Wrapper around DoubleToStringConverter **/
template <class Tgt, class Src>
typename std::enable_if<
using namespace double_conversion;
DoubleToStringConverter
conv(DoubleToStringConverter::NO_FLAGS,
- "infinity", "NaN", 'E',
- -6, // decimal in shortest low
- 21, // decimal in shortest high
+ "Infinity", "NaN", 'E',
+ detail::kConvMaxDecimalInShortestLow,
+ detail::kConvMaxDecimalInShortestHigh,
6, // max leading padding zeros
1); // max trailing padding zeros
char buffer[256];
}
/**
- * Very primitive, lets say its our best effort
+ * Upper bound of the length of the output from
+ * DoubleToStringConverter::ToShortest(double, StringBuilder*),
+ * as used in toAppend(double, string*).
*/
template <class Src>
typename std::enable_if<
std::is_floating_point<Src>::value, size_t>::type
estimateSpaceNeeded(Src value) {
- size_t sofar = 0;
- if (value < 0) {
- ++sofar;
- value = -value;
- }
-
- if (value < 1) {
- return sofar + 10; // lets assume 0 + '.' + 8 precision digits
- }
-
- if (value < static_cast<double>(std::numeric_limits<uint64_t>::max())) {
- sofar += digits10(static_cast<uint64_t>(value));
- } else {
- return 64; // give up, it will be more than 23 anyway
- }
-
- return sofar + 10; // integral part + '.' + 8 precision digits
+ // kBase10MaximalLength is 17. We add 1 for decimal point,
+ // e.g. 10.0/9 is 17 digits and 18 characters, including the decimal point.
+ constexpr int kMaxMantissaSpace =
+ double_conversion::DoubleToStringConverter::kBase10MaximalLength + 1;
+ // strlen("E-") + digits10(numeric_limits<double>::max_exponent10)
+ constexpr int kMaxExponentSpace = 2 + 3;
+ static const int kMaxPositiveSpace = std::max({
+ // E.g. 1.1111111111111111E-100.
+ kMaxMantissaSpace + kMaxExponentSpace,
+ // E.g. 0.000001.1111111111111111, if kConvMaxDecimalInShortestLow is -6.
+ kMaxMantissaSpace - detail::kConvMaxDecimalInShortestLow,
+ // If kConvMaxDecimalInShortestHigh is 21, then 1e21 is the smallest
+ // number > 1 which ToShortest outputs in exponential notation,
+ // so 21 is the longest non-exponential number > 1.
+ detail::kConvMaxDecimalInShortestHigh
+ });
+ return kMaxPositiveSpace + (value < 0); // +1 for minus sign, if negative
}
/**
template <class Src>
constexpr typename std::enable_if<
!std::is_fundamental<Src>::value
+#ifdef FOLLY_HAVE_INT128_T
+ // On OSX 10.10, is_fundamental<__int128> is false :-O
+ && !std::is_same<__int128, Src>::value
+ && !std::is_same<unsigned __int128, Src>::value
+#endif
&& !IsSomeString<Src>::value
&& !std::is_convertible<Src, const char*>::value
&& !std::is_convertible<Src, StringPiece>::value
template <class Delimiter, class T, class Tgt>
typename std::enable_if<
- IsSomeString<typename std::remove_pointer<Tgt>::type>
- ::value>::type
-toAppendDelimStrImpl(const Delimiter& delim, const T& v, Tgt result) {
+ IsSomeString<typename std::remove_pointer<Tgt>::type>::value>::type
+toAppendDelimStrImpl(const Delimiter& /* delim */, const T& v, Tgt result) {
toAppend(v, result);
}
/**
* Variadic conversion to string. Appends each element in turn.
- * If we have two or more things to append, we will reserve
- * the space for them (at least we will try).
+ * If we have two or more things to append, we it will not reserve
+ * the space for them and will depend on strings exponential growth.
+ * If you just append once consider using toAppendFit which reserves
+ * the space needed (but does not have exponential as a result).
*/
template <class... Ts>
typename std::enable_if<sizeof...(Ts) >= 3
typename detail::last_element<Ts...>::type
>::type>::value>::type
toAppend(const Ts&... vs) {
- detail::reserveInTarget(vs...);
- detail::toAppendStrImpl(vs...);
+ ::folly::detail::toAppendStrImpl(vs...);
}
+/**
+ * Special version of the call that preallocates exaclty as much memory
+ * as need for arguments to be stored in target. This means we are
+ * not doing exponential growth when we append. If you are using it
+ * in a loop you are aiming at your foot with a big perf-destroying
+ * bazooka.
+ * On the other hand if you are appending to a string once, this
+ * will probably save a few calls to malloc.
+ */
+template <class... Ts>
+typename std::enable_if<
+ IsSomeString<
+ typename std::remove_pointer<
+ typename detail::last_element<Ts...>::type
+ >::type>::value>::type
+toAppendFit(const Ts&... vs) {
+ ::folly::detail::reserveInTarget(vs...);
+ toAppend(vs...);
+}
+
+template <class Ts>
+void toAppendFit(const Ts&) {}
+
/**
* Variadic base case: do nothing.
*/
template <class Tgt>
-typename std::enable_if<IsSomeString<Tgt>::value>::type
-toAppend(Tgt* result) {
-}
+typename std::enable_if<IsSomeString<Tgt>::value>::type toAppend(
+ Tgt* /* result */) {}
/**
* Variadic base case: do nothing.
*/
template <class Delimiter, class Tgt>
-typename std::enable_if<IsSomeString<Tgt>::value>::type
-toAppendDelim(const Delimiter& delim, Tgt* result) {
-}
+typename std::enable_if<IsSomeString<Tgt>::value>::type toAppendDelim(
+ const Delimiter& /* delim */, Tgt* /* result */) {}
/**
* 1 element: same as toAppend.
*/
template <class Delimiter, class T, class Tgt>
-typename std::enable_if<IsSomeString<Tgt>::value>::type
-toAppendDelim(const Delimiter& delim, const T& v, Tgt* tgt) {
+typename std::enable_if<IsSomeString<Tgt>::value>::type toAppendDelim(
+ const Delimiter& /* delim */, const T& v, Tgt* tgt) {
toAppend(v, tgt);
}
/**
- * Append to string with a delimiter in between elements.
+ * Append to string with a delimiter in between elements. Check out
+ * comments for toAppend for details about memory allocation.
*/
template <class Delimiter, class... Ts>
typename std::enable_if<sizeof...(Ts) >= 3
typename detail::last_element<Ts...>::type
>::type>::value>::type
toAppendDelim(const Delimiter& delim, const Ts&... vs) {
- detail::reserveInTargetDelim(delim, vs...);
detail::toAppendDelimStrImpl(delim, vs...);
}
/**
- * to<SomeString>(SomeString str) returns itself. As both std::string and
- * folly::fbstring use Copy-on-Write, it's much more efficient by
- * avoiding copying the underlying char array.
+ * Detail in comment for toAppendFit
*/
-template <class Tgt, class Src>
+template <class Delimiter, class... Ts>
typename std::enable_if<
- IsSomeString<Tgt>::value && std::is_same<Tgt, Src>::value,
- Tgt>::type
-to(const Src & value) {
- return value;
+ IsSomeString<
+ typename std::remove_pointer<
+ typename detail::last_element<Ts...>::type
+ >::type>::value>::type
+toAppendDelimFit(const Delimiter& delim, const Ts&... vs) {
+ detail::reserveInTargetDelim(delim, vs...);
+ toAppendDelim(delim, vs...);
}
+template <class De, class Ts>
+void toAppendDelimFit(const De&, const Ts&) {}
+
/**
* to<SomeString>(v1, v2, ...) uses toAppend() (see below) as back-end
* for all types.
Tgt>::type
to(const Ts&... vs) {
Tgt result;
- toAppend(vs..., &result);
+ toAppendFit(vs..., &result);
return result;
}
* toDelim<SomeString>(SomeString str) returns itself.
*/
template <class Tgt, class Delim, class Src>
-typename std::enable_if<
- IsSomeString<Tgt>::value && std::is_same<Tgt, Src>::value,
- Tgt>::type
-toDelim(const Delim& delim, const Src & value) {
+typename std::enable_if<IsSomeString<Tgt>::value &&
+ std::is_same<Tgt, Src>::value,
+ Tgt>::type
+toDelim(const Delim& /* delim */, const Src& value) {
return value;
}
Tgt>::type
toDelim(const Delim& delim, const Ts&... vs) {
Tgt result;
- toAppendDelim(delim, vs..., &result);
+ toAppendDelimFit(delim, vs..., &result);
return result;
}
static const char*const value;
};
+ bool str_to_bool(StringPiece* src);
-/*
- * Lookup tables that converts from a decimal character value to an integral
- * binary value, shifted by a decimal "shift" multiplier.
- * For all character values in the range '0'..'9', the table at those
- * index locations returns the actual decimal value shifted by the multiplier.
- * For all other values, the lookup table returns an invalid OOR value.
- */
-// Out-of-range flag value, larger than the largest value that can fit in
-// four decimal bytes (9999), but four of these added up together should
-// still not overflow uint16_t.
-constexpr int32_t OOR = 10000;
-
-__attribute__((aligned(16))) constexpr uint16_t shift1[] = {
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 0-9
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 10
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 20
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 30
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, 0, // 40
- 1, 2, 3, 4, 5, 6, 7, 8, 9, OOR, OOR,
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 60
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 70
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 80
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 90
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 100
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 110
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 120
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 130
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 140
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 150
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 160
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 170
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 180
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 190
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 200
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 210
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 220
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 230
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 240
- OOR, OOR, OOR, OOR, OOR, OOR // 250
-};
-
-__attribute__((aligned(16))) constexpr uint16_t shift10[] = {
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 0-9
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 10
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 20
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 30
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, 0, // 40
- 10, 20, 30, 40, 50, 60, 70, 80, 90, OOR, OOR,
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 60
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 70
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 80
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 90
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 100
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 110
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 120
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 130
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 140
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 150
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 160
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 170
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 180
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 190
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 200
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 210
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 220
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 230
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 240
- OOR, OOR, OOR, OOR, OOR, OOR // 250
-};
-
-__attribute__((aligned(16))) constexpr uint16_t shift100[] = {
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 0-9
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 10
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 20
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 30
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, 0, // 40
- 100, 200, 300, 400, 500, 600, 700, 800, 900, OOR, OOR,
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 60
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 70
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 80
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 90
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 100
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 110
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 120
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 130
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 140
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 150
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 160
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 170
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 180
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 190
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 200
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 210
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 220
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 230
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 240
- OOR, OOR, OOR, OOR, OOR, OOR // 250
-};
-
-__attribute__((aligned(16))) constexpr uint16_t shift1000[] = {
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 0-9
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 10
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 20
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 30
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, 0, // 40
- 1000, 2000, 3000, 4000, 5000, 6000, 7000, 8000, 9000, OOR, OOR,
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 60
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 70
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 80
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 90
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 100
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 110
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 120
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 130
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 140
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 150
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 160
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 170
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 180
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 190
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 200
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 210
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 220
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 230
- OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, OOR, // 240
- OOR, OOR, OOR, OOR, OOR, OOR // 250
-};
-
-/**
- * String represented as a pair of pointers to char to unsigned
- * integrals. Assumes NO whitespace before or after, and also that the
- * string is composed entirely of digits. Tgt must be unsigned, and no
- * sign is allowed in the string (even it's '+'). String may be empty,
- * in which case digits_to throws.
- */
template <class Tgt>
- Tgt digits_to(const char * b, const char * e) {
-
- static_assert(!std::is_signed<Tgt>::value, "Unsigned type expected");
- assert(b <= e);
-
- const size_t size = e - b;
-
- /* Although the string is entirely made of digits, we still need to
- * check for overflow.
- */
- if (size >= std::numeric_limits<Tgt>::digits10 + 1) {
- // Leading zeros? If so, recurse to keep things simple
- if (b < e && *b == '0') {
- for (++b;; ++b) {
- if (b == e) return 0; // just zeros, e.g. "0000"
- if (*b != '0') return digits_to<Tgt>(b, e);
- }
- }
- FOLLY_RANGE_CHECK(size == std::numeric_limits<Tgt>::digits10 + 1 &&
- strncmp(b, detail::MaxString<Tgt>::value, size) <= 0,
- "Numeric overflow upon conversion");
- }
-
- // Here we know that the number won't overflow when
- // converted. Proceed without checks.
-
- Tgt result = 0;
-
- for (; e - b >= 4; b += 4) {
- result *= 10000;
- const int32_t r0 = shift1000[static_cast<size_t>(b[0])];
- const int32_t r1 = shift100[static_cast<size_t>(b[1])];
- const int32_t r2 = shift10[static_cast<size_t>(b[2])];
- const int32_t r3 = shift1[static_cast<size_t>(b[3])];
- const auto sum = r0 + r1 + r2 + r3;
- assert(sum < OOR && "Assumption: string only has digits");
- result += sum;
- }
-
- switch (e - b) {
- case 3: {
- const int32_t r0 = shift100[static_cast<size_t>(b[0])];
- const int32_t r1 = shift10[static_cast<size_t>(b[1])];
- const int32_t r2 = shift1[static_cast<size_t>(b[2])];
- const auto sum = r0 + r1 + r2;
- assert(sum < OOR && "Assumption: string only has digits");
- return result * 1000 + sum;
- }
- case 2: {
- const int32_t r0 = shift10[static_cast<size_t>(b[0])];
- const int32_t r1 = shift1[static_cast<size_t>(b[1])];
- const auto sum = r0 + r1;
- assert(sum < OOR && "Assumption: string only has digits");
- return result * 100 + sum;
- }
- case 1: {
- const int32_t sum = shift1[static_cast<size_t>(b[0])];
- assert(sum < OOR && "Assumption: string only has digits");
- return result * 10 + sum;
- }
- }
-
- assert(b == e);
- FOLLY_RANGE_CHECK(size > 0, "Found no digits to convert in input");
- return result;
- }
-
-
- bool str_to_bool(StringPiece * src);
+ Tgt digits_to(const char* b, const char* e);
+
+ extern template unsigned char digits_to<unsigned char>(const char* b,
+ const char* e);
+ extern template unsigned short digits_to<unsigned short>(const char* b,
+ const char* e);
+ extern template unsigned int digits_to<unsigned int>(const char* b,
+ const char* e);
+ extern template unsigned long digits_to<unsigned long>(const char* b,
+ const char* e);
+ extern template unsigned long long digits_to<unsigned long long>(
+ const char* b, const char* e);
+#if FOLLY_HAVE_INT128_T
+ extern template unsigned __int128 digits_to<unsigned __int128>(const char* b,
+ const char* e);
+#endif
} // namespace detail
std::is_integral<Tgt>::value && std::is_signed<Tgt>::value,
Tgt>::type
to(const char * b, const char * e) {
- FOLLY_RANGE_CHECK(b < e, "Empty input string in conversion to integral");
+ FOLLY_RANGE_CHECK(b < e, "Empty input string in conversion to integral",
+ to<std::string>("b: ", intptr_t(b), " e: ", intptr_t(e)));
if (!isdigit(*b)) {
if (*b == '-') {
Tgt result = -to<typename std::make_unsigned<Tgt>::type>(b + 1, e);
- FOLLY_RANGE_CHECK(result <= 0, "Negative overflow.");
+ FOLLY_RANGE_CHECK_BEGIN_END(result <= 0, "Negative overflow.", b, e);
return result;
}
- FOLLY_RANGE_CHECK(*b == '+', "Invalid lead character");
+ FOLLY_RANGE_CHECK_BEGIN_END(*b == '+', "Invalid lead character", b, e);
++b;
}
Tgt result = to<typename std::make_unsigned<Tgt>::type>(b, e);
- FOLLY_RANGE_CHECK(result >= 0, "Overflow.");
+ FOLLY_RANGE_CHECK_BEGIN_END(result >= 0, "Overflow", b, e);
return result;
}
auto b = src->data(), past = src->data() + src->size();
for (;; ++b) {
- FOLLY_RANGE_CHECK(b < past, "No digits found in input string");
+ FOLLY_RANGE_CHECK_STRINGPIECE(b < past,
+ "No digits found in input string", *src);
if (!isspace(*b)) break;
}
if (*m == '-') {
negative = true;
} else {
- FOLLY_RANGE_CHECK(*m == '+', "Invalid leading character in conversion"
- " to integral");
+ FOLLY_RANGE_CHECK_STRINGPIECE(*m == '+', "Invalid leading character in "
+ "conversion to integral", *src);
}
++b;
++m;
}
}
- FOLLY_RANGE_CHECK(m < past, "No digits found in input string");
- FOLLY_RANGE_CHECK(isdigit(*m), "Non-digit character found");
+ FOLLY_RANGE_CHECK_STRINGPIECE(m < past, "No digits found in input string",
+ *src);
+ FOLLY_RANGE_CHECK_STRINGPIECE(isdigit(*m), "Non-digit character found", *src);
m = detail::findFirstNonDigit<Tgt>(m + 1, past);
Tgt result;
auto t = detail::digits_to<typename std::make_unsigned<Tgt>::type>(b, m);
if (negative) {
result = -t;
- FOLLY_RANGE_CHECK(is_non_positive(result), "Negative overflow");
+ FOLLY_RANGE_CHECK_STRINGPIECE(is_non_positive(result),
+ "Negative overflow", *src);
} else {
result = t;
- FOLLY_RANGE_CHECK(is_non_negative(result), "Overflow");
+ FOLLY_RANGE_CHECK_STRINGPIECE(is_non_negative(result), "Overflow", *src);
}
}
src->advance(m - src->data());
*/
inline void enforceWhitespace(const char* b, const char* e) {
for (; b != e; ++b) {
- FOLLY_RANGE_CHECK(isspace(*b), to<std::string>("Non-whitespace: ", *b));
+ FOLLY_RANGE_CHECK_BEGIN_END(isspace(*b),
+ to<std::string>("Non-whitespace: ", *b),
+ b, e);
}
}
std::numeric_limits<double>::quiet_NaN(),
nullptr, nullptr);
- FOLLY_RANGE_CHECK(!src->empty(), "No digits found in input string");
+ FOLLY_RANGE_CHECK_STRINGPIECE(!src->empty(),
+ "No digits found in input string", *src);
int length;
- auto result = conv.StringToDouble(src->data(), src->size(),
- &length); // processed char count
+ auto result = conv.StringToDouble(src->data(),
+ static_cast<int>(src->size()),
+ &length); // processed char count
if (!std::isnan(result)) {
src->advance(length);
std::is_floating_point<Tgt>::value,
Tgt>::type
to(StringPiece src) {
- Tgt result = to<double>(&src);
+ Tgt result = Tgt(to<double>(&src));
detail::enforceWhitespace(src.data(), src.data() + src.size());
return result;
}
******************************************************************************/
/**
- * Checked conversion from integral to flating point and back. The
+ * Checked conversion from integral to floating point and back. The
* result must be convertible back to the source type without loss of
* precision. This seems Draconian but sometimes is what's needed, and
* complements existing routines nicely. For various rounding
(std::is_floating_point<Src>::value && std::is_integral<Tgt>::value),
Tgt>::type
to(const Src & value) {
- Tgt result = value;
+ Tgt result = Tgt(value);
auto witness = static_cast<Src>(result);
if (value != witness) {
throw std::range_error(
to<std::string>("to<>: loss of precision when converting ", value,
- " to type ", typeid(Tgt).name()).c_str());
+#ifdef FOLLY_HAS_RTTI
+ " to type ", typeid(Tgt).name()
+#else
+ " to other type"
+#endif
+ ).c_str());
}
return result;
}
* Enum to anything and back
******************************************************************************/
-#if defined(__clang__) || __GNUC_PREREQ(4, 7)
-// std::underlying_type became available by gcc 4.7.0
-
template <class Tgt, class Src>
-typename std::enable_if<std::is_enum<Src>::value, Tgt>::type
+typename std::enable_if<
+ std::is_enum<Src>::value && !std::is_same<Src, Tgt>::value, Tgt>::type
to(const Src & value) {
return to<Tgt>(static_cast<typename std::underlying_type<Src>::type>(value));
}
template <class Tgt, class Src>
-typename std::enable_if<std::is_enum<Tgt>::value, Tgt>::type
+typename std::enable_if<
+ std::is_enum<Tgt>::value && !std::is_same<Src, Tgt>::value, Tgt>::type
to(const Src & value) {
return static_cast<Tgt>(to<typename std::underlying_type<Tgt>::type>(value));
}
-#else
-
-template <class Tgt, class Src>
-typename std::enable_if<std::is_enum<Src>::value, Tgt>::type
-to(const Src & value) {
- /* static */ if (Src(-1) < 0) {
- /* static */ if (sizeof(Src) <= sizeof(int)) {
- return to<Tgt>(static_cast<int>(value));
- } else {
- return to<Tgt>(static_cast<long>(value));
- }
- } else {
- /* static */ if (sizeof(Src) <= sizeof(int)) {
- return to<Tgt>(static_cast<unsigned int>(value));
- } else {
- return to<Tgt>(static_cast<unsigned long>(value));
- }
- }
-}
-
-template <class Tgt, class Src>
-typename std::enable_if<std::is_enum<Tgt>::value, Tgt>::type
-to(const Src & value) {
- /* static */ if (Tgt(-1) < 0) {
- /* static */ if (sizeof(Tgt) <= sizeof(int)) {
- return static_cast<Tgt>(to<int>(value));
- } else {
- return static_cast<Tgt>(to<long>(value));
- }
- } else {
- /* static */ if (sizeof(Tgt) <= sizeof(int)) {
- return static_cast<Tgt>(to<unsigned int>(value));
- } else {
- return static_cast<Tgt>(to<unsigned long>(value));
- }
- }
-}
-
-#endif // gcc 4.7 onwards
-
} // namespace folly
// FOLLY_CONV_INTERNAL is defined by Conv.cpp. Keep the FOLLY_RANGE_CHECK
// to avoid defining this global macro name in other files that include Conv.h.
#ifndef FOLLY_CONV_INTERNAL
#undef FOLLY_RANGE_CHECK
+#undef FOLLY_RANGE_CHECK_BEGIN_END
+#undef FOLLY_RANGE_CHECK_STRINGPIECE
+#undef FOLLY_RANGE_CHECK_STRINGIZE
+#undef FOLLY_RANGE_CHECK_STRINGIZE2
#endif
#endif /* FOLLY_BASE_CONV_H_ */
projects / folly.git / blobdiff