route.h revision 1.13 1 /* $NetBSD: route.h,v 1.13 1998/04/29 17:49:58 thorpej Exp $ */
2
3 /*
4 * Copyright (c) 1980, 1986, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. All advertising materials mentioning features or use of this software
16 * must display the following acknowledgement:
17 * This product includes software developed by the University of
18 * California, Berkeley and its contributors.
19 * 4. Neither the name of the University nor the names of its contributors
20 * may be used to endorse or promote products derived from this software
21 * without specific prior written permission.
22 *
23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 * SUCH DAMAGE.
34 *
35 * @(#)route.h 8.5 (Berkeley) 2/8/95
36 */
37
38 #ifndef _NET_ROUTE_H_
39 #define _NET_ROUTE_H_
40
41 #include <sys/queue.h>
42
43 /*
44 * Kernel resident routing tables.
45 *
46 * The routing tables are initialized when interface addresses
47 * are set by making entries for all directly connected interfaces.
48 */
49
50 /*
51 * A route consists of a destination address and a reference
52 * to a routing entry. These are often held by protocols
53 * in their control blocks, e.g. inpcb.
54 */
55 struct route {
56 struct rtentry *ro_rt;
57 struct sockaddr ro_dst;
58 };
59
60 /*
61 * These numbers are used by reliable protocols for determining
62 * retransmission behavior and are included in the routing structure.
63 */
64 struct rt_metrics {
65 u_long rmx_locks; /* Kernel must leave these values alone */
66 u_long rmx_mtu; /* MTU for this path */
67 u_long rmx_hopcount; /* max hops expected */
68 u_long rmx_expire; /* lifetime for route, e.g. redirect */
69 u_long rmx_recvpipe; /* inbound delay-bandwith product */
70 u_long rmx_sendpipe; /* outbound delay-bandwith product */
71 u_long rmx_ssthresh; /* outbound gateway buffer limit */
72 u_long rmx_rtt; /* estimated round trip time */
73 u_long rmx_rttvar; /* estimated rtt variance */
74 u_long rmx_pksent; /* packets sent using this route */
75 };
76
77 /*
78 * rmx_rtt and rmx_rttvar are stored as microseconds;
79 * RTTTOPRHZ(rtt) converts to a value suitable for use
80 * by a protocol slowtimo counter.
81 */
82 #define RTM_RTTUNIT 1000000 /* units for rtt, rttvar, as units per sec */
83 #define RTTTOPRHZ(r) ((r) / (RTM_RTTUNIT / PR_SLOWHZ))
84
85 /*
86 * We distinguish between routes to hosts and routes to networks,
87 * preferring the former if available. For each route we infer
88 * the interface to use from the gateway address supplied when
89 * the route was entered. Routes that forward packets through
90 * gateways are marked so that the output routines know to address the
91 * gateway rather than the ultimate destination.
92 */
93 #ifndef RNF_NORMAL
94 #include <net/radix.h>
95 #endif
96 struct rtentry {
97 struct radix_node rt_nodes[2]; /* tree glue, and other values */
98 #define rt_key(r) ((struct sockaddr *)((r)->rt_nodes->rn_key))
99 #define rt_mask(r) ((struct sockaddr *)((r)->rt_nodes->rn_mask))
100 struct sockaddr *rt_gateway; /* value */
101 short rt_flags; /* up/down?, host/net */
102 short rt_refcnt; /* # held references */
103 u_long rt_use; /* raw # packets forwarded */
104 struct ifnet *rt_ifp; /* the answer: interface to use */
105 struct ifaddr *rt_ifa; /* the answer: interface to use */
106 struct sockaddr *rt_genmask; /* for generation of cloned routes */
107 caddr_t rt_llinfo; /* pointer to link level info cache */
108 struct rt_metrics rt_rmx; /* metrics used by rx'ing protocols */
109 struct rtentry *rt_gwroute; /* implied entry for gatewayed routes */
110 LIST_HEAD(, rttimer) rt_timer; /* queue of timeouts for misc funcs */
111 };
112
113 /*
114 * Following structure necessary for 4.3 compatibility;
115 * We should eventually move it to a compat file.
116 */
117 struct ortentry {
118 u_int32_t rt_hash; /* to speed lookups */
119 struct sockaddr rt_dst; /* key */
120 struct sockaddr rt_gateway; /* value */
121 int16_t rt_flags; /* up/down?, host/net */
122 int16_t rt_refcnt; /* # held references */
123 u_int32_t rt_use; /* raw # packets forwarded */
124 struct ifnet *rt_ifp; /* the answer: interface to use */
125 };
126
127 #define RTF_UP 0x1 /* route usable */
128 #define RTF_GATEWAY 0x2 /* destination is a gateway */
129 #define RTF_HOST 0x4 /* host entry (net otherwise) */
130 #define RTF_REJECT 0x8 /* host or net unreachable */
131 #define RTF_DYNAMIC 0x10 /* created dynamically (by redirect) */
132 #define RTF_MODIFIED 0x20 /* modified dynamically (by redirect) */
133 #define RTF_DONE 0x40 /* message confirmed */
134 #define RTF_MASK 0x80 /* subnet mask present */
135 #define RTF_CLONING 0x100 /* generate new routes on use */
136 #define RTF_XRESOLVE 0x200 /* external daemon resolves name */
137 #define RTF_LLINFO 0x400 /* generated by ARP or ESIS */
138 #define RTF_STATIC 0x800 /* manually added */
139 #define RTF_BLACKHOLE 0x1000 /* just discard pkts (during updates) */
140 #define RTF_PROTO2 0x4000 /* protocol specific routing flag */
141 #define RTF_PROTO1 0x8000 /* protocol specific routing flag */
142
143
144 /*
145 * Routing statistics.
146 */
147 struct 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 */
157 struct 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
223 struct rt_addrinfo {
224 int rti_addrs;
225 struct sockaddr *rti_info[RTAX_MAX];
226 };
227
228 struct route_cb {
229 int ip_count;
230 int ns_count;
231 int iso_count;
232 int any_count;
233 };
234
235 /*
236 * This structure, and the prototypes for the rt_timer_{init,remove_all,
237 * add,timer} functions all used with the kind permission of BSDI.
238 * These allow functions to be called for routes at specific times.
239 */
240
241 struct rttimer {
242 CIRCLEQ_ENTRY(rttimer) rtt_next;
243 LIST_ENTRY(rttimer) rtt_link; /* Multiple timers on single route */
244 struct rttimer_queue *rtt_queue;
245 struct rtentry *rtt_rt; /* Back pointer to the route */
246 void (*rtt_func) __P((struct rtentry *,
247 struct rttimer *));
248 time_t rtt_time; /* When this timer was registered */
249 };
250
251 struct rttimer_queue {
252 long rtq_timeout;
253 CIRCLEQ_HEAD(, rttimer) rtq_head;
254 LIST_ENTRY(rttimer_queue) rtq_link;
255 };
256
257
258 #ifdef _KERNEL
259 #define RTFREE(rt) \
260 if ((rt)->rt_refcnt <= 1) \
261 rtfree(rt); \
262 else \
263 (rt)->rt_refcnt--;
264
265 struct route_cb route_cb;
266 struct rtstat rtstat;
267 struct radix_node_head *rt_tables[AF_MAX+1];
268
269 struct socket;
270
271 void route_init __P((void));
272 int route_output __P((struct mbuf *, ...));
273 int route_usrreq __P((struct socket *,
274 int, struct mbuf *, struct mbuf *, struct mbuf *, struct proc *));
275 void rt_ifmsg __P((struct ifnet *));
276 void rt_maskedcopy __P((struct sockaddr *,
277 struct sockaddr *, struct sockaddr *));
278 void rt_missmsg __P((int, struct rt_addrinfo *, int, int));
279 void rt_newaddrmsg __P((int, struct ifaddr *, int, struct rtentry *));
280 int rt_setgate __P((struct rtentry *,
281 struct sockaddr *, struct sockaddr *));
282 void rt_setmetrics __P((u_long, struct rt_metrics *, struct rt_metrics *));
283 int rt_timer_add __P((struct rtentry *,
284 void(*)(struct rtentry *, struct rttimer *),
285 struct rttimer_queue *));
286 void rt_timer_init __P((void));
287 struct rttimer_queue *
288 rt_timer_queue_create __P((u_int));
289 void rt_timer_queue_change __P((struct rttimer_queue *, long));
290 void rt_timer_queue_destroy __P((struct rttimer_queue *, int));
291 void rt_timer_remove_all __P((struct rtentry *));
292 void rt_timer_timer __P((void *));
293 void rtable_init __P((void **));
294 void rtalloc __P((struct route *));
295 struct rtentry *
296 rtalloc1 __P((struct sockaddr *, int));
297 void rtfree __P((struct rtentry *));
298 int rtinit __P((struct ifaddr *, int, int));
299 int rtioctl __P((u_long, caddr_t, struct proc *));
300 void rtredirect __P((struct sockaddr *, struct sockaddr *,
301 struct sockaddr *, int, struct sockaddr *, struct rtentry **));
302 int rtrequest __P((int, struct sockaddr *,
303 struct sockaddr *, struct sockaddr *, int, struct rtentry **));
304 #endif /* _KERNEL */
305 #endif /* _NET_ROUTE_H_ */
306