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
;
54 /* Type fo this route. */
57 /* Source protocol instance */
63 /* Which routing table */
71 u_int32_t nexthop_mtu
;
76 /* Flags of this route.
77 * This flag's definition is in lib/zebra.h ZEBRA_FLAG_* and is exposed
78 * to clients via Zserv
82 /* RIB internal status */
84 #define ROUTE_ENTRY_REMOVED 0x1
85 /* to simplify NHT logic when NHs change, instead of doing a NH by NH cmp */
86 #define ROUTE_ENTRY_NEXTHOPS_CHANGED 0x2
87 #define ROUTE_ENTRY_CHANGED 0x4
88 #define ROUTE_ENTRY_SELECTED_FIB 0x8
89 #define ROUTE_ENTRY_LABELS_CHANGED 0x10
91 /* Nexthop information. */
93 u_char nexthop_active_num
;
96 /* meta-queue structure:
97 * sub-queue 0: connected, kernel
99 * sub-queue 2: RIP, RIPng, OSPF, OSPF6, IS-IS, EIGRP, NHRP
100 * sub-queue 3: iBGP, eBGP
101 * sub-queue 4: any other origin (if any)
105 struct list
*subq
[MQ_SIZE
];
106 u_int32_t size
; /* sum of lengths of all subqueues */
110 * Structure that represents a single destination (prefix).
112 typedef struct rib_dest_t_
{
115 * Back pointer to the route node for this destination. This helps
116 * us get to the prefix that this structure is for.
118 struct route_node
*rnode
;
121 * Doubly-linked list of routes for this prefix.
123 struct route_entry
*routes
;
131 * Linkage to put dest on the FPM processing queue.
133 TAILQ_ENTRY(rib_dest_t_
) fpm_q_entries
;
137 #define RIB_ROUTE_QUEUED(x) (1 << (x))
140 * The maximum qindex that can be used.
142 #define ZEBRA_MAX_QINDEX (MQ_SIZE - 1)
145 * This flag indicates that a given prefix has been 'advertised' to
146 * the FPM to be installed in the forwarding plane.
148 #define RIB_DEST_SENT_TO_FPM (1 << (ZEBRA_MAX_QINDEX + 1))
151 * This flag is set when we need to send an update to the FPM about a
154 #define RIB_DEST_UPDATE_FPM (1 << (ZEBRA_MAX_QINDEX + 2))
157 * Macro to iterate over each route for a destination (prefix).
159 #define RE_DEST_FOREACH_ROUTE(dest, re) \
160 for ((re) = (dest) ? (dest)->routes : NULL; (re); (re) = (re)->next)
163 * Same as above, but allows the current node to be unlinked.
165 #define RE_DEST_FOREACH_ROUTE_SAFE(dest, re, next) \
166 for ((re) = (dest) ? (dest)->routes : NULL; \
167 (re) && ((next) = (re)->next, 1); (re) = (next))
169 #define RNODE_FOREACH_RE(rn, re) \
170 RE_DEST_FOREACH_ROUTE(rib_dest_from_rnode(rn), re)
172 #define RNODE_FOREACH_RE_SAFE(rn, re, next) \
173 RE_DEST_FOREACH_ROUTE_SAFE(rib_dest_from_rnode(rn), re, next)
175 #if defined(HAVE_RTADV)
176 /* Structure which hold status of router advertisement. */
181 int adv_msec_if_count
;
183 struct thread
*ra_read
;
184 struct thread
*ra_timer
;
186 #endif /* HAVE_RTADV */
191 * Structure that is hung off of a route_table that holds information about
194 typedef struct rib_table_info_t_
{
197 * Back pointer to zebra_vrf.
199 struct zebra_vrf
*zvrf
;
206 RIB_TABLES_ITER_S_INIT
,
207 RIB_TABLES_ITER_S_ITERATING
,
208 RIB_TABLES_ITER_S_DONE
209 } rib_tables_iter_state_t
;
212 * Structure that holds state for iterating over all tables in the
213 * Routing Information Base.
215 typedef struct rib_tables_iter_t_
{
219 rib_tables_iter_state_t state
;
222 /* Events/reasons triggering a RIB update. */
224 RIB_UPDATE_IF_CHANGE
,
225 RIB_UPDATE_RMAP_CHANGE
,
227 } rib_update_event_t
;
229 extern struct nexthop
*route_entry_nexthop_ifindex_add(struct route_entry
*,
231 extern struct nexthop
*route_entry_nexthop_blackhole_add(struct route_entry
*,
232 enum blackhole_type
);
233 extern struct nexthop
*route_entry_nexthop_ipv4_add(struct route_entry
*,
236 extern struct nexthop
*
237 route_entry_nexthop_ipv4_ifindex_add(struct route_entry
*, struct in_addr
*,
238 struct in_addr
*, ifindex_t
);
239 extern void route_entry_nexthop_delete(struct route_entry
*re
,
240 struct nexthop
*nexthop
);
241 extern struct nexthop
*route_entry_nexthop_ipv6_add(struct route_entry
*,
243 extern struct nexthop
*
244 route_entry_nexthop_ipv6_ifindex_add(struct route_entry
*re
,
245 struct in6_addr
*ipv6
, ifindex_t ifindex
);
246 extern void route_entry_nexthop_add(struct route_entry
*re
,
247 struct nexthop
*nexthop
);
248 extern void route_entry_copy_nexthops(struct route_entry
*re
,
251 #define route_entry_dump(prefix, src, re) _route_entry_dump(__func__, prefix, src, re)
252 extern void _route_entry_dump(const char *, union prefixconstptr
,
253 union prefixconstptr
, const struct route_entry
*);
254 /* RPF lookup behaviour */
255 enum multicast_mode
{
256 MCAST_NO_CONFIG
= 0, /* MIX_MRIB_FIRST, but no show in config write */
257 MCAST_MRIB_ONLY
, /* MRIB only */
258 MCAST_URIB_ONLY
, /* URIB only */
259 MCAST_MIX_MRIB_FIRST
, /* MRIB, if nothing at all then URIB */
260 MCAST_MIX_DISTANCE
, /* MRIB & URIB, lower distance wins */
261 MCAST_MIX_PFXLEN
, /* MRIB & URIB, longer prefix wins */
262 /* on equal value, MRIB wins for last 2 */
265 extern void multicast_mode_ipv4_set(enum multicast_mode mode
);
266 extern enum multicast_mode
multicast_mode_ipv4_get(void);
268 extern void rib_lookup_and_dump(struct prefix_ipv4
*, vrf_id_t
);
269 extern void rib_lookup_and_pushup(struct prefix_ipv4
*, vrf_id_t
);
271 extern int rib_lookup_ipv4_route(struct prefix_ipv4
*, union sockunion
*,
273 #define ZEBRA_RIB_LOOKUP_ERROR -1
274 #define ZEBRA_RIB_FOUND_EXACT 0
275 #define ZEBRA_RIB_FOUND_NOGATE 1
276 #define ZEBRA_RIB_FOUND_CONNECTED 2
277 #define ZEBRA_RIB_NOTFOUND 3
279 extern int is_zebra_valid_kernel_table(u_int32_t table_id
);
280 extern int is_zebra_main_routing_table(u_int32_t table_id
);
281 extern int zebra_check_addr(struct prefix
*p
);
283 extern void rib_addnode(struct route_node
*rn
, struct route_entry
*re
,
285 extern void rib_delnode(struct route_node
*rn
, struct route_entry
*re
);
286 extern int rib_install_kernel(struct route_node
*rn
, struct route_entry
*re
,
287 struct route_entry
*old
);
288 extern int rib_uninstall_kernel(struct route_node
*rn
, struct route_entry
*re
);
291 * All rib_add function will not just add prefix into RIB, but
292 * also implicitly withdraw equal prefix of same type. */
293 extern int rib_add(afi_t afi
, safi_t safi
, vrf_id_t vrf_id
, int type
,
294 u_short instance
, int flags
, struct prefix
*p
,
295 struct prefix_ipv6
*src_p
, const struct nexthop
*nh
,
296 u_int32_t table_id
, u_int32_t metric
, u_int32_t mtu
,
299 extern int rib_add_multipath(afi_t afi
, safi_t safi
, struct prefix
*,
300 struct prefix_ipv6
*src_p
, struct route_entry
*);
302 extern void rib_delete(afi_t afi
, safi_t safi
, vrf_id_t vrf_id
, int type
,
303 u_short instance
, int flags
, struct prefix
*p
,
304 struct prefix_ipv6
*src_p
, const struct nexthop
*nh
,
305 u_int32_t table_id
, u_int32_t metric
);
307 extern struct route_entry
*rib_match(afi_t afi
, safi_t safi
, vrf_id_t
,
309 struct route_node
**rn_out
);
310 extern struct route_entry
*rib_match_ipv4_multicast(vrf_id_t vrf_id
,
312 struct route_node
**rn_out
);
314 extern struct route_entry
*rib_lookup_ipv4(struct prefix_ipv4
*, vrf_id_t
);
316 extern void rib_update(vrf_id_t
, rib_update_event_t
);
317 extern void rib_weed_tables(void);
318 extern void rib_sweep_route(void);
319 extern void rib_close_table(struct route_table
*);
320 extern void rib_init(void);
321 extern unsigned long rib_score_proto(u_char proto
, u_short instance
);
322 extern void rib_queue_add(struct route_node
*rn
);
323 extern void meta_queue_free(struct meta_queue
*mq
);
324 extern int zebra_rib_labeled_unicast(struct route_entry
*re
);
325 extern struct route_table
*rib_table_ipv6
;
327 extern void rib_unlink(struct route_node
*, struct route_entry
*);
328 extern int rib_gc_dest(struct route_node
*rn
);
329 extern struct route_table
*rib_tables_iter_next(rib_tables_iter_t
*iter
);
331 extern u_char
route_distance(int type
);
340 static inline rib_table_info_t
*rib_table_info(struct route_table
*table
)
342 return (rib_table_info_t
*)table
->info
;
346 * rib_dest_from_rnode
348 static inline rib_dest_t
*rib_dest_from_rnode(struct route_node
*rn
)
350 return (rib_dest_t
*)rn
->info
;
356 * Returns a pointer to the list of routes corresponding to the given
359 static inline struct route_entry
*rnode_to_ribs(struct route_node
*rn
)
363 dest
= rib_dest_from_rnode(rn
);
373 static inline struct prefix
*rib_dest_prefix(rib_dest_t
*dest
)
375 return &dest
->rnode
->p
;
381 * Returns the address family that the destination is for.
383 static inline u_char
rib_dest_af(rib_dest_t
*dest
)
385 return dest
->rnode
->p
.family
;
391 static inline struct route_table
*rib_dest_table(rib_dest_t
*dest
)
393 return srcdest_rnode_table(dest
->rnode
);
399 static inline struct zebra_vrf
*rib_dest_vrf(rib_dest_t
*dest
)
401 return rib_table_info(rib_dest_table(dest
))->zvrf
;
405 * rib_tables_iter_init
407 static inline void rib_tables_iter_init(rib_tables_iter_t
*iter
)
410 memset(iter
, 0, sizeof(*iter
));
411 iter
->state
= RIB_TABLES_ITER_S_INIT
;
415 * rib_tables_iter_started
417 * Returns TRUE if this iterator has started iterating over the set of
420 static inline int rib_tables_iter_started(rib_tables_iter_t
*iter
)
422 return iter
->state
!= RIB_TABLES_ITER_S_INIT
;
426 * rib_tables_iter_cleanup
428 static inline void rib_tables_iter_cleanup(rib_tables_iter_t
*iter
)
430 iter
->state
= RIB_TABLES_ITER_S_DONE
;
433 DECLARE_HOOK(rib_update
, (struct route_node
* rn
, const char *reason
),
436 #endif /*_ZEBRA_RIB_H */