route.h revision 4104
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 * 3. All advertising materials mentioning features or use of this software 14 * must display the following acknowledgement: 15 * This product includes software developed by the University of 16 * California, Berkeley and its contributors. 17 * 4. Neither the name of the University nor the names of its contributors 18 * may be used to endorse or promote products derived from this software 19 * without specific prior written permission. 20 * 21 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 22 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 23 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 24 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 25 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 26 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 27 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 28 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 29 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 30 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 31 * SUCH DAMAGE. 32 * 33 * @(#)route.h 8.3 (Berkeley) 4/19/94 34 * $Id: route.h,v 1.4 1994/08/21 05:11:46 paul Exp $ 35 */ 36 37#ifndef _NET_ROUTE_H_ 38#define _NET_ROUTE_H_ 39 40/* 41 * Kernel resident routing tables. 42 * 43 * The routing tables are initialized when interface addresses 44 * are set by making entries for all directly connected interfaces. 45 */ 46 47/* 48 * A route consists of a destination address and a reference 49 * to a routing entry. These are often held by protocols 50 * in their control blocks, e.g. inpcb. 51 */ 52struct route { 53 struct rtentry *ro_rt; 54 struct sockaddr ro_dst; 55}; 56 57/* 58 * These numbers are used by reliable protocols for determining 59 * retransmission behavior and are included in the routing structure. 60 */ 61struct rt_metrics { 62 u_long rmx_locks; /* Kernel must leave these values alone */ 63 u_long rmx_mtu; /* MTU for this path */ 64 u_long rmx_hopcount; /* max hops expected */ 65 u_long rmx_expire; /* lifetime for route, e.g. redirect */ 66 u_long rmx_recvpipe; /* inbound delay-bandwith product */ 67 u_long rmx_sendpipe; /* outbound delay-bandwith product */ 68 u_long rmx_ssthresh; /* outbound gateway buffer limit */ 69 u_long rmx_rtt; /* estimated round trip time */ 70 u_long rmx_rttvar; /* estimated rtt variance */ 71 u_long rmx_pksent; /* packets sent using this route */ 72}; 73 74/* 75 * rmx_rtt and rmx_rttvar are stored as microseconds; 76 * RTTTOPRHZ(rtt) converts to a value suitable for use 77 * by a protocol slowtimo counter. 78 */ 79#define RTM_RTTUNIT 1000000 /* units for rtt, rttvar, as units per sec */ 80#define RTTTOPRHZ(r) ((r) / (RTM_RTTUNIT / PR_SLOWHZ)) 81 82/* 83 * We distinguish between routes to hosts and routes to networks, 84 * preferring the former if available. For each route we infer 85 * the interface to use from the gateway address supplied when 86 * the route was entered. Routes that forward packets through 87 * gateways are marked so that the output routines know to address the 88 * gateway rather than the ultimate destination. 89 */ 90#ifndef RNF_NORMAL 91#include <net/radix.h> 92#endif 93struct rtentry { 94 struct radix_node rt_nodes[2]; /* tree glue, and other values */ 95#define rt_key(r) ((struct sockaddr *)((r)->rt_nodes->rn_key)) 96#define rt_mask(r) ((struct sockaddr *)((r)->rt_nodes->rn_mask)) 97 struct sockaddr *rt_gateway; /* value */ 98 /* XXX - rt_flags should be unified with rt_prflags */ 99 short rt_flags; /* up/down?, host/net */ 100 short rt_refcnt; /* # held references */ 101 u_long rt_prflags; /* protocol-specific flags */ 102 struct ifnet *rt_ifp; /* the answer: interface to use */ 103 struct ifaddr *rt_ifa; /* the answer: interface to use */ 104 struct sockaddr *rt_genmask; /* for generation of cloned routes */ 105 caddr_t rt_llinfo; /* pointer to link level info cache */ 106 struct rt_metrics rt_rmx; /* metrics used by rx'ing protocols */ 107 struct rtentry *rt_gwroute; /* implied entry for gatewayed routes */ 108}; 109 110/* 111 * Following structure necessary for 4.3 compatibility; 112 * We should eventually move it to a compat file. 113 */ 114struct ortentry { 115 u_long rt_hash; /* to speed lookups */ 116 struct sockaddr rt_dst; /* key */ 117 struct sockaddr rt_gateway; /* value */ 118 short rt_flags; /* up/down?, host/net */ 119 short rt_refcnt; /* # held references */ 120 u_long rt_use; /* raw # packets forwarded */ 121 struct ifnet *rt_ifp; /* the answer: interface to use */ 122}; 123 124#define rt_use rt_rmx.rmx_pksent 125 126#define RTF_UP 0x1 /* route usable */ 127#define RTF_GATEWAY 0x2 /* destination is a gateway */ 128#define RTF_HOST 0x4 /* host entry (net otherwise) */ 129#define RTF_REJECT 0x8 /* host or net unreachable */ 130#define RTF_DYNAMIC 0x10 /* created dynamically (by redirect) */ 131#define RTF_MODIFIED 0x20 /* modified dynamically (by redirect) */ 132#define RTF_DONE 0x40 /* message confirmed */ 133#define RTF_MASK 0x80 /* subnet mask present */ 134#define RTF_CLONING 0x100 /* generate new routes on use */ 135#define RTF_XRESOLVE 0x200 /* external daemon resolves name */ 136#define RTF_LLINFO 0x400 /* generated by ARP or ESIS */ 137#define RTF_STATIC 0x800 /* manually added */ 138#define RTF_BLACKHOLE 0x1000 /* just discard pkts (during updates) */ 139#define RTF_PROTO2 0x4000 /* protocol specific routing flag */ 140#define RTF_PROTO1 0x8000 /* protocol specific routing flag */ 141 142#define RTPRF_WASCLONED 0x1 /* route generated through cloning */ 143 144/* 145 * Routing statistics. 146 */ 147struct rtstat { 148 short rts_badredirect; /* bogus redirect calls */ 149 short rts_dynamic; /* routes created by redirects */ 150 short rts_newgateway; /* routes modified by redirects */ 151 short rts_unreach; /* lookups which failed */ 152 short rts_wildcard; /* lookups satisfied by a wildcard */ 153}; 154/* 155 * Structures for routing messages. 156 */ 157struct rt_msghdr { 158 u_short rtm_msglen; /* to skip over non-understood messages */ 159 u_char rtm_version; /* future binary compatibility */ 160 u_char rtm_type; /* message type */ 161 u_short rtm_index; /* index for associated ifp */ 162 int rtm_flags; /* flags, incl. kern & message, e.g. DONE */ 163 int rtm_addrs; /* bitmask identifying sockaddrs in msg */ 164 pid_t rtm_pid; /* identify sender */ 165 int rtm_seq; /* for sender to identify action */ 166 int rtm_errno; /* why failed */ 167 int rtm_use; /* from rtentry */ 168 u_long rtm_inits; /* which metrics we are initializing */ 169 struct rt_metrics rtm_rmx; /* metrics themselves */ 170}; 171 172#define RTM_VERSION 3 /* Up the ante and ignore older versions */ 173 174#define RTM_ADD 0x1 /* Add Route */ 175#define RTM_DELETE 0x2 /* Delete Route */ 176#define RTM_CHANGE 0x3 /* Change Metrics or flags */ 177#define RTM_GET 0x4 /* Report Metrics */ 178#define RTM_LOSING 0x5 /* Kernel Suspects Partitioning */ 179#define RTM_REDIRECT 0x6 /* Told to use different route */ 180#define RTM_MISS 0x7 /* Lookup failed on this address */ 181#define RTM_LOCK 0x8 /* fix specified metrics */ 182#define RTM_OLDADD 0x9 /* caused by SIOCADDRT */ 183#define RTM_OLDDEL 0xa /* caused by SIOCDELRT */ 184#define RTM_RESOLVE 0xb /* req to resolve dst to LL addr */ 185#define RTM_NEWADDR 0xc /* address being added to iface */ 186#define RTM_DELADDR 0xd /* address being removed from iface */ 187#define RTM_IFINFO 0xe /* iface going up/down etc. */ 188 189#define RTV_MTU 0x1 /* init or lock _mtu */ 190#define RTV_HOPCOUNT 0x2 /* init or lock _hopcount */ 191#define RTV_EXPIRE 0x4 /* init or lock _hopcount */ 192#define RTV_RPIPE 0x8 /* init or lock _recvpipe */ 193#define RTV_SPIPE 0x10 /* init or lock _sendpipe */ 194#define RTV_SSTHRESH 0x20 /* init or lock _ssthresh */ 195#define RTV_RTT 0x40 /* init or lock _rtt */ 196#define RTV_RTTVAR 0x80 /* init or lock _rttvar */ 197 198/* 199 * Bitmask values for rtm_addr. 200 */ 201#define RTA_DST 0x1 /* destination sockaddr present */ 202#define RTA_GATEWAY 0x2 /* gateway sockaddr present */ 203#define RTA_NETMASK 0x4 /* netmask sockaddr present */ 204#define RTA_GENMASK 0x8 /* cloning mask sockaddr present */ 205#define RTA_IFP 0x10 /* interface name sockaddr present */ 206#define RTA_IFA 0x20 /* interface addr sockaddr present */ 207#define RTA_AUTHOR 0x40 /* sockaddr for author of redirect */ 208#define RTA_BRD 0x80 /* for NEWADDR, broadcast or p-p dest addr */ 209 210/* 211 * Index offsets for sockaddr array for alternate internal encoding. 212 */ 213#define RTAX_DST 0 /* destination sockaddr present */ 214#define RTAX_GATEWAY 1 /* gateway sockaddr present */ 215#define RTAX_NETMASK 2 /* netmask sockaddr present */ 216#define RTAX_GENMASK 3 /* cloning mask sockaddr present */ 217#define RTAX_IFP 4 /* interface name sockaddr present */ 218#define RTAX_IFA 5 /* interface addr sockaddr present */ 219#define RTAX_AUTHOR 6 /* sockaddr for author of redirect */ 220#define RTAX_BRD 7 /* for NEWADDR, broadcast or p-p dest addr */ 221#define RTAX_MAX 8 /* size of array to allocate */ 222 223struct rt_addrinfo { 224 int rti_addrs; 225 struct sockaddr *rti_info[RTAX_MAX]; 226}; 227 228struct route_cb { 229 int ip_count; 230 int ns_count; 231 int iso_count; 232 int any_count; 233}; 234 235#ifdef KERNEL 236#define RTFREE(rt) \ 237 if ((rt)->rt_refcnt <= 1) \ 238 rtfree(rt); \ 239 else \ 240 (rt)->rt_refcnt--; 241 242struct route_cb route_cb; 243struct rtstat rtstat; 244struct radix_node_head *rt_tables[AF_MAX+1]; 245 246void route_init __P((void)); 247int route_output __P((struct mbuf *, struct socket *)); 248int route_usrreq __P((struct socket *, 249 int, struct mbuf *, struct mbuf *, struct mbuf *)); 250void rt_ifmsg __P((struct ifnet *)); 251void rt_maskedcopy __P((struct sockaddr *, 252 struct sockaddr *, struct sockaddr *)); 253void rt_missmsg __P((int, struct rt_addrinfo *, int, int)); 254void rt_newaddrmsg __P((int, struct ifaddr *, int, struct rtentry *)); 255int rt_setgate __P((struct rtentry *, 256 struct sockaddr *, struct sockaddr *)); 257void rt_setmetrics __P((u_long, struct rt_metrics *, struct rt_metrics *)); 258void rtable_init __P((void **)); 259void rtalloc __P((struct route *)); 260struct rtentry * 261 rtalloc1 __P((struct sockaddr *, int)); 262void rtfree __P((struct rtentry *)); 263int rtinit __P((struct ifaddr *, int, int)); 264int rtioctl __P((int, caddr_t, struct proc *)); 265void rtredirect __P((struct sockaddr *, struct sockaddr *, 266 struct sockaddr *, int, struct sockaddr *, struct rtentry **)); 267int rtrequest __P((int, struct sockaddr *, 268 struct sockaddr *, struct sockaddr *, int, struct rtentry **)); 269#endif 270 271#endif 272