2019-05-28 12:03:48 +03:00
|
|
|
package route
|
|
|
|
|
|
|
|
import (
|
2019-11-05 01:11:28 +03:00
|
|
|
"bytes"
|
2019-12-16 23:34:29 +03:00
|
|
|
"encoding/hex"
|
2019-05-28 12:03:48 +03:00
|
|
|
"testing"
|
|
|
|
|
2019-12-16 23:34:29 +03:00
|
|
|
"github.com/btcsuite/btcd/btcec"
|
2019-05-28 12:03:48 +03:00
|
|
|
"github.com/lightningnetwork/lnd/lnwire"
|
2019-11-05 01:11:28 +03:00
|
|
|
"github.com/lightningnetwork/lnd/record"
|
2019-05-28 12:03:48 +03:00
|
|
|
)
|
|
|
|
|
2019-12-16 23:34:29 +03:00
|
|
|
var (
|
|
|
|
testPrivKeyBytes, _ = hex.DecodeString("e126f68f7eafcc8b74f54d269fe206be715000f94dac067d1c04a8ca3b2db734")
|
|
|
|
_, testPubKey = btcec.PrivKeyFromBytes(btcec.S256(), testPrivKeyBytes)
|
|
|
|
testPubKeyBytes, _ = NewVertexFromBytes(testPubKey.SerializeCompressed())
|
|
|
|
)
|
|
|
|
|
2019-05-28 12:03:48 +03:00
|
|
|
// TestRouteTotalFees checks that a route reports the expected total fee.
|
|
|
|
func TestRouteTotalFees(t *testing.T) {
|
|
|
|
t.Parallel()
|
|
|
|
|
|
|
|
// Make sure empty route returns a 0 fee.
|
|
|
|
r := &Route{}
|
|
|
|
if r.TotalFees() != 0 {
|
|
|
|
t.Fatalf("expected 0 fees, got %v", r.TotalFees())
|
|
|
|
}
|
|
|
|
|
|
|
|
// For one-hop routes the fee should be 0, since the last node will
|
|
|
|
// receive the full amount.
|
|
|
|
amt := lnwire.MilliSatoshi(1000)
|
|
|
|
hops := []*Hop{
|
|
|
|
{
|
|
|
|
PubKeyBytes: Vertex{},
|
|
|
|
ChannelID: 1,
|
|
|
|
OutgoingTimeLock: 44,
|
|
|
|
AmtToForward: amt,
|
|
|
|
},
|
|
|
|
}
|
|
|
|
r, err := NewRouteFromHops(amt, 100, Vertex{}, hops)
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
if r.TotalFees() != 0 {
|
|
|
|
t.Fatalf("expected 0 fees, got %v", r.TotalFees())
|
|
|
|
}
|
|
|
|
|
|
|
|
// Append the route with a node, making the first one take a fee.
|
|
|
|
fee := lnwire.MilliSatoshi(100)
|
|
|
|
hops = append(hops, &Hop{
|
|
|
|
PubKeyBytes: Vertex{},
|
|
|
|
ChannelID: 2,
|
|
|
|
OutgoingTimeLock: 33,
|
|
|
|
AmtToForward: amt - fee,
|
|
|
|
},
|
|
|
|
)
|
|
|
|
|
|
|
|
r, err = NewRouteFromHops(amt, 100, Vertex{}, hops)
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
if r.TotalFees() != fee {
|
|
|
|
t.Fatalf("expected %v fees, got %v", fee, r.TotalFees())
|
|
|
|
}
|
|
|
|
}
|
2019-11-05 01:11:28 +03:00
|
|
|
|
|
|
|
var (
|
|
|
|
testAmt = lnwire.MilliSatoshi(1000)
|
|
|
|
testAddr = [32]byte{0x01, 0x02}
|
|
|
|
)
|
|
|
|
|
|
|
|
// TestMPPHop asserts that a Hop will encode a non-nil to final nodes, and fail
|
|
|
|
// when trying to send to intermediaries.
|
|
|
|
func TestMPPHop(t *testing.T) {
|
|
|
|
t.Parallel()
|
|
|
|
|
|
|
|
hop := Hop{
|
|
|
|
ChannelID: 1,
|
|
|
|
OutgoingTimeLock: 44,
|
|
|
|
AmtToForward: testAmt,
|
|
|
|
LegacyPayload: false,
|
|
|
|
MPP: record.NewMPP(testAmt, testAddr),
|
|
|
|
}
|
|
|
|
|
|
|
|
// Encoding an MPP record to an intermediate hop should result in a
|
|
|
|
// failure.
|
|
|
|
var b bytes.Buffer
|
|
|
|
err := hop.PackHopPayload(&b, 2)
|
|
|
|
if err != ErrIntermediateMPPHop {
|
|
|
|
t.Fatalf("expected err: %v, got: %v",
|
|
|
|
ErrIntermediateMPPHop, err)
|
|
|
|
}
|
|
|
|
|
|
|
|
// Encoding an MPP record to a final hop should be successful.
|
|
|
|
b.Reset()
|
|
|
|
err = hop.PackHopPayload(&b, 0)
|
|
|
|
if err != nil {
|
|
|
|
t.Fatalf("expected err: %v, got: %v", nil, err)
|
|
|
|
}
|
|
|
|
}
|
2019-12-16 23:34:29 +03:00
|
|
|
|
|
|
|
// TestPayloadSize tests the payload size calculation that is provided by Hop
|
|
|
|
// structs.
|
|
|
|
func TestPayloadSize(t *testing.T) {
|
|
|
|
hops := []*Hop{
|
|
|
|
{
|
|
|
|
PubKeyBytes: testPubKeyBytes,
|
|
|
|
AmtToForward: 1000,
|
|
|
|
OutgoingTimeLock: 600000,
|
|
|
|
ChannelID: 3432483437438,
|
|
|
|
LegacyPayload: true,
|
|
|
|
},
|
|
|
|
{
|
|
|
|
PubKeyBytes: testPubKeyBytes,
|
|
|
|
AmtToForward: 1200,
|
|
|
|
OutgoingTimeLock: 700000,
|
|
|
|
ChannelID: 63584534844,
|
|
|
|
},
|
|
|
|
{
|
|
|
|
PubKeyBytes: testPubKeyBytes,
|
|
|
|
AmtToForward: 1200,
|
|
|
|
OutgoingTimeLock: 700000,
|
|
|
|
MPP: record.NewMPP(500, [32]byte{}),
|
|
|
|
CustomRecords: map[uint64][]byte{
|
|
|
|
100000: {1, 2, 3},
|
|
|
|
1000000: {4, 5},
|
|
|
|
},
|
|
|
|
},
|
|
|
|
}
|
|
|
|
|
|
|
|
rt := Route{
|
|
|
|
Hops: hops,
|
|
|
|
}
|
|
|
|
path, err := rt.ToSphinxPath()
|
|
|
|
if err != nil {
|
|
|
|
t.Fatal(err)
|
|
|
|
}
|
|
|
|
|
|
|
|
for i, onionHop := range path[:path.TrueRouteLength()] {
|
|
|
|
hop := hops[i]
|
|
|
|
var nextChan uint64
|
|
|
|
if i < len(hops)-1 {
|
|
|
|
nextChan = hops[i+1].ChannelID
|
|
|
|
}
|
|
|
|
|
|
|
|
expected := uint64(onionHop.HopPayload.NumBytes())
|
|
|
|
actual := hop.PayloadSize(nextChan)
|
|
|
|
if expected != actual {
|
|
|
|
t.Fatalf("unexpected payload size at hop %v: "+
|
|
|
|
"expected %v, got %v",
|
|
|
|
i, expected, actual)
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|