mirror of
https://github.com/ElementsProject/lightning.git
synced 2024-11-19 09:54:16 +01:00
5501e4b13d
Since we know the total reservations on each hop, we can more easily determine probabilities than using flowset_probability() which has to replicate this collision detection. We leave both in place for now, to check. The results are not identical, due to slightly different calculation methods. Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
27 lines
953 B
C
27 lines
953 B
C
#ifndef LIGHTNING_PLUGINS_ASKRENE_REFINE_H
|
|
#define LIGHTNING_PLUGINS_ASKRENE_REFINE_H
|
|
#include "config.h"
|
|
#include <ccan/tal/tal.h>
|
|
|
|
struct route_query;
|
|
struct amount_msat;
|
|
struct flow;
|
|
|
|
/* We got an answer from min-cost-flow, but we now need to:
|
|
* 1. Add fixup exact delivery amounts since MCF deals in larger granularity than msat.
|
|
* 2. Add fees which accumulate through the route.
|
|
* 3. Check for htlc_minimum_msat violations (we simply remove those flows).
|
|
* 4. Trim any flows which (after fees) now violate maximum htlc_minimum_msat/capacity bounds.
|
|
*
|
|
* We try to reassign missing sats to the remaining flows, which is usually easy.
|
|
*
|
|
* Returns NULL on success, or an error message for the caller.
|
|
*/
|
|
const char *
|
|
refine_with_fees_and_limits(const tal_t *ctx,
|
|
struct route_query *rq,
|
|
struct amount_msat deliver,
|
|
struct flow ***flows,
|
|
double *flowset_probability);
|
|
#endif /* LIGHTNING_PLUGINS_ASKRENE_REFINE_H */
|