]>
Commit | Line | Data |
---|---|---|
718e3744 | 1 | /* |
2 | * Routing Information Base header | |
3 | * Copyright (C) 1997 Kunihiro Ishiguro | |
4 | * | |
5 | * This file is part of GNU Zebra. | |
6 | * | |
7 | * GNU Zebra is free software; you can redistribute it and/or modify it | |
8 | * under the terms of the GNU General Public License as published by the | |
9 | * Free Software Foundation; either version 2, or (at your option) any | |
10 | * later version. | |
11 | * | |
12 | * GNU Zebra is distributed in the hope that it will be useful, but | |
13 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU | |
15 | * General Public License for more details. | |
16 | * | |
896014f4 DL |
17 | * You should have received a copy of the GNU General Public License along |
18 | * with this program; see the file COPYING; if not, write to the Free Software | |
19 | * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA | |
718e3744 | 20 | */ |
21 | ||
22 | #ifndef _ZEBRA_RIB_H | |
23 | #define _ZEBRA_RIB_H | |
24 | ||
dc9ffce8 | 25 | #include "zebra.h" |
4f8ea50c | 26 | #include "hook.h" |
c6ffe645 | 27 | #include "linklist.h" |
ec1a4283 | 28 | #include "prefix.h" |
9fd92e3c | 29 | #include "table.h" |
5adc2528 | 30 | #include "queue.h" |
fb018d25 | 31 | #include "nexthop.h" |
7ee30f28 | 32 | #include "nexthop_group.h" |
244a59d2 | 33 | #include "vrf.h" |
fb148af4 | 34 | #include "if.h" |
40c7bdb0 | 35 | #include "mpls.h" |
05737783 | 36 | #include "srcdest_table.h" |
ec1a4283 | 37 | |
51e94aa7 EDP |
38 | #ifdef __cplusplus |
39 | extern "C" { | |
40 | #endif | |
41 | ||
718e3744 | 42 | #define DISTANCE_INFINITY 255 |
7a4bb9c5 | 43 | #define ZEBRA_KERNEL_TABLE_MAX 252 /* support for no more than this rt tables */ |
718e3744 | 44 | |
d62a17ae | 45 | struct route_entry { |
46 | /* Link list. */ | |
47 | struct route_entry *next; | |
48 | struct route_entry *prev; | |
49 | ||
50 | /* Nexthop structure */ | |
7ee30f28 | 51 | struct nexthop_group ng; |
d62a17ae | 52 | |
d62a17ae | 53 | /* Tag */ |
54 | route_tag_t tag; | |
55 | ||
56 | /* Uptime. */ | |
57 | time_t uptime; | |
58 | ||
59 | /* Type fo this route. */ | |
60 | int type; | |
61 | ||
62 | /* Source protocol instance */ | |
d7c0a89a | 63 | unsigned short instance; |
d62a17ae | 64 | |
65 | /* VRF identifier. */ | |
66 | vrf_id_t vrf_id; | |
67 | ||
68 | /* Which routing table */ | |
69 | uint32_t table; | |
70 | ||
71 | /* Metric */ | |
d7c0a89a | 72 | uint32_t metric; |
d62a17ae | 73 | |
74 | /* MTU */ | |
d7c0a89a QY |
75 | uint32_t mtu; |
76 | uint32_t nexthop_mtu; | |
d62a17ae | 77 | |
78 | /* Distance. */ | |
fd289fc8 | 79 | uint8_t distance; |
d62a17ae | 80 | |
81 | /* Flags of this route. | |
82 | * This flag's definition is in lib/zebra.h ZEBRA_FLAG_* and is exposed | |
83 | * to clients via Zserv | |
84 | */ | |
d7c0a89a | 85 | uint32_t flags; |
d62a17ae | 86 | |
87 | /* RIB internal status */ | |
88f7ea31 | 88 | uint32_t status; |
f0f77c9a | 89 | #define ROUTE_ENTRY_REMOVED 0x1 |
d62a17ae | 90 | /* to simplify NHT logic when NHs change, instead of doing a NH by NH cmp */ |
f0f77c9a | 91 | #define ROUTE_ENTRY_NEXTHOPS_CHANGED 0x2 |
88f7ea31 | 92 | /* The Route Entry has changed */ |
f0f77c9a | 93 | #define ROUTE_ENTRY_CHANGED 0x4 |
88f7ea31 | 94 | /* The Label has changed on the Route entry */ |
5f7a4718 | 95 | #define ROUTE_ENTRY_LABELS_CHANGED 0x8 |
88f7ea31 DS |
96 | /* Route is queued for Installation into the Data Plane */ |
97 | #define ROUTE_ENTRY_QUEUED 0x10 | |
98 | /* Route is installed into the Data Plane */ | |
99 | #define ROUTE_ENTRY_INSTALLED 0x20 | |
100 | /* Route has Failed installation into the Data Plane in some manner */ | |
101 | #define ROUTE_ENTRY_FAILED 0x40 | |
6d691129 | 102 | |
d62a17ae | 103 | /* Nexthop information. */ |
d7c0a89a QY |
104 | uint8_t nexthop_num; |
105 | uint8_t nexthop_active_num; | |
7cdb1a84 MS |
106 | |
107 | /* Sequence value incremented for each dataplane operation */ | |
108 | uint32_t dplane_sequence; | |
718e3744 | 109 | }; |
110 | ||
e96f9203 DO |
111 | /* meta-queue structure: |
112 | * sub-queue 0: connected, kernel | |
113 | * sub-queue 1: static | |
43cf4ba4 | 114 | * sub-queue 2: RIP, RIPng, OSPF, OSPF6, IS-IS, EIGRP, NHRP |
e96f9203 DO |
115 | * sub-queue 3: iBGP, eBGP |
116 | * sub-queue 4: any other origin (if any) | |
117 | */ | |
118 | #define MQ_SIZE 5 | |
d62a17ae | 119 | struct meta_queue { |
120 | struct list *subq[MQ_SIZE]; | |
d7c0a89a | 121 | uint32_t size; /* sum of lengths of all subqueues */ |
e96f9203 DO |
122 | }; |
123 | ||
9fd92e3c AS |
124 | /* |
125 | * Structure that represents a single destination (prefix). | |
126 | */ | |
d62a17ae | 127 | typedef struct rib_dest_t_ { |
9fd92e3c | 128 | |
d62a17ae | 129 | /* |
130 | * Back pointer to the route node for this destination. This helps | |
131 | * us get to the prefix that this structure is for. | |
132 | */ | |
133 | struct route_node *rnode; | |
9fd92e3c | 134 | |
d62a17ae | 135 | /* |
136 | * Doubly-linked list of routes for this prefix. | |
137 | */ | |
138 | struct route_entry *routes; | |
9fd92e3c | 139 | |
5f7a4718 DS |
140 | struct route_entry *selected_fib; |
141 | ||
d62a17ae | 142 | /* |
143 | * Flags, see below. | |
144 | */ | |
d7c0a89a | 145 | uint32_t flags; |
9fd92e3c | 146 | |
699dae23 DS |
147 | /* |
148 | * The list of nht prefixes that have ended up | |
149 | * depending on this route node. | |
150 | * After route processing is returned from | |
151 | * the data plane we will run evaluate_rnh | |
152 | * on these prefixes. | |
153 | */ | |
154 | struct list *nht; | |
155 | ||
d62a17ae | 156 | /* |
157 | * Linkage to put dest on the FPM processing queue. | |
158 | */ | |
159 | TAILQ_ENTRY(rib_dest_t_) fpm_q_entries; | |
5adc2528 | 160 | |
9fd92e3c AS |
161 | } rib_dest_t; |
162 | ||
163 | #define RIB_ROUTE_QUEUED(x) (1 << (x)) | |
1ca60f2c DS |
164 | // If MQ_SIZE is modified this value needs to be updated. |
165 | #define RIB_ROUTE_ANY_QUEUED 0x1F | |
9fd92e3c AS |
166 | |
167 | /* | |
168 | * The maximum qindex that can be used. | |
169 | */ | |
170 | #define ZEBRA_MAX_QINDEX (MQ_SIZE - 1) | |
171 | ||
5adc2528 AS |
172 | /* |
173 | * This flag indicates that a given prefix has been 'advertised' to | |
174 | * the FPM to be installed in the forwarding plane. | |
175 | */ | |
176 | #define RIB_DEST_SENT_TO_FPM (1 << (ZEBRA_MAX_QINDEX + 1)) | |
177 | ||
178 | /* | |
179 | * This flag is set when we need to send an update to the FPM about a | |
180 | * dest. | |
181 | */ | |
182 | #define RIB_DEST_UPDATE_FPM (1 << (ZEBRA_MAX_QINDEX + 2)) | |
183 | ||
9fd92e3c AS |
184 | /* |
185 | * Macro to iterate over each route for a destination (prefix). | |
186 | */ | |
d62a17ae | 187 | #define RE_DEST_FOREACH_ROUTE(dest, re) \ |
188 | for ((re) = (dest) ? (dest)->routes : NULL; (re); (re) = (re)->next) | |
9fd92e3c AS |
189 | |
190 | /* | |
191 | * Same as above, but allows the current node to be unlinked. | |
192 | */ | |
d62a17ae | 193 | #define RE_DEST_FOREACH_ROUTE_SAFE(dest, re, next) \ |
194 | for ((re) = (dest) ? (dest)->routes : NULL; \ | |
195 | (re) && ((next) = (re)->next, 1); (re) = (next)) | |
9fd92e3c | 196 | |
d62a17ae | 197 | #define RNODE_FOREACH_RE(rn, re) \ |
996c9314 | 198 | RE_DEST_FOREACH_ROUTE (rib_dest_from_rnode(rn), re) |
9fd92e3c | 199 | |
d62a17ae | 200 | #define RNODE_FOREACH_RE_SAFE(rn, re, next) \ |
996c9314 | 201 | RE_DEST_FOREACH_ROUTE_SAFE (rib_dest_from_rnode(rn), re, next) |
9fd92e3c | 202 | |
d62a17ae | 203 | #if defined(HAVE_RTADV) |
cd80d74f | 204 | /* Structure which hold status of router advertisement. */ |
d62a17ae | 205 | struct rtadv { |
206 | int sock; | |
cd80d74f | 207 | |
d62a17ae | 208 | int adv_if_count; |
209 | int adv_msec_if_count; | |
cd80d74f | 210 | |
d62a17ae | 211 | struct thread *ra_read; |
212 | struct thread *ra_timer; | |
cd80d74f | 213 | }; |
8da4e946 | 214 | #endif /* HAVE_RTADV */ |
cd80d74f | 215 | |
1b5ed1b0 AS |
216 | /* |
217 | * rib_table_info_t | |
218 | * | |
219 | * Structure that is hung off of a route_table that holds information about | |
220 | * the table. | |
221 | */ | |
d62a17ae | 222 | typedef struct rib_table_info_t_ { |
1b5ed1b0 | 223 | |
d62a17ae | 224 | /* |
225 | * Back pointer to zebra_vrf. | |
226 | */ | |
227 | struct zebra_vrf *zvrf; | |
228 | afi_t afi; | |
229 | safi_t safi; | |
1b5ed1b0 AS |
230 | |
231 | } rib_table_info_t; | |
232 | ||
d62a17ae | 233 | typedef enum { |
234 | RIB_TABLES_ITER_S_INIT, | |
235 | RIB_TABLES_ITER_S_ITERATING, | |
236 | RIB_TABLES_ITER_S_DONE | |
0915bb0c AS |
237 | } rib_tables_iter_state_t; |
238 | ||
239 | /* | |
240 | * Structure that holds state for iterating over all tables in the | |
241 | * Routing Information Base. | |
242 | */ | |
d62a17ae | 243 | typedef struct rib_tables_iter_t_ { |
244 | vrf_id_t vrf_id; | |
245 | int afi_safi_ix; | |
0915bb0c | 246 | |
d62a17ae | 247 | rib_tables_iter_state_t state; |
0915bb0c AS |
248 | } rib_tables_iter_t; |
249 | ||
1c848137 | 250 | /* Events/reasons triggering a RIB update. */ |
d62a17ae | 251 | typedef enum { |
252 | RIB_UPDATE_IF_CHANGE, | |
253 | RIB_UPDATE_RMAP_CHANGE, | |
254 | RIB_UPDATE_OTHER | |
1c848137 | 255 | } rib_update_event_t; |
256 | ||
072834ca DS |
257 | extern struct nexthop *route_entry_nexthop_ifindex_add(struct route_entry *re, |
258 | ifindex_t ifindex, | |
4a7371e9 | 259 | vrf_id_t nh_vrf_id); |
072834ca DS |
260 | extern struct nexthop * |
261 | route_entry_nexthop_blackhole_add(struct route_entry *re, | |
262 | enum blackhole_type bh_type); | |
263 | extern struct nexthop *route_entry_nexthop_ipv4_add(struct route_entry *re, | |
264 | struct in_addr *ipv4, | |
265 | struct in_addr *src, | |
4a7371e9 | 266 | vrf_id_t nh_vrf_id); |
d62a17ae | 267 | extern struct nexthop * |
072834ca DS |
268 | route_entry_nexthop_ipv4_ifindex_add(struct route_entry *re, |
269 | struct in_addr *ipv4, struct in_addr *src, | |
270 | ifindex_t ifindex, vrf_id_t nh_vrf_id); | |
d62a17ae | 271 | extern void route_entry_nexthop_delete(struct route_entry *re, |
272 | struct nexthop *nexthop); | |
072834ca DS |
273 | extern struct nexthop *route_entry_nexthop_ipv6_add(struct route_entry *re, |
274 | struct in6_addr *ipv6, | |
4a7371e9 | 275 | vrf_id_t nh_vrf_id); |
d62a17ae | 276 | extern struct nexthop * |
277 | route_entry_nexthop_ipv6_ifindex_add(struct route_entry *re, | |
4a7371e9 DS |
278 | struct in6_addr *ipv6, ifindex_t ifindex, |
279 | vrf_id_t nh_vrf_id); | |
d62a17ae | 280 | extern void route_entry_nexthop_add(struct route_entry *re, |
281 | struct nexthop *nexthop); | |
282 | extern void route_entry_copy_nexthops(struct route_entry *re, | |
283 | struct nexthop *nh); | |
f0f77c9a DS |
284 | |
285 | #define route_entry_dump(prefix, src, re) _route_entry_dump(__func__, prefix, src, re) | |
072834ca DS |
286 | extern void _route_entry_dump(const char *func, union prefixconstptr pp, |
287 | union prefixconstptr src_pp, | |
288 | const struct route_entry *re); | |
4623d897 | 289 | /* RPF lookup behaviour */ |
d62a17ae | 290 | enum multicast_mode { |
291 | MCAST_NO_CONFIG = 0, /* MIX_MRIB_FIRST, but no show in config write */ | |
292 | MCAST_MRIB_ONLY, /* MRIB only */ | |
293 | MCAST_URIB_ONLY, /* URIB only */ | |
294 | MCAST_MIX_MRIB_FIRST, /* MRIB, if nothing at all then URIB */ | |
295 | MCAST_MIX_DISTANCE, /* MRIB & URIB, lower distance wins */ | |
296 | MCAST_MIX_PFXLEN, /* MRIB & URIB, longer prefix wins */ | |
297 | /* on equal value, MRIB wins for last 2 */ | |
4623d897 DL |
298 | }; |
299 | ||
d62a17ae | 300 | extern void multicast_mode_ipv4_set(enum multicast_mode mode); |
301 | extern enum multicast_mode multicast_mode_ipv4_get(void); | |
4623d897 | 302 | |
072834ca DS |
303 | extern void rib_lookup_and_dump(struct prefix_ipv4 *p, vrf_id_t vrf_id); |
304 | extern void rib_lookup_and_pushup(struct prefix_ipv4 *p, vrf_id_t vrf_id); | |
f0f77c9a | 305 | |
dc95824a DO |
306 | #define ZEBRA_RIB_LOOKUP_ERROR -1 |
307 | #define ZEBRA_RIB_FOUND_EXACT 0 | |
308 | #define ZEBRA_RIB_FOUND_NOGATE 1 | |
309 | #define ZEBRA_RIB_FOUND_CONNECTED 2 | |
310 | #define ZEBRA_RIB_NOTFOUND 3 | |
311 | ||
d7c0a89a QY |
312 | extern int is_zebra_valid_kernel_table(uint32_t table_id); |
313 | extern int is_zebra_main_routing_table(uint32_t table_id); | |
86391e56 | 314 | extern int zebra_check_addr(const struct prefix *p); |
718e3744 | 315 | |
d62a17ae | 316 | extern void rib_delnode(struct route_node *rn, struct route_entry *re); |
0c555cc6 DS |
317 | extern void rib_install_kernel(struct route_node *rn, struct route_entry *re, |
318 | struct route_entry *old); | |
319 | extern void rib_uninstall_kernel(struct route_node *rn, struct route_entry *re); | |
28f6dde8 | 320 | |
d24af186 | 321 | /* NOTE: |
b4c034b0 | 322 | * All rib_add function will not just add prefix into RIB, but |
d24af186 | 323 | * also implicitly withdraw equal prefix of same type. */ |
4a7371e9 | 324 | extern int rib_add(afi_t afi, safi_t safi, vrf_id_t vrf_id, int type, |
d7c0a89a | 325 | unsigned short instance, int flags, struct prefix *p, |
fd36be7e | 326 | struct prefix_ipv6 *src_p, const struct nexthop *nh, |
d7c0a89a | 327 | uint32_t table_id, uint32_t metric, uint32_t mtu, |
4e40b6d6 | 328 | uint8_t distance, route_tag_t tag); |
d62a17ae | 329 | |
072834ca DS |
330 | extern int rib_add_multipath(afi_t afi, safi_t safi, struct prefix *p, |
331 | struct prefix_ipv6 *src_p, struct route_entry *re); | |
d62a17ae | 332 | |
333 | extern void rib_delete(afi_t afi, safi_t safi, vrf_id_t vrf_id, int type, | |
d7c0a89a | 334 | unsigned short instance, int flags, struct prefix *p, |
fd36be7e | 335 | struct prefix_ipv6 *src_p, const struct nexthop *nh, |
40ecd8e4 DS |
336 | uint32_t table_id, uint32_t metric, uint8_t distance, |
337 | bool fromkernel); | |
d62a17ae | 338 | |
072834ca DS |
339 | extern struct route_entry *rib_match(afi_t afi, safi_t safi, vrf_id_t vrf_id, |
340 | union g_addr *addr, | |
d62a17ae | 341 | struct route_node **rn_out); |
342 | extern struct route_entry *rib_match_ipv4_multicast(vrf_id_t vrf_id, | |
343 | struct in_addr addr, | |
344 | struct route_node **rn_out); | |
345 | ||
072834ca DS |
346 | extern struct route_entry *rib_lookup_ipv4(struct prefix_ipv4 *p, |
347 | vrf_id_t vrf_id); | |
d62a17ae | 348 | |
072834ca | 349 | extern void rib_update(vrf_id_t vrf_id, rib_update_event_t event); |
d5b8c216 | 350 | extern void rib_update_table(struct route_table *table, |
351 | rib_update_event_t event); | |
d62a17ae | 352 | extern void rib_sweep_route(void); |
072834ca DS |
353 | extern void rib_sweep_table(struct route_table *table); |
354 | extern void rib_close_table(struct route_table *table); | |
d62a17ae | 355 | extern void rib_init(void); |
d7c0a89a QY |
356 | extern unsigned long rib_score_proto(uint8_t proto, unsigned short instance); |
357 | extern unsigned long rib_score_proto_table(uint8_t proto, | |
358 | unsigned short instance, | |
47a08aa9 | 359 | struct route_table *table); |
d62a17ae | 360 | extern void rib_queue_add(struct route_node *rn); |
361 | extern void meta_queue_free(struct meta_queue *mq); | |
362 | extern int zebra_rib_labeled_unicast(struct route_entry *re); | |
718e3744 | 363 | extern struct route_table *rib_table_ipv6; |
364 | ||
072834ca | 365 | extern void rib_unlink(struct route_node *rn, struct route_entry *re); |
d62a17ae | 366 | extern int rib_gc_dest(struct route_node *rn); |
367 | extern struct route_table *rib_tables_iter_next(rib_tables_iter_t *iter); | |
9fd92e3c | 368 | |
fd289fc8 | 369 | extern uint8_t route_distance(int type); |
40c7bdb0 | 370 | |
699dae23 DS |
371 | extern void zebra_rib_evaluate_rn_nexthops(struct route_node *rn, uint32_t seq); |
372 | ||
9fd92e3c AS |
373 | /* |
374 | * Inline functions. | |
375 | */ | |
376 | ||
1b5ed1b0 AS |
377 | /* |
378 | * rib_table_info | |
379 | */ | |
d62a17ae | 380 | static inline rib_table_info_t *rib_table_info(struct route_table *table) |
1b5ed1b0 | 381 | { |
6ca30e9e | 382 | return (rib_table_info_t *)route_table_get_info(table); |
1b5ed1b0 AS |
383 | } |
384 | ||
9fd92e3c AS |
385 | /* |
386 | * rib_dest_from_rnode | |
387 | */ | |
d62a17ae | 388 | static inline rib_dest_t *rib_dest_from_rnode(struct route_node *rn) |
9fd92e3c | 389 | { |
d62a17ae | 390 | return (rib_dest_t *)rn->info; |
9fd92e3c AS |
391 | } |
392 | ||
393 | /* | |
394 | * rnode_to_ribs | |
395 | * | |
396 | * Returns a pointer to the list of routes corresponding to the given | |
397 | * route_node. | |
398 | */ | |
d62a17ae | 399 | static inline struct route_entry *rnode_to_ribs(struct route_node *rn) |
9fd92e3c | 400 | { |
d62a17ae | 401 | rib_dest_t *dest; |
9fd92e3c | 402 | |
d62a17ae | 403 | dest = rib_dest_from_rnode(rn); |
404 | if (!dest) | |
405 | return NULL; | |
9fd92e3c | 406 | |
d62a17ae | 407 | return dest->routes; |
9fd92e3c AS |
408 | } |
409 | ||
410 | /* | |
411 | * rib_dest_prefix | |
412 | */ | |
d62a17ae | 413 | static inline struct prefix *rib_dest_prefix(rib_dest_t *dest) |
9fd92e3c | 414 | { |
d62a17ae | 415 | return &dest->rnode->p; |
9fd92e3c AS |
416 | } |
417 | ||
418 | /* | |
419 | * rib_dest_af | |
420 | * | |
421 | * Returns the address family that the destination is for. | |
422 | */ | |
d7c0a89a | 423 | static inline uint8_t rib_dest_af(rib_dest_t *dest) |
9fd92e3c | 424 | { |
d62a17ae | 425 | return dest->rnode->p.family; |
9fd92e3c AS |
426 | } |
427 | ||
428 | /* | |
429 | * rib_dest_table | |
430 | */ | |
d62a17ae | 431 | static inline struct route_table *rib_dest_table(rib_dest_t *dest) |
9fd92e3c | 432 | { |
d62a17ae | 433 | return srcdest_rnode_table(dest->rnode); |
9fd92e3c AS |
434 | } |
435 | ||
1b5ed1b0 AS |
436 | /* |
437 | * rib_dest_vrf | |
438 | */ | |
d62a17ae | 439 | static inline struct zebra_vrf *rib_dest_vrf(rib_dest_t *dest) |
1b5ed1b0 | 440 | { |
d62a17ae | 441 | return rib_table_info(rib_dest_table(dest))->zvrf; |
1b5ed1b0 AS |
442 | } |
443 | ||
434434f7 DS |
444 | /* |
445 | * Create the rib_dest_t and attach it to the specified node | |
446 | */ | |
447 | extern rib_dest_t *zebra_rib_create_dest(struct route_node *rn); | |
448 | ||
0915bb0c AS |
449 | /* |
450 | * rib_tables_iter_init | |
451 | */ | |
d62a17ae | 452 | static inline void rib_tables_iter_init(rib_tables_iter_t *iter) |
0915bb0c AS |
453 | |
454 | { | |
d62a17ae | 455 | memset(iter, 0, sizeof(*iter)); |
456 | iter->state = RIB_TABLES_ITER_S_INIT; | |
0915bb0c AS |
457 | } |
458 | ||
459 | /* | |
460 | * rib_tables_iter_started | |
461 | * | |
462 | * Returns TRUE if this iterator has started iterating over the set of | |
463 | * tables. | |
464 | */ | |
d62a17ae | 465 | static inline int rib_tables_iter_started(rib_tables_iter_t *iter) |
0915bb0c | 466 | { |
d62a17ae | 467 | return iter->state != RIB_TABLES_ITER_S_INIT; |
0915bb0c AS |
468 | } |
469 | ||
470 | /* | |
471 | * rib_tables_iter_cleanup | |
472 | */ | |
d62a17ae | 473 | static inline void rib_tables_iter_cleanup(rib_tables_iter_t *iter) |
0915bb0c | 474 | { |
d62a17ae | 475 | iter->state = RIB_TABLES_ITER_S_DONE; |
0915bb0c AS |
476 | } |
477 | ||
d62a17ae | 478 | DECLARE_HOOK(rib_update, (struct route_node * rn, const char *reason), |
479 | (rn, reason)) | |
4f8ea50c | 480 | |
05f7f5db DS |
481 | |
482 | extern void zebra_vty_init(void); | |
4060008b | 483 | |
05f7f5db DS |
484 | extern pid_t pid; |
485 | ||
6b093863 | 486 | extern bool v6_rr_semantics; |
51e94aa7 EDP |
487 | |
488 | #ifdef __cplusplus | |
489 | } | |
490 | #endif | |
491 | ||
718e3744 | 492 | #endif /*_ZEBRA_RIB_H */ |