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
30 /* table belongs to this instance */
33 /* afi/safi of this table */
39 struct route_table
*route_table
;
47 * These fields must be the very first fields in this structure.
49 * @see bgp_node_to_rnode
50 * @see bgp_node_from_rnode
54 struct bgp_adj_out
*adj_out
;
56 struct bgp_adj_in
*adj_in
;
60 STAILQ_ENTRY(bgp_node
) pq
;
62 mpls_label_t local_label
;
66 #define BGP_NODE_PROCESS_SCHEDULED (1 << 0)
67 #define BGP_NODE_USER_CLEAR (1 << 1)
68 #define BGP_NODE_LABEL_CHANGED (1 << 2)
69 #define BGP_NODE_REGISTERED_FOR_LABEL (1 << 3)
75 * Structure that holds state for iterating over a bgp table.
77 typedef struct bgp_table_iter_t_
{
78 struct bgp_table
*table
;
79 route_table_iter_t rt_iter
;
82 extern struct bgp_table
*bgp_table_init(struct bgp
*bgp
, afi_t
, safi_t
);
83 extern void bgp_table_lock(struct bgp_table
*);
84 extern void bgp_table_unlock(struct bgp_table
*);
85 extern void bgp_table_finish(struct bgp_table
**);
91 * Returns the bgp_node structure corresponding to a route_node.
93 static inline struct bgp_node
*bgp_node_from_rnode(struct route_node
*rnode
)
95 return (struct bgp_node
*)rnode
;
101 * Returns the route_node structure corresponding to a bgp_node.
103 static inline struct route_node
*bgp_node_to_rnode(struct bgp_node
*node
)
105 return (struct route_node
*)node
;
111 * Returns the bgp_table that the given node is in.
113 static inline struct bgp_table
*bgp_node_table(struct bgp_node
*node
)
115 return bgp_node_to_rnode(node
)->table
->info
;
119 * bgp_node_parent_nolock
121 * Gets the parent node of the given node without locking it.
123 static inline struct bgp_node
*bgp_node_parent_nolock(struct bgp_node
*node
)
125 return bgp_node_from_rnode(node
->parent
);
131 static inline struct bgp_node
*bgp_unlock_node(struct bgp_node
*node
)
133 return (struct bgp_node
*)route_unlock_node(bgp_node_to_rnode(node
));
137 * bgp_table_top_nolock
139 * Gets the top node in the table without locking it.
143 static inline struct bgp_node
*
144 bgp_table_top_nolock(const struct bgp_table
*const table
)
146 return bgp_node_from_rnode(table
->route_table
->top
);
152 static inline struct bgp_node
*
153 bgp_table_top(const struct bgp_table
*const table
)
155 return bgp_node_from_rnode(route_top(table
->route_table
));
161 static inline struct bgp_node
*bgp_route_next(struct bgp_node
*node
)
163 return bgp_node_from_rnode(route_next(bgp_node_to_rnode(node
)));
167 * bgp_route_next_until
169 static inline struct bgp_node
*bgp_route_next_until(struct bgp_node
*node
,
170 struct bgp_node
*limit
)
172 struct route_node
*rnode
;
174 rnode
= route_next_until(bgp_node_to_rnode(node
),
175 bgp_node_to_rnode(limit
));
176 return bgp_node_from_rnode(rnode
);
182 static inline struct bgp_node
*bgp_node_get(struct bgp_table
*const table
,
185 return bgp_node_from_rnode(route_node_get(table
->route_table
, p
));
191 static inline struct bgp_node
*
192 bgp_node_lookup(const struct bgp_table
*const table
, struct prefix
*p
)
194 return bgp_node_from_rnode(route_node_lookup(table
->route_table
, p
));
200 static inline struct bgp_node
*bgp_lock_node(struct bgp_node
*node
)
202 return bgp_node_from_rnode(route_lock_node(bgp_node_to_rnode(node
)));
208 static inline struct bgp_node
*bgp_node_match(const struct bgp_table
*table
,
211 return bgp_node_from_rnode(route_node_match(table
->route_table
, p
));
215 * bgp_node_match_ipv4
217 static inline struct bgp_node
*
218 bgp_node_match_ipv4(const struct bgp_table
*table
, struct in_addr
*addr
)
220 return bgp_node_from_rnode(
221 route_node_match_ipv4(table
->route_table
, addr
));
225 * bgp_node_match_ipv6
227 static inline struct bgp_node
*
228 bgp_node_match_ipv6(const struct bgp_table
*table
, struct in6_addr
*addr
)
230 return bgp_node_from_rnode(
231 route_node_match_ipv6(table
->route_table
, addr
));
234 static inline unsigned long bgp_table_count(const struct bgp_table
*const table
)
236 return route_table_count(table
->route_table
);
242 static inline struct bgp_node
*bgp_table_get_next(const struct bgp_table
*table
,
245 return bgp_node_from_rnode(route_table_get_next(table
->route_table
, p
));
249 * bgp_table_iter_init
251 static inline void bgp_table_iter_init(bgp_table_iter_t
*iter
,
252 struct bgp_table
*table
)
254 bgp_table_lock(table
);
256 route_table_iter_init(&iter
->rt_iter
, table
->route_table
);
260 * bgp_table_iter_next
262 static inline struct bgp_node
*bgp_table_iter_next(bgp_table_iter_t
*iter
)
264 return bgp_node_from_rnode(route_table_iter_next(&iter
->rt_iter
));
268 * bgp_table_iter_cleanup
270 static inline void bgp_table_iter_cleanup(bgp_table_iter_t
*iter
)
272 route_table_iter_cleanup(&iter
->rt_iter
);
273 bgp_table_unlock(iter
->table
);
278 * bgp_table_iter_pause
280 static inline void bgp_table_iter_pause(bgp_table_iter_t
*iter
)
282 route_table_iter_pause(&iter
->rt_iter
);
286 * bgp_table_iter_is_done
288 static inline int bgp_table_iter_is_done(bgp_table_iter_t
*iter
)
290 return route_table_iter_is_done(&iter
->rt_iter
);
294 * bgp_table_iter_started
296 static inline int bgp_table_iter_started(bgp_table_iter_t
*iter
)
298 return route_table_iter_started(&iter
->rt_iter
);
301 /* This would benefit from a real atomic operation...
303 static inline uint64_t bgp_table_next_version(struct bgp_table
*table
)
305 return ++table
->version
;
308 static inline uint64_t bgp_table_version(struct bgp_table
*table
)
310 return table
->version
;
313 void bgp_table_range_lookup(const struct bgp_table
*table
, struct prefix
*p
,
314 uint8_t maxlen
, struct list
*matches
);
316 #endif /* _QUAGGA_BGP_TABLE_H */