Rusty Russell df00f20e4a gossipd: erase old entries from the store, don't just append. ... We use the high bit of the length field: this way we can still check that the checksums are valid on deleted fields. Once this is done, serially reading the gossip_store file will result in a complete, ordered, minimal gossip broadcast. Also, the horrible corner case where we might try to delete things from the store during load time is completely gone: we only load non-deleted things. Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>		2019-06-04 01:29:39 +00:00
..
test	gossipd: erase old entries from the store, don't just append.	2019-06-04 01:29:39 +00:00
broadcast.c	gossipd: track gossip_store locations of local channels.	2019-06-04 01:29:39 +00:00
broadcast.h	gossipd: neaten insert_broadcast a little.	2019-05-22 11:28:44 +00:00
gossip_constants.h	Use node_id everywhere for nodes.	2019-04-09 12:37:16 -07:00
gossip_peerd_wire.csv	gossipd: send per-peer daemons offsets into gossip store.	2019-05-13 05:16:18 +00:00
gossip_store.c	gossipd: erase old entries from the store, don't just append.	2019-06-04 01:29:39 +00:00
gossip_store.csv	gossipd: erase old entries from the store, don't just append.	2019-06-04 01:29:39 +00:00
gossip_store.h	gossipd: erase old entries from the store, don't just append.	2019-06-04 01:29:39 +00:00
gossip_wire.csv	gossipd: reply to large listchannels in parts.	2019-05-22 11:28:44 +00:00
gossipd.c	gossipd: erase old entries from the store, don't just append.	2019-06-04 01:29:39 +00:00
Makefile	common: move gossip_store read routine where subdaemons can access it.	2019-05-13 05:16:18 +00:00
routing.c	gossipd: erase old entries from the store, don't just append.	2019-06-04 01:29:39 +00:00
routing.h	gossipd: erase old entries from the store, don't just append.	2019-06-04 01:29:39 +00:00