20741423335

Committed 06 Jan 2026 07:31AM UTC coverage: 54.317% (-10.8%) from 65.158%

Build # 20741423335

Build Type

Pull #10296

github

Committed by

web-flow

Commit Message

Merge 52815a039 into 801de79cf

Pull Request Pull Request #10296: estimatefee: tx fee estimate for selected inputs

Run Details

18 of 25 new or added lines in 1 file covered. (72.0%)

31321 existing lines in 470 files now uncovered.

98104 of 180614 relevant lines covered (54.32%)

0.58 hits per line

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

86.03

/graph/db/graph_cache.go

package graphdb

import (
        "fmt"
        "sync"

        "github.com/btcsuite/btcd/btcutil"
        "github.com/lightningnetwork/lnd/graph/db/models"
        "github.com/lightningnetwork/lnd/lnwire"
        "github.com/lightningnetwork/lnd/routing/route"
)

// DirectedChannel is a type that stores the channel information as seen from
// one side of the channel.
type DirectedChannel struct {
        // ChannelID is the unique identifier of this channel.
        ChannelID uint64

        // IsNode1 indicates if this is the node with the smaller public key.
        IsNode1 bool

        // OtherNode is the public key of the node on the other end of this
        // channel.
        OtherNode route.Vertex

        // Capacity is the announced capacity of this channel in satoshis.
        Capacity btcutil.Amount

        // OutPolicySet is a boolean that indicates whether the node has an
        // outgoing policy set. For pathfinding only the existence of the policy
        // is important to know, not the actual content.
        OutPolicySet bool

        // InPolicy is the incoming policy *from* the other node to this node.
        // In path finding, we're walking backward from the destination to the
        // source, so we're always interested in the edge that arrives to us
        // from the other node.
        InPolicy *models.CachedEdgePolicy

        // Inbound fees of this node.
        InboundFee lnwire.Fee
}

// DeepCopy creates a deep copy of the channel, including the incoming policy.
func (c *DirectedChannel) DeepCopy() *DirectedChannel {
        channelCopy := *c

        if channelCopy.InPolicy != nil {
                inPolicyCopy := *channelCopy.InPolicy
                channelCopy.InPolicy = &inPolicyCopy

                // The fields for the ToNode can be overwritten by the path
                // finding algorithm, which is why we need a deep copy in the
                // first place. So we always start out with nil values, just to
                // be sure they don't contain any old data.
                channelCopy.InPolicy.ToNodePubKey = nil
                channelCopy.InPolicy.ToNodeFeatures = nil
        }

        return &channelCopy
}

// GraphCache is a type that holds a minimal set of information of the public
// channel graph that can be used for pathfinding.
type GraphCache struct {
        nodeChannels map[route.Vertex]map[uint64]*DirectedChannel
        nodeFeatures map[route.Vertex]*lnwire.FeatureVector

        mtx sync.RWMutex
}

// NewGraphCache creates a new graphCache.
func NewGraphCache(preAllocNumNodes int) *GraphCache {
        return &GraphCache{
                nodeChannels: make(
                        map[route.Vertex]map[uint64]*DirectedChannel,
                        // A channel connects two nodes, so we can look it up
                        // from both sides, meaning we get double the number of
                        // entries.
                        preAllocNumNodes*2,
                ),
                nodeFeatures: make(
                        map[route.Vertex]*lnwire.FeatureVector,
                        preAllocNumNodes,
                ),
        }
}

// Stats returns statistics about the current cache size.
func (c *GraphCache) Stats() string {
        c.mtx.RLock()
        defer c.mtx.RUnlock()

        numChannels := 0
        for node := range c.nodeChannels {
                numChannels += len(c.nodeChannels[node])
        }
        return fmt.Sprintf("num_node_features=%d, num_nodes=%d, "+
                "num_channels=%d", len(c.nodeFeatures), len(c.nodeChannels),
                numChannels)
}

// AddNodeFeatures adds a graph node and its features to the cache.
func (c *GraphCache) AddNodeFeatures(node route.Vertex,
        features *lnwire.FeatureVector) {

        c.mtx.Lock()
        defer c.mtx.Unlock()

        c.nodeFeatures[node] = features
}

