2015-12-16 23:38:21 +03:00
|
|
|
package chainntnfs
|
|
|
|
|
2016-08-04 08:13:10 +03:00
|
|
|
import (
|
2019-06-28 05:09:44 +03:00
|
|
|
"bytes"
|
|
|
|
"encoding/hex"
|
2018-12-11 05:25:41 +03:00
|
|
|
"errors"
|
2016-08-04 08:13:10 +03:00
|
|
|
"fmt"
|
2019-06-28 05:09:44 +03:00
|
|
|
"strings"
|
2016-08-04 08:13:10 +03:00
|
|
|
"sync"
|
|
|
|
|
2018-08-09 10:05:28 +03:00
|
|
|
"github.com/btcsuite/btcd/btcjson"
|
2018-06-05 04:34:16 +03:00
|
|
|
"github.com/btcsuite/btcd/chaincfg/chainhash"
|
|
|
|
"github.com/btcsuite/btcd/wire"
|
2016-08-04 08:13:10 +03:00
|
|
|
)
|
2016-01-07 00:01:50 +03:00
|
|
|
|
2018-12-11 05:25:41 +03:00
|
|
|
var (
|
|
|
|
// ErrChainNotifierShuttingDown is used when we are trying to
|
|
|
|
// measure a spend notification when notifier is already stopped.
|
|
|
|
ErrChainNotifierShuttingDown = errors.New("chain notifier shutting down")
|
|
|
|
)
|
|
|
|
|
2018-08-24 15:05:25 +03:00
|
|
|
// TxConfStatus denotes the status of a transaction's lookup.
|
|
|
|
type TxConfStatus uint8
|
|
|
|
|
|
|
|
const (
|
|
|
|
// TxFoundMempool denotes that the transaction was found within the
|
|
|
|
// backend node's mempool.
|
|
|
|
TxFoundMempool TxConfStatus = iota
|
|
|
|
|
|
|
|
// TxFoundIndex denotes that the transaction was found within the
|
|
|
|
// backend node's txindex.
|
|
|
|
TxFoundIndex
|
|
|
|
|
2018-08-24 21:29:09 +03:00
|
|
|
// TxNotFoundIndex denotes that the transaction was not found within the
|
2018-08-24 15:05:25 +03:00
|
|
|
// backend node's txindex.
|
|
|
|
TxNotFoundIndex
|
|
|
|
|
|
|
|
// TxFoundManually denotes that the transaction was found within the
|
|
|
|
// chain by scanning for it manually.
|
|
|
|
TxFoundManually
|
|
|
|
|
2018-08-24 21:29:09 +03:00
|
|
|
// TxNotFoundManually denotes that the transaction was not found within
|
|
|
|
// the chain by scanning for it manually.
|
2018-08-24 15:05:25 +03:00
|
|
|
TxNotFoundManually
|
|
|
|
)
|
|
|
|
|
|
|
|
// String returns the string representation of the TxConfStatus.
|
|
|
|
func (t TxConfStatus) String() string {
|
|
|
|
switch t {
|
|
|
|
case TxFoundMempool:
|
|
|
|
return "TxFoundMempool"
|
|
|
|
|
|
|
|
case TxFoundIndex:
|
|
|
|
return "TxFoundIndex"
|
|
|
|
|
|
|
|
case TxNotFoundIndex:
|
|
|
|
return "TxNotFoundIndex"
|
|
|
|
|
|
|
|
case TxFoundManually:
|
|
|
|
return "TxFoundManually"
|
|
|
|
|
|
|
|
case TxNotFoundManually:
|
|
|
|
return "TxNotFoundManually"
|
|
|
|
|
|
|
|
default:
|
|
|
|
return "unknown"
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2016-02-27 04:01:08 +03:00
|
|
|
// ChainNotifier represents a trusted source to receive notifications concerning
|
|
|
|
// targeted events on the Bitcoin blockchain. The interface specification is
|
|
|
|
// intentionally general in order to support a wide array of chain notification
|
|
|
|
// implementations such as: btcd's websockets notifications, Bitcoin Core's
|
|
|
|
// ZeroMQ notifications, various Bitcoin API services, Electrum servers, etc.
|
|
|
|
//
|
|
|
|
// Concrete implementations of ChainNotifier should be able to support multiple
|
|
|
|
// concurrent client requests, as well as multiple concurrent notification events.
|
2015-12-16 23:38:21 +03:00
|
|
|
type ChainNotifier interface {
|
2016-02-27 04:01:08 +03:00
|
|
|
// RegisterConfirmationsNtfn registers an intent to be notified once
|
2018-05-31 08:01:32 +03:00
|
|
|
// txid reaches numConfs confirmations. We also pass in the pkScript as
|
2018-12-07 08:14:13 +03:00
|
|
|
// the default light client instead needs to match on scripts created in
|
|
|
|
// the block. If a nil txid is passed in, then not only should we match
|
|
|
|
// on the script, but we should also dispatch once the transaction
|
|
|
|
// containing the script reaches numConfs confirmations. This can be
|
|
|
|
// useful in instances where we only know the script in advance, but not
|
|
|
|
// the transaction containing it.
|
|
|
|
//
|
|
|
|
// The returned ConfirmationEvent should properly notify the client once
|
|
|
|
// the specified number of confirmations has been reached for the txid,
|
|
|
|
// as well as if the original tx gets re-org'd out of the mainchain. The
|
|
|
|
// heightHint parameter is provided as a convenience to light clients.
|
|
|
|
// It heightHint denotes the earliest height in the blockchain in which
|
|
|
|
// the target txid _could_ have been included in the chain. This can be
|
|
|
|
// used to bound the search space when checking to see if a notification
|
|
|
|
// can immediately be dispatched due to historical data.
|
2016-11-28 06:15:48 +03:00
|
|
|
//
|
|
|
|
// NOTE: Dispatching notifications to multiple clients subscribed to
|
|
|
|
// the same (txid, numConfs) tuple MUST be supported.
|
2018-12-07 08:14:13 +03:00
|
|
|
RegisterConfirmationsNtfn(txid *chainhash.Hash, pkScript []byte,
|
|
|
|
numConfs, heightHint uint32) (*ConfirmationEvent, error)
|
2016-02-27 04:01:08 +03:00
|
|
|
|
|
|
|
// RegisterSpendNtfn registers an intent to be notified once the target
|
2018-07-18 04:47:01 +03:00
|
|
|
// outpoint is successfully spent within a transaction. The script that
|
|
|
|
// the outpoint creates must also be specified. This allows this
|
2018-12-07 08:14:13 +03:00
|
|
|
// interface to be implemented by BIP 158-like filtering. If a nil
|
|
|
|
// outpoint is passed in, then not only should we match on the script,
|
|
|
|
// but we should also dispatch once a transaction spends the output
|
|
|
|
// containing said script. This can be useful in instances where we only
|
|
|
|
// know the script in advance, but not the outpoint itself.
|
|
|
|
//
|
|
|
|
// The returned SpendEvent will receive a send on the 'Spend'
|
|
|
|
// transaction once a transaction spending the input is detected on the
|
|
|
|
// blockchain. The heightHint parameter is provided as a convenience to
|
|
|
|
// light clients. It denotes the earliest height in the blockchain in
|
|
|
|
// which the target output could have been spent.
|
2016-06-21 07:27:38 +03:00
|
|
|
//
|
2018-07-17 10:13:06 +03:00
|
|
|
// NOTE: The notification should only be triggered when the spending
|
|
|
|
// transaction receives a single confirmation.
|
2016-11-28 06:15:48 +03:00
|
|
|
//
|
|
|
|
// NOTE: Dispatching notifications to multiple clients subscribed to a
|
|
|
|
// spend of the same outpoint MUST be supported.
|
2018-07-18 04:47:01 +03:00
|
|
|
RegisterSpendNtfn(outpoint *wire.OutPoint, pkScript []byte,
|
2018-07-18 05:02:25 +03:00
|
|
|
heightHint uint32) (*SpendEvent, error)
|
2016-01-07 00:01:50 +03:00
|
|
|
|
2016-06-21 07:31:05 +03:00
|
|
|
// RegisterBlockEpochNtfn registers an intent to be notified of each
|
|
|
|
// new block connected to the tip of the main chain. The returned
|
|
|
|
// BlockEpochEvent struct contains a channel which will be sent upon
|
|
|
|
// for each new block discovered.
|
2018-08-09 10:05:27 +03:00
|
|
|
//
|
|
|
|
// Clients have the option of passing in their best known block.
|
|
|
|
// If they specify a block, the ChainNotifier checks whether the client
|
|
|
|
// is behind on blocks. If they are, the ChainNotifier sends a backlog
|
2018-12-11 05:29:28 +03:00
|
|
|
// of block notifications for the missed blocks. If they do not provide
|
|
|
|
// one, then a notification will be dispatched immediately for the
|
|
|
|
// current tip of the chain upon a successful registration.
|
2018-08-09 10:05:27 +03:00
|
|
|
RegisterBlockEpochNtfn(*BlockEpoch) (*BlockEpochEvent, error)
|
2016-06-21 07:31:05 +03:00
|
|
|
|
2016-02-27 04:01:08 +03:00
|
|
|
// Start the ChainNotifier. Once started, the implementation should be
|
|
|
|
// ready, and able to receive notification registrations from clients.
|
2016-01-07 00:01:50 +03:00
|
|
|
Start() error
|
2016-02-27 04:01:08 +03:00
|
|
|
|
|
|
|
// Stops the concrete ChainNotifier. Once stopped, the ChainNotifier
|
|
|
|
// should disallow any future requests from potential clients.
|
2019-10-03 18:22:43 +03:00
|
|
|
// Additionally, all pending client notifications will be canceled
|
2016-02-27 04:01:08 +03:00
|
|
|
// by closing the related channels on the *Event's.
|
2016-01-07 00:01:50 +03:00
|
|
|
Stop() error
|
|
|
|
}
|
|
|
|
|
2016-12-25 03:39:30 +03:00
|
|
|
// TxConfirmation carries some additional block-level details of the exact
|
2017-02-21 03:29:05 +03:00
|
|
|
// block that specified transactions was confirmed within.
|
2016-12-25 03:39:30 +03:00
|
|
|
type TxConfirmation struct {
|
|
|
|
// BlockHash is the hash of the block that confirmed the original
|
|
|
|
// transition.
|
2017-01-06 00:56:27 +03:00
|
|
|
BlockHash *chainhash.Hash
|
2016-12-25 03:39:30 +03:00
|
|
|
|
|
|
|
// BlockHeight is the height of the block in which the transaction was
|
|
|
|
// confirmed within.
|
|
|
|
BlockHeight uint32
|
|
|
|
|
|
|
|
// TxIndex is the index within the block of the ultimate confirmed
|
|
|
|
// transaction.
|
|
|
|
TxIndex uint32
|
2018-12-11 05:24:04 +03:00
|
|
|
|
|
|
|
// Tx is the transaction for which the notification was requested for.
|
|
|
|
Tx *wire.MsgTx
|
2016-12-25 03:39:30 +03:00
|
|
|
}
|
2016-06-21 07:31:05 +03:00
|
|
|
|
2016-02-27 04:01:08 +03:00
|
|
|
// ConfirmationEvent encapsulates a confirmation notification. With this struct,
|
|
|
|
// callers can be notified of: the instance the target txid reaches the targeted
|
2018-03-19 21:48:44 +03:00
|
|
|
// number of confirmations, how many confirmations are left for the target txid
|
|
|
|
// to be fully confirmed at every new block height, and also in the event that
|
|
|
|
// the original txid becomes disconnected from the blockchain as a result of a
|
|
|
|
// re-org.
|
2016-02-27 04:01:08 +03:00
|
|
|
//
|
|
|
|
// Once the txid reaches the specified number of confirmations, the 'Confirmed'
|
2017-05-11 03:43:11 +03:00
|
|
|
// channel will be sent upon fulfilling the notification.
|
2016-02-27 04:01:08 +03:00
|
|
|
//
|
|
|
|
// If the event that the original transaction becomes re-org'd out of the main
|
|
|
|
// chain, the 'NegativeConf' will be sent upon with a value representing the
|
|
|
|
// depth of the re-org.
|
2018-12-11 05:27:25 +03:00
|
|
|
//
|
|
|
|
// NOTE: If the caller wishes to cancel their registered spend notification,
|
|
|
|
// the Cancel closure MUST be called.
|
2016-02-17 01:44:49 +03:00
|
|
|
type ConfirmationEvent struct {
|
2016-12-25 03:39:30 +03:00
|
|
|
// Confirmed is a channel that will be sent upon once the transaction
|
|
|
|
// has been fully confirmed. The struct sent will contain all the
|
|
|
|
// details of the channel's confirmation.
|
2018-10-05 12:07:55 +03:00
|
|
|
//
|
|
|
|
// NOTE: This channel must be buffered.
|
|
|
|
Confirmed chan *TxConfirmation
|
2016-12-25 03:39:30 +03:00
|
|
|
|
2018-03-19 21:48:44 +03:00
|
|
|
// Updates is a channel that will sent upon, at every incremental
|
|
|
|
// confirmation, how many confirmations are left to declare the
|
|
|
|
// transaction as fully confirmed.
|
2018-10-05 12:07:55 +03:00
|
|
|
//
|
|
|
|
// NOTE: This channel must be buffered with the number of required
|
|
|
|
// confirmations.
|
|
|
|
Updates chan uint32
|
2018-03-19 21:48:44 +03:00
|
|
|
|
2018-10-05 12:07:55 +03:00
|
|
|
// NegativeConf is a channel that will be sent upon if the transaction
|
|
|
|
// confirms, but is later reorged out of the chain. The integer sent
|
|
|
|
// through the channel represents the reorg depth.
|
|
|
|
//
|
|
|
|
// NOTE: This channel must be buffered.
|
|
|
|
NegativeConf chan int32
|
2018-12-11 05:27:25 +03:00
|
|
|
|
2018-12-11 05:29:22 +03:00
|
|
|
// Done is a channel that gets sent upon once the confirmation request
|
|
|
|
// is no longer under the risk of being reorged out of the chain.
|
|
|
|
//
|
|
|
|
// NOTE: This channel must be buffered.
|
|
|
|
Done chan struct{}
|
|
|
|
|
2018-12-11 05:27:25 +03:00
|
|
|
// Cancel is a closure that should be executed by the caller in the case
|
|
|
|
// that they wish to prematurely abandon their registered confirmation
|
|
|
|
// notification.
|
|
|
|
Cancel func()
|
2018-10-05 12:07:55 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
// NewConfirmationEvent constructs a new ConfirmationEvent with newly opened
|
|
|
|
// channels.
|
2018-12-11 05:27:25 +03:00
|
|
|
func NewConfirmationEvent(numConfs uint32, cancel func()) *ConfirmationEvent {
|
2018-10-05 12:07:55 +03:00
|
|
|
return &ConfirmationEvent{
|
|
|
|
Confirmed: make(chan *TxConfirmation, 1),
|
|
|
|
Updates: make(chan uint32, numConfs),
|
|
|
|
NegativeConf: make(chan int32, 1),
|
2018-12-11 05:29:22 +03:00
|
|
|
Done: make(chan struct{}, 1),
|
2018-12-11 05:27:25 +03:00
|
|
|
Cancel: cancel,
|
2018-10-05 12:07:55 +03:00
|
|
|
}
|
2016-02-17 01:44:49 +03:00
|
|
|
}
|
|
|
|
|
2016-02-27 04:01:08 +03:00
|
|
|
// SpendDetail contains details pertaining to a spent output. This struct itself
|
|
|
|
// is the spentness notification. It includes the original outpoint which triggered
|
|
|
|
// the notification, the hash of the transaction spending the output, the
|
|
|
|
// spending transaction itself, and finally the input index which spent the
|
|
|
|
// target output.
|
2016-02-17 01:44:49 +03:00
|
|
|
type SpendDetail struct {
|
2016-02-27 03:30:27 +03:00
|
|
|
SpentOutPoint *wire.OutPoint
|
2017-01-06 00:56:27 +03:00
|
|
|
SpenderTxHash *chainhash.Hash
|
2016-02-27 03:30:27 +03:00
|
|
|
SpendingTx *wire.MsgTx
|
2016-02-17 01:44:49 +03:00
|
|
|
SpenderInputIndex uint32
|
2016-06-21 07:33:41 +03:00
|
|
|
SpendingHeight int32
|
2016-02-17 01:44:49 +03:00
|
|
|
}
|
|
|
|
|
2016-02-27 04:01:08 +03:00
|
|
|
// SpendEvent encapsulates a spentness notification. Its only field 'Spend' will
|
|
|
|
// be sent upon once the target output passed into RegisterSpendNtfn has been
|
|
|
|
// spent on the blockchain.
|
2017-02-21 03:29:05 +03:00
|
|
|
//
|
|
|
|
// NOTE: If the caller wishes to cancel their registered spend notification,
|
|
|
|
// the Cancel closure MUST be called.
|
2016-02-17 01:44:49 +03:00
|
|
|
type SpendEvent struct {
|
2017-02-21 03:29:05 +03:00
|
|
|
// Spend is a receive only channel which will be sent upon once the
|
|
|
|
// target outpoint has been spent.
|
2018-10-05 12:07:55 +03:00
|
|
|
//
|
|
|
|
// NOTE: This channel must be buffered.
|
|
|
|
Spend chan *SpendDetail
|
|
|
|
|
|
|
|
// Reorg is a channel that will be sent upon once we detect the spending
|
|
|
|
// transaction of the outpoint in question has been reorged out of the
|
|
|
|
// chain.
|
|
|
|
//
|
|
|
|
// NOTE: This channel must be buffered.
|
|
|
|
Reorg chan struct{}
|
2017-02-21 03:29:05 +03:00
|
|
|
|
2018-12-11 05:29:22 +03:00
|
|
|
// Done is a channel that gets sent upon once the confirmation request
|
|
|
|
// is no longer under the risk of being reorged out of the chain.
|
|
|
|
//
|
|
|
|
// NOTE: This channel must be buffered.
|
|
|
|
Done chan struct{}
|
|
|
|
|
2018-12-11 05:27:25 +03:00
|
|
|
// Cancel is a closure that should be executed by the caller in the case
|
|
|
|
// that they wish to prematurely abandon their registered spend
|
2017-02-21 03:29:05 +03:00
|
|
|
// notification.
|
|
|
|
Cancel func()
|
2015-12-16 23:38:21 +03:00
|
|
|
}
|
2016-06-21 07:31:05 +03:00
|
|
|
|
2018-10-05 12:07:55 +03:00
|
|
|
// NewSpendEvent constructs a new SpendEvent with newly opened channels.
|
|
|
|
func NewSpendEvent(cancel func()) *SpendEvent {
|
|
|
|
return &SpendEvent{
|
|
|
|
Spend: make(chan *SpendDetail, 1),
|
|
|
|
Reorg: make(chan struct{}, 1),
|
2018-12-11 05:29:22 +03:00
|
|
|
Done: make(chan struct{}, 1),
|
2018-10-05 12:07:55 +03:00
|
|
|
Cancel: cancel,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-01-13 08:01:50 +03:00
|
|
|
// BlockEpoch represents metadata concerning each new block connected to the
|
2016-06-21 07:31:05 +03:00
|
|
|
// main chain.
|
|
|
|
type BlockEpoch struct {
|
2017-05-11 03:43:11 +03:00
|
|
|
// Hash is the block hash of the latest block to be added to the tip of
|
2017-02-21 03:29:05 +03:00
|
|
|
// the main chain.
|
|
|
|
Hash *chainhash.Hash
|
|
|
|
|
|
|
|
// Height is the height of the latest block to be added to the tip of
|
|
|
|
// the main chain.
|
2016-06-21 07:31:05 +03:00
|
|
|
Height int32
|
|
|
|
}
|
|
|
|
|
|
|
|
// BlockEpochEvent encapsulates an on-going stream of block epoch
|
2017-02-21 03:29:05 +03:00
|
|
|
// notifications. Its only field 'Epochs' will be sent upon for each new block
|
2016-06-21 07:31:05 +03:00
|
|
|
// connected to the main-chain.
|
2017-02-21 03:29:05 +03:00
|
|
|
//
|
|
|
|
// NOTE: If the caller wishes to cancel their registered block epoch
|
|
|
|
// notification, the Cancel closure MUST be called.
|
2016-06-21 07:31:05 +03:00
|
|
|
type BlockEpochEvent struct {
|
2017-02-21 03:29:05 +03:00
|
|
|
// Epochs is a receive only channel that will be sent upon each time a
|
|
|
|
// new block is connected to the end of the main chain.
|
2018-10-05 12:07:55 +03:00
|
|
|
//
|
|
|
|
// NOTE: This channel must be buffered.
|
|
|
|
Epochs <-chan *BlockEpoch
|
2017-02-21 03:29:05 +03:00
|
|
|
|
2018-12-11 05:27:25 +03:00
|
|
|
// Cancel is a closure that should be executed by the caller in the case
|
|
|
|
// that they wish to abandon their registered block epochs notification.
|
2017-02-21 03:29:05 +03:00
|
|
|
Cancel func()
|
2016-06-21 07:31:05 +03:00
|
|
|
}
|
2016-08-04 08:13:10 +03:00
|
|
|
|
|
|
|
// NotifierDriver represents a "driver" for a particular interface. A driver is
|
2016-11-28 06:15:48 +03:00
|
|
|
// identified by a globally unique string identifier along with a 'New()'
|
2016-08-04 08:13:10 +03:00
|
|
|
// method which is responsible for initializing a particular ChainNotifier
|
|
|
|
// concrete implementation.
|
|
|
|
type NotifierDriver struct {
|
2016-11-28 06:15:48 +03:00
|
|
|
// NotifierType is a string which uniquely identifies the ChainNotifier
|
2016-08-04 08:13:10 +03:00
|
|
|
// that this driver, drives.
|
|
|
|
NotifierType string
|
|
|
|
|
|
|
|
// New creates a new instance of a concrete ChainNotifier
|
|
|
|
// implementation given a variadic set up arguments. The function takes
|
2018-02-07 06:11:11 +03:00
|
|
|
// a variadic number of interface parameters in order to provide
|
2016-11-28 06:15:48 +03:00
|
|
|
// initialization flexibility, thereby accommodating several potential
|
2016-08-04 08:13:10 +03:00
|
|
|
// ChainNotifier implementations.
|
|
|
|
New func(args ...interface{}) (ChainNotifier, error)
|
|
|
|
}
|
|
|
|
|
|
|
|
var (
|
|
|
|
notifiers = make(map[string]*NotifierDriver)
|
|
|
|
registerMtx sync.Mutex
|
|
|
|
)
|
|
|
|
|
|
|
|
// RegisteredNotifiers returns a slice of all currently registered notifiers.
|
|
|
|
//
|
|
|
|
// NOTE: This function is safe for concurrent access.
|
|
|
|
func RegisteredNotifiers() []*NotifierDriver {
|
|
|
|
registerMtx.Lock()
|
|
|
|
defer registerMtx.Unlock()
|
|
|
|
|
|
|
|
drivers := make([]*NotifierDriver, 0, len(notifiers))
|
|
|
|
for _, driver := range notifiers {
|
|
|
|
drivers = append(drivers, driver)
|
|
|
|
}
|
|
|
|
|
|
|
|
return drivers
|
|
|
|
}
|
|
|
|
|
|
|
|
// RegisterNotifier registers a NotifierDriver which is capable of driving a
|
|
|
|
// concrete ChainNotifier interface. In the case that this driver has already
|
|
|
|
// been registered, an error is returned.
|
|
|
|
//
|
|
|
|
// NOTE: This function is safe for concurrent access.
|
|
|
|
func RegisterNotifier(driver *NotifierDriver) error {
|
|
|
|
registerMtx.Lock()
|
|
|
|
defer registerMtx.Unlock()
|
|
|
|
|
|
|
|
if _, ok := notifiers[driver.NotifierType]; ok {
|
|
|
|
return fmt.Errorf("notifier already registered")
|
|
|
|
}
|
|
|
|
|
|
|
|
notifiers[driver.NotifierType] = driver
|
|
|
|
|
|
|
|
return nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// SupportedNotifiers returns a slice of strings that represent the database
|
|
|
|
// drivers that have been registered and are therefore supported.
|
|
|
|
//
|
|
|
|
// NOTE: This function is safe for concurrent access.
|
|
|
|
func SupportedNotifiers() []string {
|
|
|
|
registerMtx.Lock()
|
|
|
|
defer registerMtx.Unlock()
|
|
|
|
|
|
|
|
supportedNotifiers := make([]string, 0, len(notifiers))
|
|
|
|
for driverName := range notifiers {
|
|
|
|
supportedNotifiers = append(supportedNotifiers, driverName)
|
|
|
|
}
|
|
|
|
|
|
|
|
return supportedNotifiers
|
|
|
|
}
|
2018-08-09 10:05:28 +03:00
|
|
|
|
|
|
|
// ChainConn enables notifiers to pass in their chain backend to interface
|
|
|
|
// functions that require it.
|
|
|
|
type ChainConn interface {
|
|
|
|
// GetBlockHeader returns the block header for a hash.
|
|
|
|
GetBlockHeader(blockHash *chainhash.Hash) (*wire.BlockHeader, error)
|
|
|
|
|
|
|
|
// GetBlockHeaderVerbose returns the verbose block header for a hash.
|
|
|
|
GetBlockHeaderVerbose(blockHash *chainhash.Hash) (
|
|
|
|
*btcjson.GetBlockHeaderVerboseResult, error)
|
|
|
|
|
|
|
|
// GetBlockHash returns the hash from a block height.
|
|
|
|
GetBlockHash(blockHeight int64) (*chainhash.Hash, error)
|
|
|
|
}
|
2018-08-09 10:05:29 +03:00
|
|
|
|
|
|
|
// GetCommonBlockAncestorHeight takes in:
|
|
|
|
// (1) the hash of a block that has been reorged out of the main chain
|
|
|
|
// (2) the hash of the block of the same height from the main chain
|
|
|
|
// It returns the height of the nearest common ancestor between the two hashes,
|
|
|
|
// or an error
|
|
|
|
func GetCommonBlockAncestorHeight(chainConn ChainConn, reorgHash,
|
|
|
|
chainHash chainhash.Hash) (int32, error) {
|
|
|
|
|
|
|
|
for reorgHash != chainHash {
|
|
|
|
reorgHeader, err := chainConn.GetBlockHeader(&reorgHash)
|
|
|
|
if err != nil {
|
|
|
|
return 0, fmt.Errorf("unable to get header for hash=%v: %v",
|
|
|
|
reorgHash, err)
|
|
|
|
}
|
|
|
|
chainHeader, err := chainConn.GetBlockHeader(&chainHash)
|
|
|
|
if err != nil {
|
|
|
|
return 0, fmt.Errorf("unable to get header for hash=%v: %v",
|
|
|
|
chainHash, err)
|
|
|
|
}
|
|
|
|
reorgHash = reorgHeader.PrevBlock
|
|
|
|
chainHash = chainHeader.PrevBlock
|
|
|
|
}
|
|
|
|
|
|
|
|
verboseHeader, err := chainConn.GetBlockHeaderVerbose(&chainHash)
|
|
|
|
if err != nil {
|
|
|
|
return 0, fmt.Errorf("unable to get verbose header for hash=%v: %v",
|
|
|
|
chainHash, err)
|
|
|
|
}
|
|
|
|
|
|
|
|
return verboseHeader.Height, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// GetClientMissedBlocks uses a client's best block to determine what blocks
|
|
|
|
// it missed being notified about, and returns them in a slice. Its
|
|
|
|
// backendStoresReorgs parameter tells it whether or not the notifier's
|
|
|
|
// chainConn stores information about blocks that have been reorged out of the
|
|
|
|
// chain, which allows GetClientMissedBlocks to find out whether the client's
|
|
|
|
// best block has been reorged out of the chain, rewind to the common ancestor
|
|
|
|
// and return blocks starting right after the common ancestor.
|
|
|
|
func GetClientMissedBlocks(chainConn ChainConn, clientBestBlock *BlockEpoch,
|
|
|
|
notifierBestHeight int32, backendStoresReorgs bool) ([]BlockEpoch, error) {
|
|
|
|
|
|
|
|
startingHeight := clientBestBlock.Height
|
|
|
|
if backendStoresReorgs {
|
|
|
|
// If a reorg causes the client's best hash to be incorrect,
|
|
|
|
// retrieve the closest common ancestor and dispatch
|
|
|
|
// notifications from there.
|
|
|
|
hashAtBestHeight, err := chainConn.GetBlockHash(
|
|
|
|
int64(clientBestBlock.Height))
|
|
|
|
if err != nil {
|
|
|
|
return nil, fmt.Errorf("unable to find blockhash for "+
|
|
|
|
"height=%d: %v", clientBestBlock.Height, err)
|
|
|
|
}
|
|
|
|
|
|
|
|
startingHeight, err = GetCommonBlockAncestorHeight(
|
|
|
|
chainConn, *clientBestBlock.Hash, *hashAtBestHeight,
|
|
|
|
)
|
|
|
|
if err != nil {
|
|
|
|
return nil, fmt.Errorf("unable to find common ancestor: "+
|
|
|
|
"%v", err)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// We want to start dispatching historical notifications from the block
|
|
|
|
// right after the client's best block, to avoid a redundant notification.
|
|
|
|
missedBlocks, err := getMissedBlocks(
|
|
|
|
chainConn, startingHeight+1, notifierBestHeight+1,
|
|
|
|
)
|
|
|
|
if err != nil {
|
|
|
|
return nil, fmt.Errorf("unable to get missed blocks: %v", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
return missedBlocks, nil
|
|
|
|
}
|
|
|
|
|
2018-10-05 12:07:55 +03:00
|
|
|
// RewindChain handles internal state updates for the notifier's TxNotifier It
|
|
|
|
// has no effect if given a height greater than or equal to our current best
|
2018-08-09 10:05:29 +03:00
|
|
|
// known height. It returns the new best block for the notifier.
|
2018-10-05 12:07:55 +03:00
|
|
|
func RewindChain(chainConn ChainConn, txNotifier *TxNotifier,
|
2018-08-09 10:05:29 +03:00
|
|
|
currBestBlock BlockEpoch, targetHeight int32) (BlockEpoch, error) {
|
|
|
|
|
|
|
|
newBestBlock := BlockEpoch{
|
|
|
|
Height: currBestBlock.Height,
|
|
|
|
Hash: currBestBlock.Hash,
|
|
|
|
}
|
|
|
|
|
|
|
|
for height := currBestBlock.Height; height > targetHeight; height-- {
|
|
|
|
hash, err := chainConn.GetBlockHash(int64(height - 1))
|
|
|
|
if err != nil {
|
|
|
|
return newBestBlock, fmt.Errorf("unable to "+
|
|
|
|
"find blockhash for disconnected height=%d: %v",
|
|
|
|
height, err)
|
|
|
|
}
|
|
|
|
|
|
|
|
Log.Infof("Block disconnected from main chain: "+
|
|
|
|
"height=%v, sha=%v", height, newBestBlock.Hash)
|
|
|
|
|
2018-10-05 12:07:55 +03:00
|
|
|
err = txNotifier.DisconnectTip(uint32(height))
|
2018-08-09 10:05:29 +03:00
|
|
|
if err != nil {
|
|
|
|
return newBestBlock, fmt.Errorf("unable to "+
|
|
|
|
" disconnect tip for height=%d: %v",
|
|
|
|
height, err)
|
|
|
|
}
|
|
|
|
newBestBlock.Height = height - 1
|
|
|
|
newBestBlock.Hash = hash
|
|
|
|
}
|
|
|
|
return newBestBlock, nil
|
|
|
|
}
|
|
|
|
|
2018-08-09 10:05:30 +03:00
|
|
|
// HandleMissedBlocks is called when the chain backend for a notifier misses a
|
|
|
|
// series of blocks, handling a reorg if necessary. Its backendStoresReorgs
|
|
|
|
// parameter tells it whether or not the notifier's chainConn stores
|
|
|
|
// information about blocks that have been reorged out of the chain, which allows
|
|
|
|
// HandleMissedBlocks to check whether the notifier's best block has been
|
|
|
|
// reorged out, and rewind the chain accordingly. It returns the best block for
|
|
|
|
// the notifier and a slice of the missed blocks. The new best block needs to be
|
|
|
|
// returned in case a chain rewind occurs and partially completes before
|
|
|
|
// erroring. In the case where there is no rewind, the notifier's
|
|
|
|
// current best block is returned.
|
2018-10-05 12:07:55 +03:00
|
|
|
func HandleMissedBlocks(chainConn ChainConn, txNotifier *TxNotifier,
|
2018-08-09 10:05:30 +03:00
|
|
|
currBestBlock BlockEpoch, newHeight int32,
|
|
|
|
backendStoresReorgs bool) (BlockEpoch, []BlockEpoch, error) {
|
|
|
|
|
|
|
|
startingHeight := currBestBlock.Height
|
|
|
|
|
|
|
|
if backendStoresReorgs {
|
|
|
|
// If a reorg causes our best hash to be incorrect, rewind the
|
|
|
|
// chain so our best block is set to the closest common
|
|
|
|
// ancestor, then dispatch notifications from there.
|
|
|
|
hashAtBestHeight, err :=
|
|
|
|
chainConn.GetBlockHash(int64(currBestBlock.Height))
|
|
|
|
if err != nil {
|
|
|
|
return currBestBlock, nil, fmt.Errorf("unable to find "+
|
|
|
|
"blockhash for height=%d: %v",
|
|
|
|
currBestBlock.Height, err)
|
|
|
|
}
|
|
|
|
|
|
|
|
startingHeight, err = GetCommonBlockAncestorHeight(
|
|
|
|
chainConn, *currBestBlock.Hash, *hashAtBestHeight,
|
|
|
|
)
|
|
|
|
if err != nil {
|
|
|
|
return currBestBlock, nil, fmt.Errorf("unable to find "+
|
|
|
|
"common ancestor: %v", err)
|
|
|
|
}
|
|
|
|
|
2018-10-05 12:07:55 +03:00
|
|
|
currBestBlock, err = RewindChain(chainConn, txNotifier,
|
2018-08-09 10:05:30 +03:00
|
|
|
currBestBlock, startingHeight)
|
|
|
|
if err != nil {
|
|
|
|
return currBestBlock, nil, fmt.Errorf("unable to "+
|
|
|
|
"rewind chain: %v", err)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// We want to start dispatching historical notifications from the block
|
|
|
|
// right after our best block, to avoid a redundant notification.
|
|
|
|
missedBlocks, err := getMissedBlocks(chainConn, startingHeight+1, newHeight)
|
|
|
|
if err != nil {
|
|
|
|
return currBestBlock, nil, fmt.Errorf("unable to get missed "+
|
|
|
|
"blocks: %v", err)
|
|
|
|
}
|
|
|
|
|
|
|
|
return currBestBlock, missedBlocks, nil
|
|
|
|
}
|
|
|
|
|
2018-08-09 10:05:29 +03:00
|
|
|
// getMissedBlocks returns a slice of blocks: [startingHeight, endingHeight)
|
|
|
|
// fetched from the chain.
|
|
|
|
func getMissedBlocks(chainConn ChainConn, startingHeight,
|
|
|
|
endingHeight int32) ([]BlockEpoch, error) {
|
|
|
|
|
|
|
|
numMissedBlocks := endingHeight - startingHeight
|
|
|
|
if numMissedBlocks < 0 {
|
|
|
|
return nil, fmt.Errorf("starting height %d is greater than "+
|
|
|
|
"ending height %d", startingHeight, endingHeight)
|
|
|
|
}
|
|
|
|
|
|
|
|
missedBlocks := make([]BlockEpoch, 0, numMissedBlocks)
|
|
|
|
for height := startingHeight; height < endingHeight; height++ {
|
|
|
|
hash, err := chainConn.GetBlockHash(int64(height))
|
|
|
|
if err != nil {
|
2018-08-09 10:05:30 +03:00
|
|
|
return nil, fmt.Errorf("unable to find blockhash for "+
|
|
|
|
"height=%d: %v", height, err)
|
2018-08-09 10:05:29 +03:00
|
|
|
}
|
|
|
|
missedBlocks = append(missedBlocks,
|
|
|
|
BlockEpoch{Hash: hash, Height: height})
|
|
|
|
}
|
|
|
|
|
|
|
|
return missedBlocks, nil
|
|
|
|
}
|
2019-06-28 05:09:44 +03:00
|
|
|
|
|
|
|
// TxIndexConn abstracts an RPC backend with txindex enabled.
|
|
|
|
type TxIndexConn interface {
|
|
|
|
// GetRawTransactionVerbose returns the transaction identified by the
|
|
|
|
// passed chain hash, and returns additional information such as the
|
|
|
|
// block that the transaction confirmed.
|
|
|
|
GetRawTransactionVerbose(*chainhash.Hash) (*btcjson.TxRawResult, error)
|
|
|
|
|
|
|
|
// GetBlockVerbose returns the block identified by the chain hash along
|
|
|
|
// with additional information such as the block's height in the chain.
|
|
|
|
GetBlockVerbose(*chainhash.Hash) (*btcjson.GetBlockVerboseResult, error)
|
|
|
|
}
|
|
|
|
|
|
|
|
// ConfDetailsFromTxIndex looks up whether a transaction is already included in
|
|
|
|
// a block in the active chain by using the backend node's transaction index.
|
|
|
|
// If the transaction is found its TxConfStatus is returned. If it was found in
|
|
|
|
// the mempool this will be TxFoundMempool, if it is found in a block this will
|
|
|
|
// be TxFoundIndex. Otherwise TxNotFoundIndex is returned. If the tx is found
|
|
|
|
// in a block its confirmation details are also returned.
|
2019-06-28 05:10:34 +03:00
|
|
|
func ConfDetailsFromTxIndex(chainConn TxIndexConn, r ConfRequest,
|
2019-06-28 05:09:44 +03:00
|
|
|
txNotFoundErr string) (*TxConfirmation, TxConfStatus, error) {
|
|
|
|
|
|
|
|
// If the transaction has some or all of its confirmations required,
|
|
|
|
// then we may be able to dispatch it immediately.
|
2019-06-28 05:10:34 +03:00
|
|
|
rawTxRes, err := chainConn.GetRawTransactionVerbose(&r.TxID)
|
2019-06-28 05:09:44 +03:00
|
|
|
if err != nil {
|
|
|
|
// If the transaction lookup was successful, but it wasn't found
|
|
|
|
// within the index itself, then we can exit early. We'll also
|
|
|
|
// need to look at the error message returned as the error code
|
|
|
|
// is used for multiple errors.
|
|
|
|
jsonErr, ok := err.(*btcjson.RPCError)
|
|
|
|
if ok && jsonErr.Code == btcjson.ErrRPCNoTxInfo &&
|
|
|
|
strings.Contains(jsonErr.Message, txNotFoundErr) {
|
|
|
|
|
|
|
|
return nil, TxNotFoundIndex, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
return nil, TxNotFoundIndex,
|
2019-06-28 05:10:34 +03:00
|
|
|
fmt.Errorf("unable to query for txid %v: %v",
|
|
|
|
r.TxID, err)
|
2019-06-28 05:09:44 +03:00
|
|
|
}
|
|
|
|
|
2019-06-28 05:11:25 +03:00
|
|
|
// Deserialize the hex-encoded transaction to include it in the
|
|
|
|
// confirmation details.
|
|
|
|
rawTx, err := hex.DecodeString(rawTxRes.Hex)
|
|
|
|
if err != nil {
|
|
|
|
return nil, TxNotFoundIndex,
|
|
|
|
fmt.Errorf("unable to deserialize tx %v: %v",
|
|
|
|
r.TxID, err)
|
|
|
|
}
|
|
|
|
var tx wire.MsgTx
|
|
|
|
if err := tx.Deserialize(bytes.NewReader(rawTx)); err != nil {
|
|
|
|
return nil, TxNotFoundIndex,
|
|
|
|
fmt.Errorf("unable to deserialize tx %v: %v",
|
|
|
|
r.TxID, err)
|
|
|
|
}
|
|
|
|
|
|
|
|
// Ensure the transaction matches our confirmation request in terms of
|
|
|
|
// txid and pkscript.
|
|
|
|
if !r.MatchesTx(&tx) {
|
|
|
|
return nil, TxNotFoundIndex,
|
|
|
|
fmt.Errorf("unable to locate tx %v", r.TxID)
|
|
|
|
}
|
|
|
|
|
2019-06-28 05:09:44 +03:00
|
|
|
// Make sure we actually retrieved a transaction that is included in a
|
|
|
|
// block. If not, the transaction must be unconfirmed (in the mempool),
|
|
|
|
// and we'll return TxFoundMempool together with a nil TxConfirmation.
|
|
|
|
if rawTxRes.BlockHash == "" {
|
|
|
|
return nil, TxFoundMempool, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// As we need to fully populate the returned TxConfirmation struct,
|
|
|
|
// grab the block in which the transaction was confirmed so we can
|
|
|
|
// locate its exact index within the block.
|
|
|
|
blockHash, err := chainhash.NewHashFromStr(rawTxRes.BlockHash)
|
|
|
|
if err != nil {
|
|
|
|
return nil, TxNotFoundIndex,
|
|
|
|
fmt.Errorf("unable to get block hash %v for "+
|
|
|
|
"historical dispatch: %v", rawTxRes.BlockHash, err)
|
|
|
|
}
|
|
|
|
block, err := chainConn.GetBlockVerbose(blockHash)
|
|
|
|
if err != nil {
|
|
|
|
return nil, TxNotFoundIndex,
|
|
|
|
fmt.Errorf("unable to get block with hash %v for "+
|
|
|
|
"historical dispatch: %v", blockHash, err)
|
|
|
|
}
|
|
|
|
|
|
|
|
// If the block was obtained, locate the transaction's index within the
|
|
|
|
// block so we can give the subscriber full confirmation details.
|
2019-06-28 05:10:34 +03:00
|
|
|
txidStr := r.TxID.String()
|
2019-06-28 05:09:44 +03:00
|
|
|
for txIndex, txHash := range block.Tx {
|
|
|
|
if txHash != txidStr {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
|
|
|
|
return &TxConfirmation{
|
|
|
|
Tx: &tx,
|
|
|
|
BlockHash: blockHash,
|
|
|
|
BlockHeight: uint32(block.Height),
|
|
|
|
TxIndex: uint32(txIndex),
|
|
|
|
}, TxFoundIndex, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// We return an error because we should have found the transaction
|
|
|
|
// within the block, but didn't.
|
|
|
|
return nil, TxNotFoundIndex, fmt.Errorf("unable to locate "+
|
2019-06-28 05:10:34 +03:00
|
|
|
"tx %v in block %v", r.TxID, blockHash)
|
2019-06-28 05:09:44 +03:00
|
|
|
}
|