-
Notifications
You must be signed in to change notification settings - Fork 66
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Really really disable mempool (#347)
* Really really disable mempool * Fix linting errors (nolint) * readme: fix bfgd link (#350) * golangci: fix copyright header linting (#351) * Rebase --------- Co-authored-by: Joshua Sing <[email protected]> Co-authored-by: sashaphmn <[email protected]> Co-authored-by: Joshua Sing <[email protected]>
- Loading branch information
4 people
authored
Jan 6, 2025
1 parent
71a3e1f
commit 316d517
Showing
3 changed files
with
236 additions
and
227 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -1,137 +1,141 @@ | ||
| // Copyright (c) 2024 Hemi Labs, Inc. | ||
| // Copyright (c) 2024-2025 Hemi Labs, Inc. | ||
| // Use of this source code is governed by the MIT License, | ||
| // which can be found in the LICENSE file. | ||
|
|
||
| package tbc | ||
|
|
||
| import ( | ||
| "context" | ||
| "errors" | ||
| "fmt" | ||
| "sync" | ||
|
|
||
| "github.com/btcsuite/btcd/chaincfg/chainhash" | ||
| "github.com/btcsuite/btcd/wire" | ||
| "github.com/davecgh/go-spew/spew" | ||
| ) | ||
|
|
||
| type mempool struct { | ||
| mtx sync.RWMutex | ||
|
|
||
| txs map[chainhash.Hash][]byte // when nil, tx has not been downloaded | ||
| size int // total memory used by mempool | ||
| } | ||
|
|
||
| func (m *mempool) getDataConstruct(ctx context.Context) (*wire.MsgGetData, error) { | ||
| log.Tracef("getDataConstruct") | ||
| defer log.Tracef("getDataConstruct exit") | ||
|
|
||
| getData := wire.NewMsgGetData() | ||
|
|
||
| m.mtx.RLock() | ||
| defer m.mtx.RUnlock() | ||
|
|
||
| for k, v := range m.txs { | ||
| if v != nil { | ||
| continue | ||
| } | ||
| if err := getData.AddInvVect(&wire.InvVect{ | ||
| Type: wire.InvTypeTx, | ||
| Hash: k, | ||
| }); err != nil { | ||
| // only happens when asking max inventory | ||
| return nil, fmt.Errorf("construct get data: %w", err) | ||
| } | ||
| } | ||
| return getData, nil | ||
| } | ||
|
|
||
| func (m *mempool) txsInsert(ctx context.Context, msg *wire.MsgTx, raw []byte) error { | ||
| log.Tracef("txsInsert") | ||
| defer log.Tracef("txsInsert exit") | ||
|
|
||
| m.mtx.Lock() | ||
| defer m.mtx.Unlock() | ||
|
|
||
| if tx := m.txs[msg.TxHash()]; tx == nil { | ||
| m.txs[msg.TxHash()] = raw | ||
| m.size += len(raw) | ||
| } | ||
|
|
||
| return nil | ||
| } | ||
|
|
||
| func (m *mempool) invTxsInsert(ctx context.Context, inv *wire.MsgInv) error { | ||
| log.Tracef("invTxsInsert") | ||
| defer log.Tracef("invTxsInsert exit") | ||
|
|
||
| if len(inv.InvList) == 0 { | ||
| return errors.New("empty inventory") | ||
| } | ||
|
|
||
| m.mtx.Lock() | ||
| defer m.mtx.Unlock() | ||
|
|
||
| l := len(m.txs) | ||
| for _, v := range inv.InvList { | ||
| switch v.Type { | ||
| case wire.InvTypeTx: | ||
| if _, ok := m.txs[v.Hash]; !ok { | ||
| m.txs[v.Hash] = nil | ||
| } | ||
| } | ||
| } | ||
|
|
||
| // if the map length does not change, nothing was inserted. | ||
| if len(m.txs) != l { | ||
| return errors.New("insert inventory tx: already exists") | ||
| } | ||
| return nil | ||
| } | ||
|
|
||
| func (m *mempool) txsRemove(ctx context.Context, txs []chainhash.Hash) error { | ||
| log.Tracef("txsRemove") | ||
| defer log.Tracef("txsRemove exit") | ||
|
|
||
| if len(txs) == 0 { | ||
| return errors.New("no transactions provided") | ||
| } | ||
|
|
||
| m.mtx.Lock() | ||
| defer m.mtx.Unlock() | ||
|
|
||
| l := len(m.txs) | ||
| for k := range txs { | ||
| if tx, ok := m.txs[txs[k]]; ok { | ||
| m.size -= len(tx) | ||
| delete(m.txs, txs[k]) | ||
| } | ||
| } | ||
|
|
||
| // if the map length does not change, nothing was deleted. | ||
| if len(m.txs) != l { | ||
| return errors.New("remove txs: nothing removed") | ||
| } | ||
| return nil | ||
| } | ||
|
|
||
| func (m *mempool) stats(ctx context.Context) (int, int) { | ||
| m.mtx.RLock() | ||
| defer m.mtx.RUnlock() | ||
|
|
||
| // Approximate size of mempool; map and cap overhead is missing. | ||
| return len(m.txs), m.size + (len(m.txs) * chainhash.HashSize) | ||
| } | ||
|
|
||
| func (m *mempool) Dump(ctx context.Context) string { | ||
| m.mtx.RLock() | ||
| defer m.mtx.RUnlock() | ||
|
|
||
| return spew.Sdump(m.txs) | ||
| } | ||
|
|
||
| func mempoolNew() (*mempool, error) { | ||
| return &mempool{ | ||
| txs: make(map[chainhash.Hash][]byte, wire.MaxInvPerMsg), | ||
| }, nil | ||
| } | ||
| //type mempool struct { | ||
| // mtx sync.RWMutex | ||
| // | ||
| // txs map[chainhash.Hash][]byte // when nil, tx has not been downloaded | ||
| // size int // total memory used by mempool | ||
| //} | ||
| // | ||
| //func (m *mempool) getDataConstruct(ctx context.Context) (*wire.MsgGetData, error) { | ||
| // log.Tracef("getDataConstruct") | ||
| // defer log.Tracef("getDataConstruct exit") | ||
| // | ||
| // getData := wire.NewMsgGetData() | ||
| // | ||
| // m.mtx.RLock() | ||
| // defer m.mtx.RUnlock() | ||
| // | ||
| // for k, v := range m.txs { | ||
| // if v != nil { | ||
| // continue | ||
| // } | ||
| // if err := getData.AddInvVect(&wire.InvVect{ | ||
| // Type: wire.InvTypeTx, | ||
| // Hash: k, | ||
| // }); err != nil { | ||
| // // only happens when asking max inventory | ||
| // return nil, fmt.Errorf("construct get data: %w", err) | ||
| // } | ||
| // } | ||
| // return getData, nil | ||
| //} | ||
| // | ||
| //func (m *mempool) txsInsert(ctx context.Context, msg *wire.MsgTx, raw []byte) error { | ||
| // log.Tracef("txsInsert") | ||
| // defer log.Tracef("txsInsert exit") | ||
| // | ||
| // if true { | ||
| // return fmt.Errorf("txsInsert: disabled") | ||
| // } | ||
| // | ||
| // m.mtx.Lock() | ||
| // defer m.mtx.Unlock() | ||
| // | ||
| // if tx := m.txs[msg.TxHash()]; tx == nil { | ||
| // m.txs[msg.TxHash()] = raw | ||
| // m.size += len(raw) | ||
| // } | ||
| // | ||
| // return nil | ||
| //} | ||
| // | ||
| //func (m *mempool) invTxsInsert(ctx context.Context, inv *wire.MsgInv) error { | ||
| // log.Tracef("invTxsInsert") | ||
| // defer log.Tracef("invTxsInsert exit") | ||
| // | ||
| // if true { | ||
| // return fmt.Errorf("invTxsInsert: disabled") | ||
| // } | ||
| // | ||
| // if len(inv.InvList) == 0 { | ||
| // return errors.New("empty inventory") | ||
| // } | ||
| // | ||
| // m.mtx.Lock() | ||
| // defer m.mtx.Unlock() | ||
| // | ||
| // l := len(m.txs) | ||
| // for _, v := range inv.InvList { | ||
| // switch v.Type { | ||
| // case wire.InvTypeTx: | ||
| // if _, ok := m.txs[v.Hash]; !ok { | ||
| // m.txs[v.Hash] = nil | ||
| // } | ||
| // } | ||
| // } | ||
| // | ||
| // // if the map length does not change, nothing was inserted. | ||
| // if len(m.txs) != l { | ||
| // return errors.New("insert inventory tx: already exists") | ||
| // } | ||
| // return nil | ||
| //} | ||
| // | ||
| //func (m *mempool) txsRemove(ctx context.Context, txs []chainhash.Hash) error { | ||
| // log.Tracef("txsRemove") | ||
| // defer log.Tracef("txsRemove exit") | ||
| // | ||
| // if true { | ||
| // return fmt.Errorf("txsRemove: disabled") | ||
| // } | ||
| // | ||
| // if len(txs) == 0 { | ||
| // return errors.New("no transactions provided") | ||
| // } | ||
| // | ||
| // m.mtx.Lock() | ||
| // defer m.mtx.Unlock() | ||
| // | ||
| // l := len(m.txs) | ||
| // for k := range txs { | ||
| // if tx, ok := m.txs[txs[k]]; ok { | ||
| // m.size -= len(tx) | ||
| // delete(m.txs, txs[k]) | ||
| // } | ||
| // } | ||
| // | ||
| // // if the map length does not change, nothing was deleted. | ||
| // if len(m.txs) != l { | ||
| // return errors.New("remove txs: nothing removed") | ||
| // } | ||
| // return nil | ||
| //} | ||
| // | ||
| //func (m *mempool) stats(ctx context.Context) (int, int) { | ||
| // m.mtx.RLock() | ||
| // defer m.mtx.RUnlock() | ||
| // | ||
| // // Approximate size of mempool; map and cap overhead is missing. | ||
| // return len(m.txs), m.size + (len(m.txs) * chainhash.HashSize) | ||
| //} | ||
| // | ||
| //func (m *mempool) Dump(ctx context.Context) string { | ||
| // m.mtx.RLock() | ||
| // defer m.mtx.RUnlock() | ||
| // | ||
| // return spew.Sdump(m.txs) | ||
| //} | ||
| // | ||
| //func mempoolNew() (*mempool, error) { | ||
| // if true { | ||
| // return nil, fmt.Errorf("mempoolNew: disabled") | ||
| // } | ||
| // return &mempool{ | ||
| // txs: make(map[chainhash.Hash][]byte, wire.MaxInvPerMsg), | ||
| // }, nil | ||
| //} |
Oops, something went wrong.