14885280210

Committed 07 May 2025 01:59PM UTC coverage: 58.038% (-11.0%) from 68.992%

Build # 14885280210

Build Type

Pull #9789

github

Committed by

web-flow

Commit Message

Merge b72813120 into 67a40c90a

Pull Request Pull Request #9789: multi: use updated TLV SizeFunc signature

Run Details

3 of 6 new or added lines in 2 files covered. (50.0%)

29137 existing lines in 453 files now uncovered.

96491 of 166256 relevant lines covered (58.04%)

1.22 hits per line

Source File
Press 'n' to go to next uncovered line, 'b' for previous

79.54

/routing/payment_session.go

package routing

import (
        "fmt"

        "github.com/btcsuite/btcd/btcec/v2"
        "github.com/btcsuite/btclog/v2"
        "github.com/lightningnetwork/lnd/channeldb"
        graphdb "github.com/lightningnetwork/lnd/graph/db"
        "github.com/lightningnetwork/lnd/graph/db/models"
        "github.com/lightningnetwork/lnd/lnutils"
        "github.com/lightningnetwork/lnd/lnwire"
        "github.com/lightningnetwork/lnd/netann"
        "github.com/lightningnetwork/lnd/routing/route"
)

// BlockPadding is used to increment the finalCltvDelta value for the last hop
// to prevent an HTLC being failed if some blocks are mined while it's in-flight.
const BlockPadding uint16 = 3

// ValidateCLTVLimit is a helper function that validates that the cltv limit is
// greater than the final cltv delta parameter, optionally including the
// BlockPadding in this calculation.
func ValidateCLTVLimit(limit uint32, delta uint16, includePad bool) error {
        if includePad {
                delta += BlockPadding
        }

        if limit <= uint32(delta) {
                return fmt.Errorf("cltv limit %v should be greater than %v",
                        limit, delta)
        }

        return nil
}

// noRouteError encodes a non-critical error encountered during path finding.
type noRouteError uint8

const (
        // errNoTlvPayload is returned when the destination hop does not support
        // a tlv payload.
        errNoTlvPayload noRouteError = iota

        // errNoPaymentAddr is returned when the destination hop does not
        // support payment addresses.
        errNoPaymentAddr

        // errNoPathFound is returned when a path to the target destination does
        // not exist in the graph.
        errNoPathFound

        // errInsufficientLocalBalance is returned when none of the local
        // channels have enough balance for the payment.
        errInsufficientBalance

        // errEmptyPaySession is returned when the empty payment session is
        // queried for a route.
        errEmptyPaySession

        // errUnknownRequiredFeature is returned when the destination node
        // requires an unknown feature.
        errUnknownRequiredFeature

        // errMissingDependentFeature is returned when the destination node
        // misses a feature that a feature that we require depends on.
        errMissingDependentFeature
)

var (
        // DefaultShardMinAmt is the default amount beyond which we won't try to
        // further split the payment if no route is found. It is the minimum
        // amount that we use as the shard size when splitting.
        DefaultShardMinAmt = lnwire.NewMSatFromSatoshis(10000)
)

// Error returns the string representation of the noRouteError.
func (e noRouteError) Error() string {
        switch e {
        case errNoTlvPayload:
                return "destination hop doesn't understand new TLV payloads"

        case errNoPaymentAddr:
                return "destination hop doesn't understand payment addresses"

        case errNoPathFound:
                return "unable to find a path to destination"

        case errEmptyPaySession:
                return "empty payment session"

        case errInsufficientBalance:
                return "insufficient local balance"

        case errUnknownRequiredFeature:
                return "unknown required feature"

        case errMissingDependentFeature:
                return "missing dependent feature"

        default:
                return "unknown no-route error"
        }
}

// FailureReason converts a path finding error into a payment-level failure.
func (e noRouteError) FailureReason() channeldb.FailureReason {
        switch e {
        case
                errNoTlvPayload,
                errNoPaymentAddr,
                errNoPathFound,
                errEmptyPaySession,
                errUnknownRequiredFeature,
                errMissingDependentFeature:

                return channeldb.FailureReasonNoRoute

        case errInsufficientBalance:
                return channeldb.FailureReasonInsufficientBalance

        default:
                return channeldb.FailureReasonError
        }
}

