Rework the mempool locking code.
It was previously possible for the unprotected iteration of the mempool orphans to lead to undefined results. This commit remedies that by reworking the locking code a bit. It also embeds the mutex directly into the mempool struct rather than having a separate field for it so the syntax is a slightly cleaner.
This commit is contained in:
Dave Collins
parent
27abb0eb3e
commit
102fc5f513
1 changed files with 83 additions and 48 deletions
131
mempool.go
131
mempool.go
|
|
@ -75,12 +75,12 @@ const (
|
|||
// blocks and relayed to other peers. It is safe for concurrent access from
|
||||
// multiple peers.
|
||||
type txMemPool struct {
|
||||
sync.RWMutex
|
||||
server *server
|
||||
pool map[btcwire.ShaHash]*btcwire.MsgTx
|
||||
orphans map[btcwire.ShaHash]*btcwire.MsgTx
|
||||
orphansByPrev map[btcwire.ShaHash]*list.List
|
||||
outpoints map[btcwire.OutPoint]*btcwire.MsgTx
|
||||
lock sync.RWMutex
|
||||
}
|
||||
|
||||
// isDust returns whether or not the passed transaction output amount is
|
||||
|
|
@ -277,11 +277,9 @@ func checkInputsStandard(tx *btcwire.MsgTx) error {
|
|||
|
||||
// removeOrphan removes the passed orphan transaction from the orphan pool and
|
||||
// previous orphan index.
|
||||
//
|
||||
// This function MUST be called with the mempool lock held (for writes).
|
||||
func (mp *txMemPool) removeOrphan(txHash *btcwire.ShaHash) {
|
||||
// Protect concurrent access.
|
||||
mp.lock.Lock()
|
||||
defer mp.lock.Unlock()
|
||||
|
||||
// Nothing to do if passed tx is not an orphan.
|
||||
tx, exists := mp.orphans[*txHash]
|
||||
if !exists {
|
||||
|
|
@ -313,11 +311,9 @@ func (mp *txMemPool) removeOrphan(txHash *btcwire.ShaHash) {
|
|||
|
||||
// limitNumOrphans limits the number of orphan transactions by evicting a random
|
||||
// orphan if adding a new one would cause it to overflow the max allowed.
|
||||
//
|
||||
// This function MUST be called with the mempool lock held (for writes).
|
||||
func (mp *txMemPool) limitNumOrphans() error {
|
||||
// Protect concurrent access.
|
||||
mp.lock.Lock()
|
||||
defer mp.lock.Unlock()
|
||||
|
||||
if len(mp.orphans)+1 > maxOrphanTransactions {
|
||||
// Generate a cryptographically random hash.
|
||||
randHashBytes := make([]byte, btcwire.HashSize)
|
||||
|
|
@ -344,25 +340,20 @@ func (mp *txMemPool) limitNumOrphans() error {
|
|||
}
|
||||
}
|
||||
|
||||
// Need to unlock and relock since removeOrphan has its own
|
||||
// locking.
|
||||
mp.lock.Unlock()
|
||||
mp.removeOrphan(foundHash)
|
||||
mp.lock.Lock()
|
||||
}
|
||||
|
||||
return nil
|
||||
}
|
||||
|
||||
// addOrphan adds an orphan transaction to the orphan pool.
|
||||
//
|
||||
// This function MUST be called with the mempool lock held (for writes).
|
||||
func (mp *txMemPool) addOrphan(tx *btcwire.MsgTx, txHash *btcwire.ShaHash) {
|
||||
// Limit the number orphan transactions to prevent memory exhaustion. A
|
||||
// random orphan is evicted to make room if needed.
|
||||
mp.limitNumOrphans()
|
||||
|
||||
mp.lock.Lock()
|
||||
defer mp.lock.Unlock()
|
||||
|
||||
mp.orphans[*txHash] = tx
|
||||
for _, txIn := range tx.TxIn {
|
||||
originTxHash := txIn.PreviousOutpoint.Hash
|
||||
|
|
@ -377,6 +368,8 @@ func (mp *txMemPool) addOrphan(tx *btcwire.MsgTx, txHash *btcwire.ShaHash) {
|
|||
}
|
||||
|
||||
// maybeAddOrphan potentially adds an orphan to the orphan pool.
|
||||
//
|
||||
// This function MUST be called with the mempool lock held (for writes).
|
||||
func (mp *txMemPool) maybeAddOrphan(tx *btcwire.MsgTx, txHash *btcwire.ShaHash) error {
|
||||
// Ignore orphan transactions that are too large. This helps avoid
|
||||
// a memory exhaustion attack based on sending a lot of really large
|
||||
|
|
@ -407,13 +400,36 @@ func (mp *txMemPool) maybeAddOrphan(tx *btcwire.MsgTx, txHash *btcwire.ShaHash)
|
|||
return nil
|
||||
}
|
||||
|
||||
// isTransactionInPool returns whether or not the passed transaction already
|
||||
// exists in the main pool.
|
||||
//
|
||||
// This function MUST be called with the mempool lock held (for reads).
|
||||
func (mp *txMemPool) isTransactionInPool(hash *btcwire.ShaHash) bool {
|
||||
if _, exists := mp.pool[*hash]; exists {
|
||||
return true
|
||||
}
|
||||
|
||||
return false
|
||||
}
|
||||
|
||||
// IsTransactionInPool returns whether or not the passed transaction already
|
||||
// exists in the main pool.
|
||||
//
|
||||
// This function is safe for concurrent access.
|
||||
func (mp *txMemPool) IsTransactionInPool(hash *btcwire.ShaHash) bool {
|
||||
mp.lock.RLock()
|
||||
defer mp.lock.RUnlock()
|
||||
// Protect concurrent access.
|
||||
mp.RLock()
|
||||
defer mp.RUnlock()
|
||||
|
||||
if _, exists := mp.pool[*hash]; exists {
|
||||
return mp.isTransactionInPool(hash)
|
||||
}
|
||||
|
||||
// isOrphanInPool returns whether or not the passed transaction already exists
|
||||
// in the orphan pool.
|
||||
//
|
||||
// This function MUST be called with the mempool lock held (for reads).
|
||||
func (mp *txMemPool) isOrphanInPool(hash *btcwire.ShaHash) bool {
|
||||
if _, exists := mp.orphans[*hash]; exists {
|
||||
return true
|
||||
}
|
||||
|
||||
|
|
@ -422,36 +438,46 @@ func (mp *txMemPool) IsTransactionInPool(hash *btcwire.ShaHash) bool {
|
|||
|
||||
// IsOrphanInPool returns whether or not the passed transaction already exists
|
||||
// in the orphan pool.
|
||||
//
|
||||
// This function is safe for concurrent access.
|
||||
func (mp *txMemPool) IsOrphanInPool(hash *btcwire.ShaHash) bool {
|
||||
mp.lock.RLock()
|
||||
defer mp.lock.RUnlock()
|
||||
// Protect concurrent access.
|
||||
mp.RLock()
|
||||
defer mp.RUnlock()
|
||||
|
||||
if _, exists := mp.orphans[*hash]; exists {
|
||||
return true
|
||||
}
|
||||
return mp.isOrphanInPool(hash)
|
||||
}
|
||||
|
||||
return false
|
||||
// haveTransaction returns whether or not the passed transaction already exists
|
||||
// in the main pool or in the orphan pool.
|
||||
//
|
||||
// This function MUST be called with the mempool lock held (for reads).
|
||||
func (mp *txMemPool) haveTransaction(hash *btcwire.ShaHash) bool {
|
||||
return mp.isTransactionInPool(hash) || mp.isOrphanInPool(hash)
|
||||
}
|
||||
|
||||
// HaveTransaction returns whether or not the passed transaction already exists
|
||||
// in the main pool or in the orphan pool.
|
||||
//
|
||||
// This function is safe for concurrent access.
|
||||
func (mp *txMemPool) HaveTransaction(hash *btcwire.ShaHash) bool {
|
||||
return mp.IsTransactionInPool(hash) || mp.IsOrphanInPool(hash)
|
||||
// Protect concurrent access.
|
||||
mp.RLock()
|
||||
defer mp.RUnlock()
|
||||
|
||||
return mp.haveTransaction(hash)
|
||||
}
|
||||
|
||||
// removeTransaction removes the passed transaction from the memory pool.
|
||||
//
|
||||
// This function MUST be called with the mempool lock held (for writes).
|
||||
func (mp *txMemPool) removeTransaction(tx *btcwire.MsgTx) {
|
||||
mp.lock.Lock()
|
||||
defer mp.lock.Unlock()
|
||||
|
||||
// Remove any transactions which rely on this one.
|
||||
txHash, _ := tx.TxSha()
|
||||
for i := uint32(0); i < uint32(len(tx.TxOut)); i++ {
|
||||
outpoint := btcwire.NewOutPoint(&txHash, i)
|
||||
if txRedeemer, exists := mp.outpoints[*outpoint]; exists {
|
||||
mp.lock.Unlock()
|
||||
mp.removeTransaction(txRedeemer)
|
||||
mp.lock.Lock()
|
||||
}
|
||||
}
|
||||
|
||||
|
|
@ -463,16 +489,14 @@ func (mp *txMemPool) removeTransaction(tx *btcwire.MsgTx) {
|
|||
}
|
||||
delete(mp.pool, txHash)
|
||||
}
|
||||
|
||||
}
|
||||
|
||||
// addTransaction adds the passed transaction to the memory pool. It should
|
||||
// not be called directly as it doesn't perform any validation. This is a
|
||||
// helper for maybeAcceptTransaction.
|
||||
//
|
||||
// This function MUST be called with the mempool lock held (for writes).
|
||||
func (mp *txMemPool) addTransaction(tx *btcwire.MsgTx, txHash *btcwire.ShaHash) {
|
||||
mp.lock.Lock()
|
||||
defer mp.lock.Unlock()
|
||||
|
||||
// Add the transaction to the pool and mark the referenced outpoints
|
||||
// as spent by the pool.
|
||||
mp.pool[*txHash] = tx
|
||||
|
|
@ -485,10 +509,9 @@ func (mp *txMemPool) addTransaction(tx *btcwire.MsgTx, txHash *btcwire.ShaHash)
|
|||
// attempting to spend coins already spent by other transactions in the pool.
|
||||
// Note it does not check for double spends against transactions already in the
|
||||
// main chain.
|
||||
//
|
||||
// This function MUST be called with the mempool lock held (for reads).
|
||||
func (mp *txMemPool) checkPoolDoubleSpend(tx *btcwire.MsgTx) error {
|
||||
mp.lock.RLock()
|
||||
defer mp.lock.RUnlock()
|
||||
|
||||
for _, txIn := range tx.TxIn {
|
||||
if txR, exists := mp.outpoints[txIn.PreviousOutpoint]; exists {
|
||||
hash, _ := txR.TxSha()
|
||||
|
|
@ -504,10 +527,9 @@ func (mp *txMemPool) checkPoolDoubleSpend(tx *btcwire.MsgTx) error {
|
|||
// fetchInputTransactions fetches the input transactions referenced by the
|
||||
// passed transaction. First, it fetches from the main chain, then it tries to
|
||||
// fetch any missing inputs from the transaction pool.
|
||||
//
|
||||
// This function MUST be called with the mempool lock held (for reads).
|
||||
func (mp *txMemPool) fetchInputTransactions(tx *btcwire.MsgTx) (btcchain.TxStore, error) {
|
||||
mp.lock.RLock()
|
||||
defer mp.lock.RUnlock()
|
||||
|
||||
txStore, err := mp.server.blockManager.blockChain.FetchTransactionStore(tx)
|
||||
if err != nil {
|
||||
return nil, err
|
||||
|
|
@ -531,9 +553,12 @@ func (mp *txMemPool) fetchInputTransactions(tx *btcwire.MsgTx) (btcchain.TxStore
|
|||
// FetchTransaction returns the requested transaction from the transaction pool.
|
||||
// This only fetches from the main transaction pool and does not include
|
||||
// orphans.
|
||||
//
|
||||
// This function is safe for concurrent access.
|
||||
func (mp *txMemPool) FetchTransaction(txHash *btcwire.ShaHash) (*btcwire.MsgTx, error) {
|
||||
mp.lock.RLock()
|
||||
defer mp.lock.RUnlock()
|
||||
// Protect concurrent access.
|
||||
mp.RLock()
|
||||
defer mp.RUnlock()
|
||||
|
||||
if tx, exists := mp.pool[*txHash]; exists {
|
||||
return tx, nil
|
||||
|
|
@ -546,6 +571,8 @@ func (mp *txMemPool) FetchTransaction(txHash *btcwire.ShaHash) (*btcwire.MsgTx,
|
|||
// free-standing transactions into a memory pool. It includes functionality
|
||||
// such as rejecting duplicate transactions, ensuring transactions follow all
|
||||
// rules, orphan transaction handling, and insertion into the memory pool.
|
||||
//
|
||||
// This function MUST be called with the mempool lock held (for writes).
|
||||
func (mp *txMemPool) maybeAcceptTransaction(tx *btcwire.MsgTx, isOrphan *bool) error {
|
||||
*isOrphan = false
|
||||
txHash, err := tx.TxSha()
|
||||
|
|
@ -556,7 +583,7 @@ func (mp *txMemPool) maybeAcceptTransaction(tx *btcwire.MsgTx, isOrphan *bool) e
|
|||
// Don't accept the transaction if it already exists in the pool. This
|
||||
// applies to orphan transactions as well. This check is intended to
|
||||
// be a quick check to weed out duplicates.
|
||||
if mp.HaveTransaction(&txHash) {
|
||||
if mp.haveTransaction(&txHash) {
|
||||
str := fmt.Sprintf("already have transaction %v", txHash)
|
||||
return TxRuleError(str)
|
||||
}
|
||||
|
|
@ -689,10 +716,8 @@ func (mp *txMemPool) maybeAcceptTransaction(tx *btcwire.MsgTx, isOrphan *bool) e
|
|||
// Add to transaction pool.
|
||||
mp.addTransaction(tx, &txHash)
|
||||
|
||||
mp.lock.RLock()
|
||||
log.Debugf("TXMP: Accepted transaction %v (pool size: %v)", txHash,
|
||||
len(mp.pool))
|
||||
mp.lock.RUnlock()
|
||||
|
||||
// TODO(davec): Notifications
|
||||
|
||||
|
|
@ -707,6 +732,8 @@ func (mp *txMemPool) maybeAcceptTransaction(tx *btcwire.MsgTx, isOrphan *bool) e
|
|||
// transaction hash (they are no longer orphans if true) and potentially accepts
|
||||
// them. It repeats the process for the newly accepted transactions (to detect
|
||||
// further orphans which may no longer be orphans) until there are no more.
|
||||
//
|
||||
// This function MUST be called with the mempool lock held (for writes).
|
||||
func (mp *txMemPool) processOrphans(hash *btcwire.ShaHash) error {
|
||||
// Start with processing at least the passed hash.
|
||||
processHashes := list.New()
|
||||
|
|
@ -764,7 +791,13 @@ func (mp *txMemPool) processOrphans(hash *btcwire.ShaHash) error {
|
|||
// free-standing transactions into a memory pool. It includes functionality
|
||||
// such as rejecting duplicate transactions, ensuring transactions follow all
|
||||
// rules, orphan transaction handling, and insertion into the memory pool.
|
||||
//
|
||||
// This function is safe for concurrent access.
|
||||
func (mp *txMemPool) ProcessTransaction(tx *btcwire.MsgTx) error {
|
||||
// Protect concurrent access.
|
||||
mp.Lock()
|
||||
defer mp.Unlock()
|
||||
|
||||
txHash, err := tx.TxSha()
|
||||
if err != nil {
|
||||
return err
|
||||
|
|
@ -800,9 +833,11 @@ func (mp *txMemPool) ProcessTransaction(tx *btcwire.MsgTx) error {
|
|||
|
||||
// TxShas returns a slice of hashes for all of the transactions in the memory
|
||||
// pool.
|
||||
//
|
||||
// This function is safe for concurrent access.
|
||||
func (mp *txMemPool) TxShas() []*btcwire.ShaHash {
|
||||
mp.lock.Lock()
|
||||
defer mp.lock.Unlock()
|
||||
mp.RLock()
|
||||
defer mp.RUnlock()
|
||||
|
||||
hashes := make([]*btcwire.ShaHash, len(mp.pool))
|
||||
i := 0
|
||||
|
|
|
|||
Loading…
Reference in a new issue