forked from ElementsProject/lightning
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathchaintopology.c
1394 lines (1194 loc) · 43.6 KB
/
chaintopology.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
#include "config.h"
#include <bitcoin/feerate.h>
#include <bitcoin/script.h>
#include <bitcoin/tx.h>
#include <ccan/array_size/array_size.h>
#include <ccan/io/io.h>
#include <ccan/tal/str/str.h>
#include <common/configdir.h>
#include <common/htlc_tx.h>
#include <common/json_command.h>
#include <common/json_param.h>
#include <common/memleak.h>
#include <common/timeout.h>
#include <common/trace.h>
#include <db/exec.h>
#include <lightningd/bitcoind.h>
#include <lightningd/chaintopology.h>
#include <lightningd/channel.h>
#include <lightningd/coin_mvts.h>
#include <lightningd/gossip_control.h>
#include <lightningd/invoice.h>
#include <lightningd/io_loop_with_timers.h>
#include <lightningd/jsonrpc.h>
#include <lightningd/lightningd.h>
#include <lightningd/log.h>
#include <lightningd/notification.h>
#include <math.h>
#include <wallet/txfilter.h>
/* Mutual recursion via timer. */
static void try_extend_tip(struct chain_topology *topo);
static bool first_update_complete = false;
/* init_topo sets topo->root, start_fee_estimate clears
* feerate_uninitialized (even if unsuccessful) */
static void maybe_completed_init(struct chain_topology *topo)
{
if (topo->feerate_uninitialized)
return;
if (!topo->root)
return;
log_debug(topo->ld->log, "io_break: %s", __func__);
io_break(topo);
}
static void next_topology_timer(struct chain_topology *topo)
{
assert(!topo->extend_timer);
topo->extend_timer = new_reltimer(topo->ld->timers, topo,
time_from_sec(topo->poll_seconds),
try_extend_tip, topo);
}
static bool we_broadcast(const struct chain_topology *topo,
const struct bitcoin_txid *txid)
{
return outgoing_tx_map_get(topo->outgoing_txs, txid) != NULL;
}
static void filter_block_txs(struct chain_topology *topo, struct block *b)
{
struct txfilter *filter = topo->bitcoind->ld->owned_txfilter;
size_t i;
struct amount_sat owned;
/* Now we see if any of those txs are interesting. */
const size_t num_txs = tal_count(b->full_txs);
for (i = 0; i < num_txs; i++) {
const struct bitcoin_tx *tx = b->full_txs[i];
struct bitcoin_txid txid;
size_t j;
bool is_coinbase = i == 0;
/* Tell them if it spends a txo we care about. */
for (j = 0; j < tx->wtx->num_inputs; j++) {
struct bitcoin_outpoint out;
struct txowatch *txo;
bitcoin_tx_input_get_txid(tx, j, &out.txid);
out.n = tx->wtx->inputs[j].index;
txo = txowatch_hash_get(topo->txowatches, &out);
if (txo) {
wallet_transaction_add(topo->ld->wallet,
tx->wtx, b->height, i);
txowatch_fire(txo, tx, j, b);
}
}
owned = AMOUNT_SAT(0);
txid = b->txids[i];
if (txfilter_match(filter, tx)) {
wallet_extract_owned_outputs(topo->bitcoind->ld->wallet,
tx->wtx, is_coinbase, &b->height, &owned);
wallet_transaction_add(topo->ld->wallet, tx->wtx,
b->height, i);
// invoice_check_onchain_payment(tx);
for (size_t k = 0; k < tx->wtx->num_outputs; k++) {
const struct wally_tx_output *txout;
txout = &tx->wtx->outputs[k];
if (txfilter_scriptpubkey_matches(filter, txout->script)) {
struct amount_sat amount;
struct bitcoin_outpoint outpoint;
outpoint.txid = txid;
outpoint.n = k;
bitcoin_tx_output_get_amount_sat(tx, k, &amount);
invoice_check_onchain_payment(topo->ld, txout->script, amount, &outpoint);
}
}
}
/* We did spends first, in case that tells us to watch tx. */
if (watching_txid(topo, &txid) || we_broadcast(topo, &txid)) {
wallet_transaction_add(topo->ld->wallet,
tx->wtx, b->height, i);
}
txwatch_inform(topo, &txid, tx);
}
b->full_txs = tal_free(b->full_txs);
b->txids = tal_free(b->txids);
}
size_t get_tx_depth(const struct chain_topology *topo,
const struct bitcoin_txid *txid)
{
u32 blockheight = wallet_transaction_height(topo->ld->wallet, txid);
if (blockheight == 0)
return 0;
return topo->tip->height - blockheight + 1;
}
struct tx_rebroadcast {
/* otx destructor sets this to NULL if it's been freed */
struct outgoing_tx *otx;
/* Pointer to how many are remaining: last one frees! */
size_t *num_rebroadcast_remaining;
};
/* Timer recursion: declare now. */
static void rebroadcast_txs(struct chain_topology *topo);
/* We are last. Refresh timer, and free refcnt */
static void rebroadcasts_complete(struct chain_topology *topo,
size_t *num_rebroadcast_remaining)
{
tal_free(num_rebroadcast_remaining);
topo->rebroadcast_timer = new_reltimer(topo->ld->timers, topo,
time_from_sec(30 + pseudorand(30)),
rebroadcast_txs, topo);
}
static void destroy_tx_broadcast(struct tx_rebroadcast *txrb, struct chain_topology *topo)
{
if (--*txrb->num_rebroadcast_remaining == 0)
rebroadcasts_complete(topo, txrb->num_rebroadcast_remaining);
}
static void rebroadcast_done(struct bitcoind *bitcoind,
bool success, const char *msg,
struct tx_rebroadcast *txrb)
{
if (!success)
log_debug(bitcoind->log,
"Expected error broadcasting tx %s: %s",
fmt_bitcoin_tx(tmpctx, txrb->otx->tx), msg);
/* Last one freed calls rebroadcasts_complete */
tal_free(txrb);
}
/* FIXME: This is dumb. We can group txs and avoid bothering bitcoind
* if any one tx is in the main chain. */
static void rebroadcast_txs(struct chain_topology *topo)
{
/* Copy txs now (peers may go away, and they own txs). */
struct outgoing_tx *otx;
struct outgoing_tx_map_iter it;
tal_t *cleanup_ctx = tal(NULL, char);
size_t *num_rebroadcast_remaining = notleak(tal(topo, size_t));
*num_rebroadcast_remaining = 0;
for (otx = outgoing_tx_map_first(topo->outgoing_txs, &it); otx;
otx = outgoing_tx_map_next(topo->outgoing_txs, &it)) {
struct tx_rebroadcast *txrb;
/* Already sent? */
if (wallet_transaction_height(topo->ld->wallet, &otx->txid))
continue;
/* Don't send ones which aren't ready yet. Note that if the
* minimum block is N, we broadcast it when we have block N-1! */
if (get_block_height(topo) + 1 < otx->minblock)
continue;
/* Don't free from txmap inside loop! */
if (otx->refresh
&& !otx->refresh(otx->channel, &otx->tx, otx->cbarg)) {
tal_steal(cleanup_ctx, otx);
continue;
}
txrb = tal(otx, struct tx_rebroadcast);
txrb->otx = otx;
txrb->num_rebroadcast_remaining = num_rebroadcast_remaining;
(*num_rebroadcast_remaining)++;
tal_add_destructor2(txrb, destroy_tx_broadcast, topo);
bitcoind_sendrawtx(txrb, topo->bitcoind,
tal_strdup_or_null(tmpctx, otx->cmd_id),
fmt_bitcoin_tx(tmpctx, otx->tx),
otx->allowhighfees,
rebroadcast_done,
txrb);
}
tal_free(cleanup_ctx);
/* Free explicitly in case we were called because a block came in. */
topo->rebroadcast_timer = tal_free(topo->rebroadcast_timer);
/* Nothing to broadcast? Reset timer immediately */
if (*num_rebroadcast_remaining == 0)
rebroadcasts_complete(topo, num_rebroadcast_remaining);
}
static void destroy_outgoing_tx(struct outgoing_tx *otx, struct chain_topology *topo)
{
outgoing_tx_map_del(topo->outgoing_txs, otx);
}
static void broadcast_done(struct bitcoind *bitcoind,
bool success, const char *msg,
struct outgoing_tx *otx)
{
if (otx->finished) {
if (otx->finished(otx->channel, otx->tx, success, msg, otx->cbarg)) {
tal_free(otx);
return;
}
}
if (we_broadcast(bitcoind->ld->topology, &otx->txid)) {
log_debug(
bitcoind->ld->topology->log,
"Not adding %s to list of outgoing transactions, already "
"present",
fmt_bitcoin_txid(tmpctx, &otx->txid));
tal_free(otx);
return;
}
/* For continual rebroadcasting, until context freed. */
outgoing_tx_map_add(bitcoind->ld->topology->outgoing_txs, otx);
tal_add_destructor2(otx, destroy_outgoing_tx, bitcoind->ld->topology);
}
void broadcast_tx_(const tal_t *ctx,
struct chain_topology *topo,
struct channel *channel, const struct bitcoin_tx *tx,
const char *cmd_id, bool allowhighfees, u32 minblock,
bool (*finished)(struct channel *channel,
const struct bitcoin_tx *tx,
bool success,
const char *err,
void *cbarg),
bool (*refresh)(struct channel *channel,
const struct bitcoin_tx **tx,
void *cbarg),
void *cbarg)
{
struct outgoing_tx *otx = tal(ctx, struct outgoing_tx);
otx->channel = channel;
bitcoin_txid(tx, &otx->txid);
otx->tx = clone_bitcoin_tx(otx, tx);
otx->minblock = minblock;
otx->allowhighfees = allowhighfees;
otx->finished = finished;
otx->refresh = refresh;
otx->cbarg = cbarg;
if (taken(otx->cbarg))
tal_steal(otx, otx->cbarg);
otx->cmd_id = tal_strdup_or_null(otx, cmd_id);
/* Note that if the minimum block is N, we broadcast it when
* we have block N-1! */
if (get_block_height(topo) + 1 < otx->minblock) {
log_debug(topo->log, "Deferring broadcast of txid %s until block %u",
fmt_bitcoin_txid(tmpctx, &otx->txid),
otx->minblock - 1);
/* For continual rebroadcasting, until channel freed. */
tal_steal(otx->channel, otx);
outgoing_tx_map_add(topo->outgoing_txs, otx);
tal_add_destructor2(otx, destroy_outgoing_tx, topo);
return;
}
log_debug(topo->log, "Broadcasting txid %s%s%s",
fmt_bitcoin_txid(tmpctx, &otx->txid),
cmd_id ? " for " : "", cmd_id ? cmd_id : "");
wallet_transaction_add(topo->ld->wallet, tx->wtx, 0, 0);
bitcoind_sendrawtx(otx, topo->bitcoind, otx->cmd_id,
fmt_bitcoin_tx(tmpctx, otx->tx),
allowhighfees,
broadcast_done, otx);
}
static enum watch_result closeinfo_txid_confirmed(struct lightningd *ld,
const struct bitcoin_txid *txid,
const struct bitcoin_tx *tx,
unsigned int depth,
void *unused)
{
/* Sanity check. */
if (tx != NULL) {
struct bitcoin_txid txid2;
bitcoin_txid(tx, &txid2);
if (!bitcoin_txid_eq(txid, &txid2)) {
fatal("Txid for %s is not %s",
fmt_bitcoin_tx(tmpctx, tx),
fmt_bitcoin_txid(tmpctx, txid));
}
}
/* We delete ourselves first time, so should not be reorged out!! */
assert(depth > 0);
/* Subtle: depth 1 == current block. */
wallet_confirm_tx(ld->wallet, txid,
get_block_height(ld->topology) + 1 - depth);
return DELETE_WATCH;
}
/* We need to know if close_info UTXOs (which the wallet doesn't natively know
* how to spend, so is not in the normal path) get reconfirmed.
*
* This can happen on startup (where we manually unwind 100 blocks) or on a
* reorg. The db NULLs out the confirmation_height, so we can't easily figure
* out just the new ones (and removing the ON DELETE SET NULL clause is
* non-trivial).
*
* So every time, we just set a notification for every tx in this class we're
* not already watching: there are not usually many, nor many reorgs, so the
* redundancy is OK.
*/
static void watch_for_utxo_reconfirmation(struct chain_topology *topo,
struct wallet *wallet)
{
struct utxo **unconfirmed;
unconfirmed = wallet_get_unconfirmed_closeinfo_utxos(tmpctx, wallet);
const size_t num_unconfirmed = tal_count(unconfirmed);
for (size_t i = 0; i < num_unconfirmed; i++) {
assert(unconfirmed[i]->close_info != NULL);
assert(unconfirmed[i]->blockheight == NULL);
if (find_txwatch(topo, &unconfirmed[i]->outpoint.txid,
closeinfo_txid_confirmed, NULL))
continue;
watch_txid(topo, topo,
&unconfirmed[i]->outpoint.txid,
closeinfo_txid_confirmed, NULL);
}
}
/* Mutual recursion via timer. */
static void next_updatefee_timer(struct chain_topology *topo);
static u32 interp_feerate(const struct feerate_est *rates, u32 blockcount)
{
const struct feerate_est *before = NULL, *after = NULL;
/* Find before and after. */
const size_t num_feerates = tal_count(rates);
for (size_t i = 0; i < num_feerates; i++) {
if (rates[i].blockcount <= blockcount) {
before = &rates[i];
} else if (rates[i].blockcount > blockcount && !after) {
after = &rates[i];
}
}
/* No estimates at all? */
if (!before && !after)
return 0;
/* We don't extrapolate. */
if (!before && after)
return after->rate;
if (before && !after)
return before->rate;
/* Interpolate, eg. blockcount 10, rate 15000, blockcount 20, rate 5000.
* At 15, rate should be 10000.
* 15000 + (15 - 10) / (20 - 10) * (15000 - 5000)
* 15000 + 5 / 10 * 10000
* => 10000
*/
/* Don't go backwards though! */
if (before->rate < after->rate)
return before->rate;
return before->rate
- ((u64)(blockcount - before->blockcount)
* (before->rate - after->rate)
/ (after->blockcount - before->blockcount));
}
u32 feerate_for_deadline(const struct chain_topology *topo, u32 blockcount)
{
u32 rate = interp_feerate(topo->feerates[0], blockcount);
/* 0 is a special value, meaning "don't know" */
if (rate && rate < topo->feerate_floor)
rate = topo->feerate_floor;
return rate;
}
u32 smoothed_feerate_for_deadline(const struct chain_topology *topo,
u32 blockcount)
{
/* Note: we cap it at feerate_floor when we smooth */
return interp_feerate(topo->smoothed_feerates, blockcount);
}
/* feerate_for_deadline, but really lowball for distant targets */
u32 feerate_for_target(const struct chain_topology *topo, u64 deadline)
{
u64 blocks, blockheight;
blockheight = get_block_height(topo);
/* Past deadline? Want it now. */
if (blockheight > deadline)
return feerate_for_deadline(topo, 1);
blocks = deadline - blockheight;
/* Over 200 blocks, we *always* use min fee! */
if (blocks > 200)
return FEERATE_FLOOR;
/* Over 100 blocks, use min fee bitcoind will accept */
if (blocks > 100)
return get_feerate_floor(topo);
return feerate_for_deadline(topo, blocks);
}
/* Mixes in fresh feerate rate into old smoothed values, modifies rate */
static void smooth_one_feerate(const struct chain_topology *topo,
struct feerate_est *rate)
{
/* Smoothing factor alpha for simple exponential smoothing. The goal is to
* have the feerate account for 90 percent of the values polled in the last
* 2 minutes. The following will do that in a polling interval
* independent manner. */
double alpha = 1 - pow(0.1,(double)topo->poll_seconds / 120);
u32 old_feerate, feerate_smooth;
/* We don't call this unless we had a previous feerate */
old_feerate = smoothed_feerate_for_deadline(topo, rate->blockcount);
assert(old_feerate);
feerate_smooth = rate->rate * alpha + old_feerate * (1 - alpha);
/* But to avoid updating forever, only apply smoothing when its
* effect is more then 10 percent */
if (abs((int)rate->rate - (int)feerate_smooth) > (0.1 * rate->rate))
rate->rate = feerate_smooth;
if (rate->rate < get_feerate_floor(topo))
rate->rate = get_feerate_floor(topo);
if (rate->rate != feerate_smooth)
log_debug(topo->log,
"Feerate estimate for %u blocks set to %u (was %u)",
rate->blockcount, rate->rate, feerate_smooth);
}
static bool feerates_differ(const struct feerate_est *a,
const struct feerate_est *b)
{
const size_t num_feerates = tal_count(a);
if (num_feerates != tal_count(b))
return true;
for (size_t i = 0; i < num_feerates; i++) {
if (a[i].blockcount != b[i].blockcount)
return true;
if (a[i].rate != b[i].rate)
return true;
}
return false;
}
/* In case the plugin does weird stuff! */
static bool different_blockcounts(struct chain_topology *topo,
const struct feerate_est *old,
const struct feerate_est *new)
{
const size_t num_feerates = tal_count(old);
if (num_feerates != tal_count(new)) {
log_unusual(topo->log, "Presented with %zu feerates this time (was %zu!)",
tal_count(new), num_feerates);
return true;
}
for (size_t i = 0; i < num_feerates; i++) {
if (old[i].blockcount != new[i].blockcount) {
log_unusual(topo->log, "Presented with feerates"
" for blockcount %u, previously %u",
new[i].blockcount, old[i].blockcount);
return true;
}
}
return false;
}
static void update_feerates(struct lightningd *ld,
u32 feerate_floor,
const struct feerate_est *rates TAKES)
{
struct feerate_est *new_smoothed;
bool changed;
struct chain_topology *topo = ld->topology;
topo->feerate_floor = feerate_floor;
/* Don't bother updating if we got no feerates; we'd rather have
* historical ones, if any. */
if (tal_count(rates) == 0)
goto rearm;
/* If the feerate blockcounts differ, don't average, just override */
if (topo->feerates[0] && different_blockcounts(topo, topo->feerates[0], rates)) {
for (size_t i = 0; i < ARRAY_SIZE(topo->feerates); i++)
topo->feerates[i] = tal_free(topo->feerates[i]);
topo->smoothed_feerates = tal_free(topo->smoothed_feerates);
}
/* Move down historical rates, insert these */
tal_free(topo->feerates[FEE_HISTORY_NUM-1]);
memmove(topo->feerates + 1, topo->feerates,
sizeof(topo->feerates[0]) * (FEE_HISTORY_NUM-1));
topo->feerates[0] = tal_dup_talarr(topo, struct feerate_est, rates);
changed = feerates_differ(topo->feerates[0], topo->feerates[1]);
/* Use this as basis of new smoothed ones. */
new_smoothed = tal_dup_talarr(topo, struct feerate_est, topo->feerates[0]);
/* If there were old smoothed feerates, incorporate those */
if (tal_count(topo->smoothed_feerates) != 0) {
const size_t num_new = tal_count(new_smoothed);
for (size_t i = 0; i < num_new; i++)
smooth_one_feerate(topo, &new_smoothed[i]);
}
changed |= feerates_differ(topo->smoothed_feerates, new_smoothed);
tal_free(topo->smoothed_feerates);
topo->smoothed_feerates = new_smoothed;
if (changed)
notify_feerate_change(topo->ld);
rearm:
if (topo->feerate_uninitialized) {
/* This doesn't mean we *have* a fee estimate, but it does
* mean we tried. */
topo->feerate_uninitialized = false;
maybe_completed_init(topo);
}
next_updatefee_timer(topo);
}
static void start_fee_estimate(struct chain_topology *topo)
{
topo->updatefee_timer = NULL;
if (topo->stopping)
return;
/* Once per new block head, update fee estimates. */
bitcoind_estimate_fees(topo->bitcoind, update_feerates);
}
struct rate_conversion {
u32 blockcount;
};
static struct rate_conversion conversions[] = {
[FEERATE_OPENING] = { 12 },
[FEERATE_MUTUAL_CLOSE] = { 100 },
[FEERATE_UNILATERAL_CLOSE] = { 6 },
[FEERATE_DELAYED_TO_US] = { 12 },
[FEERATE_HTLC_RESOLUTION] = { 6 },
[FEERATE_PENALTY] = { 12 },
};
u32 opening_feerate(struct chain_topology *topo)
{
if (topo->ld->force_feerates)
return topo->ld->force_feerates[FEERATE_OPENING];
return feerate_for_deadline(topo,
conversions[FEERATE_OPENING].blockcount);
}
u32 mutual_close_feerate(struct chain_topology *topo)
{
if (topo->ld->force_feerates)
return topo->ld->force_feerates[FEERATE_MUTUAL_CLOSE];
return smoothed_feerate_for_deadline(topo,
conversions[FEERATE_MUTUAL_CLOSE].blockcount);
}
u32 unilateral_feerate(struct chain_topology *topo, bool option_anchors)
{
if (topo->ld->force_feerates)
return topo->ld->force_feerates[FEERATE_UNILATERAL_CLOSE];
if (option_anchors) {
/* We can lowball fee, since we can CPFP with anchors */
u32 feerate = feerate_for_deadline(topo, 100);
if (!feerate)
return 0; /* Don't know */
/* We still need to get into the mempool, so use 5 sat/byte */
if (feerate < 1250)
return 1250;
return feerate;
}
return smoothed_feerate_for_deadline(topo,
conversions[FEERATE_UNILATERAL_CLOSE].blockcount)
* topo->ld->config.commit_fee_percent / 100;
}
u32 delayed_to_us_feerate(struct chain_topology *topo)
{
if (topo->ld->force_feerates)
return topo->ld->force_feerates[FEERATE_DELAYED_TO_US];
return smoothed_feerate_for_deadline(topo,
conversions[FEERATE_DELAYED_TO_US].blockcount);
}
u32 htlc_resolution_feerate(struct chain_topology *topo)
{
if (topo->ld->force_feerates)
return topo->ld->force_feerates[FEERATE_HTLC_RESOLUTION];
return smoothed_feerate_for_deadline(topo,
conversions[FEERATE_HTLC_RESOLUTION].blockcount);
}
u32 penalty_feerate(struct chain_topology *topo)
{
if (topo->ld->force_feerates)
return topo->ld->force_feerates[FEERATE_PENALTY];
return smoothed_feerate_for_deadline(topo,
conversions[FEERATE_PENALTY].blockcount);
}
u32 get_feerate_floor(const struct chain_topology *topo)
{
return topo->feerate_floor;
}
static struct command_result *json_feerates(struct command *cmd,
const char *buffer,
const jsmntok_t *obj UNNEEDED,
const jsmntok_t *params)
{
struct chain_topology *topo = cmd->ld->topology;
struct json_stream *response;
enum feerate_style *style;
u32 rate;
if (!param(cmd, buffer, params,
p_req("style", param_feerate_style, &style),
NULL))
return command_param_failed();
const size_t num_feerates = tal_count(topo->feerates[0]);
response = json_stream_success(cmd);
if (!num_feerates)
json_add_string(response, "warning_missing_feerates",
"Some fee estimates unavailable: bitcoind startup?");
json_object_start(response, feerate_style_name(*style));
rate = opening_feerate(topo);
if (rate)
json_add_num(response, "opening", feerate_to_style(rate, *style));
rate = mutual_close_feerate(topo);
if (rate)
json_add_num(response, "mutual_close",
feerate_to_style(rate, *style));
rate = unilateral_feerate(topo, false);
if (rate)
json_add_num(response, "unilateral_close",
feerate_to_style(rate, *style));
rate = unilateral_feerate(topo, true);
if (rate)
json_add_num(response, "unilateral_anchor_close",
feerate_to_style(rate, *style));
rate = penalty_feerate(topo);
if (rate)
json_add_num(response, "penalty",
feerate_to_style(rate, *style));
json_add_u64(response, "min_acceptable",
feerate_to_style(feerate_min(cmd->ld, NULL), *style));
json_add_u64(response, "max_acceptable",
feerate_to_style(feerate_max(cmd->ld, NULL), *style));
json_add_u64(response, "floor",
feerate_to_style(get_feerate_floor(cmd->ld->topology),
*style));
json_array_start(response, "estimates");
assert(tal_count(topo->smoothed_feerates) == num_feerates);
for (size_t i = 0; i < num_feerates; i++) {
json_object_start(response, NULL);
json_add_num(response, "blockcount",
topo->feerates[0][i].blockcount);
json_add_u64(response, "feerate",
feerate_to_style(topo->feerates[0][i].rate, *style));
json_add_u64(response, "smoothed_feerate",
feerate_to_style(topo->smoothed_feerates[i].rate,
*style));
json_object_end(response);
}
json_array_end(response);
json_object_end(response);
if (num_feerates) {
/* It actually is negotiated per-channel... */
bool anchor_outputs
= feature_offered(cmd->ld->our_features->bits[INIT_FEATURE],
OPT_ANCHOR_OUTPUTS)
|| feature_offered(cmd->ld->our_features->bits[INIT_FEATURE],
OPT_ANCHORS_ZERO_FEE_HTLC_TX);
json_object_start(response, "onchain_fee_estimates");
/* eg 020000000001016f51de645a47baa49a636b8ec974c28bdff0ac9151c0f4eda2dbe3b41dbe711d000000001716001401fad90abcd66697e2592164722de4a95ebee165ffffffff0240420f00000000002200205b8cd3b914cf67cdd8fa6273c930353dd36476734fbd962102c2df53b90880cdb73f890000000000160014c2ccab171c2a5be9dab52ec41b825863024c54660248304502210088f65e054dbc2d8f679de3e40150069854863efa4a45103b2bb63d060322f94702200d3ae8923924a458cffb0b7360179790830027bb6b29715ba03e12fc22365de1012103d745445c9362665f22e0d96e9e766f273f3260dea39c8a76bfa05dd2684ddccf00000000 == weight 702 */
json_add_num(response, "opening_channel_satoshis",
opening_feerate(cmd->ld->topology) * 702 / 1000);
/* eg. 02000000000101afcfac637d44d4e0df52031dba55b18d3f1bd79ad4b7ebbee964f124c5163dc30100000000ffffffff02400d03000000000016001427213e2217b4f56bd19b6c8393dc9f61be691233ca1f0c0000000000160014071c49cad2f420f3c805f9f6b98a57269cb1415004004830450221009a12b4d5ae1d41781f79bedecfa3e65542b1799a46c272287ba41f009d2e27ff0220382630c899207487eba28062f3989c4b656c697c23a8c89c1d115c98d82ff261014730440220191ddf13834aa08ea06dca8191422e85d217b065462d1b405b665eefa0684ed70220252409bf033eeab3aae89ae27596d7e0491bcc7ae759c5644bced71ef3cccef30147522102324266de8403b3ab157a09f1f784d587af61831c998c151bcc21bb74c2b2314b2102e3bd38009866c9da8ec4aa99cc4ea9c6c0dd46df15c61ef0ce1f271291714e5752ae00000000 == weight 673 */
json_add_u64(response, "mutual_close_satoshis",
mutual_close_feerate(cmd->ld->topology) * 673 / 1000);
/* eg. 02000000000101c4fecaae1ea940c15ec502de732c4c386d51f981317605bbe5ad2c59165690ab00000000009db0e280010a2d0f00000000002200208d290003cedb0dd00cd5004c2d565d55fc70227bf5711186f4fa9392f8f32b4a0400483045022100952fcf8c730c91cf66bcb742cd52f046c0db3694dc461e7599be330a22466d790220740738a6f9d9e1ae5c86452fa07b0d8dddc90f8bee4ded24a88fe4b7400089eb01483045022100db3002a93390fc15c193da57d6ce1020e82705e760a3aa935ebe864bd66dd8e8022062ee9c6aa7b88ff4580e2671900a339754116371d8f40eba15b798136a76cd150147522102324266de8403b3ab157a09f1f784d587af61831c998c151bcc21bb74c2b2314b2102e3bd38009866c9da8ec4aa99cc4ea9c6c0dd46df15c61ef0ce1f271291714e5752ae9a3ed620 == weight 598 */
/* Or, with anchors:
* 02000000000101dc824e8e880f90f397a74f89022b4d58f8c36ebc4fffc238bd525bd11f5002a501000000009db0e280044a010000000000002200200e1a08b3da3bea6a7a77315f95afcd589fe799af46cf9bfb89523172814050e44a01000000000000220020be7935a77ca9ab70a4b8b1906825637767fed3c00824aa90c988983587d6848878e001000000000022002009fa3082e61ca0bd627915b53b0cb8afa467248fa4dc95141f78b96e9c98a8ed245a0d000000000022002091fb9e7843a03e66b4b1173482a0eb394f03a35aae4c28e8b4b1f575696bd793040047304402205c2ea9cf6f670e2f454c054f9aaca2d248763e258e44c71675c06135fd8f36cb02201b564f0e1b3f1ea19342f26e978a4981675da23042b4d392737636738c3514da0147304402205fcd2af5b724cbbf71dfa07bd14e8018ce22c08a019976dc03d0f545f848d0a702203652200350cadb464a70a09829d09227ed3da8c6b8ef5e3a59b5eefd056deaae0147522102324266de8403b3ab157a09f1f784d587af61831c998c151bcc21bb74c2b2314b2102e3bd38009866c9da8ec4aa99cc4ea9c6c0dd46df15c61ef0ce1f271291714e5752ae9b3ed620 1112 */
if (anchor_outputs)
json_add_u64(response, "unilateral_close_satoshis",
unilateral_feerate(cmd->ld->topology, true) * 1112 / 1000);
else
json_add_u64(response, "unilateral_close_satoshis",
unilateral_feerate(cmd->ld->topology, false) * 598 / 1000);
json_add_u64(response, "unilateral_close_nonanchor_satoshis",
unilateral_feerate(cmd->ld->topology, false) * 598 / 1000);
json_add_u64(response, "htlc_timeout_satoshis",
htlc_timeout_fee(htlc_resolution_feerate(cmd->ld->topology),
false, false).satoshis /* Raw: estimate */);
json_add_u64(response, "htlc_success_satoshis",
htlc_success_fee(htlc_resolution_feerate(cmd->ld->topology),
false, false).satoshis /* Raw: estimate */);
json_object_end(response);
}
return command_success(cmd, response);
}
static const struct json_command feerates_command = {
"feerates",
"bitcoin",
json_feerates,
"Return feerate estimates, either satoshi-per-kw ({style} perkw) or satoshi-per-kb ({style} perkb)."
};
AUTODATA(json_command, &feerates_command);
static struct command_result *json_parse_feerate(struct command *cmd,
const char *buffer,
const jsmntok_t *obj UNNEEDED,
const jsmntok_t *params)
{
struct json_stream *response;
u32 *feerate;
if (!param(cmd, buffer, params,
p_req("feerate", param_feerate, &feerate),
NULL))
return command_param_failed();
response = json_stream_success(cmd);
json_add_num(response, feerate_style_name(FEERATE_PER_KSIPA),
feerate_to_style(*feerate, FEERATE_PER_KSIPA));
return command_success(cmd, response);
}
static const struct json_command parse_feerate_command = {
"parsefeerate",
"bitcoin",
json_parse_feerate,
"Return current feerate in perkw + perkb for given feerate string."
};
AUTODATA(json_command, &parse_feerate_command);
static void next_updatefee_timer(struct chain_topology *topo)
{
assert(!topo->updatefee_timer);
topo->updatefee_timer = new_reltimer(topo->ld->timers, topo,
time_from_sec(topo->poll_seconds),
start_fee_estimate, topo);
}
struct sync_waiter {
/* Linked from chain_topology->sync_waiters */
struct list_node list;
void (*cb)(struct chain_topology *topo, void *arg);
void *arg;
};
static void destroy_sync_waiter(struct sync_waiter *waiter)
{
list_del(&waiter->list);
}
void topology_add_sync_waiter_(const tal_t *ctx,
struct chain_topology *topo,
void (*cb)(struct chain_topology *topo,
void *arg),
void *arg)
{
struct sync_waiter *w = tal(ctx, struct sync_waiter);
w->cb = cb;
w->arg = arg;
list_add_tail(topo->sync_waiters, &w->list);
tal_add_destructor(w, destroy_sync_waiter);
}
/* Once we're run out of new blocks to add, call this. */
static void updates_complete(struct chain_topology *topo)
{
if (!bitcoin_blkid_eq(&topo->tip->blkid, &topo->prev_tip)) {
/* Tell lightningd about new block. */
notify_new_block(topo->bitcoind->ld, topo->tip->height);
/* Tell watch code to re-evaluate all txs. */
watch_topology_changed(topo);
/* Maybe need to rebroadcast. */
rebroadcast_txs(topo);
/* We've processed these UTXOs */
db_set_intvar(topo->bitcoind->ld->wallet->db,
"last_processed_block", topo->tip->height);
topo->prev_tip = topo->tip->blkid;
/* Send out an account balance snapshot */
if (!first_update_complete) {
send_account_balance_snapshot(topo->ld, topo->tip->height);
first_update_complete = true;
}
}
/* If bitcoind is synced, we're now synced. */
if (topo->bitcoind->synced && !topology_synced(topo)) {
struct sync_waiter *w;
struct list_head *list = topo->sync_waiters;
/* Mark topology_synced() before callbacks. */
topo->sync_waiters = NULL;
while ((w = list_pop(list, struct sync_waiter, list))) {
/* In case it doesn't free itself. */
tal_del_destructor(w, destroy_sync_waiter);
tal_steal(list, w);
w->cb(topo, w->arg);
}
tal_free(list);
}
/* Try again soon. */
next_topology_timer(topo);
}
static void record_wallet_spend(struct lightningd *ld,
struct bitcoin_outpoint *outpoint,
struct bitcoin_txid *txid,
u32 tx_blockheight)
{
struct utxo *utxo;
/* Find the amount this was for */
utxo = wallet_utxo_get(tmpctx, ld->wallet, outpoint);
if (!utxo) {
log_broken(ld->log, "No record of utxo %s",
fmt_bitcoin_outpoint(tmpctx,
outpoint));
return;
}
notify_chain_mvt(ld, new_coin_wallet_withdraw(tmpctx, txid, outpoint,
tx_blockheight,
utxo->amount, WITHDRAWAL));
}
/**
* topo_update_spends -- Tell the wallet about all spent outpoints
*/
static void topo_update_spends(struct chain_topology *topo, struct block *b)
{
const struct short_channel_id *spent_scids;
const size_t num_txs = tal_count(b->full_txs);
for (size_t i = 0; i < num_txs; i++) {
const struct bitcoin_tx *tx = b->full_txs[i];
for (size_t j = 0; j < tx->wtx->num_inputs; j++) {
struct bitcoin_outpoint outpoint;
bitcoin_tx_input_get_outpoint(tx, j, &outpoint);
if (wallet_outpoint_spend(tmpctx, topo->ld->wallet,
b->height, &outpoint))
record_wallet_spend(topo->ld, &outpoint,
&b->txids[i], b->height);
}
}
/* Retrieve all potential channel closes from the UTXO set and
* tell gossipd about them. */
spent_scids =
wallet_utxoset_get_spent(tmpctx, topo->ld->wallet, b->height);
gossipd_notify_spends(topo->bitcoind->ld, b->height, spent_scids);
}
static void topo_add_utxos(struct chain_topology *topo, struct block *b)
{
/* Coinbase and pegin UTXOs can be ignored */
const uint32_t skip_features = WALLY_TX_IS_COINBASE | WALLY_TX_IS_PEGIN;
const size_t num_txs = tal_count(b->full_txs);
for (size_t i = 0; i < num_txs; i++) {
const struct bitcoin_tx *tx = b->full_txs[i];
for (size_t n = 0; n < tx->wtx->num_outputs; n++) {
const struct wally_tx_output *output;
output = &tx->wtx->outputs[n];
if (output->features & skip_features)
continue;
if (!is_p2wsh(output->script, output->script_len, NULL))
continue; /* We only care about p2wsh utxos */
struct amount_asset amt = bitcoin_tx_output_get_amount(tx, n);
if (!amount_asset_is_main(&amt))
continue; /* Ignore non-policy asset outputs */
struct bitcoin_outpoint outpoint = { b->txids[i], n };
wallet_utxoset_add(topo->ld->wallet, &outpoint,
b->height, i,
output->script, output->script_len,
amount_asset_to_sat(&amt));
}
}
}
static void add_tip(struct chain_topology *topo, struct block *b)
{
/* Attach to tip; b is now the tip. */
assert(b->height == topo->tip->height + 1);
b->prev = topo->tip;
topo->tip->next = b; /* FIXME this doesn't seem to be used anywhere */
topo->tip = b;
trace_span_start("wallet_block_add", b);
wallet_block_add(topo->ld->wallet, b);
trace_span_end(b);
trace_span_start("topo_add_utxo", b);
topo_add_utxos(topo, b);
trace_span_end(b);
trace_span_start("topo_update_spends", b);
topo_update_spends(topo, b);
trace_span_end(b);
/* Only keep the transactions we care about. */
trace_span_start("filter_block_txs", b);
filter_block_txs(topo, b);
trace_span_end(b);
block_map_add(topo->block_map, b);
topo->max_blockheight = b->height;
}
static struct block *new_block(struct chain_topology *topo,
struct bitcoin_block *blk,
unsigned int height)
{
struct block *b = tal(topo, struct block);
bitcoin_block_blkid(blk, &b->blkid);
log_debug(topo->log, "Adding block %u: %s",
height,