route.h revision 1.44 1 1.44 dyoung /* $NetBSD: route.h,v 1.44 2006/11/13 05:13:41 dyoung 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.36 agc * 3. Neither the name of the University nor the names of its contributors
16 1.1 cgd * may be used to endorse or promote products derived from this software
17 1.1 cgd * without specific prior written permission.
18 1.1 cgd *
19 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
20 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
23 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 1.1 cgd * SUCH DAMAGE.
30 1.1 cgd *
31 1.11 christos * @(#)route.h 8.5 (Berkeley) 2/8/95
32 1.1 cgd */
33 1.1 cgd
34 1.11 christos #ifndef _NET_ROUTE_H_
35 1.11 christos #define _NET_ROUTE_H_
36 1.13 thorpej
37 1.13 thorpej #include <sys/queue.h>
38 1.14 thorpej #include <sys/socket.h>
39 1.44 dyoung #include <sys/types.h>
40 1.44 dyoung #include <net/if.h>
41 1.13 thorpej
42 1.1 cgd /*
43 1.1 cgd * Kernel resident routing tables.
44 1.39 perry *
45 1.1 cgd * The routing tables are initialized when interface addresses
46 1.1 cgd * are set by making entries for all directly connected interfaces.
47 1.1 cgd */
48 1.1 cgd
49 1.1 cgd /*
50 1.1 cgd * A route consists of a destination address and a reference
51 1.1 cgd * to a routing entry. These are often held by protocols
52 1.1 cgd * in their control blocks, e.g. inpcb.
53 1.1 cgd */
54 1.1 cgd struct route {
55 1.1 cgd struct rtentry *ro_rt;
56 1.1 cgd struct sockaddr ro_dst;
57 1.1 cgd };
58 1.1 cgd
59 1.1 cgd /*
60 1.1 cgd * These numbers are used by reliable protocols for determining
61 1.1 cgd * retransmission behavior and are included in the routing structure.
62 1.1 cgd */
63 1.1 cgd struct rt_metrics {
64 1.1 cgd u_long rmx_locks; /* Kernel must leave these values alone */
65 1.1 cgd u_long rmx_mtu; /* MTU for this path */
66 1.1 cgd u_long rmx_hopcount; /* max hops expected */
67 1.1 cgd u_long rmx_expire; /* lifetime for route, e.g. redirect */
68 1.33 wiz u_long rmx_recvpipe; /* inbound delay-bandwidth product */
69 1.33 wiz u_long rmx_sendpipe; /* outbound delay-bandwidth product */
70 1.1 cgd u_long rmx_ssthresh; /* outbound gateway buffer limit */
71 1.1 cgd u_long rmx_rtt; /* estimated round trip time */
72 1.1 cgd u_long rmx_rttvar; /* estimated rtt variance */
73 1.4 mycroft u_long rmx_pksent; /* packets sent using this route */
74 1.1 cgd };
75 1.1 cgd
76 1.1 cgd /*
77 1.1 cgd * rmx_rtt and rmx_rttvar are stored as microseconds;
78 1.1 cgd * RTTTOPRHZ(rtt) converts to a value suitable for use
79 1.1 cgd * by a protocol slowtimo counter.
80 1.1 cgd */
81 1.1 cgd #define RTM_RTTUNIT 1000000 /* units for rtt, rttvar, as units per sec */
82 1.1 cgd #define RTTTOPRHZ(r) ((r) / (RTM_RTTUNIT / PR_SLOWHZ))
83 1.1 cgd
84 1.1 cgd /*
85 1.1 cgd * We distinguish between routes to hosts and routes to networks,
86 1.1 cgd * preferring the former if available. For each route we infer
87 1.1 cgd * the interface to use from the gateway address supplied when
88 1.1 cgd * the route was entered. Routes that forward packets through
89 1.1 cgd * gateways are marked so that the output routines know to address the
90 1.1 cgd * gateway rather than the ultimate destination.
91 1.1 cgd */
92 1.1 cgd #ifndef RNF_NORMAL
93 1.4 mycroft #include <net/radix.h>
94 1.1 cgd #endif
95 1.1 cgd struct rtentry {
96 1.1 cgd struct radix_node rt_nodes[2]; /* tree glue, and other values */
97 1.40 christos /*XXXUNCONST*/
98 1.40 christos #define rt_key(r) ((struct sockaddr *)__UNCONST((r)->rt_nodes->rn_key))
99 1.40 christos /*XXXUNCONST*/
100 1.40 christos #define rt_mask(r) ((struct sockaddr *)__UNCONST((r)->rt_nodes->rn_mask))
101 1.1 cgd struct sockaddr *rt_gateway; /* value */
102 1.22 ragge int rt_flags; /* up/down?, host/net */
103 1.22 ragge int rt_refcnt; /* # held references */
104 1.1 cgd u_long rt_use; /* raw # packets forwarded */
105 1.1 cgd struct ifnet *rt_ifp; /* the answer: interface to use */
106 1.1 cgd struct ifaddr *rt_ifa; /* the answer: interface to use */
107 1.44 dyoung uint32_t rt_ifa_seqno;
108 1.37 matt const struct sockaddr *rt_genmask; /* for generation of cloned routes */
109 1.1 cgd caddr_t rt_llinfo; /* pointer to link level info cache */
110 1.1 cgd struct rt_metrics rt_rmx; /* metrics used by rx'ing protocols */
111 1.4 mycroft struct rtentry *rt_gwroute; /* implied entry for gatewayed routes */
112 1.12 kml LIST_HEAD(, rttimer) rt_timer; /* queue of timeouts for misc funcs */
113 1.26 itojun struct rtentry *rt_parent; /* parent of cloned route */
114 1.1 cgd };
115 1.1 cgd
116 1.1 cgd /*
117 1.1 cgd * Following structure necessary for 4.3 compatibility;
118 1.1 cgd * We should eventually move it to a compat file.
119 1.1 cgd */
120 1.1 cgd struct ortentry {
121 1.7 cgd u_int32_t rt_hash; /* to speed lookups */
122 1.11 christos struct sockaddr rt_dst; /* key */
123 1.11 christos struct sockaddr rt_gateway; /* value */
124 1.11 christos int16_t rt_flags; /* up/down?, host/net */
125 1.11 christos int16_t rt_refcnt; /* # held references */
126 1.7 cgd u_int32_t rt_use; /* raw # packets forwarded */
127 1.11 christos struct ifnet *rt_ifp; /* the answer: interface to use */
128 1.1 cgd };
129 1.1 cgd
130 1.4 mycroft #define RTF_UP 0x1 /* route usable */
131 1.1 cgd #define RTF_GATEWAY 0x2 /* destination is a gateway */
132 1.1 cgd #define RTF_HOST 0x4 /* host entry (net otherwise) */
133 1.1 cgd #define RTF_REJECT 0x8 /* host or net unreachable */
134 1.1 cgd #define RTF_DYNAMIC 0x10 /* created dynamically (by redirect) */
135 1.1 cgd #define RTF_MODIFIED 0x20 /* modified dynamically (by redirect) */
136 1.1 cgd #define RTF_DONE 0x40 /* message confirmed */
137 1.1 cgd #define RTF_MASK 0x80 /* subnet mask present */
138 1.1 cgd #define RTF_CLONING 0x100 /* generate new routes on use */
139 1.1 cgd #define RTF_XRESOLVE 0x200 /* external daemon resolves name */
140 1.1 cgd #define RTF_LLINFO 0x400 /* generated by ARP or ESIS */
141 1.4 mycroft #define RTF_STATIC 0x800 /* manually added */
142 1.4 mycroft #define RTF_BLACKHOLE 0x1000 /* just discard pkts (during updates) */
143 1.25 itojun #define RTF_CLONED 0x2000 /* this is a cloned route */
144 1.1 cgd #define RTF_PROTO2 0x4000 /* protocol specific routing flag */
145 1.1 cgd #define RTF_PROTO1 0x8000 /* protocol specific routing flag */
146 1.44 dyoung #define RTF_SRC 0x10000 /* route has fixed source address */
147 1.1 cgd
148 1.1 cgd
149 1.1 cgd /*
150 1.1 cgd * Routing statistics.
151 1.1 cgd */
152 1.1 cgd struct rtstat {
153 1.27 itojun u_quad_t rts_badredirect; /* bogus redirect calls */
154 1.27 itojun u_quad_t rts_dynamic; /* routes created by redirects */
155 1.28 enami u_quad_t rts_newgateway; /* routes modified by redirects */
156 1.27 itojun u_quad_t rts_unreach; /* lookups which failed */
157 1.27 itojun u_quad_t rts_wildcard; /* lookups satisfied by a wildcard */
158 1.1 cgd };
159 1.1 cgd /*
160 1.1 cgd * Structures for routing messages.
161 1.1 cgd */
162 1.1 cgd struct rt_msghdr {
163 1.1 cgd u_short rtm_msglen; /* to skip over non-understood messages */
164 1.4 mycroft u_char rtm_version; /* future binary compatibility */
165 1.1 cgd u_char rtm_type; /* message type */
166 1.1 cgd u_short rtm_index; /* index for associated ifp */
167 1.4 mycroft int rtm_flags; /* flags, incl. kern & message, e.g. DONE */
168 1.4 mycroft int rtm_addrs; /* bitmask identifying sockaddrs in msg */
169 1.1 cgd pid_t rtm_pid; /* identify sender */
170 1.1 cgd int rtm_seq; /* for sender to identify action */
171 1.1 cgd int rtm_errno; /* why failed */
172 1.1 cgd int rtm_use; /* from rtentry */
173 1.1 cgd u_long rtm_inits; /* which metrics we are initializing */
174 1.1 cgd struct rt_metrics rtm_rmx; /* metrics themselves */
175 1.1 cgd };
176 1.1 cgd
177 1.4 mycroft #define RTM_VERSION 3 /* Up the ante and ignore older versions */
178 1.1 cgd
179 1.1 cgd #define RTM_ADD 0x1 /* Add Route */
180 1.1 cgd #define RTM_DELETE 0x2 /* Delete Route */
181 1.1 cgd #define RTM_CHANGE 0x3 /* Change Metrics or flags */
182 1.1 cgd #define RTM_GET 0x4 /* Report Metrics */
183 1.1 cgd #define RTM_LOSING 0x5 /* Kernel Suspects Partitioning */
184 1.1 cgd #define RTM_REDIRECT 0x6 /* Told to use different route */
185 1.1 cgd #define RTM_MISS 0x7 /* Lookup failed on this address */
186 1.1 cgd #define RTM_LOCK 0x8 /* fix specified metrics */
187 1.1 cgd #define RTM_OLDADD 0x9 /* caused by SIOCADDRT */
188 1.1 cgd #define RTM_OLDDEL 0xa /* caused by SIOCDELRT */
189 1.1 cgd #define RTM_RESOLVE 0xb /* req to resolve dst to LL addr */
190 1.4 mycroft #define RTM_NEWADDR 0xc /* address being added to iface */
191 1.4 mycroft #define RTM_DELADDR 0xd /* address being removed from iface */
192 1.20 bouyer #define RTM_OIFINFO 0xe /* Old (pre-1.5) RTM_IFINFO message */
193 1.21 thorpej #define RTM_IFINFO 0xf /* iface/link going up/down etc. */
194 1.21 thorpej #define RTM_IFANNOUNCE 0x10 /* iface arrival/departure */
195 1.41 dyoung #define RTM_IEEE80211 0x11 /* IEEE80211 wireless event */
196 1.1 cgd
197 1.1 cgd #define RTV_MTU 0x1 /* init or lock _mtu */
198 1.1 cgd #define RTV_HOPCOUNT 0x2 /* init or lock _hopcount */
199 1.28 enami #define RTV_EXPIRE 0x4 /* init or lock _expire */
200 1.1 cgd #define RTV_RPIPE 0x8 /* init or lock _recvpipe */
201 1.1 cgd #define RTV_SPIPE 0x10 /* init or lock _sendpipe */
202 1.1 cgd #define RTV_SSTHRESH 0x20 /* init or lock _ssthresh */
203 1.1 cgd #define RTV_RTT 0x40 /* init or lock _rtt */
204 1.1 cgd #define RTV_RTTVAR 0x80 /* init or lock _rttvar */
205 1.1 cgd
206 1.4 mycroft /*
207 1.4 mycroft * Bitmask values for rtm_addr.
208 1.4 mycroft */
209 1.1 cgd #define RTA_DST 0x1 /* destination sockaddr present */
210 1.1 cgd #define RTA_GATEWAY 0x2 /* gateway sockaddr present */
211 1.1 cgd #define RTA_NETMASK 0x4 /* netmask sockaddr present */
212 1.1 cgd #define RTA_GENMASK 0x8 /* cloning mask sockaddr present */
213 1.1 cgd #define RTA_IFP 0x10 /* interface name sockaddr present */
214 1.1 cgd #define RTA_IFA 0x20 /* interface addr sockaddr present */
215 1.1 cgd #define RTA_AUTHOR 0x40 /* sockaddr for author of redirect */
216 1.4 mycroft #define RTA_BRD 0x80 /* for NEWADDR, broadcast or p-p dest addr */
217 1.4 mycroft
218 1.4 mycroft /*
219 1.4 mycroft * Index offsets for sockaddr array for alternate internal encoding.
220 1.4 mycroft */
221 1.4 mycroft #define RTAX_DST 0 /* destination sockaddr present */
222 1.4 mycroft #define RTAX_GATEWAY 1 /* gateway sockaddr present */
223 1.4 mycroft #define RTAX_NETMASK 2 /* netmask sockaddr present */
224 1.4 mycroft #define RTAX_GENMASK 3 /* cloning mask sockaddr present */
225 1.4 mycroft #define RTAX_IFP 4 /* interface name sockaddr present */
226 1.4 mycroft #define RTAX_IFA 5 /* interface addr sockaddr present */
227 1.4 mycroft #define RTAX_AUTHOR 6 /* sockaddr for author of redirect */
228 1.4 mycroft #define RTAX_BRD 7 /* for NEWADDR, broadcast or p-p dest addr */
229 1.4 mycroft #define RTAX_MAX 8 /* size of array to allocate */
230 1.4 mycroft
231 1.4 mycroft struct rt_addrinfo {
232 1.4 mycroft int rti_addrs;
233 1.37 matt const struct sockaddr *rti_info[RTAX_MAX];
234 1.24 itojun int rti_flags;
235 1.24 itojun struct ifaddr *rti_ifa;
236 1.24 itojun struct ifnet *rti_ifp;
237 1.24 itojun struct rt_msghdr *rti_rtm;
238 1.4 mycroft };
239 1.1 cgd
240 1.4 mycroft struct route_cb {
241 1.4 mycroft int ip_count;
242 1.18 itojun int ip6_count;
243 1.16 christos int ipx_count;
244 1.4 mycroft int ns_count;
245 1.4 mycroft int iso_count;
246 1.4 mycroft int any_count;
247 1.4 mycroft };
248 1.1 cgd
249 1.39 perry /*
250 1.12 kml * This structure, and the prototypes for the rt_timer_{init,remove_all,
251 1.12 kml * add,timer} functions all used with the kind permission of BSDI.
252 1.12 kml * These allow functions to be called for routes at specific times.
253 1.12 kml */
254 1.12 kml
255 1.12 kml struct rttimer {
256 1.17 thorpej TAILQ_ENTRY(rttimer) rtt_next; /* entry on timer queue */
257 1.17 thorpej LIST_ENTRY(rttimer) rtt_link; /* multiple timers per rtentry */
258 1.38 matt struct rttimer_queue *rtt_queue; /* back pointer to queue */
259 1.38 matt struct rtentry *rtt_rt; /* Back pointer to the route */
260 1.38 matt void (*rtt_func)(struct rtentry *, struct rttimer *);
261 1.38 matt time_t rtt_time; /* When this timer was registered */
262 1.12 kml };
263 1.12 kml
264 1.12 kml struct rttimer_queue {
265 1.12 kml long rtq_timeout;
266 1.23 itojun unsigned long rtq_count;
267 1.17 thorpej TAILQ_HEAD(, rttimer) rtq_head;
268 1.12 kml LIST_ENTRY(rttimer_queue) rtq_link;
269 1.17 thorpej };
270 1.12 kml
271 1.12 kml
272 1.8 jtc #ifdef _KERNEL
273 1.1 cgd #define RTFREE(rt) \
274 1.15 thorpej do { \
275 1.1 cgd if ((rt)->rt_refcnt <= 1) \
276 1.1 cgd rtfree(rt); \
277 1.1 cgd else \
278 1.15 thorpej (rt)->rt_refcnt--; \
279 1.30 perry } while (/*CONSTCOND*/ 0)
280 1.1 cgd
281 1.29 matt extern struct route_cb route_cb;
282 1.29 matt extern struct rtstat rtstat;
283 1.29 matt extern struct radix_node_head *rt_tables[AF_MAX+1];
284 1.4 mycroft
285 1.11 christos struct socket;
286 1.11 christos
287 1.38 matt void route_init(void);
288 1.38 matt int route_output(struct mbuf *, ...);
289 1.38 matt int route_usrreq(struct socket *,
290 1.43 christos int, struct mbuf *, struct mbuf *, struct mbuf *, struct lwp *);
291 1.38 matt void rt_ifannouncemsg(struct ifnet *, int);
292 1.41 dyoung void rt_ieee80211msg(struct ifnet *, int, void *, size_t);
293 1.38 matt void rt_ifmsg(struct ifnet *);
294 1.38 matt void rt_maskedcopy(const struct sockaddr *,
295 1.38 matt struct sockaddr *, const struct sockaddr *);
296 1.38 matt void rt_missmsg(int, struct rt_addrinfo *, int, int);
297 1.38 matt void rt_newaddrmsg(int, struct ifaddr *, int, struct rtentry *);
298 1.38 matt int rt_setgate(struct rtentry *,
299 1.38 matt const struct sockaddr *, const struct sockaddr *);
300 1.38 matt void rt_setmetrics(u_long, const struct rt_metrics *, struct rt_metrics *);
301 1.38 matt int rt_timer_add(struct rtentry *,
302 1.12 kml void(*)(struct rtentry *, struct rttimer *),
303 1.38 matt struct rttimer_queue *);
304 1.38 matt void rt_timer_init(void);
305 1.12 kml struct rttimer_queue *
306 1.38 matt rt_timer_queue_create(u_int);
307 1.38 matt void rt_timer_queue_change(struct rttimer_queue *, long);
308 1.38 matt void rt_timer_queue_remove_all(struct rttimer_queue *, int);
309 1.38 matt void rt_timer_queue_destroy(struct rttimer_queue *, int);
310 1.38 matt void rt_timer_remove_all(struct rtentry *, int);
311 1.38 matt unsigned long rt_timer_count(struct rttimer_queue *);
312 1.38 matt void rt_timer_timer(void *);
313 1.38 matt void rtable_init(void **);
314 1.38 matt void rtalloc(struct route *);
315 1.4 mycroft struct rtentry *
316 1.38 matt rtalloc1(const struct sockaddr *, int);
317 1.38 matt void rtfree(struct rtentry *);
318 1.38 matt int rt_getifa(struct rt_addrinfo *);
319 1.38 matt int rtinit(struct ifaddr *, int, int);
320 1.43 christos int rtioctl(u_long, caddr_t, struct lwp *);
321 1.38 matt void rtredirect(const struct sockaddr *, const struct sockaddr *,
322 1.37 matt const struct sockaddr *, int, const struct sockaddr *,
323 1.38 matt struct rtentry **);
324 1.38 matt int rtrequest(int, const struct sockaddr *,
325 1.37 matt const struct sockaddr *, const struct sockaddr *, int,
326 1.38 matt struct rtentry **);
327 1.38 matt int rtrequest1(int, struct rt_addrinfo *, struct rtentry **);
328 1.44 dyoung
329 1.44 dyoung static inline void
330 1.44 dyoung rt_set_ifa1(struct rtentry *rt, struct ifaddr *ifa)
331 1.44 dyoung {
332 1.44 dyoung rt->rt_ifa = ifa;
333 1.44 dyoung if (ifa->ifa_seqno != NULL)
334 1.44 dyoung rt->rt_ifa_seqno = *ifa->ifa_seqno;
335 1.44 dyoung }
336 1.44 dyoung
337 1.44 dyoung static inline void
338 1.44 dyoung rt_replace_ifa(struct rtentry *rt, struct ifaddr *ifa)
339 1.44 dyoung {
340 1.44 dyoung IFAREF(ifa);
341 1.44 dyoung IFAFREE(rt->rt_ifa);
342 1.44 dyoung rt_set_ifa1(rt, ifa);
343 1.44 dyoung }
344 1.44 dyoung
345 1.44 dyoung static inline struct ifaddr *
346 1.44 dyoung rt_get_ifa(struct rtentry *rt)
347 1.44 dyoung {
348 1.44 dyoung struct ifaddr *ifa;
349 1.44 dyoung
350 1.44 dyoung if ((ifa = rt->rt_ifa) == NULL)
351 1.44 dyoung return NULL;
352 1.44 dyoung else if (ifa->ifa_getifa == NULL || ifa->ifa_seqno == NULL)
353 1.44 dyoung return ifa;
354 1.44 dyoung else if (*ifa->ifa_seqno == rt->rt_ifa_seqno)
355 1.44 dyoung return ifa;
356 1.44 dyoung else {
357 1.44 dyoung ifa = (*ifa->ifa_getifa)(ifa, rt_key(rt));
358 1.44 dyoung if (ifa->ifa_seqno != NULL)
359 1.44 dyoung rt->rt_ifa_seqno = *ifa->ifa_seqno;
360 1.44 dyoung rt_replace_ifa(rt, ifa);
361 1.44 dyoung return ifa;
362 1.44 dyoung }
363 1.44 dyoung }
364 1.44 dyoung
365 1.44 dyoung static inline void
366 1.44 dyoung rt_set_ifa(struct rtentry *rt, struct ifaddr *ifa)
367 1.44 dyoung {
368 1.44 dyoung IFAREF(ifa);
369 1.44 dyoung rt_set_ifa1(rt, ifa);
370 1.44 dyoung }
371 1.44 dyoung
372 1.8 jtc #endif /* _KERNEL */
373 1.42 elad #endif /* !_NET_ROUTE_H_ */
374