2 * Copyright (C) 1998, 2001 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_TABLE_H
22 #define _QUAGGA_BGP_TABLE_H
29 #include "bgp_advertise.h"
32 /* table belongs to this instance */
35 /* afi/safi of this table */
41 struct route_table
*route_table
;
49 * These fields must be the very first fields in this structure.
51 * @see bgp_node_to_rnode
52 * @see bgp_node_from_rnode
56 struct bgp_adj_out_rb adj_out
;
58 struct bgp_adj_in
*adj_in
;
62 STAILQ_ENTRY(bgp_node
) pq
;
64 mpls_label_t local_label
;
68 #define BGP_NODE_PROCESS_SCHEDULED (1 << 0)
69 #define BGP_NODE_USER_CLEAR (1 << 1)
70 #define BGP_NODE_LABEL_CHANGED (1 << 2)
71 #define BGP_NODE_REGISTERED_FOR_LABEL (1 << 3)
73 struct bgp_addpath_node_data tx_addpath
;
79 * Structure that holds state for iterating over a bgp table.
81 typedef struct bgp_table_iter_t_
{
82 struct bgp_table
*table
;
83 route_table_iter_t rt_iter
;
86 extern struct bgp_table
*bgp_table_init(struct bgp
*bgp
, afi_t
, safi_t
);
87 extern void bgp_table_lock(struct bgp_table
*);
88 extern void bgp_table_unlock(struct bgp_table
*);
89 extern void bgp_table_finish(struct bgp_table
**);
95 * Returns the bgp_node structure corresponding to a route_node.
97 static inline struct bgp_node
*bgp_node_from_rnode(struct route_node
*rnode
)
99 return (struct bgp_node
*)rnode
;
105 * Returns the route_node structure corresponding to a bgp_node.
107 static inline struct route_node
*bgp_node_to_rnode(struct bgp_node
*node
)
109 return (struct route_node
*)node
;
115 * Returns the bgp_table that the given node is in.
117 static inline struct bgp_table
*bgp_node_table(struct bgp_node
*node
)
119 return route_table_get_info(bgp_node_to_rnode(node
)->table
);
123 * bgp_node_parent_nolock
125 * Gets the parent node of the given node without locking it.
127 static inline struct bgp_node
*bgp_node_parent_nolock(struct bgp_node
*node
)
129 return bgp_node_from_rnode(node
->parent
);
135 static inline void bgp_unlock_node(struct bgp_node
*node
)
137 route_unlock_node(bgp_node_to_rnode(node
));
141 * bgp_table_top_nolock
143 * Gets the top node in the table without locking it.
147 static inline struct bgp_node
*
148 bgp_table_top_nolock(const struct bgp_table
*const table
)
150 return bgp_node_from_rnode(table
->route_table
->top
);
156 static inline struct bgp_node
*
157 bgp_table_top(const struct bgp_table
*const table
)
159 return bgp_node_from_rnode(route_top(table
->route_table
));
165 static inline struct bgp_node
*bgp_route_next(struct bgp_node
*node
)
167 return bgp_node_from_rnode(route_next(bgp_node_to_rnode(node
)));
171 * bgp_route_next_until
173 static inline struct bgp_node
*bgp_route_next_until(struct bgp_node
*node
,
174 struct bgp_node
*limit
)
176 struct route_node
*rnode
;
178 rnode
= route_next_until(bgp_node_to_rnode(node
),
179 bgp_node_to_rnode(limit
));
180 return bgp_node_from_rnode(rnode
);
186 static inline struct bgp_node
*bgp_node_get(struct bgp_table
*const table
,
189 return bgp_node_from_rnode(route_node_get(table
->route_table
, p
));
195 static inline struct bgp_node
*
196 bgp_node_lookup(const struct bgp_table
*const table
, struct prefix
*p
)
198 return bgp_node_from_rnode(route_node_lookup(table
->route_table
, p
));
204 static inline struct bgp_node
*bgp_lock_node(struct bgp_node
*node
)
206 return bgp_node_from_rnode(route_lock_node(bgp_node_to_rnode(node
)));
212 static inline struct bgp_node
*bgp_node_match(const struct bgp_table
*table
,
215 return bgp_node_from_rnode(route_node_match(table
->route_table
, p
));
219 * bgp_node_match_ipv4
221 static inline struct bgp_node
*
222 bgp_node_match_ipv4(const struct bgp_table
*table
, struct in_addr
*addr
)
224 return bgp_node_from_rnode(
225 route_node_match_ipv4(table
->route_table
, addr
));
229 * bgp_node_match_ipv6
231 static inline struct bgp_node
*
232 bgp_node_match_ipv6(const struct bgp_table
*table
, struct in6_addr
*addr
)
234 return bgp_node_from_rnode(
235 route_node_match_ipv6(table
->route_table
, addr
));
238 static inline unsigned long bgp_table_count(const struct bgp_table
*const table
)
240 return route_table_count(table
->route_table
);
246 static inline struct bgp_node
*bgp_table_get_next(const struct bgp_table
*table
,
249 return bgp_node_from_rnode(route_table_get_next(table
->route_table
, p
));
253 * bgp_table_iter_init
255 static inline void bgp_table_iter_init(bgp_table_iter_t
*iter
,
256 struct bgp_table
*table
)
258 bgp_table_lock(table
);
260 route_table_iter_init(&iter
->rt_iter
, table
->route_table
);
264 * bgp_table_iter_next
266 static inline struct bgp_node
*bgp_table_iter_next(bgp_table_iter_t
*iter
)
268 return bgp_node_from_rnode(route_table_iter_next(&iter
->rt_iter
));
272 * bgp_table_iter_cleanup
274 static inline void bgp_table_iter_cleanup(bgp_table_iter_t
*iter
)
276 route_table_iter_cleanup(&iter
->rt_iter
);
277 bgp_table_unlock(iter
->table
);
282 * bgp_table_iter_pause
284 static inline void bgp_table_iter_pause(bgp_table_iter_t
*iter
)
286 route_table_iter_pause(&iter
->rt_iter
);
290 * bgp_table_iter_is_done
292 static inline int bgp_table_iter_is_done(bgp_table_iter_t
*iter
)
294 return route_table_iter_is_done(&iter
->rt_iter
);
298 * bgp_table_iter_started
300 static inline int bgp_table_iter_started(bgp_table_iter_t
*iter
)
302 return route_table_iter_started(&iter
->rt_iter
);
305 /* This would benefit from a real atomic operation...
307 static inline uint64_t bgp_table_next_version(struct bgp_table
*table
)
309 return ++table
->version
;
312 static inline uint64_t bgp_table_version(struct bgp_table
*table
)
314 return table
->version
;
317 void bgp_table_range_lookup(const struct bgp_table
*table
, struct prefix
*p
,
318 uint8_t maxlen
, struct list
*matches
);
321 static inline struct bgp_aggregate
*
322 bgp_aggregate_get_node_info(struct bgp_node
*node
)
327 static inline void bgp_aggregate_set_node_info(struct bgp_node
*node
,
328 struct bgp_aggregate
*aggregate
)
330 node
->info
= aggregate
;
333 static inline struct bgp_distance
*bgp_distance_get_node(struct bgp_node
*node
)
338 static inline void bgp_distance_set_node_info(struct bgp_node
*node
,
339 struct bgp_distance
*distance
)
341 node
->info
= distance
;
344 static inline struct bgp_static
*bgp_static_get_node_info(struct bgp_node
*node
)
349 static inline void bgp_static_set_node_info(struct bgp_node
*node
,
350 struct bgp_static
*bgp_static
)
352 node
->info
= bgp_static
;
355 static inline struct bgp_connected_ref
*
356 bgp_connected_get_node_info(struct bgp_node
*node
)
361 static inline void bgp_connected_set_node_info(struct bgp_node
*node
,
362 struct bgp_connected_ref
*bc
)
367 static inline struct bgp_nexthop_cache
*
368 bgp_nexthop_get_node_info(struct bgp_node
*node
)
373 static inline void bgp_nexthop_set_node_info(struct bgp_node
*node
,
374 struct bgp_nexthop_cache
*bnc
)
379 #endif /* _QUAGGA_BGP_TABLE_H */