Rusty Russell 5591c0b5d8 gossipd: don't send gossip stream, let per-peer daemons read it themselves. ... Keeping the uintmap ordering all the broadcastable messages is expensive: 130MB for the million-channels project. But now we delete obsolete entries from the store, we can have the per-peer daemons simply read that sequentially and stream the gossip itself. This is the most primitive version, where all gossip is streamed; successive patches will bring back proper handling of timestamp filtering and initial_routing_sync. We add a gossip_state field to track what's happening with our gossip streaming: it's initialized in gossipd, and currently always set, but once we handle timestamps the per-peer daemon may do it when the first filter is sent. Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>		2019-06-04 01:29:39 +00:00
..
.gitignore	gossipd/test/run-bench-find_route: don't abort if we try to route to ourselves	2017-12-20 13:57:28 +01:00
Makefile	Use node_id everywhere for nodes.	2019-04-09 12:37:16 -07:00
run-bench-find_route.c	gossipd: don't send gossip stream, let per-peer daemons read it themselves.	2019-06-04 01:29:39 +00:00
run-find_route-specific.c	gossipd: don't send gossip stream, let per-peer daemons read it themselves.	2019-06-04 01:29:39 +00:00
run-find_route.c	gossipd: don't send gossip stream, let per-peer daemons read it themselves.	2019-06-04 01:29:39 +00:00
run-overlong.c	gossipd: don't send gossip stream, let per-peer daemons read it themselves.	2019-06-04 01:29:39 +00:00