// PaymentSession is used during SendPayment attempts to provide routes to
// attempt. It also defines methods to give the PaymentSession additional
// information learned during the previous attempts.
type PaymentSession interface {
        // RequestRoute returns the next route to attempt for routing the
        // specified HTLC payment to the target node. The returned route should
        // carry at most maxAmt to the target node, and pay at most feeLimit in
        // fees. It can carry less if the payment is MPP. The activeShards
        // argument should be set to instruct the payment session about the
        // number of in flight HTLCS for the payment, such that it can choose
        // splitting strategy accordingly.
        //
        // A noRouteError is returned if a non-critical error is encountered
        // during path finding.
        RequestRoute(maxAmt, feeLimit lnwire.MilliSatoshi,
                activeShards, height uint32,
                firstHopCustomRecords lnwire.CustomRecords) (*route.Route,
                error)

        // UpdateAdditionalEdge takes an additional channel edge policy
        // (private channels) and applies the update from the message. Returns
        // a boolean to indicate whether the update has been applied without
        // error.
        UpdateAdditionalEdge(msg *lnwire.ChannelUpdate1,
                pubKey *btcec.PublicKey, policy *models.CachedEdgePolicy) bool

        // GetAdditionalEdgePolicy uses the public key and channel ID to query
        // the ephemeral channel edge policy for additional edges. Returns a nil
        // if nothing found.
        GetAdditionalEdgePolicy(pubKey *btcec.PublicKey,
                channelID uint64) *models.CachedEdgePolicy
}

// paymentSession is used during an HTLC routings session to prune the local
// chain view in response to failures, and also report those failures back to
// MissionController. The snapshot copied for this session will only ever grow,
// and will now be pruned after a decay like the main view within mission
// control. We do this as we want to avoid the case where we continually try a
// bad edge or route multiple times in a session. This can lead to an infinite
// loop if payment attempts take long enough. An additional set of edges can
// also be provided to assist in reaching the payment's destination.
type paymentSession struct {
        selfNode route.Vertex

        additionalEdges map[route.Vertex][]AdditionalEdge

        getBandwidthHints func(Graph) (bandwidthHints, error)

        payment *LightningPayment

        empty bool

        pathFinder pathFinder

        graphSessFactory GraphSessionFactory

        // pathFindingConfig defines global parameters that control the
        // trade-off in path finding between fees and probability.
        pathFindingConfig PathFindingConfig

        missionControl MissionControlQuerier

        // minShardAmt is the amount beyond which we won't try to further split
        // the payment if no route is found. If the maximum number of htlcs
        // specified in the payment is one, under no circumstances splitting
        // will happen and this value remains unused.
        minShardAmt lnwire.MilliSatoshi

        // log is a payment session-specific logger.
        log btclog.Logger
}

// newPaymentSession instantiates a new payment session.
func newPaymentSession(p *LightningPayment, selfNode route.Vertex,
        getBandwidthHints func(Graph) (bandwidthHints, error),
        graphSessFactory GraphSessionFactory,
        missionControl MissionControlQuerier,
        pathFindingConfig PathFindingConfig) (*paymentSession, error) {

        edges, err := RouteHintsToEdges(p.RouteHints, p.Target)
        if err != nil {
                return nil, err
        }

        if p.BlindedPathSet != nil {
                if len(edges) != 0 {
                        return nil, fmt.Errorf("cannot have both route hints " +
                                "and blinded path")
                }

                edges, err = p.BlindedPathSet.ToRouteHints()
                if err != nil {
                        return nil, err
                }
        }

        logPrefix := fmt.Sprintf("PaymentSession(%x):", p.Identifier())

        return &paymentSession{
                selfNode:          selfNode,
                additionalEdges:   edges,
                getBandwidthHints: getBandwidthHints,
                payment:           p,
                pathFinder:        findPath,
                graphSessFactory:  graphSessFactory,
                pathFindingConfig: pathFindingConfig,
                missionControl:    missionControl,
                minShardAmt:       DefaultShardMinAmt,
                log:               log.WithPrefix(logPrefix),
        }, nil
}

// pathFindingError is a wrapper error type that is used to distinguish path
// finding errors from other errors in path finding loop.
type pathFindingError struct {
        error
}

// Unwrap returns the underlying error.
func (e *pathFindingError) Unwrap() error {
        return e.error
}

