Skip to content

Commit

Permalink
Merge branch 'master' into blockvalidator-lowonmemory-warning
Browse files Browse the repository at this point in the history
  • Loading branch information
ganeshvanahalli authored Feb 29, 2024
2 parents 507b780 + 8a52c76 commit 51c3cf5
Showing 1 changed file with 76 additions and 6 deletions.
82 changes: 76 additions & 6 deletions arbnode/batch_poster.go
Original file line number Diff line number Diff line change
Expand Up @@ -91,6 +91,7 @@ type BatchPoster struct {
dataPoster *dataposter.DataPoster
redisLock *redislock.Simple
messagesPerBatch *arbmath.MovingAverage[uint64]
non4844BatchCount int // Count of consecutive non-4844 batches posted
// This is an atomic variable that should only be accessed atomically.
// An estimate of the number of batches we want to post but haven't yet.
// This doesn't include batches which we don't want to post yet due to the L1 bounds.
Expand Down Expand Up @@ -967,12 +968,22 @@ func (b *BatchPoster) maybePostSequencerBatch(ctx context.Context) (bool, error)
if config.IgnoreBlobPrice {
use4844 = true
} else {
blobFeePerByte := eip4844.CalcBlobFee(eip4844.CalcExcessBlobGas(*latestHeader.ExcessBlobGas, *latestHeader.BlobGasUsed))
blobFeePerByte.Mul(blobFeePerByte, blobTxBlobGasPerBlob)
blobFeePerByte.Div(blobFeePerByte, usableBytesInBlob)

calldataFeePerByte := arbmath.BigMulByUint(latestHeader.BaseFee, 16)
use4844 = arbmath.BigLessThan(blobFeePerByte, calldataFeePerByte)
backlog := atomic.LoadUint64(&b.backlog)
// Logic to prevent switching from non-4844 batches to 4844 batches too often,
// so that blocks can be filled efficiently. The geth txpool rejects txs for
// accounts that already have the other type of txs in the pool with
// "address already reserved". This logic makes sure that, if there is a backlog,
// that enough non-4844 batches have been posted to fill a block before switching.
if backlog == 0 ||
b.non4844BatchCount == 0 ||
b.non4844BatchCount > 16 {
blobFeePerByte := eip4844.CalcBlobFee(eip4844.CalcExcessBlobGas(*latestHeader.ExcessBlobGas, *latestHeader.BlobGasUsed))
blobFeePerByte.Mul(blobFeePerByte, blobTxBlobGasPerBlob)
blobFeePerByte.Div(blobFeePerByte, usableBytesInBlob)

calldataFeePerByte := arbmath.BigMulByUint(latestHeader.BaseFee, 16)
use4844 = arbmath.BigLessThan(blobFeePerByte, calldataFeePerByte)
}
}
}
}
Expand Down Expand Up @@ -1208,9 +1219,15 @@ func (b *BatchPoster) maybePostSequencerBatch(ctx context.Context) (bool, error)
"totalSegments", len(b.building.segments.rawSegments),
"numBlobs", len(kzgBlobs),
)

recentlyHitL1Bounds := time.Since(b.lastHitL1Bounds) < config.PollInterval*3
postedMessages := b.building.msgCount - batchPosition.MessageCount
b.messagesPerBatch.Update(uint64(postedMessages))
if b.building.use4844 {
b.non4844BatchCount = 0
} else {
b.non4844BatchCount++
}
unpostedMessages := msgCount - b.building.msgCount
messagesPerBatch := b.messagesPerBatch.Average()
if messagesPerBatch == 0 {
Expand Down Expand Up @@ -1350,3 +1367,56 @@ func (b *BatchPoster) StopAndWait() {
b.dataPoster.StopAndWait()
b.redisLock.StopAndWait()
}

type BoolRing struct {
buffer []bool
bufferPosition int
}

func NewBoolRing(size int) *BoolRing {
return &BoolRing{
buffer: make([]bool, 0, size),
}
}

func (b *BoolRing) Update(value bool) {
period := cap(b.buffer)
if period == 0 {
return
}
if len(b.buffer) < period {
b.buffer = append(b.buffer, value)
} else {
b.buffer[b.bufferPosition] = value
}
b.bufferPosition = (b.bufferPosition + 1) % period
}

func (b *BoolRing) Empty() bool {
return len(b.buffer) == 0
}

// Peek returns the most recently inserted value.
// Assumes not empty, check Empty() first
func (b *BoolRing) Peek() bool {
lastPosition := b.bufferPosition - 1
if lastPosition < 0 {
// This is the case where we have wrapped around, since Peek() shouldn't
// be called without checking Empty(), so we can just use capactity.
lastPosition = cap(b.buffer) - 1
}
return b.buffer[lastPosition]
}

// All returns true if the BoolRing is full and all values equal value.
func (b *BoolRing) All(value bool) bool {
if len(b.buffer) < cap(b.buffer) {
return false
}
for _, v := range b.buffer {
if v != value {
return false
}
}
return true
}

0 comments on commit 51c3cf5

Please sign in to comment.