-
Notifications
You must be signed in to change notification settings - Fork 710
/
Copy pathbuilder.go
640 lines (567 loc) · 15.5 KB
/
builder.go
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
// Copyright (C) 2019-2024, Ava Labs, Inc. All rights reserved.
// See the file LICENSE for licensing terms.
package builder
import (
"context"
"errors"
"fmt"
"math"
"sync"
"time"
"go.uber.org/zap"
"github.com/ava-labs/avalanchego/ids"
"github.com/ava-labs/avalanchego/snow"
"github.com/ava-labs/avalanchego/snow/consensus/snowman"
"github.com/ava-labs/avalanchego/utils/set"
"github.com/ava-labs/avalanchego/utils/timer/mockable"
"github.com/ava-labs/avalanchego/utils/units"
"github.com/ava-labs/avalanchego/vms/components/gas"
"github.com/ava-labs/avalanchego/vms/platformvm/block"
"github.com/ava-labs/avalanchego/vms/platformvm/state"
"github.com/ava-labs/avalanchego/vms/platformvm/status"
"github.com/ava-labs/avalanchego/vms/platformvm/txs"
"github.com/ava-labs/avalanchego/vms/platformvm/txs/fee"
"github.com/ava-labs/avalanchego/vms/platformvm/txs/mempool"
smblock "github.com/ava-labs/avalanchego/snow/engine/snowman/block"
blockexecutor "github.com/ava-labs/avalanchego/vms/platformvm/block/executor"
txexecutor "github.com/ava-labs/avalanchego/vms/platformvm/txs/executor"
)
const (
// targetBlockSize is maximum number of transaction bytes to place into a
// StandardBlock
targetBlockSize = 128 * units.KiB
// maxTimeToSleep is the maximum time to sleep between checking if a block
// should be produced.
maxTimeToSleep = time.Hour
)
var (
_ Builder = (*builder)(nil)
ErrEndOfTime = errors.New("program time is suspiciously far in the future")
ErrNoPendingBlocks = errors.New("no pending blocks")
errMissingPreferredState = errors.New("missing preferred block state")
errCalculatingNextStakerTime = errors.New("failed calculating next staker time")
)
type Builder interface {
smblock.BuildBlockWithContextChainVM
mempool.Mempool
// StartBlockTimer starts to issue block creation requests to advance the
// chain timestamp.
StartBlockTimer()
// ResetBlockTimer forces the block timer to recalculate when it should
// advance the chain timestamp.
ResetBlockTimer()
// ShutdownBlockTimer stops block creation requests to advance the chain
// timestamp.
//
// Invariant: Assumes the context lock is held when calling.
ShutdownBlockTimer()
// BuildBlock can be called to attempt to create a new block
BuildBlock(context.Context) (snowman.Block, error)
// PackAllBlockTxs returns an array of all txs that could be packed into a
// valid block of infinite size. The returned txs are all verified against
// the preferred state.
//
// Note: This function does not call the consensus engine.
PackAllBlockTxs() ([]*txs.Tx, error)
}
// builder implements a simple builder to convert txs into valid blocks
type builder struct {
mempool.Mempool
txExecutorBackend *txexecutor.Backend
blkManager blockexecutor.Manager
// resetTimer is used to signal that the block builder timer should update
// when it will trigger building of a block.
resetTimer chan struct{}
closed chan struct{}
closeOnce sync.Once
}
func New(
mempool mempool.Mempool,
txExecutorBackend *txexecutor.Backend,
blkManager blockexecutor.Manager,
) Builder {
return &builder{
Mempool: mempool,
txExecutorBackend: txExecutorBackend,
blkManager: blkManager,
resetTimer: make(chan struct{}, 1),
closed: make(chan struct{}),
}
}
func (b *builder) StartBlockTimer() {
go func() {
timer := time.NewTimer(0)
defer timer.Stop()
for {
// Invariant: The [timer] is not stopped.
select {
case <-timer.C:
case <-b.resetTimer:
if !timer.Stop() {
<-timer.C
}
case <-b.closed:
return
}
// Note: Because the context lock is not held here, it is possible
// that [ShutdownBlockTimer] is called concurrently with this
// execution.
for {
duration, err := b.durationToSleep()
if err != nil {
b.txExecutorBackend.Ctx.Log.Error("block builder encountered a fatal error",
zap.Error(err),
)
return
}
if duration > 0 {
timer.Reset(duration)
break
}
// Block needs to be issued to advance time.
b.Mempool.RequestBuildBlock(true /*=emptyBlockPermitted*/)
// Invariant: ResetBlockTimer is guaranteed to be called after
// [durationToSleep] returns a value <= 0. This is because we
// are guaranteed to attempt to build block. After building a
// valid block, the chain will have its preference updated which
// may change the duration to sleep and trigger a timer reset.
select {
case <-b.resetTimer:
case <-b.closed:
return
}
}
}
}()
}
func (b *builder) durationToSleep() (time.Duration, error) {
// Grabbing the lock here enforces that this function is not called mid-way
// through modifying of the state.
b.txExecutorBackend.Ctx.Lock.Lock()
defer b.txExecutorBackend.Ctx.Lock.Unlock()
// If [ShutdownBlockTimer] was called, we want to exit the block timer
// goroutine. We check this with the context lock held because
// [ShutdownBlockTimer] is expected to only be called with the context lock
// held.
select {
case <-b.closed:
return 0, nil
default:
}
preferredID := b.blkManager.Preferred()
preferredState, ok := b.blkManager.GetState(preferredID)
if !ok {
return 0, fmt.Errorf("%w: %s", errMissingPreferredState, preferredID)
}
now := b.txExecutorBackend.Clk.Time()
maxTimeToAwake := now.Add(maxTimeToSleep)
nextStakerChangeTime, err := state.GetNextStakerChangeTime(
b.txExecutorBackend.Config.ValidatorFeeConfig,
preferredState,
maxTimeToAwake,
)
if err != nil {
return 0, fmt.Errorf("%w of %s: %w", errCalculatingNextStakerTime, preferredID, err)
}
return nextStakerChangeTime.Sub(now), nil
}
func (b *builder) ResetBlockTimer() {
// Ensure that the timer will be reset at least once.
select {
case b.resetTimer <- struct{}{}:
default:
}
}
func (b *builder) ShutdownBlockTimer() {
b.closeOnce.Do(func() {
close(b.closed)
})
}
func (b *builder) BuildBlock(ctx context.Context) (snowman.Block, error) {
return b.BuildBlockWithContext(
ctx,
&smblock.Context{
PChainHeight: 0,
},
)
}
func (b *builder) BuildBlockWithContext(
ctx context.Context,
blockContext *smblock.Context,
) (snowman.Block, error) {
// If there are still transactions in the mempool, then we need to
// re-trigger block building.
defer b.Mempool.RequestBuildBlock(false /*=emptyBlockPermitted*/)
b.txExecutorBackend.Ctx.Log.Debug("starting to attempt to build a block")
// Get the block to build on top of and retrieve the new block's context.
preferredID := b.blkManager.Preferred()
preferred, err := b.blkManager.GetBlock(preferredID)
if err != nil {
return nil, err
}
nextHeight := preferred.Height() + 1
preferredState, ok := b.blkManager.GetState(preferredID)
if !ok {
return nil, fmt.Errorf("%w: %s", state.ErrMissingParentState, preferredID)
}
timestamp, timeWasCapped, err := state.NextBlockTime(
b.txExecutorBackend.Config.ValidatorFeeConfig,
preferredState,
b.txExecutorBackend.Clk,
)
if err != nil {
return nil, fmt.Errorf("could not calculate next staker change time: %w", err)
}
statelessBlk, err := buildBlock(
ctx,
b,
preferredID,
nextHeight,
timestamp,
timeWasCapped,
preferredState,
blockContext.PChainHeight,
)
if err != nil {
return nil, err
}
return b.blkManager.NewBlock(statelessBlk), nil
}
func (b *builder) PackAllBlockTxs() ([]*txs.Tx, error) {
preferredID := b.blkManager.Preferred()
preferredState, ok := b.blkManager.GetState(preferredID)
if !ok {
return nil, fmt.Errorf("%w: %s", errMissingPreferredState, preferredID)
}
timestamp, _, err := state.NextBlockTime(
b.txExecutorBackend.Config.ValidatorFeeConfig,
preferredState,
b.txExecutorBackend.Clk,
)
if err != nil {
return nil, fmt.Errorf("could not calculate next staker change time: %w", err)
}
recommendedPChainHeight, err := b.txExecutorBackend.Ctx.ValidatorState.GetMinimumHeight(context.TODO())
if err != nil {
return nil, err
}
if !b.txExecutorBackend.Config.UpgradeConfig.IsEtnaActivated(timestamp) {
return packDurangoBlockTxs(
context.TODO(),
preferredID,
preferredState,
b.Mempool,
b.txExecutorBackend,
b.blkManager,
timestamp,
recommendedPChainHeight,
math.MaxInt,
)
}
return packEtnaBlockTxs(
context.TODO(),
preferredID,
preferredState,
b.Mempool,
b.txExecutorBackend,
b.blkManager,
timestamp,
recommendedPChainHeight,
math.MaxUint64,
)
}
// [timestamp] is min(max(now, parent timestamp), next staker change time)
func buildBlock(
ctx context.Context,
builder *builder,
parentID ids.ID,
height uint64,
timestamp time.Time,
forceAdvanceTime bool,
parentState state.Chain,
pChainHeight uint64,
) (block.Block, error) {
var (
blockTxs []*txs.Tx
err error
)
if builder.txExecutorBackend.Config.UpgradeConfig.IsEtnaActivated(timestamp) {
blockTxs, err = packEtnaBlockTxs(
ctx,
parentID,
parentState,
builder.Mempool,
builder.txExecutorBackend,
builder.blkManager,
timestamp,
pChainHeight,
0, // minCapacity is 0 as we want to honor the capacity in state.
)
} else {
blockTxs, err = packDurangoBlockTxs(
ctx,
parentID,
parentState,
builder.Mempool,
builder.txExecutorBackend,
builder.blkManager,
timestamp,
pChainHeight,
targetBlockSize,
)
}
if err != nil {
return nil, fmt.Errorf("failed to pack block txs: %w", err)
}
// Try rewarding stakers whose staking period ends at the new chain time.
// This is done first to prioritize advancing the timestamp as quickly as
// possible.
stakerTxID, shouldReward, err := getNextStakerToReward(timestamp, parentState)
if err != nil {
return nil, fmt.Errorf("could not find next staker to reward: %w", err)
}
if shouldReward {
rewardValidatorTx, err := NewRewardValidatorTx(builder.txExecutorBackend.Ctx, stakerTxID)
if err != nil {
return nil, fmt.Errorf("could not build tx to reward staker: %w", err)
}
return block.NewBanffProposalBlock(
timestamp,
parentID,
height,
rewardValidatorTx,
blockTxs,
)
}
// If there is no reason to build a block, don't.
if len(blockTxs) == 0 && !forceAdvanceTime {
builder.txExecutorBackend.Ctx.Log.Debug("no pending txs to issue into a block")
return nil, ErrNoPendingBlocks
}
// Issue a block with as many transactions as possible.
return block.NewBanffStandardBlock(
timestamp,
parentID,
height,
blockTxs,
)
}
func packDurangoBlockTxs(
ctx context.Context,
parentID ids.ID,
parentState state.Chain,
mempool mempool.Mempool,
backend *txexecutor.Backend,
manager blockexecutor.Manager,
timestamp time.Time,
pChainHeight uint64,
remainingSize int,
) ([]*txs.Tx, error) {
stateDiff, err := state.NewDiffOn(parentState)
if err != nil {
return nil, err
}
if _, err := txexecutor.AdvanceTimeTo(backend, stateDiff, timestamp); err != nil {
return nil, err
}
var (
blockTxs []*txs.Tx
inputs set.Set[ids.ID]
feeCalculator = state.PickFeeCalculator(backend.Config, stateDiff)
)
for {
tx, exists := mempool.Peek()
if !exists {
break
}
txSize := len(tx.Bytes())
if txSize > remainingSize {
break
}
shouldAdd, err := executeTx(
ctx,
parentID,
stateDiff,
mempool,
backend,
manager,
pChainHeight,
&inputs,
feeCalculator,
tx,
)
if err != nil {
return nil, err
}
if !shouldAdd {
continue
}
remainingSize -= txSize
blockTxs = append(blockTxs, tx)
}
return blockTxs, nil
}
func packEtnaBlockTxs(
ctx context.Context,
parentID ids.ID,
parentState state.Chain,
mempool mempool.Mempool,
backend *txexecutor.Backend,
manager blockexecutor.Manager,
timestamp time.Time,
pChainHeight uint64,
minCapacity gas.Gas,
) ([]*txs.Tx, error) {
stateDiff, err := state.NewDiffOn(parentState)
if err != nil {
return nil, err
}
if _, err := txexecutor.AdvanceTimeTo(backend, stateDiff, timestamp); err != nil {
return nil, err
}
feeState := stateDiff.GetFeeState()
capacity := max(feeState.Capacity, minCapacity)
var (
blockTxs []*txs.Tx
inputs set.Set[ids.ID]
blockComplexity gas.Dimensions
feeCalculator = state.PickFeeCalculator(backend.Config, stateDiff)
)
for {
tx, exists := mempool.Peek()
if !exists {
break
}
txComplexity, err := fee.TxComplexity(tx.Unsigned)
if err != nil {
return nil, err
}
newBlockComplexity, err := blockComplexity.Add(&txComplexity)
if err != nil {
return nil, err
}
newBlockGas, err := newBlockComplexity.ToGas(backend.Config.DynamicFeeConfig.Weights)
if err != nil {
return nil, err
}
if newBlockGas > capacity {
break
}
shouldAdd, err := executeTx(
ctx,
parentID,
stateDiff,
mempool,
backend,
manager,
pChainHeight,
&inputs,
feeCalculator,
tx,
)
if err != nil {
return nil, err
}
if !shouldAdd {
continue
}
blockComplexity = newBlockComplexity
blockTxs = append(blockTxs, tx)
}
return blockTxs, nil
}
func executeTx(
ctx context.Context,
parentID ids.ID,
stateDiff state.Diff,
mempool mempool.Mempool,
backend *txexecutor.Backend,
manager blockexecutor.Manager,
pChainHeight uint64,
inputs *set.Set[ids.ID],
feeCalculator fee.Calculator,
tx *txs.Tx,
) (bool, error) {
mempool.Remove(tx)
// Invariant: [tx] has already been syntactically verified.
err := txexecutor.VerifyWarpMessages(
ctx,
backend.Ctx.NetworkID,
backend.Ctx.ValidatorState,
pChainHeight,
tx.Unsigned,
)
if err != nil {
txID := tx.ID()
mempool.MarkDropped(txID, err)
return false, nil
}
txDiff, err := state.NewDiffOn(stateDiff)
if err != nil {
return false, err
}
txInputs, _, _, err := txexecutor.StandardTx(
backend,
feeCalculator,
tx,
txDiff,
)
if err != nil {
txID := tx.ID()
mempool.MarkDropped(txID, err)
return false, nil
}
if inputs.Overlaps(txInputs) {
txID := tx.ID()
mempool.MarkDropped(txID, blockexecutor.ErrConflictingBlockTxs)
return false, nil
}
if err := manager.VerifyUniqueInputs(parentID, txInputs); err != nil {
txID := tx.ID()
mempool.MarkDropped(txID, err)
return false, nil
}
inputs.Union(txInputs)
txDiff.AddTx(tx, status.Committed)
return true, txDiff.Apply(stateDiff)
}
// getNextStakerToReward returns the next staker txID to remove from the staking
// set with a RewardValidatorTx rather than an AdvanceTimeTx. [chainTimestamp]
// is the timestamp of the chain at the time this validator would be getting
// removed and is used to calculate [shouldReward].
// Returns:
// - [txID] of the next staker to reward
// - [shouldReward] if the txID exists and is ready to be rewarded
// - [err] if something bad happened
func getNextStakerToReward(
chainTimestamp time.Time,
preferredState state.Chain,
) (ids.ID, bool, error) {
if !chainTimestamp.Before(mockable.MaxTime) {
return ids.Empty, false, ErrEndOfTime
}
currentStakerIterator, err := preferredState.GetCurrentStakerIterator()
if err != nil {
return ids.Empty, false, err
}
defer currentStakerIterator.Release()
for currentStakerIterator.Next() {
currentStaker := currentStakerIterator.Value()
priority := currentStaker.Priority
// If the staker is a permissionless staker (not a permissioned subnet
// validator), it's the next staker we will want to remove with a
// RewardValidatorTx rather than an AdvanceTimeTx.
if priority != txs.SubnetPermissionedValidatorCurrentPriority {
return currentStaker.TxID, chainTimestamp.Equal(currentStaker.EndTime), nil
}
}
return ids.Empty, false, nil
}
func NewRewardValidatorTx(ctx *snow.Context, txID ids.ID) (*txs.Tx, error) {
utx := &txs.RewardValidatorTx{TxID: txID}
tx, err := txs.NewSigned(utx, txs.Codec, nil)
if err != nil {
return nil, err
}
return tx, tx.SyntacticVerify(ctx)
}