// AddChannel adds a non-directed channel, meaning that the order of policy 1
// and policy 2 does not matter, the directionality is extracted from the info
// and policy flags automatically. The policy will be set as the outgoing policy
// on one node and the incoming policy on the peer's side.
func (c *GraphCache) AddChannel(info *models.CachedEdgeInfo,
        policy1, policy2 *models.CachedEdgePolicy) {

        if info == nil {
                return
        }

        // Create the edge entry for both nodes. We always add the channel
        // structure to the cache, even if both policies are currently disabled,
        // so that later policy updates can find and update the channel entry.
        c.mtx.Lock()
        c.updateOrAddEdge(info.NodeKey1Bytes, &DirectedChannel{
                ChannelID: info.ChannelID,
                IsNode1:   true,
                OtherNode: info.NodeKey2Bytes,
                Capacity:  info.Capacity,
        })
        c.updateOrAddEdge(info.NodeKey2Bytes, &DirectedChannel{
                ChannelID: info.ChannelID,
                IsNode1:   false,
                OtherNode: info.NodeKey1Bytes,
                Capacity:  info.Capacity,
        })
        c.mtx.Unlock()

        // Skip adding policies if both are disabled, as the channel is
        // currently unusable for routing. However, we still add the channel
        // structure above so that policy updates can later enable it.
        if policy1 != nil && policy1.IsDisabled() &&
                policy2 != nil && policy2.IsDisabled() {

                log.Debugf("Skipping policies for channel %v: both "+
                        "policies are disabled (channel structure still "+
                        "cached for future updates)", info.ChannelID)

                return
        }

        // The policy's node is always the to_node. So if policy 1 has to_node
        // of node 2 then we have the policy 1 as seen from node 1.
        if policy1 != nil {
                fromNode, toNode := info.NodeKey1Bytes, info.NodeKey2Bytes
                if !policy1.IsNode1() {
                        fromNode, toNode = toNode, fromNode
                }
                c.UpdatePolicy(policy1, fromNode, toNode)
        }
        if policy2 != nil {
                fromNode, toNode := info.NodeKey2Bytes, info.NodeKey1Bytes
                if policy2.IsNode1() {
                        fromNode, toNode = toNode, fromNode
                }
                c.UpdatePolicy(policy2, fromNode, toNode)
        }
}

// updateOrAddEdge makes sure the edge information for a node is either updated
// if it already exists or is added to that node's list of channels.
func (c *GraphCache) updateOrAddEdge(node route.Vertex, edge *DirectedChannel) {
        if len(c.nodeChannels[node]) == 0 {
                c.nodeChannels[node] = make(map[uint64]*DirectedChannel)
        }

        c.nodeChannels[node][edge.ChannelID] = edge
}

// UpdatePolicy updates a single policy on both the from and to node. The order
// of the from and to node is not strictly important. But we assume that a
// channel edge was added beforehand so that the directed channel struct already
// exists in the cache.
func (c *GraphCache) UpdatePolicy(policy *models.CachedEdgePolicy, fromNode,
        toNode route.Vertex) {

        c.mtx.Lock()
        defer c.mtx.Unlock()

        updatePolicy := func(nodeKey route.Vertex) {
                if len(c.nodeChannels[nodeKey]) == 0 {
                        log.Warnf("Node=%v not found in graph cache", nodeKey)

                        return
                }

                channel, ok := c.nodeChannels[nodeKey][policy.ChannelID]
                if !ok {
                        log.Warnf("Channel=%v not found in graph cache",
                                policy.ChannelID)

                        return
                }

                // Edge 1 is defined as the policy for the direction of node1 to
                // node2.
                switch {
                // This is node 1, and it is edge 1, so this is the outgoing
                // policy for node 1.
                case channel.IsNode1 && policy.IsNode1():
                        channel.OutPolicySet = true
                        policy.InboundFee.WhenSome(func(fee lnwire.Fee) {
                                channel.InboundFee = fee
                        })

                // This is node 2, and it is edge 2, so this is the outgoing
                // policy for node 2.
                case !channel.IsNode1 && !policy.IsNode1():
                        channel.OutPolicySet = true
                        policy.InboundFee.WhenSome(func(fee lnwire.Fee) {
                                channel.InboundFee = fee
                        })

                // The other two cases left mean it's the inbound policy for the
                // node.
                default:
                        channel.InPolicy = policy
                }
        }

        updatePolicy(fromNode)
        updatePolicy(toNode)
}

