12199391122

Committed 06 Dec 2024 01:10PM UTC coverage: 49.807% (-9.1%) from 58.933%

Build # 12199391122

Build Type

push

github

Committed by

web-flow

Commit Message

Merge pull request #9337 from Guayaba221/patch-1

chore: fix typo in ruby.md

Run Details

100137 of 201051 relevant lines covered (49.81%)

2.07 hits per line

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

89.27

/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/kvdb"
        "github.com/lightningnetwork/lnd/lnwire"
        "github.com/lightningnetwork/lnd/routing/route"
)

// GraphCacheNode is an interface for all the information the cache needs to know
// about a lightning node.
type GraphCacheNode interface {
        // PubKey is the node's public identity key.
        PubKey() route.Vertex

        // Features returns the node's p2p features.
        Features() *lnwire.FeatureVector

        // ForEachChannel iterates through all channels of a given node,
        // executing the passed callback with an edge info structure and the
        // policies of each end of the channel. The first edge policy is the
        // outgoing edge *to* the connecting node, while the second is the
        // incoming edge *from* the connecting node. If the callback returns an
        // error, then the iteration is halted with the error propagated back up
        // to the caller.
        ForEachChannel(kvdb.RTx,
                func(kvdb.RTx, *models.ChannelEdgeInfo,
                        *models.ChannelEdgePolicy,
                        *models.ChannelEdgePolicy) error) error
}

// 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 GraphCacheNode) {
        nodePubKey := node.PubKey()

        // Only hold the lock for a short time. The `ForEachChannel()` below is
        // possibly slow as it has to go to the backend, so we can unlock
        // between the calls. And the AddChannel() method will acquire its own
        // lock anyway.
        c.mtx.Lock()
        c.nodeFeatures[nodePubKey] = node.Features()
        c.mtx.Unlock()
}

// AddNode adds a graph node, including all the (directed) channels of that
// node.
func (c *GraphCache) AddNode(tx kvdb.RTx, node GraphCacheNode) error {
        c.AddNodeFeatures(node)

        return node.ForEachChannel(
                tx, func(tx kvdb.RTx, info *models.ChannelEdgeInfo,
                        outPolicy *models.ChannelEdgePolicy,
                        inPolicy *models.ChannelEdgePolicy) error {

                        c.AddChannel(info, outPolicy, inPolicy)

                        return nil
                },
        )
}

// 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 {
                return
        }

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

        updatePolicy := func(nodeKey route.Vertex) {
                if len(c.nodeChannels[nodeKey]) == 0 {
                        return
                }

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

lightningnetwork / lnd / 12199391122

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