From 9636281863de2cf810ca3adaeb943569851b2f97 Mon Sep 17 00:00:00 2001 From: David Lamparter Date: Mon, 20 May 2019 23:41:16 +0200 Subject: [PATCH] bgpd: use DLIST for adv_fifo I mistakenly assumed that something called "FIFO" would primarily be used by removing items from the front. This isn't the case for the adv_fifo... so use a DLIST there to make sure deletions from the middle of the queue are fast. Signed-off-by: David Lamparter (cherry picked from commit 5ac8ecbabd9638f726fdff5d49b43e675a47e434) --- bgpd/bgp_advertise.h | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/bgpd/bgp_advertise.h b/bgpd/bgp_advertise.h index cc845b93e7..502c72a5ee 100644 --- a/bgpd/bgp_advertise.h +++ b/bgpd/bgp_advertise.h @@ -23,7 +23,7 @@ #include "lib/typesafe.h" -PREDECL_LIST(bgp_adv_fifo) +PREDECL_DLIST(bgp_adv_fifo) struct update_subgroup; @@ -60,7 +60,7 @@ struct bgp_advertise { struct bgp_path_info *pathi; }; -DECLARE_LIST(bgp_adv_fifo, struct bgp_advertise, fifo) +DECLARE_DLIST(bgp_adv_fifo, struct bgp_advertise, fifo) /* BGP adjacency out. */ struct bgp_adj_out { -- 2.39.5