fab13900e2
Probability estimates are amount dependent. Previously we assumed an amount, but that starts to make less sense when we make probability more dependent on amounts in the future.
62 lines
1.3 KiB
Go
62 lines
1.3 KiB
Go
// +build routerrpc
|
|
|
|
package main
|
|
|
|
import (
|
|
"context"
|
|
"encoding/hex"
|
|
|
|
"github.com/lightningnetwork/lnd/lnrpc/routerrpc"
|
|
|
|
"github.com/urfave/cli"
|
|
)
|
|
|
|
var queryMissionControlCommand = cli.Command{
|
|
Name: "querymc",
|
|
Category: "Payments",
|
|
Usage: "Query the internal mission control state.",
|
|
Action: actionDecorator(queryMissionControl),
|
|
}
|
|
|
|
func queryMissionControl(ctx *cli.Context) error {
|
|
conn := getClientConn(ctx, false)
|
|
defer conn.Close()
|
|
|
|
client := routerrpc.NewRouterClient(conn)
|
|
|
|
req := &routerrpc.QueryMissionControlRequest{}
|
|
rpcCtx := context.Background()
|
|
snapshot, err := client.QueryMissionControl(rpcCtx, req)
|
|
if err != nil {
|
|
return err
|
|
}
|
|
|
|
type displayPairHistory struct {
|
|
NodeFrom, NodeTo string
|
|
LastAttemptSuccessful bool
|
|
Timestamp int64
|
|
MinPenalizeAmtSat int64
|
|
}
|
|
|
|
displayResp := struct {
|
|
Pairs []displayPairHistory
|
|
}{}
|
|
|
|
for _, n := range snapshot.Pairs {
|
|
displayResp.Pairs = append(
|
|
displayResp.Pairs,
|
|
displayPairHistory{
|
|
NodeFrom: hex.EncodeToString(n.NodeFrom),
|
|
NodeTo: hex.EncodeToString(n.NodeTo),
|
|
LastAttemptSuccessful: n.LastAttemptSuccessful,
|
|
Timestamp: n.Timestamp,
|
|
MinPenalizeAmtSat: n.MinPenalizeAmtSat,
|
|
},
|
|
)
|
|
}
|
|
|
|
printJSON(displayResp)
|
|
|
|
return nil
|
|
}
|