aboutsummaryrefslogtreecommitdiffstats
path: root/libsolidity/DeclarationContainer.cpp
blob: 3e23d93b86ee45f353f691a871f14b91815995b8 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
/*
    This file is part of cpp-ethereum.

    cpp-ethereum 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.

    cpp-ethereum 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 cpp-ethereum.  If not, see <http://www.gnu.org/licenses/>.
*/
/**
 * @author Christian <c@ethdev.com>
 * @date 2014
 * Scope - object that holds declaration of names.
 */

#include <libsolidity/DeclarationContainer.h>
#include <libsolidity/AST.h>
#include <libsolidity/Types.h>

using namespace std;
using namespace dev;
using namespace dev::solidity;

Declaration const* DeclarationContainer::conflictingDeclaration(Declaration const& _declaration) const
{
    ASTString const& name(_declaration.getName());
    solAssert(!name.empty(), "");
    vector<Declaration const*> declarations;
    if (m_declarations.count(name))
        declarations += m_declarations.at(name);
    if (m_invisibleDeclarations.count(name))
        declarations += m_invisibleDeclarations.at(name);

    if (dynamic_cast<FunctionDefinition const*>(&_declaration))
    {
        // check that all other declarations with the same name are functions
        for (Declaration const* declaration: declarations)
            if (!dynamic_cast<FunctionDefinition const*>(declaration))
                return declaration;
    }
    else if (!declarations.empty())
        return declarations.front();

    return nullptr;
}

bool DeclarationContainer::registerDeclaration(Declaration const& _declaration, bool _invisible, bool _update)
{
    ASTString const& name(_declaration.getName());
    if (name.empty())
        return true;

    if (_update)
    {
        solAssert(!dynamic_cast<FunctionDefinition const*>(&_declaration), "Attempt to update function definition.");
        m_declarations.erase(name);
        m_invisibleDeclarations.erase(name);
    }
    else if (conflictingDeclaration(_declaration))
        return false;

    if (_invisible)
        m_invisibleDeclarations[name].push_back(&_declaration);
    else
        m_declarations[name].push_back(&_declaration);
    return true;
}

std::vector<Declaration const*> DeclarationContainer::resolveName(ASTString const& _name, bool _recursive) const
{
    solAssert(!_name.empty(), "Attempt to resolve empty name.");
    auto result = m_declarations.find(_name);
    if (result != m_declarations.end())
        return result->second;
    if (_recursive && m_enclosingContainer)
        return m_enclosingContainer->resolveName(_name, true);
    return vector<Declaration const*>({});
}