// RequestRoute returns a route which is likely to be capable for successfully
// routing the specified HTLC payment to the target node. Initially the first
// set of paths returned from this method may encounter routing failure along
// the way, however as more payments are sent, mission control will start to
// build an up to date view of the network itself. With each payment a new area
// will be explored, which feeds into the recommendations made for routing.
//
// NOTE: This function is safe for concurrent access.
// NOTE: Part of the PaymentSession interface.
func (p *paymentSession) RequestRoute(maxAmt, feeLimit lnwire.MilliSatoshi,
        activeShards, height uint32,
        firstHopCustomRecords lnwire.CustomRecords) (*route.Route, error) {

        if p.empty {
                return nil, errEmptyPaySession
        }

        // Add BlockPadding to the finalCltvDelta so that the receiving node
        // does not reject the HTLC if some blocks are mined while it's in-flight.
        finalCltvDelta := p.payment.FinalCLTVDelta
        finalCltvDelta += BlockPadding

        // We need to subtract the final delta before passing it into path
        // finding. The optimal path is independent of the final cltv delta and
        // the path finding algorithm is unaware of this value.
        cltvLimit := p.payment.CltvLimit - uint32(finalCltvDelta)

        // TODO(roasbeef): sync logic amongst dist sys

        // Taking into account this prune view, we'll attempt to locate a path
        // to our destination, respecting the recommendations from
        // MissionController.
        restrictions := &RestrictParams{
                ProbabilitySource:     p.missionControl.GetProbability,
                FeeLimit:              feeLimit,
                OutgoingChannelIDs:    p.payment.OutgoingChannelIDs,
                LastHop:               p.payment.LastHop,
                CltvLimit:             cltvLimit,
                DestCustomRecords:     p.payment.DestCustomRecords,
                DestFeatures:          p.payment.DestFeatures,
                PaymentAddr:           p.payment.PaymentAddr,
                Amp:                   p.payment.amp,
                Metadata:              p.payment.Metadata,
                FirstHopCustomRecords: firstHopCustomRecords,
        }

        finalHtlcExpiry := int32(height) + int32(finalCltvDelta)

        // Before we enter the loop below, we'll make sure to respect the max
        // payment shard size (if it's set), which is effectively our
        // client-side MTU that we'll attempt to respect at all times.
        maxShardActive := p.payment.MaxShardAmt != nil
        if maxShardActive && maxAmt > *p.payment.MaxShardAmt {
                p.log.Debugf("Clamping payment attempt from %v to %v due to "+
                        "max shard size of %v", maxAmt, *p.payment.MaxShardAmt,
                        maxAmt)

                maxAmt = *p.payment.MaxShardAmt
        }

        var path []*unifiedEdge
        findPath := func(graph graphdb.NodeTraverser) error {
                // We'll also obtain a set of bandwidthHints from the lower
                // layer for each of our outbound channels. This will allow the
                // path finding to skip any links that aren't active or just
                // don't have enough bandwidth to carry the payment. New
                // bandwidth hints are queried for every new path finding
                // attempt, because concurrent payments may change balances.
                bandwidthHints, err := p.getBandwidthHints(graph)
                if err != nil {
                        return err
                }

                p.log.Debugf("pathfinding for amt=%v", maxAmt)

                // Find a route for the current amount.
                path, _, err = p.pathFinder(
                        &graphParams{
                                additionalEdges: p.additionalEdges,
                                bandwidthHints:  bandwidthHints,
                                graph:           graph,
                        },
                        restrictions, &p.pathFindingConfig,
                        p.selfNode, p.selfNode, p.payment.Target,
                        maxAmt, p.payment.TimePref, finalHtlcExpiry,
                )
                if err != nil {
                        // Wrap the error to distinguish path finding errors
                        // from other errors in this closure.
                        return &pathFindingError{err}
                }

                return nil
        }

        for {
                err := p.graphSessFactory.GraphSession(findPath)
                // If there is an error, and it is not a path finding error, we
                // return it immediately.
                if err != nil && !lnutils.ErrorAs[*pathFindingError](err) {
                        return nil, err
                } else if err != nil {
                        // If the error is a path finding error, we'll unwrap it
                        // to check the underlying error.
                        //
                        //nolint:errorlint
                        pErr, _ := err.(*pathFindingError)
                        err = pErr.Unwrap()
                }

                // Otherwise, we'll switch on the path finding error.
                switch {
                case err == errNoPathFound:
                        // Don't split if this is a legacy payment without mpp
                        // record. If it has a blinded path though, then we
                        // can split. Split payments to blinded paths won't have
                        // MPP records.
                        if p.payment.PaymentAddr.IsNone() &&
                                p.payment.BlindedPathSet == nil {

                                p.log.Debugf("not splitting because payment " +
                                        "address is unspecified")

                                return nil, errNoPathFound
                        }

                        if p.payment.DestFeatures == nil {
                                p.log.Debug("Not splitting because " +
                                        "destination DestFeatures is nil")
                                return nil, errNoPathFound
                        }

                        destFeatures := p.payment.DestFeatures
                        if !destFeatures.HasFeature(lnwire.MPPOptional) &&
                                !destFeatures.HasFeature(lnwire.AMPOptional) {

                                p.log.Debug("not splitting because " +
                                        "destination doesn't declare MPP or " +
                                        "AMP")

                                return nil, errNoPathFound
                        }

                        // No splitting if this is the last shard.
                        isLastShard := activeShards+1 >= p.payment.MaxParts
                        if isLastShard {
                                p.log.Debugf("not splitting because shard "+
                                        "limit %v has been reached",
                                        p.payment.MaxParts)

                                return nil, errNoPathFound
                        }

                        // This is where the magic happens. If we can't find a
                        // route, try it for half the amount.
                        maxAmt /= 2

                        // Put a lower bound on the minimum shard size.
                        if maxAmt < p.minShardAmt {
                                p.log.Debugf("not splitting because minimum "+
                                        "shard amount %v has been reached",
                                        p.minShardAmt)

                                return nil, errNoPathFound
                        }

                        // Go pathfinding.
                        continue

                // If there isn't enough local bandwidth, there is no point in
                // splitting. It won't be possible to create a complete set in
                // any case, but the sent out partial payments would be held by
                // the receiver until the mpp timeout.
                case err == errInsufficientBalance:
                        p.log.Debug("not splitting because local balance " +
                                "is insufficient")

                        return nil, err

                case err != nil:
                        return nil, err
                }

                // With the next candidate path found, we'll attempt to turn
                // this into a route by applying the time-lock and fee
                // requirements.
                route, err := newRoute(
                        p.selfNode, path, height,
                        finalHopParams{
                                amt:         maxAmt,
                                totalAmt:    p.payment.Amount,
                                cltvDelta:   finalCltvDelta,
                                records:     p.payment.DestCustomRecords,
                                paymentAddr: p.payment.PaymentAddr,
                                metadata:    p.payment.Metadata,
                        }, p.payment.BlindedPathSet,
                )
                if err != nil {
                        return nil, err
                }

                return route, err
        }
}

