ext-boost/boost/url/grammar/impl/unsigned_rule.hpp
2023-05-22 18:45:02 +10:00

110 lines
2.3 KiB
C++

//
// Copyright (c) 2022 Alan de Freitas (alandefreitas at gmail dot 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/url
//
#ifndef BOOST_URL_GRAMMAR_IMPL_UNSIGNED_RULE_HPP
#define BOOST_URL_GRAMMAR_IMPL_UNSIGNED_RULE_HPP
#include <boost/url/grammar/error.hpp>
#include <boost/url/grammar/digit_chars.hpp>
#include <algorithm> // VFALCO grr..
namespace boost {
namespace urls {
namespace grammar {
template<class U>
auto
unsigned_rule<U>::
parse(
char const*& it,
char const* end
) const noexcept ->
result<value_type>
{
if(it == end)
{
// end
BOOST_URL_RETURN_EC(
error::mismatch);
}
if(*it == '0')
{
++it;
if( it == end ||
! digit_chars(*it))
{
return U(0);
}
// bad leading zero
BOOST_URL_RETURN_EC(
error::invalid);
}
if(! digit_chars(*it))
{
// expected digit
BOOST_URL_RETURN_EC(
error::mismatch);
}
static constexpr U Digits10 =
std::numeric_limits<
U>::digits10;
static constexpr U ten = 10;
char const* safe_end;
if(static_cast<std::size_t>(
end - it) >= Digits10)
safe_end = it + Digits10;
else
safe_end = end;
U u = *it - '0';
++it;
while(it != safe_end &&
digit_chars(*it))
{
char const dig = *it - '0';
u = u * ten + dig;
++it;
}
if( it != end &&
digit_chars(*it))
{
static constexpr U Max = (
std::numeric_limits<
U>::max)();
static constexpr
auto div = (Max / ten);
static constexpr
char rem = (Max % ten);
char const dig = *it - '0';
if( u > div || (
u == div && dig > rem))
{
// integer overflow
BOOST_URL_RETURN_EC(
error::invalid);
}
u = u * ten + dig;
++it;
if( it < end &&
digit_chars(*it))
{
// integer overflow
BOOST_URL_RETURN_EC(
error::invalid);
}
}
return u;
}
} // grammar
} // urls
} // boost
#endif