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