forks/go-ethereum
1
0
Fork 1
mirror of https://github.com/ethereum/go-ethereum.git synced 2026-07-26 14:46:42 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

core/txpool/legacypool: Clear lookup state with lock

Browse source
This commit is contained in:
Miro 2025-04-16 08:38:19 -04:00
parent 5d113eea32
commit 847532f287
1 changed files with 11 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

16
core/txpool/legacypool/legacypool.go
View file

@ -943,11 +943,8 @@ func (pool *LegacyPool) Add(txs []*types.Transaction, sync bool) []error {
news = make([]*types.Transaction, 0, len(txs)) news = make([]*types.Transaction, 0, len(txs))
) )
for i, tx := range txs { for i, tx := range txs {
pool.mu.Lock()
hash := pool.all.Get(tx.Hash())
pool.mu.Unlock()
// If the transaction is known, pre-set the error slot // If the transaction is known, pre-set the error slot
if hash != nil { if pool.all.Get(tx.Hash()) != nil {
errs[i] = txpool.ErrAlreadyKnown errs[i] = txpool.ErrAlreadyKnown
knownTxMeter.Mark(1) knownTxMeter.Mark(1)
continue continue
@ -1830,6 +1827,15 @@ func (t *lookup) Remove(hash common.Hash) {
delete(t.txs, hash) delete(t.txs, hash)
} }
func (t *lookup) Clear() {
t.lock.Lock()
defer t.lock.Unlock()
t.slots = 0
t.txs = make(map[common.Hash]*types.Transaction)
t.auths = make(map[common.Address][]common.Hash)
}
// TxsBelowTip finds all remote transactions below the given tip threshold. // TxsBelowTip finds all remote transactions below the given tip threshold.
func (t *lookup) TxsBelowTip(threshold *big.Int) types.Transactions { func (t *lookup) TxsBelowTip(threshold *big.Int) types.Transactions {
found := make(types.Transactions, 0, 128) found := make(types.Transactions, 0, 128)
@ -1926,7 +1932,7 @@ func (pool *LegacyPool) Clear() {
for addr := range pool.queue { for addr := range pool.queue {
pool.reserver.Release(addr) pool.reserver.Release(addr)
} }
pool.all = newLookup() pool.all.Clear()
pool.priced = newPricedList(pool.all) pool.priced = newPricedList(pool.all)
pool.pending = make(map[common.Address]*list) pool.pending = make(map[common.Address]*list)
pool.queue = make(map[common.Address]*list) pool.queue = make(map[common.Address]*list)