highperfocused/lnd
1
0
Fork 0
mirror of https://github.com/lightningnetwork/lnd.git synced 2025-09-08 14:57:38 +02:00
Code Issues Packages Projects Releases Wiki Activity

routing: remove unused param, log

Browse Source
This commit is contained in:
bitromortac
2024-07-29 11:31:24 +02:00
parent 9decf80a68
commit 9b3b309f2d
1 changed files with 12 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
routing/pathfind.go
View File

@@ -697,7 +697,6 @@ func findPath(g *graphParams, r *RestrictParams, cfg *PathFindingConfig,
// processEdge is a helper closure that will be used to make sure edges // processEdge is a helper closure that will be used to make sure edges
// satisfy our specific requirements. // satisfy our specific requirements.
processEdge := func(fromVertex route.Vertex, processEdge := func(fromVertex route.Vertex,
fromFeatures *lnwire.FeatureVector,
edge *unifiedEdge, toNodeDist *nodeWithDist) { edge *unifiedEdge, toNodeDist *nodeWithDist) {
edgesExpanded++ edgesExpanded++
@@ -783,6 +782,17 @@ func findPath(g *graphParams, r *RestrictParams, cfg *PathFindingConfig,
// Check if accumulated fees would exceed fee limit when this // Check if accumulated fees would exceed fee limit when this
// node would be added to the path. // node would be added to the path.
totalFee := int64(netAmountToReceive) - int64(amt) totalFee := int64(netAmountToReceive) - int64(amt)
log.Trace(lnutils.NewLogClosure(func() string {
return fmt.Sprintf(
"Checking fromVertex (%v) with "+
"minInboundFee=%v, inboundFee=%v, "+
"amountToSend=%v, amt=%v, totalFee=%v",
fromVertex, minInboundFee, inboundFee,
amountToSend, amt, totalFee,
)
}))
if totalFee > 0 && lnwire.MilliSatoshi(totalFee) > r.FeeLimit { if totalFee > 0 && lnwire.MilliSatoshi(totalFee) > r.FeeLimit {
return return
} }
@@ -1035,7 +1045,7 @@ func findPath(g *graphParams, r *RestrictParams, cfg *PathFindingConfig,
// Check if this candidate node is better than what we // Check if this candidate node is better than what we
// already have. // already have.
processEdge(fromNode, fromFeatures, edge, partialPath) processEdge(fromNode, edge, partialPath)
} }
if nodeHeap.Len() == 0 { if nodeHeap.Len() == 0 {