2018-04-06 16:52:10 +02: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-06-15 11:11:25 +02:00
|
|
|
import
|
2018-07-05 15:41:01 +03:00
|
|
|
strformat, strutils, sequtils, endians, macros,
|
2019-02-05 20:15:50 +01:00
|
|
|
eth/common/eth_types, eth/rlp,
|
2018-07-06 17:08:31 +02:00
|
|
|
../../../constants
|
2018-01-16 19:05:20 +02:00
|
|
|
|
2018-03-13 16:30:38 +02:00
|
|
|
# some methods based on py-evm utils/numeric
|
|
|
|
|
2018-12-04 14:39:10 +01:00
|
|
|
func log2*[bits: static int](value: StUint[bits]): Natural {.inline.}=
|
|
|
|
(bits - 1) - value.countLeadingZeroBits
|
2018-10-05 17:26:20 +02:00
|
|
|
|
2018-07-06 17:08:31 +02:00
|
|
|
func log256*(value: UInt256): Natural {.inline.}=
|
2018-10-05 17:26:20 +02:00
|
|
|
value.log2 shr 3 # div 8 (= log2(256), Logb x = Loga x/Loga b)
|
2018-05-16 10:41:34 +02:00
|
|
|
|
2018-06-12 17:33:47 +02:00
|
|
|
func ceil32*(value: Natural): Natural {.inline.}=
|
|
|
|
# Round input to the nearest bigger multiple of 32
|
|
|
|
|
|
|
|
result = value
|
2018-01-16 20:42:38 +02:00
|
|
|
|
2018-06-12 17:33:47 +02:00
|
|
|
let remainder = result and 31 # equivalent to modulo 32
|
|
|
|
if remainder != 0:
|
|
|
|
return value + 32 - remainder
|
2018-01-16 19:05:20 +02:00
|
|
|
|
2018-06-12 17:33:47 +02:00
|
|
|
func wordCount*(length: Natural): Natural {.inline.}=
|
|
|
|
# Returns the number of EVM words corresponding to a specific size.
|
|
|
|
# EVM words is rounded up
|
|
|
|
length.ceil32 shr 5 # equivalent to `div 32` (32 = 2^5)
|
2018-07-18 12:14:28 +03:00
|
|
|
|
|
|
|
proc flipSign(value: var UInt256) =
|
|
|
|
# ⚠ Warning: low(Int256) (binary repr 0b1000...0000) cannot be negated, please handle this special case
|
|
|
|
value = not value
|
|
|
|
value += 1.u256
|
|
|
|
|
|
|
|
proc extractSign*(v: var UInt256, sign: var bool) =
|
|
|
|
sign = v > INT_256_MAX_AS_UINT256
|
|
|
|
if sign:
|
|
|
|
flipSign(v)
|
|
|
|
|
|
|
|
proc setSign*(v: var UInt256, sign: bool) {.inline.} =
|
|
|
|
if sign: flipSign(v)
|
2018-09-17 17:35:41 -07:00
|
|
|
|
|
|
|
func cleanMemRef*(x: UInt256): int {.inline.} =
|
|
|
|
## Sanitize memory addresses, catch negative or impossibly big offsets
|
|
|
|
# See https://github.com/status-im/nimbus/pull/97 for more info
|
|
|
|
# For rationale on shr, see https://github.com/status-im/nimbus/pull/101
|
|
|
|
const upperBound = (high(int32) shr 2).u256
|
|
|
|
if x > upperBound:
|
|
|
|
return high(int32) shr 2
|
|
|
|
return x.toInt
|
2018-10-10 16:26:21 +02:00
|
|
|
|
2018-12-04 14:39:10 +01:00
|
|
|
proc rangeToPadded*[T: StUint](x: openarray[byte], first, last: int): T =
|
2018-10-10 16:26:21 +02:00
|
|
|
## Convert take a slice of a sequence of bytes interpret it as the big endian
|
|
|
|
## representation of an Uint256. Use padding for sequence shorter than 32 bytes
|
|
|
|
## including 0-length sequences.
|
|
|
|
|
|
|
|
let lo = max(0, first)
|
|
|
|
let hi = min(x.high, last)
|
|
|
|
|
2018-12-04 12:49:48 +01:00
|
|
|
if not(lo <= hi):
|
2018-10-10 16:26:21 +02:00
|
|
|
return # 0
|
|
|
|
|
2018-12-04 14:39:10 +01:00
|
|
|
result = T.fromBytesBE(
|
2018-10-10 16:26:21 +02:00
|
|
|
x.toOpenArray(lo, hi),
|
|
|
|
allowPadding = true
|
|
|
|
)
|