diff options
| author | Nicolás Venturo <nicolas.venturo@gmail.com> | 2018-06-15 01:29:42 +0800 |
|---|---|---|
| committer | Nicolás Venturo <nicolas.venturo@gmail.com> | 2018-06-15 22:27:39 +0800 |
| commit | 172e208c6aa70956389ce7efb90b64ac32140588 (patch) | |
| tree | 515665335cd23ee51fb6c1c8e81e9bd2aaf4af85 /libevmasm | |
| parent | dc5cd3e1e7db933493fe1b0dc12e5ecdf2a50ed7 (diff) | |
| download | dexon-solidity-172e208c6aa70956389ce7efb90b64ac32140588.tar.gz dexon-solidity-172e208c6aa70956389ce7efb90b64ac32140588.tar.zst dexon-solidity-172e208c6aa70956389ce7efb90b64ac32140588.zip | |
Add TruthyAnd Peephole optimization
Diffstat (limited to 'libevmasm')
| -rw-r--r-- | libevmasm/PeepholeOptimiser.cpp | 19 |
1 files changed, 18 insertions, 1 deletions
diff --git a/libevmasm/PeepholeOptimiser.cpp b/libevmasm/PeepholeOptimiser.cpp index 8a39de24..6d8e1df6 100644 --- a/libevmasm/PeepholeOptimiser.cpp +++ b/libevmasm/PeepholeOptimiser.cpp @@ -249,6 +249,23 @@ struct TagConjunctions: SimplePeepholeOptimizerMethod<TagConjunctions, 3> } }; +struct TruthyAnd: SimplePeepholeOptimizerMethod<TruthyAnd, 3> +{ + static bool applySimple( + AssemblyItem const& _push, + AssemblyItem const& _not, + AssemblyItem const& _and, + std::back_insert_iterator<AssemblyItems> + ) + { + return ( + _push.type() == Push && _push.data() == 0 && + _not == Instruction::NOT && + _and == Instruction::AND + ); + } +}; + /// Removes everything after a JUMP (or similar) until the next JUMPDEST. struct UnreachableCode { @@ -305,7 +322,7 @@ bool PeepholeOptimiser::optimise() { OptimiserState state {m_items, 0, std::back_inserter(m_optimisedItems)}; while (state.i < m_items.size()) - applyMethods(state, PushPop(), OpPop(), DoublePush(), DoubleSwap(), CommutativeSwap(), SwapComparison(), JumpToNext(), UnreachableCode(), TagConjunctions(), Identity()); + applyMethods(state, PushPop(), OpPop(), DoublePush(), DoubleSwap(), CommutativeSwap(), SwapComparison(), JumpToNext(), UnreachableCode(), TagConjunctions(), TruthyAnd(), Identity()); if (m_optimisedItems.size() < m_items.size() || ( m_optimisedItems.size() == m_items.size() && ( eth::bytesRequired(m_optimisedItems, 3) < eth::bytesRequired(m_items, 3) || |