aboutsummaryrefslogtreecommitdiffstats
path: root/ASTUtils.cpp
diff options
context:
space:
mode:
authorchriseth <c@ethdev.com>2015-04-29 21:52:56 +0800
committerchriseth <c@ethdev.com>2015-04-29 22:24:26 +0800
commit8a1758e60501911b44a0287c4573d4316b684295 (patch)
tree224cdff6eb0732706e3076fc89babafcc9d68ebc /ASTUtils.cpp
parenta508d29489af7c75bedafe83df0c36c6b5e611b6 (diff)
downloaddexon-solidity-8a1758e60501911b44a0287c4573d4316b684295.tar
dexon-solidity-8a1758e60501911b44a0287c4573d4316b684295.tar.gz
dexon-solidity-8a1758e60501911b44a0287c4573d4316b684295.tar.bz2
dexon-solidity-8a1758e60501911b44a0287c4573d4316b684295.tar.lz
dexon-solidity-8a1758e60501911b44a0287c4573d4316b684295.tar.xz
dexon-solidity-8a1758e60501911b44a0287c4573d4316b684295.tar.zst
dexon-solidity-8a1758e60501911b44a0287c4573d4316b684295.zip
Utility class to find a suitable AST node for a given location.
Diffstat (limited to 'ASTUtils.cpp')
-rw-r--r--ASTUtils.cpp48
1 files changed, 48 insertions, 0 deletions
diff --git a/ASTUtils.cpp b/ASTUtils.cpp
new file mode 100644
index 00000000..081d6b31
--- /dev/null
+++ b/ASTUtils.cpp
@@ -0,0 +1,48 @@
+/*
+ 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 2015
+ * Utilities to work with the AST.
+ */
+
+#include <libsolidity/ASTUtils.h>
+
+using namespace std;
+using namespace dev;
+using namespace dev::solidity;
+
+
+
+ASTNode const* LocationFinder::leastUpperBound()
+{
+ m_bestMatch = nullptr;
+ for (ASTNode const* rootNode: m_rootNodes)
+ rootNode->accept(*this);
+
+ return m_bestMatch;
+}
+
+bool LocationFinder::visitNode(const ASTNode& _node)
+{
+ if (_node.getLocation().contains(m_location))
+ {
+ m_bestMatch = &_node;
+ return true;
+ }
+ return false;
+}