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 /* afi/safi of this table */
35 struct route_table
*route_table
;
43 * These fields must be the very first fields in this structure.
45 * @see bgp_node_to_rnode
46 * @see bgp_node_from_rnode
50 struct bgp_adj_out
*adj_out
;
52 struct bgp_adj_in
*adj_in
;
56 STAILQ_ENTRY(bgp_node
) pq
;
58 mpls_label_t local_label
;
62 #define BGP_NODE_PROCESS_SCHEDULED (1 << 0)
63 #define BGP_NODE_USER_CLEAR (1 << 1)
64 #define BGP_NODE_LABEL_CHANGED (1 << 2)
65 #define BGP_NODE_REGISTERED_FOR_LABEL (1 << 3)
71 * Structure that holds state for iterating over a bgp table.
73 typedef struct bgp_table_iter_t_
{
74 struct bgp_table
*table
;
75 route_table_iter_t rt_iter
;
78 extern struct bgp_table
*bgp_table_init(afi_t
, safi_t
);
79 extern void bgp_table_lock(struct bgp_table
*);
80 extern void bgp_table_unlock(struct bgp_table
*);
81 extern void bgp_table_finish(struct bgp_table
**);
87 * Returns the bgp_node structure corresponding to a route_node.
89 static inline struct bgp_node
*bgp_node_from_rnode(struct route_node
*rnode
)
91 return (struct bgp_node
*)rnode
;
97 * Returns the route_node structure corresponding to a bgp_node.
99 static inline struct route_node
*bgp_node_to_rnode(struct bgp_node
*node
)
101 return (struct route_node
*)node
;
107 * Returns the bgp_table that the given node is in.
109 static inline struct bgp_table
*bgp_node_table(struct bgp_node
*node
)
111 return bgp_node_to_rnode(node
)->table
->info
;
115 * bgp_node_parent_nolock
117 * Gets the parent node of the given node without locking it.
119 static inline struct bgp_node
*bgp_node_parent_nolock(struct bgp_node
*node
)
121 return bgp_node_from_rnode(node
->parent
);
127 static inline void bgp_unlock_node(struct bgp_node
*node
)
129 route_unlock_node(bgp_node_to_rnode(node
));
133 * bgp_table_top_nolock
135 * Gets the top node in the table without locking it.
139 static inline struct bgp_node
*
140 bgp_table_top_nolock(const struct bgp_table
*const table
)
142 return bgp_node_from_rnode(table
->route_table
->top
);
148 static inline struct bgp_node
*
149 bgp_table_top(const struct bgp_table
*const table
)
151 return bgp_node_from_rnode(route_top(table
->route_table
));
157 static inline struct bgp_node
*bgp_route_next(struct bgp_node
*node
)
159 return bgp_node_from_rnode(route_next(bgp_node_to_rnode(node
)));
163 * bgp_route_next_until
165 static inline struct bgp_node
*bgp_route_next_until(struct bgp_node
*node
,
166 struct bgp_node
*limit
)
168 struct route_node
*rnode
;
170 rnode
= route_next_until(bgp_node_to_rnode(node
),
171 bgp_node_to_rnode(limit
));
172 return bgp_node_from_rnode(rnode
);
178 static inline struct bgp_node
*bgp_node_get(struct bgp_table
*const table
,
181 return bgp_node_from_rnode(route_node_get(table
->route_table
, p
));
187 static inline struct bgp_node
*
188 bgp_node_lookup(const struct bgp_table
*const table
, struct prefix
*p
)
190 return bgp_node_from_rnode(route_node_lookup(table
->route_table
, p
));
196 static inline struct bgp_node
*bgp_lock_node(struct bgp_node
*node
)
198 return bgp_node_from_rnode(route_lock_node(bgp_node_to_rnode(node
)));
204 static inline struct bgp_node
*bgp_node_match(const struct bgp_table
*table
,
207 return bgp_node_from_rnode(route_node_match(table
->route_table
, p
));
211 * bgp_node_match_ipv4
213 static inline struct bgp_node
*
214 bgp_node_match_ipv4(const struct bgp_table
*table
, struct in_addr
*addr
)
216 return bgp_node_from_rnode(
217 route_node_match_ipv4(table
->route_table
, addr
));
221 * bgp_node_match_ipv6
223 static inline struct bgp_node
*
224 bgp_node_match_ipv6(const struct bgp_table
*table
, struct in6_addr
*addr
)
226 return bgp_node_from_rnode(
227 route_node_match_ipv6(table
->route_table
, addr
));
230 static inline unsigned long bgp_table_count(const struct bgp_table
*const table
)
232 return route_table_count(table
->route_table
);
238 static inline struct bgp_node
*bgp_table_get_next(const struct bgp_table
*table
,
241 return bgp_node_from_rnode(route_table_get_next(table
->route_table
, p
));
245 * bgp_table_iter_init
247 static inline void bgp_table_iter_init(bgp_table_iter_t
*iter
,
248 struct bgp_table
*table
)
250 bgp_table_lock(table
);
252 route_table_iter_init(&iter
->rt_iter
, table
->route_table
);
256 * bgp_table_iter_next
258 static inline struct bgp_node
*bgp_table_iter_next(bgp_table_iter_t
*iter
)
260 return bgp_node_from_rnode(route_table_iter_next(&iter
->rt_iter
));
264 * bgp_table_iter_cleanup
266 static inline void bgp_table_iter_cleanup(bgp_table_iter_t
*iter
)
268 route_table_iter_cleanup(&iter
->rt_iter
);
269 bgp_table_unlock(iter
->table
);
274 * bgp_table_iter_pause
276 static inline void bgp_table_iter_pause(bgp_table_iter_t
*iter
)
278 route_table_iter_pause(&iter
->rt_iter
);
282 * bgp_table_iter_is_done
284 static inline int bgp_table_iter_is_done(bgp_table_iter_t
*iter
)
286 return route_table_iter_is_done(&iter
->rt_iter
);
290 * bgp_table_iter_started
292 static inline int bgp_table_iter_started(bgp_table_iter_t
*iter
)
294 return route_table_iter_started(&iter
->rt_iter
);
297 /* This would benefit from a real atomic operation...
299 static inline uint64_t bgp_table_next_version(struct bgp_table
*table
)
301 return ++table
->version
;
304 static inline uint64_t bgp_table_version(struct bgp_table
*table
)
306 return table
->version
;
309 #endif /* _QUAGGA_BGP_TABLE_H */