/*
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 .
*/
// SPDX-License-Identifier: GPL-3.0
/**
* Module for applying replacement rules against Expressions.
*/
#pragma once
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
namespace solidity::yul
{
struct Dialect;
struct AssignedValue;
class Pattern;
/**
* Container for all simplification rules.
*/
class SimplificationRules
{
public:
/// Noncopiable.
SimplificationRules(SimplificationRules const&) = delete;
SimplificationRules& operator=(SimplificationRules const&) = delete;
using Rule = evmasm::SimplificationRule;
explicit SimplificationRules(std::optional _evmVersion = std::nullopt);
/// @returns a pointer to the first matching pattern and sets the match
/// groups accordingly.
/// @param _ssaValues values of variables that are assigned exactly once.
static Rule const* findFirstMatch(
Expression const& _expr,
Dialect const& _dialect,
std::map const& _ssaValues
);
/// Checks whether the rulelist is non-empty. This is usually enforced
/// by the constructor, but we had some issues with static initialization.
bool isInitialized() const;
static std::optional const*>>
instructionAndArguments(Dialect const& _dialect, Expression const& _expr);
private:
void addRules(std::vector const& _rules);
void addRule(Rule const& _rule);
void resetMatchGroups() { m_matchGroups.clear(); }
std::map m_matchGroups;
std::vector> m_rules[256];
};
enum class PatternKind
{
Operation,
Constant,
Any
};
/**
* Pattern to match against an expression.
* Also stores matched expressions to retrieve them later, for constructing new expressions using
* ExpressionTemplate.
*/
class Pattern
{
public:
using Builtins = evmasm::EVMBuiltins;
static constexpr size_t WordSize = 256;
using Word = u256;
/// Matches any expression.
Pattern(PatternKind _kind = PatternKind::Any): m_kind(_kind) {}
// Matches a specific constant value.
Pattern(unsigned _value): Pattern(u256(_value)) {}
Pattern(int _value): Pattern(u256(_value)) {}
Pattern(long unsigned _value): Pattern(u256(_value)) {}
// Matches a specific constant value.
Pattern(u256 const& _value): m_kind(PatternKind::Constant), m_data(std::make_shared(_value)) {}
// Matches a given instruction with given arguments
Pattern(evmasm::Instruction _instruction, std::initializer_list _arguments = {});
/// Sets this pattern to be part of the match group with the identifier @a _group.
/// Inside one rule, all patterns in the same match group have to match expressions from the
/// same expression equivalence class.
void setMatchGroup(unsigned _group, std::map& _matchGroups);
unsigned matchGroup() const { return m_matchGroup; }
bool matches(
Expression const& _expr,
Dialect const& _dialect,
std::map const& _ssaValues
) const;
std::vector arguments() const { return m_arguments; }
/// @returns the data of the matched expression if this pattern is part of a match group.
u256 d() const;
evmasm::Instruction instruction() const;
/// Turns this pattern into an actual expression. Should only be called
/// for patterns resulting from an action, i.e. with match groups assigned.
Expression toExpression(std::shared_ptr const& _debugData) const;
private:
Expression const& matchGroupValue() const;
PatternKind m_kind = PatternKind::Any;
evmasm::Instruction m_instruction; ///< Only valid if m_kind is Operation
std::shared_ptr m_data; ///< Only valid if m_kind is Constant
std::vector m_arguments;
unsigned m_matchGroup = 0;
std::map* m_matchGroups = nullptr;
};
}