92 lines
3.1 KiB
Go
92 lines
3.1 KiB
Go
|
// Copyright 2022 The go-ethereum Authors
|
||
|
|
// This file is part of the go-ethereum library.
|
||
|
|
//
|
||
|
|
// The go-ethereum library is free software: you can redistribute it and/or modify
|
||
|
|
// it under the terms of the GNU Lesser General Public License as published by
|
||
|
|
// the Free Software Foundation, either version 3 of the License, or
|
||
|
|
// (at your option) any later version.
|
||
|
|
//
|
||
|
|
// The go-ethereum library is distributed in the hope that it will be useful,
|
||
|
|
// but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
|
|
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
|
|
// GNU Lesser General Public License for more details.
|
||
|
|
//
|
||
|
|
// You should have received a copy of the GNU Lesser General Public License
|
||
|
|
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.
|
||
|
|
|
||
|
|
package blobpool
|
||
|
|
|
||
|
|
import (
|
||
|
|
"github.com/ethereum/go-ethereum/common"
|
||
|
|
)
|
||
|
|
|
||
|
|
// lookup maps blob versioned hashes to transaction hashes that include them,
|
||
|
|
// and transaction hashes to billy entries that include them.
|
||
|
|
type lookup struct {
|
||
|
|
blobIndex map[common.Hash]map[common.Hash]struct{}
|
||
|
|
txIndex map[common.Hash]uint64
|
||
|
|
}
|
||
|
|
|
||
|
|
// newLookup creates a new index for tracking blob to tx; and tx to billy mappings.
|
||
|
|
func newLookup() *lookup {
|
||
|
|
return &lookup{
|
||
|
|
blobIndex: make(map[common.Hash]map[common.Hash]struct{}),
|
||
|
|
txIndex: make(map[common.Hash]uint64),
|
||
|
|
}
|
||
|
|
}
|
||
|
|
|
||
|
|
// exists returns whether a transaction is already tracked or not.
|
||
|
|
func (l *lookup) exists(txhash common.Hash) bool {
|
||
|
|
_, exists := l.txIndex[txhash]
|
||
|
|
return exists
|
||
|
|
}
|
||
|
|
|
||
|
|
// storeidOfTx returns the datastore storage item id of a transaction.
|
||
|
|
func (l *lookup) storeidOfTx(txhash common.Hash) (uint64, bool) {
|
||
|
|
id, ok := l.txIndex[txhash]
|
||
|
|
return id, ok
|
||
|
|
}
|
||
|
|
|
||
|
|
// storeidOfBlob returns the datastore storage item id of a blob.
|
||
|
|
func (l *lookup) storeidOfBlob(vhash common.Hash) (uint64, bool) {
|
||
|
|
// If the blob is unknown, return a miss
|
||
|
|
txs, ok := l.blobIndex[vhash]
|
||
|
|
if !ok {
|
||
|
|
return 0, false
|
||
|
|
}
|
||
|
|
// If the blob is known, return any tx for it
|
||
|
|
for tx := range txs {
|
||
|
|
return l.storeidOfTx(tx)
|
||
|
|
}
|
||
|
|
return 0, false // Weird, don't choke
|
||
|
|
}
|
||
|
|
|
||
|
|
// track inserts a new set of mappings from blob versioned hashes to transaction
|
||
|
|
// hashes; and from transaction hashes to datastore storage item ids.
|
||
|
|
func (l *lookup) track(tx *blobTxMeta) {
|
||
|
|
// Map all the blobs to the transaction hash
|
||
|
|
for _, vhash := range tx.vhashes {
|
||
|
|
if _, ok := l.blobIndex[vhash]; !ok {
|
||
|
|
l.blobIndex[vhash] = make(map[common.Hash]struct{})
|
||
|
|
}
|
||
|
|
l.blobIndex[vhash][tx.hash] = struct{}{} // may be double mapped if a tx contains the same blob twice
|
||
|
|
}
|
||
|
|
// Map the transaction hash to the datastore id
|
||
|
|
l.txIndex[tx.hash] = tx.id
|
||
|
|
}
|
||
|
|
|
||
|
|
// untrack removes a set of mappings from blob versioned hashes to transaction
|
||
|
|
// hashes from the blob index.
|
||
|
|
func (l *lookup) untrack(tx *blobTxMeta) {
|
||
|
|
// Unmap the transaction hash from the datastore id
|
||
|
|
delete(l.txIndex, tx.hash)
|
||
|
|
|
||
|
|
// Unmap all the blobs from the transaction hash
|
||
|
|
for _, vhash := range tx.vhashes {
|
||
|
|
delete(l.blobIndex[vhash], tx.hash) // may be double deleted if a tx contains the same blob twice
|
||
|
|
if len(l.blobIndex[vhash]) == 0 {
|
||
|
|
delete(l.blobIndex, vhash)
|
||
|
|
}
|
||
|
|
}
|
||
|
|
}
|