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 /* table belongs to this instance */
32 /* afi/safi of this table */
38 struct route_table
*route_table
;
46 * These fields must be the very first fields in this structure.
48 * @see bgp_node_to_rnode
49 * @see bgp_node_from_rnode
53 struct bgp_adj_out
*adj_out
;
55 struct bgp_adj_in
*adj_in
;
59 STAILQ_ENTRY(bgp_node
) pq
;
61 mpls_label_t local_label
;
65 #define BGP_NODE_PROCESS_SCHEDULED (1 << 0)
66 #define BGP_NODE_USER_CLEAR (1 << 1)
67 #define BGP_NODE_LABEL_CHANGED (1 << 2)
68 #define BGP_NODE_REGISTERED_FOR_LABEL (1 << 3)
74 * Structure that holds state for iterating over a bgp table.
76 typedef struct bgp_table_iter_t_
{
77 struct bgp_table
*table
;
78 route_table_iter_t rt_iter
;
81 extern struct bgp_table
*bgp_table_init(struct bgp
*bgp
, afi_t
, safi_t
);
82 extern void bgp_table_lock(struct bgp_table
*);
83 extern void bgp_table_unlock(struct bgp_table
*);
84 extern void bgp_table_finish(struct bgp_table
**);
90 * Returns the bgp_node structure corresponding to a route_node.
92 static inline struct bgp_node
*bgp_node_from_rnode(struct route_node
*rnode
)
94 return (struct bgp_node
*)rnode
;
100 * Returns the route_node structure corresponding to a bgp_node.
102 static inline struct route_node
*bgp_node_to_rnode(struct bgp_node
*node
)
104 return (struct route_node
*)node
;
110 * Returns the bgp_table that the given node is in.
112 static inline struct bgp_table
*bgp_node_table(struct bgp_node
*node
)
114 return bgp_node_to_rnode(node
)->table
->info
;
118 * bgp_node_parent_nolock
120 * Gets the parent node of the given node without locking it.
122 static inline struct bgp_node
*bgp_node_parent_nolock(struct bgp_node
*node
)
124 return bgp_node_from_rnode(node
->parent
);
130 static inline void bgp_unlock_node(struct bgp_node
*node
)
132 route_unlock_node(bgp_node_to_rnode(node
));
136 * bgp_table_top_nolock
138 * Gets the top node in the table without locking it.
142 static inline struct bgp_node
*
143 bgp_table_top_nolock(const struct bgp_table
*const table
)
145 return bgp_node_from_rnode(table
->route_table
->top
);
151 static inline struct bgp_node
*
152 bgp_table_top(const struct bgp_table
*const table
)
154 return bgp_node_from_rnode(route_top(table
->route_table
));
160 static inline struct bgp_node
*bgp_route_next(struct bgp_node
*node
)
162 return bgp_node_from_rnode(route_next(bgp_node_to_rnode(node
)));
166 * bgp_route_next_until
168 static inline struct bgp_node
*bgp_route_next_until(struct bgp_node
*node
,
169 struct bgp_node
*limit
)
171 struct route_node
*rnode
;
173 rnode
= route_next_until(bgp_node_to_rnode(node
),
174 bgp_node_to_rnode(limit
));
175 return bgp_node_from_rnode(rnode
);
181 static inline struct bgp_node
*bgp_node_get(struct bgp_table
*const table
,
184 return bgp_node_from_rnode(route_node_get(table
->route_table
, p
));
190 static inline struct bgp_node
*
191 bgp_node_lookup(const struct bgp_table
*const table
, struct prefix
*p
)
193 return bgp_node_from_rnode(route_node_lookup(table
->route_table
, p
));
199 static inline struct bgp_node
*bgp_lock_node(struct bgp_node
*node
)
201 return bgp_node_from_rnode(route_lock_node(bgp_node_to_rnode(node
)));
207 static inline struct bgp_node
*bgp_node_match(const struct bgp_table
*table
,
210 return bgp_node_from_rnode(route_node_match(table
->route_table
, p
));
214 * bgp_node_match_ipv4
216 static inline struct bgp_node
*
217 bgp_node_match_ipv4(const struct bgp_table
*table
, struct in_addr
*addr
)
219 return bgp_node_from_rnode(
220 route_node_match_ipv4(table
->route_table
, addr
));
224 * bgp_node_match_ipv6
226 static inline struct bgp_node
*
227 bgp_node_match_ipv6(const struct bgp_table
*table
, struct in6_addr
*addr
)
229 return bgp_node_from_rnode(
230 route_node_match_ipv6(table
->route_table
, addr
));
233 static inline unsigned long bgp_table_count(const struct bgp_table
*const table
)
235 return route_table_count(table
->route_table
);
241 static inline struct bgp_node
*bgp_table_get_next(const struct bgp_table
*table
,
244 return bgp_node_from_rnode(route_table_get_next(table
->route_table
, p
));
248 * bgp_table_iter_init
250 static inline void bgp_table_iter_init(bgp_table_iter_t
*iter
,
251 struct bgp_table
*table
)
253 bgp_table_lock(table
);
255 route_table_iter_init(&iter
->rt_iter
, table
->route_table
);
259 * bgp_table_iter_next
261 static inline struct bgp_node
*bgp_table_iter_next(bgp_table_iter_t
*iter
)
263 return bgp_node_from_rnode(route_table_iter_next(&iter
->rt_iter
));
267 * bgp_table_iter_cleanup
269 static inline void bgp_table_iter_cleanup(bgp_table_iter_t
*iter
)
271 route_table_iter_cleanup(&iter
->rt_iter
);
272 bgp_table_unlock(iter
->table
);
277 * bgp_table_iter_pause
279 static inline void bgp_table_iter_pause(bgp_table_iter_t
*iter
)
281 route_table_iter_pause(&iter
->rt_iter
);
285 * bgp_table_iter_is_done
287 static inline int bgp_table_iter_is_done(bgp_table_iter_t
*iter
)
289 return route_table_iter_is_done(&iter
->rt_iter
);
293 * bgp_table_iter_started
295 static inline int bgp_table_iter_started(bgp_table_iter_t
*iter
)
297 return route_table_iter_started(&iter
->rt_iter
);
300 /* This would benefit from a real atomic operation...
302 static inline uint64_t bgp_table_next_version(struct bgp_table
*table
)
304 return ++table
->version
;
307 static inline uint64_t bgp_table_version(struct bgp_table
*table
)
309 return table
->version
;
312 #endif /* _QUAGGA_BGP_TABLE_H */