# Nimbus # Copyright (c) 2018-2021 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 std/[math, strutils, hashes], eth/common/eth_types_rlp, stew/byteutils {.push raises: [Defect].} type NodeHash* = distinct Hash256 ## Hash of a trie node or other blob carried over `NodeData` account trie ## nodes, storage trie nodes, contract code. ## ## Note that the `ethXX` and `snapXX` protocol drivers always use the ## underlying `Hash256` type which needs to be converted to `NodeHash`. BlockHash* = distinct Hash256 ## Hash of a block, goes with `BlockNumber`. ## ## Note that the `ethXX` protocol driver always uses the ## underlying `Hash256` type which needs to be converted to `BlockHash`. SomeDistinctHash256 = NodeHash | BlockHash # ------------------------------------------------------------------------------ # Public constructors # ------------------------------------------------------------------------------ proc new*(T: type SomeDistinctHash256): T = Hash256().T # ------------------------------------------------------------------------------ # Public (probably non-trivial) type conversions # ------------------------------------------------------------------------------ proc to*(num: SomeInteger; T: type float): T = ## Convert to float. Result an d argument are not strictly equivalent. Though ## sort of `(num.to(float) + 0.5).int == num` might hold in many cases. num.T proc to*(longNum: UInt256; T: type float): T = ## Convert to float (see also comment at `num.to(float)`, above.) let mantissaLen = 256 - longNum.leadingZeros if mantissaLen <= 64: longNum.truncate(uint64).T else: let exp = mantissaLen - 64 (longNum shr exp).truncate(uint64).T * (2.0 ^ exp) proc to*(w: SomeDistinctHash256; T: type Hash256): T = ## Syntactic sugar w.Hash256 proc to*(w: seq[SomeDistinctHash256]; T: type seq[Hash256]): T = ## Ditto cast[seq[Hash256]](w) proc to*(bh: BlockHash; T: type HashOrNum): T = ## Convert argument blocj hash `bh` to `HashOrNum` T(isHash: true, hash: bh.Hash256) # ------------------------------------------------------------------------------ # Public functions # ------------------------------------------------------------------------------ proc read*(rlp: var Rlp, T: type SomeDistinctHash256): T {.gcsafe, raises: [Defect,RlpError]} = ## RLP mixin reader rlp.read(Hash256).T proc append*(writer: var RlpWriter; h: SomeDistinctHash256) = ## RLP mixin append(writer, h.Hash256) proc `==`*(a: SomeDistinctHash256; b: Hash256): bool = a.Hash256 == b proc `==`*[T: SomeDistinctHash256](a,b: T): bool = a.Hash256 == b.Hash256 proc hash*(root: SomeDistinctHash256): Hash = ## Mixin for `Table` or `KeyedQueue` root.Hash256.data.hash # ------------------------------------------------------------------------------ # Public printing and pretty printing # ------------------------------------------------------------------------------ func toHex*(hash: Hash256): string = ## Shortcut for `byteutils.toHex(hash.data)` hash.data.toHex func `$`*(h: SomeDistinctHash256): string = $h.Hash256.data.toHex func `$`*(blob: Blob): string = blob.toHex func `$`*(hashOrNum: HashOrNum): string = # It's always obvious which one from the visible length of the string. if hashOrNum.isHash: $hashOrNum.hash else: $hashOrNum.number # ------------------------------------------------------------------------------ # Public debug printing helpers # ------------------------------------------------------------------------------ func traceStep*(request: BlocksRequest): string = var str = if request.reverse: "-" else: "+" if request.skip < high(typeof(request.skip)): return str & $(request.skip + 1) return static($(high(typeof(request.skip)).u256 + 1)) # ------------------------------------------------------------------------------ # End # ------------------------------------------------------------------------------