2 * Routing Information Base header
3 * Copyright (C) 1997 Kunihiro Ishiguro
5 * This file is part of GNU Zebra.
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
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.
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
35 #include "srcdest_table.h"
37 #define DISTANCE_INFINITY 255
38 #define ZEBRA_KERNEL_TABLE_MAX 252 /* support for no more than this rt tables */
42 struct route_entry
*next
;
43 struct route_entry
*prev
;
45 /* Nexthop structure */
46 struct nexthop
*nexthop
;
57 /* Type fo this route. */
60 /* Source protocol instance */
66 /* Which routing table */
74 u_int32_t nexthop_mtu
;
79 /* Flags of this route.
80 * This flag's definition is in lib/zebra.h ZEBRA_FLAG_* and is exposed
81 * to clients via Zserv
85 /* RIB internal status */
87 #define ROUTE_ENTRY_REMOVED 0x1
88 /* to simplify NHT logic when NHs change, instead of doing a NH by NH cmp */
89 #define ROUTE_ENTRY_NEXTHOPS_CHANGED 0x2
90 #define ROUTE_ENTRY_CHANGED 0x4
91 #define ROUTE_ENTRY_SELECTED_FIB 0x8
92 #define ROUTE_ENTRY_LABELS_CHANGED 0x10
94 /* Nexthop information. */
96 u_char nexthop_active_num
;
99 /* meta-queue structure:
100 * sub-queue 0: connected, kernel
101 * sub-queue 1: static
102 * sub-queue 2: RIP, RIPng, OSPF, OSPF6, IS-IS, EIGRP, NHRP
103 * sub-queue 3: iBGP, eBGP
104 * sub-queue 4: any other origin (if any)
108 struct list
*subq
[MQ_SIZE
];
109 u_int32_t size
; /* sum of lengths of all subqueues */
113 * Structure that represents a single destination (prefix).
115 typedef struct rib_dest_t_
{
118 * Back pointer to the route node for this destination. This helps
119 * us get to the prefix that this structure is for.
121 struct route_node
*rnode
;
124 * Doubly-linked list of routes for this prefix.
126 struct route_entry
*routes
;
134 * Linkage to put dest on the FPM processing queue.
136 TAILQ_ENTRY(rib_dest_t_
) fpm_q_entries
;
140 #define RIB_ROUTE_QUEUED(x) (1 << (x))
143 * The maximum qindex that can be used.
145 #define ZEBRA_MAX_QINDEX (MQ_SIZE - 1)
148 * This flag indicates that a given prefix has been 'advertised' to
149 * the FPM to be installed in the forwarding plane.
151 #define RIB_DEST_SENT_TO_FPM (1 << (ZEBRA_MAX_QINDEX + 1))
154 * This flag is set when we need to send an update to the FPM about a
157 #define RIB_DEST_UPDATE_FPM (1 << (ZEBRA_MAX_QINDEX + 2))
160 * Macro to iterate over each route for a destination (prefix).
162 #define RE_DEST_FOREACH_ROUTE(dest, re) \
163 for ((re) = (dest) ? (dest)->routes : NULL; (re); (re) = (re)->next)
166 * Same as above, but allows the current node to be unlinked.
168 #define RE_DEST_FOREACH_ROUTE_SAFE(dest, re, next) \
169 for ((re) = (dest) ? (dest)->routes : NULL; \
170 (re) && ((next) = (re)->next, 1); (re) = (next))
172 #define RNODE_FOREACH_RE(rn, re) \
173 RE_DEST_FOREACH_ROUTE(rib_dest_from_rnode(rn), re)
175 #define RNODE_FOREACH_RE_SAFE(rn, re, next) \
176 RE_DEST_FOREACH_ROUTE_SAFE(rib_dest_from_rnode(rn), re, next)
178 #if defined(HAVE_RTADV)
179 /* Structure which hold status of router advertisement. */
184 int adv_msec_if_count
;
186 struct thread
*ra_read
;
187 struct thread
*ra_timer
;
189 #endif /* HAVE_RTADV */
194 * Structure that is hung off of a route_table that holds information about
197 typedef struct rib_table_info_t_
{
200 * Back pointer to zebra_vrf.
202 struct zebra_vrf
*zvrf
;
209 RIB_TABLES_ITER_S_INIT
,
210 RIB_TABLES_ITER_S_ITERATING
,
211 RIB_TABLES_ITER_S_DONE
212 } rib_tables_iter_state_t
;
215 * Structure that holds state for iterating over all tables in the
216 * Routing Information Base.
218 typedef struct rib_tables_iter_t_
{
222 rib_tables_iter_state_t state
;
225 /* Events/reasons triggering a RIB update. */
227 RIB_UPDATE_IF_CHANGE
,
228 RIB_UPDATE_RMAP_CHANGE
,
230 } rib_update_event_t
;
232 extern struct nexthop
*route_entry_nexthop_ifindex_add(struct route_entry
*,
234 extern struct nexthop
*route_entry_nexthop_blackhole_add(struct route_entry
*,
235 enum blackhole_type
);
236 extern struct nexthop
*route_entry_nexthop_ipv4_add(struct route_entry
*,
239 extern struct nexthop
*
240 route_entry_nexthop_ipv4_ifindex_add(struct route_entry
*, struct in_addr
*,
241 struct in_addr
*, ifindex_t
);
242 extern void route_entry_nexthop_delete(struct route_entry
*re
,
243 struct nexthop
*nexthop
);
244 extern struct nexthop
*route_entry_nexthop_ipv6_add(struct route_entry
*,
246 extern struct nexthop
*
247 route_entry_nexthop_ipv6_ifindex_add(struct route_entry
*re
,
248 struct in6_addr
*ipv6
, ifindex_t ifindex
);
249 extern void route_entry_nexthop_add(struct route_entry
*re
,
250 struct nexthop
*nexthop
);
251 extern void route_entry_copy_nexthops(struct route_entry
*re
,
254 #define route_entry_dump(prefix, src, re) _route_entry_dump(__func__, prefix, src, re)
255 extern void _route_entry_dump(const char *, union prefixconstptr
,
256 union prefixconstptr
, const struct route_entry
*);
257 /* RPF lookup behaviour */
258 enum multicast_mode
{
259 MCAST_NO_CONFIG
= 0, /* MIX_MRIB_FIRST, but no show in config write */
260 MCAST_MRIB_ONLY
, /* MRIB only */
261 MCAST_URIB_ONLY
, /* URIB only */
262 MCAST_MIX_MRIB_FIRST
, /* MRIB, if nothing at all then URIB */
263 MCAST_MIX_DISTANCE
, /* MRIB & URIB, lower distance wins */
264 MCAST_MIX_PFXLEN
, /* MRIB & URIB, longer prefix wins */
265 /* on equal value, MRIB wins for last 2 */
268 extern void multicast_mode_ipv4_set(enum multicast_mode mode
);
269 extern enum multicast_mode
multicast_mode_ipv4_get(void);
271 extern void rib_lookup_and_dump(struct prefix_ipv4
*, vrf_id_t
);
272 extern void rib_lookup_and_pushup(struct prefix_ipv4
*, vrf_id_t
);
274 extern int rib_lookup_ipv4_route(struct prefix_ipv4
*, union sockunion
*,
276 #define ZEBRA_RIB_LOOKUP_ERROR -1
277 #define ZEBRA_RIB_FOUND_EXACT 0
278 #define ZEBRA_RIB_FOUND_NOGATE 1
279 #define ZEBRA_RIB_FOUND_CONNECTED 2
280 #define ZEBRA_RIB_NOTFOUND 3
282 extern int is_zebra_valid_kernel_table(u_int32_t table_id
);
283 extern int is_zebra_main_routing_table(u_int32_t table_id
);
284 extern int zebra_check_addr(struct prefix
*p
);
286 extern void rib_addnode(struct route_node
*rn
, struct route_entry
*re
,
288 extern void rib_delnode(struct route_node
*rn
, struct route_entry
*re
);
289 extern int rib_install_kernel(struct route_node
*rn
, struct route_entry
*re
,
290 struct route_entry
*old
);
291 extern int rib_uninstall_kernel(struct route_node
*rn
, struct route_entry
*re
);
294 * All rib_add function will not just add prefix into RIB, but
295 * also implicitly withdraw equal prefix of same type. */
296 extern int rib_add(afi_t afi
, safi_t safi
, vrf_id_t vrf_id
, int type
,
297 u_short instance
, int flags
, struct prefix
*p
,
298 struct prefix_ipv6
*src_p
, const struct nexthop
*nh
,
299 u_int32_t table_id
, u_int32_t metric
, u_int32_t mtu
,
302 extern int rib_add_multipath(afi_t afi
, safi_t safi
, struct prefix
*,
303 struct prefix_ipv6
*src_p
, struct route_entry
*);
305 extern void rib_delete(afi_t afi
, safi_t safi
, vrf_id_t vrf_id
, int type
,
306 u_short instance
, int flags
, struct prefix
*p
,
307 struct prefix_ipv6
*src_p
, const struct nexthop
*nh
,
308 u_int32_t table_id
, u_int32_t metric
);
310 extern struct route_entry
*rib_match(afi_t afi
, safi_t safi
, vrf_id_t
,
312 struct route_node
**rn_out
);
313 extern struct route_entry
*rib_match_ipv4_multicast(vrf_id_t vrf_id
,
315 struct route_node
**rn_out
);
317 extern struct route_entry
*rib_lookup_ipv4(struct prefix_ipv4
*, vrf_id_t
);
319 extern void rib_update(vrf_id_t
, rib_update_event_t
);
320 extern void rib_weed_tables(void);
321 extern void rib_sweep_route(void);
322 extern void rib_close_table(struct route_table
*);
323 extern void rib_init(void);
324 extern unsigned long rib_score_proto(u_char proto
, u_short instance
);
325 extern void rib_queue_add(struct route_node
*rn
);
326 extern void meta_queue_free(struct meta_queue
*mq
);
327 extern int zebra_rib_labeled_unicast(struct route_entry
*re
);
328 extern struct route_table
*rib_table_ipv6
;
330 extern void rib_unlink(struct route_node
*, struct route_entry
*);
331 extern int rib_gc_dest(struct route_node
*rn
);
332 extern struct route_table
*rib_tables_iter_next(rib_tables_iter_t
*iter
);
334 extern u_char
route_distance(int type
);
343 static inline rib_table_info_t
*rib_table_info(struct route_table
*table
)
345 return (rib_table_info_t
*)table
->info
;
349 * rib_dest_from_rnode
351 static inline rib_dest_t
*rib_dest_from_rnode(struct route_node
*rn
)
353 return (rib_dest_t
*)rn
->info
;
359 * Returns a pointer to the list of routes corresponding to the given
362 static inline struct route_entry
*rnode_to_ribs(struct route_node
*rn
)
366 dest
= rib_dest_from_rnode(rn
);
376 static inline struct prefix
*rib_dest_prefix(rib_dest_t
*dest
)
378 return &dest
->rnode
->p
;
384 * Returns the address family that the destination is for.
386 static inline u_char
rib_dest_af(rib_dest_t
*dest
)
388 return dest
->rnode
->p
.family
;
394 static inline struct route_table
*rib_dest_table(rib_dest_t
*dest
)
396 return srcdest_rnode_table(dest
->rnode
);
402 static inline struct zebra_vrf
*rib_dest_vrf(rib_dest_t
*dest
)
404 return rib_table_info(rib_dest_table(dest
))->zvrf
;
408 * rib_tables_iter_init
410 static inline void rib_tables_iter_init(rib_tables_iter_t
*iter
)
413 memset(iter
, 0, sizeof(*iter
));
414 iter
->state
= RIB_TABLES_ITER_S_INIT
;
418 * rib_tables_iter_started
420 * Returns TRUE if this iterator has started iterating over the set of
423 static inline int rib_tables_iter_started(rib_tables_iter_t
*iter
)
425 return iter
->state
!= RIB_TABLES_ITER_S_INIT
;
429 * rib_tables_iter_cleanup
431 static inline void rib_tables_iter_cleanup(rib_tables_iter_t
*iter
)
433 iter
->state
= RIB_TABLES_ITER_S_DONE
;
436 DECLARE_HOOK(rib_update
, (struct route_node
* rn
, const char *reason
),
439 #endif /*_ZEBRA_RIB_H */