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-16 17:05:20 +00:00
|
|
|
import
|
2018-07-05 12:41:01 +00:00
|
|
|
sequtils,
|
2019-02-05 19:15:50 +00:00
|
|
|
chronicles, eth/common/eth_types,
|
2021-03-30 16:20:43 +00:00
|
|
|
errors, validation,
|
|
|
|
vm/interpreter/utils/utils_numeric
|
2018-01-16 17:05:20 +00:00
|
|
|
|
2018-08-23 03:38:00 +00:00
|
|
|
logScope:
|
|
|
|
topics = "vm memory"
|
|
|
|
|
2018-01-16 17:05:20 +00:00
|
|
|
type
|
|
|
|
Memory* = ref object
|
2018-01-29 17:40:22 +00:00
|
|
|
bytes*: seq[byte]
|
2018-01-16 17:05:20 +00:00
|
|
|
|
|
|
|
proc newMemory*: Memory =
|
|
|
|
new(result)
|
|
|
|
result.bytes = @[]
|
|
|
|
|
|
|
|
proc len*(memory: Memory): int =
|
2018-02-06 19:20:06 +00:00
|
|
|
result = memory.bytes.len
|
2018-01-16 17:05:20 +00:00
|
|
|
|
2018-07-05 12:41:01 +00:00
|
|
|
proc extend*(memory: var Memory; startPos: Natural; size: Natural) =
|
2018-01-16 17:05:20 +00:00
|
|
|
if size == 0:
|
|
|
|
return
|
2018-07-05 12:41:01 +00:00
|
|
|
var newSize = ceil32(startPos + size)
|
2018-05-25 10:25:19 +00:00
|
|
|
if newSize <= len(memory):
|
2018-01-16 17:05:20 +00:00
|
|
|
return
|
2018-05-25 10:25:19 +00:00
|
|
|
var sizeToExtend = newSize - len(memory)
|
|
|
|
memory.bytes = memory.bytes.concat(repeat(0.byte, sizeToExtend))
|
2018-01-16 17:05:20 +00:00
|
|
|
|
2018-05-25 10:25:19 +00:00
|
|
|
proc newMemory*(size: Natural): Memory =
|
2018-01-24 13:31:24 +00:00
|
|
|
result = newMemory()
|
2018-05-25 10:25:19 +00:00
|
|
|
result.extend(0, size)
|
2018-01-24 13:31:24 +00:00
|
|
|
|
2018-07-05 12:41:01 +00:00
|
|
|
proc read*(memory: var Memory, startPos: Natural, size: Natural): seq[byte] =
|
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
|
|
|
# TODO: use an openarray[byte]
|
2018-07-05 12:41:01 +00:00
|
|
|
result = memory.bytes[startPos ..< (startPos + size)]
|
2018-01-22 22:23:07 +00:00
|
|
|
|
2020-01-31 01:08:44 +00:00
|
|
|
when defined(evmc_enabled):
|
|
|
|
proc readPtr*(memory: var Memory, startPos: Natural): ptr byte =
|
2021-01-19 09:02:24 +00:00
|
|
|
if memory.bytes.len == 0 or startPos >= memory.bytes.len: return
|
2020-01-31 01:08:44 +00:00
|
|
|
result = memory.bytes[startPos].addr
|
|
|
|
|
2018-07-05 12:41:01 +00:00
|
|
|
proc write*(memory: var Memory, startPos: Natural, value: openarray[byte]) =
|
2018-05-30 16:11:15 +00:00
|
|
|
let size = value.len
|
2018-02-06 19:20:06 +00:00
|
|
|
if size == 0:
|
|
|
|
return
|
2018-04-06 14:52:10 +00:00
|
|
|
#echo size
|
2018-07-05 12:41:01 +00:00
|
|
|
#echo startPos
|
|
|
|
validateLte(startPos + size, memory.len)
|
|
|
|
if memory.len < startPos + size:
|
|
|
|
memory.bytes = memory.bytes.concat(repeat(0.byte, memory.len - (startPos + size))) # TODO: better logarithmic scaling?
|
2018-02-06 19:20:06 +00:00
|
|
|
|
|
|
|
for z, b in value:
|
2018-07-05 12:41:01 +00:00
|
|
|
memory.bytes[z + startPos] = b
|