solidity/libsolidity/interface/CompilerStack.cpp

701 lines
21 KiB
C++
Raw Normal View History

/*
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>
2015-01-09 06:39:30 +00:00
* @author Gav Wood <g@ethdev.com>
* @date 2014
* Full-stack compiler that converts a source code string to bytecode.
*/
#include <libsolidity/interface/CompilerStack.h>
#include <libsolidity/interface/Version.h>
#include <libsolidity/analysis/SemVerHandler.h>
2015-10-20 22:21:52 +00:00
#include <libsolidity/ast/AST.h>
#include <libsolidity/parsing/Scanner.h>
#include <libsolidity/parsing/Parser.h>
#include <libsolidity/analysis/GlobalContext.h>
#include <libsolidity/analysis/NameAndTypeResolver.h>
#include <libsolidity/analysis/TypeChecker.h>
2015-10-26 14:13:36 +00:00
#include <libsolidity/analysis/DocStringAnalyser.h>
#include <libsolidity/analysis/SyntaxChecker.h>
2015-10-20 22:21:52 +00:00
#include <libsolidity/codegen/Compiler.h>
#include <libsolidity/interface/InterfaceHandler.h>
2015-10-21 14:43:31 +00:00
#include <libsolidity/formal/Why3Translator.h>
#include <libdevcore/SHA3.h>
#include <boost/algorithm/string.hpp>
#include <boost/filesystem.hpp>
using namespace std;
2016-01-12 00:04:39 +00:00
using namespace dev;
using namespace dev::solidity;
2016-08-15 14:58:01 +00:00
CompilerStack::CompilerStack(ReadFileCallback const& _readFile):
m_readFile(_readFile), m_parseSuccessful(false) {}
void CompilerStack::setRemappings(vector<string> const& _remappings)
{
vector<Remapping> remappings;
for (auto const& remapping: _remappings)
{
auto eq = find(remapping.begin(), remapping.end(), '=');
if (eq == remapping.end())
continue; // ignore
auto colon = find(remapping.begin(), eq, ':');
Remapping r;
r.context = colon == eq ? string() : string(remapping.begin(), colon);
r.prefix = colon == eq ? string(remapping.begin(), eq) : string(colon + 1, eq);
r.target = string(eq + 1, remapping.end());
remappings.push_back(r);
}
swap(m_remappings, remappings);
}
2016-08-15 14:58:01 +00:00
void CompilerStack::reset(bool _keepSources)
{
m_parseSuccessful = false;
if (_keepSources)
for (auto sourcePair: m_sources)
sourcePair.second.reset();
else
{
m_sources.clear();
}
m_globalContext.reset();
m_sourceOrder.clear();
m_contracts.clear();
2015-09-21 17:43:56 +00:00
m_errors.clear();
}
2015-02-20 17:15:34 +00:00
bool CompilerStack::addSource(string const& _name, string const& _content, bool _isLibrary)
{
2015-01-13 10:18:08 +00:00
bool existed = m_sources.count(_name) != 0;
reset(true);
m_sources[_name].scanner = make_shared<Scanner>(CharStream(_content), _name);
2015-02-20 17:15:34 +00:00
m_sources[_name].isLibrary = _isLibrary;
return existed;
}
void CompilerStack::setSource(string const& _sourceCode)
{
reset();
addSource("", _sourceCode);
}
2015-09-21 17:43:56 +00:00
bool CompilerStack::parse()
{
2015-10-15 14:08:02 +00:00
//reset
2015-09-21 17:43:56 +00:00
m_errors.clear();
2015-10-15 14:08:02 +00:00
m_parseSuccessful = false;
2015-09-21 17:43:56 +00:00
if (SemVerVersion{string(VersionString)}.isPrerelease())
{
auto err = make_shared<Error>(Error::Type::Warning);
*err << errinfo_comment("This is a pre-release compiler version, please do not use it in production.");
m_errors.push_back(err);
}
2016-01-12 00:04:39 +00:00
vector<string> sourcesToParse;
for (auto const& s: m_sources)
sourcesToParse.push_back(s.first);
2015-12-05 02:09:47 +00:00
map<string, SourceUnit const*> sourceUnitsByName;
2016-01-12 00:04:39 +00:00
for (size_t i = 0; i < sourcesToParse.size(); ++i)
{
2016-01-12 00:04:39 +00:00
string const& path = sourcesToParse[i];
Source& source = m_sources[path];
source.scanner->reset();
source.ast = Parser(m_errors).parse(source.scanner);
sourceUnitsByName[path] = source.ast.get();
if (!source.ast)
solAssert(!Error::containsOnlyWarnings(m_errors), "Parser returned null but did not report error.");
2015-12-15 14:46:03 +00:00
else
2016-01-12 00:04:39 +00:00
{
source.ast->annotation().path = path;
for (auto const& newSource: loadMissingSources(*source.ast, path))
{
string const& newPath = newSource.first;
string const& newContents = newSource.second;
m_sources[newPath].scanner = make_shared<Scanner>(CharStream(newContents), newPath);
sourcesToParse.push_back(newPath);
}
}
}
if (!Error::containsOnlyWarnings(m_errors))
// errors while parsing. sould stop before type checking
return false;
resolveImports();
2015-10-26 14:13:36 +00:00
bool noErrors = true;
SyntaxChecker syntaxChecker(m_errors);
for (Source const* source: m_sourceOrder)
if (!syntaxChecker.checkSyntax(*source->ast))
noErrors = false;
2015-10-26 14:13:36 +00:00
DocStringAnalyser docStringAnalyser(m_errors);
for (Source const* source: m_sourceOrder)
if (!docStringAnalyser.analyseDocStrings(*source->ast))
noErrors = false;
m_globalContext = make_shared<GlobalContext>();
NameAndTypeResolver resolver(m_globalContext->declarations(), m_errors);
for (Source const* source: m_sourceOrder)
2015-10-15 14:08:02 +00:00
if (!resolver.registerDeclarations(*source->ast))
return false;
for (Source const* source: m_sourceOrder)
2015-12-05 02:09:47 +00:00
if (!resolver.performImports(*source->ast, sourceUnitsByName))
return false;
for (Source const* source: m_sourceOrder)
2015-08-31 16:44:29 +00:00
for (ASTPointer<ASTNode> const& node: source->ast->nodes())
if (ContractDefinition* contract = dynamic_cast<ContractDefinition*>(node.get()))
{
m_globalContext->setCurrentContract(*contract);
if (!resolver.updateDeclaration(*m_globalContext->currentThis())) return false;
if (!resolver.updateDeclaration(*m_globalContext->currentSuper())) return false;
if (!resolver.resolveNamesAndTypes(*contract)) return false;
2015-08-31 16:44:29 +00:00
m_contracts[contract->name()].contract = contract;
}
2015-09-21 17:43:56 +00:00
2016-01-11 18:40:15 +00:00
if (!checkLibraryNameClashes())
noErrors = false;
for (Source const* source: m_sourceOrder)
2015-08-31 16:44:29 +00:00
for (ASTPointer<ASTNode> const& node: source->ast->nodes())
if (ContractDefinition* contract = dynamic_cast<ContractDefinition*>(node.get()))
{
m_globalContext->setCurrentContract(*contract);
2015-08-31 16:44:29 +00:00
resolver.updateDeclaration(*m_globalContext->currentThis());
2015-10-15 09:10:55 +00:00
TypeChecker typeChecker(m_errors);
if (typeChecker.checkTypeRequirements(*contract))
{
2015-10-26 14:13:36 +00:00
contract->setDevDocumentation(InterfaceHandler::devDocumentation(*contract));
contract->setUserDocumentation(InterfaceHandler::userDocumentation(*contract));
}
else
2015-10-26 14:13:36 +00:00
noErrors = false;
2015-08-31 16:44:29 +00:00
m_contracts[contract->name()].contract = contract;
}
2015-10-26 14:13:36 +00:00
m_parseSuccessful = noErrors;
2015-09-21 17:43:56 +00:00
return m_parseSuccessful;
}
2015-09-21 17:43:56 +00:00
bool CompilerStack::parse(string const& _sourceCode)
{
setSource(_sourceCode);
2015-09-21 17:43:56 +00:00
return parse();
}
2015-08-31 16:44:29 +00:00
vector<string> CompilerStack::contractNames() const
{
if (!m_parseSuccessful)
BOOST_THROW_EXCEPTION(CompilerError() << errinfo_comment("Parsing was not successful."));
vector<string> contractNames;
for (auto const& contract: m_contracts)
contractNames.push_back(contract.first);
return contractNames;
}
2015-09-21 17:43:56 +00:00
bool CompilerStack::compile(bool _optimize, unsigned _runs)
{
if (!m_parseSuccessful)
2015-09-21 17:43:56 +00:00
if (!parse())
return false;
map<ContractDefinition const*, eth::Assembly const*> compiledContracts;
for (Source const* source: m_sourceOrder)
2015-08-31 16:44:29 +00:00
for (ASTPointer<ASTNode> const& node: source->ast->nodes())
2015-10-07 13:57:17 +00:00
if (auto contract = dynamic_cast<ContractDefinition const*>(node.get()))
compileContract(_optimize, _runs, *contract, compiledContracts);
2015-09-21 17:43:56 +00:00
return true;
}
2015-09-21 17:43:56 +00:00
bool CompilerStack::compile(string const& _sourceCode, bool _optimize)
{
2015-09-21 17:43:56 +00:00
return parse(_sourceCode) && compile(_optimize);
}
2015-09-11 17:35:01 +00:00
void CompilerStack::link(const std::map<string, h160>& _libraries)
{
for (auto& contract: m_contracts)
{
contract.second.object.link(_libraries);
contract.second.runtimeObject.link(_libraries);
contract.second.cloneObject.link(_libraries);
}
}
2016-07-18 16:16:22 +00:00
bool CompilerStack::prepareFormalAnalysis(ErrorList* _errors)
2015-10-21 14:43:31 +00:00
{
2016-07-18 16:16:22 +00:00
if (!_errors)
_errors = &m_errors;
Why3Translator translator(*_errors);
2015-10-21 14:43:31 +00:00
for (Source const* source: m_sourceOrder)
if (!translator.process(*source->ast))
return false;
m_formalTranslation = translator.translation();
return true;
}
2015-08-31 16:44:29 +00:00
eth::AssemblyItems const* CompilerStack::assemblyItems(string const& _contractName) const
2015-03-02 00:13:10 +00:00
{
2015-08-31 16:44:29 +00:00
Contract const& currentContract = contract(_contractName);
return currentContract.compiler ? &contract(_contractName).compiler->assemblyItems() : nullptr;
2015-03-02 00:13:10 +00:00
}
2015-08-31 16:44:29 +00:00
eth::AssemblyItems const* CompilerStack::runtimeAssemblyItems(string const& _contractName) const
2015-03-02 00:13:10 +00:00
{
2015-08-31 16:44:29 +00:00
Contract const& currentContract = contract(_contractName);
return currentContract.compiler ? &contract(_contractName).compiler->runtimeAssemblyItems() : nullptr;
2015-03-02 00:13:10 +00:00
}
2016-07-01 08:14:50 +00:00
string const* CompilerStack::sourceMapping(string const& _contractName) const
{
Contract const& c = contract(_contractName);
if (!c.sourceMapping)
{
if (auto items = assemblyItems(_contractName))
c.sourceMapping.reset(new string(computeSourceMapping(*items)));
}
return c.sourceMapping.get();
}
string const* CompilerStack::runtimeSourceMapping(string const& _contractName) const
{
Contract const& c = contract(_contractName);
if (!c.runtimeSourceMapping)
{
if (auto items = runtimeAssemblyItems(_contractName))
c.runtimeSourceMapping.reset(new string(computeSourceMapping(*items)));
}
return c.runtimeSourceMapping.get();
}
eth::LinkerObject const& CompilerStack::object(string const& _contractName) const
{
return contract(_contractName).object;
}
eth::LinkerObject const& CompilerStack::runtimeObject(string const& _contractName) const
{
return contract(_contractName).runtimeObject;
}
eth::LinkerObject const& CompilerStack::cloneObject(string const& _contractName) const
2015-07-31 17:23:31 +00:00
{
return contract(_contractName).cloneObject;
2015-07-31 17:23:31 +00:00
}
2015-08-31 16:44:29 +00:00
dev::h256 CompilerStack::contractCodeHash(string const& _contractName) const
{
auto const& obj = runtimeObject(_contractName);
if (obj.bytecode.empty() || !obj.linkReferences.empty())
return dev::h256();
else
2016-10-05 10:30:28 +00:00
return dev::keccak256(obj.bytecode);
}
2015-01-28 07:50:53 +00:00
Json::Value CompilerStack::streamAssembly(ostream& _outStream, string const& _contractName, StringMap _sourceCodes, bool _inJsonFormat) const
{
2015-08-31 16:44:29 +00:00
Contract const& currentContract = contract(_contractName);
if (currentContract.compiler)
return currentContract.compiler->streamAssembly(_outStream, _sourceCodes, _inJsonFormat);
else
2015-01-28 07:50:53 +00:00
{
_outStream << "Contract not fully implemented" << endl;
2015-01-28 07:50:53 +00:00
return Json::Value();
}
}
2016-07-01 08:14:50 +00:00
vector<string> CompilerStack::sourceNames() const
{
vector<string> names;
for (auto const& s: m_sources)
names.push_back(s.first);
return names;
}
map<string, unsigned> CompilerStack::sourceIndices() const
{
map<string, unsigned> indices;
for (auto const& s: m_sources)
indices[s.first] = indices.size();
return indices;
}
2015-08-31 16:44:29 +00:00
string const& CompilerStack::interface(string const& _contractName) const
{
2015-08-31 16:44:29 +00:00
return metadata(_contractName, DocumentationType::ABIInterface);
}
2015-08-31 16:44:29 +00:00
string const& CompilerStack::metadata(string const& _contractName, DocumentationType _type) const
{
if (!m_parseSuccessful)
BOOST_THROW_EXCEPTION(CompilerError() << errinfo_comment("Parsing was not successful."));
2014-12-06 01:39:58 +00:00
std::unique_ptr<string const>* doc;
Contract const& currentContract = contract(_contractName);
2015-07-15 14:23:10 +00:00
// checks wheather we already have the documentation
switch (_type)
{
2015-02-09 13:12:36 +00:00
case DocumentationType::NatspecUser:
2015-08-31 16:44:29 +00:00
doc = &currentContract.userDocumentation;
break;
2015-02-09 13:12:36 +00:00
case DocumentationType::NatspecDev:
2015-08-31 16:44:29 +00:00
doc = &currentContract.devDocumentation;
break;
2015-02-09 13:12:36 +00:00
case DocumentationType::ABIInterface:
2015-08-31 16:44:29 +00:00
doc = &currentContract.interface;
break;
default:
BOOST_THROW_EXCEPTION(InternalCompilerError() << errinfo_comment("Illegal documentation type."));
}
2015-07-15 14:23:10 +00:00
// caches the result
if (!*doc)
2015-10-26 14:13:36 +00:00
doc->reset(new string(InterfaceHandler::documentation(*currentContract.contract, _type)));
return *(*doc);
}
2015-08-31 16:44:29 +00:00
Scanner const& CompilerStack::scanner(string const& _sourceName) const
{
2015-08-31 16:44:29 +00:00
return *source(_sourceName).scanner;
}
SourceUnit const& CompilerStack::ast(string const& _sourceName) const
{
2015-08-31 16:44:29 +00:00
return *source(_sourceName).ast;
}
2015-08-31 16:44:29 +00:00
ContractDefinition const& CompilerStack::contractDefinition(string const& _contractName) const
{
2015-08-31 16:44:29 +00:00
return *contract(_contractName).contract;
}
2015-08-31 16:44:29 +00:00
size_t CompilerStack::functionEntryPoint(
2015-05-26 09:27:59 +00:00
std::string const& _contractName,
FunctionDefinition const& _function
) const
{
2015-08-31 16:44:29 +00:00
shared_ptr<Compiler> const& compiler = contract(_contractName).compiler;
2015-05-26 09:27:59 +00:00
if (!compiler)
return 0;
2015-08-31 16:44:29 +00:00
eth::AssemblyItem tag = compiler->functionEntryLabel(_function);
2015-05-26 09:27:59 +00:00
if (tag.type() == eth::UndefinedItem)
return 0;
2015-08-31 16:44:29 +00:00
eth::AssemblyItems const& items = compiler->runtimeAssemblyItems();
2015-05-26 09:27:59 +00:00
for (size_t i = 0; i < items.size(); ++i)
if (items.at(i).type() == eth::Tag && items.at(i).data() == tag.data())
return i;
return 0;
}
tuple<int, int, int, int> CompilerStack::positionFromSourceLocation(SourceLocation const& _sourceLocation) const
{
int startLine;
int startColumn;
int endLine;
int endColumn;
2015-08-31 16:44:29 +00:00
tie(startLine, startColumn) = scanner(*_sourceLocation.sourceName).translatePositionToLineColumn(_sourceLocation.start);
tie(endLine, endColumn) = scanner(*_sourceLocation.sourceName).translatePositionToLineColumn(_sourceLocation.end);
return make_tuple(++startLine, ++startColumn, ++endLine, ++endColumn);
}
StringMap CompilerStack::loadMissingSources(SourceUnit const& _ast, std::string const& _sourcePath)
2016-01-12 00:04:39 +00:00
{
StringMap newSources;
for (auto const& node: _ast.nodes())
if (ImportDirective const* import = dynamic_cast<ImportDirective*>(node.get()))
{
string importPath = absolutePath(import->path(), _sourcePath);
// The current value of `path` is the absolute path as seen from this source file.
// We first have to apply remappings before we can store the actual absolute path
// as seen globally.
importPath = applyRemapping(importPath, _sourcePath);
import->annotation().absolutePath = importPath;
if (m_sources.count(importPath) || newSources.count(importPath))
2016-01-12 00:04:39 +00:00
continue;
ReadFileResult result{false, string("File not supplied initially.")};
if (m_readFile)
result = m_readFile(importPath);
if (result.success)
newSources[importPath] = result.contentsOrErrorMesage;
2016-01-12 00:04:39 +00:00
else
{
auto err = make_shared<Error>(Error::Type::ParserError);
*err <<
errinfo_sourceLocation(import->location()) <<
errinfo_comment("Source \"" + importPath + "\" not found: " + result.contentsOrErrorMesage);
2016-01-14 13:47:32 +00:00
m_errors.push_back(std::move(err));
2016-01-12 00:04:39 +00:00
continue;
}
}
return newSources;
}
string CompilerStack::applyRemapping(string const& _path, string const& _context)
{
// Try to find the longest prefix match in all remappings that are active in the current context.
auto isPrefixOf = [](string const& _a, string const& _b)
{
if (_a.length() > _b.length())
return false;
return std::equal(_a.begin(), _a.end(), _b.begin());
};
size_t longestPrefix = 0;
string longestPrefixTarget;
for (auto const& redir: m_remappings)
{
// Skip if we already have a closer match.
if (longestPrefix > 0 && redir.prefix.length() <= longestPrefix)
continue;
// Skip if redir.context is not a prefix of _context
if (!isPrefixOf(redir.context, _context))
continue;
// Skip if the prefix does not match.
if (!isPrefixOf(redir.prefix, _path))
continue;
longestPrefix = redir.prefix.length();
longestPrefixTarget = redir.target;
}
string path = longestPrefixTarget;
path.append(_path.begin() + longestPrefix, _path.end());
return path;
}
void CompilerStack::resolveImports()
{
// topological sorting (depth first search) of the import graph, cutting potential cycles
vector<Source const*> sourceOrder;
set<Source const*> sourcesSeen;
2016-01-12 00:04:39 +00:00
function<void(Source const*)> toposort = [&](Source const* _source)
{
if (sourcesSeen.count(_source))
return;
sourcesSeen.insert(_source);
2015-08-31 16:44:29 +00:00
for (ASTPointer<ASTNode> const& node: _source->ast->nodes())
if (ImportDirective const* import = dynamic_cast<ImportDirective*>(node.get()))
{
2016-01-12 00:04:39 +00:00
string const& path = import->annotation().absolutePath;
solAssert(!path.empty(), "");
solAssert(m_sources.count(path), "");
import->annotation().sourceUnit = m_sources[path].ast.get();
toposort(&m_sources[path]);
}
sourceOrder.push_back(_source);
};
for (auto const& sourcePair: m_sources)
2015-02-20 17:15:34 +00:00
if (!sourcePair.second.isLibrary)
2016-01-12 00:04:39 +00:00
toposort(&sourcePair.second);
swap(m_sourceOrder, sourceOrder);
}
2016-01-11 18:40:15 +00:00
bool CompilerStack::checkLibraryNameClashes()
{
bool clashFound = false;
map<string, SourceLocation> libraries;
for (Source const* source: m_sourceOrder)
for (ASTPointer<ASTNode> const& node: source->ast->nodes())
if (ContractDefinition* contract = dynamic_cast<ContractDefinition*>(node.get()))
if (contract->isLibrary())
{
if (libraries.count(contract->name()))
{
auto err = make_shared<Error>(Error::Type::DeclarationError);
*err <<
errinfo_sourceLocation(contract->location()) <<
errinfo_comment(
"Library \"" + contract->name() + "\" declared twice "
"(will create ambiguities during linking)."
) <<
errinfo_secondarySourceLocation(SecondarySourceLocation().append(
"The other declaration is here:", libraries[contract->name()]
));
m_errors.push_back(err);
2016-01-13 16:28:27 +00:00
clashFound = true;
2016-01-11 18:40:15 +00:00
}
else
libraries[contract->name()] = contract->location();
}
return !clashFound;
}
2015-12-09 16:35:20 +00:00
string CompilerStack::absolutePath(string const& _path, string const& _reference) const
{
// Anything that does not start with `.` is an absolute path.
if (_path.empty() || _path.front() != '.')
return _path;
using path = boost::filesystem::path;
path p(_path);
path result(_reference);
result.remove_filename();
for (path::iterator it = p.begin(); it != p.end(); ++it)
if (*it == "..")
result = result.parent_path();
else if (*it != ".")
result /= *it;
2016-08-31 18:53:44 +00:00
return result.generic_string();
2015-12-09 16:35:20 +00:00
}
2015-10-07 13:57:17 +00:00
void CompilerStack::compileContract(
bool _optimize,
unsigned _runs,
ContractDefinition const& _contract,
map<ContractDefinition const*, eth::Assembly const*>& _compiledContracts
)
{
if (_compiledContracts.count(&_contract) || !_contract.annotation().isFullyImplemented)
return;
for (auto const* dependency: _contract.annotation().contractDependencies)
compileContract(_optimize, _runs, *dependency, _compiledContracts);
shared_ptr<Compiler> compiler = make_shared<Compiler>(_optimize, _runs);
compiler->compileContract(_contract, _compiledContracts);
Contract& compiledContract = m_contracts.at(_contract.name());
compiledContract.compiler = compiler;
compiledContract.object = compiler->assembledObject();
compiledContract.runtimeObject = compiler->runtimeObject();
_compiledContracts[compiledContract.contract] = &compiler->assembly();
Compiler cloneCompiler(_optimize, _runs);
cloneCompiler.compileClone(_contract, _compiledContracts);
compiledContract.cloneObject = cloneCompiler.assembledObject();
}
std::string CompilerStack::defaultContractName() const
{
2015-08-31 16:44:29 +00:00
return contract("").contract->name();
}
2015-08-31 16:44:29 +00:00
CompilerStack::Contract const& CompilerStack::contract(string const& _contractName) const
{
if (m_contracts.empty())
BOOST_THROW_EXCEPTION(CompilerError() << errinfo_comment("No compiled contracts found."));
2014-12-17 17:33:55 +00:00
string contractName = _contractName;
if (_contractName.empty())
// try to find some user-supplied contract
for (auto const& it: m_sources)
2016-08-15 14:58:01 +00:00
for (ASTPointer<ASTNode> const& node: it.second.ast->nodes())
if (auto contract = dynamic_cast<ContractDefinition const*>(node.get()))
contractName = contract->name();
2014-12-17 17:33:55 +00:00
auto it = m_contracts.find(contractName);
if (it == m_contracts.end())
BOOST_THROW_EXCEPTION(CompilerError() << errinfo_comment("Contract " + _contractName + " not found."));
return it->second;
}
2015-08-31 16:44:29 +00:00
CompilerStack::Source const& CompilerStack::source(string const& _sourceName) const
{
auto it = m_sources.find(_sourceName);
if (it == m_sources.end())
BOOST_THROW_EXCEPTION(CompilerError() << errinfo_comment("Given source file not found."));
return it->second;
}
2016-07-01 08:14:50 +00:00
string CompilerStack::computeSourceMapping(eth::AssemblyItems const& _items) const
{
string ret;
map<string, unsigned> sourceIndicesMap = sourceIndices();
int prevStart = -1;
int prevLength = -1;
int prevSourceIndex = -1;
char prevJump = 0;
for (auto const& item: _items)
{
if (!ret.empty())
ret += ";";
SourceLocation const& location = item.location();
int length = location.start != -1 && location.end != -1 ? location.end - location.start : -1;
int sourceIndex =
location.sourceName && sourceIndicesMap.count(*location.sourceName) ?
sourceIndicesMap.at(*location.sourceName) :
-1;
char jump = '-';
if (item.getJumpType() == eth::AssemblyItem::JumpType::IntoFunction)
jump = 'i';
else if (item.getJumpType() == eth::AssemblyItem::JumpType::OutOfFunction)
jump = 'o';
unsigned components = 4;
if (jump == prevJump)
{
components--;
if (sourceIndex == prevSourceIndex)
{
components--;
if (length == prevLength)
{
components--;
if (location.start == prevStart)
components--;
}
}
}
if (components-- > 0)
{
if (location.start != prevStart)
ret += std::to_string(location.start);
if (components-- > 0)
{
ret += ':';
if (length != prevLength)
ret += std::to_string(length);
if (components-- > 0)
{
ret += ':';
if (sourceIndex != prevSourceIndex)
ret += std::to_string(sourceIndex);
if (components-- > 0)
{
ret += ':';
if (jump != prevJump)
ret += jump;
}
}
}
}
prevStart = location.start;
prevLength = length;
prevSourceIndex = sourceIndex;
prevJump = jump;
}
return ret;
}