mirror of
https://github.com/status-im/nimbus-eth1.git
synced 2025-01-11 04:46:00 +00:00
db202dc35f
This blindly changes logging to nim-chronicles - issues that ensue: * keeps gas cost computation logs hidden behind flag * unclear if logScope is practical - for example, since vm is split over many files, topics get lost when using simple top-level per-module topics * when passing named object around, scope should incliude the name of the object but this is caught neither by logScope nor by dynamicLogScope
61 lines
1.7 KiB
Nim
61 lines
1.7 KiB
Nim
# 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.
|
|
|
|
import
|
|
sequtils,
|
|
chronicles, eth_common/eth_types,
|
|
../constants, ../errors, ../validation,
|
|
./interpreter/utils/utils_numeric
|
|
|
|
logScope:
|
|
topics = "vm memory"
|
|
|
|
type
|
|
Memory* = ref object
|
|
bytes*: seq[byte]
|
|
|
|
proc newMemory*: Memory =
|
|
new(result)
|
|
result.bytes = @[]
|
|
|
|
proc len*(memory: Memory): int =
|
|
result = memory.bytes.len
|
|
|
|
|
|
proc extend*(memory: var Memory; startPos: Natural; size: Natural) =
|
|
if size == 0:
|
|
return
|
|
var newSize = ceil32(startPos + size)
|
|
if newSize <= len(memory):
|
|
return
|
|
var sizeToExtend = newSize - len(memory)
|
|
memory.bytes = memory.bytes.concat(repeat(0.byte, sizeToExtend))
|
|
|
|
proc newMemory*(size: Natural): Memory =
|
|
result = newMemory()
|
|
result.extend(0, size)
|
|
|
|
proc read*(memory: var Memory, startPos: Natural, size: Natural): seq[byte] =
|
|
# TODO: use an openarray[byte]
|
|
result = memory.bytes[startPos ..< (startPos + size)]
|
|
|
|
proc write*(memory: var Memory, startPos: Natural, value: openarray[byte]) =
|
|
let size = value.len
|
|
if size == 0:
|
|
return
|
|
#echo size
|
|
#echo startPos
|
|
#validateGte(startPos, 0)
|
|
#validateGte(size, 0)
|
|
validateLte(startPos + size, memory.len)
|
|
let index = memory.len
|
|
if memory.len < startPos + size:
|
|
memory.bytes = memory.bytes.concat(repeat(0.byte, memory.len - (startPos + size))) # TODO: better logarithmic scaling?
|
|
|
|
for z, b in value:
|
|
memory.bytes[z + startPos] = b
|