mirror of
https://github.com/ethereum/solidity
synced 2023-10-03 13:03:40 +00:00
117 lines
3.3 KiB
C++
117 lines
3.3 KiB
C++
/*
|
|
This file is part of solidity.
|
|
|
|
solidity is free software: you can redistribute it and/or modify
|
|
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.
|
|
|
|
solidity is distributed in the hope that it will be useful,
|
|
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
|
|
along with solidity. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
// SPDX-License-Identifier: GPL-3.0
|
|
/**
|
|
* @author Christian <c@ethdev.com>
|
|
* @date 2015
|
|
* Evaluator for types of constant expressions.
|
|
*/
|
|
|
|
#include <libsolidity/analysis/ConstantEvaluator.h>
|
|
|
|
#include <libsolidity/ast/AST.h>
|
|
#include <libsolidity/ast/TypeProvider.h>
|
|
#include <liblangutil/ErrorReporter.h>
|
|
|
|
using namespace std;
|
|
using namespace solidity;
|
|
using namespace solidity::frontend;
|
|
using namespace solidity::langutil;
|
|
|
|
void ConstantEvaluator::endVisit(UnaryOperation const& _operation)
|
|
{
|
|
auto sub = type(_operation.subExpression());
|
|
if (sub)
|
|
setType(_operation, sub->unaryOperatorResult(_operation.getOperator()));
|
|
}
|
|
|
|
void ConstantEvaluator::endVisit(BinaryOperation const& _operation)
|
|
{
|
|
auto left = type(_operation.leftExpression());
|
|
auto right = type(_operation.rightExpression());
|
|
if (left && right)
|
|
{
|
|
TypePointer commonType = left->binaryOperatorResult(_operation.getOperator(), right);
|
|
if (!commonType)
|
|
m_errorReporter.fatalTypeError(
|
|
6020_error,
|
|
_operation.location(),
|
|
"Operator " +
|
|
string(TokenTraits::toString(_operation.getOperator())) +
|
|
" not compatible with types " +
|
|
left->toString() +
|
|
" and " +
|
|
right->toString()
|
|
);
|
|
setType(
|
|
_operation,
|
|
TokenTraits::isCompareOp(_operation.getOperator()) ?
|
|
TypeProvider::boolean() :
|
|
commonType
|
|
);
|
|
}
|
|
}
|
|
|
|
void ConstantEvaluator::endVisit(Literal const& _literal)
|
|
{
|
|
setType(_literal, TypeProvider::forLiteral(_literal));
|
|
}
|
|
|
|
void ConstantEvaluator::endVisit(Identifier const& _identifier)
|
|
{
|
|
VariableDeclaration const* variableDeclaration = dynamic_cast<VariableDeclaration const*>(_identifier.annotation().referencedDeclaration);
|
|
if (!variableDeclaration)
|
|
return;
|
|
if (!variableDeclaration->isConstant())
|
|
return;
|
|
|
|
ASTPointer<Expression> const& value = variableDeclaration->value();
|
|
if (!value)
|
|
return;
|
|
else if (!m_types->count(value.get()))
|
|
{
|
|
if (m_depth > 32)
|
|
m_errorReporter.fatalTypeError(5210_error, _identifier.location(), "Cyclic constant definition (or maximum recursion depth exhausted).");
|
|
ConstantEvaluator(m_errorReporter, m_depth + 1, m_types).evaluate(*value);
|
|
}
|
|
|
|
setType(_identifier, type(*value));
|
|
}
|
|
|
|
void ConstantEvaluator::endVisit(TupleExpression const& _tuple)
|
|
{
|
|
if (!_tuple.isInlineArray() && _tuple.components().size() == 1)
|
|
setType(_tuple, type(*_tuple.components().front()));
|
|
}
|
|
|
|
void ConstantEvaluator::setType(ASTNode const& _node, TypePointer const& _type)
|
|
{
|
|
if (_type && _type->category() == Type::Category::RationalNumber)
|
|
(*m_types)[&_node] = _type;
|
|
}
|
|
|
|
TypePointer ConstantEvaluator::type(ASTNode const& _node)
|
|
{
|
|
return (*m_types)[&_node];
|
|
}
|
|
|
|
TypePointer ConstantEvaluator::evaluate(Expression const& _expr)
|
|
{
|
|
_expr.accept(*this);
|
|
return type(_expr);
|
|
}
|