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 along
17 * with this program; see the file COPYING; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
21 #ifndef _QUAGGA_BGP_ADVERTISE_H
22 #define _QUAGGA_BGP_ADVERTISE_H
26 struct update_subgroup
;
28 /* BGP advertise FIFO. */
29 struct bgp_advertise_fifo
{
30 struct bgp_advertise
*next
;
31 struct bgp_advertise
*prev
;
35 /* BGP advertise attribute. */
36 struct bgp_advertise_attr
{
37 /* Head of advertisement pointer. */
38 struct bgp_advertise
*adv
;
40 /* Reference counter. */
43 /* Attribute pointer to be announced. */
47 struct bgp_advertise
{
48 /* FIFO for advertisement. */
49 struct bgp_advertise_fifo fifo
;
51 /* Link list for same attribute advertise. */
52 struct bgp_advertise
*next
;
53 struct bgp_advertise
*prev
;
55 /* Prefix information. */
58 /* Reference pointer. */
59 struct bgp_adj_out
*adj
;
61 /* Advertisement attribute. */
62 struct bgp_advertise_attr
*baa
;
65 struct bgp_path_info
*pathi
;
68 /* BGP adjacency out. */
70 /* RB Tree of adjacency entries */
71 RB_ENTRY(bgp_adj_out
) adj_entry
;
73 /* Advertised subgroup. */
74 struct update_subgroup
*subgroup
;
76 /* Threading that makes the adj part of subgroup's adj queue */
77 TAILQ_ENTRY(bgp_adj_out
) subgrp_adj_train
;
79 /* Prefix information. */
82 uint32_t addpath_tx_id
;
84 /* Advertised attribute. */
87 /* Advertisement information. */
88 struct bgp_advertise
*adv
;
91 RB_HEAD(bgp_adj_out_rb
, bgp_adj_out
);
92 RB_PROTOTYPE(bgp_adj_out_rb
, bgp_adj_out
, adj_entry
,
95 /* BGP adjacency in. */
97 /* Linked list pointer. */
98 struct bgp_adj_in
*next
;
99 struct bgp_adj_in
*prev
;
104 /* Received attribute. */
107 /* Addpath identifier */
108 uint32_t addpath_rx_id
;
111 /* BGP advertisement list. */
112 struct bgp_synchronize
{
113 struct bgp_advertise_fifo update
;
114 struct bgp_advertise_fifo withdraw
;
115 struct bgp_advertise_fifo withdraw_low
;
118 /* BGP adjacency linked list. */
119 #define BGP_PATH_INFO_ADD(N, A, TYPE) \
122 (A)->next = (N)->TYPE; \
124 (N)->TYPE->prev = (A); \
128 #define BGP_PATH_INFO_DEL(N, A, TYPE) \
131 (A)->next->prev = (A)->prev; \
133 (A)->prev->next = (A)->next; \
135 (N)->TYPE = (A)->next; \
138 #define BGP_ADJ_IN_ADD(N, A) BGP_PATH_INFO_ADD(N, A, adj_in)
139 #define BGP_ADJ_IN_DEL(N, A) BGP_PATH_INFO_DEL(N, A, adj_in)
141 #define BGP_ADV_FIFO_ADD(F, N) \
143 FIFO_ADD((F), (N)); \
147 #define BGP_ADV_FIFO_DEL(F, N) \
153 #define BGP_ADV_FIFO_INIT(F) \
159 #define BGP_ADV_FIFO_COUNT(F) (F)->count
161 #define BGP_ADV_FIFO_EMPTY(F) \
162 (((struct bgp_advertise_fifo *)(F))->next \
163 == (struct bgp_advertise *)(F))
165 #define BGP_ADV_FIFO_HEAD(F) \
166 ((((struct bgp_advertise_fifo *)(F))->next \
167 == (struct bgp_advertise *)(F)) \
172 extern int bgp_adj_out_lookup(struct peer
*, struct bgp_node
*, uint32_t);
173 extern void bgp_adj_in_set(struct bgp_node
*, struct peer
*, struct attr
*,
175 extern int bgp_adj_in_unset(struct bgp_node
*, struct peer
*, uint32_t);
176 extern void bgp_adj_in_remove(struct bgp_node
*, struct bgp_adj_in
*);
178 extern void bgp_sync_init(struct peer
*);
179 extern void bgp_sync_delete(struct peer
*);
180 extern unsigned int baa_hash_key(void *p
);
181 extern bool baa_hash_cmp(const void *p1
, const void *p2
);
182 extern void bgp_advertise_add(struct bgp_advertise_attr
*baa
,
183 struct bgp_advertise
*adv
);
184 extern struct bgp_advertise
*bgp_advertise_new(void);
185 extern void bgp_advertise_free(struct bgp_advertise
*adv
);
186 extern struct bgp_advertise_attr
*bgp_advertise_intern(struct hash
*hash
,
188 extern struct bgp_advertise_attr
*baa_new(void);
189 extern void bgp_advertise_delete(struct bgp_advertise_attr
*baa
,
190 struct bgp_advertise
*adv
);
191 extern void bgp_advertise_unintern(struct hash
*hash
,
192 struct bgp_advertise_attr
*baa
);
194 #endif /* _QUAGGA_BGP_ADVERTISE_H */