13481548301

Committed 23 Feb 2025 09:06AM UTC coverage: 4.031% (-54.8%) from 58.825%

Build # 13481548301

Build Type

Pull #9521

github

Committed by

web-flow

Commit Message

Merge 1ffbe99fe into 5fe900d18

Pull Request Pull Request #9521: unit: remove GOACC, use Go 1.20 native coverage functionality

Run Details

2852 of 70750 relevant lines covered (4.03%)

0.92 hits per line

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

0.0

/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.ChannelEdgeInfo,
        policy1 *models.ChannelEdgePolicy, policy2 *models.ChannelEdgePolicy) {

        if info == nil {
                return
        }

        if policy1 != nil && policy1.IsDisabled() &&
                policy2 != nil && policy2.IsDisabled() {

                return
        }

        // Create the edge entry for both nodes.
        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()

        // 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.ToNode != info.NodeKey2Bytes {
                        fromNode, toNode = toNode, fromNode
                }
                isEdge1 := policy1.ChannelFlags&lnwire.ChanUpdateDirection == 0
                c.UpdatePolicy(policy1, fromNode, toNode, isEdge1)
        }
        if policy2 != nil {
                fromNode, toNode := info.NodeKey2Bytes, info.NodeKey1Bytes
                if policy2.ToNode != info.NodeKey1Bytes {
                        fromNode, toNode = toNode, fromNode
                }
                isEdge1 := policy2.ChannelFlags&lnwire.ChanUpdateDirection == 0
                c.UpdatePolicy(policy2, fromNode, toNode, isEdge1)
        }
}

// 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.ChannelEdgePolicy, fromNode,
        toNode route.Vertex, edge1 bool) {

        // Extract inbound fee if possible and available. If there is a decoding
        // error, ignore this policy.
        var inboundFee lnwire.Fee
        _, err := policy.ExtraOpaqueData.ExtractRecords(&inboundFee)
        if err != nil {
                log.Errorf("Failed to extract records from edge policy %v: %v",
                        policy.ChannelID, err)

                return
        }

        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 && edge1:
                        channel.OutPolicySet = true
                        channel.InboundFee = inboundFee

                // This is node 2, and it is edge 2, so this is the outgoing
                // policy for node 2.
                case !channel.IsNode1 && !edge1:
                        channel.OutPolicySet = true
                        channel.InboundFee = inboundFee

                // The other two cases left mean it's the inbound policy for the
                // node.
                default:
                        channel.InPolicy = models.NewCachedPolicy(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)
}

// UpdateChannel updates the channel edge information for a specific edge. We
// expect the edge to already exist and be known. If it does not yet exist, this
// call is a no-op.
func (c *GraphCache) UpdateChannel(info *models.ChannelEdgeInfo) {
        c.mtx.Lock()
        defer c.mtx.Unlock()

        if len(c.nodeChannels[info.NodeKey1Bytes]) == 0 ||
                len(c.nodeChannels[info.NodeKey2Bytes]) == 0 {

                return
        }

        channel, ok := c.nodeChannels[info.NodeKey1Bytes][info.ChannelID]
        if ok {
                // We only expect to be called when the channel is already
                // known.
                channel.Capacity = info.Capacity
                channel.OtherNode = info.NodeKey2Bytes
        }

        channel, ok = c.nodeChannels[info.NodeKey2Bytes][info.ChannelID]
        if ok {
                channel.Capacity = info.Capacity
                channel.OtherNode = info.NodeKey1Bytes
        }
}

