mirror of
https://github.com/status-im/nimbus-eth1.git
synced 2025-01-10 20:36:31 +00:00
c47f021596
* Disable `TransactionID` related functions from `state_db.nim` why: Functions `getCommittedStorage()` and `updateOriginalRoot()` from the `state_db` module are nowhere used. The emulation of a legacy `TransactionID` type functionality is administratively expensive to provide by `Aristo` (the legacy DB version is only partially implemented, anyway). As there is no other place where `TransactionID`s are used, they will not be provided by the `Aristo` variant of the `CoreDb`. For the legacy DB API, nothing will change. * Fix copyright headers in source code * Get rid of compiler warning * Update Aristo code, remove unused `merge()` variant, export `hashify()` why: Adapt to upcoming `CoreDb` wrapper * Remove synced tx feature from `Aristo` why: + This feature allowed to synchronise transaction methods like begin, commit, and rollback for a group of descriptors. + The feature is over engineered and not needed for `CoreDb`, neither is it complete (some convergence features missing.) * Add debugging helpers to `Kvt` also: Update database iterator, add count variable yield argument similar to `Aristo`. * Provide optional destructors for `CoreDb` API why; For the upcoming Aristo wrapper, this allows to control when certain smart destruction and update can take place. The auto destructor works fine in general when the storage/cache strategy is known and acceptable when creating descriptors. * Add update option for `CoreDb` API function `hash()` why; The hash function is typically used to get the state root of the MPT. Due to lazy hashing, this might be not available on the `Aristo` DB. So the `update` function asks for re-hashing the gurrent state changes if needed. * Update API tracking log mode: `info` => `debug * Use shared `Kvt` descriptor in new Ledger API why: No need to create a new descriptor all the time
116 lines
3.6 KiB
Nim
116 lines
3.6 KiB
Nim
# Nimbus
|
|
# Copyright (c) 2018-2023 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
|
|
unittest2,
|
|
eth/common/eth_types,
|
|
../nimbus/[constants, errors, vm_internals]
|
|
|
|
|
|
template testPush(value: untyped, expected: untyped): untyped =
|
|
var stack = newStack()
|
|
stack.push(value)
|
|
check(stack.values == @[expected])
|
|
|
|
template testFailPush(value: untyped): untyped {.used.} =
|
|
var stack = newStack()
|
|
expect(ValidationError):
|
|
stack.push(value)
|
|
|
|
func toBytes(s: string): seq[byte] =
|
|
cast[seq[byte]](s)
|
|
|
|
func bigEndianToInt*(value: openArray[byte]): UInt256 =
|
|
result.initFromBytesBE(value)
|
|
|
|
proc stackMain*() =
|
|
suite "stack":
|
|
test "push only valid":
|
|
testPush(0'u, 0.u256)
|
|
testPush(UINT_256_MAX, UINT_256_MAX)
|
|
testPush("ves".toBytes, "ves".toBytes.bigEndianToInt)
|
|
|
|
# Appveyor mysterious failure.
|
|
# Raising exception in this file will force the
|
|
# program to quit because of SIGSEGV.
|
|
# Cannot reproduce locally, and doesn't happen
|
|
# in other file.
|
|
when not(defined(windows) and
|
|
defined(cpu64) and
|
|
(NimMajor, NimMinor, NimPatch) >= (1, 0, 4)):
|
|
testFailPush("yzyzyzyzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz".toBytes)
|
|
|
|
test "push does not allow stack to exceed 1024":
|
|
var stack = newStack()
|
|
for z in 0 ..< 1024:
|
|
stack.push(z.uint)
|
|
check(stack.len == 1024)
|
|
expect(FullStack):
|
|
stack.push(1025)
|
|
|
|
test "dup does not allow stack to exceed 1024":
|
|
var stack = newStack()
|
|
stack.push(1.u256)
|
|
for z in 0 ..< 1023:
|
|
stack.dup(1)
|
|
check(stack.len == 1024)
|
|
expect(FullStack):
|
|
stack.dup(1)
|
|
|
|
test "pop returns latest stack item":
|
|
var stack = newStack()
|
|
for element in @[1'u, 2'u, 3'u]:
|
|
stack.push(element)
|
|
check(stack.popInt == 3.u256)
|
|
|
|
test "swap correct":
|
|
var stack = newStack()
|
|
for z in 0 ..< 5:
|
|
stack.push(z.uint)
|
|
check(stack.values == @[0.u256, 1.u256, 2.u256, 3.u256, 4.u256])
|
|
stack.swap(3)
|
|
check(stack.values == @[0.u256, 4.u256, 2.u256, 3.u256, 1.u256])
|
|
stack.swap(1)
|
|
check(stack.values == @[0.u256, 4.u256, 2.u256, 1.u256, 3.u256])
|
|
|
|
test "dup correct":
|
|
var stack = newStack()
|
|
for z in 0 ..< 5:
|
|
stack.push(z.uint)
|
|
check(stack.values == @[0.u256, 1.u256, 2.u256, 3.u256, 4.u256])
|
|
stack.dup(1)
|
|
check(stack.values == @[0.u256, 1.u256, 2.u256, 3.u256, 4.u256, 4.u256])
|
|
stack.dup(5)
|
|
check(stack.values == @[0.u256, 1.u256, 2.u256, 3.u256, 4.u256, 4.u256, 1.u256])
|
|
|
|
test "pop raises InsufficientStack appropriately":
|
|
var stack = newStack()
|
|
expect(InsufficientStack):
|
|
discard stack.popInt()
|
|
|
|
test "swap raises InsufficientStack appropriately":
|
|
var stack = newStack()
|
|
expect(InsufficientStack):
|
|
stack.swap(0)
|
|
|
|
test "dup raises InsufficientStack appropriately":
|
|
var stack = newStack()
|
|
expect(InsufficientStack):
|
|
stack.dup(0)
|
|
|
|
test "binary operations raises InsufficientStack appropriately":
|
|
# https://github.com/status-im/nimbus/issues/31
|
|
# ./tests/fixtures/VMTests/vmArithmeticTest/mulUnderFlow.json
|
|
|
|
var stack = newStack()
|
|
stack.push(123)
|
|
expect(InsufficientStack):
|
|
discard stack.popInt(2)
|
|
|
|
when isMainModule:
|
|
stackMain()
|