mirror of
https://github.com/status-im/nimbus-eth1.git
synced 2025-02-06 09:13:46 +00:00
fe3a6d67c6
* Clean up some function prototypes why: Simplify polymorphic prototype variances for easier maintenance. * Fix fringe condition crash when importing bogus RLP node why: Accessing non-list RLP entry as a list causes `Defect` * Fix left boundary proof at range extractor why: Was insufficient. The main problem was that there was no unit test for the validity of the generated left boundary. * Handle incomplete left boundary proofs early why: Attempt to do it later leads to overly complex code in order to prevent looping when the same peer repeats to send the same incomplete proof. Contrary, gaps in the leaf sequence can be handled gracefully with registering the gaps * Implement a manual pivot setup mechanism for snap sync why: For a test scenario it is convenient to set the pivot to something lower than the beacon header from the consensus layer. This does not need rely on any RPC mechanism. details: The file containing the pivot specs is specified by the `--sync-ctrl-file` option. It is regularly parsed for updates. * Fix calculation error why: Prevent from calculating negative square root
88 lines
2.8 KiB
Nim
88 lines
2.8 KiB
Nim
# Nimbus
|
|
# Copyright (c) 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.
|
|
|
|
{.push raises: [].}
|
|
|
|
import
|
|
std/[os, strutils],
|
|
chronicles,
|
|
eth/[common, p2p]
|
|
|
|
logScope:
|
|
topics = "sync-ctrl"
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Private functions
|
|
# ------------------------------------------------------------------------------
|
|
|
|
proc getDataLine(name: string): string {.gcsafe, raises: [IOError].} =
|
|
if name.fileExists:
|
|
let file = name.open
|
|
defer: file.close
|
|
return (file.readAll.splitLines)[0].strip
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Public functions
|
|
# ------------------------------------------------------------------------------
|
|
|
|
proc syncCtrlBlockNumberFromFile*(
|
|
fileName: Option[string];
|
|
): Result[BlockNumber,void] =
|
|
## Returns a block number from the file name argument `fileName`. The first
|
|
## line of the file is parsed as a decimal encoded block number.
|
|
if fileName.isSome:
|
|
let file = fileName.get
|
|
try:
|
|
let data = file.getDataLine
|
|
if 0 < data.len:
|
|
let num = parse(data,UInt256)
|
|
return ok(num.toBlockNumber)
|
|
except CatchableError as e:
|
|
let
|
|
name {.used.} = $e.name
|
|
msg {.used.} = e.msg
|
|
debug "Exception while parsing block number", file, name, msg
|
|
err()
|
|
|
|
proc syncCtrlHashOrBlockNumFromFile*(
|
|
fileName: Option[string];
|
|
): Result[HashOrNum,void] =
|
|
## Returns a block number or a hash from the file name argument `fileName`.
|
|
## A block number is decimal encoded and a hash is expexted to be a 66 hex
|
|
## digits string startnib wiyh `0x`.
|
|
if fileName.isSome:
|
|
let file = fileName.get
|
|
|
|
# Parse value dump and fetch a header from the peer (if any)
|
|
try:
|
|
let data = file.getDataLine
|
|
if 0 < data.len:
|
|
if 66 == data.len:
|
|
let hash = HashOrNum(
|
|
isHash: true,
|
|
hash: Hash256(
|
|
data: UInt256.fromHex(data).toBytesBE))
|
|
return ok(hash)
|
|
else:
|
|
let num = HashOrNum(
|
|
isHash: false,
|
|
number: parse(data,UInt256))
|
|
return ok(num)
|
|
except CatchableError as e:
|
|
let
|
|
name {.used.} = $e.name
|
|
msg {.used.} = e.msg
|
|
debug "Exception while parsing hash or block number", file, name, msg
|
|
err()
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# End
|
|
# ------------------------------------------------------------------------------
|