* Copyright (c) 1980, 1986 Regents of the University of California.
* Redistribution and use in source and binary forms are permitted
* provided that the above copyright notice and this paragraph are
* duplicated in all such forms and that any documentation,
* advertising materials, and other materials related to such
* distribution and use acknowledge that the software was developed
* by the University of California, Berkeley. The name of the
* University may not be used to endorse or promote products derived
* from this software without specific prior written permission.
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
* WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
* @(#)route.h 7.4 (Berkeley) 6/27/88
* Kernel resident routing tables.
* The routing tables are initialized when interface addresses
* are set by making entries for all directly connected interfaces.
* A route consists of a destination address and a reference
* to a routing entry. These are often held by protocols
* in their control blocks, e.g. inpcb.
* We distinguish between routes to hosts and routes to networks,
* preferring the former if available. For each route we infer
* the interface to use from the gateway address supplied when
* the route was entered. Routes that forward packets through
* gateways are marked so that the output routines know to address the
* gateway rather than the ultimate destination.
struct radix_node rt_nodes
[2]; /* tree glue, and other values */
#define rt_key(r) ((struct sockaddr *)((r)->rt_nodes->rn_key))
#define rt_mask(r) ((struct sockaddr *)((r)->rt_nodes->rn_mask))
struct sockaddr
*rt_gateway
; /* value */
short rt_flags
; /* up/down?, host/net */
short rt_refcnt
; /* # held references */
u_long rt_use
; /* raw # packets forwarded */
struct ifnet
*rt_ifp
; /* the answer: interface to use */
struct ifaddr
*rt_ifa
; /* the answer: interface to use */
* Following structure necessary for 4.3 compatibility;
* We should eventually move it to a compat file.
u_long rt_hash
; /* to speed lookups */
struct sockaddr rt_dst
; /* key */
struct sockaddr rt_gateway
; /* value */
short rt_flags
; /* up/down?, host/net */
short rt_refcnt
; /* # held references */
u_long rt_use
; /* raw # packets forwarded */
struct ifnet
*rt_ifp
; /* the answer: interface to use */
#define RTF_UP 0x1 /* route useable */
#define RTF_GATEWAY 0x2 /* destination is a gateway */
#define RTF_HOST 0x4 /* host entry (net otherwise) */
#define RTF_DYNAMIC 0x10 /* created dynamically (by redirect) */
#define RTF_MODIFIED 0x20 /* modified dynamically (by redirect) */
#define RTF_DONE 0x40 /* message confirmed */
#define RTF_MASK 0x80 /* subnet mask present */
short rts_badredirect
; /* bogus redirect calls */
short rts_dynamic
; /* routes created by redirects */
short rts_newgateway
; /* routes modified by redirects */
short rts_unreach
; /* lookups which failed */
short rts_wildcard
; /* lookups satisfied by a wildcard */
* Structures for routing messages.
u_long rtm_mtu
; /* MTU for this path */
u_long rtm_hopcount
; /* max hops expected */
u_long rtm_expire
; /* lifetime for route, e.g. redirect */
u_long rtm_recvpipe
; /* inbound delay-bandwith product */
u_long rtm_sendpipe
; /* outbound delay-bandwith product */
u_long rtm_ssthresh
; /* outbound gateway buffer limit */
u_long rtm_rtt
; /* estimated round trip time */
u_long rtm_rttvar
; /* estimated rtt variance */
u_short rtm_msglen
; /* to skip over non-understood messages */
u_char rtm_version
; /* future binary compatability */
u_char rtm_type
; /* message type */
u_char rtm_count
; /* number of sockaddrs */
pid_t rtm_pid
; /* identify sender */
int rtm_seq
; /* for sender to identify action */
int rtm_errno
; /* why failed */
int rtm_flags
; /* flags, incl. kern & message, e.g. DONE */
int rtm_locks
; /* which values kernel can alter */
int rtm_inits
; /* which values we are initializing */
struct rt_chgmsg
{ /* Good for RTM_ADD, RTM_CHANGE, RTM_GET */
#define RTM_ADD 0x1 /* Add Route */
#define RTM_DELETE 0x2 /* Delete Route */
#define RTM_CHANGE 0x3 /* Change Metrics or flags */
#define RTM_GET 0x4 /* Report Metrics */
#define RTM_LOSING 0x5 /* Kernel Suspects Partitioning */
#define RTM_REDIRECT 0x6 /* Told to use different route */
#define RTM_MISS 0x7 /* Lookup failed on this address */
#define RTM_LOCK 0x8 /* fix specified metrics */
#define RTM_OLDADD 0x9 /* caused by SIOCADDRT */
#define RTM_OLDDEL 0xa /* caused by SIOCDELRT */
#define RTV_MTU 0x1 /* init or lock _mtu */
#define RTV_HOPCOUNT 0x2 /* init or lock _hopcount */
#define RTV_EXPIRE 0x4 /* init or lock _hopcount */
#define RTV_RPIPE 0x8 /* init or lock _recvpipe */
#define RTV_SPIPE 0x10 /* init or lock _sendpipe */
#define RTV_SSTHRESH 0x20 /* init or lock _ssthresh */
#define RTV_RTT 0x40 /* init or lock _rtt */
#define RTV_RTTVAR 0x80 /* init or lock _rttvar */
struct route_cb route_cb
;
if ((rt)->rt_refcnt == 1) \
#if (RTHASHSIZ & (RTHASHSIZ - 1)) == 0
#define RTHASHMOD(h) ((h) & (RTHASHSIZ - 1))
#define RTHASHMOD(h) ((h) % RTHASHSIZ)
struct mbuf
*rthost
[RTHASHSIZ
];
struct mbuf
*rtnet
[RTHASHSIZ
];
struct rtentry
*rtalloc1();