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>

gossipd/gossipd.c

@@ -1382,21 +1382,17 @@ static struct io_plan *handle_txout_reply(struct io_conn *conn,
 	struct short_channel_id scid;
 	u8 *outscript;
 	struct amount_sat sat;
-	bool was_unknown;
+	bool good;
 
 	if (!fromwire_gossip_get_txout_reply(msg, msg, &scid, &sat, &outscript))
 		master_badmsg(WIRE_GOSSIP_GET_TXOUT_REPLY, msg);
 
-	/* Were we looking specifically for this? */
-	was_unknown = remove_unknown_scid(daemon->seeker, &scid);
-
 	/* Outscript is NULL if it's not an unspent output */
-	if (handle_pending_cannouncement(daemon, daemon->rstate,
-					 &scid, sat, outscript)
-	    && was_unknown) {
-		/* It was real: we're missing gossip. */
-		gossip_missing(daemon, daemon->seeker);
-	}
+	good = handle_pending_cannouncement(daemon, daemon->rstate,
+					    &scid, sat, outscript);
+
+	/* If we looking specifically for this, we no longer are. */
+	remove_unknown_scid(daemon->seeker, &scid, good);
 
 	/* Anywhere we might have announced a channel, we check if it's time to
 	 * announce ourselves (ie. if we just announced our own first channel) */

gossipd/seeker.c

@@ -2,6 +2,7 @@
 #include <bitcoin/short_channel_id.h>
 #include <ccan/list/list.h>
 #include <ccan/tal/tal.h>
+#include <common/memleak.h>
 #include <common/status.h>
 #include <common/timeout.h>
 #include <common/type_to_string.h>
@@ -31,6 +32,15 @@ enum seeker_state {
 	NORMAL,
 };
 
+/* Passthrough helper for HTABLE_DEFINE_TYPE */
+static const struct short_channel_id *scid_pass(const struct short_channel_id *s)
+{
+	return s;
+}
+
+HTABLE_DEFINE_TYPE(struct short_channel_id,
+		   scid_pass, hash_scid, short_channel_id_eq, scid_map);
+
 /* Gossip we're seeking at the moment. */
 struct seeker {
 	struct daemon *daemon;
@@ -41,7 +51,7 @@ struct seeker {
 	struct oneshot *check_timer;
 
 	/* Channels we've heard about, but don't know. */
-	struct short_channel_id *unknown_scids;
+	struct scid_map unknown_scids;
 
 	/* Range of scid blocks we've probed. */
 	size_t scid_probe_start, scid_probe_end;
@@ -69,15 +79,24 @@ static void begin_check_timer(struct seeker *seeker)
 					   seeker_check, seeker);
 }
 
+#if DEVELOPER
+static void memleak_help_seeker(struct htable *memtable,
+				struct seeker *seeker)
+{
+	memleak_remove_htable(memtable, &seeker->unknown_scids.raw);
+}
+#endif /* DEVELOPER */
+
 struct seeker *new_seeker(struct daemon *daemon, u32 timestamp)
 {
 	struct seeker *seeker = tal(daemon, struct seeker);
 
 	seeker->daemon = daemon;
-	seeker->unknown_scids = tal_arr(seeker, struct short_channel_id, 0);
+	scid_map_init(&seeker->unknown_scids);
 	seeker->last_gossip_timestamp = timestamp;
 	seeker->state = STARTING_UP_NEED_PEER;
 	begin_check_timer(seeker);
+	memleak_add_helper(seeker, memleak_help_seeker);
 	return seeker;
 }
 
@@ -135,6 +154,29 @@ static void normal_gossip_start(struct seeker *seeker, struct peer *peer)
 	queue_peer_msg(peer, take(msg));
 }
 
