mirrors/core-lightning
1
0
Fork 0
mirror of https://github.com/ElementsProject/lightning.git synced 2024-11-20 02:27:51 +01:00
Code Issues Projects Releases Wiki Activity
1131e40ddf
core-lightning/gossipd/seeker.h

29 lines
800 B
C
Raw Normal View History

gossipd: move gossip seeking routines into new file seeker.c Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
2019-10-08 03:15:24 +02:00
#ifndef LIGHTNING_GOSSIPD_SEEKER_H
#define LIGHTNING_GOSSIPD_SEEKER_H
#include "config.h"
struct daemon;
struct peer;
struct short_channel_id;
gossipd: start streaming gossip from last gossip timestamp minus 10 minutes. We assume that the time for gossip propagation is < 10 minutes, so by going back that far from last gossip we won't miss anything, Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
2019-10-08 03:30:24 +02:00
struct seeker *new_seeker(struct daemon *daemon);
gossipd: move gossip seeking routines into new file seeker.c Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
2019-10-08 03:15:24 +02:00
void query_unknown_channel(struct daemon *daemon,
struct peer *peer,
const struct short_channel_id *id);
seeker: start doing a channel probe if we see unknown node_announcement msgs. It usually means we're missing something, but there's no way to ask what. Simply start a broad scid probe. Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
2019-10-08 03:32:24 +02:00
void query_unknown_node(struct seeker *seeker, struct peer *peer);
seeker: take over gossip control. The seeker starts by asking a peer (the first peer!) for all gossip since a minute before the modified time of the gossip store. This algorithm is enhanced in successive patches. Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
2019-10-08 03:16:24 +02:00
void seeker_setup_peer_gossip(struct seeker *seeker, struct peer *peer);
gossipd: move gossip seeking routines into new file seeker.c Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
2019-10-08 03:15:24 +02:00
bool remove_unknown_scid(struct seeker *seeker,
seeker: use hash table for unknown short_channel_ids. Instead of a linear array which is fairly inefficient if it turns out we know nothing at all. We remove the gossip_missing() call by changing the api to remove_unknown_scid() to include a flag as to whether the scid turned out to be real or not. Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
2019-10-08 03:18:24 +02:00
const struct short_channel_id *scid,
bool found);
gossipd: move gossip seeking routines into new file seeker.c Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
2019-10-08 03:15:24 +02:00
bool add_unknown_scid(struct seeker *seeker,
seeker: try asking peer which gave us unknown data first. This should give more reliable results, though it risks us getting suckered into always consulting the same peer. Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
2019-10-08 03:31:24 +02:00
const struct short_channel_id *scid,
struct peer *peer);
gossipd: restore dev-suppress-gossip functionality. Don't start new peers, and don't check on existing peers. This should get rid of most gossip. Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
2019-10-08 03:34:24 +02:00
gossipd: don't use softref in the seeker. We keep several peer pointers, but we just add a hook to NULL them manually when a peer dies, rather than using voodoo. Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
2023-07-06 09:36:49 +02:00
void seeker_peer_gone(struct seeker *seeker,
const struct peer *peer);
gossipd: move gossip seeking routines into new file seeker.c Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
2019-10-08 03:15:24 +02:00
#endif /* LIGHTNING_GOSSIPD_SEEKER_H */
Reference in New Issue Copy Permalink