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
28 /* afi/safi of this table */
34 struct route_table
*route_table
;
42 * These fields must be the very first fields in this structure.
44 * @see bgp_node_to_rnode
45 * @see bgp_node_from_rnode
49 struct bgp_adj_out
*adj_out
;
51 struct bgp_adj_in
*adj_in
;
55 mpls_label_t local_label
;
59 #define BGP_NODE_PROCESS_SCHEDULED (1 << 0)
60 #define BGP_NODE_USER_CLEAR (1 << 1)
61 #define BGP_NODE_LABEL_CHANGED (1 << 2)
62 #define BGP_NODE_REGISTERED_FOR_LABEL (1 << 3)
68 * Structure that holds state for iterating over a bgp table.
70 typedef struct bgp_table_iter_t_
{
71 struct bgp_table
*table
;
72 route_table_iter_t rt_iter
;
75 extern struct bgp_table
*bgp_table_init(afi_t
, safi_t
);
76 extern void bgp_table_lock(struct bgp_table
*);
77 extern void bgp_table_unlock(struct bgp_table
*);
78 extern void bgp_table_finish(struct bgp_table
**);
84 * Returns the bgp_node structure corresponding to a route_node.
86 static inline struct bgp_node
*bgp_node_from_rnode(struct route_node
*rnode
)
88 return (struct bgp_node
*)rnode
;
94 * Returns the route_node structure corresponding to a bgp_node.
96 static inline struct route_node
*bgp_node_to_rnode(struct bgp_node
*node
)
98 return (struct route_node
*)node
;
104 * Returns the bgp_table that the given node is in.
106 static inline struct bgp_table
*bgp_node_table(struct bgp_node
*node
)
108 return bgp_node_to_rnode(node
)->table
->info
;
112 * bgp_node_parent_nolock
114 * Gets the parent node of the given node without locking it.
116 static inline struct bgp_node
*bgp_node_parent_nolock(struct bgp_node
*node
)
118 return bgp_node_from_rnode(node
->parent
);
124 static inline void bgp_unlock_node(struct bgp_node
*node
)
126 route_unlock_node(bgp_node_to_rnode(node
));
130 * bgp_table_top_nolock
132 * Gets the top node in the table without locking it.
136 static inline struct bgp_node
*
137 bgp_table_top_nolock(const struct bgp_table
*const table
)
139 return bgp_node_from_rnode(table
->route_table
->top
);
145 static inline struct bgp_node
*
146 bgp_table_top(const struct bgp_table
*const table
)
148 return bgp_node_from_rnode(route_top(table
->route_table
));
154 static inline struct bgp_node
*bgp_route_next(struct bgp_node
*node
)
156 return bgp_node_from_rnode(route_next(bgp_node_to_rnode(node
)));
160 * bgp_route_next_until
162 static inline struct bgp_node
*bgp_route_next_until(struct bgp_node
*node
,
163 struct bgp_node
*limit
)
165 struct route_node
*rnode
;
167 rnode
= route_next_until(bgp_node_to_rnode(node
),
168 bgp_node_to_rnode(limit
));
169 return bgp_node_from_rnode(rnode
);
175 static inline struct bgp_node
*bgp_node_get(struct bgp_table
*const table
,
178 return bgp_node_from_rnode(route_node_get(table
->route_table
, p
));
184 static inline struct bgp_node
*
185 bgp_node_lookup(const struct bgp_table
*const table
, struct prefix
*p
)
187 return bgp_node_from_rnode(route_node_lookup(table
->route_table
, p
));
193 static inline struct bgp_node
*bgp_lock_node(struct bgp_node
*node
)
195 return bgp_node_from_rnode(route_lock_node(bgp_node_to_rnode(node
)));
201 static inline struct bgp_node
*bgp_node_match(const struct bgp_table
*table
,
204 return bgp_node_from_rnode(route_node_match(table
->route_table
, p
));
208 * bgp_node_match_ipv4
210 static inline struct bgp_node
*
211 bgp_node_match_ipv4(const struct bgp_table
*table
, struct in_addr
*addr
)
213 return bgp_node_from_rnode(
214 route_node_match_ipv4(table
->route_table
, addr
));
218 * bgp_node_match_ipv6
220 static inline struct bgp_node
*
221 bgp_node_match_ipv6(const struct bgp_table
*table
, struct in6_addr
*addr
)
223 return bgp_node_from_rnode(
224 route_node_match_ipv6(table
->route_table
, addr
));
227 static inline unsigned long bgp_table_count(const struct bgp_table
*const table
)
229 return route_table_count(table
->route_table
);
235 static inline struct bgp_node
*bgp_table_get_next(const struct bgp_table
*table
,
238 return bgp_node_from_rnode(route_table_get_next(table
->route_table
, p
));
242 * bgp_table_iter_init
244 static inline void bgp_table_iter_init(bgp_table_iter_t
*iter
,
245 struct bgp_table
*table
)
247 bgp_table_lock(table
);
249 route_table_iter_init(&iter
->rt_iter
, table
->route_table
);
253 * bgp_table_iter_next
255 static inline struct bgp_node
*bgp_table_iter_next(bgp_table_iter_t
*iter
)
257 return bgp_node_from_rnode(route_table_iter_next(&iter
->rt_iter
));
261 * bgp_table_iter_cleanup
263 static inline void bgp_table_iter_cleanup(bgp_table_iter_t
*iter
)
265 route_table_iter_cleanup(&iter
->rt_iter
);
266 bgp_table_unlock(iter
->table
);
271 * bgp_table_iter_pause
273 static inline void bgp_table_iter_pause(bgp_table_iter_t
*iter
)
275 route_table_iter_pause(&iter
->rt_iter
);
279 * bgp_table_iter_is_done
281 static inline int bgp_table_iter_is_done(bgp_table_iter_t
*iter
)
283 return route_table_iter_is_done(&iter
->rt_iter
);
287 * bgp_table_iter_started
289 static inline int bgp_table_iter_started(bgp_table_iter_t
*iter
)
291 return route_table_iter_started(&iter
->rt_iter
);
294 /* This would benefit from a real atomic operation...
296 static inline uint64_t bgp_table_next_version(struct bgp_table
*table
)
298 return ++table
->version
;
301 static inline uint64_t bgp_table_version(struct bgp_table
*table
)
303 return table
->version
;
306 #endif /* _QUAGGA_BGP_TABLE_H */