/* 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 . */ /** * @author Christian * @date 2014 * Scope - object that holds declaration of names. */ #include #include #include #include using namespace std; using namespace dev; using namespace dev::solidity; Declaration const* DeclarationContainer::conflictingDeclaration( Declaration const& _declaration, ASTString const* _name ) const { if (!_name) _name = &_declaration.name(); solAssert(!_name->empty(), ""); vector declarations; if (m_declarations.count(*_name)) declarations += m_declarations.at(*_name); if (m_invisibleDeclarations.count(*_name)) declarations += m_invisibleDeclarations.at(*_name); if ( dynamic_cast(&_declaration) || dynamic_cast(&_declaration) || dynamic_cast(&_declaration) ) { // check that all other declarations with the same name are functions or a public state variable or events. // And then check that the signatures are different. for (Declaration const* declaration: declarations) { if (auto variableDeclaration = dynamic_cast(declaration)) { if (variableDeclaration->isStateVariable() && !variableDeclaration->isConstant() && variableDeclaration->isPublic()) continue; return declaration; } if ( dynamic_cast(&_declaration) && !dynamic_cast(declaration) ) return declaration; if ( dynamic_cast(&_declaration) && !dynamic_cast(declaration) ) return declaration; if ( dynamic_cast(&_declaration) && !dynamic_cast(declaration) ) return declaration; // Or, continue. } } else if (declarations.size() == 1 && declarations.front() == &_declaration) return nullptr; else if (!declarations.empty()) return declarations.front(); return nullptr; } void DeclarationContainer::activateVariable(ASTString const& _name) { solAssert( m_invisibleDeclarations.count(_name) && m_invisibleDeclarations.at(_name).size() == 1, "Tried to activate a non-inactive variable or multiple inactive variables with the same name." ); solAssert(m_declarations.count(_name) == 0 || m_declarations.at(_name).empty(), ""); m_declarations[_name].emplace_back(m_invisibleDeclarations.at(_name).front()); m_invisibleDeclarations.erase(_name); } bool DeclarationContainer::isInvisible(ASTString const& _name) const { return m_invisibleDeclarations.count(_name); } bool DeclarationContainer::registerDeclaration( Declaration const& _declaration, ASTString const* _name, bool _invisible, bool _update ) { if (!_name) _name = &_declaration.name(); if (_name->empty()) return true; if (_update) { solAssert(!dynamic_cast(&_declaration), "Attempt to update function definition."); m_declarations.erase(*_name); m_invisibleDeclarations.erase(*_name); } else if (conflictingDeclaration(_declaration, _name)) return false; vector& decls = _invisible ? m_invisibleDeclarations[*_name] : m_declarations[*_name]; if (!contains(decls, &_declaration)) decls.push_back(&_declaration); return true; } vector DeclarationContainer::resolveName(ASTString const& _name, bool _recursive, bool _alsoInvisible) const { solAssert(!_name.empty(), "Attempt to resolve empty name."); vector result; if (m_declarations.count(_name)) result = m_declarations.at(_name); if (_alsoInvisible && m_invisibleDeclarations.count(_name)) result += m_invisibleDeclarations.at(_name); if (result.empty() && _recursive && m_enclosingContainer) result = m_enclosingContainer->resolveName(_name, true, _alsoInvisible); return result; } vector DeclarationContainer::similarNames(ASTString const& _name) const { static size_t const MAXIMUM_EDIT_DISTANCE = 2; vector similar; for (auto const& declaration: m_declarations) { string const& declarationName = declaration.first; if (stringWithinDistance(_name, declarationName, MAXIMUM_EDIT_DISTANCE)) similar.push_back(declarationName); } for (auto const& declaration: m_invisibleDeclarations) { string const& declarationName = declaration.first; if (stringWithinDistance(_name, declarationName, MAXIMUM_EDIT_DISTANCE)) similar.push_back(declarationName); } if (m_enclosingContainer) similar += m_enclosingContainer->similarNames(_name); return similar; }