// UpdateAdditionalEdge updates the channel edge policy for a private edge. It
// validates the message signature and checks it's up to date, then applies the
// updates to the supplied policy. It returns a boolean to indicate whether
// there's an error when applying the updates.
func (p *paymentSession) UpdateAdditionalEdge(msg *lnwire.ChannelUpdate1,
        pubKey *btcec.PublicKey, policy *models.CachedEdgePolicy) bool {

        // Validate the message signature.
        if err := netann.VerifyChannelUpdateSignature(msg, pubKey); err != nil {
                log.Errorf(
                        "Unable to validate channel update signature: %v", err,
                )
                return false
        }

        // Update channel policy for the additional edge.
        policy.TimeLockDelta = msg.TimeLockDelta
        policy.FeeBaseMSat = lnwire.MilliSatoshi(msg.BaseFee)
        policy.FeeProportionalMillionths = lnwire.MilliSatoshi(msg.FeeRate)

        log.Debugf("New private channel update applied: %v",
                lnutils.SpewLogClosure(msg))

        return true
}

// GetAdditionalEdgePolicy uses the public key and channel ID to query the
// ephemeral channel edge policy for additional edges. Returns a nil if nothing
// found.
func (p *paymentSession) GetAdditionalEdgePolicy(pubKey *btcec.PublicKey,
        channelID uint64) *models.CachedEdgePolicy {

        target := route.NewVertex(pubKey)

        edges, ok := p.additionalEdges[target]
        if !ok {
                return nil
        }

        for _, edge := range edges {
                policy := edge.EdgePolicy()
                if policy.ChannelID != channelID {
                        continue
                }

                return policy
        }

        return nil
}

