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-01-15 18:42:40 +00:00
|
|
|
import
|
2019-02-05 19:15:50 +00:00
|
|
|
chronicles, strformat, strutils, sequtils, macros, eth/[rlp, common], nimcrypto,
|
2018-08-23 03:38:00 +00:00
|
|
|
../errors, ../validation, ./interpreter/utils/utils_numeric, ../constants
|
|
|
|
|
|
|
|
logScope:
|
|
|
|
topics = "vm stack"
|
2018-01-15 18:42:40 +00:00
|
|
|
|
|
|
|
type
|
|
|
|
Stack* = ref object of RootObj
|
2018-05-30 16:11:15 +00:00
|
|
|
values*: seq[StackElement]
|
|
|
|
|
|
|
|
StackElement = UInt256
|
2018-01-15 18:42:40 +00:00
|
|
|
|
|
|
|
template ensureStackLimit: untyped =
|
|
|
|
if len(stack.values) > 1023:
|
|
|
|
raise newException(FullStack, "Stack limit reached")
|
|
|
|
|
2018-05-30 16:11:15 +00:00
|
|
|
proc len*(stack: Stack): int {.inline.} =
|
2018-01-15 18:42:40 +00:00
|
|
|
len(stack.values)
|
|
|
|
|
2018-05-30 16:11:15 +00:00
|
|
|
proc toStackElement(v: UInt256, elem: var StackElement) {.inline.} = elem = v
|
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
|
|
|
proc toStackElement(v: uint | int | GasInt, elem: var StackElement) {.inline.} = elem = v.u256
|
2018-07-06 15:08:31 +00:00
|
|
|
proc toStackElement(v: EthAddress, elem: var StackElement) {.inline.} = elem.initFromBytesBE(v)
|
|
|
|
proc toStackElement(v: MDigest, elem: var StackElement) {.inline.} = elem.initFromBytesBE(v.data, allowPadding = false)
|
2018-01-15 18:42:40 +00:00
|
|
|
|
2018-05-30 16:11:15 +00:00
|
|
|
proc fromStackElement(elem: StackElement, v: var UInt256) {.inline.} = v = elem
|
2018-07-05 12:41:01 +00:00
|
|
|
proc fromStackElement(elem: StackElement, v: var EthAddress) {.inline.} = v[0 .. ^1] = elem.toByteArrayBE().toOpenArray(12, 31)
|
2018-05-30 16:11:15 +00:00
|
|
|
proc fromStackElement(elem: StackElement, v: var Hash256) {.inline.} = v.data = elem.toByteArrayBE()
|
2018-12-10 12:04:34 +00:00
|
|
|
proc fromStackElement(elem: StackElement, v: var Topic) {.inline.} = v = elem.toByteArrayBE()
|
2018-02-20 17:27:43 +00:00
|
|
|
|
2018-07-05 12:41:01 +00:00
|
|
|
proc toStackElement(v: openarray[byte], elem: var StackElement) {.inline.} =
|
2018-05-30 16:11:15 +00:00
|
|
|
# TODO: This needs to go
|
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
|
|
|
validateStackItem(v) # This is necessary to pass stack tests
|
2018-07-06 15:08:31 +00:00
|
|
|
elem.initFromBytesBE(v)
|
2018-02-20 17:27:43 +00:00
|
|
|
|
2018-05-30 16:11:15 +00:00
|
|
|
proc pushAux[T](stack: var Stack, value: T) =
|
2018-01-16 17:05:20 +00:00
|
|
|
ensureStackLimit()
|
2018-05-30 16:11:15 +00:00
|
|
|
stack.values.setLen(stack.values.len + 1)
|
|
|
|
toStackElement(value, stack.values[^1])
|
2018-01-16 17:05:20 +00:00
|
|
|
|
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
|
|
|
proc push*(stack: var Stack, value: uint | int | GasInt | UInt256 | EthAddress | Hash256) {.inline.} =
|
2018-05-30 16:11:15 +00:00
|
|
|
pushAux(stack, value)
|
2018-01-15 18:42:40 +00:00
|
|
|
|
2018-07-05 12:41:01 +00:00
|
|
|
proc push*(stack: var Stack, value: openarray[byte]) {.inline.} =
|
2018-05-30 16:11:15 +00:00
|
|
|
# TODO: This needs to go...
|
|
|
|
pushAux(stack, value)
|
2018-01-15 18:42:40 +00:00
|
|
|
|
2018-05-30 16:11:15 +00:00
|
|
|
proc ensurePop(elements: Stack, a: int) =
|
2018-05-17 18:59:17 +00:00
|
|
|
let num = elements.len
|
|
|
|
let expected = a
|
|
|
|
if num < expected:
|
|
|
|
raise newException(InsufficientStack,
|
|
|
|
&"Stack underflow: expected {expected} elements, got {num} instead.")
|
2018-01-15 18:42:40 +00:00
|
|
|
|
2018-05-30 16:11:15 +00:00
|
|
|
proc popAux[T](stack: var Stack, value: var T) =
|
2018-05-17 18:59:17 +00:00
|
|
|
ensurePop(stack, 1)
|
2018-05-30 16:11:15 +00:00
|
|
|
fromStackElement(stack.values[^1], value)
|
|
|
|
stack.values.setLen(stack.values.len - 1)
|
2018-04-06 14:52:10 +00:00
|
|
|
|
2018-05-30 16:11:15 +00:00
|
|
|
proc internalPopTuple(stack: var Stack, v: var tuple, tupleLen: static[int]) =
|
|
|
|
ensurePop(stack, tupleLen)
|
|
|
|
var i = 0
|
|
|
|
let sz = stack.values.high
|
|
|
|
for f in fields(v):
|
|
|
|
fromStackElement(stack.values[sz - i], f)
|
|
|
|
inc i
|
|
|
|
stack.values.setLen(sz - tupleLen + 1)
|
2018-01-15 18:42:40 +00:00
|
|
|
|
2018-05-30 16:11:15 +00:00
|
|
|
proc popInt*(stack: var Stack): UInt256 {.inline.} =
|
|
|
|
popAux(stack, result)
|
2018-02-20 17:27:43 +00:00
|
|
|
|
2018-05-30 16:11:15 +00:00
|
|
|
macro genTupleType(len: static[int], elemType: untyped): untyped =
|
|
|
|
result = nnkTupleConstr.newNimNode()
|
|
|
|
for i in 0 ..< len: result.add(elemType)
|
2018-01-15 18:42:40 +00:00
|
|
|
|
2018-05-30 16:11:15 +00:00
|
|
|
proc popInt*(stack: var Stack, numItems: static[int]): auto {.inline.} =
|
|
|
|
var r: genTupleType(numItems, UInt256)
|
|
|
|
stack.internalPopTuple(r, numItems)
|
|
|
|
return r
|
|
|
|
|
|
|
|
proc popAddress*(stack: var Stack): EthAddress {.inline.} =
|
|
|
|
popAux(stack, result)
|
2018-12-10 12:04:34 +00:00
|
|
|
|
|
|
|
proc popTopic*(stack: var Stack): Topic {.inline.} =
|
|
|
|
popAux(stack, result)
|
2018-01-15 18:42:40 +00:00
|
|
|
|
2018-01-16 17:05:20 +00:00
|
|
|
proc newStack*(): Stack =
|
|
|
|
new(result)
|
2018-01-15 18:42:40 +00:00
|
|
|
result.values = @[]
|
|
|
|
|
2018-02-20 17:27:43 +00:00
|
|
|
proc swap*(stack: var Stack, position: int) =
|
2018-01-15 18:42:40 +00:00
|
|
|
## Perform a SWAP operation on the stack
|
|
|
|
var idx = position + 1
|
|
|
|
if idx < len(stack) + 1:
|
|
|
|
(stack.values[^1], stack.values[^idx]) = (stack.values[^idx], stack.values[^1])
|
|
|
|
else:
|
|
|
|
raise newException(InsufficientStack,
|
2018-01-22 22:23:07 +00:00
|
|
|
&"Insufficient stack items for SWAP{position}")
|
2018-01-15 18:42:40 +00:00
|
|
|
|
2018-06-15 09:11:25 +00:00
|
|
|
template getint(x: int): int = x
|
|
|
|
|
2018-02-20 17:27:43 +00:00
|
|
|
proc dup*(stack: var Stack, position: int | UInt256) =
|
2018-01-15 18:42:40 +00:00
|
|
|
## Perform a DUP operation on the stack
|
2018-05-30 16:11:15 +00:00
|
|
|
let position = position.getInt
|
|
|
|
if position in 1 .. stack.len:
|
|
|
|
stack.push(stack.values[^position])
|
2018-01-15 18:42:40 +00:00
|
|
|
else:
|
|
|
|
raise newException(InsufficientStack,
|
2018-01-22 22:23:07 +00:00
|
|
|
&"Insufficient stack items for DUP{position}")
|
2018-01-15 18:42:40 +00:00
|
|
|
|
2018-03-14 11:11:32 +00:00
|
|
|
proc peek*(stack: Stack): UInt256 =
|
2018-05-30 16:11:15 +00:00
|
|
|
# This should be used only for testing purposes!
|
|
|
|
fromStackElement(stack.values[^1], result)
|
2018-03-14 11:11:32 +00:00
|
|
|
|
2018-01-24 13:31:24 +00:00
|
|
|
proc `$`*(stack: Stack): string =
|
|
|
|
let values = stack.values.mapIt(&" {$it}").join("\n")
|
|
|
|
&"Stack:\n{values}"
|
2018-12-25 07:31:12 +00:00
|
|
|
|
|
|
|
proc `[]`*(stack: Stack, i: BackwardsIndex, T: typedesc): T =
|
|
|
|
# This should be used only for tracer/test/debugging
|
|
|
|
fromStackElement(stack.values[i], result)
|