Home | History | Annotate | Line # | Download | only in net
route.h revision 1.1
      1  1.1  cgd /*
      2  1.1  cgd  * Copyright (c) 1980, 1986 Regents of the University of California.
      3  1.1  cgd  * All rights reserved.
      4  1.1  cgd  *
      5  1.1  cgd  * Redistribution and use in source and binary forms, with or without
      6  1.1  cgd  * modification, are permitted provided that the following conditions
      7  1.1  cgd  * are met:
      8  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
      9  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     10  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     11  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     12  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     13  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     14  1.1  cgd  *    must display the following acknowledgement:
     15  1.1  cgd  *	This product includes software developed by the University of
     16  1.1  cgd  *	California, Berkeley and its contributors.
     17  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     18  1.1  cgd  *    may be used to endorse or promote products derived from this software
     19  1.1  cgd  *    without specific prior written permission.
     20  1.1  cgd  *
     21  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  1.1  cgd  * SUCH DAMAGE.
     32  1.1  cgd  *
     33  1.1  cgd  *	@(#)route.h	7.13 (Berkeley) 4/25/91
     34  1.1  cgd  */
     35  1.1  cgd 
     36  1.1  cgd /*
     37  1.1  cgd  * Kernel resident routing tables.
     38  1.1  cgd  *
     39  1.1  cgd  * The routing tables are initialized when interface addresses
     40  1.1  cgd  * are set by making entries for all directly connected interfaces.
     41  1.1  cgd  */
     42  1.1  cgd 
     43  1.1  cgd /*
     44  1.1  cgd  * A route consists of a destination address and a reference
     45  1.1  cgd  * to a routing entry.  These are often held by protocols
     46  1.1  cgd  * in their control blocks, e.g. inpcb.
     47  1.1  cgd  */
     48  1.1  cgd struct route {
     49  1.1  cgd 	struct	rtentry *ro_rt;
     50  1.1  cgd 	struct	sockaddr ro_dst;
     51  1.1  cgd };
     52  1.1  cgd 
     53  1.1  cgd /*
     54  1.1  cgd  * These numbers are used by reliable protocols for determining
     55  1.1  cgd  * retransmission behavior and are included in the routing structure.
     56  1.1  cgd  */
     57  1.1  cgd struct rt_metrics {
     58  1.1  cgd 	u_long	rmx_locks;	/* Kernel must leave these values alone */
     59  1.1  cgd 	u_long	rmx_mtu;	/* MTU for this path */
     60  1.1  cgd 	u_long	rmx_hopcount;	/* max hops expected */
     61  1.1  cgd 	u_long	rmx_expire;	/* lifetime for route, e.g. redirect */
     62  1.1  cgd 	u_long	rmx_recvpipe;	/* inbound delay-bandwith product */
     63  1.1  cgd 	u_long	rmx_sendpipe;	/* outbound delay-bandwith product */
     64  1.1  cgd 	u_long	rmx_ssthresh;	/* outbound gateway buffer limit */
     65  1.1  cgd 	u_long	rmx_rtt;	/* estimated round trip time */
     66  1.1  cgd 	u_long	rmx_rttvar;	/* estimated rtt variance */
     67  1.1  cgd };
     68  1.1  cgd 
     69  1.1  cgd /*
     70  1.1  cgd  * rmx_rtt and rmx_rttvar are stored as microseconds;
     71  1.1  cgd  * RTTTOPRHZ(rtt) converts to a value suitable for use
     72  1.1  cgd  * by a protocol slowtimo counter.
     73  1.1  cgd  */
     74  1.1  cgd #define	RTM_RTTUNIT	1000000	/* units for rtt, rttvar, as units per sec */
     75  1.1  cgd #define	RTTTOPRHZ(r)	((r) / (RTM_RTTUNIT / PR_SLOWHZ))
     76  1.1  cgd 
     77  1.1  cgd /*
     78  1.1  cgd  * We distinguish between routes to hosts and routes to networks,
     79  1.1  cgd  * preferring the former if available.  For each route we infer
     80  1.1  cgd  * the interface to use from the gateway address supplied when
     81  1.1  cgd  * the route was entered.  Routes that forward packets through
     82  1.1  cgd  * gateways are marked so that the output routines know to address the
     83  1.1  cgd  * gateway rather than the ultimate destination.
     84  1.1  cgd  */
     85  1.1  cgd #ifndef RNF_NORMAL
     86  1.1  cgd #include "radix.h"
     87  1.1  cgd #endif
     88  1.1  cgd struct rtentry {
     89  1.1  cgd 	struct	radix_node rt_nodes[2];	/* tree glue, and other values */
     90  1.1  cgd #define	rt_key(r)	((struct sockaddr *)((r)->rt_nodes->rn_key))
     91  1.1  cgd #define	rt_mask(r)	((struct sockaddr *)((r)->rt_nodes->rn_mask))
     92  1.1  cgd 	struct	sockaddr *rt_gateway;	/* value */
     93  1.1  cgd 	short	rt_flags;		/* up/down?, host/net */
     94  1.1  cgd 	short	rt_refcnt;		/* # held references */
     95  1.1  cgd 	u_long	rt_use;			/* raw # packets forwarded */
     96  1.1  cgd 	struct	ifnet *rt_ifp;		/* the answer: interface to use */
     97  1.1  cgd 	struct	ifaddr *rt_ifa;		/* the answer: interface to use */
     98  1.1  cgd 	struct	sockaddr *rt_genmask;	/* for generation of cloned routes */
     99  1.1  cgd 	caddr_t	rt_llinfo;		/* pointer to link level info cache */
    100  1.1  cgd 	struct	rt_metrics rt_rmx;	/* metrics used by rx'ing protocols */
    101  1.1  cgd 	short	rt_idle;		/* easy to tell llayer still live */
    102  1.1  cgd };
    103  1.1  cgd 
    104  1.1  cgd /*
    105  1.1  cgd  * Following structure necessary for 4.3 compatibility;
    106  1.1  cgd  * We should eventually move it to a compat file.
    107  1.1  cgd  */
    108  1.1  cgd struct ortentry {
    109  1.1  cgd 	u_long	rt_hash;		/* to speed lookups */
    110  1.1  cgd 	struct	sockaddr rt_dst;	/* key */
    111  1.1  cgd 	struct	sockaddr rt_gateway;	/* value */
    112  1.1  cgd 	short	rt_flags;		/* up/down?, host/net */
    113  1.1  cgd 	short	rt_refcnt;		/* # held references */
    114  1.1  cgd 	u_long	rt_use;			/* raw # packets forwarded */
    115  1.1  cgd 	struct	ifnet *rt_ifp;		/* the answer: interface to use */
    116  1.1  cgd };
    117  1.1  cgd 
    118  1.1  cgd #define	RTF_UP		0x1		/* route useable */
    119  1.1  cgd #define	RTF_GATEWAY	0x2		/* destination is a gateway */
    120  1.1  cgd #define	RTF_HOST	0x4		/* host entry (net otherwise) */
    121  1.1  cgd #define	RTF_REJECT	0x8		/* host or net unreachable */
    122  1.1  cgd #define	RTF_DYNAMIC	0x10		/* created dynamically (by redirect) */
    123  1.1  cgd #define	RTF_MODIFIED	0x20		/* modified dynamically (by redirect) */
    124  1.1  cgd #define RTF_DONE	0x40		/* message confirmed */
    125  1.1  cgd #define RTF_MASK	0x80		/* subnet mask present */
    126  1.1  cgd #define RTF_CLONING	0x100		/* generate new routes on use */
    127  1.1  cgd #define RTF_XRESOLVE	0x200		/* external daemon resolves name */
    128  1.1  cgd #define RTF_LLINFO	0x400		/* generated by ARP or ESIS */
    129  1.1  cgd #define RTF_PROTO2	0x4000		/* protocol specific routing flag */
    130  1.1  cgd #define RTF_PROTO1	0x8000		/* protocol specific routing flag */
    131  1.1  cgd 
    132  1.1  cgd 
    133  1.1  cgd /*
    134  1.1  cgd  * Routing statistics.
    135  1.1  cgd  */
    136  1.1  cgd struct	rtstat {
    137  1.1  cgd 	short	rts_badredirect;	/* bogus redirect calls */
    138  1.1  cgd 	short	rts_dynamic;		/* routes created by redirects */
    139  1.1  cgd 	short	rts_newgateway;		/* routes modified by redirects */
    140  1.1  cgd 	short	rts_unreach;		/* lookups which failed */
    141  1.1  cgd 	short	rts_wildcard;		/* lookups satisfied by a wildcard */
    142  1.1  cgd };
    143  1.1  cgd /*
    144  1.1  cgd  * Structures for routing messages.
    145  1.1  cgd  */
    146  1.1  cgd struct rt_msghdr {
    147  1.1  cgd 	u_short	rtm_msglen;	/* to skip over non-understood messages */
    148  1.1  cgd 	u_char	rtm_version;	/* future binary compatability */
    149  1.1  cgd 	u_char	rtm_type;	/* message type */
    150  1.1  cgd 	u_short	rtm_index;	/* index for associated ifp */
    151  1.1  cgd 	pid_t	rtm_pid;	/* identify sender */
    152  1.1  cgd 	int	rtm_addrs;	/* bitmask identifying sockaddrs in msg */
    153  1.1  cgd 	int	rtm_seq;	/* for sender to identify action */
    154  1.1  cgd 	int	rtm_errno;	/* why failed */
    155  1.1  cgd 	int	rtm_flags;	/* flags, incl. kern & message, e.g. DONE */
    156  1.1  cgd 	int	rtm_use;	/* from rtentry */
    157  1.1  cgd 	u_long	rtm_inits;	/* which metrics we are initializing */
    158  1.1  cgd 	struct	rt_metrics rtm_rmx; /* metrics themselves */
    159  1.1  cgd };
    160  1.1  cgd 
    161  1.1  cgd struct route_cb {
    162  1.1  cgd 	int	ip_count;
    163  1.1  cgd 	int	ns_count;
    164  1.1  cgd 	int	iso_count;
    165  1.1  cgd 	int	any_count;
    166  1.1  cgd };
    167  1.1  cgd #define RTM_VERSION	2	/* Up the ante and ignore older versions */
    168  1.1  cgd 
    169  1.1  cgd #define RTM_ADD		0x1	/* Add Route */
    170  1.1  cgd #define RTM_DELETE	0x2	/* Delete Route */
    171  1.1  cgd #define RTM_CHANGE	0x3	/* Change Metrics or flags */
    172  1.1  cgd #define RTM_GET		0x4	/* Report Metrics */
    173  1.1  cgd #define RTM_LOSING	0x5	/* Kernel Suspects Partitioning */
    174  1.1  cgd #define RTM_REDIRECT	0x6	/* Told to use different route */
    175  1.1  cgd #define RTM_MISS	0x7	/* Lookup failed on this address */
    176  1.1  cgd #define RTM_LOCK	0x8	/* fix specified metrics */
    177  1.1  cgd #define RTM_OLDADD	0x9	/* caused by SIOCADDRT */
    178  1.1  cgd #define RTM_OLDDEL	0xa	/* caused by SIOCDELRT */
    179  1.1  cgd #define RTM_RESOLVE	0xb	/* req to resolve dst to LL addr */
    180  1.1  cgd 
    181  1.1  cgd #define RTV_MTU		0x1	/* init or lock _mtu */
    182  1.1  cgd #define RTV_HOPCOUNT	0x2	/* init or lock _hopcount */
    183  1.1  cgd #define RTV_EXPIRE	0x4	/* init or lock _hopcount */
    184  1.1  cgd #define RTV_RPIPE	0x8	/* init or lock _recvpipe */
    185  1.1  cgd #define RTV_SPIPE	0x10	/* init or lock _sendpipe */
    186  1.1  cgd #define RTV_SSTHRESH	0x20	/* init or lock _ssthresh */
    187  1.1  cgd #define RTV_RTT		0x40	/* init or lock _rtt */
    188  1.1  cgd #define RTV_RTTVAR	0x80	/* init or lock _rttvar */
    189  1.1  cgd 
    190  1.1  cgd #define RTA_DST		0x1	/* destination sockaddr present */
    191  1.1  cgd #define RTA_GATEWAY	0x2	/* gateway sockaddr present */
    192  1.1  cgd #define RTA_NETMASK	0x4	/* netmask sockaddr present */
    193  1.1  cgd #define RTA_GENMASK	0x8	/* cloning mask sockaddr present */
    194  1.1  cgd #define RTA_IFP		0x10	/* interface name sockaddr present */
    195  1.1  cgd #define RTA_IFA		0x20	/* interface addr sockaddr present */
    196  1.1  cgd #define RTA_AUTHOR	0x40	/* sockaddr for author of redirect */
    197  1.1  cgd 
    198  1.1  cgd #ifdef KERNEL
    199  1.1  cgd struct route_cb route_cb;
    200  1.1  cgd #endif
    201  1.1  cgd 
    202  1.1  cgd #ifdef KERNEL
    203  1.1  cgd #define	RTFREE(rt) \
    204  1.1  cgd 	if ((rt)->rt_refcnt <= 1) \
    205  1.1  cgd 		rtfree(rt); \
    206  1.1  cgd 	else \
    207  1.1  cgd 		(rt)->rt_refcnt--;
    208  1.1  cgd 
    209  1.1  cgd #ifdef	GATEWAY
    210  1.1  cgd #define	RTHASHSIZ	64
    211  1.1  cgd #else
    212  1.1  cgd #define	RTHASHSIZ	8
    213  1.1  cgd #endif
    214  1.1  cgd #if	(RTHASHSIZ & (RTHASHSIZ - 1)) == 0
    215  1.1  cgd #define RTHASHMOD(h)	((h) & (RTHASHSIZ - 1))
    216  1.1  cgd #else
    217  1.1  cgd #define RTHASHMOD(h)	((h) % RTHASHSIZ)
    218  1.1  cgd #endif
    219  1.1  cgd struct	mbuf *rthost[RTHASHSIZ];
    220  1.1  cgd struct	mbuf *rtnet[RTHASHSIZ];
    221  1.1  cgd struct	rtstat	rtstat;
    222  1.1  cgd struct	rtentry *rtalloc1();
    223  1.1  cgd #endif
    224