2016-08-01 05:25:37 +00:00
|
|
|
/*
|
2017-02-02 10:06:28 +00:00
|
|
|
This file is part of solidity.
|
2016-08-01 05:25:37 +00:00
|
|
|
|
2017-02-02 10:06:28 +00:00
|
|
|
solidity is free software: you can redistribute it and/or modify
|
2016-08-01 05:25:37 +00:00
|
|
|
it under the terms of the GNU General Public License as published by
|
|
|
|
the Free Software Foundation, either version 3 of the License, or
|
|
|
|
(at your option) any later version.
|
|
|
|
|
2017-02-02 10:06:28 +00:00
|
|
|
solidity is distributed in the hope that it will be useful,
|
2016-08-01 05:25:37 +00:00
|
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
|
|
GNU General Public License for more details.
|
|
|
|
|
|
|
|
You should have received a copy of the GNU General Public License
|
2017-02-02 10:06:28 +00:00
|
|
|
along with solidity. If not, see <http://www.gnu.org/licenses/>.
|
2016-08-01 05:25:37 +00:00
|
|
|
*/
|
2020-07-17 14:54:12 +00:00
|
|
|
// SPDX-License-Identifier: GPL-3.0
|
2016-08-01 05:25:37 +00:00
|
|
|
/** @file CommonData.cpp
|
|
|
|
* @author Gav Wood <i@gavwood.com>
|
|
|
|
* @date 2014
|
|
|
|
*/
|
|
|
|
|
2022-03-04 09:15:57 +00:00
|
|
|
#include <libsolutil/Assertions.h>
|
2020-01-06 10:52:23 +00:00
|
|
|
#include <libsolutil/CommonData.h>
|
|
|
|
#include <libsolutil/Exceptions.h>
|
|
|
|
#include <libsolutil/FixedHash.h>
|
2022-03-04 09:15:57 +00:00
|
|
|
#include <libsolutil/Keccak256.h>
|
|
|
|
#include <libsolutil/StringUtils.h>
|
2017-01-24 22:36:07 +00:00
|
|
|
|
|
|
|
#include <boost/algorithm/string.hpp>
|
|
|
|
|
2019-12-11 16:31:36 +00:00
|
|
|
using namespace solidity;
|
|
|
|
using namespace solidity::util;
|
2016-08-01 05:25:37 +00:00
|
|
|
|
2019-11-25 17:16:35 +00:00
|
|
|
namespace
|
|
|
|
{
|
|
|
|
|
|
|
|
static char const* upperHexChars = "0123456789ABCDEF";
|
|
|
|
static char const* lowerHexChars = "0123456789abcdef";
|
|
|
|
|
|
|
|
}
|
|
|
|
|
2023-08-17 13:53:20 +00:00
|
|
|
std::string solidity::util::toHex(uint8_t _data, HexCase _case)
|
2019-11-25 17:16:35 +00:00
|
|
|
{
|
|
|
|
assertThrow(_case != HexCase::Mixed, BadHexCase, "Mixed case can only be used for byte arrays.");
|
|
|
|
|
|
|
|
char const* chars = _case == HexCase::Upper ? upperHexChars : lowerHexChars;
|
|
|
|
|
|
|
|
return std::string{
|
|
|
|
chars[(unsigned(_data) / 16) & 0xf],
|
|
|
|
chars[unsigned(_data) & 0xf]
|
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2023-08-17 13:53:20 +00:00
|
|
|
std::string solidity::util::toHex(bytes const& _data, HexPrefix _prefix, HexCase _case)
|
2018-12-05 19:35:45 +00:00
|
|
|
{
|
2019-11-25 17:16:35 +00:00
|
|
|
std::string ret(_data.size() * 2 + (_prefix == HexPrefix::Add ? 2 : 0), 0);
|
|
|
|
|
|
|
|
size_t i = 0;
|
2018-12-05 21:13:41 +00:00
|
|
|
if (_prefix == HexPrefix::Add)
|
2019-11-25 17:16:35 +00:00
|
|
|
{
|
|
|
|
ret[i++] = '0';
|
|
|
|
ret[i++] = 'x';
|
|
|
|
}
|
2018-12-05 21:13:41 +00:00
|
|
|
|
2019-11-25 17:16:35 +00:00
|
|
|
// Mixed case will be handled inside the loop.
|
|
|
|
char const* chars = _case == HexCase::Upper ? upperHexChars : lowerHexChars;
|
2020-05-11 14:41:39 +00:00
|
|
|
size_t rix = _data.size() - 1;
|
2018-12-05 19:35:45 +00:00
|
|
|
for (uint8_t c: _data)
|
|
|
|
{
|
|
|
|
// switch hex case every four hexchars
|
2019-11-25 17:16:35 +00:00
|
|
|
if (_case == HexCase::Mixed)
|
|
|
|
chars = (rix-- & 2) == 0 ? lowerHexChars : upperHexChars;
|
2018-12-05 19:35:45 +00:00
|
|
|
|
2020-06-02 13:40:27 +00:00
|
|
|
ret[i++] = chars[(static_cast<size_t>(c) >> 4ul) & 0xfu];
|
|
|
|
ret[i++] = chars[c & 0xfu];
|
2018-12-05 19:35:45 +00:00
|
|
|
}
|
2019-11-25 17:16:35 +00:00
|
|
|
assertThrow(i == ret.size(), Exception, "");
|
2018-12-05 19:35:45 +00:00
|
|
|
|
2019-11-25 17:16:35 +00:00
|
|
|
return ret;
|
2018-12-05 19:35:45 +00:00
|
|
|
}
|
|
|
|
|
2019-12-11 16:31:36 +00:00
|
|
|
int solidity::util::fromHex(char _i, WhenError _throw)
|
2016-08-01 05:25:37 +00:00
|
|
|
{
|
|
|
|
if (_i >= '0' && _i <= '9')
|
|
|
|
return _i - '0';
|
|
|
|
if (_i >= 'a' && _i <= 'f')
|
|
|
|
return _i - 'a' + 10;
|
|
|
|
if (_i >= 'A' && _i <= 'F')
|
|
|
|
return _i - 'A' + 10;
|
|
|
|
if (_throw == WhenError::Throw)
|
2023-08-17 13:53:20 +00:00
|
|
|
assertThrow(false, BadHexCharacter, std::to_string(_i));
|
2016-08-01 05:25:37 +00:00
|
|
|
else
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2019-12-11 16:31:36 +00:00
|
|
|
bytes solidity::util::fromHex(std::string const& _s, WhenError _throw)
|
2016-08-01 05:25:37 +00:00
|
|
|
{
|
2020-05-11 14:41:39 +00:00
|
|
|
if (_s.empty())
|
|
|
|
return {};
|
|
|
|
|
2016-08-01 05:25:37 +00:00
|
|
|
unsigned s = (_s.size() >= 2 && _s[0] == '0' && _s[1] == 'x') ? 2 : 0;
|
|
|
|
std::vector<uint8_t> ret;
|
|
|
|
ret.reserve((_s.size() - s + 1) / 2);
|
|
|
|
|
|
|
|
if (_s.size() % 2)
|
|
|
|
{
|
2019-11-22 16:59:06 +00:00
|
|
|
int h = fromHex(_s[s++], _throw);
|
2016-08-01 05:25:37 +00:00
|
|
|
if (h != -1)
|
2020-06-05 11:36:03 +00:00
|
|
|
ret.push_back(static_cast<uint8_t>(h));
|
2016-08-01 05:25:37 +00:00
|
|
|
else
|
|
|
|
return bytes();
|
|
|
|
}
|
|
|
|
for (unsigned i = s; i < _s.size(); i += 2)
|
|
|
|
{
|
2019-11-22 16:59:06 +00:00
|
|
|
int h = fromHex(_s[i], _throw);
|
|
|
|
int l = fromHex(_s[i + 1], _throw);
|
2016-08-01 05:25:37 +00:00
|
|
|
if (h != -1 && l != -1)
|
2020-06-05 11:36:03 +00:00
|
|
|
ret.push_back(static_cast<uint8_t>(h * 16 + l));
|
2016-08-01 05:25:37 +00:00
|
|
|
else
|
|
|
|
return bytes();
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
2017-01-24 22:36:07 +00:00
|
|
|
|
|
|
|
|
2023-08-17 13:53:20 +00:00
|
|
|
bool solidity::util::passesAddressChecksum(std::string const& _str, bool _strict)
|
2017-01-24 22:36:07 +00:00
|
|
|
{
|
2023-08-17 13:53:20 +00:00
|
|
|
std::string s = _str.substr(0, 2) == "0x" ? _str : "0x" + _str;
|
2017-01-24 22:36:07 +00:00
|
|
|
|
2018-10-09 07:12:04 +00:00
|
|
|
if (s.length() != 42)
|
2017-01-24 22:36:07 +00:00
|
|
|
return false;
|
|
|
|
|
|
|
|
if (!_strict && (
|
2023-08-17 13:53:20 +00:00
|
|
|
s.find_first_of("abcdef") == std::string::npos ||
|
|
|
|
s.find_first_of("ABCDEF") == std::string::npos
|
2017-01-24 22:36:07 +00:00
|
|
|
))
|
|
|
|
return true;
|
|
|
|
|
2019-12-11 16:31:36 +00:00
|
|
|
return s == solidity::util::getChecksummedAddress(s);
|
2017-10-05 13:28:25 +00:00
|
|
|
}
|
|
|
|
|
2023-08-17 13:53:20 +00:00
|
|
|
std::string solidity::util::getChecksummedAddress(std::string const& _addr)
|
2017-10-05 13:28:25 +00:00
|
|
|
{
|
2023-08-17 13:53:20 +00:00
|
|
|
std::string s = _addr.substr(0, 2) == "0x" ? _addr.substr(2) : _addr;
|
2017-10-20 14:23:28 +00:00
|
|
|
assertThrow(s.length() == 40, InvalidAddress, "");
|
2023-08-17 13:53:20 +00:00
|
|
|
assertThrow(s.find_first_not_of("0123456789abcdefABCDEF") == std::string::npos, InvalidAddress, "");
|
2017-10-20 14:23:28 +00:00
|
|
|
|
2017-01-24 22:36:07 +00:00
|
|
|
h256 hash = keccak256(boost::algorithm::to_lower_copy(s, std::locale::classic()));
|
2017-10-05 13:28:25 +00:00
|
|
|
|
2023-08-17 13:53:20 +00:00
|
|
|
std::string ret = "0x";
|
2020-06-05 11:36:03 +00:00
|
|
|
for (unsigned i = 0; i < 40; ++i)
|
2017-01-24 22:36:07 +00:00
|
|
|
{
|
|
|
|
char addressCharacter = s[i];
|
2020-06-05 11:36:03 +00:00
|
|
|
uint8_t nibble = hash[i / 2u] >> (4u * (1u - (i % 2u))) & 0xf;
|
2017-10-05 13:28:25 +00:00
|
|
|
if (nibble >= 8)
|
2022-03-04 09:15:57 +00:00
|
|
|
ret += toUpper(addressCharacter);
|
2017-10-05 13:28:25 +00:00
|
|
|
else
|
2022-03-04 09:15:57 +00:00
|
|
|
ret += toLower(addressCharacter);
|
2017-01-24 22:36:07 +00:00
|
|
|
}
|
2017-10-05 13:28:25 +00:00
|
|
|
return ret;
|
2017-01-24 22:36:07 +00:00
|
|
|
}
|
2018-10-16 15:58:17 +00:00
|
|
|
|
2023-08-17 13:53:20 +00:00
|
|
|
bool solidity::util::isValidHex(std::string const& _string)
|
2018-10-16 15:58:17 +00:00
|
|
|
{
|
|
|
|
if (_string.substr(0, 2) != "0x")
|
|
|
|
return false;
|
2023-08-17 13:53:20 +00:00
|
|
|
if (_string.find_first_not_of("0123456789abcdefABCDEF", 2) != std::string::npos)
|
2018-10-16 15:58:17 +00:00
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
2023-08-17 13:53:20 +00:00
|
|
|
bool solidity::util::isValidDecimal(std::string const& _string)
|
2018-10-16 15:58:17 +00:00
|
|
|
{
|
|
|
|
if (_string.empty())
|
|
|
|
return false;
|
|
|
|
if (_string == "0")
|
|
|
|
return true;
|
|
|
|
// No leading zeros
|
|
|
|
if (_string.front() == '0')
|
|
|
|
return false;
|
2023-08-17 13:53:20 +00:00
|
|
|
if (_string.find_first_not_of("0123456789") != std::string::npos)
|
2018-10-16 15:58:17 +00:00
|
|
|
return false;
|
|
|
|
return true;
|
|
|
|
}
|
2019-11-21 17:56:25 +00:00
|
|
|
|
2023-08-17 13:53:20 +00:00
|
|
|
std::string solidity::util::formatAsStringOrNumber(std::string const& _value)
|
2019-11-21 17:56:25 +00:00
|
|
|
{
|
2019-11-28 13:33:38 +00:00
|
|
|
assertThrow(_value.length() <= 32, StringTooLong, "String to be formatted longer than 32 bytes.");
|
|
|
|
|
|
|
|
for (auto const& c: _value)
|
|
|
|
if (c <= 0x1f || c >= 0x7f || c == '"')
|
|
|
|
return "0x" + h256(_value, h256::AlignLeft).hex();
|
2019-11-21 17:56:25 +00:00
|
|
|
|
2021-07-14 19:29:01 +00:00
|
|
|
return escapeAndQuoteString(_value);
|
2020-05-07 17:19:54 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2023-08-17 13:53:20 +00:00
|
|
|
std::string solidity::util::escapeAndQuoteString(std::string const& _input)
|
2020-05-07 17:19:54 +00:00
|
|
|
{
|
2023-08-17 13:53:20 +00:00
|
|
|
std::string out;
|
2020-05-07 17:19:54 +00:00
|
|
|
|
|
|
|
for (char c: _input)
|
|
|
|
if (c == '\\')
|
|
|
|
out += "\\\\";
|
|
|
|
else if (c == '"')
|
|
|
|
out += "\\\"";
|
|
|
|
else if (c == '\n')
|
|
|
|
out += "\\n";
|
|
|
|
else if (c == '\r')
|
|
|
|
out += "\\r";
|
|
|
|
else if (c == '\t')
|
|
|
|
out += "\\t";
|
2022-03-04 09:15:57 +00:00
|
|
|
else if (!isPrint(c))
|
2020-05-07 17:19:54 +00:00
|
|
|
{
|
2023-08-17 13:53:20 +00:00
|
|
|
std::ostringstream o;
|
|
|
|
o << "\\x" << std::hex << std::setfill('0') << std::setw(2) << (unsigned)(unsigned char)(c);
|
2020-05-07 17:19:54 +00:00
|
|
|
out += o.str();
|
|
|
|
}
|
|
|
|
else
|
|
|
|
out += c;
|
|
|
|
|
|
|
|
return "\"" + std::move(out) + "\"";
|
2019-11-21 17:56:25 +00:00
|
|
|
}
|