@@ -1242,9 +1242,6 @@ fn iter_equal<I1: Iterator, I2: Iterator>(mut iter_a: I1, mut iter_b: I2)
1242
1242
/// These fee values are useful to choose hops as we traverse the graph "payee-to-payer".
1243
1243
#[ derive( Clone ) ]
1244
1244
struct PathBuildingHop < ' a > {
1245
- // Note that this should be dropped in favor of loading it from CandidateRouteHop, but doing so
1246
- // is a larger refactor and will require careful performance analysis.
1247
- node_id : NodeId ,
1248
1245
candidate : CandidateRouteHop < ' a > ,
1249
1246
fee_msat : u64 ,
1250
1247
@@ -1282,7 +1279,7 @@ impl<'a> core::fmt::Debug for PathBuildingHop<'a> {
1282
1279
fn fmt ( & self , f : & mut core:: fmt:: Formatter ) -> Result < ( ) , core:: fmt:: Error > {
1283
1280
let mut debug_struct = f. debug_struct ( "PathBuildingHop" ) ;
1284
1281
debug_struct
1285
- . field ( "node_id" , & self . node_id )
1282
+ . field ( "node_id" , & self . candidate . target ( ) )
1286
1283
. field ( "short_channel_id" , & self . candidate . short_channel_id ( ) )
1287
1284
. field ( "total_fee_msat" , & self . total_fee_msat )
1288
1285
. field ( "next_hops_fee_msat" , & self . next_hops_fee_msat )
@@ -1819,7 +1816,6 @@ where L::Target: Logger {
1819
1816
// - for regular channels at channel announcement (TODO)
1820
1817
// - for first and last hops early in get_route
1821
1818
let src_node_id = $candidate. source( ) ;
1822
- let dest_node_id = $candidate. target( ) . unwrap_or( maybe_dummy_payee_node_id) ;
1823
1819
if Some ( $candidate. source( ) ) != $candidate. target( ) {
1824
1820
let scid_opt = $candidate. short_channel_id( ) ;
1825
1821
let effective_capacity = $candidate. effective_capacity( ) ;
@@ -1935,9 +1931,8 @@ where L::Target: Logger {
1935
1931
// (recall it goes payee-to-payer) of short_channel_id, first add a
1936
1932
// semi-dummy record just to compute the fees to reach the source node.
1937
1933
// This will affect our decision on selecting short_channel_id
1938
- // as a way to reach the $dest_node_id .
1934
+ // as a way to reach the target node id .
1939
1935
PathBuildingHop {
1940
- node_id: dest_node_id. clone( ) ,
1941
1936
candidate: $candidate. clone( ) ,
1942
1937
fee_msat: 0 ,
1943
1938
next_hops_fee_msat: u64 :: max_value( ) ,
@@ -2027,7 +2022,6 @@ where L::Target: Logger {
2027
2022
old_entry. next_hops_fee_msat = $next_hops_fee_msat;
2028
2023
old_entry. hop_use_fee_msat = hop_use_fee_msat;
2029
2024
old_entry. total_fee_msat = total_fee_msat;
2030
- old_entry. node_id = dest_node_id. clone( ) ;
2031
2025
old_entry. candidate = $candidate. clone( ) ;
2032
2026
old_entry. fee_msat = 0 ; // This value will be later filled with hop_use_fee_msat of the following channel
2033
2027
old_entry. path_htlc_minimum_msat = path_htlc_minimum_msat;
@@ -2396,7 +2390,8 @@ where L::Target: Logger {
2396
2390
2397
2391
' path_walk: loop {
2398
2392
let mut features_set = false ;
2399
- if let Some ( first_channels) = first_hop_targets. get ( & ordered_hops. last ( ) . unwrap ( ) . 0 . node_id ) {
2393
+ let target = ordered_hops. last ( ) . unwrap ( ) . 0 . candidate . target ( ) . unwrap_or ( maybe_dummy_payee_node_id) ;
2394
+ if let Some ( first_channels) = first_hop_targets. get ( & target) {
2400
2395
for details in first_channels {
2401
2396
if let Some ( scid) = ordered_hops. last ( ) . unwrap ( ) . 0 . candidate . short_channel_id ( ) {
2402
2397
if details. get_outbound_payment_scid ( ) . unwrap ( ) == scid {
@@ -2408,7 +2403,7 @@ where L::Target: Logger {
2408
2403
}
2409
2404
}
2410
2405
if !features_set {
2411
- if let Some ( node) = network_nodes. get ( & ordered_hops . last ( ) . unwrap ( ) . 0 . node_id ) {
2406
+ if let Some ( node) = network_nodes. get ( & target ) {
2412
2407
if let Some ( node_info) = node. announcement_info . as_ref ( ) {
2413
2408
ordered_hops. last_mut ( ) . unwrap ( ) . 1 = node_info. features . clone ( ) ;
2414
2409
} else {
@@ -2425,11 +2420,11 @@ where L::Target: Logger {
2425
2420
// save this path for the payment route. Also, update the liquidity
2426
2421
// remaining on the used hops, so that we take them into account
2427
2422
// while looking for more paths.
2428
- if ordered_hops . last ( ) . unwrap ( ) . 0 . node_id == maybe_dummy_payee_node_id {
2423
+ if target == maybe_dummy_payee_node_id {
2429
2424
break ' path_walk;
2430
2425
}
2431
2426
2432
- new_entry = match dist. remove ( & ordered_hops . last ( ) . unwrap ( ) . 0 . node_id ) {
2427
+ new_entry = match dist. remove ( & target ) {
2433
2428
Some ( payment_hop) => payment_hop,
2434
2429
// We can't arrive at None because, if we ever add an entry to targets,
2435
2430
// we also fill in the entry in dist (see add_entry!).
@@ -2648,8 +2643,8 @@ where L::Target: Logger {
2648
2643
} ) ;
2649
2644
for idx in 0 ..( selected_route. len ( ) - 1 ) {
2650
2645
if idx + 1 >= selected_route. len ( ) { break ; }
2651
- if iter_equal ( selected_route[ idx] . hops . iter ( ) . map ( |h| ( h. 0 . candidate . id ( ) , h. 0 . node_id ) ) ,
2652
- selected_route[ idx + 1 ] . hops . iter ( ) . map ( |h| ( h. 0 . candidate . id ( ) , h. 0 . node_id ) ) ) {
2646
+ if iter_equal ( selected_route[ idx] . hops . iter ( ) . map ( |h| ( h. 0 . candidate . id ( ) , h. 0 . candidate . target ( ) ) ) ,
2647
+ selected_route[ idx + 1 ] . hops . iter ( ) . map ( |h| ( h. 0 . candidate . id ( ) , h. 0 . candidate . target ( ) ) ) ) {
2653
2648
let new_value = selected_route[ idx] . get_value_msat ( ) + selected_route[ idx + 1 ] . get_value_msat ( ) ;
2654
2649
selected_route[ idx] . update_value_and_recompute_fees ( new_value) ;
2655
2650
selected_route. remove ( idx + 1 ) ;
@@ -2662,6 +2657,7 @@ where L::Target: Logger {
2662
2657
for ( hop, node_features) in payment_path. hops . iter ( )
2663
2658
. filter ( |( h, _) | h. candidate . short_channel_id ( ) . is_some ( ) )
2664
2659
{
2660
+ let target = hop. candidate . target ( ) . expect ( "target is defined when short_channel_id is defined" ) ;
2665
2661
let maybe_announced_channel = if let CandidateRouteHop :: PublicHop { .. } = hop. candidate {
2666
2662
// If we sourced the hop from the graph we're sure the target node is announced.
2667
2663
true
@@ -2673,14 +2669,14 @@ where L::Target: Logger {
2673
2669
// there are announced channels between the endpoints. If so, the hop might be
2674
2670
// referring to any of the announced channels, as its `short_channel_id` might be
2675
2671
// an alias, in which case we don't take any chances here.
2676
- network_graph. node ( & hop . node_id ) . map_or ( false , |hop_node|
2672
+ network_graph. node ( & target ) . map_or ( false , |hop_node|
2677
2673
hop_node. channels . iter ( ) . any ( |scid| network_graph. channel ( * scid)
2678
2674
. map_or ( false , |c| c. as_directed_from ( & hop. candidate . source ( ) ) . is_some ( ) ) )
2679
2675
)
2680
2676
} ;
2681
2677
2682
2678
hops. push ( RouteHop {
2683
- 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 ) } ) ?,
2679
+ pubkey : PublicKey :: from_slice ( target . as_slice ( ) ) . map_err ( |_| LightningError { err : format ! ( "Public key {:?} is invalid" , & target ) , action : ErrorAction :: IgnoreAndLog ( Level :: Trace ) } ) ?,
2684
2680
node_features : node_features. clone ( ) ,
2685
2681
short_channel_id : hop. candidate . short_channel_id ( ) . unwrap ( ) ,
2686
2682
channel_features : hop. candidate . features ( ) ,
0 commit comments