// 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 {	×
46	channelCopy := *c	×
47		×
48	if channelCopy.InPolicy != nil {	×
49	inPolicyCopy := *channelCopy.InPolicy	×
50	channelCopy.InPolicy = &inPolicyCopy	×
51		×
52	// The fields for the ToNode can be overwritten by the path	×
53	// finding algorithm, which is why we need a deep copy in the	×
54	// first place. So we always start out with nil values, just to	×
55	// be sure they don't contain any old data.	×
56	channelCopy.InPolicy.ToNodePubKey = nil	×
57	channelCopy.InPolicy.ToNodeFeatures = nil	×
58	}	×
59
60	return &channelCopy	×
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 {	×
74	return &GraphCache{	×
75	nodeChannels: make(	×
76	map[route.Vertex]map[uint64]*DirectedChannel,	×
77	// A channel connects two nodes, so we can look it up	×
78	// from both sides, meaning we get double the number of	×
79	// entries.	×
80	preAllocNumNodes*2,	×
81	),	×
82	nodeFeatures: make(	×
83	map[route.Vertex]*lnwire.FeatureVector,	×
84	preAllocNumNodes,	×
85	),	×
86	}	×
87	}	×
88
89	// Stats returns statistics about the current cache size.
90	func (c *GraphCache) Stats() string {	×
91	c.mtx.RLock()	×
92	defer c.mtx.RUnlock()	×
93		×
94	numChannels := 0	×
95	for node := range c.nodeChannels {	×
96	numChannels += len(c.nodeChannels[node])	×
97	}	×
98	return fmt.Sprintf("num_node_features=%d, num_nodes=%d, "+	×
99	"num_channels=%d", len(c.nodeFeatures), len(c.nodeChannels),	×
100	numChannels)	×
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) {	×
106		×
107	c.mtx.Lock()	×
108	defer c.mtx.Unlock()	×
109		×
110	c.nodeFeatures[node] = features	×
111	}	×
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.ChannelEdgeInfo,
118	policy1 models.ChannelEdgePolicy, policy2 models.ChannelEdgePolicy) {	×
119		×
120	if info == nil {	×
121	return	×
122	}	×
123
124	if policy1 != nil && policy1.IsDisabled() &&	×
125	policy2 != nil && policy2.IsDisabled() {	×
126		×
127	return	×
128	}	×
129
130	// Create the edge entry for both nodes.
131	c.mtx.Lock()	×
132	c.updateOrAddEdge(info.NodeKey1Bytes, &DirectedChannel{	×
133	ChannelID: info.ChannelID,	×
134	IsNode1: true,	×
135	OtherNode: info.NodeKey2Bytes,	×
136	Capacity: info.Capacity,	×
137	})	×
138	c.updateOrAddEdge(info.NodeKey2Bytes, &DirectedChannel{	×
139	ChannelID: info.ChannelID,	×
140	IsNode1: false,	×
141	OtherNode: info.NodeKey1Bytes,	×
142	Capacity: info.Capacity,	×
143	})	×
144	c.mtx.Unlock()	×
145		×
146	// The policy's node is always the to_node. So if policy 1 has to_node	×
147	// of node 2 then we have the policy 1 as seen from node 1.	×
148	if policy1 != nil {	×
149	fromNode, toNode := info.NodeKey1Bytes, info.NodeKey2Bytes	×
150	if policy1.ToNode != info.NodeKey2Bytes {	×
151	fromNode, toNode = toNode, fromNode	×
152	}	×
153	isEdge1 := policy1.ChannelFlags&lnwire.ChanUpdateDirection == 0	×
154	c.UpdatePolicy(policy1, fromNode, toNode, isEdge1)	×
155	}
156	if policy2 != nil {	×
157	fromNode, toNode := info.NodeKey2Bytes, info.NodeKey1Bytes	×
158	if policy2.ToNode != info.NodeKey1Bytes {	×
159	fromNode, toNode = toNode, fromNode	×
160	}	×
161	isEdge1 := policy2.ChannelFlags&lnwire.ChanUpdateDirection == 0	×
162	c.UpdatePolicy(policy2, fromNode, toNode, isEdge1)	×
163	}
164	}
165
166	// updateOrAddEdge makes sure the edge information for a node is either updated
167	// if it already exists or is added to that node's list of channels.
168	func (c GraphCache) updateOrAddEdge(node route.Vertex, edge DirectedChannel) {	×
169	if len(c.nodeChannels[node]) == 0 {	×
170	c.nodeChannels[node] = make(map[uint64]*DirectedChannel)	×
171	}	×
172
173	c.nodeChannels[node][edge.ChannelID] = edge	×
174	}
175
176	// UpdatePolicy updates a single policy on both the from and to node. The order
177	// of the from and to node is not strictly important. But we assume that a
178	// channel edge was added beforehand so that the directed channel struct already
179	// exists in the cache.
180	func (c GraphCache) UpdatePolicy(policy models.ChannelEdgePolicy, fromNode,
181	toNode route.Vertex, edge1 bool) {	×
182		×
183	// Extract inbound fee if possible and available. If there is a decoding	×
184	// error, ignore this policy.	×
185	var inboundFee lnwire.Fee	×
186	_, err := policy.ExtraOpaqueData.ExtractRecords(&inboundFee)	×
187	if err != nil {	×
188	log.Errorf("Failed to extract records from edge policy %v: %v",	×
189	policy.ChannelID, err)	×
190		×
191	return	×
192	}	×
193
194	c.mtx.Lock()	×
195	defer c.mtx.Unlock()	×
196		×
197	updatePolicy := func(nodeKey route.Vertex) {	×
198	if len(c.nodeChannels[nodeKey]) == 0 {	×
199	log.Warnf("Node=%v not found in graph cache", nodeKey)	×
200		×
201	return	×
202	}	×
203
204	channel, ok := c.nodeChannels[nodeKey][policy.ChannelID]	×
205	if !ok {	×
206	log.Warnf("Channel=%v not found in graph cache",	×
207	policy.ChannelID)	×
208		×
209	return	×
210	}	×
211
212	// Edge 1 is defined as the policy for the direction of node1 to
213	// node2.
214	switch {	×
215	// This is node 1, and it is edge 1, so this is the outgoing
216	// policy for node 1.
217	case channel.IsNode1 && edge1:	×
218	channel.OutPolicySet = true	×
219	channel.InboundFee = inboundFee	×
220
221	// This is node 2, and it is edge 2, so this is the outgoing
222	// policy for node 2.
223	case !channel.IsNode1 && !edge1:	×
224	channel.OutPolicySet = true	×
225	channel.InboundFee = inboundFee	×
226
227	// The other two cases left mean it's the inbound policy for the
228	// node.
229	default:	×
230	channel.InPolicy = models.NewCachedPolicy(policy)	×
231	}
232	}
233
234	updatePolicy(fromNode)	×
235	updatePolicy(toNode)	×
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) {	×
241	c.mtx.Lock()	×
242	defer c.mtx.Unlock()	×
243		×
244	delete(c.nodeFeatures, node)	×
245		×
246	// First remove all channels from the other nodes' lists.	×
247	for _, channel := range c.nodeChannels[node] {	×
248	c.removeChannelIfFound(channel.OtherNode, channel.ChannelID)	×
249	}	×
250
251	// Then remove our whole node completely.
252	delete(c.nodeChannels, node)	×
253	}
254
255	// RemoveChannel removes a single channel between two nodes.
256	func (c *GraphCache) RemoveChannel(node1, node2 route.Vertex, chanID uint64) {	×
257	c.mtx.Lock()	×
258	defer c.mtx.Unlock()	×
259		×
260	// Remove that one channel from both sides.	×
261	c.removeChannelIfFound(node1, chanID)	×
262	c.removeChannelIfFound(node2, chanID)	×
263	}	×
264
265	// removeChannelIfFound removes a single channel from one side.
266	func (c *GraphCache) removeChannelIfFound(node route.Vertex, chanID uint64) {	×
267	if len(c.nodeChannels[node]) == 0 {	×
268	return	×
269	}	×
270
271	delete(c.nodeChannels[node], chanID)	×
272	}
273
274	// UpdateChannel updates the channel edge information for a specific edge. We
275	// expect the edge to already exist and be known. If it does not yet exist, this
276	// call is a no-op.
277	func (c GraphCache) UpdateChannel(info models.ChannelEdgeInfo) {	×
278	c.mtx.Lock()	×
279	defer c.mtx.Unlock()	×
280		×
281	if len(c.nodeChannels[info.NodeKey1Bytes]) == 0 \|\|	×
282	len(c.nodeChannels[info.NodeKey2Bytes]) == 0 {	×
283		×
284	return	×
285	}	×
286
287	channel, ok := c.nodeChannels[info.NodeKey1Bytes][info.ChannelID]	×
288	if ok {	×
289	// We only expect to be called when the channel is already	×
290	// known.	×
291	channel.Capacity = info.Capacity	×
292	channel.OtherNode = info.NodeKey2Bytes	×
293	}	×
294
295	channel, ok = c.nodeChannels[info.NodeKey2Bytes][info.ChannelID]	×
296	if ok {	×
297	channel.Capacity = info.Capacity	×
298	channel.OtherNode = info.NodeKey1Bytes	×
299	}	×
300	}
301
302	// getChannels returns a copy of the passed node's channels or nil if there
303	// isn't any.
304	func (c GraphCache) getChannels(node route.Vertex) []DirectedChannel {	×
305	c.mtx.RLock()	×
306	defer c.mtx.RUnlock()	×
307		×
308	channels, ok := c.nodeChannels[node]	×
309	if !ok {	×
310	return nil	×
311	}	×
312
313	features, ok := c.nodeFeatures[node]	×
314	if !ok {	×
315	// If the features were set to nil explicitly, that's fine here.	×
316	// The router will overwrite the features of the destination	×
317	// node with those found in the invoice if necessary. But if we	×
318	// didn't yet get a node announcement we want to mimic the	×
319	// behavior of the old DB based code that would always set an	×
320	// empty feature vector instead of leaving it nil.	×
321	features = lnwire.EmptyFeatureVector()	×
322	}	×
323
324	toNodeCallback := func() route.Vertex {	×
325	return node	×
326	}	×
327
328	i := 0	×
329	channelsCopy := make([]*DirectedChannel, len(channels))	×
330	for _, channel := range channels {	×
331	// We need to copy the channel and policy to avoid it being	×
332	// updated in the cache if the path finding algorithm sets	×
333	// fields on it (currently only the ToNodeFeatures of the	×
334	// policy).	×
335	channelCopy := channel.DeepCopy()	×
336	if channelCopy.InPolicy != nil {	×
337	channelCopy.InPolicy.ToNodePubKey = toNodeCallback	×
338	channelCopy.InPolicy.ToNodeFeatures = features	×
339	}	×
340
341	channelsCopy[i] = channelCopy	×
342	i++	×
343	}
344
345	return channelsCopy	×
346	}
347
348	// ForEachChannel invokes the given callback for each channel of the given node.
349	func (c *GraphCache) ForEachChannel(node route.Vertex,
350	cb func(channel *DirectedChannel) error) error {	×
351		×
352	// Obtain a copy of the node's channels. We need do this in order to	×
353	// avoid deadlocks caused by interaction with the graph cache, channel	×
354	// state and the graph database from multiple goroutines. This snapshot	×
355	// is only used for path finding where being stale is acceptable since	×
356	// the real world graph and our representation may always become	×
357	// slightly out of sync for a short time and the actual channel state	×
358	// is stored separately.	×
359	channels := c.getChannels(node)	×
360	for _, channel := range channels {	×
361	if err := cb(channel); err != nil {	×
362	return err	×
363	}	×
364	}
365
366	return nil	×
367	}
368
369	// ForEachNode iterates over the adjacency list of the graph, executing the
370	// call back for each node and the set of channels that emanate from the given
371	// node.
372	//
373	// NOTE: This method should be considered _read only_, the channels or nodes
374	// passed in MUST NOT be modified.
375	func (c *GraphCache) ForEachNode(cb func(node route.Vertex,
376	channels map[uint64]*DirectedChannel) error) error {	×
377		×
378	c.mtx.RLock()	×
379	defer c.mtx.RUnlock()	×
380		×
381	for node, channels := range c.nodeChannels {	×
382	// We don't make a copy here since this is a read-only RPC	×
383	// call. We also don't need the node features either for this	×
384	// call.	×
385	if err := cb(node, channels); err != nil {	×
386	return err	×
387	}	×
388	}
389
390	return nil	×
391	}
392
393	// GetFeatures returns the features of the node with the given ID. If no
394	// features are known for the node, an empty feature vector is returned.
395	func (c GraphCache) GetFeatures(node route.Vertex) lnwire.FeatureVector {	×
396	c.mtx.RLock()	×
397	defer c.mtx.RUnlock()	×
398		×
399	features, ok := c.nodeFeatures[node]	×
400	if !ok \|\| features == nil {	×
401	// The router expects the features to never be nil, so we return	×
402	// an empty feature set instead.	×
403	return lnwire.EmptyFeatureVector()	×
404	}	×
405
406	return features	×
407	}

lightningnetwork / lnd / 13481548301

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