1 /* BGP advertisement and adjacency
2 Copyright (C) 1996, 97, 98, 99, 2000 Kunihiro Ishiguro
4 This file is part of GNU Zebra.
6 GNU Zebra is free software; you can redistribute it and/or modify it
7 under the terms of the GNU General Public License as published by the
8 Free Software Foundation; either version 2, or (at your option) any
11 GNU Zebra is distributed in the hope that it will be useful, but
12 WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU Zebra; see the file COPYING. If not, write to the Free
18 Software Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
21 /* BGP advertise FIFO. */
22 struct bgp_advertise_fifo
24 struct bgp_advertise *next;
25 struct bgp_advertise *prev;
28 /* BGP advertise attribute. */
29 struct bgp_advertise_attr
31 /* Head of advertisement pointer. */
32 struct bgp_advertise *adv;
34 /* Reference counter. */
37 /* Attribute pointer to be announced. */
43 /* FIFO for advertisement. */
44 struct bgp_advertise_fifo fifo;
46 /* Link list for same attribute advertise. */
47 struct bgp_advertise *next;
48 struct bgp_advertise *prev;
50 /* Prefix information. */
53 /* Reference pointer. */
54 struct bgp_adj_out *adj;
56 /* Advertisement attribute. */
57 struct bgp_advertise_attr *baa;
60 struct bgp_info *binfo;
63 /* BGP adjacency out. */
66 /* Lined list pointer. */
67 struct bgp_adj_out *next;
68 struct bgp_adj_out *prev;
70 /* Advertised peer. */
73 /* Advertised attribute. */
76 /* Advertisement information. */
77 struct bgp_advertise *adv;
80 /* BGP adjacency in. */
83 /* Linked list pointer. */
84 struct bgp_adj_in *next;
85 struct bgp_adj_in *prev;
90 /* Received attribute. */
94 /* BGP advertisement list. */
95 struct bgp_synchronize
97 struct bgp_advertise_fifo update;
98 struct bgp_advertise_fifo withdraw;
99 struct bgp_advertise_fifo withdraw_low;
102 /* FIFO -- first in first out structure and macros. */
109 #define FIFO_INIT(F) \
111 struct fifo *Xfifo = (struct fifo *)(F); \
112 Xfifo->next = Xfifo->prev = Xfifo; \
115 #define FIFO_ADD(F,N) \
117 struct fifo *Xfifo = (struct fifo *)(F); \
118 struct fifo *Xnode = (struct fifo *)(N); \
119 Xnode->next = Xfifo; \
120 Xnode->prev = Xfifo->prev; \
121 Xfifo->prev = Xfifo->prev->next = Xnode; \
124 #define FIFO_DEL(N) \
126 struct fifo *Xnode = (struct fifo *)(N); \
127 Xnode->prev->next = Xnode->next; \
128 Xnode->next->prev = Xnode->prev; \
131 #define FIFO_HEAD(F) \
132 ((((struct fifo *)(F))->next == (struct fifo *)(F)) \
135 /* BGP adjacency linked list. */
136 #define BGP_INFO_ADD(N,A,TYPE) \
139 (A)->next = (N)->TYPE; \
141 (N)->TYPE->prev = (A); \
145 #define BGP_INFO_DEL(N,A,TYPE) \
148 (A)->next->prev = (A)->prev; \
150 (A)->prev->next = (A)->next; \
152 (N)->TYPE = (A)->next; \
155 #define BGP_ADJ_IN_ADD(N,A) BGP_INFO_ADD(N,A,adj_in)
156 #define BGP_ADJ_IN_DEL(N,A) BGP_INFO_DEL(N,A,adj_in)
157 #define BGP_ADJ_OUT_ADD(N,A) BGP_INFO_ADD(N,A,adj_out)
158 #define BGP_ADJ_OUT_DEL(N,A) BGP_INFO_DEL(N,A,adj_out)
161 void bgp_adj_out_set (struct bgp_node *, struct peer *, struct prefix *,
162 struct attr *, afi_t, safi_t, struct bgp_info *);
163 void bgp_adj_out_unset (struct bgp_node *, struct peer *, struct prefix *,
165 void bgp_adj_out_remove (struct bgp_node *, struct bgp_adj_out *,
166 struct peer *, afi_t, safi_t);
167 int bgp_adj_out_lookup (struct peer *, struct prefix *, afi_t, safi_t,
170 void bgp_adj_in_set (struct bgp_node *, struct peer *, struct attr *);
171 void bgp_adj_in_unset (struct bgp_node *, struct peer *);
172 void bgp_adj_in_remove (struct bgp_node *, struct bgp_adj_in *);
174 struct bgp_advertise *
175 bgp_advertise_clean (struct peer *, struct bgp_adj_out *, afi_t, safi_t);
177 void bgp_sync_init (struct peer *);
178 void bgp_sync_delete (struct peer *);