@@ -1251,9 +1251,6 @@ fn iter_equal<I1: Iterator, I2: Iterator>(mut iter_a: I1, mut iter_b: I2)
1251
1251
/// These fee values are useful to choose hops as we traverse the graph "payee-to-payer".
1252
1252
#[ derive( Clone ) ]
1253
1253
struct PathBuildingHop < ' a > {
1254
- // Note that this should be dropped in favor of loading it from CandidateRouteHop, but doing so
1255
- // is a larger refactor and will require careful performance analysis.
1256
- node_id : NodeId ,
1257
1254
candidate : CandidateRouteHop < ' a > ,
1258
1255
fee_msat : u64 ,
1259
1256
@@ -1291,7 +1288,7 @@ impl<'a> core::fmt::Debug for PathBuildingHop<'a> {
1291
1288
fn fmt ( & self , f : & mut core:: fmt:: Formatter ) -> Result < ( ) , core:: fmt:: Error > {
1292
1289
let mut debug_struct = f. debug_struct ( "PathBuildingHop" ) ;
1293
1290
debug_struct
1294
- . field ( "node_id" , & self . node_id )
1291
+ . field ( "node_id" , & self . candidate . target ( ) )
1295
1292
. field ( "short_channel_id" , & self . candidate . short_channel_id ( ) )
1296
1293
. field ( "total_fee_msat" , & self . total_fee_msat )
1297
1294
. field ( "next_hops_fee_msat" , & self . next_hops_fee_msat )
@@ -1828,8 +1825,7 @@ where L::Target: Logger {
1828
1825
// - for regular channels at channel announcement (TODO)
1829
1826
// - for first and last hops early in get_route
1830
1827
let src_node_id = $candidate. source( ) ;
1831
- let dest_node_id = $candidate. target( ) . unwrap_or( maybe_dummy_payee_node_id) ;
1832
- if src_node_id != dest_node_id {
1828
+ if Some ( src_node_id) != $candidate. target( ) {
1833
1829
let scid_opt = $candidate. short_channel_id( ) ;
1834
1830
let effective_capacity = $candidate. effective_capacity( ) ;
1835
1831
let htlc_maximum_msat = max_htlc_from_capacity( effective_capacity, channel_saturation_pow_half) ;
@@ -1946,7 +1942,6 @@ where L::Target: Logger {
1946
1942
// This will affect our decision on selecting short_channel_id
1947
1943
// as a way to reach the $candidate.target() node.
1948
1944
PathBuildingHop {
1949
- node_id: dest_node_id. clone( ) ,
1950
1945
candidate: $candidate. clone( ) ,
1951
1946
fee_msat: 0 ,
1952
1947
next_hops_fee_msat: u64 :: max_value( ) ,
@@ -2037,7 +2032,6 @@ where L::Target: Logger {
2037
2032
old_entry. next_hops_fee_msat = $next_hops_fee_msat;
2038
2033
old_entry. hop_use_fee_msat = hop_use_fee_msat;
2039
2034
old_entry. total_fee_msat = total_fee_msat;
2040
- old_entry. node_id = dest_node_id;
2041
2035
old_entry. candidate = $candidate. clone( ) ;
2042
2036
old_entry. fee_msat = 0 ; // This value will be later filled with hop_use_fee_msat of the following channel
2043
2037
old_entry. path_htlc_minimum_msat = path_htlc_minimum_msat;
@@ -2406,7 +2400,8 @@ where L::Target: Logger {
2406
2400
2407
2401
' path_walk: loop {
2408
2402
let mut features_set = false ;
2409
- if let Some ( first_channels) = first_hop_targets. get ( & ordered_hops. last ( ) . unwrap ( ) . 0 . node_id ) {
2403
+ let target = ordered_hops. last ( ) . unwrap ( ) . 0 . candidate . target ( ) . unwrap_or ( maybe_dummy_payee_node_id) ;
2404
+ if let Some ( first_channels) = first_hop_targets. get ( & target) {
2410
2405
for details in first_channels {
2411
2406
if let Some ( scid) = ordered_hops. last ( ) . unwrap ( ) . 0 . candidate . short_channel_id ( ) {
2412
2407
if details. get_outbound_payment_scid ( ) . unwrap ( ) == scid {
@@ -2418,7 +2413,7 @@ where L::Target: Logger {
2418
2413
}
2419
2414
}
2420
2415
if !features_set {
2421
- if let Some ( node) = network_nodes. get ( & ordered_hops . last ( ) . unwrap ( ) . 0 . node_id ) {
2416
+ if let Some ( node) = network_nodes. get ( & target ) {
2422
2417
if let Some ( node_info) = node. announcement_info . as_ref ( ) {
2423
2418
ordered_hops. last_mut ( ) . unwrap ( ) . 1 = node_info. features . clone ( ) ;
2424
2419
} else {
@@ -2435,11 +2430,11 @@ where L::Target: Logger {
2435
2430
// save this path for the payment route. Also, update the liquidity
2436
2431
// remaining on the used hops, so that we take them into account
2437
2432
// while looking for more paths.
2438
- if ordered_hops . last ( ) . unwrap ( ) . 0 . node_id == maybe_dummy_payee_node_id {
2433
+ if target == maybe_dummy_payee_node_id {
2439
2434
break ' path_walk;
2440
2435
}
2441
2436
2442
- new_entry = match dist. remove ( & ordered_hops . last ( ) . unwrap ( ) . 0 . node_id ) {
2437
+ new_entry = match dist. remove ( & target ) {
2443
2438
Some ( payment_hop) => payment_hop,
2444
2439
// We can't arrive at None because, if we ever add an entry to targets,
2445
2440
// we also fill in the entry in dist (see add_entry!).
@@ -2658,8 +2653,8 @@ where L::Target: Logger {
2658
2653
} ) ;
2659
2654
for idx in 0 ..( selected_route. len ( ) - 1 ) {
2660
2655
if idx + 1 >= selected_route. len ( ) { break ; }
2661
- if iter_equal ( selected_route[ idx] . hops . iter ( ) . map ( |h| ( h. 0 . candidate . id ( ) , h. 0 . node_id ) ) ,
2662
- selected_route[ idx + 1 ] . hops . iter ( ) . map ( |h| ( h. 0 . candidate . id ( ) , h. 0 . node_id ) ) ) {
2656
+ if iter_equal ( selected_route[ idx] . hops . iter ( ) . map ( |h| ( h. 0 . candidate . id ( ) , h. 0 . candidate . target ( ) ) ) ,
2657
+ selected_route[ idx + 1 ] . hops . iter ( ) . map ( |h| ( h. 0 . candidate . id ( ) , h. 0 . candidate . target ( ) ) ) ) {
2663
2658
let new_value = selected_route[ idx] . get_value_msat ( ) + selected_route[ idx + 1 ] . get_value_msat ( ) ;
2664
2659
selected_route[ idx] . update_value_and_recompute_fees ( new_value) ;
2665
2660
selected_route. remove ( idx + 1 ) ;
@@ -2672,6 +2667,7 @@ where L::Target: Logger {
2672
2667
for ( hop, node_features) in payment_path. hops . iter ( )
2673
2668
. filter ( |( h, _) | h. candidate . short_channel_id ( ) . is_some ( ) )
2674
2669
{
2670
+ let target = hop. candidate . target ( ) . expect ( "target is defined when short_channel_id is defined" ) ;
2675
2671
let maybe_announced_channel = if let CandidateRouteHop :: PublicHop { .. } = hop. candidate {
2676
2672
// If we sourced the hop from the graph we're sure the target node is announced.
2677
2673
true
@@ -2683,14 +2679,14 @@ where L::Target: Logger {
2683
2679
// there are announced channels between the endpoints. If so, the hop might be
2684
2680
// referring to any of the announced channels, as its `short_channel_id` might be
2685
2681
// an alias, in which case we don't take any chances here.
2686
- network_graph. node ( & hop . node_id ) . map_or ( false , |hop_node|
2682
+ network_graph. node ( & target ) . map_or ( false , |hop_node|
2687
2683
hop_node. channels . iter ( ) . any ( |scid| network_graph. channel ( * scid)
2688
2684
. map_or ( false , |c| c. as_directed_from ( & hop. candidate . source ( ) ) . is_some ( ) ) )
2689
2685
)
2690
2686
} ;
2691
2687
2692
2688
hops. push ( RouteHop {
2693
- pubkey : PublicKey :: from_slice ( hop . node_id . as_slice ( ) ) . map_err ( |_| LightningError { err : format ! ( "Public key {:?} is invalid" , & hop . node_id ) , action : ErrorAction :: IgnoreAndLog ( Level :: Trace ) } ) ?,
2689
+ pubkey : PublicKey :: from_slice ( target . as_slice ( ) ) . map_err ( |_| LightningError { err : format ! ( "Public key {:?} is invalid" , & target ) , action : ErrorAction :: IgnoreAndLog ( Level :: Trace ) } ) ?,
2694
2690
node_features : node_features. clone ( ) ,
2695
2691
short_channel_id : hop. candidate . short_channel_id ( ) . unwrap ( ) ,
2696
2692
channel_features : hop. candidate . features ( ) ,
0 commit comments