1 /*- 2 * Copyright (c) 1980, 1986, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 4. Neither the name of the University nor the names of its contributors 14 * may be used to endorse or promote products derived from this software 15 * without specific prior written permission. 16 * 17 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 18 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 21 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27 * SUCH DAMAGE. 28 * 29 * @(#)route.h 8.4 (Berkeley) 1/9/95 30 * $FreeBSD$ 31 */ 32 33 #ifndef _NET_ROUTE_H_ 34 #define _NET_ROUTE_H_ 35 36 #include <sys/counter.h> 37 #include <net/vnet.h> 38 39 /* 40 * Kernel resident routing tables. 41 * 42 * The routing tables are initialized when interface addresses 43 * are set by making entries for all directly connected interfaces. 44 */ 45 46 /* 47 * Struct route consiste of a destination address, 48 * a route entry pointer, link-layer prepend data pointer along 49 * with its length. 50 */ 51 struct route { 52 struct rtentry *ro_rt; 53 char *ro_prepend; 54 uint16_t ro_plen; 55 uint16_t ro_flags; 56 uint16_t ro_mtu; /* saved ro_rt mtu */ 57 uint16_t spare; 58 struct sockaddr ro_dst; 59 }; 60 61 #define RT_L2_ME_BIT 2 /* dst L2 addr is our address */ 62 #define RT_MAY_LOOP_BIT 3 /* dst may require loop copy */ 63 #define RT_HAS_HEADER_BIT 4 /* mbuf already have its header prepended */ 64 65 #define RT_CACHING_CONTEXT 0x1 /* XXX: not used anywhere */ 66 #define RT_NORTREF 0x2 /* doesn't hold reference on ro_rt */ 67 #define RT_L2_ME (1 << RT_L2_ME_BIT) 68 #define RT_MAY_LOOP (1 << RT_MAY_LOOP_BIT) 69 #define RT_HAS_HEADER (1 << RT_HAS_HEADER_BIT) 70 71 struct rt_metrics { 72 u_long rmx_locks; /* Kernel must leave these values alone */ 73 u_long rmx_mtu; /* MTU for this path */ 74 u_long rmx_hopcount; /* max hops expected */ 75 u_long rmx_expire; /* lifetime for route, e.g. redirect */ 76 u_long rmx_recvpipe; /* inbound delay-bandwidth product */ 77 u_long rmx_sendpipe; /* outbound delay-bandwidth product */ 78 u_long rmx_ssthresh; /* outbound gateway buffer limit */ 79 u_long rmx_rtt; /* estimated round trip time */ 80 u_long rmx_rttvar; /* estimated rtt variance */ 81 u_long rmx_pksent; /* packets sent using this route */ 82 u_long rmx_weight; /* route weight */ 83 u_long rmx_filler[3]; /* will be used for T/TCP later */ 84 }; 85 86 /* 87 * rmx_rtt and rmx_rttvar are stored as microseconds; 88 * RTTTOPRHZ(rtt) converts to a value suitable for use 89 * by a protocol slowtimo counter. 90 */ 91 #define RTM_RTTUNIT 1000000 /* units for rtt, rttvar, as units per sec */ 92 #define RTTTOPRHZ(r) ((r) / (RTM_RTTUNIT / PR_SLOWHZ)) 93 94 /* lle state is exported in rmx_state rt_metrics field */ 95 #define rmx_state rmx_weight 96 97 #define RT_DEFAULT_FIB 0 /* Explicitly mark fib=0 restricted cases */ 98 #define RT_ALL_FIBS -1 /* Announce event for every fib */ 99 #ifdef _KERNEL 100 extern u_int rt_numfibs; /* number of usable routing tables */ 101 VNET_DECLARE(u_int, rt_add_addr_allfibs); /* Announce interfaces to all fibs */ 102 #define V_rt_add_addr_allfibs VNET(rt_add_addr_allfibs) 103 #endif 104 105 /* 106 * We distinguish between routes to hosts and routes to networks, 107 * preferring the former if available. For each route we infer 108 * the interface to use from the gateway address supplied when 109 * the route was entered. Routes that forward packets through 110 * gateways are marked so that the output routines know to address the 111 * gateway rather than the ultimate destination. 112 */ 113 #ifndef RNF_NORMAL 114 #include <net/radix.h> 115 #ifdef RADIX_MPATH 116 #include <net/radix_mpath.h> 117 #endif 118 #endif 119 120 #if defined(_KERNEL) || defined(_WANT_RTENTRY) 121 struct rtentry { 122 struct radix_node rt_nodes[2]; /* tree glue, and other values */ 123 /* 124 * XXX struct rtentry must begin with a struct radix_node (or two!) 125 * because the code does some casts of a 'struct radix_node *' 126 * to a 'struct rtentry *' 127 */ 128 #define rt_key(r) (*((struct sockaddr **)(&(r)->rt_nodes->rn_key))) 129 #define rt_mask(r) (*((struct sockaddr **)(&(r)->rt_nodes->rn_mask))) 130 struct sockaddr *rt_gateway; /* value */ 131 struct ifnet *rt_ifp; /* the answer: interface to use */ 132 struct ifaddr *rt_ifa; /* the answer: interface address to use */ 133 int rt_flags; /* up/down?, host/net */ 134 int rt_refcnt; /* # held references */ 135 u_int rt_fibnum; /* which FIB */ 136 u_long rt_mtu; /* MTU for this path */ 137 u_long rt_weight; /* absolute weight */ 138 u_long rt_expire; /* lifetime for route, e.g. redirect */ 139 #define rt_endzero rt_pksent 140 counter_u64_t rt_pksent; /* packets sent using this route */ 141 struct mtx rt_mtx; /* mutex for routing entry */ 142 struct rtentry *rt_chain; /* pointer to next rtentry to delete */ 143 }; 144 #endif /* _KERNEL || _WANT_RTENTRY */ 145 146 #define RTF_UP 0x1 /* route usable */ 147 #define RTF_GATEWAY 0x2 /* destination is a gateway */ 148 #define RTF_HOST 0x4 /* host entry (net otherwise) */ 149 #define RTF_REJECT 0x8 /* host or net unreachable */ 150 #define RTF_DYNAMIC 0x10 /* created dynamically (by redirect) */ 151 #define RTF_MODIFIED 0x20 /* modified dynamically (by redirect) */ 152 #define RTF_DONE 0x40 /* message confirmed */ 153 /* 0x80 unused, was RTF_DELCLONE */ 154 /* 0x100 unused, was RTF_CLONING */ 155 #define RTF_XRESOLVE 0x200 /* external daemon resolves name */ 156 #define RTF_LLINFO 0x400 /* DEPRECATED - exists ONLY for backward 157 compatibility */ 158 #define RTF_LLDATA 0x400 /* used by apps to add/del L2 entries */ 159 #define RTF_STATIC 0x800 /* manually added */ 160 #define RTF_BLACKHOLE 0x1000 /* just discard pkts (during updates) */ 161 #define RTF_PROTO2 0x4000 /* protocol specific routing flag */ 162 #define RTF_PROTO1 0x8000 /* protocol specific routing flag */ 163 /* 0x10000 unused, was RTF_PRCLONING */ 164 /* 0x20000 unused, was RTF_WASCLONED */ 165 #define RTF_PROTO3 0x40000 /* protocol specific routing flag */ 166 #define RTF_FIXEDMTU 0x80000 /* MTU was explicitly specified */ 167 #define RTF_PINNED 0x100000 /* route is immutable */ 168 #define RTF_LOCAL 0x200000 /* route represents a local address */ 169 #define RTF_BROADCAST 0x400000 /* route represents a bcast address */ 170 #define RTF_MULTICAST 0x800000 /* route represents a mcast address */ 171 /* 0x8000000 and up unassigned */ 172 #define RTF_STICKY 0x10000000 /* always route dst->src */ 173 174 #define RTF_RNH_LOCKED 0x40000000 /* radix node head is locked */ 175 176 #define RTF_GWFLAG_COMPAT 0x80000000 /* a compatibility bit for interacting 177 with existing routing apps */ 178 179 /* Mask of RTF flags that are allowed to be modified by RTM_CHANGE. */ 180 #define RTF_FMASK \ 181 (RTF_PROTO1 | RTF_PROTO2 | RTF_PROTO3 | RTF_BLACKHOLE | \ 182 RTF_REJECT | RTF_STATIC | RTF_STICKY) 183 184 /* 185 * fib_ nexthop API flags. 186 */ 187 188 /* Consumer-visible nexthop info flags */ 189 #define NHF_REJECT 0x0010 /* RTF_REJECT */ 190 #define NHF_BLACKHOLE 0x0020 /* RTF_BLACKHOLE */ 191 #define NHF_REDIRECT 0x0040 /* RTF_DYNAMIC|RTF_MODIFIED */ 192 #define NHF_DEFAULT 0x0080 /* Default route */ 193 #define NHF_BROADCAST 0x0100 /* RTF_BROADCAST */ 194 #define NHF_GATEWAY 0x0200 /* RTF_GATEWAY */ 195 196 /* Nexthop request flags */ 197 #define NHR_IFAIF 0x01 /* Return ifa_ifp interface */ 198 #define NHR_REF 0x02 /* For future use */ 199 200 /* Control plane route request flags */ 201 #define NHR_COPY 0x100 /* Copy rte data */ 202 203 /* rte<>nhop translation */ 204 static inline uint16_t 205 fib_rte_to_nh_flags(int rt_flags) 206 { 207 uint16_t res; 208 209 res = (rt_flags & RTF_REJECT) ? NHF_REJECT : 0; 210 res |= (rt_flags & RTF_BLACKHOLE) ? NHF_BLACKHOLE : 0; 211 res |= (rt_flags & (RTF_DYNAMIC|RTF_MODIFIED)) ? NHF_REDIRECT : 0; 212 res |= (rt_flags & RTF_BROADCAST) ? NHF_BROADCAST : 0; 213 res |= (rt_flags & RTF_GATEWAY) ? NHF_GATEWAY : 0; 214 215 return (res); 216 } 217 218 /* 219 * Routing statistics. 220 */ 221 struct rtstat { 222 short rts_badredirect; /* bogus redirect calls */ 223 short rts_dynamic; /* routes created by redirects */ 224 short rts_newgateway; /* routes modified by redirects */ 225 short rts_unreach; /* lookups which failed */ 226 short rts_wildcard; /* lookups satisfied by a wildcard */ 227 }; 228 /* 229 * Structures for routing messages. 230 */ 231 struct rt_msghdr { 232 u_short rtm_msglen; /* to skip over non-understood messages */ 233 u_char rtm_version; /* future binary compatibility */ 234 u_char rtm_type; /* message type */ 235 u_short rtm_index; /* index for associated ifp */ 236 int rtm_flags; /* flags, incl. kern & message, e.g. DONE */ 237 int rtm_addrs; /* bitmask identifying sockaddrs in msg */ 238 pid_t rtm_pid; /* identify sender */ 239 int rtm_seq; /* for sender to identify action */ 240 int rtm_errno; /* why failed */ 241 int rtm_fmask; /* bitmask used in RTM_CHANGE message */ 242 u_long rtm_inits; /* which metrics we are initializing */ 243 struct rt_metrics rtm_rmx; /* metrics themselves */ 244 }; 245 246 #define RTM_VERSION 5 /* Up the ante and ignore older versions */ 247 248 /* 249 * Message types. 250 */ 251 #define RTM_ADD 0x1 /* Add Route */ 252 #define RTM_DELETE 0x2 /* Delete Route */ 253 #define RTM_CHANGE 0x3 /* Change Metrics or flags */ 254 #define RTM_GET 0x4 /* Report Metrics */ 255 #define RTM_LOSING 0x5 /* Kernel Suspects Partitioning */ 256 #define RTM_REDIRECT 0x6 /* Told to use different route */ 257 #define RTM_MISS 0x7 /* Lookup failed on this address */ 258 #define RTM_LOCK 0x8 /* fix specified metrics */ 259 /* 0x9 */ 260 /* 0xa */ 261 #define RTM_RESOLVE 0xb /* req to resolve dst to LL addr */ 262 #define RTM_NEWADDR 0xc /* address being added to iface */ 263 #define RTM_DELADDR 0xd /* address being removed from iface */ 264 #define RTM_IFINFO 0xe /* iface going up/down etc. */ 265 #define RTM_NEWMADDR 0xf /* mcast group membership being added to if */ 266 #define RTM_DELMADDR 0x10 /* mcast group membership being deleted */ 267 #define RTM_IFANNOUNCE 0x11 /* iface arrival/departure */ 268 #define RTM_IEEE80211 0x12 /* IEEE80211 wireless event */ 269 270 /* 271 * Bitmask values for rtm_inits and rmx_locks. 272 */ 273 #define RTV_MTU 0x1 /* init or lock _mtu */ 274 #define RTV_HOPCOUNT 0x2 /* init or lock _hopcount */ 275 #define RTV_EXPIRE 0x4 /* init or lock _expire */ 276 #define RTV_RPIPE 0x8 /* init or lock _recvpipe */ 277 #define RTV_SPIPE 0x10 /* init or lock _sendpipe */ 278 #define RTV_SSTHRESH 0x20 /* init or lock _ssthresh */ 279 #define RTV_RTT 0x40 /* init or lock _rtt */ 280 #define RTV_RTTVAR 0x80 /* init or lock _rttvar */ 281 #define RTV_WEIGHT 0x100 /* init or lock _weight */ 282 283 /* 284 * Bitmask values for rtm_addrs. 285 */ 286 #define RTA_DST 0x1 /* destination sockaddr present */ 287 #define RTA_GATEWAY 0x2 /* gateway sockaddr present */ 288 #define RTA_NETMASK 0x4 /* netmask sockaddr present */ 289 #define RTA_GENMASK 0x8 /* cloning mask sockaddr present */ 290 #define RTA_IFP 0x10 /* interface name sockaddr present */ 291 #define RTA_IFA 0x20 /* interface addr sockaddr present */ 292 #define RTA_AUTHOR 0x40 /* sockaddr for author of redirect */ 293 #define RTA_BRD 0x80 /* for NEWADDR, broadcast or p-p dest addr */ 294 295 /* 296 * Index offsets for sockaddr array for alternate internal encoding. 297 */ 298 #define RTAX_DST 0 /* destination sockaddr present */ 299 #define RTAX_GATEWAY 1 /* gateway sockaddr present */ 300 #define RTAX_NETMASK 2 /* netmask sockaddr present */ 301 #define RTAX_GENMASK 3 /* cloning mask sockaddr present */ 302 #define RTAX_IFP 4 /* interface name sockaddr present */ 303 #define RTAX_IFA 5 /* interface addr sockaddr present */ 304 #define RTAX_AUTHOR 6 /* sockaddr for author of redirect */ 305 #define RTAX_BRD 7 /* for NEWADDR, broadcast or p-p dest addr */ 306 #define RTAX_MAX 8 /* size of array to allocate */ 307 308 typedef int rt_filter_f_t(const struct rtentry *, void *); 309 310 struct rt_addrinfo { 311 int rti_addrs; /* Route RTF_ flags */ 312 int rti_flags; /* Route RTF_ flags */ 313 struct sockaddr *rti_info[RTAX_MAX]; /* Sockaddr data */ 314 struct ifaddr *rti_ifa; /* value of rt_ifa addr */ 315 struct ifnet *rti_ifp; /* route interface */ 316 rt_filter_f_t *rti_filter; /* filter function */ 317 void *rti_filterdata; /* filter paramenters */ 318 u_long rti_mflags; /* metrics RTV_ flags */ 319 u_long rti_spare; /* Will be used for fib */ 320 struct rt_metrics *rti_rmx; /* Pointer to route metrics */ 321 }; 322 323 /* 324 * This macro returns the size of a struct sockaddr when passed 325 * through a routing socket. Basically we round up sa_len to 326 * a multiple of sizeof(long), with a minimum of sizeof(long). 327 * The check for a NULL pointer is just a convenience, probably never used. 328 * The case sa_len == 0 should only apply to empty structures. 329 */ 330 #define SA_SIZE(sa) \ 331 ( (!(sa) || ((struct sockaddr *)(sa))->sa_len == 0) ? \ 332 sizeof(long) : \ 333 1 + ( (((struct sockaddr *)(sa))->sa_len - 1) | (sizeof(long) - 1) ) ) 334 335 #define sa_equal(a, b) ( \ 336 (((const struct sockaddr *)(a))->sa_len == ((const struct sockaddr *)(b))->sa_len) && \ 337 (bcmp((a), (b), ((const struct sockaddr *)(b))->sa_len) == 0)) 338 339 #ifdef _KERNEL 340 341 #define RT_LINK_IS_UP(ifp) (!((ifp)->if_capabilities & IFCAP_LINKSTATE) \ 342 || (ifp)->if_link_state == LINK_STATE_UP) 343 344 #define RT_LOCK_INIT(_rt) \ 345 mtx_init(&(_rt)->rt_mtx, "rtentry", NULL, MTX_DEF | MTX_DUPOK) 346 #define RT_LOCK(_rt) mtx_lock(&(_rt)->rt_mtx) 347 #define RT_UNLOCK(_rt) mtx_unlock(&(_rt)->rt_mtx) 348 #define RT_LOCK_DESTROY(_rt) mtx_destroy(&(_rt)->rt_mtx) 349 #define RT_LOCK_ASSERT(_rt) mtx_assert(&(_rt)->rt_mtx, MA_OWNED) 350 #define RT_UNLOCK_COND(_rt) do { \ 351 if (mtx_owned(&(_rt)->rt_mtx)) \ 352 mtx_unlock(&(_rt)->rt_mtx); \ 353 } while (0) 354 355 #define RT_ADDREF(_rt) do { \ 356 RT_LOCK_ASSERT(_rt); \ 357 KASSERT((_rt)->rt_refcnt >= 0, \ 358 ("negative refcnt %d", (_rt)->rt_refcnt)); \ 359 (_rt)->rt_refcnt++; \ 360 } while (0) 361 362 #define RT_REMREF(_rt) do { \ 363 RT_LOCK_ASSERT(_rt); \ 364 KASSERT((_rt)->rt_refcnt > 0, \ 365 ("bogus refcnt %d", (_rt)->rt_refcnt)); \ 366 (_rt)->rt_refcnt--; \ 367 } while (0) 368 369 #define RTFREE_LOCKED(_rt) do { \ 370 if ((_rt)->rt_refcnt <= 1) \ 371 rtfree(_rt); \ 372 else { \ 373 RT_REMREF(_rt); \ 374 RT_UNLOCK(_rt); \ 375 } \ 376 /* guard against invalid refs */ \ 377 _rt = 0; \ 378 } while (0) 379 380 #define RTFREE(_rt) do { \ 381 RT_LOCK(_rt); \ 382 RTFREE_LOCKED(_rt); \ 383 } while (0) 384 385 #define RO_RTFREE(_ro) do { \ 386 if ((_ro)->ro_rt) { \ 387 if ((_ro)->ro_flags & RT_NORTREF) { \ 388 (_ro)->ro_flags &= ~RT_NORTREF; \ 389 (_ro)->ro_rt = NULL; \ 390 } else { \ 391 RT_LOCK((_ro)->ro_rt); \ 392 RTFREE_LOCKED((_ro)->ro_rt); \ 393 } \ 394 } \ 395 } while (0) 396 397 struct radix_node_head *rt_tables_get_rnh(int, int); 398 399 struct ifmultiaddr; 400 401 void rt_ieee80211msg(struct ifnet *, int, void *, size_t); 402 void rt_ifannouncemsg(struct ifnet *, int); 403 void rt_ifmsg(struct ifnet *); 404 void rt_missmsg(int, struct rt_addrinfo *, int, int); 405 void rt_missmsg_fib(int, struct rt_addrinfo *, int, int, int); 406 void rt_newaddrmsg(int, struct ifaddr *, int, struct rtentry *); 407 void rt_newaddrmsg_fib(int, struct ifaddr *, int, struct rtentry *, int); 408 int rt_addrmsg(int, struct ifaddr *, int); 409 int rt_routemsg(int, struct ifnet *ifp, int, struct rtentry *, int); 410 void rt_newmaddrmsg(int, struct ifmultiaddr *); 411 int rt_setgate(struct rtentry *, struct sockaddr *, struct sockaddr *); 412 void rt_maskedcopy(struct sockaddr *, struct sockaddr *, struct sockaddr *); 413 414 int rtsock_addrmsg(int, struct ifaddr *, int); 415 int rtsock_routemsg(int, struct ifnet *ifp, int, struct rtentry *, int); 416 417 /* 418 * Note the following locking behavior: 419 * 420 * rtalloc_ign() and rtalloc() return ro->ro_rt unlocked 421 * 422 * rtalloc1() returns a locked rtentry 423 * 424 * rtfree() and RTFREE_LOCKED() require a locked rtentry 425 * 426 * RTFREE() uses an unlocked entry. 427 */ 428 429 int rt_expunge(struct radix_node_head *, struct rtentry *); 430 void rtfree(struct rtentry *); 431 int rt_check(struct rtentry **, struct rtentry **, struct sockaddr *); 432 void rt_updatemtu(struct ifnet *); 433 434 typedef int rt_walktree_f_t(struct rtentry *, void *); 435 typedef void rt_setwarg_t(struct radix_node_head *, uint32_t, int, void *); 436 void rt_foreach_fib_walk(int af, rt_setwarg_t *, rt_walktree_f_t *, void *); 437 void rt_foreach_fib_walk_del(int af, rt_filter_f_t *filter_f, void *arg); 438 void rt_flushifroutes(struct ifnet *ifp); 439 440 /* XXX MRT COMPAT VERSIONS THAT SET UNIVERSE to 0 */ 441 /* Thes are used by old code not yet converted to use multiple FIBS */ 442 void rtalloc_ign(struct route *ro, u_long ignflags); 443 void rtalloc(struct route *ro); /* XXX deprecated, use rtalloc_ign(ro, 0) */ 444 struct rtentry *rtalloc1(struct sockaddr *, int, u_long); 445 int rtinit(struct ifaddr *, int, int); 446 int rtioctl(u_long, caddr_t); 447 void rtredirect(struct sockaddr *, struct sockaddr *, 448 struct sockaddr *, int, struct sockaddr *); 449 int rtrequest(int, struct sockaddr *, 450 struct sockaddr *, struct sockaddr *, int, struct rtentry **); 451 452 /* XXX MRT NEW VERSIONS THAT USE FIBs 453 * For now the protocol indepedent versions are the same as the AF_INET ones 454 * but this will change.. 455 */ 456 int rt_getifa_fib(struct rt_addrinfo *, u_int fibnum); 457 void rtalloc_ign_fib(struct route *ro, u_long ignflags, u_int fibnum); 458 void rtalloc_fib(struct route *ro, u_int fibnum); 459 struct rtentry *rtalloc1_fib(struct sockaddr *, int, u_long, u_int); 460 int rtioctl_fib(u_long, caddr_t, u_int); 461 void rtredirect_fib(struct sockaddr *, struct sockaddr *, 462 struct sockaddr *, int, struct sockaddr *, u_int); 463 int rtrequest_fib(int, struct sockaddr *, 464 struct sockaddr *, struct sockaddr *, int, struct rtentry **, u_int); 465 int rtrequest1_fib(int, struct rt_addrinfo *, struct rtentry **, u_int); 466 int rib_lookup_info(uint32_t, const struct sockaddr *, uint32_t, uint32_t, 467 struct rt_addrinfo *); 468 void rib_free_info(struct rt_addrinfo *info); 469 470 #include <sys/eventhandler.h> 471 typedef void (*rtevent_redirect_fn)(void *, struct rtentry *, struct rtentry *, struct sockaddr *); 472 EVENTHANDLER_DECLARE(route_redirect_event, rtevent_redirect_fn); 473 #endif 474 475 #endif 476