2018-04-06 14:52:10 +00:00
|
|
|
# Nimbus
|
|
|
|
# Copyright (c) 2018 Status Research & Development GmbH
|
|
|
|
# Licensed under either of
|
|
|
|
# * Apache License, version 2.0, ([LICENSE-APACHE](LICENSE-APACHE) or http://www.apache.org/licenses/LICENSE-2.0)
|
|
|
|
# * MIT license ([LICENSE-MIT](LICENSE-MIT) or http://opensource.org/licenses/MIT)
|
|
|
|
# at your option. This file may not be copied, modified, or distributed except according to those terms.
|
|
|
|
|
2018-04-03 16:09:09 +00:00
|
|
|
import unittest, strutils, sequtils,
|
2018-06-15 09:11:25 +00:00
|
|
|
../nimbus/vm/interpreter
|
2018-01-31 12:57:05 +00:00
|
|
|
|
|
|
|
suite "parse bytecode":
|
|
|
|
test "accepts bytes":
|
|
|
|
let codeStream = newCodeStream("\x01")
|
|
|
|
check(codeStream.len == 1)
|
|
|
|
|
|
|
|
|
|
|
|
# quicktest
|
|
|
|
# @pytest.mark.parametrize("code_bytes", (1010, '1010', True, bytearray(32)))
|
|
|
|
# def test_codeStream_rejects_invalid_code_byte_values(code_bytes):
|
|
|
|
# with pytest.raises(ValidationError):
|
|
|
|
# CodeStream(code_bytes)
|
|
|
|
|
|
|
|
test "next returns the correct opcode":
|
|
|
|
var codeStream = newCodeStream("\x01\x02\x30")
|
|
|
|
check(codeStream.next == Op.ADD)
|
|
|
|
check(codeStream.next == Op.MUL)
|
|
|
|
check(codeStream.next == Op.ADDRESS)
|
|
|
|
|
|
|
|
|
|
|
|
test "peek returns next opcode without changing location":
|
|
|
|
var codeStream = newCodeStream("\x01\x02\x30")
|
|
|
|
check(codeStream.pc == 0)
|
|
|
|
check(codeStream.peek == Op.ADD)
|
|
|
|
check(codeStream.pc == 0)
|
|
|
|
check(codeStream.next == Op.ADD)
|
|
|
|
check(codeStream.pc == 1)
|
|
|
|
check(codeStream.peek == Op.MUL)
|
|
|
|
check(codeStream.pc == 1)
|
|
|
|
|
|
|
|
|
|
|
|
test "stop opcode is returned when end reached":
|
|
|
|
var codeStream = newCodeStream("\x01\x02")
|
|
|
|
discard codeStream.next
|
|
|
|
discard codeStream.next
|
|
|
|
check(codeStream.next == Op.STOP)
|
|
|
|
|
Refactor interpreter dispatch (#65)
* move forks constants, rename errors
* Move vm/utils to vm/interpreter/utils
* initial opcodes refactoring
* Add refactored Comparison & Bitwise Logic Operations
* Add sha3 and address, simplify macro, support pop 0
* balance, origin, caller, callValue
* fix gas copy opcodes gas costs, add callDataLoad/Size/Copy, CodeSize/Copy and gas price opcode
* Update with 30s, 40s, 50s opcodes + impl of balance + stack improvement
* add push, dup, swap, log, create and call operations
* finish opcode implementation
* Add the new dispatching logic
* Pass the opcode test
* Make test_vm_json compile
* halt execution without exceptions for Return, Revert, selfdestruct (fix #62)
* Properly catch and recover from EVM exceptions (stack underflow ...)
* Fix byte op
* Fix jump regressions
* Update for latest devel, don't import old dispatch code as quasiBoolean macro is broken by latest devel
* Fix sha3 regression on empty memory slice and until end of range slice
* Fix padding / range error on expXY_success (gas computation left)
* update logging procs
* Add tracing - expXY_success is not a regression, sload stub was accidentally passing the test
* Reuse the same stub as OO implementation
* Delete previous opcode implementation
* Delete object oriented fork code
* Delete exceptions that were used as control flows
* delete base.nim :fire:, yet another OO remnants
* Delete opcode table
* Enable omputed gotos and compile-time gas fees
* Revert const gasCosts -> generates SIGSEGV
* inline push, swap and dup opcodes
* loggers are now template again, why does this pass new tests?
* Trigger CI rebuild after rocksdb fix https://github.com/status-im/nim-rocksdb/pull/5
* Address review comment on "push" + VMTests in debug mode (not release)
* Address review comment: don't tag fork by default, make opcode impl grepable
* Static compilation fixes after rebasing
* fix the initialization of the VM database
* add a missing import
* Deactivate balance and sload test following #59
* Reactivate stack check (deactivated in #59, necessary to pass tests)
* Merge remaining opcodes implementation from #59
* Merge callDataLoad and codeCopy fixes, todo simplify see #67
2018-07-06 07:52:31 +00:00
|
|
|
# Seek has been dommented out for future deletion
|
|
|
|
# test "seek reverts to original position on exit":
|
|
|
|
# var codeStream = newCodeStream("\x01\x02\x30")
|
|
|
|
# check(codeStream.pc == 0)
|
|
|
|
# codeStream.seek(1):
|
|
|
|
# check(codeStream.pc == 1)
|
|
|
|
# check(codeStream.next == Op.MUL)
|
|
|
|
# check(codeStream.pc == 0)
|
|
|
|
# check(codeStream.peek == Op.ADD)
|
2018-01-31 12:57:05 +00:00
|
|
|
|
|
|
|
test "[] returns opcode":
|
|
|
|
let codeStream = newCodeStream("\x01\x02\x30")
|
|
|
|
check(codeStream[0] == Op.ADD)
|
|
|
|
check(codeStream[1] == Op.MUL)
|
|
|
|
check(codeStream[2] == Op.ADDRESS)
|
|
|
|
|
|
|
|
test "isValidOpcode invalidates after PUSHXX":
|
|
|
|
var codeStream = newCodeStream("\x02\x60\x02\x04")
|
|
|
|
check(codeStream.isValidOpcode(0))
|
|
|
|
check(codeStream.isValidOpcode(1))
|
|
|
|
check(not codeStream.isValidOpcode(2))
|
|
|
|
check(codeStream.isValidOpcode(3))
|
|
|
|
check(not codeStream.isValidOpcode(4))
|
|
|
|
|
|
|
|
|
|
|
|
test "isValidOpcode 0":
|
|
|
|
var codeStream = newCodeStream(@[2.byte, 3.byte, 0x72.byte].concat(repeat(4.byte, 32)).concat(@[5.byte]))
|
|
|
|
# valid: 0 - 2 :: 22 - 35
|
|
|
|
# invalid: 3-21 (PUSH19) :: 36+ (too long)
|
|
|
|
check(codeStream.isValidOpcode(0))
|
|
|
|
check(codeStream.isValidOpcode(1))
|
|
|
|
check(codeStream.isValidOpcode(2))
|
|
|
|
check(not codeStream.isValidOpcode(3))
|
|
|
|
check(not codeStream.isValidOpcode(21))
|
|
|
|
check(codeStream.isValidOpcode(22))
|
|
|
|
check(codeStream.isValidOpcode(35))
|
|
|
|
check(not codeStream.isValidOpcode(36))
|
|
|
|
|
|
|
|
|
|
|
|
test "isValidOpcode 1":
|
|
|
|
let test = @[2.byte, 3.byte, 0x7d.byte].concat(repeat(4.byte, 32)).concat(@[5.byte, 0x7e.byte]).concat(repeat(4.byte, 35)).concat(@[1.byte, 0x61.byte, 1.byte, 1.byte, 1.byte])
|
|
|
|
var codeStream = newCodeStream(test)
|
|
|
|
# valid: 0 - 2 :: 33 - 36 :: 68 - 73 :: 76
|
|
|
|
# invalid: 3 - 32 (PUSH30) :: 37 - 67 (PUSH31) :: 74, 75 (PUSH2) :: 77+ (too long)
|
|
|
|
check(codeStream.isValidOpcode(0))
|
|
|
|
check(codeStream.isValidOpcode(1))
|
|
|
|
check(codeStream.isValidOpcode(2))
|
|
|
|
check(not codeStream.isValidOpcode(3))
|
|
|
|
check(not codeStream.isValidOpcode(32))
|
|
|
|
check(codeStream.isValidOpcode(33))
|
|
|
|
check(codeStream.isValidOpcode(36))
|
|
|
|
check(not codeStream.isValidOpcode(37))
|
|
|
|
check(not codeStream.isValidOpcode(67))
|
|
|
|
check(codeStream.isValidOpcode(68))
|
|
|
|
check(codeStream.isValidOpcode(71))
|
|
|
|
check(codeStream.isValidOpcode(72))
|
|
|
|
check(codeStream.isValidOpcode(73))
|
|
|
|
check(not codeStream.isValidOpcode(74))
|
|
|
|
check(not codeStream.isValidOpcode(75))
|
|
|
|
check(codeStream.isValidOpcode(76))
|
|
|
|
check(not codeStream.isValidOpcode(77))
|
|
|
|
|
|
|
|
|
|
|
|
test "right number of bytes invalidates":
|
|
|
|
var codeStream = newCodeStream("\x02\x03\x60\x02\x02")
|
|
|
|
check(codeStream.isValidOpcode(0))
|
|
|
|
check(codeStream.isValidOpcode(1))
|
|
|
|
check(codeStream.isValidOpcode(2))
|
|
|
|
check(not codeStream.isValidOpcode(3))
|
|
|
|
check(codeStream.isValidOpcode(4))
|
|
|
|
check(not codeStream.isValidOpcode(5))
|