cerc-io/solidity
15
0
Fork 0
mirror of https://github.com/ethereum/solidity synced 2023-10-03 13:03:40 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Update tests.

Browse Source
This commit is contained in:
chriseth 2019-05-13 18:52:08 +02:00
parent aa24e12054
commit 733677690e
8 changed files with 7 additions and 32 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
test/libyul/yulOptimizerTests/fullSimplify/identity_rules_simple.yul
View File

@ -5,8 +5,4 @@
// ==== // ====
// step: fullSimplify // step: fullSimplify
// ---- // ----
// { // { mstore(0, 0) }
// let _1 := 0
// pop(mload(_1))
// mstore(_1, 0)
// }

6
test/libyul/yulOptimizerTests/fullSimplify/not_applied_removes_non_constant_and_not_movable.yul
View File

@ -1,6 +1,6 @@
// div is eliminated, but keccak256 has side-effects. // div is eliminated, but create has side-effects.
{ {
let a := div(keccak256(0, 0), 0) let a := div(create(0, 0, 0), 0)
mstore(0, a) mstore(0, a)
} }
// ==== // ====
@ -8,6 +8,6 @@
// ---- // ----
// { // {
// let _1 := 0 // let _1 := 0
// pop(keccak256(_1, _1)) // pop(create(_1, _1, _1))
// mstore(_1, 0) // mstore(_1, 0)
// } // }

1
test/libyul/yulOptimizerTests/fullSimplify/operations.yul
View File

@ -23,7 +23,6 @@
// step: fullSimplify // step: fullSimplify
// ---- // ----
// { // {
// pop(mload(0))
// mstore(1, 0) // mstore(1, 0)
// mstore(2, 0) // mstore(2, 0)
// mstore(3, 0) // mstore(3, 0)

2
test/libyul/yulOptimizerTests/ssaAndBack/for_loop.yul
View File

@ -24,8 +24,6 @@
// for { } lt(mload(a), mload(b)) { a := mload(b) } // for { } lt(mload(a), mload(b)) { a := mload(b) }
// { // {
// let b_3 := mload(a) // let b_3 := mload(a)
// pop(mload(b_3))
// pop(mload(b_3))
// let a_6 := mload(b_3) // let a_6 := mload(b_3)
// b := mload(a_6) // b := mload(a_6)
// } // }

4
test/libyul/yulOptimizerTests/ssaAndBack/multi_assign.yul
View File

@ -10,10 +10,6 @@
// step: ssaAndBack // step: ssaAndBack
// ---- // ----
// { // {
// pop(mload(0))
// pop(mload(1))
// pop(mload(2))
// pop(mload(3))
// let a_5 := mload(4) // let a_5 := mload(4)
// mstore(a_5, 0) // mstore(a_5, 0)
// } // }

7
test/libyul/yulOptimizerTests/ssaAndBack/multi_assign_if.yul
View File

@ -13,11 +13,6 @@
// ---- // ----
// { // {
// let a := mload(0) // let a := mload(0)
// if mload(1) // if mload(1) { a := mload(3) }
// {
// pop(mload(1))
// pop(mload(2))
// a := mload(3)
// }
// mstore(a, 0) // mstore(a, 0)
// } // }

12
test/libyul/yulOptimizerTests/ssaAndBack/multi_assign_switch.yul
View File

@ -19,15 +19,7 @@
// { // {
// let a := mload(0) // let a := mload(0)
// switch mload(1) // switch mload(1)
// case 0 { // case 0 { a := mload(3) }
// pop(mload(1)) // default { a := mload(6) }
// pop(mload(2))
// a := mload(3)
// }
// default {
// pop(mload(4))
// pop(mload(5))
// a := mload(6)
// }
// mstore(a, 0) // mstore(a, 0)
// } // }

1
test/libyul/yulOptimizerTests/ssaAndBack/simple.yul
View File

@ -7,7 +7,6 @@
// step: ssaAndBack // step: ssaAndBack
// ---- // ----
// { // {
// pop(mload(0))
// let a_2 := mload(1) // let a_2 := mload(1)
// mstore(a_2, 0) // mstore(a_2, 0)
// } // }