2015-04-24 15:35:16 +00:00
|
|
|
/*
|
2019-02-13 15:56:46 +00:00
|
|
|
This file is part of solidity.
|
2015-04-24 15:35:16 +00:00
|
|
|
|
2019-02-13 15:56:46 +00:00
|
|
|
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.
|
2015-04-24 15:35:16 +00:00
|
|
|
|
2019-02-13 15:56:46 +00:00
|
|
|
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.
|
2015-04-24 15:35:16 +00:00
|
|
|
|
2019-02-13 15:56:46 +00:00
|
|
|
You should have received a copy of the GNU General Public License
|
|
|
|
along with solidity. If not, see <http://www.gnu.org/licenses/>.
|
2015-04-24 15:35:16 +00:00
|
|
|
*/
|
2020-07-17 14:54:12 +00:00
|
|
|
// SPDX-License-Identifier: GPL-3.0
|
2015-04-24 15:35:16 +00:00
|
|
|
/**
|
|
|
|
* @author Lefteris Karapetsas <lefteris@ethdev.com>
|
|
|
|
* @date 2015
|
|
|
|
* Represents a location in a source file
|
|
|
|
*/
|
|
|
|
|
|
|
|
#pragma once
|
|
|
|
|
2021-08-03 12:50:01 +00:00
|
|
|
#include <iosfwd>
|
2015-04-24 15:35:16 +00:00
|
|
|
#include <memory>
|
|
|
|
#include <string>
|
2021-08-03 12:50:01 +00:00
|
|
|
#include <tuple>
|
|
|
|
#include <vector>
|
2015-04-24 15:35:16 +00:00
|
|
|
|
2019-12-11 16:31:36 +00:00
|
|
|
namespace solidity::langutil
|
2015-04-24 15:35:16 +00:00
|
|
|
{
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Representation of an interval of source positions.
|
|
|
|
* The interval includes start and excludes end.
|
|
|
|
*/
|
|
|
|
struct SourceLocation
|
|
|
|
{
|
2016-11-07 13:12:30 +00:00
|
|
|
bool operator==(SourceLocation const& _other) const
|
|
|
|
{
|
2021-06-29 12:38:59 +00:00
|
|
|
return start == _other.start && end == _other.end && equalSources(_other);
|
2016-11-07 13:12:30 +00:00
|
|
|
}
|
2015-04-24 15:35:16 +00:00
|
|
|
bool operator!=(SourceLocation const& _other) const { return !operator==(_other); }
|
2019-09-11 19:16:35 +00:00
|
|
|
|
2021-06-29 12:38:59 +00:00
|
|
|
bool operator<(SourceLocation const& _other) const
|
2019-09-11 19:16:35 +00:00
|
|
|
{
|
2021-06-29 12:38:59 +00:00
|
|
|
if (!sourceName || !_other.sourceName)
|
|
|
|
return std::make_tuple(int(!!sourceName), start, end) < std::make_tuple(int(!!_other.sourceName), _other.start, _other.end);
|
2019-09-11 19:16:35 +00:00
|
|
|
else
|
2021-06-29 12:38:59 +00:00
|
|
|
return std::make_tuple(*sourceName, start, end) < std::make_tuple(*_other.sourceName, _other.start, _other.end);
|
2019-09-11 19:16:35 +00:00
|
|
|
}
|
|
|
|
|
2021-06-29 12:38:59 +00:00
|
|
|
bool contains(SourceLocation const& _other) const
|
2019-09-11 19:16:35 +00:00
|
|
|
{
|
2021-06-29 12:38:59 +00:00
|
|
|
if (!hasText() || !_other.hasText() || !equalSources(_other))
|
2019-09-11 19:16:35 +00:00
|
|
|
return false;
|
|
|
|
return start <= _other.start && _other.end <= end;
|
|
|
|
}
|
|
|
|
|
2021-03-24 11:48:56 +00:00
|
|
|
bool containsOffset(int _pos) const
|
|
|
|
{
|
|
|
|
if (!hasText() || _pos < 0)
|
|
|
|
return false;
|
|
|
|
return start <= _pos && _pos < end;
|
|
|
|
}
|
|
|
|
|
2021-06-29 12:38:59 +00:00
|
|
|
bool intersects(SourceLocation const& _other) const
|
2019-09-11 19:16:35 +00:00
|
|
|
{
|
2021-06-29 12:38:59 +00:00
|
|
|
if (!hasText() || !_other.hasText() || !equalSources(_other))
|
2019-09-11 19:16:35 +00:00
|
|
|
return false;
|
|
|
|
return _other.start < end && start < _other.end;
|
|
|
|
}
|
2015-04-24 15:35:16 +00:00
|
|
|
|
2021-06-29 12:38:59 +00:00
|
|
|
bool equalSources(SourceLocation const& _other) const
|
2020-02-03 07:04:21 +00:00
|
|
|
{
|
2021-06-29 12:38:59 +00:00
|
|
|
if (!!sourceName != !!_other.sourceName)
|
|
|
|
return false;
|
|
|
|
if (sourceName && *sourceName != *_other.sourceName)
|
|
|
|
return false;
|
|
|
|
return true;
|
2020-02-03 07:04:21 +00:00
|
|
|
}
|
2015-04-24 15:35:16 +00:00
|
|
|
|
2021-06-29 12:38:59 +00:00
|
|
|
bool isValid() const { return sourceName || start != -1 || end != -1; }
|
|
|
|
|
|
|
|
bool hasText() const { return sourceName && 0 <= start && start <= end; }
|
2019-08-06 14:02:11 +00:00
|
|
|
|
2019-01-08 18:33:46 +00:00
|
|
|
/// @returns the smallest SourceLocation that contains both @param _a and @param _b.
|
|
|
|
/// Assumes that @param _a and @param _b refer to the same source (exception: if the source of either one
|
|
|
|
/// is unset, the source of the other will be used for the result, even if that is unset as well).
|
|
|
|
/// Invalid start and end positions (with value of -1) are ignored (if start or end are -1 for both @param _a and
|
|
|
|
/// @param _b, then start resp. end of the result will be -1 as well).
|
|
|
|
static SourceLocation smallestCovering(SourceLocation _a, SourceLocation const& _b)
|
|
|
|
{
|
2021-06-29 12:38:59 +00:00
|
|
|
if (!_a.sourceName)
|
|
|
|
_a.sourceName = _b.sourceName;
|
2019-01-08 18:33:46 +00:00
|
|
|
|
|
|
|
if (_a.start < 0)
|
|
|
|
_a.start = _b.start;
|
|
|
|
else if (_b.start >= 0 && _b.start < _a.start)
|
|
|
|
_a.start = _b.start;
|
|
|
|
if (_b.end > _a.end)
|
|
|
|
_a.end = _b.end;
|
|
|
|
|
|
|
|
return _a;
|
|
|
|
}
|
|
|
|
|
2018-12-12 13:43:34 +00:00
|
|
|
int start = -1;
|
|
|
|
int end = -1;
|
2021-06-29 12:38:59 +00:00
|
|
|
std::shared_ptr<std::string const> sourceName;
|
2015-04-24 15:35:16 +00:00
|
|
|
};
|
|
|
|
|
2021-07-01 14:58:01 +00:00
|
|
|
SourceLocation parseSourceLocation(
|
2020-06-02 13:45:03 +00:00
|
|
|
std::string const& _input,
|
2021-07-01 14:58:01 +00:00
|
|
|
std::vector<std::shared_ptr<std::string const>> const& _sourceNames
|
2020-06-02 13:45:03 +00:00
|
|
|
);
|
2019-09-11 19:16:35 +00:00
|
|
|
|
2015-04-24 15:35:16 +00:00
|
|
|
/// Stream output for Location (used e.g. in boost exceptions).
|
2021-08-03 12:50:01 +00:00
|
|
|
std::ostream& operator<<(std::ostream& _out, SourceLocation const& _location);
|
2015-04-24 15:35:16 +00:00
|
|
|
|
2021-11-29 20:19:41 +00:00
|
|
|
|
|
|
|
/**
|
|
|
|
* Alternative, line-column-based representation for source locations.
|
|
|
|
* Both line and column are zero-based.
|
|
|
|
* If used as a range, the second location is considered exclusive.
|
|
|
|
* Negative values are invalid.
|
|
|
|
*/
|
|
|
|
struct LineColumn
|
|
|
|
{
|
|
|
|
/// Line value, can be between zero and number of `\n` characters in the source file.
|
|
|
|
int line = -1;
|
|
|
|
/// Column value, can be between zero and number of characters in the line (inclusive).
|
|
|
|
int column = -1;
|
|
|
|
|
|
|
|
LineColumn() = default;
|
|
|
|
explicit LineColumn(int _line, int _column): line(_line), column(_column) {}
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2015-04-24 15:35:16 +00:00
|
|
|
}
|