+/* Turn unknown_scids map into a flat array. */
+static struct short_channel_id *unknown_scids_arr(const tal_t *ctx,
+						  const struct seeker *seeker)
+{
+	const struct scid_map *map = &seeker->unknown_scids;
+	struct short_channel_id *scids, *s;
+	size_t i, max;
+	struct scid_map_iter it;
+
+	/* Marshal into an array: we can fit 8000 comfortably. */
+	if (scid_map_count(map) < 8000)
+		max = scid_map_count(map);
+	else
+		max = 8000;
+
+	scids = tal_arr(ctx, struct short_channel_id, max);
+	i = 0;
+	for (s = scid_map_first(map, &it); i < max; s = scid_map_next(map, &it))
+		scids[i++] = *s;
+	assert(i == tal_count(scids));
+	return scids;
+}
+
 /* We have selected this peer to stream us startup gossip */
 static void peer_gossip_startup(struct seeker *seeker, struct peer *peer)
 {
@@ -383,37 +425,30 @@ void seeker_setup_peer_gossip(struct seeker *seeker, struct peer *peer)
 	abort();
 }
 
-/* We've found gossip is missing. */
-void gossip_missing(struct daemon *daemon, struct seeker *seeker)
-{
-	/* FIXME */
-}
-
 bool remove_unknown_scid(struct seeker *seeker,
-			 const struct short_channel_id *scid)
+			 const struct short_channel_id *scid,
+			 bool found /*FIXME: use this info!*/)
 {
-	for (size_t i = 0; i < tal_count(seeker->unknown_scids); i++) {
-		if (short_channel_id_eq(&seeker->unknown_scids[i], scid)) {
-			tal_arr_remove(&seeker->unknown_scids, i);
+	struct short_channel_id *unknown;
+
+	unknown = scid_map_get(&seeker->unknown_scids, scid);
+	if (unknown) {
+		scid_map_del(&seeker->unknown_scids, unknown);
+		tal_free(unknown);
 		return true;
 	}
-	}
 	return false;
 }
 
 bool add_unknown_scid(struct seeker *seeker,
 		      const struct short_channel_id *scid)
 {
-	/* Don't go overboard if we're already asking for a lot. */
-	if (tal_count(seeker->unknown_scids) > 1000)
-		return false;
-
 	/* Check we're not already getting this one. */
-	for (size_t i = 0; i < tal_count(seeker->unknown_scids); i++)
-		if (short_channel_id_eq(&seeker->unknown_scids[i], scid))
+	if (scid_map_get(&seeker->unknown_scids, scid))
 		return false;
 
-	tal_arr_expand(&seeker->unknown_scids, *scid);
+	scid_map_add(&seeker->unknown_scids,
+		     tal_dup(seeker, struct short_channel_id, scid));
 	return true;
 }
 
@@ -428,6 +463,7 @@ void query_unknown_channel(struct daemon *daemon,
 		return;
 
 	/* This is best effort: if peer is busy, we'll try next time. */
-	query_short_channel_ids(daemon, peer, daemon->seeker->unknown_scids,
+	query_short_channel_ids(daemon, peer,
+				unknown_scids_arr(tmpctx, daemon->seeker),
 				NULL);
 }

gossipd/seeker.h

@@ -14,9 +14,9 @@ void query_unknown_channel(struct daemon *daemon,
 
 void seeker_setup_peer_gossip(struct seeker *seeker, struct peer *peer);
 
-void gossip_missing(struct daemon *daemon, struct seeker *seeker);
 bool remove_unknown_scid(struct seeker *seeker,
-			 const struct short_channel_id *scid);
+			 const struct short_channel_id *scid,
+			 bool found);
 bool add_unknown_scid(struct seeker *seeker,
 		      const struct short_channel_id *scid);
 #endif /* LIGHTNING_GOSSIPD_SEEKER_H */

gossipd/test/run-next_block_range.c

@@ -4,6 +4,12 @@
 #include <stdio.h>
 
 /* AUTOGENERATED MOCKS START */
+/* Generated stub for memleak_add_helper_ */
+void memleak_add_helper_(const tal_t *p UNNEEDED, void (*cb)(struct htable *memtable UNNEEDED,
+						    const tal_t *)){ }
+/* Generated stub for memleak_remove_htable */
+void memleak_remove_htable(struct htable *memtable UNNEEDED, const struct htable *ht UNNEEDED)
+{ fprintf(stderr, "memleak_remove_htable called!\n"); abort(); }
 /* Generated stub for new_reltimer_ */
 struct oneshot *new_reltimer_(struct timers *timers UNNEEDED,
 			      const tal_t *ctx UNNEEDED,