]>
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" |
aa57abfb | 27 | #include "typesafe.h" |
c6ffe645 | 28 | #include "linklist.h" |
ec1a4283 | 29 | #include "prefix.h" |
9fd92e3c | 30 | #include "table.h" |
5adc2528 | 31 | #include "queue.h" |
fb018d25 | 32 | #include "nexthop.h" |
7ee30f28 | 33 | #include "nexthop_group.h" |
244a59d2 | 34 | #include "vrf.h" |
fb148af4 | 35 | #include "if.h" |
40c7bdb0 | 36 | #include "mpls.h" |
05737783 | 37 | #include "srcdest_table.h" |
5463ce26 | 38 | #include "zebra/zebra_nhg.h" |
ec1a4283 | 39 | |
51e94aa7 EDP |
40 | #ifdef __cplusplus |
41 | extern "C" { | |
42 | #endif | |
43 | ||
f9215571 | 44 | enum rnh_type { RNH_NEXTHOP_TYPE, RNH_IMPORT_CHECK_TYPE }; |
aa57abfb DS |
45 | |
46 | PREDECL_LIST(rnh_list) | |
47 | ||
48 | /* Nexthop structure. */ | |
49 | struct rnh { | |
50 | uint8_t flags; | |
51 | ||
52 | #define ZEBRA_NHT_CONNECTED 0x1 | |
53 | #define ZEBRA_NHT_DELETED 0x2 | |
54 | #define ZEBRA_NHT_EXACT_MATCH 0x4 | |
55 | ||
56 | /* VRF identifier. */ | |
57 | vrf_id_t vrf_id; | |
58 | ||
59 | afi_t afi; | |
60 | ||
f9215571 | 61 | enum rnh_type type; |
aa57abfb DS |
62 | |
63 | uint32_t seqno; | |
64 | ||
65 | struct route_entry *state; | |
66 | struct prefix resolved_route; | |
67 | struct list *client_list; | |
68 | ||
69 | /* pseudowires dependent on this nh */ | |
70 | struct list *zebra_pseudowire_list; | |
71 | ||
72 | struct route_node *node; | |
73 | ||
74 | /* | |
75 | * if this has been filtered for the client | |
76 | */ | |
77 | int filtered[ZEBRA_ROUTE_MAX]; | |
78 | ||
79 | struct rnh_list_item rnh_list_item; | |
80 | }; | |
81 | ||
718e3744 | 82 | #define DISTANCE_INFINITY 255 |
7a4bb9c5 | 83 | #define ZEBRA_KERNEL_TABLE_MAX 252 /* support for no more than this rt tables */ |
718e3744 | 84 | |
045207e2 DS |
85 | PREDECL_LIST(re_list) |
86 | ||
a29a6001 DS |
87 | struct opaque { |
88 | uint16_t length; | |
89 | uint8_t data[]; | |
90 | }; | |
91 | ||
d62a17ae | 92 | struct route_entry { |
93 | /* Link list. */ | |
045207e2 | 94 | struct re_list_item next; |
d62a17ae | 95 | |
0eb97b86 MS |
96 | /* Nexthop group, shared/refcounted, based on the nexthop(s) |
97 | * provided by the owner of the route | |
98 | */ | |
99 | struct nhg_hash_entry *nhe; | |
d62a17ae | 100 | |
0eb97b86 | 101 | /* Nexthop group from FIB (optional), reflecting what is actually |
4db01e79 MS |
102 | * installed in the FIB if that differs. The 'backup' group is used |
103 | * when backup nexthops are present in the route's nhg. | |
0eb97b86 | 104 | */ |
ee5e8a48 | 105 | struct nexthop_group fib_ng; |
4db01e79 | 106 | struct nexthop_group fib_backup_ng; |
ee5e8a48 | 107 | |
8e766379 SW |
108 | /* Nexthop group hash entry ID */ |
109 | uint32_t nhe_id; | |
f0cb8e16 | 110 | |
d62a17ae | 111 | /* Tag */ |
112 | route_tag_t tag; | |
113 | ||
114 | /* Uptime. */ | |
115 | time_t uptime; | |
116 | ||
1d48702e | 117 | /* Type of this route. */ |
d62a17ae | 118 | int type; |
119 | ||
d62a17ae | 120 | /* VRF identifier. */ |
121 | vrf_id_t vrf_id; | |
122 | ||
123 | /* Which routing table */ | |
124 | uint32_t table; | |
125 | ||
126 | /* Metric */ | |
d7c0a89a | 127 | uint32_t metric; |
d62a17ae | 128 | |
129 | /* MTU */ | |
d7c0a89a QY |
130 | uint32_t mtu; |
131 | uint32_t nexthop_mtu; | |
d62a17ae | 132 | |
d62a17ae | 133 | /* Flags of this route. |
134 | * This flag's definition is in lib/zebra.h ZEBRA_FLAG_* and is exposed | |
135 | * to clients via Zserv | |
136 | */ | |
d7c0a89a | 137 | uint32_t flags; |
d62a17ae | 138 | |
139 | /* RIB internal status */ | |
88f7ea31 | 140 | uint32_t status; |
f0f77c9a | 141 | #define ROUTE_ENTRY_REMOVED 0x1 |
88f7ea31 | 142 | /* The Route Entry has changed */ |
42fc558e | 143 | #define ROUTE_ENTRY_CHANGED 0x2 |
88f7ea31 | 144 | /* The Label has changed on the Route entry */ |
42fc558e | 145 | #define ROUTE_ENTRY_LABELS_CHANGED 0x4 |
88f7ea31 | 146 | /* Route is queued for Installation into the Data Plane */ |
42fc558e | 147 | #define ROUTE_ENTRY_QUEUED 0x8 |
88f7ea31 | 148 | /* Route is installed into the Data Plane */ |
42fc558e | 149 | #define ROUTE_ENTRY_INSTALLED 0x10 |
88f7ea31 | 150 | /* Route has Failed installation into the Data Plane in some manner */ |
42fc558e | 151 | #define ROUTE_ENTRY_FAILED 0x20 |
7483dcbe MS |
152 | /* Route has a 'fib' set of nexthops, probably because the installed set |
153 | * differs from the rib/normal set of nexthops. | |
154 | */ | |
155 | #define ROUTE_ENTRY_USE_FIB_NHG 0x40 | |
6d691129 | 156 | |
7cdb1a84 MS |
157 | /* Sequence value incremented for each dataplane operation */ |
158 | uint32_t dplane_sequence; | |
7a741326 DS |
159 | |
160 | /* Source protocol instance */ | |
161 | uint16_t instance; | |
162 | ||
163 | /* Distance. */ | |
164 | uint8_t distance; | |
a29a6001 DS |
165 | |
166 | struct opaque *opaque; | |
718e3744 | 167 | }; |
168 | ||
66cb1845 | 169 | #define RIB_SYSTEM_ROUTE(R) RSYSTEM_ROUTE((R)->type) |
84340a15 | 170 | |
66cb1845 | 171 | #define RIB_KERNEL_ROUTE(R) RKERNEL_ROUTE((R)->type) |
84340a15 | 172 | |
e96f9203 | 173 | /* meta-queue structure: |
e22e8001 | 174 | * sub-queue 0: nexthop group objects |
c17b2d5b DS |
175 | * sub-queue 1: connected |
176 | * sub-queue 2: kernel | |
177 | * sub-queue 3: static | |
178 | * sub-queue 4: RIP, RIPng, OSPF, OSPF6, IS-IS, EIGRP, NHRP | |
179 | * sub-queue 5: iBGP, eBGP | |
180 | * sub-queue 6: any other origin (if any) typically those that | |
181 | * don't generate routes | |
e96f9203 | 182 | */ |
c17b2d5b | 183 | #define MQ_SIZE 7 |
d62a17ae | 184 | struct meta_queue { |
185 | struct list *subq[MQ_SIZE]; | |
d7c0a89a | 186 | uint32_t size; /* sum of lengths of all subqueues */ |
e96f9203 DO |
187 | }; |
188 | ||
9fd92e3c AS |
189 | /* |
190 | * Structure that represents a single destination (prefix). | |
191 | */ | |
d62a17ae | 192 | typedef struct rib_dest_t_ { |
9fd92e3c | 193 | |
d62a17ae | 194 | /* |
195 | * Back pointer to the route node for this destination. This helps | |
196 | * us get to the prefix that this structure is for. | |
197 | */ | |
198 | struct route_node *rnode; | |
9fd92e3c | 199 | |
d62a17ae | 200 | /* |
201 | * Doubly-linked list of routes for this prefix. | |
202 | */ | |
045207e2 | 203 | struct re_list_head routes; |
9fd92e3c | 204 | |
5f7a4718 DS |
205 | struct route_entry *selected_fib; |
206 | ||
d62a17ae | 207 | /* |
208 | * Flags, see below. | |
209 | */ | |
d7c0a89a | 210 | uint32_t flags; |
9fd92e3c | 211 | |
699dae23 DS |
212 | /* |
213 | * The list of nht prefixes that have ended up | |
214 | * depending on this route node. | |
215 | * After route processing is returned from | |
216 | * the data plane we will run evaluate_rnh | |
217 | * on these prefixes. | |
218 | */ | |
aa57abfb | 219 | struct rnh_list_head nht; |
699dae23 | 220 | |
d62a17ae | 221 | /* |
222 | * Linkage to put dest on the FPM processing queue. | |
223 | */ | |
224 | TAILQ_ENTRY(rib_dest_t_) fpm_q_entries; | |
5adc2528 | 225 | |
9fd92e3c AS |
226 | } rib_dest_t; |
227 | ||
aa57abfb | 228 | DECLARE_LIST(rnh_list, struct rnh, rnh_list_item); |
045207e2 | 229 | DECLARE_LIST(re_list, struct route_entry, next); |
aa57abfb | 230 | |
9fd92e3c | 231 | #define RIB_ROUTE_QUEUED(x) (1 << (x)) |
1ca60f2c | 232 | // If MQ_SIZE is modified this value needs to be updated. |
e22e8001 | 233 | #define RIB_ROUTE_ANY_QUEUED 0x3F |
9fd92e3c AS |
234 | |
235 | /* | |
236 | * The maximum qindex that can be used. | |
237 | */ | |
238 | #define ZEBRA_MAX_QINDEX (MQ_SIZE - 1) | |
239 | ||
5adc2528 AS |
240 | /* |
241 | * This flag indicates that a given prefix has been 'advertised' to | |
242 | * the FPM to be installed in the forwarding plane. | |
243 | */ | |
244 | #define RIB_DEST_SENT_TO_FPM (1 << (ZEBRA_MAX_QINDEX + 1)) | |
245 | ||
246 | /* | |
247 | * This flag is set when we need to send an update to the FPM about a | |
248 | * dest. | |
249 | */ | |
250 | #define RIB_DEST_UPDATE_FPM (1 << (ZEBRA_MAX_QINDEX + 2)) | |
251 | ||
a1494c25 DS |
252 | #define RIB_DEST_UPDATE_LSPS (1 << (ZEBRA_MAX_QINDEX + 3)) |
253 | ||
9fd92e3c AS |
254 | /* |
255 | * Macro to iterate over each route for a destination (prefix). | |
256 | */ | |
d62a17ae | 257 | #define RE_DEST_FOREACH_ROUTE(dest, re) \ |
045207e2 DS |
258 | for ((re) = (dest) ? re_list_first(&((dest)->routes)) : NULL; (re); \ |
259 | (re) = re_list_next(&((dest)->routes), (re))) | |
9fd92e3c AS |
260 | |
261 | /* | |
262 | * Same as above, but allows the current node to be unlinked. | |
263 | */ | |
d62a17ae | 264 | #define RE_DEST_FOREACH_ROUTE_SAFE(dest, re, next) \ |
045207e2 DS |
265 | for ((re) = (dest) ? re_list_first(&((dest)->routes)) : NULL; \ |
266 | (re) && ((next) = re_list_next(&((dest)->routes), (re)), 1); \ | |
267 | (re) = (next)) | |
9fd92e3c | 268 | |
db856683 CS |
269 | #define RE_DEST_FIRST_ROUTE(dest, re) \ |
270 | ((re) = (dest) ? re_list_first(&((dest)->routes)) : NULL) | |
271 | ||
272 | #define RE_DEST_NEXT_ROUTE(dest, re) \ | |
273 | ((re) = (dest) ? re_list_next(&((dest)->routes), (re)) : NULL) | |
274 | ||
d62a17ae | 275 | #define RNODE_FOREACH_RE(rn, re) \ |
996c9314 | 276 | RE_DEST_FOREACH_ROUTE (rib_dest_from_rnode(rn), re) |
9fd92e3c | 277 | |
d62a17ae | 278 | #define RNODE_FOREACH_RE_SAFE(rn, re, next) \ |
996c9314 | 279 | RE_DEST_FOREACH_ROUTE_SAFE (rib_dest_from_rnode(rn), re, next) |
9fd92e3c | 280 | |
db856683 CS |
281 | #define RNODE_FIRST_RE(rn, re) RE_DEST_FIRST_ROUTE(rib_dest_from_rnode(rn), re) |
282 | ||
283 | #define RNODE_NEXT_RE(rn, re) RE_DEST_NEXT_ROUTE(rib_dest_from_rnode(rn), re) | |
284 | ||
d62a17ae | 285 | #if defined(HAVE_RTADV) |
cd80d74f | 286 | /* Structure which hold status of router advertisement. */ |
d62a17ae | 287 | struct rtadv { |
288 | int sock; | |
cd80d74f | 289 | |
d62a17ae | 290 | int adv_if_count; |
291 | int adv_msec_if_count; | |
cd80d74f | 292 | |
d62a17ae | 293 | struct thread *ra_read; |
294 | struct thread *ra_timer; | |
cd80d74f | 295 | }; |
8da4e946 | 296 | #endif /* HAVE_RTADV */ |
cd80d74f | 297 | |
1b5ed1b0 AS |
298 | /* |
299 | * rib_table_info_t | |
300 | * | |
301 | * Structure that is hung off of a route_table that holds information about | |
302 | * the table. | |
303 | */ | |
630d5962 | 304 | struct rib_table_info { |
1b5ed1b0 | 305 | |
d62a17ae | 306 | /* |
307 | * Back pointer to zebra_vrf. | |
308 | */ | |
309 | struct zebra_vrf *zvrf; | |
310 | afi_t afi; | |
311 | safi_t safi; | |
b62983cf | 312 | uint32_t table_id; |
630d5962 | 313 | }; |
1b5ed1b0 | 314 | |
4d5647d0 | 315 | enum rib_tables_iter_state { |
d62a17ae | 316 | RIB_TABLES_ITER_S_INIT, |
317 | RIB_TABLES_ITER_S_ITERATING, | |
318 | RIB_TABLES_ITER_S_DONE | |
4d5647d0 | 319 | }; |
0915bb0c AS |
320 | |
321 | /* | |
322 | * Structure that holds state for iterating over all tables in the | |
323 | * Routing Information Base. | |
324 | */ | |
d62a17ae | 325 | typedef struct rib_tables_iter_t_ { |
326 | vrf_id_t vrf_id; | |
327 | int afi_safi_ix; | |
0915bb0c | 328 | |
4d5647d0 | 329 | enum rib_tables_iter_state state; |
0915bb0c AS |
330 | } rib_tables_iter_t; |
331 | ||
1c848137 | 332 | /* Events/reasons triggering a RIB update. */ |
91e6f25b | 333 | enum rib_update_event { |
2a99ab95 | 334 | RIB_UPDATE_KERNEL, |
d62a17ae | 335 | RIB_UPDATE_RMAP_CHANGE, |
2a99ab95 SW |
336 | RIB_UPDATE_OTHER, |
337 | RIB_UPDATE_MAX | |
91e6f25b | 338 | }; |
1c848137 | 339 | |
d62a17ae | 340 | extern void route_entry_copy_nexthops(struct route_entry *re, |
341 | struct nexthop *nh); | |
cd7108ba EDP |
342 | int route_entry_update_nhe(struct route_entry *re, |
343 | struct nhg_hash_entry *new_nhghe); | |
f0f77c9a | 344 | |
1f655680 | 345 | /* NHG replace has happend, we have to update route_entry pointers to new one */ |
2e8db20d EDP |
346 | void rib_handle_nhg_replace(struct nhg_hash_entry *old_entry, |
347 | struct nhg_hash_entry *new_entry); | |
1f655680 | 348 | |
f0f77c9a | 349 | #define route_entry_dump(prefix, src, re) _route_entry_dump(__func__, prefix, src, re) |
072834ca DS |
350 | extern void _route_entry_dump(const char *func, union prefixconstptr pp, |
351 | union prefixconstptr src_pp, | |
352 | const struct route_entry *re); | |
4623d897 | 353 | |
072834ca DS |
354 | extern void rib_lookup_and_dump(struct prefix_ipv4 *p, vrf_id_t vrf_id); |
355 | extern void rib_lookup_and_pushup(struct prefix_ipv4 *p, vrf_id_t vrf_id); | |
f0f77c9a | 356 | |
dc95824a DO |
357 | #define ZEBRA_RIB_LOOKUP_ERROR -1 |
358 | #define ZEBRA_RIB_FOUND_EXACT 0 | |
359 | #define ZEBRA_RIB_FOUND_NOGATE 1 | |
360 | #define ZEBRA_RIB_FOUND_CONNECTED 2 | |
361 | #define ZEBRA_RIB_NOTFOUND 3 | |
362 | ||
d7c0a89a QY |
363 | extern int is_zebra_valid_kernel_table(uint32_t table_id); |
364 | extern int is_zebra_main_routing_table(uint32_t table_id); | |
86391e56 | 365 | extern int zebra_check_addr(const struct prefix *p); |
718e3744 | 366 | |
d62a17ae | 367 | extern void rib_delnode(struct route_node *rn, struct route_entry *re); |
0c555cc6 DS |
368 | extern void rib_install_kernel(struct route_node *rn, struct route_entry *re, |
369 | struct route_entry *old); | |
370 | extern void rib_uninstall_kernel(struct route_node *rn, struct route_entry *re); | |
28f6dde8 | 371 | |
d24af186 | 372 | /* NOTE: |
b4c034b0 | 373 | * All rib_add function will not just add prefix into RIB, but |
d24af186 | 374 | * also implicitly withdraw equal prefix of same type. */ |
4a7371e9 | 375 | extern int rib_add(afi_t afi, safi_t safi, vrf_id_t vrf_id, int type, |
acde7f6b | 376 | unsigned short instance, uint32_t flags, struct prefix *p, |
fd36be7e | 377 | struct prefix_ipv6 *src_p, const struct nexthop *nh, |
8032b717 SW |
378 | uint32_t nhe_id, uint32_t table_id, uint32_t metric, |
379 | uint32_t mtu, uint8_t distance, route_tag_t tag); | |
1d48702e MS |
380 | /* |
381 | * Multipath route apis. | |
382 | */ | |
072834ca | 383 | extern int rib_add_multipath(afi_t afi, safi_t safi, struct prefix *p, |
0eb97b86 MS |
384 | struct prefix_ipv6 *src_p, struct route_entry *re, |
385 | struct nexthop_group *ng); | |
1d48702e MS |
386 | extern int rib_add_multipath_nhe(afi_t afi, safi_t safi, struct prefix *p, |
387 | struct prefix_ipv6 *src_p, | |
388 | struct route_entry *re, | |
389 | struct nhg_hash_entry *nhe); | |
d62a17ae | 390 | |
391 | extern void rib_delete(afi_t afi, safi_t safi, vrf_id_t vrf_id, int type, | |
acde7f6b DS |
392 | unsigned short instance, uint32_t flags, |
393 | struct prefix *p, struct prefix_ipv6 *src_p, | |
394 | const struct nexthop *nh, uint32_t nhe_id, | |
395 | uint32_t table_id, uint32_t metric, uint8_t distance, | |
3ceae22b | 396 | bool fromkernel); |
d62a17ae | 397 | |
072834ca DS |
398 | extern struct route_entry *rib_match(afi_t afi, safi_t safi, vrf_id_t vrf_id, |
399 | union g_addr *addr, | |
d62a17ae | 400 | struct route_node **rn_out); |
401 | extern struct route_entry *rib_match_ipv4_multicast(vrf_id_t vrf_id, | |
402 | struct in_addr addr, | |
403 | struct route_node **rn_out); | |
404 | ||
072834ca DS |
405 | extern struct route_entry *rib_lookup_ipv4(struct prefix_ipv4 *p, |
406 | vrf_id_t vrf_id); | |
d62a17ae | 407 | |
91e6f25b | 408 | extern void rib_update(enum rib_update_event event); |
d5b8c216 | 409 | extern void rib_update_table(struct route_table *table, |
91e6f25b | 410 | enum rib_update_event event); |
d4644d41 | 411 | extern int rib_sweep_route(struct thread *t); |
072834ca DS |
412 | extern void rib_sweep_table(struct route_table *table); |
413 | extern void rib_close_table(struct route_table *table); | |
d62a17ae | 414 | extern void rib_init(void); |
d7c0a89a QY |
415 | extern unsigned long rib_score_proto(uint8_t proto, unsigned short instance); |
416 | extern unsigned long rib_score_proto_table(uint8_t proto, | |
417 | unsigned short instance, | |
47a08aa9 | 418 | struct route_table *table); |
e22e8001 SW |
419 | |
420 | extern int rib_queue_add(struct route_node *rn); | |
421 | ||
422 | struct nhg_ctx; /* Forward declaration */ | |
423 | ||
424 | extern int rib_queue_nhg_add(struct nhg_ctx *ctx); | |
425 | ||
d62a17ae | 426 | extern void meta_queue_free(struct meta_queue *mq); |
427 | extern int zebra_rib_labeled_unicast(struct route_entry *re); | |
718e3744 | 428 | extern struct route_table *rib_table_ipv6; |
429 | ||
072834ca | 430 | extern void rib_unlink(struct route_node *rn, struct route_entry *re); |
d62a17ae | 431 | extern int rib_gc_dest(struct route_node *rn); |
432 | extern struct route_table *rib_tables_iter_next(rib_tables_iter_t *iter); | |
9fd92e3c | 433 | |
fd289fc8 | 434 | extern uint8_t route_distance(int type); |
40c7bdb0 | 435 | |
699dae23 DS |
436 | extern void zebra_rib_evaluate_rn_nexthops(struct route_node *rn, uint32_t seq); |
437 | ||
9fd92e3c AS |
438 | /* |
439 | * Inline functions. | |
440 | */ | |
441 | ||
1b5ed1b0 AS |
442 | /* |
443 | * rib_table_info | |
444 | */ | |
630d5962 | 445 | static inline struct rib_table_info *rib_table_info(struct route_table *table) |
1b5ed1b0 | 446 | { |
630d5962 | 447 | return (struct rib_table_info *)route_table_get_info(table); |
1b5ed1b0 AS |
448 | } |
449 | ||
9fd92e3c AS |
450 | /* |
451 | * rib_dest_from_rnode | |
452 | */ | |
d62a17ae | 453 | static inline rib_dest_t *rib_dest_from_rnode(struct route_node *rn) |
9fd92e3c | 454 | { |
d62a17ae | 455 | return (rib_dest_t *)rn->info; |
9fd92e3c AS |
456 | } |
457 | ||
458 | /* | |
459 | * rnode_to_ribs | |
460 | * | |
461 | * Returns a pointer to the list of routes corresponding to the given | |
462 | * route_node. | |
463 | */ | |
d62a17ae | 464 | static inline struct route_entry *rnode_to_ribs(struct route_node *rn) |
9fd92e3c | 465 | { |
d62a17ae | 466 | rib_dest_t *dest; |
9fd92e3c | 467 | |
d62a17ae | 468 | dest = rib_dest_from_rnode(rn); |
469 | if (!dest) | |
470 | return NULL; | |
9fd92e3c | 471 | |
045207e2 | 472 | return re_list_first(&dest->routes); |
9fd92e3c AS |
473 | } |
474 | ||
475 | /* | |
476 | * rib_dest_prefix | |
477 | */ | |
d62a17ae | 478 | static inline struct prefix *rib_dest_prefix(rib_dest_t *dest) |
9fd92e3c | 479 | { |
d62a17ae | 480 | return &dest->rnode->p; |
9fd92e3c AS |
481 | } |
482 | ||
483 | /* | |
484 | * rib_dest_af | |
485 | * | |
486 | * Returns the address family that the destination is for. | |
487 | */ | |
d7c0a89a | 488 | static inline uint8_t rib_dest_af(rib_dest_t *dest) |
9fd92e3c | 489 | { |
d62a17ae | 490 | return dest->rnode->p.family; |
9fd92e3c AS |
491 | } |
492 | ||
493 | /* | |
494 | * rib_dest_table | |
495 | */ | |
d62a17ae | 496 | static inline struct route_table *rib_dest_table(rib_dest_t *dest) |
9fd92e3c | 497 | { |
d62a17ae | 498 | return srcdest_rnode_table(dest->rnode); |
9fd92e3c AS |
499 | } |
500 | ||
1b5ed1b0 AS |
501 | /* |
502 | * rib_dest_vrf | |
503 | */ | |
d62a17ae | 504 | static inline struct zebra_vrf *rib_dest_vrf(rib_dest_t *dest) |
1b5ed1b0 | 505 | { |
d62a17ae | 506 | return rib_table_info(rib_dest_table(dest))->zvrf; |
1b5ed1b0 AS |
507 | } |
508 | ||
434434f7 DS |
509 | /* |
510 | * Create the rib_dest_t and attach it to the specified node | |
511 | */ | |
512 | extern rib_dest_t *zebra_rib_create_dest(struct route_node *rn); | |
513 | ||
0915bb0c AS |
514 | /* |
515 | * rib_tables_iter_init | |
516 | */ | |
d62a17ae | 517 | static inline void rib_tables_iter_init(rib_tables_iter_t *iter) |
0915bb0c AS |
518 | |
519 | { | |
d62a17ae | 520 | memset(iter, 0, sizeof(*iter)); |
521 | iter->state = RIB_TABLES_ITER_S_INIT; | |
0915bb0c AS |
522 | } |
523 | ||
524 | /* | |
525 | * rib_tables_iter_started | |
526 | * | |
2951a7a4 | 527 | * Returns true if this iterator has started iterating over the set of |
0915bb0c AS |
528 | * tables. |
529 | */ | |
d62a17ae | 530 | static inline int rib_tables_iter_started(rib_tables_iter_t *iter) |
0915bb0c | 531 | { |
d62a17ae | 532 | return iter->state != RIB_TABLES_ITER_S_INIT; |
0915bb0c AS |
533 | } |
534 | ||
535 | /* | |
536 | * rib_tables_iter_cleanup | |
537 | */ | |
d62a17ae | 538 | static inline void rib_tables_iter_cleanup(rib_tables_iter_t *iter) |
0915bb0c | 539 | { |
d62a17ae | 540 | iter->state = RIB_TABLES_ITER_S_DONE; |
0915bb0c AS |
541 | } |
542 | ||
d62a17ae | 543 | DECLARE_HOOK(rib_update, (struct route_node * rn, const char *reason), |
544 | (rn, reason)) | |
4f8ea50c | 545 | |
ee5e8a48 | 546 | /* |
7483dcbe MS |
547 | * Access installed/fib nexthops, which may be a subset of the |
548 | * rib nexthops. | |
ee5e8a48 | 549 | */ |
4db01e79 | 550 | static inline struct nexthop_group *rib_get_fib_nhg(struct route_entry *re) |
ee5e8a48 | 551 | { |
7483dcbe MS |
552 | /* If the fib set is a subset of the active rib set, |
553 | * use the dedicated fib list. | |
554 | */ | |
555 | if (CHECK_FLAG(re->status, ROUTE_ENTRY_USE_FIB_NHG)) | |
ee5e8a48 MS |
556 | return &(re->fib_ng); |
557 | else | |
c415d895 | 558 | return &(re->nhe->nhg); |
ee5e8a48 | 559 | } |
05f7f5db | 560 | |
4db01e79 | 561 | /* |
7483dcbe MS |
562 | * Access backup nexthop-group that represents the installed backup nexthops; |
563 | * any installed backup will be on the fib list. | |
4db01e79 MS |
564 | */ |
565 | static inline struct nexthop_group *rib_get_fib_backup_nhg( | |
566 | struct route_entry *re) | |
567 | { | |
7483dcbe | 568 | return &(re->fib_backup_ng); |
4db01e79 MS |
569 | } |
570 | ||
05f7f5db | 571 | extern void zebra_vty_init(void); |
4060008b | 572 | |
05f7f5db DS |
573 | extern pid_t pid; |
574 | ||
6b093863 | 575 | extern bool v6_rr_semantics; |
51e94aa7 EDP |
576 | |
577 | #ifdef __cplusplus | |
578 | } | |
579 | #endif | |
580 | ||
718e3744 | 581 | #endif /*_ZEBRA_RIB_H */ |