1	package routing
2
3	import (
4	"fmt"
5
6	"github.com/btcsuite/btcd/btcec/v2"
7	"github.com/btcsuite/btclog/v2"
8	"github.com/lightningnetwork/lnd/channeldb"
9	graphdb "github.com/lightningnetwork/lnd/graph/db"
10	"github.com/lightningnetwork/lnd/graph/db/models"
11	"github.com/lightningnetwork/lnd/lnutils"
12	"github.com/lightningnetwork/lnd/lnwire"
13	"github.com/lightningnetwork/lnd/netann"
14	"github.com/lightningnetwork/lnd/routing/route"
15	)
16
17	// BlockPadding is used to increment the finalCltvDelta value for the last hop
18	// to prevent an HTLC being failed if some blocks are mined while it's in-flight.
19	const BlockPadding uint16 = 3
20
21	// ValidateCLTVLimit is a helper function that validates that the cltv limit is
22	// greater than the final cltv delta parameter, optionally including the
23	// BlockPadding in this calculation.
24	func ValidateCLTVLimit(limit uint32, delta uint16, includePad bool) error {	2✔
25	if includePad {	4✔
26	delta += BlockPadding	2✔
27	}	2✔
28
29	if limit <= uint32(delta) {	2✔
UNCOV 30	return fmt.Errorf("cltv limit %v should be greater than %v",	×
UNCOV 31	limit, delta)	×
UNCOV 32	}	×
33
34	return nil	2✔
35	}
36
37	// noRouteError encodes a non-critical error encountered during path finding.
38	type noRouteError uint8
39
40	const (
41	// errNoTlvPayload is returned when the destination hop does not support
42	// a tlv payload.
43	errNoTlvPayload noRouteError = iota
44
45	// errNoPaymentAddr is returned when the destination hop does not
46	// support payment addresses.
47	errNoPaymentAddr
48
49	// errNoPathFound is returned when a path to the target destination does
50	// not exist in the graph.
51	errNoPathFound
52
53	// errInsufficientLocalBalance is returned when none of the local
54	// channels have enough balance for the payment.
55	errInsufficientBalance
56
57	// errEmptyPaySession is returned when the empty payment session is
58	// queried for a route.
59	errEmptyPaySession
60
61	// errUnknownRequiredFeature is returned when the destination node
62	// requires an unknown feature.
63	errUnknownRequiredFeature
64
65	// errMissingDependentFeature is returned when the destination node
66	// misses a feature that a feature that we require depends on.
67	errMissingDependentFeature
68	)
69
70	var (
71	// DefaultShardMinAmt is the default amount beyond which we won't try to
72	// further split the payment if no route is found. It is the minimum
73	// amount that we use as the shard size when splitting.
74	DefaultShardMinAmt = lnwire.NewMSatFromSatoshis(10000)
75	)
76
77	// Error returns the string representation of the noRouteError.
78	func (e noRouteError) Error() string {	2✔
79	switch e {	2✔
80	case errNoTlvPayload:	×
81	return "destination hop doesn't understand new TLV payloads"	×
82
83	case errNoPaymentAddr:	×
84	return "destination hop doesn't understand payment addresses"	×
85
86	case errNoPathFound:	2✔
87	return "unable to find a path to destination"	2✔
88
89	case errEmptyPaySession:	2✔
90	return "empty payment session"	2✔
91
92	case errInsufficientBalance:	2✔
93	return "insufficient local balance"	2✔
94
95	case errUnknownRequiredFeature:	×
96	return "unknown required feature"	×
97
98	case errMissingDependentFeature:	×
99	return "missing dependent feature"	×
100
101	default:	×
102	return "unknown no-route error"	×
103	}
104	}
105
106	// FailureReason converts a path finding error into a payment-level failure.
107	func (e noRouteError) FailureReason() channeldb.FailureReason {	2✔
108	switch e {	2✔
109	case
110	errNoTlvPayload,
111	errNoPaymentAddr,
112	errNoPathFound,
113	errEmptyPaySession,
114	errUnknownRequiredFeature,
115	errMissingDependentFeature:	2✔
116		2✔
117	return channeldb.FailureReasonNoRoute	2✔
118
119	case errInsufficientBalance:	2✔
120	return channeldb.FailureReasonInsufficientBalance	2✔
121
122	default:	×
123	return channeldb.FailureReasonError	×
124	}
125	}
126
127	// PaymentSession is used during SendPayment attempts to provide routes to
128	// attempt. It also defines methods to give the PaymentSession additional
129	// information learned during the previous attempts.
130	type PaymentSession interface {
131	// RequestRoute returns the next route to attempt for routing the
132	// specified HTLC payment to the target node. The returned route should
133	// carry at most maxAmt to the target node, and pay at most feeLimit in
134	// fees. It can carry less if the payment is MPP. The activeShards
135	// argument should be set to instruct the payment session about the
136	// number of in flight HTLCS for the payment, such that it can choose
137	// splitting strategy accordingly.
138	//
139	// A noRouteError is returned if a non-critical error is encountered
140	// during path finding.
141	RequestRoute(maxAmt, feeLimit lnwire.MilliSatoshi,
142	activeShards, height uint32,
143	firstHopCustomRecords lnwire.CustomRecords) (*route.Route,
144	error)
145
146	// UpdateAdditionalEdge takes an additional channel edge policy
147	// (private channels) and applies the update from the message. Returns
148	// a boolean to indicate whether the update has been applied without
149	// error.
150	UpdateAdditionalEdge(msg *lnwire.ChannelUpdate1,
151	pubKey btcec.PublicKey, policy models.CachedEdgePolicy) bool
152
153	// GetAdditionalEdgePolicy uses the public key and channel ID to query
154	// the ephemeral channel edge policy for additional edges. Returns a nil
155	// if nothing found.
156	GetAdditionalEdgePolicy(pubKey *btcec.PublicKey,
157	channelID uint64) *models.CachedEdgePolicy
158	}
159
160	// paymentSession is used during an HTLC routings session to prune the local
161	// chain view in response to failures, and also report those failures back to
162	// MissionController. The snapshot copied for this session will only ever grow,
163	// and will now be pruned after a decay like the main view within mission
164	// control. We do this as we want to avoid the case where we continually try a
165	// bad edge or route multiple times in a session. This can lead to an infinite
166	// loop if payment attempts take long enough. An additional set of edges can
167	// also be provided to assist in reaching the payment's destination.
168	type paymentSession struct {
169	selfNode route.Vertex
170
171	additionalEdges map[route.Vertex][]AdditionalEdge
172
173	getBandwidthHints func(Graph) (bandwidthHints, error)
174
175	payment *LightningPayment
176
177	empty bool
178
179	pathFinder pathFinder
180
181	graphSessFactory GraphSessionFactory
182
183	// pathFindingConfig defines global parameters that control the
184	// trade-off in path finding between fees and probability.
185	pathFindingConfig PathFindingConfig
186
187	missionControl MissionControlQuerier
188
189	// minShardAmt is the amount beyond which we won't try to further split
190	// the payment if no route is found. If the maximum number of htlcs
191	// specified in the payment is one, under no circumstances splitting
192	// will happen and this value remains unused.
193	minShardAmt lnwire.MilliSatoshi
194
195	// log is a payment session-specific logger.
196	log btclog.Logger
197	}
198
199	// newPaymentSession instantiates a new payment session.
200	func newPaymentSession(p *LightningPayment, selfNode route.Vertex,
201	getBandwidthHints func(Graph) (bandwidthHints, error),
202	graphSessFactory GraphSessionFactory,
203	missionControl MissionControlQuerier,
204	pathFindingConfig PathFindingConfig) (*paymentSession, error) {	2✔
205		2✔
206	edges, err := RouteHintsToEdges(p.RouteHints, p.Target)	2✔
207	if err != nil {	2✔
208	return nil, err	×
209	}	×
210
211	if p.BlindedPathSet != nil {	4✔
212	if len(edges) != 0 {	2✔
213	return nil, fmt.Errorf("cannot have both route hints " +	×
214	"and blinded path")	×
215	}	×
216
217	edges, err = p.BlindedPathSet.ToRouteHints()	2✔
218	if err != nil {	2✔
219	return nil, err	×
220	}	×
221	}
222
223	logPrefix := fmt.Sprintf("PaymentSession(%x):", p.Identifier())	2✔
224		2✔
225	return &paymentSession{	2✔
226	selfNode: selfNode,	2✔
227	additionalEdges: edges,	2✔
228	getBandwidthHints: getBandwidthHints,	2✔
229	payment: p,	2✔
230	pathFinder: findPath,	2✔
231	graphSessFactory: graphSessFactory,	2✔
232	pathFindingConfig: pathFindingConfig,	2✔
233	missionControl: missionControl,	2✔
234	minShardAmt: DefaultShardMinAmt,	2✔
235	log: log.WithPrefix(logPrefix),	2✔
236	}, nil	2✔
237	}
238
239	// pathFindingError is a wrapper error type that is used to distinguish path
240	// finding errors from other errors in path finding loop.
241	type pathFindingError struct {
242	error
243	}
244
245	// Unwrap returns the underlying error.
246	func (e *pathFindingError) Unwrap() error {	2✔
247	return e.error	2✔
248	}	2✔
249
250	// RequestRoute returns a route which is likely to be capable for successfully
251	// routing the specified HTLC payment to the target node. Initially the first
252	// set of paths returned from this method may encounter routing failure along
253	// the way, however as more payments are sent, mission control will start to
254	// build an up to date view of the network itself. With each payment a new area
255	// will be explored, which feeds into the recommendations made for routing.
256	//
257	// NOTE: This function is safe for concurrent access.
258	// NOTE: Part of the PaymentSession interface.
259	func (p *paymentSession) RequestRoute(maxAmt, feeLimit lnwire.MilliSatoshi,
260	activeShards, height uint32,
261	firstHopCustomRecords lnwire.CustomRecords) (*route.Route, error) {	2✔
262		2✔
263	if p.empty {	4✔
264	return nil, errEmptyPaySession	2✔
265	}	2✔
266
267	// Add BlockPadding to the finalCltvDelta so that the receiving node
268	// does not reject the HTLC if some blocks are mined while it's in-flight.
269	finalCltvDelta := p.payment.FinalCLTVDelta	2✔
270	finalCltvDelta += BlockPadding	2✔
271		2✔
272	// We need to subtract the final delta before passing it into path	2✔
273	// finding. The optimal path is independent of the final cltv delta and	2✔
274	// the path finding algorithm is unaware of this value.	2✔
275	cltvLimit := p.payment.CltvLimit - uint32(finalCltvDelta)	2✔
276		2✔
277	// TODO(roasbeef): sync logic amongst dist sys	2✔
278		2✔
279	// Taking into account this prune view, we'll attempt to locate a path	2✔
280	// to our destination, respecting the recommendations from	2✔
281	// MissionController.	2✔
282	restrictions := &RestrictParams{	2✔
283	ProbabilitySource: p.missionControl.GetProbability,	2✔
284	FeeLimit: feeLimit,	2✔
285	OutgoingChannelIDs: p.payment.OutgoingChannelIDs,	2✔
286	LastHop: p.payment.LastHop,	2✔
287	CltvLimit: cltvLimit,	2✔
288	DestCustomRecords: p.payment.DestCustomRecords,	2✔
289	DestFeatures: p.payment.DestFeatures,	2✔
290	PaymentAddr: p.payment.PaymentAddr,	2✔
291	Amp: p.payment.amp,	2✔
292	Metadata: p.payment.Metadata,	2✔
293	FirstHopCustomRecords: firstHopCustomRecords,	2✔
294	}	2✔
295		2✔
296	finalHtlcExpiry := int32(height) + int32(finalCltvDelta)	2✔
297		2✔
298	// Before we enter the loop below, we'll make sure to respect the max	2✔
299	// payment shard size (if it's set), which is effectively our	2✔
300	// client-side MTU that we'll attempt to respect at all times.	2✔
301	maxShardActive := p.payment.MaxShardAmt != nil	2✔
302	if maxShardActive && maxAmt > *p.payment.MaxShardAmt {	2✔
UNCOV 303	p.log.Debugf("Clamping payment attempt from %v to %v due to "+	×
UNCOV 304	"max shard size of %v", maxAmt, *p.payment.MaxShardAmt,	×
UNCOV 305	maxAmt)	×
UNCOV 306		×
UNCOV 307	maxAmt = *p.payment.MaxShardAmt	×
UNCOV 308	}	×
309
310	var path []*unifiedEdge	2✔
311	findPath := func(graph graphdb.NodeTraverser) error {	4✔
312	// We'll also obtain a set of bandwidthHints from the lower	2✔
313	// layer for each of our outbound channels. This will allow the	2✔
314	// path finding to skip any links that aren't active or just	2✔
315	// don't have enough bandwidth to carry the payment. New	2✔
316	// bandwidth hints are queried for every new path finding	2✔
317	// attempt, because concurrent payments may change balances.	2✔
318	bandwidthHints, err := p.getBandwidthHints(graph)	2✔
319	if err != nil {	2✔
320	return err	×
321	}	×
322
323	p.log.Debugf("pathfinding for amt=%v", maxAmt)	2✔
324		2✔
325	// Find a route for the current amount.	2✔
326	path, _, err = p.pathFinder(	2✔
327	&graphParams{	2✔
328	additionalEdges: p.additionalEdges,	2✔
329	bandwidthHints: bandwidthHints,	2✔
330	graph: graph,	2✔
331	},	2✔
332	restrictions, &p.pathFindingConfig,	2✔
333	p.selfNode, p.selfNode, p.payment.Target,	2✔
334	maxAmt, p.payment.TimePref, finalHtlcExpiry,	2✔
335	)	2✔
336	if err != nil {	4✔
337	// Wrap the error to distinguish path finding errors	2✔
338	// from other errors in this closure.	2✔
339	return &pathFindingError{err}	2✔
340	}	2✔
341
342	return nil	2✔
343	}
344
345	for {	4✔
346	err := p.graphSessFactory.GraphSession(findPath)	2✔
347	// If there is an error, and it is not a path finding error, we	2✔
348	// return it immediately.	2✔
349	if err != nil && !lnutils.ErrorAs[*pathFindingError](err) {	2✔
350	return nil, err	×
351	} else if err != nil {	4✔
352	// If the error is a path finding error, we'll unwrap it	2✔
353	// to check the underlying error.	2✔
354	//	2✔
355	//nolint:errorlint	2✔
356	pErr, _ := err.(*pathFindingError)	2✔
357	err = pErr.Unwrap()	2✔
358	}	2✔
359
360	// Otherwise, we'll switch on the path finding error.
361	switch {	2✔
362	case err == errNoPathFound:	2✔
363	// Don't split if this is a legacy payment without mpp	2✔
364	// record. If it has a blinded path though, then we	2✔
365	// can split. Split payments to blinded paths won't have	2✔
366	// MPP records.	2✔
367	if p.payment.PaymentAddr.IsNone() &&	2✔
368	p.payment.BlindedPathSet == nil {	4✔
369		2✔
370	p.log.Debugf("not splitting because payment " +	2✔
371	"address is unspecified")	2✔
372		2✔
373	return nil, errNoPathFound	2✔
374	}	2✔
375
376	if p.payment.DestFeatures == nil {	2✔
377	p.log.Debug("Not splitting because " +	×
378	"destination DestFeatures is nil")	×
379	return nil, errNoPathFound	×
380	}	×
381
382	destFeatures := p.payment.DestFeatures	2✔
383	if !destFeatures.HasFeature(lnwire.MPPOptional) &&	2✔
384	!destFeatures.HasFeature(lnwire.AMPOptional) {	2✔
UNCOV 385		×
UNCOV 386	p.log.Debug("not splitting because " +	×
UNCOV 387	"destination doesn't declare MPP or " +	×
UNCOV 388	"AMP")	×
UNCOV 389		×
UNCOV 390	return nil, errNoPathFound	×
UNCOV 391	}	×
392
393	// No splitting if this is the last shard.
394	isLastShard := activeShards+1 >= p.payment.MaxParts	2✔
395	if isLastShard {	4✔
396	p.log.Debugf("not splitting because shard "+	2✔
397	"limit %v has been reached",	2✔
398	p.payment.MaxParts)	2✔
399		2✔
400	return nil, errNoPathFound	2✔
401	}	2✔
402
403	// This is where the magic happens. If we can't find a
404	// route, try it for half the amount.
405	maxAmt /= 2	2✔
406		2✔
407	// Put a lower bound on the minimum shard size.	2✔
408	if maxAmt < p.minShardAmt {	4✔
409	p.log.Debugf("not splitting because minimum "+	2✔
410	"shard amount %v has been reached",	2✔
411	p.minShardAmt)	2✔
412		2✔
413	return nil, errNoPathFound	2✔
414	}	2✔
415
416	// Go pathfinding.
417	continue	2✔
418
419	// If there isn't enough local bandwidth, there is no point in
420	// splitting. It won't be possible to create a complete set in
421	// any case, but the sent out partial payments would be held by
422	// the receiver until the mpp timeout.
423	case err == errInsufficientBalance:	2✔
424	p.log.Debug("not splitting because local balance " +	2✔
425	"is insufficient")	2✔
426		2✔
427	return nil, err	2✔
428
429	case err != nil:	×
430	return nil, err	×
431	}
432
433	// With the next candidate path found, we'll attempt to turn
434	// this into a route by applying the time-lock and fee
435	// requirements.
436	route, err := newRoute(	2✔
437	p.selfNode, path, height,	2✔
438	finalHopParams{	2✔
439	amt: maxAmt,	2✔
440	totalAmt: p.payment.Amount,	2✔
441	cltvDelta: finalCltvDelta,	2✔
442	records: p.payment.DestCustomRecords,	2✔
443	paymentAddr: p.payment.PaymentAddr,	2✔
444	metadata: p.payment.Metadata,	2✔
445	}, p.payment.BlindedPathSet,	2✔
446	)	2✔
447	if err != nil {	2✔
448	return nil, err	×
449	}	×
450
451	return route, err	2✔
452	}
453	}
454
455	// UpdateAdditionalEdge updates the channel edge policy for a private edge. It
456	// validates the message signature and checks it's up to date, then applies the
457	// updates to the supplied policy. It returns a boolean to indicate whether
458	// there's an error when applying the updates.
459	func (p paymentSession) UpdateAdditionalEdge(msg lnwire.ChannelUpdate1,
460	pubKey btcec.PublicKey, policy models.CachedEdgePolicy) bool {	2✔
461		2✔
462	// Validate the message signature.	2✔
463	if err := netann.VerifyChannelUpdateSignature(msg, pubKey); err != nil {	2✔
464	log.Errorf(	×
465	"Unable to validate channel update signature: %v", err,	×
466	)	×
467	return false	×
468	}	×
469
470	// Update channel policy for the additional edge.
471	policy.TimeLockDelta = msg.TimeLockDelta	2✔
472	policy.FeeBaseMSat = lnwire.MilliSatoshi(msg.BaseFee)	2✔
473	policy.FeeProportionalMillionths = lnwire.MilliSatoshi(msg.FeeRate)	2✔
474		2✔
475	log.Debugf("New private channel update applied: %v",	2✔
476	lnutils.SpewLogClosure(msg))	2✔
477		2✔
478	return true	2✔
479	}
480
481	// GetAdditionalEdgePolicy uses the public key and channel ID to query the
482	// ephemeral channel edge policy for additional edges. Returns a nil if nothing
483	// found.
484	func (p paymentSession) GetAdditionalEdgePolicy(pubKey btcec.PublicKey,
485	channelID uint64) *models.CachedEdgePolicy {	2✔
486		2✔
487	target := route.NewVertex(pubKey)	2✔
488		2✔
489	edges, ok := p.additionalEdges[target]	2✔
490	if !ok {	4✔
491	return nil	2✔
492	}	2✔
493
494	for _, edge := range edges {	4✔
495	policy := edge.EdgePolicy()	2✔
496	if policy.ChannelID != channelID {	2✔
497	continue	×
498	}
499
500	return policy	2✔
501	}
502
503	return nil	×
504	}

lightningnetwork / lnd / 14885280210

Source File Press 'n' to go to next uncovered line, 'b' for previous

Source File
Press 'n' to go to next uncovered line, 'b' for previous