mirror of
https://github.com/status-im/nimbus-eth1.git
synced 2025-01-30 05:55:30 +00:00
bd42ebb193
* Relocated mothballing (i.e. swap-in preparation) logic details: Mothballing was previously tested & started after downloading account ranges in `range_fetch_accounts`. Whenever current download or healing stops because of a pivot change, swap-in preparation is needed (otherwise some storage slots may get lost when swap-in takes place.) Also, `execSnapSyncAction()` has been moved back to `pivot_helper`. * Reorganised source file directories details: Grouped pivot focused modules into `pivot` directory * Renamed `checkNodes`, `sickSubTries` as `nodes.check`, `nodes.missing` why: Both lists are typically used together as pair. Renaming `sickSubTries` reflects moving away from a healing centric view towards a swap-in attitude. * Multi times coverage recording details: Per pivot account ranges are accumulated into coverage range set. This set fill eventually contain a singe range of account hashes [0..2^256] which amounts to 100% capacity. A counter has been added that is incremented whenever max capacity is reached. The accumulated range is then reset to empty. The effect of this setting is that the coverage can be evenly duplicated. So 200% would not accumulate on a particular region. * Update range length comparisons (mod 2^256) why: A range interval can have sizes 1..2^256 as it cannot be empty by definition. The number of points in a range intervals set can have 0..2^256 points. As the scalar range is a residue class modulo 2^256, the residue class 0 means length 2^256 for a range interval, but can be 0 or 2^256 for the number of points in a range intervals set. * Generalised `hexaryEnvelopeDecompose()` details: Compile the complement of the union of some (processed) intervals and express this complement as a list of envelopes of sub-tries. This facility is directly applicable to swap-in book-keeping. * Re-factor `swapIn()` why: Good idea but baloney implementation. The main algorithm is based on the generalised version of `hexaryEnvelopeDecompose()` which has been derived from this implementation. * Refactor `healAccounts()` using `hexaryEnvelopeDecompose()` as main driver why: Previously, the hexary trie was searched recursively for dangling nodes which has a poor worst case performance already when the trie is reasonably populated. The function `hexaryEnvelopeDecompose()` is a magnitude faster because it does not peruse existing sub-tries in order to find missing nodes although result is not fully compatible with the previous function. So recursive search is used in a limited mode only when the decomposer will not deliver a useful result. * Logging & maintenance fixes details: Preparation for abandoning buddy-global healing variables `node`, `resumeCtx`, and `lockTriePerusal`. These variable are trie-perusal centric which will be run on the back burner in favour of `hexaryEnvelopeDecompose()` which is used for accounts healing already.
284 lines
7.8 KiB
Nim
284 lines
7.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.
|
|
|
|
## Check/analyse DB completeness
|
|
## =============================
|
|
|
|
import
|
|
chronicles,
|
|
eth/[common, p2p, trie/trie_defs],
|
|
stew/keyed_queue,
|
|
../../../../utils/prettify,
|
|
../../../sync_desc,
|
|
"../.."/[range_desc, worker_desc],
|
|
"."/[hexary_desc, hexary_error, hexary_inspect,
|
|
snapdb_accounts, snapdb_storage_slots]
|
|
|
|
{.push raises: [Defect].}
|
|
|
|
logScope:
|
|
topics = "snap-db"
|
|
|
|
const
|
|
extraTraceMessages = false or true
|
|
## Enabled additional logging noise
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Private logging helpers
|
|
# ------------------------------------------------------------------------------
|
|
|
|
template logTxt(info: static[string]): static[string] =
|
|
"Check DB " & info
|
|
|
|
proc accountsCtx(
|
|
buddy: SnapBuddyRef;
|
|
env: SnapPivotRef;
|
|
): string =
|
|
let
|
|
ctx = buddy.ctx
|
|
"{" &
|
|
"pivot=" & "#" & $env.stateHeader.blockNumber & "," &
|
|
"nAccounts=" & $env.nAccounts & "," &
|
|
("covered=" & env.fetchAccounts.processed.fullFactor.toPC(0) & "/" &
|
|
ctx.data.coveredAccounts.fullFactor.toPC(0)) & "," &
|
|
"nNodesCheck=" & $env.fetchAccounts.nodes.check.len & "," &
|
|
"nNodesMissing=" & $env.fetchAccounts.nodes.missing.len & "}"
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Private helpers
|
|
# ------------------------------------------------------------------------------
|
|
|
|
proc storageSlotsCtx(
|
|
buddy: SnapBuddyRef;
|
|
storageRoot: Hash256;
|
|
env: SnapPivotRef;
|
|
): string =
|
|
let
|
|
ctx = buddy.ctx
|
|
rc = block:
|
|
let rcx = env.fetchStorageFull.eq(storageRoot)
|
|
if rcx.isOk: rcx
|
|
else: env.fetchStoragePart.eq(storageRoot)
|
|
if rc.isErr:
|
|
return "n/a"
|
|
let
|
|
data = rc.value
|
|
slots = data.slots
|
|
result = "{" &
|
|
"inherit=" & (if data.inherit: "t" else: "f") & ","
|
|
if not slots.isNil:
|
|
result &= "" &
|
|
"covered=" & slots.processed.fullFactor.toPC(0) &
|
|
"nNodesCheck=" & $slots.nodes.check.len & "," &
|
|
"nNodesMissing=" & $slots.nodes.missing.len
|
|
result &= "}"
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Private functions
|
|
# ------------------------------------------------------------------------------
|
|
|
|
proc checkStorageSlotsTrie(
|
|
buddy: SnapBuddyRef;
|
|
accKey: NodeKey;
|
|
storageRoot: Hash256;
|
|
env: SnapPivotRef;
|
|
): Result[bool,HexaryError] =
|
|
## Check whether a storage slots hexary trie is complete.
|
|
let
|
|
ctx = buddy.ctx
|
|
db = ctx.data.snapDb
|
|
peer = buddy.peer
|
|
|
|
rc = db.inspectStorageSlotsTrie(peer, accKey, storageRoot)
|
|
|
|
if rc.isErr:
|
|
return err(rc.error)
|
|
|
|
ok(rc.value.dangling.len == 0)
|
|
|
|
|
|
iterator accountsWalk(
|
|
buddy: SnapBuddyRef;
|
|
env: SnapPivotRef;
|
|
): (NodeKey,Account,HexaryError) =
|
|
let
|
|
ctx = buddy.ctx
|
|
db = ctx.data.snapDb
|
|
peer = buddy.peer
|
|
stateRoot = env.stateHeader.stateRoot
|
|
walk = SnapDbAccountsRef.init(db, stateRoot, peer)
|
|
|
|
var
|
|
accKey = NodeKey.default
|
|
count = 0
|
|
runOk = true
|
|
|
|
while runOk:
|
|
count.inc
|
|
|
|
let nextKey = block:
|
|
let rc = walk.nextAccountsChainDbKey(accKey)
|
|
if rc.isErr:
|
|
if rc.error != AccountNotFound:
|
|
error logTxt "accounts walk stopped", peer,
|
|
account=accKey.to(NodeTag),
|
|
ctx=buddy.accountsCtx(env), count, reason=rc.error
|
|
runOk = false
|
|
continue
|
|
rc.value
|
|
|
|
accKey = nextKey
|
|
|
|
let accData = block:
|
|
let rc = walk.getAccountsData(accKey, persistent = true)
|
|
if rc.isErr:
|
|
error logTxt "accounts walk error", peer, account=accKey,
|
|
ctx=buddy.accountsCtx(env), count, error=rc.error
|
|
runOk = false
|
|
continue
|
|
rc.value
|
|
|
|
yield (accKey, accData, NothingSerious)
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# Public functions
|
|
# ------------------------------------------------------------------------------
|
|
|
|
proc checkAccountsTrieIsComplete*(
|
|
buddy: SnapBuddyRef;
|
|
env: SnapPivotRef;
|
|
): bool =
|
|
## Check whether accounts hexary trie is complete
|
|
let
|
|
ctx = buddy.ctx
|
|
peer = buddy.peer
|
|
db = ctx.data.snapDb
|
|
rootKey = env.stateHeader.stateRoot.to(NodeKey)
|
|
var
|
|
error: HexaryError
|
|
|
|
try:
|
|
let stats = db.getAccountFn.hexaryInspectTrie(rootKey)
|
|
if not stats.stopped:
|
|
return stats.dangling.len == 0
|
|
|
|
error = TrieLoopAlert
|
|
except RlpError:
|
|
error = RlpEncoding
|
|
except KeyError as e:
|
|
raiseAssert "Not possible @ importRawAccountNodes: " & e.msg
|
|
except Exception as e:
|
|
raiseAssert "Ooops checkAccountsTrieIsComplete(): name=" &
|
|
$e.name & " msg=" & e.msg
|
|
|
|
error logTxt "accounts health check failed", peer,
|
|
ctx=buddy.accountsCtx(env), error
|
|
return false
|
|
|
|
|
|
proc checkAccountsListOk*(
|
|
buddy: SnapBuddyRef;
|
|
env: SnapPivotRef;
|
|
noisy = false;
|
|
): bool =
|
|
## Loop over accounts, returns `false` for some error.
|
|
let
|
|
ctx = buddy.ctx
|
|
peer = buddy.peer
|
|
var
|
|
accounts = 0
|
|
storage = 0
|
|
nextMsgThresh = 1
|
|
|
|
for (key,accData,error) in buddy.accountsWalk(env):
|
|
|
|
if error != NothingSerious:
|
|
error logTxt "accounts loop stopped", peer, ctx=buddy.accountsCtx(env),
|
|
accounts, storage, error
|
|
return false
|
|
|
|
accounts.inc
|
|
if accData.storageRoot != emptyRlpHash:
|
|
storage.inc
|
|
|
|
when extraTraceMessages:
|
|
if noisy and nextMsgThresh <= accounts:
|
|
debug logTxt "accounts loop check point", peer,
|
|
ctx=buddy.accountsCtx(env), accounts, storage
|
|
nextMsgThresh *= 2
|
|
|
|
when extraTraceMessages:
|
|
let isComplete = buddy.checkAccountsTrieIsComplete(env)
|
|
debug logTxt "accounts list report", peer, ctx=buddy.accountsCtx(env),
|
|
accounts, storage, isComplete
|
|
|
|
true
|
|
|
|
|
|
proc checkStorageSlotsTrieIsComplete*(
|
|
buddy: SnapBuddyRef;
|
|
accKey: NodeKey;
|
|
storageRoot: Hash256;
|
|
env: SnapPivotRef;
|
|
): bool =
|
|
## Check whether a storage slots hexary trie is complete.
|
|
let
|
|
peer = buddy.peer
|
|
rc = buddy.checkStorageSlotsTrie(accKey, storageRoot, env)
|
|
if rc.isOk:
|
|
return rc.value
|
|
|
|
when extraTraceMessages:
|
|
let nStoQueue = env.fetchStorageFull.len + env.fetchStoragePart.len
|
|
debug logTxt "atorage slots health check failed", peer, nStoQueue,
|
|
ctx=buddy.storageSlotsCtx(storageRoot, env), error=rc.error
|
|
|
|
proc checkStorageSlotsTrieIsComplete*(
|
|
buddy: SnapBuddyRef;
|
|
env: SnapPivotRef;
|
|
): bool =
|
|
## Check for all accounts thye whether storage slot hexary tries are complete.
|
|
let
|
|
ctx = buddy.ctx
|
|
peer = buddy.peer
|
|
var
|
|
accounts = 0
|
|
incomplete = 0
|
|
complete = 0
|
|
|
|
for (accKey,accData,error) in buddy.accountsWalk(env):
|
|
if error != NothingSerious:
|
|
let nStoQueue = env.fetchStorageFull.len + env.fetchStoragePart.len
|
|
error logTxt "atorage slots accounts loop stopped", peer, nStoQueue,
|
|
accounts, incomplete, complete, error
|
|
return false
|
|
|
|
accounts.inc
|
|
let storageRoot = accData.storageRoot
|
|
if storageRoot == emptyRlpHash:
|
|
continue
|
|
|
|
let rc = buddy.checkStorageSlotsTrie(accKey, storageRoot, env)
|
|
if rc.isOk and rc.value:
|
|
complete.inc
|
|
else:
|
|
incomplete.inc
|
|
|
|
when extraTraceMessages:
|
|
let nStoQueue = env.fetchStorageFull.len + env.fetchStoragePart.len
|
|
debug logTxt "storage slots report", peer, ctx=buddy.accountsCtx(env),
|
|
nStoQueue, accounts, incomplete, complete
|
|
|
|
0 < accounts and incomplete == 0
|
|
|
|
# ------------------------------------------------------------------------------
|
|
# End
|
|
# ------------------------------------------------------------------------------
|