2018-12-07 09:06:36 +01:00
|
|
|
package sweep
|
|
|
|
|
|
|
|
import (
|
2023-10-24 02:14:52 +02:00
|
|
|
"errors"
|
2024-02-28 16:00:43 +01:00
|
|
|
"fmt"
|
2018-12-07 09:06:36 +01:00
|
|
|
"os"
|
|
|
|
"runtime/pprof"
|
2024-02-28 16:00:43 +01:00
|
|
|
"sync/atomic"
|
2018-12-07 09:06:36 +01:00
|
|
|
"testing"
|
|
|
|
"time"
|
|
|
|
|
2022-02-23 14:48:00 +01:00
|
|
|
"github.com/btcsuite/btcd/btcec/v2"
|
|
|
|
"github.com/btcsuite/btcd/btcutil"
|
2018-12-07 09:06:36 +01:00
|
|
|
"github.com/btcsuite/btcd/chaincfg/chainhash"
|
2020-12-07 10:40:08 +01:00
|
|
|
"github.com/btcsuite/btcd/txscript"
|
2018-12-07 09:06:36 +01:00
|
|
|
"github.com/btcsuite/btcd/wire"
|
|
|
|
"github.com/lightningnetwork/lnd/build"
|
2023-10-24 07:14:21 +02:00
|
|
|
"github.com/lightningnetwork/lnd/chainntnfs"
|
2024-01-10 21:18:40 +01:00
|
|
|
"github.com/lightningnetwork/lnd/channeldb"
|
2023-10-26 08:27:46 +02:00
|
|
|
"github.com/lightningnetwork/lnd/fn"
|
2019-01-16 15:47:43 +01:00
|
|
|
"github.com/lightningnetwork/lnd/input"
|
2018-12-07 09:06:36 +01:00
|
|
|
"github.com/lightningnetwork/lnd/keychain"
|
2023-10-26 08:27:46 +02:00
|
|
|
lnmock "github.com/lightningnetwork/lnd/lntest/mock"
|
2024-02-28 16:00:43 +01:00
|
|
|
"github.com/lightningnetwork/lnd/lntest/wait"
|
2019-05-02 01:06:19 +02:00
|
|
|
"github.com/lightningnetwork/lnd/lnwallet"
|
2019-10-31 03:43:05 +01:00
|
|
|
"github.com/lightningnetwork/lnd/lnwallet/chainfee"
|
2024-01-30 20:25:58 +01:00
|
|
|
"github.com/stretchr/testify/mock"
|
2020-09-04 11:28:17 +02:00
|
|
|
"github.com/stretchr/testify/require"
|
2018-12-07 09:06:36 +01:00
|
|
|
)
|
|
|
|
|
|
|
|
var (
|
|
|
|
testLog = build.NewSubLogger("SWPR_TEST", nil)
|
|
|
|
|
|
|
|
testMaxSweepAttempts = 3
|
|
|
|
|
2024-03-19 22:56:56 +01:00
|
|
|
testMaxInputsPerTx = uint32(3)
|
2019-05-02 01:06:19 +02:00
|
|
|
|
2023-11-03 12:20:10 +01:00
|
|
|
defaultFeePref = Params{Fee: FeeEstimateInfo{ConfTarget: 1}}
|
2024-01-17 10:21:09 +01:00
|
|
|
|
|
|
|
errDummy = errors.New("dummy error")
|
2018-12-07 09:06:36 +01:00
|
|
|
)
|
|
|
|
|
|
|
|
type sweeperTestContext struct {
|
|
|
|
t *testing.T
|
|
|
|
|
|
|
|
sweeper *UtxoSweeper
|
|
|
|
notifier *MockNotifier
|
|
|
|
estimator *mockFeeEstimator
|
|
|
|
backend *mockBackend
|
2024-01-10 21:18:40 +01:00
|
|
|
store SweeperStore
|
2024-02-28 16:00:43 +01:00
|
|
|
publisher *MockBumper
|
2018-12-07 09:06:36 +01:00
|
|
|
|
sweep: make sweeper block-driven instead of time-driven
This commit changes the source that drives the state changes in the
sweeper. Previously we used a ticker with default interval of 30s to
trigger sweepings periodically. The assumption is, within this 30s we'd
batch multiple inputs into one transaction to maximize profits. However,
the efficacy of this batch is questionable.
At a high level, we can put our inputs into two categories - one that's
forced, and one that's not. For forced inputs, we should sweep them
immediately as the force flag indicates they are very urgent, eg,
CPFPing the force closing tx. For non-forced inputs, such as anchors
or HTLCs with CLTV that's far away, we can wait to sweep them till a new
block comes in and triggers the sweeping process.
Eventually, all inputs will be deadline-aware, and the sweeper will
consult our fee bumper about the most economical fee rate to be used for
a given deadline. Since the deadlines here are blockstamp, it's also
easier to manage them if the sweeper is also using blockstamp instead of
timestamp.
2023-10-26 10:00:13 +02:00
|
|
|
publishChan chan wire.MsgTx
|
|
|
|
currentHeight int32
|
2018-12-07 09:06:36 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
var (
|
2019-01-16 15:47:43 +01:00
|
|
|
spendableInputs []*input.BaseInput
|
2024-02-28 16:00:43 +01:00
|
|
|
testInputCount atomic.Uint64
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
testPubKey, _ = btcec.ParsePubKey([]byte{
|
|
|
|
0x04, 0x11, 0xdb, 0x93, 0xe1, 0xdc, 0xdb, 0x8a,
|
|
|
|
0x01, 0x6b, 0x49, 0x84, 0x0f, 0x8c, 0x53, 0xbc, 0x1e,
|
|
|
|
0xb6, 0x8a, 0x38, 0x2e, 0x97, 0xb1, 0x48, 0x2e, 0xca,
|
|
|
|
0xd7, 0xb1, 0x48, 0xa6, 0x90, 0x9a, 0x5c, 0xb2, 0xe0,
|
|
|
|
0xea, 0xdd, 0xfb, 0x84, 0xcc, 0xf9, 0x74, 0x44, 0x64,
|
|
|
|
0xf8, 0x2e, 0x16, 0x0b, 0xfa, 0x9b, 0x8b, 0x64, 0xf9,
|
|
|
|
0xd4, 0xc0, 0x3f, 0x99, 0x9b, 0x86, 0x43, 0xf6, 0x56,
|
|
|
|
0xb4, 0x12, 0xa3,
|
2022-02-23 14:48:00 +01:00
|
|
|
})
|
2018-12-07 09:06:36 +01:00
|
|
|
)
|
|
|
|
|
2019-01-16 15:47:43 +01:00
|
|
|
func createTestInput(value int64, witnessType input.WitnessType) input.BaseInput {
|
2018-12-07 09:06:36 +01:00
|
|
|
hash := chainhash.Hash{0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
|
|
|
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
|
2024-02-28 16:00:43 +01:00
|
|
|
byte(testInputCount.Add(1))}
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2019-01-16 15:47:43 +01:00
|
|
|
input := input.MakeBaseInput(
|
2018-12-07 09:06:36 +01:00
|
|
|
&wire.OutPoint{
|
|
|
|
Hash: hash,
|
|
|
|
},
|
|
|
|
witnessType,
|
2019-01-16 15:47:43 +01:00
|
|
|
&input.SignDescriptor{
|
2018-12-07 09:06:36 +01:00
|
|
|
Output: &wire.TxOut{
|
|
|
|
Value: value,
|
|
|
|
},
|
|
|
|
KeyDesc: keychain.KeyDescriptor{
|
|
|
|
PubKey: testPubKey,
|
|
|
|
},
|
|
|
|
},
|
|
|
|
0,
|
2020-09-04 11:28:17 +02:00
|
|
|
nil,
|
2018-12-07 09:06:36 +01:00
|
|
|
)
|
|
|
|
|
|
|
|
return input
|
|
|
|
}
|
|
|
|
|
|
|
|
func init() {
|
|
|
|
// Create a set of test spendable inputs.
|
2020-11-06 19:35:01 +01:00
|
|
|
for i := 0; i < 20; i++ {
|
2018-12-07 09:06:36 +01:00
|
|
|
input := createTestInput(int64(10000+i*500),
|
2019-01-16 15:47:43 +01:00
|
|
|
input.CommitmentTimeLock)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
spendableInputs = append(spendableInputs, &input)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func createSweeperTestContext(t *testing.T) *sweeperTestContext {
|
|
|
|
notifier := NewMockNotifier(t)
|
|
|
|
|
2024-01-10 21:18:40 +01:00
|
|
|
// Create new store.
|
|
|
|
cdb, err := channeldb.MakeTestDB(t)
|
|
|
|
require.NoError(t, err)
|
|
|
|
|
|
|
|
var chain chainhash.Hash
|
|
|
|
store, err := NewSweeperStore(cdb, &chain)
|
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2019-12-10 15:32:57 +01:00
|
|
|
backend := newMockBackend(t, notifier)
|
2019-12-10 16:06:45 +01:00
|
|
|
backend.walletUtxos = []*lnwallet.Utxo{
|
|
|
|
{
|
2020-11-09 18:49:44 +01:00
|
|
|
Value: btcutil.Amount(1_000_000),
|
2019-12-10 16:06:45 +01:00
|
|
|
AddressType: lnwallet.WitnessPubKey,
|
|
|
|
},
|
|
|
|
}
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2019-10-31 03:43:05 +01:00
|
|
|
estimator := newMockFeeEstimator(10000, chainfee.FeePerKwFloor)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2023-10-24 06:32:17 +02:00
|
|
|
aggregator := NewSimpleUtxoAggregator(
|
|
|
|
estimator, DefaultMaxFeeRate.FeePerKWeight(),
|
2023-10-30 14:32:46 +01:00
|
|
|
testMaxInputsPerTx,
|
2023-10-24 06:32:17 +02:00
|
|
|
)
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Create a mock fee bumper.
|
|
|
|
mockBumper := &MockBumper{}
|
|
|
|
t.Cleanup(func() {
|
|
|
|
mockBumper.AssertExpectations(t)
|
|
|
|
})
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
ctx := &sweeperTestContext{
|
sweep: make sweeper block-driven instead of time-driven
This commit changes the source that drives the state changes in the
sweeper. Previously we used a ticker with default interval of 30s to
trigger sweepings periodically. The assumption is, within this 30s we'd
batch multiple inputs into one transaction to maximize profits. However,
the efficacy of this batch is questionable.
At a high level, we can put our inputs into two categories - one that's
forced, and one that's not. For forced inputs, we should sweep them
immediately as the force flag indicates they are very urgent, eg,
CPFPing the force closing tx. For non-forced inputs, such as anchors
or HTLCs with CLTV that's far away, we can wait to sweep them till a new
block comes in and triggers the sweeping process.
Eventually, all inputs will be deadline-aware, and the sweeper will
consult our fee bumper about the most economical fee rate to be used for
a given deadline. Since the deadlines here are blockstamp, it's also
easier to manage them if the sweeper is also using blockstamp instead of
timestamp.
2023-10-26 10:00:13 +02:00
|
|
|
notifier: notifier,
|
|
|
|
publishChan: backend.publishChan,
|
|
|
|
t: t,
|
|
|
|
estimator: estimator,
|
|
|
|
backend: backend,
|
|
|
|
store: store,
|
|
|
|
currentHeight: mockChainHeight,
|
2024-02-28 16:00:43 +01:00
|
|
|
publisher: mockBumper,
|
2018-12-07 09:06:36 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
ctx.sweeper = New(&UtxoSweeperConfig{
|
2024-01-31 07:06:47 +01:00
|
|
|
Notifier: notifier,
|
|
|
|
Wallet: backend,
|
|
|
|
Store: store,
|
|
|
|
Signer: &lnmock.DummySigner{},
|
2018-12-07 09:06:36 +01:00
|
|
|
GenSweepScript: func() ([]byte, error) {
|
2021-09-23 21:40:37 +02:00
|
|
|
script := make([]byte, input.P2WPKHSize)
|
2022-07-15 22:25:31 +02:00
|
|
|
script[0] = 0
|
|
|
|
script[1] = 20
|
2018-12-07 09:06:36 +01:00
|
|
|
return script, nil
|
|
|
|
},
|
2018-11-18 05:57:30 +01:00
|
|
|
FeeEstimator: estimator,
|
2018-12-07 09:06:36 +01:00
|
|
|
MaxInputsPerTx: testMaxInputsPerTx,
|
|
|
|
MaxSweepAttempts: testMaxSweepAttempts,
|
2024-01-11 03:38:04 +01:00
|
|
|
MaxFeeRate: DefaultMaxFeeRate,
|
|
|
|
Aggregator: aggregator,
|
2024-01-17 10:21:09 +01:00
|
|
|
Publisher: mockBumper,
|
2018-12-07 09:06:36 +01:00
|
|
|
})
|
|
|
|
|
|
|
|
ctx.sweeper.Start()
|
|
|
|
|
|
|
|
return ctx
|
|
|
|
}
|
|
|
|
|
2019-05-02 01:06:19 +02:00
|
|
|
func (ctx *sweeperTestContext) restartSweeper() {
|
|
|
|
ctx.t.Helper()
|
|
|
|
|
|
|
|
ctx.sweeper.Stop()
|
|
|
|
ctx.sweeper = New(ctx.sweeper.cfg)
|
|
|
|
ctx.sweeper.Start()
|
|
|
|
}
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
func (ctx *sweeperTestContext) finish(expectedGoroutineCount int) {
|
|
|
|
// We assume that when finish is called, sweeper has finished all its
|
|
|
|
// goroutines. This implies that the waitgroup is empty.
|
|
|
|
signalChan := make(chan struct{})
|
|
|
|
go func() {
|
|
|
|
ctx.sweeper.wg.Wait()
|
|
|
|
close(signalChan)
|
|
|
|
}()
|
|
|
|
|
|
|
|
// Simulate exits of the expected number of running goroutines.
|
|
|
|
for i := 0; i < expectedGoroutineCount; i++ {
|
|
|
|
ctx.sweeper.wg.Done()
|
|
|
|
}
|
|
|
|
|
|
|
|
// We now expect the Wait to succeed.
|
|
|
|
select {
|
|
|
|
case <-signalChan:
|
|
|
|
case <-time.After(time.Second):
|
|
|
|
pprof.Lookup("goroutine").WriteTo(os.Stdout, 1)
|
|
|
|
|
|
|
|
ctx.t.Fatalf("lingering goroutines detected after test " +
|
|
|
|
"is finished")
|
|
|
|
}
|
|
|
|
|
|
|
|
// Restore waitgroup state to what it was before.
|
|
|
|
ctx.sweeper.wg.Add(expectedGoroutineCount)
|
|
|
|
|
|
|
|
// Stop sweeper.
|
|
|
|
ctx.sweeper.Stop()
|
|
|
|
|
|
|
|
// We should have consumed and asserted all published transactions in
|
|
|
|
// our unit tests.
|
|
|
|
ctx.assertNoTx()
|
|
|
|
if !ctx.backend.isDone() {
|
|
|
|
ctx.t.Fatal("unconfirmed txes remaining")
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ctx *sweeperTestContext) assertNoTx() {
|
|
|
|
ctx.t.Helper()
|
|
|
|
select {
|
|
|
|
case <-ctx.publishChan:
|
|
|
|
ctx.t.Fatalf("unexpected transactions published")
|
|
|
|
default:
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ctx *sweeperTestContext) receiveTx() wire.MsgTx {
|
|
|
|
ctx.t.Helper()
|
sweep: make sweeper block-driven instead of time-driven
This commit changes the source that drives the state changes in the
sweeper. Previously we used a ticker with default interval of 30s to
trigger sweepings periodically. The assumption is, within this 30s we'd
batch multiple inputs into one transaction to maximize profits. However,
the efficacy of this batch is questionable.
At a high level, we can put our inputs into two categories - one that's
forced, and one that's not. For forced inputs, we should sweep them
immediately as the force flag indicates they are very urgent, eg,
CPFPing the force closing tx. For non-forced inputs, such as anchors
or HTLCs with CLTV that's far away, we can wait to sweep them till a new
block comes in and triggers the sweeping process.
Eventually, all inputs will be deadline-aware, and the sweeper will
consult our fee bumper about the most economical fee rate to be used for
a given deadline. Since the deadlines here are blockstamp, it's also
easier to manage them if the sweeper is also using blockstamp instead of
timestamp.
2023-10-26 10:00:13 +02:00
|
|
|
|
|
|
|
// Every time we want to receive a tx, we send a new block epoch to the
|
|
|
|
// sweeper to trigger a sweeping action.
|
|
|
|
ctx.notifier.NotifyEpochNonBlocking(ctx.currentHeight + 1)
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
var tx wire.MsgTx
|
|
|
|
select {
|
|
|
|
case tx = <-ctx.publishChan:
|
|
|
|
return tx
|
|
|
|
case <-time.After(5 * time.Second):
|
|
|
|
pprof.Lookup("goroutine").WriteTo(os.Stdout, 1)
|
|
|
|
|
|
|
|
ctx.t.Fatalf("tx not published")
|
|
|
|
}
|
|
|
|
return tx
|
|
|
|
}
|
|
|
|
|
|
|
|
func (ctx *sweeperTestContext) expectResult(c chan Result, expected error) {
|
|
|
|
ctx.t.Helper()
|
|
|
|
select {
|
|
|
|
case result := <-c:
|
|
|
|
if result.Err != expected {
|
|
|
|
ctx.t.Fatalf("expected %v result, but got %v",
|
|
|
|
expected, result.Err,
|
|
|
|
)
|
|
|
|
}
|
|
|
|
case <-time.After(defaultTestTimeout):
|
|
|
|
ctx.t.Fatalf("no result received")
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-05-17 04:52:46 +02:00
|
|
|
func (ctx *sweeperTestContext) assertPendingInputs(inputs ...input.Input) {
|
|
|
|
ctx.t.Helper()
|
|
|
|
|
|
|
|
inputSet := make(map[wire.OutPoint]struct{}, len(inputs))
|
|
|
|
for _, input := range inputs {
|
|
|
|
inputSet[*input.OutPoint()] = struct{}{}
|
|
|
|
}
|
|
|
|
|
2024-03-17 20:20:37 +01:00
|
|
|
inputsMap, err := ctx.sweeper.PendingInputs()
|
2019-05-17 04:52:46 +02:00
|
|
|
if err != nil {
|
|
|
|
ctx.t.Fatal(err)
|
|
|
|
}
|
2024-03-17 20:20:37 +01:00
|
|
|
if len(inputsMap) != len(inputSet) {
|
2019-05-17 04:52:46 +02:00
|
|
|
ctx.t.Fatalf("expected %d pending inputs, got %d",
|
2024-03-17 20:20:37 +01:00
|
|
|
len(inputSet), len(inputsMap))
|
2019-05-17 04:52:46 +02:00
|
|
|
}
|
2024-03-17 20:20:37 +01:00
|
|
|
for input := range inputsMap {
|
2019-05-17 04:52:46 +02:00
|
|
|
if _, ok := inputSet[input]; !ok {
|
|
|
|
ctx.t.Fatalf("found unexpected input %v", input)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2019-05-02 01:06:19 +02:00
|
|
|
// assertTxSweepsInputs ensures that the transaction returned within the value
|
|
|
|
// received from resultChan spends the given inputs.
|
|
|
|
func assertTxSweepsInputs(t *testing.T, sweepTx *wire.MsgTx,
|
|
|
|
inputs ...input.Input) {
|
|
|
|
|
|
|
|
t.Helper()
|
|
|
|
|
|
|
|
if len(sweepTx.TxIn) != len(inputs) {
|
|
|
|
t.Fatalf("expected sweep tx to contain %d inputs, got %d",
|
|
|
|
len(inputs), len(sweepTx.TxIn))
|
|
|
|
}
|
|
|
|
m := make(map[wire.OutPoint]struct{}, len(inputs))
|
|
|
|
for _, input := range inputs {
|
|
|
|
m[*input.OutPoint()] = struct{}{}
|
|
|
|
}
|
|
|
|
for _, txIn := range sweepTx.TxIn {
|
|
|
|
if _, ok := m[txIn.PreviousOutPoint]; !ok {
|
|
|
|
t.Fatalf("expected tx %v to spend input %v",
|
|
|
|
txIn.PreviousOutPoint, sweepTx.TxHash())
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// assertTxFeeRate asserts that the transaction was created with the given
|
|
|
|
// inputs and fee rate.
|
|
|
|
//
|
|
|
|
// NOTE: This assumes that transactions only have one output, as this is the
|
|
|
|
// only type of transaction the UtxoSweeper can create at the moment.
|
|
|
|
func assertTxFeeRate(t *testing.T, tx *wire.MsgTx,
|
2022-07-15 22:25:31 +02:00
|
|
|
expectedFeeRate chainfee.SatPerKWeight, changePk []byte,
|
|
|
|
inputs ...input.Input) {
|
2019-05-02 01:06:19 +02:00
|
|
|
|
|
|
|
t.Helper()
|
|
|
|
|
|
|
|
if len(tx.TxIn) != len(inputs) {
|
|
|
|
t.Fatalf("expected %d inputs, got %d", len(tx.TxIn), len(inputs))
|
|
|
|
}
|
|
|
|
|
|
|
|
m := make(map[wire.OutPoint]input.Input, len(inputs))
|
|
|
|
for _, input := range inputs {
|
|
|
|
m[*input.OutPoint()] = input
|
|
|
|
}
|
|
|
|
|
|
|
|
var inputAmt int64
|
|
|
|
for _, txIn := range tx.TxIn {
|
|
|
|
input, ok := m[txIn.PreviousOutPoint]
|
|
|
|
if !ok {
|
|
|
|
t.Fatalf("expected input %v to be provided",
|
|
|
|
txIn.PreviousOutPoint)
|
|
|
|
}
|
|
|
|
inputAmt += input.SignDesc().Output.Value
|
|
|
|
}
|
|
|
|
outputAmt := tx.TxOut[0].Value
|
|
|
|
|
|
|
|
fee := btcutil.Amount(inputAmt - outputAmt)
|
2023-08-22 05:06:51 +02:00
|
|
|
_, estimator, err := getWeightEstimate(inputs, nil, 0, 0, changePk)
|
2022-07-15 22:25:31 +02:00
|
|
|
require.NoError(t, err)
|
|
|
|
|
2020-09-04 11:28:17 +02:00
|
|
|
txWeight := estimator.weight()
|
2019-05-02 01:06:19 +02:00
|
|
|
|
2020-09-04 11:28:17 +02:00
|
|
|
expectedFee := expectedFeeRate.FeeForWeight(int64(txWeight))
|
2019-05-02 01:06:19 +02:00
|
|
|
if fee != expectedFee {
|
|
|
|
t.Fatalf("expected fee rate %v results in %v fee, got %v fee",
|
|
|
|
expectedFeeRate, expectedFee, fee)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// assertNumSweeps asserts that the expected number of sweeps has been found in
|
|
|
|
// the sweeper's store.
|
|
|
|
func assertNumSweeps(t *testing.T, sweeper *UtxoSweeper, num int) {
|
|
|
|
err := wait.NoError(func() error {
|
|
|
|
sweeps, err := sweeper.ListSweeps()
|
|
|
|
if err != nil {
|
|
|
|
return err
|
|
|
|
}
|
|
|
|
|
|
|
|
if len(sweeps) != num {
|
|
|
|
return fmt.Errorf("want %d sweeps, got %d",
|
|
|
|
num, len(sweeps))
|
|
|
|
}
|
|
|
|
|
|
|
|
return nil
|
|
|
|
}, 5*time.Second)
|
|
|
|
require.NoError(t, err, "timeout checking num of sweeps")
|
|
|
|
}
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
// TestSuccess tests the sweeper happy flow.
|
|
|
|
func TestSuccess(t *testing.T) {
|
|
|
|
ctx := createSweeperTestContext(t)
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
inp := spendableInputs[0]
|
|
|
|
|
2019-05-29 22:59:00 +02:00
|
|
|
// Sweeping an input without a fee preference should result in an error.
|
2024-02-28 16:00:43 +01:00
|
|
|
_, err := ctx.sweeper.SweepInput(inp, Params{
|
2023-11-03 13:05:21 +01:00
|
|
|
Fee: &FeeEstimateInfo{},
|
|
|
|
})
|
2024-02-28 16:00:43 +01:00
|
|
|
require.ErrorIs(t, err, ErrNoFeePreference)
|
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed.
|
|
|
|
bumpResultChan := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{{
|
|
|
|
PreviousOutPoint: *inp.OutPoint(),
|
|
|
|
}},
|
|
|
|
}
|
2019-05-29 22:59:00 +02:00
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
})
|
|
|
|
|
|
|
|
resultChan, err := ctx.sweeper.SweepInput(inp, defaultFeePref)
|
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
sweepTx := ctx.receiveTx()
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 1)
|
|
|
|
|
|
|
|
// Mock a confirmed event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Mine a block to confirm the sweep tx.
|
2018-12-07 09:06:36 +01:00
|
|
|
ctx.backend.mine()
|
|
|
|
|
|
|
|
select {
|
|
|
|
case result := <-resultChan:
|
|
|
|
if result.Err != nil {
|
|
|
|
t.Fatalf("expected successful spend, but received "+
|
|
|
|
"error %v instead", result.Err)
|
|
|
|
}
|
|
|
|
if result.Tx.TxHash() != sweepTx.TxHash() {
|
|
|
|
t.Fatalf("expected sweep tx ")
|
|
|
|
}
|
|
|
|
case <-time.After(5 * time.Second):
|
|
|
|
t.Fatalf("no result received")
|
|
|
|
}
|
|
|
|
|
|
|
|
ctx.finish(1)
|
|
|
|
}
|
|
|
|
|
|
|
|
// TestDust asserts that inputs that are not big enough to raise above the dust
|
|
|
|
// limit, are held back until the total set does surpass the limit.
|
|
|
|
func TestDust(t *testing.T) {
|
|
|
|
ctx := createSweeperTestContext(t)
|
|
|
|
|
|
|
|
// Sweeping a single output produces a tx of 486 weight units. With the
|
|
|
|
// test fee rate, the sweep tx will pay 4860 sat in fees.
|
|
|
|
//
|
|
|
|
// Create an input so that the output after paying fees is still
|
|
|
|
// positive (400 sat), but less than the dust limit (537 sat) for the
|
|
|
|
// sweep tx output script (P2WPKH).
|
2019-01-16 15:47:43 +01:00
|
|
|
dustInput := createTestInput(5260, input.CommitmentTimeLock)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2019-05-02 01:06:19 +02:00
|
|
|
_, err := ctx.sweeper.SweepInput(&dustInput, defaultFeePref)
|
2023-10-24 06:32:17 +02:00
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
// No sweep transaction is expected now. The sweeper should recognize
|
2019-12-10 16:06:45 +01:00
|
|
|
// that the sweep output will not be relayed and not generate the tx. It
|
|
|
|
// isn't possible to attach a wallet utxo either, because the added
|
|
|
|
// weight would create a negatively yielding transaction at this fee
|
|
|
|
// rate.
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
// Sweep another input that brings the tx output above the dust limit.
|
2019-01-16 15:47:43 +01:00
|
|
|
largeInput := createTestInput(100000, input.CommitmentTimeLock)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Mock the Broadcast method to succeed.
|
|
|
|
bumpResultChan := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *largeInput.OutPoint()},
|
|
|
|
{PreviousOutPoint: *dustInput.OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
})
|
|
|
|
|
2019-05-02 01:06:19 +02:00
|
|
|
_, err = ctx.sweeper.SweepInput(&largeInput, defaultFeePref)
|
2023-10-24 06:32:17 +02:00
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
// The second input brings the sweep output above the dust limit. We
|
|
|
|
// expect a sweep tx now.
|
|
|
|
sweepTx := ctx.receiveTx()
|
2023-10-24 06:32:17 +02:00
|
|
|
require.Len(t, sweepTx.TxIn, 2, "unexpected num of tx inputs")
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 1)
|
|
|
|
|
|
|
|
// Mock a confirmed event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
ctx.backend.mine()
|
|
|
|
|
|
|
|
ctx.finish(1)
|
|
|
|
}
|
|
|
|
|
2019-12-10 16:06:45 +01:00
|
|
|
// TestWalletUtxo asserts that inputs that are not big enough to raise above the
|
|
|
|
// dust limit are accompanied by a wallet utxo to make them sweepable.
|
|
|
|
func TestWalletUtxo(t *testing.T) {
|
|
|
|
ctx := createSweeperTestContext(t)
|
|
|
|
|
|
|
|
// Sweeping a single output produces a tx of 439 weight units. At the
|
|
|
|
// fee floor, the sweep tx will pay 439*253/1000 = 111 sat in fees.
|
|
|
|
//
|
|
|
|
// Create an input so that the output after paying fees is still
|
|
|
|
// positive (183 sat), but less than the dust limit (537 sat) for the
|
|
|
|
// sweep tx output script (P2WPKH).
|
|
|
|
//
|
|
|
|
// What we now expect is that the sweeper will attach a utxo from the
|
|
|
|
// wallet. This increases the tx weight to 712 units with a fee of 180
|
|
|
|
// sats. The tx yield becomes then 294-180 = 114 sats.
|
|
|
|
dustInput := createTestInput(294, input.WitnessKeyHash)
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Mock the Broadcast method to succeed.
|
|
|
|
bumpResultChan := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *dustInput.OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
})
|
|
|
|
|
2019-12-10 16:06:45 +01:00
|
|
|
_, err := ctx.sweeper.SweepInput(
|
|
|
|
&dustInput,
|
2023-11-03 12:20:10 +01:00
|
|
|
Params{Fee: FeeEstimateInfo{FeeRate: chainfee.FeePerKwFloor}},
|
2019-12-10 16:06:45 +01:00
|
|
|
)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2019-12-10 16:06:45 +01:00
|
|
|
|
|
|
|
sweepTx := ctx.receiveTx()
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 1)
|
2019-12-10 16:06:45 +01:00
|
|
|
|
|
|
|
ctx.backend.mine()
|
2024-02-28 16:00:43 +01:00
|
|
|
|
|
|
|
// Mock a confirmed event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
|
2019-12-10 16:06:45 +01:00
|
|
|
ctx.finish(1)
|
|
|
|
}
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
// TestNegativeInput asserts that no inputs with a negative yield are swept.
|
|
|
|
// Negative yield means that the value minus the added fee is negative.
|
|
|
|
func TestNegativeInput(t *testing.T) {
|
|
|
|
ctx := createSweeperTestContext(t)
|
|
|
|
|
|
|
|
// Sweep an input large enough to cover fees, so in any case the tx
|
|
|
|
// output will be above the dust limit.
|
2019-01-16 15:47:43 +01:00
|
|
|
largeInput := createTestInput(100000, input.CommitmentNoDelay)
|
2019-05-02 01:06:19 +02:00
|
|
|
largeInputResult, err := ctx.sweeper.SweepInput(
|
|
|
|
&largeInput, defaultFeePref,
|
|
|
|
)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
// Sweep an additional input with a negative net yield. The weight of
|
|
|
|
// the HtlcAcceptedRemoteSuccess input type adds more in fees than its
|
|
|
|
// value at the current fee level.
|
2019-01-16 15:47:43 +01:00
|
|
|
negInput := createTestInput(2900, input.HtlcOfferedRemoteTimeout)
|
2019-05-02 01:06:19 +02:00
|
|
|
negInputResult, err := ctx.sweeper.SweepInput(&negInput, defaultFeePref)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
// Sweep a third input that has a smaller output than the previous one,
|
|
|
|
// but yields positively because of its lower weight.
|
2019-01-16 15:47:43 +01:00
|
|
|
positiveInput := createTestInput(2800, input.CommitmentNoDelay)
|
2024-02-28 16:00:43 +01:00
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed.
|
|
|
|
bumpResultChan := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *largeInput.OutPoint()},
|
|
|
|
{PreviousOutPoint: *positiveInput.OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
2019-05-02 01:06:19 +02:00
|
|
|
positiveInputResult, err := ctx.sweeper.SweepInput(
|
|
|
|
&positiveInput, defaultFeePref,
|
|
|
|
)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
// We expect that a sweep tx is published now, but it should only
|
|
|
|
// contain the large input. The negative input should stay out of sweeps
|
|
|
|
// until fees come down to get a positive net yield.
|
|
|
|
sweepTx1 := ctx.receiveTx()
|
2019-05-02 01:06:19 +02:00
|
|
|
assertTxSweepsInputs(t, &sweepTx1, &largeInput, &positiveInput)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 1)
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
ctx.backend.mine()
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Mock a confirmed event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx1,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
ctx.expectResult(largeInputResult, nil)
|
|
|
|
ctx.expectResult(positiveInputResult, nil)
|
|
|
|
|
|
|
|
// Lower fee rate so that the negative input is no longer negative.
|
|
|
|
ctx.estimator.updateFees(1000, 1000)
|
|
|
|
|
2019-05-02 01:06:19 +02:00
|
|
|
// Create another large input.
|
2019-01-16 15:47:43 +01:00
|
|
|
secondLargeInput := createTestInput(100000, input.CommitmentNoDelay)
|
2024-02-28 16:00:43 +01:00
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed.
|
|
|
|
bumpResultChan = make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *negInput.OutPoint()},
|
|
|
|
{PreviousOutPoint: *secondLargeInput.
|
|
|
|
OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
2019-05-02 01:06:19 +02:00
|
|
|
secondLargeInputResult, err := ctx.sweeper.SweepInput(
|
|
|
|
&secondLargeInput, defaultFeePref,
|
|
|
|
)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
sweepTx2 := ctx.receiveTx()
|
2019-05-02 01:06:19 +02:00
|
|
|
assertTxSweepsInputs(t, &sweepTx2, &secondLargeInput, &negInput)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 2)
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
ctx.backend.mine()
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Mock a confirmed event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx2,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
ctx.expectResult(secondLargeInputResult, nil)
|
|
|
|
ctx.expectResult(negInputResult, nil)
|
|
|
|
|
|
|
|
ctx.finish(1)
|
|
|
|
}
|
|
|
|
|
|
|
|
// TestChunks asserts that large sets of inputs are split into multiple txes.
|
|
|
|
func TestChunks(t *testing.T) {
|
|
|
|
ctx := createSweeperTestContext(t)
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Mock the Broadcast method to succeed on the first chunk.
|
|
|
|
bumpResultChan1 := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan1, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
//nolint:lll
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *spendableInputs[0].OutPoint()},
|
|
|
|
{PreviousOutPoint: *spendableInputs[1].OutPoint()},
|
|
|
|
{PreviousOutPoint: *spendableInputs[2].OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan1 <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed on the second chunk.
|
|
|
|
bumpResultChan2 := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan2, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
//nolint:lll
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *spendableInputs[3].OutPoint()},
|
|
|
|
{PreviousOutPoint: *spendableInputs[4].OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan2 <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
// Sweep five inputs.
|
|
|
|
for _, input := range spendableInputs[:5] {
|
2019-05-02 01:06:19 +02:00
|
|
|
_, err := ctx.sweeper.SweepInput(input, defaultFeePref)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// We expect two txes to be published because of the max input count of
|
|
|
|
// three.
|
|
|
|
sweepTx1 := ctx.receiveTx()
|
2024-02-28 16:00:43 +01:00
|
|
|
require.Len(t, sweepTx1.TxIn, 3)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
sweepTx2 := ctx.receiveTx()
|
2024-02-28 16:00:43 +01:00
|
|
|
require.Len(t, sweepTx2.TxIn, 2)
|
|
|
|
|
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 2)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
ctx.backend.mine()
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Mock a confirmed event.
|
|
|
|
bumpResultChan1 <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx1,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
bumpResultChan2 <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx2,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
ctx.finish(1)
|
|
|
|
}
|
|
|
|
|
|
|
|
// TestRemoteSpend asserts that remote spends are properly detected and handled
|
|
|
|
// both before the sweep is published as well as after.
|
|
|
|
func TestRemoteSpend(t *testing.T) {
|
|
|
|
t.Run("pre-sweep", func(t *testing.T) {
|
|
|
|
testRemoteSpend(t, false)
|
|
|
|
})
|
|
|
|
t.Run("post-sweep", func(t *testing.T) {
|
|
|
|
testRemoteSpend(t, true)
|
|
|
|
})
|
|
|
|
}
|
|
|
|
|
|
|
|
func testRemoteSpend(t *testing.T, postSweep bool) {
|
|
|
|
ctx := createSweeperTestContext(t)
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Create a fake sweep tx that spends the second input as the first
|
|
|
|
// will be spent by the remote.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *spendableInputs[1].OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed.
|
|
|
|
bumpResultChan := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
2019-05-02 01:06:19 +02:00
|
|
|
resultChan1, err := ctx.sweeper.SweepInput(
|
|
|
|
spendableInputs[0], defaultFeePref,
|
|
|
|
)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2019-05-02 01:06:19 +02:00
|
|
|
resultChan2, err := ctx.sweeper.SweepInput(
|
|
|
|
spendableInputs[1], defaultFeePref,
|
|
|
|
)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
// Spend the input with an unknown tx.
|
|
|
|
remoteTx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
2024-02-28 16:00:43 +01:00
|
|
|
{PreviousOutPoint: *(spendableInputs[0].OutPoint())},
|
2018-12-07 09:06:36 +01:00
|
|
|
},
|
|
|
|
}
|
|
|
|
err = ctx.backend.publishTransaction(remoteTx)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
if postSweep {
|
|
|
|
// Tx publication by sweeper returns ErrDoubleSpend. Sweeper
|
|
|
|
// will retry the inputs without reporting a result. It could be
|
|
|
|
// spent by the remote party.
|
|
|
|
ctx.receiveTx()
|
2024-02-28 16:00:43 +01:00
|
|
|
|
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 1)
|
2018-12-07 09:06:36 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
ctx.backend.mine()
|
|
|
|
|
|
|
|
select {
|
|
|
|
case result := <-resultChan1:
|
|
|
|
if result.Err != ErrRemoteSpend {
|
|
|
|
t.Fatalf("expected remote spend")
|
|
|
|
}
|
|
|
|
if result.Tx.TxHash() != remoteTx.TxHash() {
|
|
|
|
t.Fatalf("expected remote spend tx")
|
|
|
|
}
|
|
|
|
case <-time.After(5 * time.Second):
|
|
|
|
t.Fatalf("no result received")
|
|
|
|
}
|
|
|
|
|
|
|
|
if !postSweep {
|
|
|
|
// Assert that the sweeper sweeps the remaining input.
|
|
|
|
sweepTx := ctx.receiveTx()
|
2024-02-28 16:00:43 +01:00
|
|
|
require.Len(t, sweepTx.TxIn, 1)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 1)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
ctx.backend.mine()
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Mock a confirmed event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
ctx.expectResult(resultChan2, nil)
|
|
|
|
|
|
|
|
ctx.finish(1)
|
|
|
|
} else {
|
|
|
|
// Expected sweeper to be still listening for spend of the
|
|
|
|
// error input.
|
|
|
|
ctx.finish(2)
|
|
|
|
|
|
|
|
select {
|
2024-02-28 16:00:43 +01:00
|
|
|
case r := <-resultChan2:
|
|
|
|
require.NoError(t, r.Err)
|
|
|
|
require.Equal(t, r.Tx.TxHash(), tx.TxHash())
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
default:
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// TestIdempotency asserts that offering the same input multiple times is
|
|
|
|
// handled correctly.
|
|
|
|
func TestIdempotency(t *testing.T) {
|
|
|
|
ctx := createSweeperTestContext(t)
|
|
|
|
|
2019-05-02 01:06:19 +02:00
|
|
|
input := spendableInputs[0]
|
2024-02-28 16:00:43 +01:00
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed.
|
|
|
|
bumpResultChan := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *input.OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
2019-05-02 01:06:19 +02:00
|
|
|
resultChan1, err := ctx.sweeper.SweepInput(input, defaultFeePref)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2019-05-02 01:06:19 +02:00
|
|
|
resultChan2, err := ctx.sweeper.SweepInput(input, defaultFeePref)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
|
|
|
|
|
|
|
sweepTx := ctx.receiveTx()
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 1)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2019-05-02 01:06:19 +02:00
|
|
|
resultChan3, err := ctx.sweeper.SweepInput(input, defaultFeePref)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
// Spend the input of the sweep tx.
|
|
|
|
ctx.backend.mine()
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Mock a confirmed event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
ctx.expectResult(resultChan1, nil)
|
|
|
|
ctx.expectResult(resultChan2, nil)
|
|
|
|
ctx.expectResult(resultChan3, nil)
|
|
|
|
|
|
|
|
// Offer the same input again. The sweeper will register a spend ntfn
|
|
|
|
// for this input. Because the input has already been spent, it will
|
|
|
|
// immediately receive the spend notification with a spending tx hash.
|
|
|
|
// Because the sweeper kept track of all of its sweep txes, it will
|
|
|
|
// recognize the spend as its own.
|
2019-05-02 01:06:19 +02:00
|
|
|
resultChan4, err := ctx.sweeper.SweepInput(input, defaultFeePref)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
ctx.expectResult(resultChan4, nil)
|
|
|
|
|
|
|
|
// Timer is still running, but spend notification was delivered before
|
|
|
|
// it expired.
|
|
|
|
ctx.finish(1)
|
|
|
|
}
|
|
|
|
|
|
|
|
// TestNoInputs asserts that nothing happens if nothing happens.
|
|
|
|
func TestNoInputs(t *testing.T) {
|
|
|
|
ctx := createSweeperTestContext(t)
|
|
|
|
|
|
|
|
// No tx should appear. This is asserted in finish().
|
|
|
|
ctx.finish(1)
|
|
|
|
}
|
|
|
|
|
|
|
|
// TestRestart asserts that the sweeper picks up sweeping properly after
|
|
|
|
// a restart.
|
|
|
|
func TestRestart(t *testing.T) {
|
|
|
|
ctx := createSweeperTestContext(t)
|
|
|
|
|
|
|
|
// Sweep input and expect sweep tx.
|
2019-05-02 01:06:19 +02:00
|
|
|
input1 := spendableInputs[0]
|
2024-02-28 16:00:43 +01:00
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed.
|
|
|
|
bumpResultChan1 := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan1, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *input1.OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan1 <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
2024-01-10 21:18:40 +01:00
|
|
|
_, err := ctx.sweeper.SweepInput(input1, defaultFeePref)
|
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
sweepTx1 := ctx.receiveTx()
|
|
|
|
|
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 1)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
// Restart sweeper.
|
2019-05-02 01:06:19 +02:00
|
|
|
ctx.restartSweeper()
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2020-03-19 05:43:49 +01:00
|
|
|
// Simulate other subsystem (e.g. contract resolver) re-offering inputs.
|
2019-05-02 01:06:19 +02:00
|
|
|
spendChan1, err := ctx.sweeper.SweepInput(input1, defaultFeePref)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2019-05-02 01:06:19 +02:00
|
|
|
input2 := spendableInputs[1]
|
2024-02-28 16:00:43 +01:00
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed.
|
|
|
|
bumpResultChan2 := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan2, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *input2.OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan2 <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
2019-05-02 01:06:19 +02:00
|
|
|
spendChan2, err := ctx.sweeper.SweepInput(input2, defaultFeePref)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
// Spend inputs of sweep txes and verify that spend channels signal
|
|
|
|
// spends.
|
|
|
|
ctx.backend.mine()
|
|
|
|
|
|
|
|
// Sweeper should recognize that its sweep tx of the previous run is
|
|
|
|
// spending the input.
|
|
|
|
select {
|
|
|
|
case result := <-spendChan1:
|
|
|
|
if result.Err != nil {
|
|
|
|
t.Fatalf("expected successful sweep")
|
|
|
|
}
|
|
|
|
case <-time.After(defaultTestTimeout):
|
|
|
|
t.Fatalf("no result received")
|
|
|
|
}
|
|
|
|
|
|
|
|
// Timer tick should trigger republishing a sweep for the remaining
|
|
|
|
// input.
|
2024-02-28 16:00:43 +01:00
|
|
|
sweepTx2 := ctx.receiveTx()
|
|
|
|
|
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 2)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
ctx.backend.mine()
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Mock a confirmed event.
|
|
|
|
bumpResultChan1 <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx1,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
bumpResultChan2 <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx2,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
select {
|
|
|
|
case result := <-spendChan2:
|
|
|
|
if result.Err != nil {
|
|
|
|
t.Fatalf("expected successful sweep")
|
|
|
|
}
|
|
|
|
case <-time.After(defaultTestTimeout):
|
|
|
|
t.Fatalf("no result received")
|
|
|
|
}
|
|
|
|
|
|
|
|
// Restart sweeper again. No action is expected.
|
2019-05-02 01:06:19 +02:00
|
|
|
ctx.restartSweeper()
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
ctx.finish(1)
|
|
|
|
}
|
|
|
|
|
2024-01-10 21:18:40 +01:00
|
|
|
// TestRestartRemoteSpend asserts that the sweeper picks up sweeping properly
|
|
|
|
// after a restart with remote spend.
|
2018-12-07 09:06:36 +01:00
|
|
|
func TestRestartRemoteSpend(t *testing.T) {
|
|
|
|
ctx := createSweeperTestContext(t)
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Get testing inputs.
|
2019-05-02 01:06:19 +02:00
|
|
|
input1 := spendableInputs[0]
|
2024-02-28 16:00:43 +01:00
|
|
|
input2 := spendableInputs[1]
|
|
|
|
|
|
|
|
// Create a fake sweep tx that spends the second input as the first
|
|
|
|
// will be spent by the remote.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *input2.OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed.
|
|
|
|
bumpResultChan := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
2024-01-10 21:18:40 +01:00
|
|
|
_, err := ctx.sweeper.SweepInput(input1, defaultFeePref)
|
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
// Sweep another input.
|
2024-01-10 21:18:40 +01:00
|
|
|
_, err = ctx.sweeper.SweepInput(input2, defaultFeePref)
|
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
sweepTx := ctx.receiveTx()
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 1)
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
// Restart sweeper.
|
2019-05-02 01:06:19 +02:00
|
|
|
ctx.restartSweeper()
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Replace the sweep tx with a remote tx spending input 2.
|
2018-12-07 09:06:36 +01:00
|
|
|
ctx.backend.deleteUnconfirmed(sweepTx.TxHash())
|
|
|
|
|
|
|
|
remoteTx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
2024-02-28 16:00:43 +01:00
|
|
|
{PreviousOutPoint: *input1.OutPoint()},
|
2018-12-07 09:06:36 +01:00
|
|
|
},
|
|
|
|
}
|
2024-02-28 16:00:43 +01:00
|
|
|
err = ctx.backend.publishTransaction(remoteTx)
|
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
// Mine remote spending tx.
|
|
|
|
ctx.backend.mine()
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Mock the Broadcast method to succeed.
|
|
|
|
bumpResultChan = make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
2024-01-10 21:18:40 +01:00
|
|
|
// Simulate other subsystem (e.g. contract resolver) re-offering input
|
2024-02-28 16:00:43 +01:00
|
|
|
// 2.
|
|
|
|
spendChan, err := ctx.sweeper.SweepInput(input2, defaultFeePref)
|
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
// Expect sweeper to construct a new tx, because input 1 was spend
|
|
|
|
// remotely.
|
2024-02-28 16:00:43 +01:00
|
|
|
sweepTx = ctx.receiveTx()
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
ctx.backend.mine()
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Mock a confirmed event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
ctx.expectResult(spendChan, nil)
|
|
|
|
|
|
|
|
ctx.finish(1)
|
|
|
|
}
|
|
|
|
|
2024-01-10 21:18:40 +01:00
|
|
|
// TestRestartConfirmed asserts that the sweeper picks up sweeping properly
|
|
|
|
// after a restart with a confirm of our own sweep tx.
|
2018-12-07 09:06:36 +01:00
|
|
|
func TestRestartConfirmed(t *testing.T) {
|
|
|
|
ctx := createSweeperTestContext(t)
|
|
|
|
|
|
|
|
// Sweep input.
|
2019-05-02 01:06:19 +02:00
|
|
|
input := spendableInputs[0]
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Mock the Broadcast method to succeed.
|
|
|
|
bumpResultChan := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *input.OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
|
|
|
_, err := ctx.sweeper.SweepInput(input, defaultFeePref)
|
|
|
|
require.NoError(t, err)
|
|
|
|
|
|
|
|
sweepTx := ctx.receiveTx()
|
|
|
|
|
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 1)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
// Restart sweeper.
|
2019-05-02 01:06:19 +02:00
|
|
|
ctx.restartSweeper()
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
// Mine the sweep tx.
|
|
|
|
ctx.backend.mine()
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Mock a confirmed event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
|
2024-01-10 21:18:40 +01:00
|
|
|
// Simulate other subsystem (e.g. contract resolver) re-offering input
|
|
|
|
// 0.
|
2019-05-02 01:06:19 +02:00
|
|
|
spendChan, err := ctx.sweeper.SweepInput(input, defaultFeePref)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
// Here we expect again a successful sweep.
|
|
|
|
ctx.expectResult(spendChan, nil)
|
|
|
|
|
|
|
|
ctx.finish(1)
|
|
|
|
}
|
|
|
|
|
|
|
|
// TestRetry tests the sweeper retry flow.
|
|
|
|
func TestRetry(t *testing.T) {
|
|
|
|
ctx := createSweeperTestContext(t)
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
inp0 := spendableInputs[0]
|
|
|
|
inp1 := spendableInputs[1]
|
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed.
|
|
|
|
bumpResultChan1 := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan1, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *inp0.OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan1 <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
|
|
|
resultChan0, err := ctx.sweeper.SweepInput(inp0, defaultFeePref)
|
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
// We expect a sweep to be published.
|
2024-02-28 16:00:43 +01:00
|
|
|
sweepTx1 := ctx.receiveTx()
|
|
|
|
|
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 1)
|
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed on the second sweep.
|
|
|
|
bumpResultChan2 := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan2, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *inp1.OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan2 <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
// Offer a fresh input.
|
2024-02-28 16:00:43 +01:00
|
|
|
resultChan1, err := ctx.sweeper.SweepInput(inp1, defaultFeePref)
|
|
|
|
require.NoError(t, err)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
2023-10-12 14:35:46 +02:00
|
|
|
// A single tx is expected to be published.
|
2024-02-28 16:00:43 +01:00
|
|
|
sweepTx2 := ctx.receiveTx()
|
|
|
|
|
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 2)
|
2018-12-07 09:06:36 +01:00
|
|
|
|
|
|
|
ctx.backend.mine()
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Mock a confirmed event.
|
|
|
|
bumpResultChan1 <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx1,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
bumpResultChan2 <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx2,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
|
2018-12-07 09:06:36 +01:00
|
|
|
ctx.expectResult(resultChan0, nil)
|
|
|
|
ctx.expectResult(resultChan1, nil)
|
|
|
|
|
|
|
|
ctx.finish(1)
|
|
|
|
}
|
|
|
|
|
2019-05-02 01:06:19 +02:00
|
|
|
// TestDifferentFeePreferences ensures that the sweeper can have different
|
2019-05-16 02:04:49 +02:00
|
|
|
// transactions for different fee preferences. These transactions should be
|
|
|
|
// broadcast from highest to lowest fee rate.
|
2019-05-02 01:06:19 +02:00
|
|
|
func TestDifferentFeePreferences(t *testing.T) {
|
|
|
|
ctx := createSweeperTestContext(t)
|
|
|
|
|
|
|
|
// Throughout this test, we'll be attempting to sweep three inputs, two
|
|
|
|
// with the higher fee preference, and the last with the lower. We do
|
|
|
|
// this to ensure the sweeper can broadcast distinct transactions for
|
|
|
|
// each sweep with a different fee preference.
|
2023-11-03 12:20:10 +01:00
|
|
|
lowFeePref := FeeEstimateInfo{ConfTarget: 12}
|
2019-10-31 03:43:05 +01:00
|
|
|
lowFeeRate := chainfee.SatPerKWeight(5000)
|
2019-05-29 22:59:37 +02:00
|
|
|
ctx.estimator.blocksToFee[lowFeePref.ConfTarget] = lowFeeRate
|
|
|
|
|
2023-11-03 12:20:10 +01:00
|
|
|
highFeePref := FeeEstimateInfo{ConfTarget: 6}
|
2019-10-31 03:43:05 +01:00
|
|
|
highFeeRate := chainfee.SatPerKWeight(10000)
|
2019-05-29 22:59:37 +02:00
|
|
|
ctx.estimator.blocksToFee[highFeePref.ConfTarget] = highFeeRate
|
2019-05-02 01:06:19 +02:00
|
|
|
|
|
|
|
input1 := spendableInputs[0]
|
2024-02-28 16:00:43 +01:00
|
|
|
input2 := spendableInputs[1]
|
|
|
|
input3 := spendableInputs[2]
|
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed on the first sweep.
|
|
|
|
bumpResultChan1 := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan1, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *input1.OutPoint()},
|
|
|
|
{PreviousOutPoint: *input2.OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan1 <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed on the second sweep.
|
|
|
|
bumpResultChan2 := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan2, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *input3.OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan2 <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
2019-12-09 11:42:58 +01:00
|
|
|
resultChan1, err := ctx.sweeper.SweepInput(
|
|
|
|
input1, Params{Fee: highFeePref},
|
|
|
|
)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
|
|
|
|
2019-12-09 11:42:58 +01:00
|
|
|
resultChan2, err := ctx.sweeper.SweepInput(
|
|
|
|
input2, Params{Fee: highFeePref},
|
|
|
|
)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
|
|
|
|
2019-12-09 11:42:58 +01:00
|
|
|
resultChan3, err := ctx.sweeper.SweepInput(
|
|
|
|
input3, Params{Fee: lowFeePref},
|
|
|
|
)
|
2022-07-15 22:25:31 +02:00
|
|
|
require.NoError(t, err)
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// The first transaction broadcast should be the one spending the
|
|
|
|
// higher fee rate inputs.
|
2019-05-16 02:04:49 +02:00
|
|
|
sweepTx1 := ctx.receiveTx()
|
|
|
|
|
|
|
|
// The second should be the one spending the lower fee rate inputs.
|
|
|
|
sweepTx2 := ctx.receiveTx()
|
2024-02-28 16:00:43 +01:00
|
|
|
|
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 2)
|
2019-05-02 01:06:19 +02:00
|
|
|
|
|
|
|
// With the transactions broadcast, we'll mine a block to so that the
|
|
|
|
// result is delivered to each respective client.
|
|
|
|
ctx.backend.mine()
|
2024-02-28 16:00:43 +01:00
|
|
|
|
|
|
|
// Mock a confirmed event.
|
|
|
|
bumpResultChan1 <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx1,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
bumpResultChan2 <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx2,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
|
2019-05-16 02:04:49 +02:00
|
|
|
resultChans := []chan Result{resultChan1, resultChan2, resultChan3}
|
|
|
|
for _, resultChan := range resultChans {
|
|
|
|
ctx.expectResult(resultChan, nil)
|
|
|
|
}
|
2019-05-02 01:06:19 +02:00
|
|
|
|
|
|
|
ctx.finish(1)
|
|
|
|
}
|
2019-05-17 04:52:46 +02:00
|
|
|
|
|
|
|
// TestPendingInputs ensures that the sweeper correctly determines the inputs
|
|
|
|
// pending to be swept.
|
|
|
|
func TestPendingInputs(t *testing.T) {
|
|
|
|
ctx := createSweeperTestContext(t)
|
|
|
|
|
|
|
|
// Throughout this test, we'll be attempting to sweep three inputs, two
|
|
|
|
// with the higher fee preference, and the last with the lower. We do
|
|
|
|
// this to ensure the sweeper can return all pending inputs, even those
|
|
|
|
// with different fee preferences.
|
|
|
|
const (
|
|
|
|
lowFeeRate = 5000
|
|
|
|
highFeeRate = 10000
|
|
|
|
)
|
|
|
|
|
2023-11-03 12:20:10 +01:00
|
|
|
lowFeePref := FeeEstimateInfo{
|
2019-05-17 04:52:46 +02:00
|
|
|
ConfTarget: 12,
|
|
|
|
}
|
|
|
|
ctx.estimator.blocksToFee[lowFeePref.ConfTarget] = lowFeeRate
|
|
|
|
|
2023-11-03 12:20:10 +01:00
|
|
|
highFeePref := FeeEstimateInfo{
|
2019-05-17 04:52:46 +02:00
|
|
|
ConfTarget: 6,
|
|
|
|
}
|
|
|
|
ctx.estimator.blocksToFee[highFeePref.ConfTarget] = highFeeRate
|
|
|
|
|
|
|
|
input1 := spendableInputs[0]
|
2024-02-28 16:00:43 +01:00
|
|
|
input2 := spendableInputs[1]
|
|
|
|
input3 := spendableInputs[2]
|
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed on the first sweep.
|
|
|
|
bumpResultChan1 := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan1, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *input1.OutPoint()},
|
|
|
|
{PreviousOutPoint: *input2.OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan1 <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed on the second sweep.
|
|
|
|
bumpResultChan2 := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan2, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *input3.OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan2 <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
2019-12-09 11:42:58 +01:00
|
|
|
resultChan1, err := ctx.sweeper.SweepInput(
|
|
|
|
input1, Params{Fee: highFeePref},
|
|
|
|
)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
|
|
|
|
2019-12-09 11:42:58 +01:00
|
|
|
_, err = ctx.sweeper.SweepInput(
|
|
|
|
input2, Params{Fee: highFeePref},
|
|
|
|
)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
|
|
|
|
2019-12-09 11:42:58 +01:00
|
|
|
resultChan3, err := ctx.sweeper.SweepInput(
|
|
|
|
input3, Params{Fee: lowFeePref},
|
|
|
|
)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2019-05-17 04:52:46 +02:00
|
|
|
|
|
|
|
// We should expect to see all inputs pending.
|
|
|
|
ctx.assertPendingInputs(input1, input2, input3)
|
|
|
|
|
2023-10-26 09:13:23 +02:00
|
|
|
// We should expect to see both sweep transactions broadcast - one for
|
|
|
|
// the higher feerate, the other for the lower.
|
2024-02-28 16:00:43 +01:00
|
|
|
sweepTx1 := ctx.receiveTx()
|
|
|
|
sweepTx2 := ctx.receiveTx()
|
|
|
|
|
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 2)
|
2023-10-26 09:13:23 +02:00
|
|
|
|
|
|
|
// Mine these txns, and we should expect to see the results delivered.
|
2019-05-17 04:52:46 +02:00
|
|
|
ctx.backend.mine()
|
2024-02-28 16:00:43 +01:00
|
|
|
|
|
|
|
// Mock a confirmed event.
|
|
|
|
bumpResultChan1 <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx1,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
bumpResultChan2 <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx2,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
|
2023-10-26 09:13:23 +02:00
|
|
|
ctx.expectResult(resultChan1, nil)
|
2019-05-17 04:52:46 +02:00
|
|
|
ctx.expectResult(resultChan3, nil)
|
|
|
|
ctx.assertPendingInputs()
|
|
|
|
|
|
|
|
ctx.finish(1)
|
|
|
|
}
|
2019-05-29 23:00:14 +02:00
|
|
|
|
2019-12-09 11:51:13 +01:00
|
|
|
// TestExclusiveGroup tests the sweeper exclusive group functionality.
|
|
|
|
func TestExclusiveGroup(t *testing.T) {
|
|
|
|
ctx := createSweeperTestContext(t)
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
input1 := spendableInputs[0]
|
|
|
|
input2 := spendableInputs[1]
|
|
|
|
input3 := spendableInputs[2]
|
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed on the first sweep.
|
|
|
|
bumpResultChan1 := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan1, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *input1.OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan1 <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed on the second sweep.
|
|
|
|
bumpResultChan2 := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan2, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *input2.OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan2 <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed on the third sweep.
|
|
|
|
bumpResultChan3 := make(chan *BumpResult, 1)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan3, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: *input3.OutPoint()},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan3 <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need to
|
|
|
|
// manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them will
|
|
|
|
// mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
|
2019-12-09 11:51:13 +01:00
|
|
|
// Sweep three inputs in the same exclusive group.
|
|
|
|
var results []chan Result
|
|
|
|
for i := 0; i < 3; i++ {
|
|
|
|
exclusiveGroup := uint64(1)
|
|
|
|
result, err := ctx.sweeper.SweepInput(
|
|
|
|
spendableInputs[i], Params{
|
2023-11-03 12:20:10 +01:00
|
|
|
Fee: FeeEstimateInfo{ConfTarget: 6},
|
2019-12-09 11:51:13 +01:00
|
|
|
ExclusiveGroup: &exclusiveGroup,
|
|
|
|
},
|
|
|
|
)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2019-12-09 11:51:13 +01:00
|
|
|
results = append(results, result)
|
|
|
|
}
|
|
|
|
|
|
|
|
// We expect all inputs to be published in separate transactions, even
|
|
|
|
// though they share the same fee preference.
|
2024-02-28 16:00:43 +01:00
|
|
|
sweepTx1 := ctx.receiveTx()
|
|
|
|
require.Len(t, sweepTx1.TxIn, 1)
|
2019-12-09 11:51:13 +01:00
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
sweepTx2 := ctx.receiveTx()
|
|
|
|
sweepTx3 := ctx.receiveTx()
|
2019-12-09 11:51:13 +01:00
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Remove all txes except for the one that sweeps the first
|
|
|
|
// input. This simulates the sweeps being conflicting.
|
|
|
|
ctx.backend.deleteUnconfirmed(sweepTx2.TxHash())
|
|
|
|
ctx.backend.deleteUnconfirmed(sweepTx3.TxHash())
|
|
|
|
|
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 3)
|
2019-12-09 11:51:13 +01:00
|
|
|
|
|
|
|
// Mine the first sweep tx.
|
|
|
|
ctx.backend.mine()
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Mock a confirmed event.
|
|
|
|
bumpResultChan1 <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTx1,
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
bumpResultChan2 <- &BumpResult{
|
|
|
|
Event: TxFailed,
|
|
|
|
Tx: &sweepTx2,
|
|
|
|
}
|
|
|
|
bumpResultChan2 <- &BumpResult{
|
|
|
|
Event: TxFailed,
|
|
|
|
Tx: &sweepTx3,
|
|
|
|
}
|
|
|
|
|
2019-12-09 11:51:13 +01:00
|
|
|
// Expect the first input to be swept by the confirmed sweep tx.
|
|
|
|
result0 := <-results[0]
|
|
|
|
if result0.Err != nil {
|
|
|
|
t.Fatal("expected first input to be swept")
|
|
|
|
}
|
|
|
|
|
|
|
|
// Expect the other two inputs to return an error. They have no chance
|
|
|
|
// of confirming.
|
|
|
|
result1 := <-results[1]
|
|
|
|
if result1.Err != ErrExclusiveGroupSpend {
|
|
|
|
t.Fatal("expected second input to be canceled")
|
|
|
|
}
|
|
|
|
|
|
|
|
result2 := <-results[2]
|
|
|
|
if result2.Err != ErrExclusiveGroupSpend {
|
|
|
|
t.Fatal("expected third input to be canceled")
|
|
|
|
}
|
|
|
|
}
|
2020-09-04 11:28:17 +02:00
|
|
|
|
2020-11-06 19:35:01 +01:00
|
|
|
type testInput struct {
|
|
|
|
*input.BaseInput
|
|
|
|
|
|
|
|
locktime *uint32
|
2020-11-09 18:56:26 +01:00
|
|
|
reqTxOut *wire.TxOut
|
2020-11-06 19:35:01 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
func (i *testInput) RequiredLockTime() (uint32, bool) {
|
|
|
|
if i.locktime != nil {
|
|
|
|
return *i.locktime, true
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0, false
|
|
|
|
}
|
|
|
|
|
2020-11-09 18:56:26 +01:00
|
|
|
func (i *testInput) RequiredTxOut() *wire.TxOut {
|
|
|
|
return i.reqTxOut
|
|
|
|
}
|
|
|
|
|
2020-12-07 10:40:08 +01:00
|
|
|
// CraftInputScript is a custom sign method for the testInput type that will
|
|
|
|
// encode the spending outpoint and the tx input index as part of the returned
|
|
|
|
// witness.
|
|
|
|
func (i *testInput) CraftInputScript(_ input.Signer, txn *wire.MsgTx,
|
2022-03-18 18:37:44 +01:00
|
|
|
hashCache *txscript.TxSigHashes,
|
|
|
|
prevOutputFetcher txscript.PrevOutputFetcher,
|
|
|
|
txinIdx int) (*input.Script, error) {
|
2020-12-07 10:40:08 +01:00
|
|
|
|
|
|
|
// We'll encode the outpoint in the witness, so we can assert that the
|
|
|
|
// expected input was signed at the correct index.
|
|
|
|
op := i.OutPoint()
|
|
|
|
return &input.Script{
|
|
|
|
Witness: [][]byte{
|
|
|
|
// We encode the hash of the outpoint...
|
|
|
|
op.Hash[:],
|
|
|
|
// ..the outpoint index...
|
|
|
|
{byte(op.Index)},
|
|
|
|
// ..and finally the tx input index.
|
|
|
|
{byte(txinIdx)},
|
|
|
|
},
|
|
|
|
}, nil
|
|
|
|
}
|
|
|
|
|
|
|
|
// assertSignedIndex goes through all inputs to the tx and checks that all
|
|
|
|
// testInputs have witnesses corresponding to the outpoints they are spending,
|
|
|
|
// and are signed at the correct tx input index. All found testInputs are
|
|
|
|
// returned such that we can sum up and sanity check that all testInputs were
|
|
|
|
// part of the sweep.
|
|
|
|
func assertSignedIndex(t *testing.T, tx *wire.MsgTx,
|
|
|
|
testInputs map[wire.OutPoint]*testInput) map[wire.OutPoint]struct{} {
|
|
|
|
|
|
|
|
found := make(map[wire.OutPoint]struct{})
|
|
|
|
for idx, txIn := range tx.TxIn {
|
|
|
|
op := txIn.PreviousOutPoint
|
|
|
|
|
|
|
|
// Not a testInput, it won't have the test encoding we require
|
|
|
|
// to check outpoint and index.
|
|
|
|
if _, ok := testInputs[op]; !ok {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
|
|
|
|
if _, ok := found[op]; ok {
|
|
|
|
t.Fatalf("input already used")
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check it was signes spending the correct outpoint, and at
|
|
|
|
// the expected tx input index.
|
|
|
|
require.Equal(t, txIn.Witness[0], op.Hash[:])
|
|
|
|
require.Equal(t, txIn.Witness[1], []byte{byte(op.Index)})
|
|
|
|
require.Equal(t, txIn.Witness[2], []byte{byte(idx)})
|
|
|
|
found[op] = struct{}{}
|
|
|
|
}
|
|
|
|
|
|
|
|
return found
|
|
|
|
}
|
|
|
|
|
2020-11-06 19:35:01 +01:00
|
|
|
// TestLockTimes checks that the sweeper properly groups inputs requiring the
|
|
|
|
// same locktime together into sweep transactions.
|
|
|
|
func TestLockTimes(t *testing.T) {
|
|
|
|
ctx := createSweeperTestContext(t)
|
|
|
|
|
|
|
|
// We increase the number of max inputs to a tx so that won't
|
|
|
|
// impact our test.
|
|
|
|
ctx.sweeper.cfg.MaxInputsPerTx = 100
|
|
|
|
|
2023-10-30 14:32:46 +01:00
|
|
|
// We also need to update the aggregator about this new config.
|
|
|
|
ctx.sweeper.cfg.Aggregator = NewSimpleUtxoAggregator(
|
|
|
|
ctx.estimator, DefaultMaxFeeRate.FeePerKWeight(), 100,
|
|
|
|
)
|
|
|
|
|
2020-11-06 19:35:01 +01:00
|
|
|
// We will set up the lock times in such a way that we expect the
|
|
|
|
// sweeper to divide the inputs into 4 diffeerent transactions.
|
|
|
|
const numSweeps = 4
|
|
|
|
|
|
|
|
// Sweep 8 inputs, using 4 different lock times.
|
|
|
|
var (
|
2024-02-28 16:00:43 +01:00
|
|
|
results []chan Result
|
|
|
|
inputs = make(map[wire.OutPoint]input.Input)
|
|
|
|
clusters = make(map[uint32][]input.Input)
|
|
|
|
bumpResultChans = make([]chan *BumpResult, 0, 4)
|
2020-11-06 19:35:01 +01:00
|
|
|
)
|
|
|
|
for i := 0; i < numSweeps*2; i++ {
|
|
|
|
lt := uint32(10 + (i % numSweeps))
|
|
|
|
inp := &testInput{
|
|
|
|
BaseInput: spendableInputs[i],
|
|
|
|
locktime: <,
|
|
|
|
}
|
|
|
|
|
|
|
|
op := inp.OutPoint()
|
|
|
|
inputs[*op] = inp
|
2024-02-28 16:00:43 +01:00
|
|
|
|
|
|
|
cluster, ok := clusters[lt]
|
|
|
|
if !ok {
|
|
|
|
cluster = make([]input.Input, 0)
|
|
|
|
}
|
|
|
|
cluster = append(cluster, inp)
|
|
|
|
clusters[lt] = cluster
|
2020-11-06 19:35:01 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
for i := 0; i < 3; i++ {
|
|
|
|
inp := spendableInputs[i+numSweeps*2]
|
2024-02-28 16:00:43 +01:00
|
|
|
inputs[*inp.OutPoint()] = inp
|
|
|
|
|
|
|
|
lt := uint32(10 + (i % numSweeps))
|
|
|
|
clusters[lt] = append(clusters[lt], inp)
|
|
|
|
}
|
|
|
|
|
|
|
|
for lt, cluster := range clusters {
|
|
|
|
// Create a fake sweep tx.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{},
|
|
|
|
LockTime: lt,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Append the inputs.
|
|
|
|
for _, inp := range cluster {
|
|
|
|
txIn := &wire.TxIn{
|
|
|
|
PreviousOutPoint: *inp.OutPoint(),
|
|
|
|
}
|
|
|
|
tx.TxIn = append(tx.TxIn, txIn)
|
|
|
|
}
|
|
|
|
|
|
|
|
// Mock the Broadcast method to succeed on current sweep.
|
|
|
|
bumpResultChan := make(chan *BumpResult, 1)
|
|
|
|
bumpResultChans = append(bumpResultChans, bumpResultChan)
|
|
|
|
ctx.publisher.On("Broadcast", mock.Anything).Return(
|
|
|
|
bumpResultChan, nil).Run(func(args mock.Arguments) {
|
|
|
|
// Send the first event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxPublished,
|
|
|
|
Tx: tx,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Due to a mix of new and old test frameworks, we need
|
|
|
|
// to manually call the method to get the test to pass.
|
|
|
|
//
|
|
|
|
// TODO(yy): remove the test context and replace them
|
|
|
|
// will mocks.
|
|
|
|
err := ctx.backend.PublishTransaction(tx, "")
|
|
|
|
require.NoError(t, err)
|
|
|
|
}).Once()
|
|
|
|
}
|
|
|
|
|
|
|
|
// Make all the sweeps.
|
|
|
|
for _, inp := range inputs {
|
2020-11-06 19:35:01 +01:00
|
|
|
result, err := ctx.sweeper.SweepInput(
|
|
|
|
inp, Params{
|
2023-11-03 12:20:10 +01:00
|
|
|
Fee: FeeEstimateInfo{ConfTarget: 6},
|
2020-11-06 19:35:01 +01:00
|
|
|
},
|
|
|
|
)
|
2024-02-28 16:00:43 +01:00
|
|
|
require.NoError(t, err)
|
2020-11-06 19:35:01 +01:00
|
|
|
|
|
|
|
results = append(results, result)
|
|
|
|
}
|
|
|
|
|
|
|
|
// Check the sweeps transactions, ensuring all inputs are there, and
|
|
|
|
// all the locktimes are satisfied.
|
2024-02-28 16:00:43 +01:00
|
|
|
sweepTxes := make([]wire.MsgTx, 0, numSweeps)
|
2020-11-06 19:35:01 +01:00
|
|
|
for i := 0; i < numSweeps; i++ {
|
|
|
|
sweepTx := ctx.receiveTx()
|
2024-02-28 16:00:43 +01:00
|
|
|
sweepTxes = append(sweepTxes, sweepTx)
|
2020-11-06 19:35:01 +01:00
|
|
|
|
|
|
|
for _, txIn := range sweepTx.TxIn {
|
|
|
|
op := txIn.PreviousOutPoint
|
|
|
|
inp, ok := inputs[op]
|
2024-02-28 16:00:43 +01:00
|
|
|
require.True(t, ok)
|
2020-11-06 19:35:01 +01:00
|
|
|
|
|
|
|
delete(inputs, op)
|
|
|
|
|
|
|
|
// If this input had a required locktime, ensure the tx
|
|
|
|
// has that set correctly.
|
|
|
|
lt, ok := inp.RequiredLockTime()
|
|
|
|
if !ok {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
require.EqualValues(t, lt, sweepTx.LockTime)
|
2020-11-06 19:35:01 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Wait until the sweep tx has been saved to db.
|
|
|
|
assertNumSweeps(t, ctx.sweeper, 4)
|
2020-11-06 19:35:01 +01:00
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
// Mine the sweeps.
|
2020-11-06 19:35:01 +01:00
|
|
|
ctx.backend.mine()
|
|
|
|
|
2024-02-28 16:00:43 +01:00
|
|
|
for i, bumpResultChan := range bumpResultChans {
|
|
|
|
// Mock a confirmed event.
|
|
|
|
bumpResultChan <- &BumpResult{
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Tx: &sweepTxes[i],
|
|
|
|
FeeRate: 10,
|
|
|
|
Fee: 100,
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// The should be no inputs not foud in any of the sweeps.
|
|
|
|
require.Empty(t, inputs)
|
|
|
|
|
2020-11-06 19:35:01 +01:00
|
|
|
// Results should all come back.
|
2024-02-28 16:00:43 +01:00
|
|
|
for i, resultChan := range results {
|
2023-10-30 14:32:46 +01:00
|
|
|
select {
|
2024-02-28 16:00:43 +01:00
|
|
|
case result := <-resultChan:
|
2023-10-30 14:32:46 +01:00
|
|
|
require.NoError(t, result.Err)
|
|
|
|
case <-time.After(1 * time.Second):
|
|
|
|
t.Fatalf("result %v did not come back", i)
|
2020-11-06 19:35:01 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2020-11-09 18:56:26 +01:00
|
|
|
|
2020-12-09 12:24:01 +01:00
|
|
|
// TestSweeperShutdownHandling tests that we notify callers when the sweeper
|
|
|
|
// cannot handle requests since it's in the process of shutting down.
|
|
|
|
func TestSweeperShutdownHandling(t *testing.T) {
|
|
|
|
ctx := createSweeperTestContext(t)
|
|
|
|
|
|
|
|
// Make the backing notifier break down. This is what happens during
|
|
|
|
// lnd shut down, since the notifier is stopped before the sweeper.
|
|
|
|
require.Len(t, ctx.notifier.epochChan, 1)
|
|
|
|
for epochChan := range ctx.notifier.epochChan {
|
|
|
|
close(epochChan)
|
|
|
|
}
|
|
|
|
|
|
|
|
// Give the collector some time to exit.
|
|
|
|
time.Sleep(50 * time.Millisecond)
|
|
|
|
|
|
|
|
// Now trying to sweep inputs should return an error on the error
|
|
|
|
// channel.
|
|
|
|
resultChan, err := ctx.sweeper.SweepInput(
|
|
|
|
spendableInputs[0], defaultFeePref,
|
|
|
|
)
|
|
|
|
require.NoError(t, err)
|
|
|
|
|
|
|
|
select {
|
|
|
|
case res := <-resultChan:
|
|
|
|
require.Equal(t, ErrSweeperShuttingDown, res.Err)
|
|
|
|
|
|
|
|
case <-time.After(defaultTestTimeout):
|
|
|
|
t.Fatalf("no result arrived")
|
|
|
|
}
|
|
|
|
|
|
|
|
// Stop the sweeper properly.
|
|
|
|
err = ctx.sweeper.Stop()
|
|
|
|
require.NoError(t, err)
|
|
|
|
|
|
|
|
// Now attempting to sweep an input should error out immediately.
|
|
|
|
_, err = ctx.sweeper.SweepInput(
|
|
|
|
spendableInputs[0], defaultFeePref,
|
|
|
|
)
|
|
|
|
require.Error(t, err)
|
|
|
|
}
|
2023-07-12 10:23:29 +02:00
|
|
|
|
2024-01-11 00:54:32 +01:00
|
|
|
// TestMarkInputsPendingPublish checks that given a list of inputs with
|
|
|
|
// different states, only the non-terminal state will be marked as `Published`.
|
|
|
|
func TestMarkInputsPendingPublish(t *testing.T) {
|
|
|
|
t.Parallel()
|
|
|
|
|
|
|
|
require := require.New(t)
|
|
|
|
|
|
|
|
// Create a test sweeper.
|
2024-02-21 09:00:05 +01:00
|
|
|
s := New(&UtxoSweeperConfig{})
|
|
|
|
|
|
|
|
// Create a mock input set.
|
|
|
|
set := &MockInputSet{}
|
|
|
|
defer set.AssertExpectations(t)
|
2024-01-11 00:54:32 +01:00
|
|
|
|
|
|
|
// Create three testing inputs.
|
|
|
|
//
|
|
|
|
// inputNotExist specifies an input that's not found in the sweeper's
|
|
|
|
// `pendingInputs` map.
|
2024-02-21 09:00:05 +01:00
|
|
|
inputNotExist := &input.MockInput{}
|
|
|
|
defer inputNotExist.AssertExpectations(t)
|
|
|
|
|
|
|
|
inputNotExist.On("OutPoint").Return(&wire.OutPoint{Index: 0})
|
2024-01-11 00:54:32 +01:00
|
|
|
|
|
|
|
// inputInit specifies a newly created input.
|
2024-02-21 09:00:05 +01:00
|
|
|
inputInit := &input.MockInput{}
|
|
|
|
defer inputInit.AssertExpectations(t)
|
|
|
|
|
|
|
|
inputInit.On("OutPoint").Return(&wire.OutPoint{Index: 1})
|
|
|
|
|
2024-03-17 20:20:37 +01:00
|
|
|
s.inputs[*inputInit.OutPoint()] = &SweeperInput{
|
2024-03-17 19:49:58 +01:00
|
|
|
state: Init,
|
2024-01-11 00:54:32 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// inputPendingPublish specifies an input that's about to be published.
|
2024-02-21 09:00:05 +01:00
|
|
|
inputPendingPublish := &input.MockInput{}
|
|
|
|
defer inputPendingPublish.AssertExpectations(t)
|
|
|
|
|
|
|
|
inputPendingPublish.On("OutPoint").Return(&wire.OutPoint{Index: 2})
|
|
|
|
|
2024-03-17 20:20:37 +01:00
|
|
|
s.inputs[*inputPendingPublish.OutPoint()] = &SweeperInput{
|
2024-03-17 19:49:58 +01:00
|
|
|
state: PendingPublish,
|
2024-01-11 00:54:32 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// inputTerminated specifies an input that's terminated.
|
2024-02-21 09:00:05 +01:00
|
|
|
inputTerminated := &input.MockInput{}
|
|
|
|
defer inputTerminated.AssertExpectations(t)
|
2024-01-11 00:54:32 +01:00
|
|
|
|
2024-02-21 09:00:05 +01:00
|
|
|
inputTerminated.On("OutPoint").Return(&wire.OutPoint{Index: 3})
|
2024-01-11 00:54:32 +01:00
|
|
|
|
2024-03-17 20:20:37 +01:00
|
|
|
s.inputs[*inputTerminated.OutPoint()] = &SweeperInput{
|
2024-03-17 19:49:58 +01:00
|
|
|
state: Excluded,
|
2024-02-21 09:00:05 +01:00
|
|
|
}
|
2024-01-11 00:54:32 +01:00
|
|
|
|
|
|
|
// Mark the test inputs. We expect the non-exist input and the
|
|
|
|
// inputTerminated to be skipped, and the rest to be marked as pending
|
|
|
|
// publish.
|
2024-02-21 09:00:05 +01:00
|
|
|
set.On("Inputs").Return([]input.Input{
|
2024-01-11 00:54:32 +01:00
|
|
|
inputNotExist, inputInit, inputPendingPublish, inputTerminated,
|
|
|
|
})
|
2024-02-21 09:00:05 +01:00
|
|
|
s.markInputsPendingPublish(set)
|
2024-01-11 00:54:32 +01:00
|
|
|
|
|
|
|
// We expect unchanged number of pending inputs.
|
2024-03-17 20:00:58 +01:00
|
|
|
require.Len(s.inputs, 3)
|
2024-01-11 00:54:32 +01:00
|
|
|
|
|
|
|
// We expect the init input's state to become pending publish.
|
2024-03-17 19:49:58 +01:00
|
|
|
require.Equal(PendingPublish,
|
2024-03-17 20:00:58 +01:00
|
|
|
s.inputs[*inputInit.OutPoint()].state)
|
2024-01-11 00:54:32 +01:00
|
|
|
|
|
|
|
// We expect the pending-publish to stay unchanged.
|
2024-03-17 19:49:58 +01:00
|
|
|
require.Equal(PendingPublish,
|
2024-03-17 20:00:58 +01:00
|
|
|
s.inputs[*inputPendingPublish.OutPoint()].state)
|
2024-01-11 00:54:32 +01:00
|
|
|
|
|
|
|
// We expect the terminated to stay unchanged.
|
2024-03-17 19:49:58 +01:00
|
|
|
require.Equal(Excluded,
|
2024-03-17 20:00:58 +01:00
|
|
|
s.inputs[*inputTerminated.OutPoint()].state)
|
2024-01-11 00:54:32 +01:00
|
|
|
}
|
|
|
|
|
2023-10-24 02:14:52 +02:00
|
|
|
// TestMarkInputsPublished checks that given a list of inputs with different
|
2024-03-17 19:49:58 +01:00
|
|
|
// states, only the state `PendingPublish` will be marked as `Published`.
|
2023-10-24 02:14:52 +02:00
|
|
|
func TestMarkInputsPublished(t *testing.T) {
|
|
|
|
t.Parallel()
|
|
|
|
|
|
|
|
require := require.New(t)
|
|
|
|
|
|
|
|
// Create a mock sweeper store.
|
|
|
|
mockStore := NewMockSweeperStore()
|
|
|
|
|
|
|
|
// Create a test TxRecord and a dummy error.
|
|
|
|
dummyTR := &TxRecord{}
|
|
|
|
dummyErr := errors.New("dummy error")
|
|
|
|
|
|
|
|
// Create a test sweeper.
|
|
|
|
s := New(&UtxoSweeperConfig{
|
|
|
|
Store: mockStore,
|
|
|
|
})
|
|
|
|
|
|
|
|
// Create three testing inputs.
|
|
|
|
//
|
|
|
|
// inputNotExist specifies an input that's not found in the sweeper's
|
2024-03-17 20:00:58 +01:00
|
|
|
// `inputs` map.
|
2023-10-24 02:14:52 +02:00
|
|
|
inputNotExist := &wire.TxIn{
|
|
|
|
PreviousOutPoint: wire.OutPoint{Index: 1},
|
|
|
|
}
|
|
|
|
|
|
|
|
// inputInit specifies a newly created input. When marking this as
|
|
|
|
// published, we should see an error log as this input hasn't been
|
|
|
|
// published yet.
|
|
|
|
inputInit := &wire.TxIn{
|
|
|
|
PreviousOutPoint: wire.OutPoint{Index: 2},
|
|
|
|
}
|
2024-03-17 20:20:37 +01:00
|
|
|
s.inputs[inputInit.PreviousOutPoint] = &SweeperInput{
|
2024-03-17 19:49:58 +01:00
|
|
|
state: Init,
|
2023-10-24 02:14:52 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// inputPendingPublish specifies an input that's about to be published.
|
|
|
|
inputPendingPublish := &wire.TxIn{
|
|
|
|
PreviousOutPoint: wire.OutPoint{Index: 3},
|
|
|
|
}
|
2024-03-17 20:20:37 +01:00
|
|
|
s.inputs[inputPendingPublish.PreviousOutPoint] = &SweeperInput{
|
2024-03-17 19:49:58 +01:00
|
|
|
state: PendingPublish,
|
2023-10-24 02:14:52 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// First, check that when an error is returned from db, it's properly
|
|
|
|
// returned here.
|
|
|
|
mockStore.On("StoreTx", dummyTR).Return(dummyErr).Once()
|
|
|
|
err := s.markInputsPublished(dummyTR, nil)
|
|
|
|
require.ErrorIs(err, dummyErr)
|
|
|
|
|
|
|
|
// We also expect the record has been marked as published.
|
|
|
|
require.True(dummyTR.Published)
|
|
|
|
|
|
|
|
// Then, check that the target input has will be correctly marked as
|
|
|
|
// published.
|
|
|
|
//
|
|
|
|
// Mock the store to return nil
|
|
|
|
mockStore.On("StoreTx", dummyTR).Return(nil).Once()
|
|
|
|
|
|
|
|
// Mark the test inputs. We expect the non-exist input and the
|
|
|
|
// inputInit to be skipped, and the final input to be marked as
|
|
|
|
// published.
|
|
|
|
err = s.markInputsPublished(dummyTR, []*wire.TxIn{
|
|
|
|
inputNotExist, inputInit, inputPendingPublish,
|
|
|
|
})
|
|
|
|
require.NoError(err)
|
|
|
|
|
|
|
|
// We expect unchanged number of pending inputs.
|
2024-03-17 20:00:58 +01:00
|
|
|
require.Len(s.inputs, 2)
|
2023-10-24 02:14:52 +02:00
|
|
|
|
|
|
|
// We expect the init input's state to stay unchanged.
|
2024-03-17 19:49:58 +01:00
|
|
|
require.Equal(Init,
|
2024-03-17 20:00:58 +01:00
|
|
|
s.inputs[inputInit.PreviousOutPoint].state)
|
2023-10-24 02:14:52 +02:00
|
|
|
|
|
|
|
// We expect the pending-publish input's is now marked as published.
|
2024-03-17 19:49:58 +01:00
|
|
|
require.Equal(Published,
|
2024-03-17 20:00:58 +01:00
|
|
|
s.inputs[inputPendingPublish.PreviousOutPoint].state)
|
2023-10-24 02:14:52 +02:00
|
|
|
|
|
|
|
// Assert mocked statements are executed as expected.
|
|
|
|
mockStore.AssertExpectations(t)
|
|
|
|
}
|
|
|
|
|
|
|
|
// TestMarkInputsPublishFailed checks that given a list of inputs with
|
2024-03-17 19:49:58 +01:00
|
|
|
// different states, only the state `PendingPublish` will be marked as
|
2023-10-24 02:14:52 +02:00
|
|
|
// `PublishFailed`.
|
|
|
|
func TestMarkInputsPublishFailed(t *testing.T) {
|
|
|
|
t.Parallel()
|
|
|
|
|
|
|
|
require := require.New(t)
|
|
|
|
|
|
|
|
// Create a mock sweeper store.
|
|
|
|
mockStore := NewMockSweeperStore()
|
|
|
|
|
|
|
|
// Create a test sweeper.
|
|
|
|
s := New(&UtxoSweeperConfig{
|
|
|
|
Store: mockStore,
|
|
|
|
})
|
|
|
|
|
|
|
|
// Create three testing inputs.
|
|
|
|
//
|
|
|
|
// inputNotExist specifies an input that's not found in the sweeper's
|
2024-03-17 20:00:58 +01:00
|
|
|
// `inputs` map.
|
2023-10-24 02:14:52 +02:00
|
|
|
inputNotExist := &wire.TxIn{
|
|
|
|
PreviousOutPoint: wire.OutPoint{Index: 1},
|
|
|
|
}
|
|
|
|
|
|
|
|
// inputInit specifies a newly created input. When marking this as
|
|
|
|
// published, we should see an error log as this input hasn't been
|
|
|
|
// published yet.
|
|
|
|
inputInit := &wire.TxIn{
|
|
|
|
PreviousOutPoint: wire.OutPoint{Index: 2},
|
|
|
|
}
|
2024-03-17 20:20:37 +01:00
|
|
|
s.inputs[inputInit.PreviousOutPoint] = &SweeperInput{
|
2024-03-17 19:49:58 +01:00
|
|
|
state: Init,
|
2023-10-24 02:14:52 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// inputPendingPublish specifies an input that's about to be published.
|
|
|
|
inputPendingPublish := &wire.TxIn{
|
|
|
|
PreviousOutPoint: wire.OutPoint{Index: 3},
|
|
|
|
}
|
2024-03-17 20:20:37 +01:00
|
|
|
s.inputs[inputPendingPublish.PreviousOutPoint] = &SweeperInput{
|
2024-03-17 19:49:58 +01:00
|
|
|
state: PendingPublish,
|
2023-10-24 02:14:52 +02:00
|
|
|
}
|
|
|
|
|
|
|
|
// Mark the test inputs. We expect the non-exist input and the
|
|
|
|
// inputInit to be skipped, and the final input to be marked as
|
|
|
|
// published.
|
2024-01-16 17:20:24 +01:00
|
|
|
s.markInputsPublishFailed([]wire.OutPoint{
|
|
|
|
inputNotExist.PreviousOutPoint,
|
|
|
|
inputInit.PreviousOutPoint,
|
|
|
|
inputPendingPublish.PreviousOutPoint,
|
2023-10-24 02:14:52 +02:00
|
|
|
})
|
|
|
|
|
|
|
|
// We expect unchanged number of pending inputs.
|
2024-03-17 20:00:58 +01:00
|
|
|
require.Len(s.inputs, 2)
|
2023-10-24 02:14:52 +02:00
|
|
|
|
|
|
|
// We expect the init input's state to stay unchanged.
|
2024-03-17 19:49:58 +01:00
|
|
|
require.Equal(Init,
|
2024-03-17 20:00:58 +01:00
|
|
|
s.inputs[inputInit.PreviousOutPoint].state)
|
2023-10-24 02:14:52 +02:00
|
|
|
|
|
|
|
// We expect the pending-publish input's is now marked as publish
|
|
|
|
// failed.
|
2024-03-17 19:49:58 +01:00
|
|
|
require.Equal(PublishFailed,
|
2024-03-17 20:00:58 +01:00
|
|
|
s.inputs[inputPendingPublish.PreviousOutPoint].state)
|
2023-10-24 02:14:52 +02:00
|
|
|
|
|
|
|
// Assert mocked statements are executed as expected.
|
|
|
|
mockStore.AssertExpectations(t)
|
|
|
|
}
|
2023-10-24 07:14:21 +02:00
|
|
|
|
2024-01-11 00:54:32 +01:00
|
|
|
// TestMarkInputsSwept checks that given a list of inputs with different
|
2024-03-17 19:49:58 +01:00
|
|
|
// states, only the non-terminal state will be marked as `Swept`.
|
2024-01-11 00:54:32 +01:00
|
|
|
func TestMarkInputsSwept(t *testing.T) {
|
|
|
|
t.Parallel()
|
|
|
|
|
|
|
|
require := require.New(t)
|
|
|
|
|
|
|
|
// Create a mock input.
|
|
|
|
mockInput := &input.MockInput{}
|
|
|
|
defer mockInput.AssertExpectations(t)
|
|
|
|
|
|
|
|
// Mock the `OutPoint` to return a dummy outpoint.
|
|
|
|
mockInput.On("OutPoint").Return(&wire.OutPoint{Hash: chainhash.Hash{1}})
|
|
|
|
|
|
|
|
// Create a test sweeper.
|
|
|
|
s := New(&UtxoSweeperConfig{})
|
|
|
|
|
|
|
|
// Create three testing inputs.
|
|
|
|
//
|
|
|
|
// inputNotExist specifies an input that's not found in the sweeper's
|
2024-03-17 20:00:58 +01:00
|
|
|
// `inputs` map.
|
2024-01-11 00:54:32 +01:00
|
|
|
inputNotExist := &wire.TxIn{
|
|
|
|
PreviousOutPoint: wire.OutPoint{Index: 1},
|
|
|
|
}
|
|
|
|
|
|
|
|
// inputInit specifies a newly created input.
|
|
|
|
inputInit := &wire.TxIn{
|
|
|
|
PreviousOutPoint: wire.OutPoint{Index: 2},
|
|
|
|
}
|
2024-03-17 20:20:37 +01:00
|
|
|
s.inputs[inputInit.PreviousOutPoint] = &SweeperInput{
|
2024-03-17 19:49:58 +01:00
|
|
|
state: Init,
|
2024-01-11 00:54:32 +01:00
|
|
|
Input: mockInput,
|
|
|
|
}
|
|
|
|
|
|
|
|
// inputPendingPublish specifies an input that's about to be published.
|
|
|
|
inputPendingPublish := &wire.TxIn{
|
|
|
|
PreviousOutPoint: wire.OutPoint{Index: 3},
|
|
|
|
}
|
2024-03-17 20:20:37 +01:00
|
|
|
s.inputs[inputPendingPublish.PreviousOutPoint] = &SweeperInput{
|
2024-03-17 19:49:58 +01:00
|
|
|
state: PendingPublish,
|
2024-01-11 00:54:32 +01:00
|
|
|
Input: mockInput,
|
|
|
|
}
|
|
|
|
|
|
|
|
// inputTerminated specifies an input that's terminated.
|
|
|
|
inputTerminated := &wire.TxIn{
|
|
|
|
PreviousOutPoint: wire.OutPoint{Index: 4},
|
|
|
|
}
|
2024-03-17 20:20:37 +01:00
|
|
|
s.inputs[inputTerminated.PreviousOutPoint] = &SweeperInput{
|
2024-03-17 19:49:58 +01:00
|
|
|
state: Excluded,
|
2024-01-11 00:54:32 +01:00
|
|
|
Input: mockInput,
|
|
|
|
}
|
|
|
|
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
inputNotExist, inputInit,
|
|
|
|
inputPendingPublish, inputTerminated,
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Mark the test inputs. We expect the inputTerminated to be skipped,
|
|
|
|
// and the rest to be marked as swept.
|
|
|
|
s.markInputsSwept(tx, true)
|
|
|
|
|
|
|
|
// We expect unchanged number of pending inputs.
|
2024-03-17 20:00:58 +01:00
|
|
|
require.Len(s.inputs, 3)
|
2024-01-11 00:54:32 +01:00
|
|
|
|
|
|
|
// We expect the init input's state to become swept.
|
2024-03-17 19:49:58 +01:00
|
|
|
require.Equal(Swept,
|
2024-03-17 20:00:58 +01:00
|
|
|
s.inputs[inputInit.PreviousOutPoint].state)
|
2024-01-11 00:54:32 +01:00
|
|
|
|
|
|
|
// We expect the pending-publish becomes swept.
|
2024-03-17 19:49:58 +01:00
|
|
|
require.Equal(Swept,
|
2024-03-17 20:00:58 +01:00
|
|
|
s.inputs[inputPendingPublish.PreviousOutPoint].state)
|
2024-01-11 00:54:32 +01:00
|
|
|
|
|
|
|
// We expect the terminated to stay unchanged.
|
2024-03-17 19:49:58 +01:00
|
|
|
require.Equal(Excluded,
|
2024-03-17 20:00:58 +01:00
|
|
|
s.inputs[inputTerminated.PreviousOutPoint].state)
|
2024-01-11 00:54:32 +01:00
|
|
|
}
|
|
|
|
|
2023-10-24 07:14:21 +02:00
|
|
|
// TestMempoolLookup checks that the method `mempoolLookup` works as expected.
|
|
|
|
func TestMempoolLookup(t *testing.T) {
|
|
|
|
t.Parallel()
|
|
|
|
|
|
|
|
require := require.New(t)
|
|
|
|
|
|
|
|
// Create a test outpoint.
|
|
|
|
op := wire.OutPoint{Index: 1}
|
|
|
|
|
|
|
|
// Create a mock mempool watcher.
|
|
|
|
mockMempool := chainntnfs.NewMockMempoolWatcher()
|
2024-02-24 05:21:54 +01:00
|
|
|
defer mockMempool.AssertExpectations(t)
|
2023-10-24 07:14:21 +02:00
|
|
|
|
|
|
|
// Create a test sweeper without a mempool.
|
|
|
|
s := New(&UtxoSweeperConfig{})
|
|
|
|
|
2024-02-24 05:21:54 +01:00
|
|
|
// Since we don't have a mempool, we expect the call to return a
|
|
|
|
// fn.None indicating it's not found.
|
|
|
|
tx := s.mempoolLookup(op)
|
|
|
|
require.True(tx.IsNone())
|
2023-10-24 07:14:21 +02:00
|
|
|
|
|
|
|
// Re-create the sweeper with the mocked mempool watcher.
|
|
|
|
s = New(&UtxoSweeperConfig{
|
|
|
|
Mempool: mockMempool,
|
|
|
|
})
|
|
|
|
|
2024-02-24 05:21:54 +01:00
|
|
|
// Mock the mempool watcher to return not found.
|
|
|
|
mockMempool.On("LookupInputMempoolSpend", op).Return(
|
|
|
|
fn.None[wire.MsgTx]()).Once()
|
2023-10-24 07:14:21 +02:00
|
|
|
|
2024-02-24 05:21:54 +01:00
|
|
|
// We expect a fn.None tx to be returned.
|
|
|
|
tx = s.mempoolLookup(op)
|
|
|
|
require.True(tx.IsNone())
|
2023-10-24 07:14:21 +02:00
|
|
|
|
2024-02-24 05:21:54 +01:00
|
|
|
// Mock the mempool to return a spending tx.
|
|
|
|
dummyTx := wire.MsgTx{}
|
|
|
|
mockMempool.On("LookupInputMempoolSpend", op).Return(
|
|
|
|
fn.Some(dummyTx)).Once()
|
2023-10-24 07:14:21 +02:00
|
|
|
|
|
|
|
// Calling the loopup again, we expect the dummyTx to be returned.
|
2024-02-24 05:21:54 +01:00
|
|
|
tx = s.mempoolLookup(op)
|
|
|
|
require.False(tx.IsNone())
|
|
|
|
require.Equal(dummyTx, tx.UnsafeFromSome())
|
2023-10-24 07:14:21 +02:00
|
|
|
}
|
2023-10-24 07:47:14 +02:00
|
|
|
|
|
|
|
// TestUpdateSweeperInputs checks that the method `updateSweeperInputs` will
|
|
|
|
// properly update the inputs based on their states.
|
|
|
|
func TestUpdateSweeperInputs(t *testing.T) {
|
|
|
|
t.Parallel()
|
|
|
|
|
|
|
|
require := require.New(t)
|
|
|
|
|
|
|
|
// Create a test sweeper.
|
|
|
|
s := New(nil)
|
|
|
|
|
|
|
|
// Create a list of inputs using all the states.
|
2024-03-17 20:20:37 +01:00
|
|
|
input0 := &SweeperInput{state: Init}
|
|
|
|
input1 := &SweeperInput{state: PendingPublish}
|
|
|
|
input2 := &SweeperInput{state: Published}
|
|
|
|
input3 := &SweeperInput{state: PublishFailed}
|
|
|
|
input4 := &SweeperInput{state: Swept}
|
|
|
|
input5 := &SweeperInput{state: Excluded}
|
|
|
|
input6 := &SweeperInput{state: Failed}
|
2023-10-24 07:47:14 +02:00
|
|
|
|
|
|
|
// Add the inputs to the sweeper. After the update, we should see the
|
|
|
|
// terminated inputs being removed.
|
2024-03-17 20:20:37 +01:00
|
|
|
s.inputs = map[wire.OutPoint]*SweeperInput{
|
2023-10-24 07:47:14 +02:00
|
|
|
{Index: 0}: input0,
|
|
|
|
{Index: 1}: input1,
|
|
|
|
{Index: 2}: input2,
|
|
|
|
{Index: 3}: input3,
|
|
|
|
{Index: 4}: input4,
|
|
|
|
{Index: 5}: input5,
|
|
|
|
{Index: 6}: input6,
|
|
|
|
}
|
|
|
|
|
2024-03-17 19:49:58 +01:00
|
|
|
// We expect the inputs with `Swept`, `Excluded`, and `Failed` to be
|
|
|
|
// removed.
|
2024-03-17 20:20:37 +01:00
|
|
|
expectedInputs := map[wire.OutPoint]*SweeperInput{
|
2023-10-24 07:47:14 +02:00
|
|
|
{Index: 0}: input0,
|
|
|
|
{Index: 1}: input1,
|
|
|
|
{Index: 2}: input2,
|
|
|
|
{Index: 3}: input3,
|
|
|
|
}
|
|
|
|
|
2024-03-17 19:49:58 +01:00
|
|
|
// We expect only the inputs with `Init` and `PublishFailed` to be
|
|
|
|
// returned.
|
2024-03-17 20:20:37 +01:00
|
|
|
expectedReturn := map[wire.OutPoint]*SweeperInput{
|
2023-10-24 07:47:14 +02:00
|
|
|
{Index: 0}: input0,
|
|
|
|
{Index: 3}: input3,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Update the sweeper inputs.
|
|
|
|
inputs := s.updateSweeperInputs()
|
|
|
|
|
|
|
|
// Assert the returned inputs are as expected.
|
|
|
|
require.Equal(expectedReturn, inputs)
|
|
|
|
|
|
|
|
// Assert the sweeper inputs are as expected.
|
2024-03-17 20:00:58 +01:00
|
|
|
require.Equal(expectedInputs, s.inputs)
|
2023-10-24 07:47:14 +02:00
|
|
|
}
|
2023-10-26 08:27:46 +02:00
|
|
|
|
2024-03-20 00:31:41 +01:00
|
|
|
// TestDecideStateAndRBFInfo checks that the expected state and RBFInfo are
|
|
|
|
// returned based on whether this input can be found both in mempool and the
|
|
|
|
// sweeper store.
|
|
|
|
func TestDecideStateAndRBFInfo(t *testing.T) {
|
2023-10-26 08:27:46 +02:00
|
|
|
t.Parallel()
|
|
|
|
|
|
|
|
require := require.New(t)
|
|
|
|
|
|
|
|
// Create a test outpoint.
|
|
|
|
op := wire.OutPoint{Index: 1}
|
|
|
|
|
|
|
|
// Create a mock mempool watcher and a mock sweeper store.
|
|
|
|
mockMempool := chainntnfs.NewMockMempoolWatcher()
|
2024-02-24 05:21:54 +01:00
|
|
|
defer mockMempool.AssertExpectations(t)
|
2023-10-26 08:27:46 +02:00
|
|
|
mockStore := NewMockSweeperStore()
|
2024-02-24 05:21:54 +01:00
|
|
|
defer mockStore.AssertExpectations(t)
|
2023-10-26 08:27:46 +02:00
|
|
|
|
|
|
|
// Create a test sweeper.
|
|
|
|
s := New(&UtxoSweeperConfig{
|
|
|
|
Store: mockStore,
|
|
|
|
Mempool: mockMempool,
|
|
|
|
})
|
|
|
|
|
2024-02-24 05:21:54 +01:00
|
|
|
// First, mock the mempool to return false.
|
|
|
|
mockMempool.On("LookupInputMempoolSpend", op).Return(
|
|
|
|
fn.None[wire.MsgTx]()).Once()
|
2023-10-26 08:27:46 +02:00
|
|
|
|
2024-03-20 00:31:41 +01:00
|
|
|
// Since the mempool lookup failed, we exepect state Init and no
|
|
|
|
// RBFInfo.
|
|
|
|
state, rbf := s.decideStateAndRBFInfo(op)
|
|
|
|
require.True(rbf.IsNone())
|
2024-03-17 19:49:58 +01:00
|
|
|
require.Equal(Init, state)
|
2023-10-26 08:27:46 +02:00
|
|
|
|
2024-02-24 05:21:54 +01:00
|
|
|
// Mock the mempool lookup to return a tx three times as we are calling
|
|
|
|
// attachAvailableRBFInfo three times.
|
|
|
|
tx := wire.MsgTx{}
|
|
|
|
mockMempool.On("LookupInputMempoolSpend", op).Return(
|
|
|
|
fn.Some(tx)).Times(3)
|
2023-10-26 08:27:46 +02:00
|
|
|
|
|
|
|
// Mock the store to return an error saying the tx cannot be found.
|
|
|
|
mockStore.On("GetTx", tx.TxHash()).Return(nil, ErrTxNotFound).Once()
|
|
|
|
|
2024-03-20 00:31:41 +01:00
|
|
|
// Although the db lookup failed, we expect the state to be Published.
|
|
|
|
state, rbf = s.decideStateAndRBFInfo(op)
|
|
|
|
require.True(rbf.IsNone())
|
2024-03-17 19:49:58 +01:00
|
|
|
require.Equal(Published, state)
|
2023-10-26 08:27:46 +02:00
|
|
|
|
|
|
|
// Mock the store to return a db error.
|
2024-02-24 05:21:54 +01:00
|
|
|
dummyErr := errors.New("dummy error")
|
2023-10-26 08:27:46 +02:00
|
|
|
mockStore.On("GetTx", tx.TxHash()).Return(nil, dummyErr).Once()
|
|
|
|
|
2024-03-20 00:31:41 +01:00
|
|
|
// Although the db lookup failed, we expect the state to be Published.
|
|
|
|
state, rbf = s.decideStateAndRBFInfo(op)
|
|
|
|
require.True(rbf.IsNone())
|
2024-03-17 19:49:58 +01:00
|
|
|
require.Equal(Published, state)
|
2023-10-26 08:27:46 +02:00
|
|
|
|
|
|
|
// Mock the store to return a record.
|
|
|
|
tr := &TxRecord{
|
|
|
|
Fee: 100,
|
|
|
|
FeeRate: 100,
|
|
|
|
}
|
|
|
|
mockStore.On("GetTx", tx.TxHash()).Return(tr, nil).Once()
|
|
|
|
|
|
|
|
// Call the method again.
|
2024-03-20 00:31:41 +01:00
|
|
|
state, rbf = s.decideStateAndRBFInfo(op)
|
2023-10-26 08:27:46 +02:00
|
|
|
|
2024-03-20 00:31:41 +01:00
|
|
|
// Assert that the RBF info is returned.
|
2023-10-26 08:27:46 +02:00
|
|
|
rbfInfo := fn.Some(RBFInfo{
|
|
|
|
Txid: tx.TxHash(),
|
|
|
|
Fee: btcutil.Amount(tr.Fee),
|
|
|
|
FeeRate: chainfee.SatPerKWeight(tr.FeeRate),
|
|
|
|
})
|
2024-03-20 00:31:41 +01:00
|
|
|
require.Equal(rbfInfo, rbf)
|
2023-10-26 08:27:46 +02:00
|
|
|
|
|
|
|
// Assert the state is updated.
|
2024-03-17 19:49:58 +01:00
|
|
|
require.Equal(Published, state)
|
2023-10-26 08:27:46 +02:00
|
|
|
}
|
2024-02-27 20:10:49 +01:00
|
|
|
|
|
|
|
// TestMarkInputFailed checks that the input is marked as failed as expected.
|
|
|
|
func TestMarkInputFailed(t *testing.T) {
|
|
|
|
t.Parallel()
|
|
|
|
|
|
|
|
// Create a mock input.
|
|
|
|
mockInput := &input.MockInput{}
|
|
|
|
defer mockInput.AssertExpectations(t)
|
|
|
|
|
|
|
|
// Mock the `OutPoint` to return a dummy outpoint.
|
|
|
|
mockInput.On("OutPoint").Return(&wire.OutPoint{Hash: chainhash.Hash{1}})
|
|
|
|
|
|
|
|
// Create a test sweeper.
|
|
|
|
s := New(&UtxoSweeperConfig{})
|
|
|
|
|
|
|
|
// Create a testing pending input.
|
2024-03-17 20:20:37 +01:00
|
|
|
pi := &SweeperInput{
|
2024-03-17 19:49:58 +01:00
|
|
|
state: Init,
|
2024-02-27 20:10:49 +01:00
|
|
|
Input: mockInput,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Call the method under test.
|
|
|
|
s.markInputFailed(pi, errors.New("dummy error"))
|
|
|
|
|
|
|
|
// Assert the state is updated.
|
2024-03-17 19:49:58 +01:00
|
|
|
require.Equal(t, Failed, pi.state)
|
2024-02-27 20:10:49 +01:00
|
|
|
}
|
2024-01-30 20:25:58 +01:00
|
|
|
|
|
|
|
// TestSweepPendingInputs checks that `sweepPendingInputs` correctly executes
|
|
|
|
// its workflow based on the returned values from the interfaces.
|
|
|
|
func TestSweepPendingInputs(t *testing.T) {
|
|
|
|
t.Parallel()
|
|
|
|
|
|
|
|
// Create a mock wallet and aggregator.
|
|
|
|
wallet := &MockWallet{}
|
2024-01-17 10:21:09 +01:00
|
|
|
defer wallet.AssertExpectations(t)
|
|
|
|
|
2024-01-30 20:25:58 +01:00
|
|
|
aggregator := &mockUtxoAggregator{}
|
2024-01-17 10:21:09 +01:00
|
|
|
defer aggregator.AssertExpectations(t)
|
|
|
|
|
|
|
|
publisher := &MockBumper{}
|
|
|
|
defer publisher.AssertExpectations(t)
|
2024-01-30 20:25:58 +01:00
|
|
|
|
|
|
|
// Create a test sweeper.
|
|
|
|
s := New(&UtxoSweeperConfig{
|
|
|
|
Wallet: wallet,
|
|
|
|
Aggregator: aggregator,
|
2024-01-17 10:21:09 +01:00
|
|
|
Publisher: publisher,
|
|
|
|
GenSweepScript: func() ([]byte, error) {
|
|
|
|
return testPubKey.SerializeCompressed(), nil
|
|
|
|
},
|
2024-01-30 20:25:58 +01:00
|
|
|
})
|
|
|
|
|
|
|
|
// Create an input set that needs wallet inputs.
|
|
|
|
setNeedWallet := &MockInputSet{}
|
2024-01-17 10:21:09 +01:00
|
|
|
defer setNeedWallet.AssertExpectations(t)
|
2024-01-30 20:25:58 +01:00
|
|
|
|
|
|
|
// Mock this set to ask for wallet input.
|
|
|
|
setNeedWallet.On("NeedWalletInput").Return(true).Once()
|
|
|
|
setNeedWallet.On("AddWalletInputs", wallet).Return(nil).Once()
|
|
|
|
|
|
|
|
// Mock the wallet to require the lock once.
|
|
|
|
wallet.On("WithCoinSelectLock", mock.Anything).Return(nil).Once()
|
|
|
|
|
|
|
|
// Create an input set that doesn't need wallet inputs.
|
|
|
|
normalSet := &MockInputSet{}
|
2024-01-17 10:21:09 +01:00
|
|
|
defer normalSet.AssertExpectations(t)
|
|
|
|
|
2024-01-30 20:25:58 +01:00
|
|
|
normalSet.On("NeedWalletInput").Return(false).Once()
|
|
|
|
|
|
|
|
// Mock the methods used in `sweep`. This is not important for this
|
|
|
|
// unit test.
|
2024-01-17 10:21:09 +01:00
|
|
|
setNeedWallet.On("Inputs").Return(nil).Times(4)
|
|
|
|
setNeedWallet.On("DeadlineHeight").Return(fn.None[int32]()).Once()
|
|
|
|
setNeedWallet.On("Budget").Return(btcutil.Amount(1)).Once()
|
|
|
|
normalSet.On("Inputs").Return(nil).Times(4)
|
|
|
|
normalSet.On("DeadlineHeight").Return(fn.None[int32]()).Once()
|
|
|
|
normalSet.On("Budget").Return(btcutil.Amount(1)).Once()
|
2024-01-30 20:25:58 +01:00
|
|
|
|
|
|
|
// Make pending inputs for testing. We don't need real values here as
|
|
|
|
// the returned clusters are mocked.
|
2024-03-17 20:20:37 +01:00
|
|
|
pis := make(InputsMap)
|
2024-01-30 20:25:58 +01:00
|
|
|
|
|
|
|
// Mock the aggregator to return the mocked input sets.
|
|
|
|
aggregator.On("ClusterInputs", pis).Return([]InputSet{
|
|
|
|
setNeedWallet, normalSet,
|
|
|
|
})
|
|
|
|
|
2024-01-17 10:21:09 +01:00
|
|
|
// Mock `Broadcast` to return an error. This should cause the
|
2024-01-30 20:25:58 +01:00
|
|
|
// `createSweepTx` inside `sweep` to fail. This is done so we can
|
|
|
|
// terminate the method early as we are only interested in testing the
|
|
|
|
// workflow in `sweepPendingInputs`. We don't need to test `sweep` here
|
|
|
|
// as it should be tested in its own unit test.
|
2024-01-17 10:21:09 +01:00
|
|
|
dummyErr := errors.New("dummy error")
|
|
|
|
publisher.On("Broadcast", mock.Anything).Return(nil, dummyErr).Twice()
|
2024-01-30 20:25:58 +01:00
|
|
|
|
|
|
|
// Call the method under test.
|
|
|
|
s.sweepPendingInputs(pis)
|
2024-01-17 10:21:09 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// TestHandleBumpEventTxFailed checks that the sweeper correctly handles the
|
|
|
|
// case where the bump event tx fails to be published.
|
|
|
|
func TestHandleBumpEventTxFailed(t *testing.T) {
|
|
|
|
t.Parallel()
|
|
|
|
|
|
|
|
// Create a test sweeper.
|
|
|
|
s := New(&UtxoSweeperConfig{})
|
|
|
|
|
|
|
|
var (
|
|
|
|
// Create four testing outpoints.
|
|
|
|
op1 = wire.OutPoint{Hash: chainhash.Hash{1}}
|
|
|
|
op2 = wire.OutPoint{Hash: chainhash.Hash{2}}
|
|
|
|
op3 = wire.OutPoint{Hash: chainhash.Hash{3}}
|
|
|
|
opNotExist = wire.OutPoint{Hash: chainhash.Hash{4}}
|
|
|
|
)
|
|
|
|
|
|
|
|
// Create three mock inputs.
|
|
|
|
input1 := &input.MockInput{}
|
|
|
|
defer input1.AssertExpectations(t)
|
|
|
|
|
|
|
|
input2 := &input.MockInput{}
|
|
|
|
defer input2.AssertExpectations(t)
|
|
|
|
|
|
|
|
input3 := &input.MockInput{}
|
|
|
|
defer input3.AssertExpectations(t)
|
|
|
|
|
|
|
|
// Construct the initial state for the sweeper.
|
2024-03-17 20:20:37 +01:00
|
|
|
s.inputs = InputsMap{
|
|
|
|
op1: &SweeperInput{Input: input1, state: PendingPublish},
|
|
|
|
op2: &SweeperInput{Input: input2, state: PendingPublish},
|
|
|
|
op3: &SweeperInput{Input: input3, state: PendingPublish},
|
2024-01-17 10:21:09 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// Create a testing tx that spends the first two inputs.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: op1},
|
|
|
|
{PreviousOutPoint: op2},
|
|
|
|
{PreviousOutPoint: opNotExist},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Create a testing bump result.
|
|
|
|
br := &BumpResult{
|
|
|
|
Tx: tx,
|
|
|
|
Event: TxFailed,
|
|
|
|
Err: errDummy,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Call the method under test.
|
|
|
|
err := s.handleBumpEvent(br)
|
|
|
|
require.ErrorIs(t, err, errDummy)
|
|
|
|
|
|
|
|
// Assert the states of the first two inputs are updated.
|
2024-03-17 20:00:58 +01:00
|
|
|
require.Equal(t, PublishFailed, s.inputs[op1].state)
|
|
|
|
require.Equal(t, PublishFailed, s.inputs[op2].state)
|
2024-01-17 10:21:09 +01:00
|
|
|
|
|
|
|
// Assert the state of the third input is not updated.
|
2024-03-17 20:00:58 +01:00
|
|
|
require.Equal(t, PendingPublish, s.inputs[op3].state)
|
2024-01-17 10:21:09 +01:00
|
|
|
|
|
|
|
// Assert the non-existing input is not added to the pending inputs.
|
2024-03-17 20:00:58 +01:00
|
|
|
require.NotContains(t, s.inputs, opNotExist)
|
2024-01-17 10:21:09 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// TestHandleBumpEventTxReplaced checks that the sweeper correctly handles the
|
|
|
|
// case where the bump event tx is replaced.
|
|
|
|
func TestHandleBumpEventTxReplaced(t *testing.T) {
|
|
|
|
t.Parallel()
|
|
|
|
|
|
|
|
// Create a mock store.
|
|
|
|
store := &MockSweeperStore{}
|
|
|
|
defer store.AssertExpectations(t)
|
|
|
|
|
|
|
|
// Create a test sweeper.
|
|
|
|
s := New(&UtxoSweeperConfig{
|
|
|
|
Store: store,
|
|
|
|
})
|
|
|
|
|
|
|
|
// Create a testing outpoint.
|
|
|
|
op := wire.OutPoint{Hash: chainhash.Hash{1}}
|
|
|
|
|
|
|
|
// Create a mock input.
|
|
|
|
inp := &input.MockInput{}
|
|
|
|
defer inp.AssertExpectations(t)
|
|
|
|
|
|
|
|
// Construct the initial state for the sweeper.
|
2024-03-17 20:20:37 +01:00
|
|
|
s.inputs = InputsMap{
|
|
|
|
op: &SweeperInput{Input: inp, state: PendingPublish},
|
2024-01-17 10:21:09 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// Create a testing tx that spends the input.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
LockTime: 1,
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: op},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Create a replacement tx.
|
|
|
|
replacementTx := &wire.MsgTx{
|
|
|
|
LockTime: 2,
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: op},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Create a testing bump result.
|
|
|
|
br := &BumpResult{
|
|
|
|
Tx: replacementTx,
|
|
|
|
ReplacedTx: tx,
|
|
|
|
Event: TxReplaced,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Mock the store to return an error.
|
|
|
|
dummyErr := errors.New("dummy error")
|
|
|
|
store.On("GetTx", tx.TxHash()).Return(nil, dummyErr).Once()
|
|
|
|
|
|
|
|
// Call the method under test and assert the error is returned.
|
|
|
|
err := s.handleBumpEventTxReplaced(br)
|
|
|
|
require.ErrorIs(t, err, dummyErr)
|
|
|
|
|
|
|
|
// Mock the store to return the old tx record.
|
|
|
|
store.On("GetTx", tx.TxHash()).Return(&TxRecord{
|
|
|
|
Txid: tx.TxHash(),
|
|
|
|
}, nil).Once()
|
|
|
|
|
|
|
|
// Mock an error returned when deleting the old tx record.
|
|
|
|
store.On("DeleteTx", tx.TxHash()).Return(dummyErr).Once()
|
|
|
|
|
|
|
|
// Call the method under test and assert the error is returned.
|
|
|
|
err = s.handleBumpEventTxReplaced(br)
|
|
|
|
require.ErrorIs(t, err, dummyErr)
|
|
|
|
|
|
|
|
// Mock the store to return the old tx record and delete it without
|
|
|
|
// error.
|
|
|
|
store.On("GetTx", tx.TxHash()).Return(&TxRecord{
|
|
|
|
Txid: tx.TxHash(),
|
|
|
|
}, nil).Once()
|
|
|
|
store.On("DeleteTx", tx.TxHash()).Return(nil).Once()
|
|
|
|
|
|
|
|
// Mock the store to save the new tx record.
|
|
|
|
store.On("StoreTx", &TxRecord{
|
|
|
|
Txid: replacementTx.TxHash(),
|
|
|
|
Published: true,
|
|
|
|
}).Return(nil).Once()
|
|
|
|
|
|
|
|
// Call the method under test.
|
|
|
|
err = s.handleBumpEventTxReplaced(br)
|
|
|
|
require.NoError(t, err)
|
|
|
|
|
|
|
|
// Assert the state of the input is updated.
|
2024-03-17 20:00:58 +01:00
|
|
|
require.Equal(t, Published, s.inputs[op].state)
|
2024-01-17 10:21:09 +01:00
|
|
|
}
|
2024-01-30 20:25:58 +01:00
|
|
|
|
2024-01-17 10:21:09 +01:00
|
|
|
// TestHandleBumpEventTxPublished checks that the sweeper correctly handles the
|
|
|
|
// case where the bump event tx is published.
|
|
|
|
func TestHandleBumpEventTxPublished(t *testing.T) {
|
|
|
|
t.Parallel()
|
|
|
|
|
|
|
|
// Create a mock store.
|
|
|
|
store := &MockSweeperStore{}
|
|
|
|
defer store.AssertExpectations(t)
|
|
|
|
|
|
|
|
// Create a test sweeper.
|
|
|
|
s := New(&UtxoSweeperConfig{
|
|
|
|
Store: store,
|
|
|
|
})
|
|
|
|
|
|
|
|
// Create a testing outpoint.
|
|
|
|
op := wire.OutPoint{Hash: chainhash.Hash{1}}
|
|
|
|
|
|
|
|
// Create a mock input.
|
|
|
|
inp := &input.MockInput{}
|
|
|
|
defer inp.AssertExpectations(t)
|
|
|
|
|
|
|
|
// Construct the initial state for the sweeper.
|
2024-03-17 20:20:37 +01:00
|
|
|
s.inputs = InputsMap{
|
|
|
|
op: &SweeperInput{Input: inp, state: PendingPublish},
|
2024-01-17 10:21:09 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// Create a testing tx that spends the input.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
LockTime: 1,
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: op},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
// Create a testing bump result.
|
|
|
|
br := &BumpResult{
|
|
|
|
Tx: tx,
|
|
|
|
Event: TxPublished,
|
|
|
|
}
|
|
|
|
|
|
|
|
// Mock the store to save the new tx record.
|
|
|
|
store.On("StoreTx", &TxRecord{
|
|
|
|
Txid: tx.TxHash(),
|
|
|
|
Published: true,
|
|
|
|
}).Return(nil).Once()
|
|
|
|
|
|
|
|
// Call the method under test.
|
|
|
|
err := s.handleBumpEventTxPublished(br)
|
|
|
|
require.NoError(t, err)
|
|
|
|
|
|
|
|
// Assert the state of the input is updated.
|
2024-03-17 20:00:58 +01:00
|
|
|
require.Equal(t, Published, s.inputs[op].state)
|
2024-01-17 10:21:09 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// TestMonitorFeeBumpResult checks that the fee bump monitor loop correctly
|
|
|
|
// exits when the sweeper is stopped, the tx is confirmed or failed.
|
|
|
|
func TestMonitorFeeBumpResult(t *testing.T) {
|
|
|
|
// Create a mock store.
|
|
|
|
store := &MockSweeperStore{}
|
|
|
|
defer store.AssertExpectations(t)
|
|
|
|
|
|
|
|
// Create a test sweeper.
|
|
|
|
s := New(&UtxoSweeperConfig{
|
|
|
|
Store: store,
|
|
|
|
})
|
|
|
|
|
|
|
|
// Create a testing outpoint.
|
|
|
|
op := wire.OutPoint{Hash: chainhash.Hash{1}}
|
|
|
|
|
|
|
|
// Create a mock input.
|
|
|
|
inp := &input.MockInput{}
|
|
|
|
defer inp.AssertExpectations(t)
|
|
|
|
|
|
|
|
// Construct the initial state for the sweeper.
|
2024-03-17 20:20:37 +01:00
|
|
|
s.inputs = InputsMap{
|
|
|
|
op: &SweeperInput{Input: inp, state: PendingPublish},
|
2024-01-17 10:21:09 +01:00
|
|
|
}
|
|
|
|
|
|
|
|
// Create a testing tx that spends the input.
|
|
|
|
tx := &wire.MsgTx{
|
|
|
|
LockTime: 1,
|
|
|
|
TxIn: []*wire.TxIn{
|
|
|
|
{PreviousOutPoint: op},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
testCases := []struct {
|
|
|
|
name string
|
|
|
|
setupResultChan func() <-chan *BumpResult
|
|
|
|
shouldExit bool
|
|
|
|
}{
|
|
|
|
{
|
|
|
|
// When a tx confirmed event is received, we expect to
|
|
|
|
// exit the monitor loop.
|
|
|
|
name: "tx confirmed",
|
|
|
|
// We send a result with TxConfirmed event to the
|
|
|
|
// result channel.
|
|
|
|
setupResultChan: func() <-chan *BumpResult {
|
|
|
|
// Create a result chan.
|
|
|
|
resultChan := make(chan *BumpResult, 1)
|
|
|
|
resultChan <- &BumpResult{
|
|
|
|
Tx: tx,
|
|
|
|
Event: TxConfirmed,
|
|
|
|
Fee: 10000,
|
|
|
|
FeeRate: 100,
|
|
|
|
}
|
|
|
|
|
|
|
|
return resultChan
|
|
|
|
},
|
|
|
|
shouldExit: true,
|
|
|
|
},
|
|
|
|
{
|
|
|
|
// When a tx failed event is received, we expect to
|
|
|
|
// exit the monitor loop.
|
|
|
|
name: "tx failed",
|
|
|
|
// We send a result with TxConfirmed event to the
|
|
|
|
// result channel.
|
|
|
|
setupResultChan: func() <-chan *BumpResult {
|
|
|
|
// Create a result chan.
|
|
|
|
resultChan := make(chan *BumpResult, 1)
|
|
|
|
resultChan <- &BumpResult{
|
|
|
|
Tx: tx,
|
|
|
|
Event: TxFailed,
|
|
|
|
Err: errDummy,
|
|
|
|
}
|
|
|
|
|
|
|
|
return resultChan
|
|
|
|
},
|
|
|
|
shouldExit: true,
|
|
|
|
},
|
|
|
|
{
|
|
|
|
// When processing non-confirmed events, the monitor
|
|
|
|
// should not exit.
|
|
|
|
name: "no exit on normal event",
|
|
|
|
// We send a result with TxPublished and mock the
|
|
|
|
// method `StoreTx` to return nil.
|
|
|
|
setupResultChan: func() <-chan *BumpResult {
|
|
|
|
// Create a result chan.
|
|
|
|
resultChan := make(chan *BumpResult, 1)
|
|
|
|
resultChan <- &BumpResult{
|
|
|
|
Tx: tx,
|
|
|
|
Event: TxPublished,
|
|
|
|
}
|
|
|
|
|
|
|
|
return resultChan
|
|
|
|
},
|
|
|
|
shouldExit: false,
|
|
|
|
}, {
|
|
|
|
// When the sweeper is shutting down, the monitor loop
|
|
|
|
// should exit.
|
|
|
|
name: "exit on sweeper shutdown",
|
|
|
|
// We don't send anything but quit the sweeper.
|
|
|
|
setupResultChan: func() <-chan *BumpResult {
|
|
|
|
close(s.quit)
|
|
|
|
|
|
|
|
return nil
|
|
|
|
},
|
|
|
|
shouldExit: true,
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
for _, tc := range testCases {
|
|
|
|
tc := tc
|
|
|
|
|
|
|
|
t.Run(tc.name, func(t *testing.T) {
|
|
|
|
// Setup the testing result channel.
|
|
|
|
resultChan := tc.setupResultChan()
|
|
|
|
|
|
|
|
// Create a done chan that's used to signal the monitor
|
|
|
|
// has exited.
|
|
|
|
done := make(chan struct{})
|
|
|
|
|
|
|
|
s.wg.Add(1)
|
|
|
|
go func() {
|
|
|
|
s.monitorFeeBumpResult(resultChan)
|
|
|
|
close(done)
|
|
|
|
}()
|
|
|
|
|
|
|
|
// The monitor is expected to exit, we check it's done
|
|
|
|
// in one second or fail.
|
|
|
|
if tc.shouldExit {
|
|
|
|
select {
|
|
|
|
case <-done:
|
|
|
|
case <-time.After(1 * time.Second):
|
|
|
|
require.Fail(t, "monitor not exited")
|
|
|
|
}
|
|
|
|
|
|
|
|
return
|
|
|
|
}
|
|
|
|
|
|
|
|
// The monitor should not exit, check it doesn't close
|
|
|
|
// the `done` channel within one second.
|
|
|
|
select {
|
|
|
|
case <-done:
|
|
|
|
require.Fail(t, "monitor exited")
|
|
|
|
case <-time.After(1 * time.Second):
|
|
|
|
}
|
|
|
|
})
|
|
|
|
}
|
2024-01-30 20:25:58 +01:00
|
|
|
}
|