// RemoveNode completely removes a node and all its channels (including the
// peer's side).
func (c *GraphCache) RemoveNode(node route.Vertex) {
        c.mtx.Lock()
        defer c.mtx.Unlock()

        delete(c.nodeFeatures, node)

        // First remove all channels from the other nodes' lists.
        for _, channel := range c.nodeChannels[node] {
                c.removeChannelIfFound(channel.OtherNode, channel.ChannelID)
        }

        // Then remove our whole node completely.
        delete(c.nodeChannels, node)
}

// RemoveChannel removes a single channel between two nodes.
func (c *GraphCache) RemoveChannel(node1, node2 route.Vertex, chanID uint64) {
        c.mtx.Lock()
        defer c.mtx.Unlock()

        // Remove that one channel from both sides.
        c.removeChannelIfFound(node1, chanID)
        c.removeChannelIfFound(node2, chanID)
}

// removeChannelIfFound removes a single channel from one side.
func (c *GraphCache) removeChannelIfFound(node route.Vertex, chanID uint64) {
        if len(c.nodeChannels[node]) == 0 {
                return
        }

        delete(c.nodeChannels[node], chanID)
}

// getChannels returns a copy of the passed node's channels or nil if there
// isn't any.
func (c *GraphCache) getChannels(node route.Vertex) []*DirectedChannel {
        c.mtx.RLock()
        defer c.mtx.RUnlock()

        channels, ok := c.nodeChannels[node]
        if !ok {
                return nil
        }

        features, ok := c.nodeFeatures[node]
        if !ok {
                // If the features were set to nil explicitly, that's fine here.
                // The router will overwrite the features of the destination
                // node with those found in the invoice if necessary. But if we
                // didn't yet get a node announcement we want to mimic the
                // behavior of the old DB based code that would always set an
                // empty feature vector instead of leaving it nil.
                features = lnwire.EmptyFeatureVector()
        }

        toNodeCallback := func() route.Vertex {
                return node
        }

        i := 0
        channelsCopy := make([]*DirectedChannel, len(channels))
        for _, channel := range channels {
                // We need to copy the channel and policy to avoid it being
                // updated in the cache if the path finding algorithm sets
                // fields on it (currently only the ToNodeFeatures of the
                // policy).
                channelCopy := channel.DeepCopy()
                if channelCopy.InPolicy != nil {
                        channelCopy.InPolicy.ToNodePubKey = toNodeCallback
                        channelCopy.InPolicy.ToNodeFeatures = features
                }

                channelsCopy[i] = channelCopy
                i++
        }

        return channelsCopy
}

// ForEachChannel invokes the given callback for each channel of the given node.
func (c *GraphCache) ForEachChannel(node route.Vertex,
        cb func(channel *DirectedChannel) error) error {

        // Obtain a copy of the node's channels. We need do this in order to
        // avoid deadlocks caused by interaction with the graph cache, channel
        // state and the graph database from multiple goroutines. This snapshot
        // is only used for path finding where being stale is acceptable since
        // the real world graph and our representation may always become
        // slightly out of sync for a short time and the actual channel state
        // is stored separately.
        channels := c.getChannels(node)
        for _, channel := range channels {
                if err := cb(channel); err != nil {
                        return err
                }
        }

        return nil
}

// ForEachNode iterates over the adjacency list of the graph, executing the
// call back for each node and the set of channels that emanate from the given
// node.
//
// NOTE: This method should be considered _read only_, the channels or nodes
// passed in MUST NOT be modified.
func (c *GraphCache) ForEachNode(cb func(node route.Vertex,
        channels map[uint64]*DirectedChannel) error) error {

        c.mtx.RLock()
        defer c.mtx.RUnlock()

        for node, channels := range c.nodeChannels {
                // We don't make a copy here since this is a read-only RPC
                // call. We also don't need the node features either for this
                // call.
                if err := cb(node, channels); err != nil {
                        return err
                }
        }

        return nil
}

