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
|
2018-08-23 03:38:00 +00:00
|
|
|
chronicles, strformat, strutils, sequtils, parseutils, sets, macros,
|
2019-02-05 19:15:50 +00:00
|
|
|
eth/common,
|
2019-11-13 14:49:39 +00:00
|
|
|
./interpreter/opcode_values
|
2018-08-23 03:38:00 +00:00
|
|
|
|
|
|
|
logScope:
|
|
|
|
topics = "vm code_stream"
|
2018-01-15 18:42:40 +00:00
|
|
|
|
|
|
|
type
|
|
|
|
CodeStream* = ref object
|
2018-02-20 17:27:43 +00:00
|
|
|
bytes*: seq[byte]
|
2018-01-15 18:42:40 +00:00
|
|
|
depthProcessed: int
|
|
|
|
invalidPositions: HashSet[int]
|
|
|
|
pc*: int
|
2018-02-27 18:10:34 +00:00
|
|
|
cached: seq[(int, Op, string)]
|
2018-01-15 18:42:40 +00:00
|
|
|
|
|
|
|
proc `$`*(b: byte): string =
|
|
|
|
$(b.int)
|
|
|
|
|
2018-01-31 12:57:05 +00:00
|
|
|
proc newCodeStream*(codeBytes: seq[byte]): CodeStream =
|
2018-01-15 18:42:40 +00:00
|
|
|
new(result)
|
2020-01-20 14:02:06 +00:00
|
|
|
shallowCopy(result.bytes, codeBytes)
|
2018-01-15 18:42:40 +00:00
|
|
|
result.pc = 0
|
2019-11-13 14:49:39 +00:00
|
|
|
result.invalidPositions = initHashSet[int]()
|
2018-01-15 18:42:40 +00:00
|
|
|
result.depthProcessed = 0
|
2018-02-27 18:10:34 +00:00
|
|
|
result.cached = @[]
|
2018-01-31 12:57:05 +00:00
|
|
|
|
|
|
|
proc newCodeStream*(codeBytes: string): CodeStream =
|
|
|
|
newCodeStream(codeBytes.mapIt(it.byte))
|
2018-01-15 18:42:40 +00:00
|
|
|
|
2018-02-14 16:38:01 +00:00
|
|
|
proc newCodeStreamFromUnescaped*(code: string): CodeStream =
|
|
|
|
# from 0xunescaped
|
|
|
|
var codeBytes: seq[byte] = @[]
|
|
|
|
for z, c in code[2..^1]:
|
|
|
|
if z mod 2 == 1:
|
|
|
|
var value: int
|
|
|
|
discard parseHex(&"0x{code[z+1..z+2]}", value)
|
|
|
|
codeBytes.add(value.byte)
|
|
|
|
newCodeStream(codeBytes)
|
|
|
|
|
2018-01-15 18:42:40 +00:00
|
|
|
proc read*(c: var CodeStream, size: int): seq[byte] =
|
2022-04-08 04:54:11 +00:00
|
|
|
# TODO: use openArray[bytes]
|
2018-01-31 12:57:05 +00:00
|
|
|
if c.pc + size - 1 < c.bytes.len:
|
|
|
|
result = c.bytes[c.pc .. c.pc + size - 1]
|
|
|
|
c.pc += size
|
|
|
|
else:
|
|
|
|
result = @[]
|
|
|
|
c.pc = c.bytes.len
|
2018-01-15 18:42:40 +00:00
|
|
|
|
2018-07-05 12:41:01 +00:00
|
|
|
proc readVmWord*(c: var CodeStream, n: int): UInt256 =
|
2018-08-09 21:06:36 +00:00
|
|
|
## Reads `n` bytes from the code stream and pads
|
2018-07-05 12:41:01 +00:00
|
|
|
## the remaining bytes with zeros.
|
|
|
|
let result_bytes = cast[ptr array[32, byte]](addr result)
|
|
|
|
|
|
|
|
let last = min(c.pc + n, c.bytes.len)
|
|
|
|
let toWrite = last - c.pc
|
|
|
|
for i in 0 ..< toWrite : result_bytes[i] = c.bytes[last - i - 1]
|
|
|
|
c.pc = last
|
|
|
|
|
2018-01-15 18:42:40 +00:00
|
|
|
proc len*(c: CodeStream): int =
|
|
|
|
len(c.bytes)
|
|
|
|
|
2018-01-23 18:36:23 +00:00
|
|
|
proc next*(c: var CodeStream): Op =
|
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
|
|
|
if c.pc != c.bytes.len:
|
|
|
|
result = Op(c.bytes[c.pc])
|
|
|
|
inc c.pc
|
2018-01-15 18:42:40 +00:00
|
|
|
else:
|
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
|
|
|
result = Stop
|
2018-01-15 18:42:40 +00:00
|
|
|
|
2018-01-23 18:36:23 +00:00
|
|
|
iterator items*(c: var CodeStream): Op =
|
2018-01-15 18:42:40 +00:00
|
|
|
var nextOpcode = c.next()
|
2018-01-23 18:36:23 +00:00
|
|
|
while nextOpcode != Op.STOP:
|
2018-01-15 18:42:40 +00:00
|
|
|
yield nextOpcode
|
|
|
|
nextOpcode = c.next()
|
|
|
|
|
2018-01-31 12:57:05 +00:00
|
|
|
proc `[]`*(c: CodeStream, offset: int): Op =
|
|
|
|
Op(c.bytes[offset])
|
2018-01-15 18:42:40 +00:00
|
|
|
|
2018-01-23 18:36:23 +00:00
|
|
|
proc peek*(c: var CodeStream): Op =
|
2018-07-19 13:11:52 +00:00
|
|
|
if c.pc < c.bytes.len:
|
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
|
|
|
result = Op(c.bytes[c.pc])
|
|
|
|
else:
|
|
|
|
result = Stop
|
2018-01-15 18:42:40 +00:00
|
|
|
|
|
|
|
proc updatePc*(c: var CodeStream, value: int) =
|
|
|
|
c.pc = min(value, len(c))
|
|
|
|
|
2018-07-05 12:41:01 +00:00
|
|
|
when false:
|
|
|
|
template seek*(cs: var CodeStream, pc: int, handler: untyped): untyped =
|
|
|
|
var anchorPc = cs.pc
|
|
|
|
cs.pc = pc
|
2018-01-31 12:57:05 +00:00
|
|
|
try:
|
2018-07-05 12:41:01 +00:00
|
|
|
var c {.inject.} = cs
|
|
|
|
handler
|
2018-01-31 12:57:05 +00:00
|
|
|
finally:
|
2018-07-05 12:41:01 +00:00
|
|
|
cs.pc = anchorPc
|
2018-01-15 18:42:40 +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 isValidOpcode*(c: CodeStream, position: int): bool =
|
2018-01-15 18:42:40 +00:00
|
|
|
if position >= len(c):
|
|
|
|
return false
|
|
|
|
if position in c.invalidPositions:
|
|
|
|
return false
|
|
|
|
if position <= c.depthProcessed:
|
|
|
|
return true
|
|
|
|
else:
|
|
|
|
var i = c.depthProcessed
|
|
|
|
while i <= position:
|
2018-01-23 18:36:23 +00:00
|
|
|
var opcode = Op(c[i])
|
|
|
|
if opcode >= Op.PUSH1 and opcode <= Op.PUSH32:
|
2018-01-15 18:42:40 +00:00
|
|
|
var leftBound = (i + 1)
|
|
|
|
var rightBound = leftBound + (opcode.int - 95)
|
|
|
|
for z in leftBound ..< rightBound:
|
|
|
|
c.invalidPositions.incl(z)
|
|
|
|
i = rightBound
|
|
|
|
else:
|
|
|
|
c.depthProcessed = i
|
|
|
|
i += 1
|
|
|
|
if position in c.invalidPositions:
|
|
|
|
return false
|
|
|
|
else:
|
|
|
|
return true
|
2018-02-12 16:59:12 +00:00
|
|
|
|
2018-02-27 18:10:34 +00:00
|
|
|
proc decompile*(original: var CodeStream): seq[(int, Op, string)] =
|
2018-02-12 16:59:12 +00:00
|
|
|
# behave as https://etherscan.io/opcode-tool
|
|
|
|
# TODO
|
2018-02-27 18:10:34 +00:00
|
|
|
if original.cached.len > 0:
|
|
|
|
return original.cached
|
2018-02-12 16:59:12 +00:00
|
|
|
result = @[]
|
|
|
|
var c = newCodeStream(original.bytes)
|
|
|
|
while true:
|
|
|
|
var op = c.next
|
2022-04-08 04:54:11 +00:00
|
|
|
if op >= Push1 and op <= Push32:
|
2018-02-12 16:59:12 +00:00
|
|
|
let bytes = c.read(op.int - 95)
|
|
|
|
result.add((c.pc - 1, op, "0x" & bytes.mapIt($(it.BiggestInt.toHex(2))).join("")))
|
|
|
|
elif op != Op.Stop:
|
|
|
|
result.add((c.pc - 1, op, ""))
|
|
|
|
else:
|
2022-04-08 04:54:11 +00:00
|
|
|
result.add((-1, Op.Stop, ""))
|
2018-02-12 16:59:12 +00:00
|
|
|
break
|
2018-02-27 18:10:34 +00:00
|
|
|
original.cached = result
|
|
|
|
|
2018-03-13 14:30:38 +00:00
|
|
|
proc displayDecompiled*(c: CodeStream) =
|
|
|
|
var copy = c
|
|
|
|
let opcodes = copy.decompile()
|
|
|
|
for op in opcodes:
|
|
|
|
echo op[0], " ", op[1], " ", op[2]
|
|
|
|
|
2018-02-27 18:10:34 +00:00
|
|
|
proc hasSStore*(c: var CodeStream): bool =
|
|
|
|
let opcodes = c.decompile()
|
2022-04-08 04:54:11 +00:00
|
|
|
result = opcodes.anyIt(it[1] == Sstore)
|
2019-02-22 09:05:21 +00:00
|
|
|
|
|
|
|
proc atEnd*(c: CodeStream): bool =
|
|
|
|
result = c.pc >= c.bytes.len
|