#include <ccan/mem/mem.h>
#include <gossipd/broadcast.h>

struct broadcast_state *new_broadcast_state(tal_t *ctx)
{
	struct broadcast_state *bstate = tal(ctx, struct broadcast_state);
	uintmap_init(&bstate->broadcasts);
	/* Skip 0 because we initialize peers with 0 */
	bstate->next_index = 1;
	return bstate;
}

static struct queued_message *new_queued_message(tal_t *ctx,
						 const int type,
						 const u8 *tag,
						 const u8 *payload)
{
	struct queued_message *msg = tal(ctx, struct queued_message);
	msg->type = type;
	msg->tag = tal_dup_arr(msg, u8, tag, tal_count(tag), 0);
	msg->payload = tal_dup_arr(msg, u8, payload, tal_count(payload), 0);
	return msg;
}

/* Returns 0 for not-found */
static u64 find_broadcast(const struct broadcast_state *bstate,
			  const int type, const u8 *tag)
{
	struct queued_message *msg;
	u64 index;

	/* FIXME: Use a hash */
	for (msg = uintmap_first(&bstate->broadcasts, &index);
	     msg;
	     msg = uintmap_after(&bstate->broadcasts, &index)) {
		if (msg->type == type
		    && memeq(msg->tag, tal_len(msg->tag), tag, tal_len(tag)))
			return index;
	}
	return 0;
}

void queue_broadcast(struct broadcast_state *bstate,
		     const int type,
		     const u8 *tag,
		     const u8 *payload,
		     bool replace_inplace)
{
	struct queued_message *msg;
	u64 index;

	/* Remove any tag&type collisions */
	index = find_broadcast(bstate, type, tag);
	if (index == 0)
		replace_inplace = false;
	else
		tal_free(uintmap_del(&bstate->broadcasts, index));

	/* Now add the message to the queue */
	msg = new_queued_message(bstate, type, tag, payload);
	if (replace_inplace) {
		uintmap_add(&bstate->broadcasts, index, msg);
	} else {
		uintmap_add(&bstate->broadcasts, bstate->next_index, msg);
		bstate->next_index += 1;
	}
}

struct queued_message *next_broadcast_message(struct broadcast_state *bstate, u64 last_index)
{
	return uintmap_after(&bstate->broadcasts, &last_index);
}