-
Notifications
You must be signed in to change notification settings - Fork 512
/
Copy pathBlockchainProcessor.cs
833 lines (708 loc) · 33.4 KB
/
BlockchainProcessor.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
// SPDX-FileCopyrightText: 2022 Demerzel Solutions Limited
// SPDX-License-Identifier: LGPL-3.0-only
using System;
using System.Diagnostics;
using System.Diagnostics.CodeAnalysis;
using System.Linq;
using System.Runtime.CompilerServices;
using System.Threading;
using System.Threading.Channels;
using System.Threading.Tasks;
using Nethermind.Blockchain;
using Nethermind.Blockchain.Find;
using Nethermind.Core;
using Nethermind.Core.Attributes;
using Nethermind.Core.Collections;
using Nethermind.Core.Crypto;
using Nethermind.Core.Extensions;
using Nethermind.Core.Threading;
using Nethermind.Evm.Tracing;
using Nethermind.Evm.Tracing.GethStyle;
using Nethermind.Evm.Tracing.ParityStyle;
using Nethermind.Int256;
using Nethermind.Logging;
using Nethermind.State;
using Metrics = Nethermind.Blockchain.Metrics;
namespace Nethermind.Consensus.Processing;
public sealed class BlockchainProcessor : IBlockchainProcessor, IBlockProcessingQueue
{
public int SoftMaxRecoveryQueueSizeInTx = 10000; // adjust based on tx or gas
public const int MaxProcessingQueueSize = 2048; // adjust based on tx or gas
private static readonly AsyncLocal<bool> _isMainProcessingThread = new();
public static bool IsMainProcessingThread => _isMainProcessingThread.Value;
public bool IsMainProcessor { get; init; }
public ITracerBag Tracers => _compositeBlockTracer;
private readonly IBlockProcessor _blockProcessor;
private readonly IBlockPreprocessorStep _recoveryStep;
private readonly IStateReader _stateReader;
private readonly Options _options;
private readonly IBlockTree _blockTree;
private readonly ILogger _logger;
private readonly Channel<BlockRef> _recoveryQueue = Channel.CreateUnbounded<BlockRef>(
new UnboundedChannelOptions()
{
// Optimize for single reader concurrency
SingleReader = true,
});
private readonly Channel<BlockRef> _blockQueue = Channel.CreateBounded<BlockRef>(
new BoundedChannelOptions(MaxProcessingQueueSize)
{
// Optimize for single reader concurrency
SingleReader = true,
// Optimize for single writer concurrency (recovery queue)
SingleWriter = true,
});
private bool _recoveryComplete = false;
private int _queueCount;
private readonly ProcessingStats _stats;
private CancellationTokenSource? _loopCancellationSource;
private Task? _recoveryTask;
private Task? _processorTask;
private DateTime _lastProcessedBlock;
private int _currentRecoveryQueueSize;
private bool _isProcessingBlock;
private const int MaxBranchSize = 8192;
private readonly CompositeBlockTracer _compositeBlockTracer = new();
private readonly Stopwatch _stopwatch = new();
public event EventHandler<IBlockchainProcessor.InvalidBlockEventArgs>? InvalidBlock;
public event EventHandler<BlockStatistics>? NewProcessingStatistics;
/// <summary>
///
/// </summary>
/// <param name="blockTree"></param>
/// <param name="blockProcessor"></param>
/// <param name="recoveryStep"></param>
/// <param name="stateReader"></param>
/// <param name="logManager"></param>
/// <param name="options"></param>
public BlockchainProcessor(
IBlockTree? blockTree,
IBlockProcessor? blockProcessor,
IBlockPreprocessorStep? recoveryStep,
IStateReader stateReader,
ILogManager? logManager,
Options options)
{
_logger = logManager?.GetClassLogger() ?? throw new ArgumentNullException(nameof(logManager));
_blockTree = blockTree ?? throw new ArgumentNullException(nameof(blockTree));
_blockProcessor = blockProcessor ?? throw new ArgumentNullException(nameof(blockProcessor));
_recoveryStep = recoveryStep ?? throw new ArgumentNullException(nameof(recoveryStep));
_stateReader = stateReader ?? throw new ArgumentNullException(nameof(stateReader));
_options = options;
_blockTree.NewBestSuggestedBlock += OnNewBestBlock;
_blockTree.NewHeadBlock += OnNewHeadBlock;
_stats = new ProcessingStats(stateReader, _logger);
_loopCancellationSource = new CancellationTokenSource();
_stats.NewProcessingStatistics += OnNewProcessingStatistics;
}
private void OnNewProcessingStatistics(object? sender, BlockStatistics stats)
=> NewProcessingStatistics?.Invoke(sender, stats);
private void OnNewHeadBlock(object? sender, BlockEventArgs e)
{
_lastProcessedBlock = DateTime.UtcNow;
}
private void OnNewBestBlock(object sender, BlockEventArgs blockEventArgs)
{
ProcessingOptions options = ProcessingOptions.None;
if (_options.StoreReceiptsByDefault)
{
options |= ProcessingOptions.StoreReceipts;
}
if (blockEventArgs.Block is not null)
{
Enqueue(blockEventArgs.Block, options);
}
}
public void Enqueue(Block block, ProcessingOptions processingOptions)
{
if (_logger.IsTrace) _logger.Trace($"Enqueuing a new block {block.ToString(Block.Format.Short)} for processing.");
int currentRecoveryQueueSize = Interlocked.Add(ref _currentRecoveryQueueSize, block.Transactions.Length);
Hash256? blockHash = block.Hash!;
BlockRef blockRef = currentRecoveryQueueSize >= SoftMaxRecoveryQueueSizeInTx
? new BlockRef(blockHash, processingOptions)
: new BlockRef(block, processingOptions);
if (!_recoveryComplete)
{
Interlocked.Increment(ref _queueCount);
try
{
_recoveryQueue.Writer.TryWrite(blockRef);
if (_logger.IsTrace) _logger.Trace($"A new block {block.ToString(Block.Format.Short)} enqueued for processing.");
}
catch (Exception e)
{
Interlocked.Decrement(ref _queueCount);
BlockRemoved?.Invoke(this, new BlockRemovedEventArgs(blockHash, ProcessingResult.QueueException, e));
if (e is not InvalidOperationException || !_recoveryComplete)
{
throw;
}
}
}
}
public void Start()
{
_loopCancellationSource ??= new CancellationTokenSource();
_recoveryTask = RunRecovery();
_processorTask = RunProcessing();
}
public async Task StopAsync(bool processRemainingBlocks = false)
{
_recoveryComplete = true;
if (processRemainingBlocks)
{
_recoveryQueue.Writer.TryComplete();
await (_recoveryTask ?? Task.CompletedTask);
_blockQueue.Writer.TryComplete();
}
else
{
CancellationTokenExtensions.CancelDisposeAndClear(ref _loopCancellationSource);
_recoveryQueue.Writer.TryComplete();
_blockQueue.Writer.TryComplete();
}
await Task.WhenAll(_recoveryTask ?? Task.CompletedTask, _processorTask ?? Task.CompletedTask);
if (_logger.IsInfo) _logger.Info("Blockchain Processor shutdown complete.. please wait for all components to close");
}
private async Task RunRecovery()
{
try
{
await RunRecoveryLoop();
if (_logger.IsDebug) _logger.Debug("Sender address recovery complete.");
}
catch (OperationCanceledException)
{
if (_logger.IsDebug) _logger.Debug("Sender address recovery stopped.");
}
catch (Exception ex)
{
if (_logger.IsError) _logger.Error("Sender address recovery encountered an exception.", ex);
}
}
private async Task RunRecoveryLoop()
{
void DecrementQueue(Hash256 blockHash, ProcessingResult processingResult, Exception? exception = null)
{
Interlocked.Decrement(ref _queueCount);
BlockRemoved?.Invoke(this, new BlockRemovedEventArgs(blockHash, processingResult, exception));
FireProcessingQueueEmpty();
}
if (_logger.IsDebug) _logger.Debug($"Starting recovery loop - {_blockQueue.Reader.Count} blocks waiting in the queue.");
_lastProcessedBlock = DateTime.UtcNow;
await foreach (BlockRef blockRef in _recoveryQueue.Reader.ReadAllAsync(CancellationToken))
{
try
{
if (blockRef.Resolve(_blockTree))
{
Interlocked.Add(ref _currentRecoveryQueueSize, -blockRef.Block!.Transactions.Length);
if (_logger.IsTrace) _logger.Trace($"Recovering addresses for block {blockRef.BlockHash}.");
_recoveryStep.RecoverData(blockRef.Block);
try
{
await _blockQueue.Writer.WriteAsync(blockRef);
}
catch (Exception e) when (e is not OperationCanceledException)
{
DecrementQueue(blockRef.BlockHash, ProcessingResult.QueueException, e);
if (e is InvalidOperationException)
{
if (_logger.IsDebug) _logger.Debug($"Recovery loop stopping.");
return;
}
throw;
}
}
else
{
DecrementQueue(blockRef.BlockHash, ProcessingResult.MissingBlock);
if (_logger.IsTrace) _logger.Trace("Block was removed from the DB and cannot be recovered (it belonged to an invalid branch). Skipping.");
}
}
catch (Exception e)
{
DecrementQueue(blockRef.BlockHash, ProcessingResult.Exception, e);
throw;
}
}
}
private CancellationToken CancellationToken
=> _loopCancellationSource?.Token ?? CancellationTokenExtensions.AlreadyCancelledToken;
private async Task RunProcessing()
{
_isMainProcessingThread.Value = IsMainProcessor;
try
{
await RunProcessingLoop();
if (_logger.IsDebug) _logger.Debug($"{nameof(BlockchainProcessor)} complete.");
}
catch (OperationCanceledException)
{
if (_logger.IsDebug) _logger.Debug($"{nameof(BlockchainProcessor)} stopped.");
}
catch (Exception ex)
{
if (_logger.IsError) _logger.Error($"{nameof(BlockchainProcessor)} encountered an exception.", ex);
}
}
private async Task RunProcessingLoop()
{
if (_logger.IsDebug) _logger.Debug($"Starting block processor - {_blockQueue.Reader.Count} blocks waiting in the queue.");
FireProcessingQueueEmpty();
GCScheduler.Instance.SwitchOnBackgroundGC(0);
await foreach (BlockRef blockRef in _blockQueue.Reader.ReadAllAsync(CancellationToken))
{
using var handle = Thread.CurrentThread.BoostPriorityHighest();
// Have block, switch off background GC timer
GCScheduler.Instance.SwitchOffBackgroundGC(_blockQueue.Reader.Count);
_isProcessingBlock = true;
try
{
if (blockRef.IsInDb || blockRef.Block is null)
{
BlockRemoved?.Invoke(this, new BlockRemovedEventArgs(blockRef.BlockHash, ProcessingResult.MissingBlock));
throw new InvalidOperationException("Block processing expects only resolved blocks");
}
Block block = blockRef.Block;
if (_logger.IsTrace) _logger.Trace($"Processing block {block.ToString(Block.Format.Short)}).");
_stats.Start();
Block processedBlock = Process(block, blockRef.ProcessingOptions, _compositeBlockTracer.GetTracer(), CancellationToken, out string? error);
if (processedBlock is null)
{
if (_logger.IsTrace) _logger.Trace($"Failed / skipped processing {block.ToString(Block.Format.Full)}");
BlockRemoved?.Invoke(this, new BlockRemovedEventArgs(blockRef.BlockHash, ProcessingResult.ProcessingError, error));
}
else
{
if (_logger.IsTrace) _logger.Trace($"Processed block {block.ToString(Block.Format.Full)}");
BlockRemoved?.Invoke(this, new BlockRemovedEventArgs(blockRef.BlockHash, ProcessingResult.Success));
}
}
catch (Exception exception) when (exception is not OperationCanceledException)
{
if (_logger.IsWarn) _logger.Warn($"Processing block failed. Block: {blockRef}, Exception: {exception}");
BlockRemoved?.Invoke(this, new BlockRemovedEventArgs(blockRef.BlockHash, ProcessingResult.Exception, exception));
}
finally
{
_isProcessingBlock = false;
Interlocked.Decrement(ref _queueCount);
}
if (_logger.IsTrace) _logger.Trace($"Now {_blockQueue.Reader.Count} blocks waiting in the queue.");
FireProcessingQueueEmpty();
GCScheduler.Instance.SwitchOnBackgroundGC(_blockQueue.Reader.Count);
}
if (_logger.IsInfo) _logger.Info("Block processor queue stopped.");
}
private void FireProcessingQueueEmpty()
{
if (((IBlockProcessingQueue)this).IsEmpty)
{
ProcessingQueueEmpty?.Invoke(this, EventArgs.Empty);
}
}
public event EventHandler? ProcessingQueueEmpty;
public event EventHandler<BlockRemovedEventArgs>? BlockRemoved;
int IBlockProcessingQueue.Count => _queueCount;
public Block? Process(Block suggestedBlock, ProcessingOptions options, IBlockTracer tracer, CancellationToken token = default) =>
Process(suggestedBlock, options, tracer, token, out _);
public Block? Process(Block suggestedBlock, ProcessingOptions options, IBlockTracer tracer, CancellationToken token, out string? error)
{
error = null;
if (!RunSimpleChecksAheadOfProcessing(suggestedBlock, options))
{
return null;
}
UInt256 totalDifficulty = suggestedBlock.TotalDifficulty ?? 0;
if (_logger.IsTrace) _logger.Trace($"Total difficulty of block {suggestedBlock.ToString(Block.Format.Short)} is {totalDifficulty}");
bool shouldProcess =
suggestedBlock.IsGenesis
|| _blockTree.IsBetterThanHead(suggestedBlock.Header)
|| options.ContainsFlag(ProcessingOptions.ForceProcessing);
if (!shouldProcess)
{
if (_logger.IsDebug) _logger.Debug($"Skipped processing of {suggestedBlock.ToString(Block.Format.FullHashAndNumber)}, Head = {_blockTree.Head?.Header?.ToString(BlockHeader.Format.Short)}, total diff = {totalDifficulty}, head total diff = {_blockTree.Head?.TotalDifficulty}");
return null;
}
bool readonlyChain = options.ContainsFlag(ProcessingOptions.ReadOnlyChain);
if (!readonlyChain) _stats.CaptureStartStats();
using ProcessingBranch processingBranch = PrepareProcessingBranch(suggestedBlock, options);
PrepareBlocksToProcess(suggestedBlock, options, processingBranch);
_stopwatch.Restart();
Block[]? processedBlocks = ProcessBranch(processingBranch, options, tracer, token, out error);
_stopwatch.Stop();
if (processedBlocks is null)
{
return null;
}
Block? lastProcessed = null;
if (processedBlocks.Length > 0)
{
lastProcessed = processedBlocks[^1];
if (_logger.IsTrace) _logger.Trace($"Setting total on last processed to {lastProcessed.ToString(Block.Format.Short)}");
lastProcessed.Header.TotalDifficulty = suggestedBlock.TotalDifficulty;
}
else
{
if (_logger.IsDebug) _logger.Debug($"Skipped processing of {suggestedBlock.ToString(Block.Format.FullHashAndNumber)}, last processed is null: {true}, processedBlocks.Length: {processedBlocks.Length}");
}
if (!readonlyChain)
{
long blockProcessingTimeInMicrosecs = _stopwatch.ElapsedMicroseconds();
Metrics.LastBlockProcessingTimeInMs = blockProcessingTimeInMicrosecs / 1000;
int blockQueueCount = _blockQueue.Reader.Count;
Metrics.RecoveryQueueSize = Math.Max(_queueCount - blockQueueCount - (_isProcessingBlock ? 1 : 0), 0);
Metrics.ProcessingQueueSize = blockQueueCount;
_stats.UpdateStats(lastProcessed, processingBranch.Root, blockProcessingTimeInMicrosecs);
}
bool updateHead = !options.ContainsFlag(ProcessingOptions.DoNotUpdateHead);
if (updateHead)
{
if (_logger.IsTrace) _logger.Trace($"Updating main chain: {lastProcessed}, blocks count: {processedBlocks.Length}");
_blockTree.UpdateMainChain(processingBranch.Blocks, true);
}
if ((options & ProcessingOptions.MarkAsProcessed) == ProcessingOptions.MarkAsProcessed)
{
if (_logger.IsTrace) _logger.Trace($"Marked blocks as processed {lastProcessed}, blocks count: {processedBlocks.Length}");
_blockTree.MarkChainAsProcessed(processingBranch.Blocks);
}
if (!readonlyChain)
{
Metrics.BestKnownBlockNumber = _blockTree.BestKnownNumber;
}
return lastProcessed;
}
public bool IsProcessingBlocks(ulong? maxProcessingInterval) =>
_processorTask?.IsCompleted == false && _recoveryTask?.IsCompleted == false &&
// user does not setup interval and we cannot set interval time based on chainspec
(maxProcessingInterval is null || _lastProcessedBlock.AddSeconds(maxProcessingInterval.Value) > DateTime.UtcNow);
private void TraceFailingBranch(in ProcessingBranch processingBranch, ProcessingOptions options, IBlockTracer blockTracer, DumpOptions dumpType)
{
if ((_options.DumpOptions & dumpType) != 0)
{
try
{
_blockProcessor.Process(
processingBranch.Root,
processingBranch.BlocksToProcess,
options,
blockTracer);
BlockTraceDumper.LogDiagnosticTrace(blockTracer, processingBranch.BlocksToProcess, _logger);
}
catch (InvalidBlockException ex)
{
BlockTraceDumper.LogDiagnosticTrace(blockTracer, ex.InvalidBlock.Hash!, _logger);
}
catch (Exception ex)
{
BlockTraceDumper.LogTraceFailure(blockTracer, processingBranch.Root, ex, _logger);
}
}
}
private Block[]? ProcessBranch(in ProcessingBranch processingBranch, ProcessingOptions options, IBlockTracer tracer, CancellationToken token, out string? error)
{
void DeleteInvalidBlocks(in ProcessingBranch processingBranch, Hash256 invalidBlockHash)
{
for (int i = 0; i < processingBranch.BlocksToProcess.Count; i++)
{
if (processingBranch.BlocksToProcess[i].Hash == invalidBlockHash)
{
_blockTree.DeleteInvalidBlock(processingBranch.BlocksToProcess[i]);
if (_logger.IsDebug) _logger.Debug($"Skipped processing of {processingBranch.BlocksToProcess[^1].ToString(Block.Format.FullHashAndNumber)} because of {processingBranch.BlocksToProcess[i].ToString(Block.Format.FullHashAndNumber)} is invalid");
}
}
}
Hash256? invalidBlockHash = null;
Block[]? processedBlocks;
try
{
processedBlocks = _blockProcessor.Process(
processingBranch.Root,
processingBranch.BlocksToProcess,
options,
tracer,
token);
error = null;
}
catch (InvalidBlockException ex)
{
if (_logger.IsWarn) _logger.Warn($"Issue processing block {ex.InvalidBlock} {ex}");
invalidBlockHash = ex.InvalidBlock.Hash;
error = ex.Message;
Block? invalidBlock = processingBranch.BlocksToProcess.FirstOrDefault(b => b.Hash == invalidBlockHash);
if (invalidBlock is not null)
{
Metrics.BadBlocks++;
if (ex.InvalidBlock.IsByNethermindNode())
{
Metrics.BadBlocksByNethermindNodes++;
}
InvalidBlock?.Invoke(this, new IBlockchainProcessor.InvalidBlockEventArgs { InvalidBlock = invalidBlock, });
BlockTraceDumper.LogDiagnosticRlp(invalidBlock, _logger,
(_options.DumpOptions & DumpOptions.Rlp) != 0,
(_options.DumpOptions & DumpOptions.RlpLog) != 0);
TraceFailingBranch(
processingBranch,
options,
new BlockReceiptsTracer(),
DumpOptions.Receipts);
TraceFailingBranch(
processingBranch,
options,
new ParityLikeBlockTracer(ParityTraceTypes.StateDiff | ParityTraceTypes.Trace),
DumpOptions.Parity);
TraceFailingBranch(
processingBranch,
options,
new GethLikeBlockMemoryTracer(new GethTraceOptions { EnableMemory = true }),
DumpOptions.Geth);
}
processedBlocks = null;
}
finally
{
if (invalidBlockHash is not null && !options.ContainsFlag(ProcessingOptions.ReadOnlyChain))
{
DeleteInvalidBlocks(in processingBranch, invalidBlockHash);
}
}
return processedBlocks;
}
private void PrepareBlocksToProcess(Block suggestedBlock, ProcessingOptions options, ProcessingBranch processingBranch)
{
ArrayPoolList<Block> blocksToProcess = processingBranch.BlocksToProcess;
if (options.ContainsFlag(ProcessingOptions.ForceProcessing))
{
processingBranch.Blocks.Clear(); // TODO: investigate why if we clear it all we need to collect and iterate on all the blocks in PrepareProcessingBranch?
blocksToProcess.Add(suggestedBlock);
}
else
{
foreach (Block block in processingBranch.Blocks)
{
CancellationToken.ThrowIfCancellationRequested();
if (block.Hash is not null && _blockTree.WasProcessed(block.Number, block.Hash))
{
if (_logger.IsInfo) _logger.Info($"Rerunning block after reorg or pruning: {block.ToString(Block.Format.Short)}");
}
blocksToProcess.Add(block);
}
Block firstBlock = blocksToProcess[0];
if (!firstBlock.IsGenesis)
{
BlockHeader? parentOfFirstBlock = _blockTree.FindHeader(firstBlock.ParentHash!, BlockTreeLookupOptions.None) ?? throw new InvalidBlockException(firstBlock, $"Rejected a block from a different fork: {firstBlock.ToString(Block.Format.FullHashAndNumber)}");
if (!_stateReader.HasStateForBlock(parentOfFirstBlock))
{
ThrowOrphanedBlock(firstBlock);
}
}
}
if (_logger.IsTrace) TraceProcessingBlocks(processingBranch, blocksToProcess);
for (int i = 0; i < blocksToProcess.Count; i++)
{
/* this can happen if the block was loaded as an ancestor and did not go through the recovery queue */
_recoveryStep.RecoverData(blocksToProcess[i]);
}
// Uncommon logging and throws
[MethodImpl(MethodImplOptions.NoInlining)]
void TraceProcessingBlocks(ProcessingBranch processingBranch, ArrayPoolList<Block> blocksToProcess)
=> _logger.Trace($"Processing {blocksToProcess.Count} blocks from state root {processingBranch.Root}");
[DoesNotReturn]
[StackTraceHidden]
static void ThrowOrphanedBlock(Block firstBlock)
=> throw new InvalidBlockException(firstBlock, $"Rejected a block that is orphaned: {firstBlock.ToString(Block.Format.FullHashAndNumber)}");
}
private ProcessingBranch PrepareProcessingBranch(Block suggestedBlock, ProcessingOptions options)
{
BlockHeader branchingPoint = null;
ArrayPoolList<Block> blocksToBeAddedToMain = new((int)Reorganization.PersistenceInterval);
bool branchingCondition;
Block toBeProcessed = suggestedBlock;
long iterations = 0;
bool isTrace = _logger.IsTrace;
do
{
iterations++;
if (iterations > MaxBranchSize)
{
ThrowMaxBranchSizeReached();
}
if (!options.ContainsFlag(ProcessingOptions.Trace))
{
blocksToBeAddedToMain.Add(toBeProcessed);
}
if (isTrace) TraceProcessingBlock(suggestedBlock, toBeProcessed);
if (toBeProcessed.IsGenesis)
{
break;
}
branchingPoint = options.ContainsFlag(ProcessingOptions.ForceSameBlock)
? toBeProcessed.Header
: _blockTree.FindParentHeader(toBeProcessed.Header, BlockTreeLookupOptions.TotalDifficultyNotNeeded);
if (branchingPoint is null)
{
// genesis block
break;
}
if (options.ContainsFlag(ProcessingOptions.IgnoreParentNotOnMainChain))
{
break;
}
if (isTrace) TraceParentSearch(toBeProcessed);
toBeProcessed = _blockTree.FindParent(toBeProcessed.Header, BlockTreeLookupOptions.None);
if (isTrace) TraceParentBlock(toBeProcessed);
if (toBeProcessed is null)
{
if (_logger.IsDebug) DebugParentNotFound(suggestedBlock);
break;
}
// generally if we finish fast sync at block, e.g. 8 and then have 6 blocks processed and close Neth
// then on restart we would find 14 as the branch head (since 14 is on the main chain)
// we need to dig deeper to go all the way to the false (reorg boundary) head
// otherwise some nodes would be missing
// we also need to go deeper if we already pruned state for that block
bool notFoundTheBranchingPointYet = !_blockTree.IsMainChain(branchingPoint.Hash!);
bool hasState = toBeProcessed?.StateRoot is null || _stateReader.HasStateForBlock(toBeProcessed.Header);
bool notInForceProcessing = !options.ContainsFlag(ProcessingOptions.ForceProcessing);
branchingCondition =
(notFoundTheBranchingPointYet || !hasState)
&& notInForceProcessing;
if (isTrace) TraceBranchingConditions(branchingPoint, notFoundTheBranchingPointYet, hasState, notInForceProcessing);
} while (branchingCondition);
if (isTrace)
{
TraceBranchingPoint(branchingPoint);
}
Hash256 stateRoot = branchingPoint?.StateRoot;
if (isTrace) TraceStateRootLookup(stateRoot);
if (blocksToBeAddedToMain.Count > 1)
blocksToBeAddedToMain.Reverse();
return new ProcessingBranch(stateRoot, blocksToBeAddedToMain);
// Uncommon logging and throws
[MethodImpl(MethodImplOptions.NoInlining)]
void DebugParentNotFound(Block suggestedBlock)
=> _logger.Debug($"Treating this as fast sync transition for {suggestedBlock.ToString(Block.Format.Short)}");
[MethodImpl(MethodImplOptions.NoInlining)]
void TraceBranchingConditions(BlockHeader branchingPoint, bool notFoundTheBranchingPointYet, bool hasState, bool notInForceProcessing)
{
_logger.Trace(
$" Current branching point: " +
$"{branchingPoint.Number}," +
$" {branchingPoint.Hash} " +
$"TD: {branchingPoint.TotalDifficulty} " +
$"Processing conditions " +
$"notFoundTheBranchingPointYet {notFoundTheBranchingPointYet}, " +
$"hasState: {hasState}, " +
$"notInForceProcessing: {notInForceProcessing}, ");
}
[MethodImpl(MethodImplOptions.NoInlining)]
void TraceBranchingPoint(BlockHeader branchingPoint)
{
if (branchingPoint is not null && branchingPoint.Hash != _blockTree.Head?.Hash)
{
_logger.Trace($"Head block was: {_blockTree.Head?.Header?.ToString(BlockHeader.Format.Short)}");
_logger.Trace($"Branching from: {branchingPoint.ToString(BlockHeader.Format.Short)}");
}
else
{
_logger.Trace(branchingPoint is null ? "Setting as genesis block" : $"Adding on top of {branchingPoint.ToString(BlockHeader.Format.Short)}");
}
}
[MethodImpl(MethodImplOptions.NoInlining)]
void TraceProcessingBlock(Block suggestedBlock, Block toBeProcessed)
=> _logger.Trace($"To be processed (of {suggestedBlock.ToString(Block.Format.Short)}) is {toBeProcessed?.ToString(Block.Format.Short)}");
[MethodImpl(MethodImplOptions.NoInlining)]
void TraceParentSearch(Block toBeProcessed)
=> _logger.Trace($"Finding parent of {toBeProcessed.ToString(Block.Format.Short)}");
[MethodImpl(MethodImplOptions.NoInlining)]
void TraceParentBlock(Block toBeProcessed)
=> _logger.Trace($"Found parent {toBeProcessed?.ToString(Block.Format.Short)}");
[MethodImpl(MethodImplOptions.NoInlining)]
void TraceStateRootLookup(Hash256 stateRoot)
=> _logger.Trace($"State root lookup: {stateRoot}");
[DoesNotReturn]
[StackTraceHidden]
static void ThrowMaxBranchSizeReached()
=> throw new InvalidOperationException($"Maximum size of branch reached ({MaxBranchSize}). This is unexpected.");
}
[Todo(Improve.Refactor, "This probably can be made conditional (in DEBUG only)")]
private bool RunSimpleChecksAheadOfProcessing(Block suggestedBlock, ProcessingOptions options)
{
/* a bit hacky way to get the invalid branch out of the processing loop */
if (suggestedBlock.Number != 0 &&
!_blockTree.IsKnownBlock(suggestedBlock.Number - 1, suggestedBlock.ParentHash))
{
if (_logger.IsDebug) LogUnknownParentBlock(suggestedBlock);
return false;
}
if (suggestedBlock.Header.TotalDifficulty is null)
{
ThrowUnknownTotalDifficulty(suggestedBlock);
}
if (!options.ContainsFlag(ProcessingOptions.NoValidation) && suggestedBlock.Hash is null)
{
ThrowUnknownBlockHash(suggestedBlock);
}
BlockHeader[] uncles = suggestedBlock.Uncles;
for (int i = 0; i < uncles.Length; i++)
{
if (uncles[i].Hash is null)
{
ThrowUnknownUncleHash(suggestedBlock, i);
}
}
return true;
// Uncommon logging and throws
[MethodImpl(MethodImplOptions.NoInlining)]
void LogUnknownParentBlock(Block suggestedBlock)
=> _logger.Debug($"Skipping processing block {suggestedBlock.ToString(Block.Format.FullHashAndNumber)} with unknown parent");
[DoesNotReturn]
[StackTraceHidden]
void ThrowUnknownTotalDifficulty(Block suggestedBlock)
{
if (_logger.IsDebug) _logger.Debug($"Skipping processing block {suggestedBlock.ToString(Block.Format.FullHashAndNumber)} without total difficulty");
throw new InvalidOperationException("Block without total difficulty calculated was suggested for processing");
}
[DoesNotReturn]
[StackTraceHidden]
void ThrowUnknownBlockHash(Block suggestedBlock)
{
if (_logger.IsDebug) _logger.Debug($"Skipping processing block {suggestedBlock.ToString(Block.Format.FullHashAndNumber)} without calculated hash");
throw new InvalidOperationException("Block hash should be known at this stage if running in a validating mode");
}
[DoesNotReturn]
[StackTraceHidden]
void ThrowUnknownUncleHash(Block suggestedBlock, int i)
{
if (_logger.IsDebug) _logger.Debug($"Skipping processing block {suggestedBlock.ToString(Block.Format.FullHashAndNumber)} with null uncle hash ar {i}");
throw new InvalidOperationException($"Uncle's {i} hash is null when processing block");
}
}
public async ValueTask DisposeAsync()
{
_stats.NewProcessingStatistics -= OnNewProcessingStatistics;
_blockTree.NewBestSuggestedBlock -= OnNewBestBlock;
_blockTree.NewHeadBlock -= OnNewHeadBlock;
await StopAsync(processRemainingBlocks: false);
}
[DebuggerDisplay("Root: {Root}, Length: {BlocksToProcess.Count}")]
private readonly ref struct ProcessingBranch(Hash256 root, ArrayPoolList<Block> blocks)
{
public Hash256 Root { get; } = root;
public ArrayPoolList<Block> Blocks { get; } = blocks;
public ArrayPoolList<Block> BlocksToProcess { get; } = new(blocks.Count);
public void Dispose()
{
Blocks.Dispose();
BlocksToProcess.Dispose();
}
}
public class Options
{
public static Options NoReceipts = new() { StoreReceiptsByDefault = true };
public static Options Default = new();
public bool StoreReceiptsByDefault { get; set; } = true;
public DumpOptions DumpOptions { get; set; } = DumpOptions.None;
}
}