// GetFeatures returns the features of the node with the given ID. If no
// features are known for the node, an empty feature vector is returned.
func (c *GraphCache) GetFeatures(node route.Vertex) *lnwire.FeatureVector {
        c.mtx.RLock()
        defer c.mtx.RUnlock()

        features, ok := c.nodeFeatures[node]
        if !ok || features == nil {
                // The router expects the features to never be nil, so we return
                // an empty feature set instead.
                return lnwire.EmptyFeatureVector()
        }

        return features
}

1	package graphdb
2
3	import (
4	"fmt"
5	"sync"
6
7	"github.com/btcsuite/btcd/btcutil"
8	"github.com/lightningnetwork/lnd/graph/db/models"
9	"github.com/lightningnetwork/lnd/lnwire"
10	"github.com/lightningnetwork/lnd/routing/route"
11	)
12
13	// DirectedChannel is a type that stores the channel information as seen from
14	// one side of the channel.
15	type DirectedChannel struct {
16	// ChannelID is the unique identifier of this channel.
17	ChannelID uint64
18
19	// IsNode1 indicates if this is the node with the smaller public key.
20	IsNode1 bool
21
22	// OtherNode is the public key of the node on the other end of this
23	// channel.
24	OtherNode route.Vertex
25
26	// Capacity is the announced capacity of this channel in satoshis.
27	Capacity btcutil.Amount
28
29	// OutPolicySet is a boolean that indicates whether the node has an
30	// outgoing policy set. For pathfinding only the existence of the policy
31	// is important to know, not the actual content.
32	OutPolicySet bool
33
34	// InPolicy is the incoming policy from the other node to this node.
35	// In path finding, we're walking backward from the destination to the
36	// source, so we're always interested in the edge that arrives to us
37	// from the other node.
38	InPolicy *models.CachedEdgePolicy
39
40	// Inbound fees of this node.
41	InboundFee lnwire.Fee
42	}
43
44	// DeepCopy creates a deep copy of the channel, including the incoming policy.
45	func (c DirectedChannel) DeepCopy() DirectedChannel {	1✔
46	channelCopy := *c	1✔
47		1✔
48	if channelCopy.InPolicy != nil {	2✔
49	inPolicyCopy := *channelCopy.InPolicy	1✔
50	channelCopy.InPolicy = &inPolicyCopy	1✔
51		1✔
52	// The fields for the ToNode can be overwritten by the path	1✔
53	// finding algorithm, which is why we need a deep copy in the	1✔
54	// first place. So we always start out with nil values, just to	1✔
55	// be sure they don't contain any old data.	1✔
56	channelCopy.InPolicy.ToNodePubKey = nil	1✔
57	channelCopy.InPolicy.ToNodeFeatures = nil	1✔
58	}	1✔
59
60	return &channelCopy	1✔
61	}
62
63	// GraphCache is a type that holds a minimal set of information of the public
64	// channel graph that can be used for pathfinding.
65	type GraphCache struct {
66	nodeChannels map[route.Vertex]map[uint64]*DirectedChannel
67	nodeFeatures map[route.Vertex]*lnwire.FeatureVector
68
69	mtx sync.RWMutex
70	}
71
72	// NewGraphCache creates a new graphCache.
73	func NewGraphCache(preAllocNumNodes int) *GraphCache {	1✔
74	return &GraphCache{	1✔
75	nodeChannels: make(	1✔
76	map[route.Vertex]map[uint64]*DirectedChannel,	1✔
77	// A channel connects two nodes, so we can look it up	1✔
78	// from both sides, meaning we get double the number of	1✔
79	// entries.	1✔
80	preAllocNumNodes*2,	1✔
81	),	1✔
82	nodeFeatures: make(	1✔
83	map[route.Vertex]*lnwire.FeatureVector,	1✔
84	preAllocNumNodes,	1✔
85	),	1✔
86	}	1✔
87	}	1✔
88
89	// Stats returns statistics about the current cache size.
90	func (c *GraphCache) Stats() string {	1✔
91	c.mtx.RLock()	1✔
92	defer c.mtx.RUnlock()	1✔
93		1✔
94	numChannels := 0	1✔
95	for node := range c.nodeChannels {	2✔
96	numChannels += len(c.nodeChannels[node])	1✔
97	}	1✔
98	return fmt.Sprintf("num_node_features=%d, num_nodes=%d, "+	1✔
99	"num_channels=%d", len(c.nodeFeatures), len(c.nodeChannels),	1✔
100	numChannels)	1✔
101	}
102
103	// AddNodeFeatures adds a graph node and its features to the cache.
104	func (c *GraphCache) AddNodeFeatures(node route.Vertex,
105	features *lnwire.FeatureVector) {	1✔
106		1✔
107	c.mtx.Lock()	1✔
108	defer c.mtx.Unlock()	1✔
109		1✔
110	c.nodeFeatures[node] = features	1✔
111	}	1✔
112
113	// AddChannel adds a non-directed channel, meaning that the order of policy 1
114	// and policy 2 does not matter, the directionality is extracted from the info
115	// and policy flags automatically. The policy will be set as the outgoing policy
116	// on one node and the incoming policy on the peer's side.
117	func (c GraphCache) AddChannel(info models.CachedEdgeInfo,
118	policy1, policy2 *models.CachedEdgePolicy) {	1✔
119		1✔
120	if info == nil {	1✔
121	return	×
122	}	×
123
124	// Create the edge entry for both nodes. We always add the channel
125	// structure to the cache, even if both policies are currently disabled,
126	// so that later policy updates can find and update the channel entry.
127	c.mtx.Lock()	1✔
128	c.updateOrAddEdge(info.NodeKey1Bytes, &DirectedChannel{	1✔
129	ChannelID: info.ChannelID,	1✔
130	IsNode1: true,	1✔
131	OtherNode: info.NodeKey2Bytes,	1✔
132	Capacity: info.Capacity,	1✔
133	})	1✔
134	c.updateOrAddEdge(info.NodeKey2Bytes, &DirectedChannel{	1✔
135	ChannelID: info.ChannelID,	1✔
136	IsNode1: false,	1✔
137	OtherNode: info.NodeKey1Bytes,	1✔
138	Capacity: info.Capacity,	1✔
139	})	1✔
140	c.mtx.Unlock()	1✔
141		1✔
142	// Skip adding policies if both are disabled, as the channel is	1✔
143	// currently unusable for routing. However, we still add the channel	1✔
144	// structure above so that policy updates can later enable it.	1✔
145	if policy1 != nil && policy1.IsDisabled() &&	1✔
146	policy2 != nil && policy2.IsDisabled() {	2✔
147		1✔
148	log.Debugf("Skipping policies for channel %v: both "+	1✔
149	"policies are disabled (channel structure still "+	1✔
150	"cached for future updates)", info.ChannelID)	1✔
151		1✔
152	return	1✔
153	}	1✔
154
155	// The policy's node is always the to_node. So if policy 1 has to_node
156	// of node 2 then we have the policy 1 as seen from node 1.
157	if policy1 != nil {	2✔
158	fromNode, toNode := info.NodeKey1Bytes, info.NodeKey2Bytes	1✔
159	if !policy1.IsNode1() {	1✔
UNCOV 160	fromNode, toNode = toNode, fromNode	×
UNCOV 161	}	×
162	c.UpdatePolicy(policy1, fromNode, toNode)	1✔
163	}
164	if policy2 != nil {	2✔
165	fromNode, toNode := info.NodeKey2Bytes, info.NodeKey1Bytes	1✔
166	if policy2.IsNode1() {	1✔
UNCOV 167	fromNode, toNode = toNode, fromNode	×
UNCOV 168	}	×
169	c.UpdatePolicy(policy2, fromNode, toNode)	1✔
170	}
171	}
172
173	// updateOrAddEdge makes sure the edge information for a node is either updated
174	// if it already exists or is added to that node's list of channels.
175	func (c GraphCache) updateOrAddEdge(node route.Vertex, edge DirectedChannel) {	1✔
176	if len(c.nodeChannels[node]) == 0 {	2✔
177	c.nodeChannels[node] = make(map[uint64]*DirectedChannel)	1✔
178	}	1✔
179
180	c.nodeChannels[node][edge.ChannelID] = edge	1✔
181	}
182
183	// UpdatePolicy updates a single policy on both the from and to node. The order
184	// of the from and to node is not strictly important. But we assume that a
185	// channel edge was added beforehand so that the directed channel struct already
186	// exists in the cache.
187	func (c GraphCache) UpdatePolicy(policy models.CachedEdgePolicy, fromNode,
188	toNode route.Vertex) {	1✔
189		1✔
190	c.mtx.Lock()	1✔
191	defer c.mtx.Unlock()	1✔
192		1✔
193	updatePolicy := func(nodeKey route.Vertex) {	2✔
194	if len(c.nodeChannels[nodeKey]) == 0 {	1✔
195	log.Warnf("Node=%v not found in graph cache", nodeKey)	×
196		×
197	return	×
198	}	×
199
200	channel, ok := c.nodeChannels[nodeKey][policy.ChannelID]	1✔
201	if !ok {	1✔
202	log.Warnf("Channel=%v not found in graph cache",	×
203	policy.ChannelID)	×
204		×
205	return	×
206	}	×
207
208	// Edge 1 is defined as the policy for the direction of node1 to
209	// node2.
210	switch {	1✔
211	// This is node 1, and it is edge 1, so this is the outgoing
212	// policy for node 1.
213	case channel.IsNode1 && policy.IsNode1():	1✔
214	channel.OutPolicySet = true	1✔
215	policy.InboundFee.WhenSome(func(fee lnwire.Fee) {	2✔
216	channel.InboundFee = fee	1✔
217	})	1✔
218
219	// This is node 2, and it is edge 2, so this is the outgoing
220	// policy for node 2.
221	case !channel.IsNode1 && !policy.IsNode1():	1✔
222	channel.OutPolicySet = true	1✔
223	policy.InboundFee.WhenSome(func(fee lnwire.Fee) {	2✔
224	channel.InboundFee = fee	1✔
225	})	1✔
226
227	// The other two cases left mean it's the inbound policy for the
228	// node.
229	default:	1✔
230	channel.InPolicy = policy	1✔
231	}
232	}
233
234	updatePolicy(fromNode)	1✔
235	updatePolicy(toNode)	1✔
236	}
237
238	// RemoveNode completely removes a node and all its channels (including the
239	// peer's side).
240	func (c *GraphCache) RemoveNode(node route.Vertex) {	1✔
241	c.mtx.Lock()	1✔
242	defer c.mtx.Unlock()	1✔
243		1✔
244	delete(c.nodeFeatures, node)	1✔
245		1✔
246	// First remove all channels from the other nodes' lists.	1✔
247	for _, channel := range c.nodeChannels[node] {	1✔
UNCOV 248	c.removeChannelIfFound(channel.OtherNode, channel.ChannelID)	×
UNCOV 249	}	×
250
251	// Then remove our whole node completely.
252	delete(c.nodeChannels, node)	1✔
253	}
254
255	// RemoveChannel removes a single channel between two nodes.
256	func (c *GraphCache) RemoveChannel(node1, node2 route.Vertex, chanID uint64) {	1✔
257	c.mtx.Lock()	1✔
258	defer c.mtx.Unlock()	1✔
259		1✔
260	// Remove that one channel from both sides.	1✔
261	c.removeChannelIfFound(node1, chanID)	1✔
262	c.removeChannelIfFound(node2, chanID)	1✔
263	}	1✔
264
265	// removeChannelIfFound removes a single channel from one side.
266	func (c *GraphCache) removeChannelIfFound(node route.Vertex, chanID uint64) {	1✔
267	if len(c.nodeChannels[node]) == 0 {	1✔
UNCOV 268	return	×
UNCOV 269	}	×
270
271	delete(c.nodeChannels[node], chanID)	1✔
272	}
273
274	// getChannels returns a copy of the passed node's channels or nil if there
275	// isn't any.
276	func (c GraphCache) getChannels(node route.Vertex) []DirectedChannel {	1✔
277	c.mtx.RLock()	1✔
278	defer c.mtx.RUnlock()	1✔
279		1✔
280	channels, ok := c.nodeChannels[node]	1✔
281	if !ok {	2✔
282	return nil	1✔
283	}	1✔
284
285	features, ok := c.nodeFeatures[node]	1✔
286	if !ok {	2✔
287	// If the features were set to nil explicitly, that's fine here.	1✔
288	// The router will overwrite the features of the destination	1✔
289	// node with those found in the invoice if necessary. But if we	1✔
290	// didn't yet get a node announcement we want to mimic the	1✔
291	// behavior of the old DB based code that would always set an	1✔
292	// empty feature vector instead of leaving it nil.	1✔
293	features = lnwire.EmptyFeatureVector()	1✔
294	}	1✔
295
296	toNodeCallback := func() route.Vertex {	2✔
297	return node	1✔
298	}	1✔
299
300	i := 0	1✔
301	channelsCopy := make([]*DirectedChannel, len(channels))	1✔
302	for _, channel := range channels {	2✔
303	// We need to copy the channel and policy to avoid it being	1✔
304	// updated in the cache if the path finding algorithm sets	1✔
305	// fields on it (currently only the ToNodeFeatures of the	1✔
306	// policy).	1✔
307	channelCopy := channel.DeepCopy()	1✔
308	if channelCopy.InPolicy != nil {	2✔
309	channelCopy.InPolicy.ToNodePubKey = toNodeCallback	1✔
310	channelCopy.InPolicy.ToNodeFeatures = features	1✔
311	}	1✔
312
313	channelsCopy[i] = channelCopy	1✔
314	i++	1✔
315	}
316
317	return channelsCopy	1✔
318	}
319
320	// ForEachChannel invokes the given callback for each channel of the given node.
321	func (c *GraphCache) ForEachChannel(node route.Vertex,
322	cb func(channel *DirectedChannel) error) error {	1✔
323		1✔
324	// Obtain a copy of the node's channels. We need do this in order to	1✔
325	// avoid deadlocks caused by interaction with the graph cache, channel	1✔
326	// state and the graph database from multiple goroutines. This snapshot	1✔
327	// is only used for path finding where being stale is acceptable since	1✔
328	// the real world graph and our representation may always become	1✔
329	// slightly out of sync for a short time and the actual channel state	1✔
330	// is stored separately.	1✔
331	channels := c.getChannels(node)	1✔
332	for _, channel := range channels {	2✔
333	if err := cb(channel); err != nil {	2✔
334	return err	1✔
335	}	1✔
336	}
337
338	return nil	1✔
339	}
340
341	// ForEachNode iterates over the adjacency list of the graph, executing the
342	// call back for each node and the set of channels that emanate from the given
343	// node.
344	//
345	// NOTE: This method should be considered _read only_, the channels or nodes
346	// passed in MUST NOT be modified.
347	func (c *GraphCache) ForEachNode(cb func(node route.Vertex,
UNCOV 348	channels map[uint64]*DirectedChannel) error) error {	×
UNCOV 349		×
UNCOV 350	c.mtx.RLock()	×
UNCOV 351	defer c.mtx.RUnlock()	×
UNCOV 352		×
UNCOV 353	for node, channels := range c.nodeChannels {	×
UNCOV 354	// We don't make a copy here since this is a read-only RPC	×
UNCOV 355	// call. We also don't need the node features either for this	×
UNCOV 356	// call.	×
UNCOV 357	if err := cb(node, channels); err != nil {	×
358	return err	×
359	}	×
360	}
361
UNCOV 362	return nil	×
363	}
364
365	// GetFeatures returns the features of the node with the given ID. If no
366	// features are known for the node, an empty feature vector is returned.
367	func (c GraphCache) GetFeatures(node route.Vertex) lnwire.FeatureVector {	1✔
368	c.mtx.RLock()	1✔
369	defer c.mtx.RUnlock()	1✔
370		1✔
371	features, ok := c.nodeFeatures[node]	1✔
372	if !ok \|\| features == nil {	2✔
373	// The router expects the features to never be nil, so we return	1✔
374	// an empty feature set instead.	1✔
375	return lnwire.EmptyFeatureVector()	1✔
376	}	1✔
377
378	return features	1✔
379	}

lightningnetwork / lnd / 20741423335

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