route.h revision 1.115 1 1.115 christos /* $NetBSD: route.h,v 1.115 2017/12/13 17:43:10 christos 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.109 ozaki #ifdef _KERNEL
42 1.109 ozaki #include <sys/rwlock.h>
43 1.109 ozaki #include <sys/condvar.h>
44 1.109 ozaki #include <sys/pserialize.h>
45 1.110 christos #endif
46 1.109 ozaki #include <sys/psref.h>
47 1.13 thorpej
48 1.68 simonb #if !(defined(_KERNEL) || defined(_STANDALONE))
49 1.67 dyoung #include <stdbool.h>
50 1.67 dyoung #endif
51 1.67 dyoung
52 1.1 cgd /*
53 1.1 cgd * Kernel resident routing tables.
54 1.39 perry *
55 1.1 cgd * The routing tables are initialized when interface addresses
56 1.1 cgd * are set by making entries for all directly connected interfaces.
57 1.1 cgd */
58 1.1 cgd
59 1.1 cgd /*
60 1.67 dyoung * A route consists of a destination address and a reference
61 1.67 dyoung * to a routing entry. These are often held by protocols
62 1.67 dyoung * in their control blocks, e.g. inpcb.
63 1.67 dyoung */
64 1.67 dyoung struct route {
65 1.67 dyoung struct rtentry *_ro_rt;
66 1.67 dyoung struct sockaddr *ro_sa;
67 1.114 ozaki uint64_t ro_rtcache_generation;
68 1.109 ozaki struct psref ro_psref;
69 1.109 ozaki int ro_bound;
70 1.67 dyoung };
71 1.67 dyoung
72 1.67 dyoung /*
73 1.1 cgd * These numbers are used by reliable protocols for determining
74 1.1 cgd * retransmission behavior and are included in the routing structure.
75 1.1 cgd */
76 1.1 cgd struct rt_metrics {
77 1.78 matt uint64_t rmx_locks; /* Kernel must leave these values alone */
78 1.78 matt uint64_t rmx_mtu; /* MTU for this path */
79 1.78 matt uint64_t rmx_hopcount; /* max hops expected */
80 1.78 matt uint64_t rmx_recvpipe; /* inbound delay-bandwidth product */
81 1.78 matt uint64_t rmx_sendpipe; /* outbound delay-bandwidth product */
82 1.78 matt uint64_t rmx_ssthresh; /* outbound gateway buffer limit */
83 1.78 matt uint64_t rmx_rtt; /* estimated round trip time */
84 1.78 matt uint64_t rmx_rttvar; /* estimated rtt variance */
85 1.72 christos time_t rmx_expire; /* lifetime for route, e.g. redirect */
86 1.72 christos time_t rmx_pksent; /* packets sent using this route */
87 1.72 christos };
88 1.72 christos
89 1.1 cgd /*
90 1.1 cgd * rmx_rtt and rmx_rttvar are stored as microseconds;
91 1.1 cgd * RTTTOPRHZ(rtt) converts to a value suitable for use
92 1.1 cgd * by a protocol slowtimo counter.
93 1.1 cgd */
94 1.1 cgd #define RTM_RTTUNIT 1000000 /* units for rtt, rttvar, as units per sec */
95 1.1 cgd #define RTTTOPRHZ(r) ((r) / (RTM_RTTUNIT / PR_SLOWHZ))
96 1.1 cgd
97 1.1 cgd /*
98 1.1 cgd * We distinguish between routes to hosts and routes to networks,
99 1.1 cgd * preferring the former if available. For each route we infer
100 1.1 cgd * the interface to use from the gateway address supplied when
101 1.1 cgd * the route was entered. Routes that forward packets through
102 1.1 cgd * gateways are marked so that the output routines know to address the
103 1.1 cgd * gateway rather than the ultimate destination.
104 1.1 cgd */
105 1.1 cgd #ifndef RNF_NORMAL
106 1.4 mycroft #include <net/radix.h>
107 1.1 cgd #endif
108 1.1 cgd struct rtentry {
109 1.1 cgd struct radix_node rt_nodes[2]; /* tree glue, and other values */
110 1.57 dyoung #define rt_mask(r) ((const struct sockaddr *)((r)->rt_nodes->rn_mask))
111 1.1 cgd struct sockaddr *rt_gateway; /* value */
112 1.22 ragge int rt_flags; /* up/down?, host/net */
113 1.22 ragge int rt_refcnt; /* # held references */
114 1.78 matt uint64_t rt_use; /* raw # packets forwarded */
115 1.1 cgd struct ifnet *rt_ifp; /* the answer: interface to use */
116 1.1 cgd struct ifaddr *rt_ifa; /* the answer: interface to use */
117 1.44 dyoung uint32_t rt_ifa_seqno;
118 1.52 christos void * rt_llinfo; /* pointer to link level info cache */
119 1.78 matt struct rt_metrics rt_rmx; /* metrics used by rx'ing protocols */
120 1.4 mycroft struct rtentry *rt_gwroute; /* implied entry for gatewayed routes */
121 1.12 kml LIST_HEAD(, rttimer) rt_timer; /* queue of timeouts for misc funcs */
122 1.26 itojun struct rtentry *rt_parent; /* parent of cloned route */
123 1.75 kefren struct sockaddr *_rt_key;
124 1.75 kefren struct sockaddr *rt_tag; /* route tagging info */
125 1.109 ozaki #ifdef _KERNEL
126 1.109 ozaki kcondvar_t rt_cv;
127 1.109 ozaki struct psref_target rt_psref;
128 1.109 ozaki #endif
129 1.1 cgd };
130 1.1 cgd
131 1.57 dyoung static inline const struct sockaddr *
132 1.57 dyoung rt_getkey(const struct rtentry *rt)
133 1.57 dyoung {
134 1.57 dyoung return rt->_rt_key;
135 1.57 dyoung }
136 1.57 dyoung
137 1.1 cgd /*
138 1.1 cgd * Following structure necessary for 4.3 compatibility;
139 1.1 cgd * We should eventually move it to a compat file.
140 1.1 cgd */
141 1.1 cgd struct ortentry {
142 1.69 matt uint32_t rt_hash; /* to speed lookups */
143 1.11 christos struct sockaddr rt_dst; /* key */
144 1.11 christos struct sockaddr rt_gateway; /* value */
145 1.11 christos int16_t rt_flags; /* up/down?, host/net */
146 1.11 christos int16_t rt_refcnt; /* # held references */
147 1.69 matt uint32_t rt_use; /* raw # packets forwarded */
148 1.11 christos struct ifnet *rt_ifp; /* the answer: interface to use */
149 1.1 cgd };
150 1.1 cgd
151 1.4 mycroft #define RTF_UP 0x1 /* route usable */
152 1.1 cgd #define RTF_GATEWAY 0x2 /* destination is a gateway */
153 1.1 cgd #define RTF_HOST 0x4 /* host entry (net otherwise) */
154 1.1 cgd #define RTF_REJECT 0x8 /* host or net unreachable */
155 1.1 cgd #define RTF_DYNAMIC 0x10 /* created dynamically (by redirect) */
156 1.1 cgd #define RTF_MODIFIED 0x20 /* modified dynamically (by redirect) */
157 1.1 cgd #define RTF_DONE 0x40 /* message confirmed */
158 1.1 cgd #define RTF_MASK 0x80 /* subnet mask present */
159 1.98 ozaki // #define RTF_CLONING 0x100 /* generate new routes on use */
160 1.98 ozaki #define RTF_CONNECTED 0x100 /* hosts on this route are neighbours */
161 1.98 ozaki // #define RTF_XRESOLVE 0x200 /* external daemon resolves name */
162 1.98 ozaki // #define RTF_LLINFO 0x400 /* generated by ARP or NDP */
163 1.95 ozaki #define RTF_LLDATA 0x400 /* used by apps to add/del L2 entries */
164 1.4 mycroft #define RTF_STATIC 0x800 /* manually added */
165 1.4 mycroft #define RTF_BLACKHOLE 0x1000 /* just discard pkts (during updates) */
166 1.98 ozaki // #define RTF_CLONED 0x2000 /* this is a cloned route */
167 1.1 cgd #define RTF_PROTO2 0x4000 /* protocol specific routing flag */
168 1.1 cgd #define RTF_PROTO1 0x8000 /* protocol specific routing flag */
169 1.44 dyoung #define RTF_SRC 0x10000 /* route has fixed source address */
170 1.85 roy #define RTF_ANNOUNCE 0x20000 /* announce new ARP or NDP entry */
171 1.87 roy #define RTF_LOCAL 0x40000 /* route represents a local address */
172 1.88 roy #define RTF_BROADCAST 0x80000 /* route represents a bcast address */
173 1.109 ozaki #define RTF_UPDATING 0x100000 /* route is updating */
174 1.1 cgd
175 1.115 christos #define RTFBITS "\020\1UP\2GATEWAY\3HOST\4REJECT\5DYNAMIC\6MODIFIED\7DONE" \
176 1.115 christos "\010MASK_PRESENT\011CONNECTED\012XRESOLVE\013LLDATA\014STATIC" \
177 1.115 christos "\015BLACKHOLE\016CLONED\017PROTO2\020PROTO1\021SRC\022ANNOUNCE" \
178 1.115 christos "\023LOCAL\024BROADCAST\025UPDATING"
179 1.115 christos
180 1.115 christos
181 1.1 cgd /*
182 1.1 cgd * Routing statistics.
183 1.1 cgd */
184 1.1 cgd struct rtstat {
185 1.74 dyoung uint64_t rts_badredirect; /* bogus redirect calls */
186 1.74 dyoung uint64_t rts_dynamic; /* routes created by redirects */
187 1.74 dyoung uint64_t rts_newgateway; /* routes modified by redirects */
188 1.74 dyoung uint64_t rts_unreach; /* lookups which failed */
189 1.74 dyoung uint64_t rts_wildcard; /* lookups satisfied by a wildcard */
190 1.1 cgd };
191 1.78 matt
192 1.1 cgd /*
193 1.78 matt * Structures for routing messages. By forcing the first member to be aligned
194 1.78 matt * at a 64-bit boundary, we also force the size to be a multiple of 64-bits.
195 1.1 cgd */
196 1.78 matt
197 1.78 matt #if !defined(_KERNEL) || !defined(COMPAT_RTSOCK)
198 1.78 matt /*
199 1.78 matt * If we aren't being compiled for backwards compatiblity, enforce 64-bit
200 1.78 matt * alignment so any routing message is the same regardless if the kernel
201 1.78 matt * is an ILP32 or LP64 kernel.
202 1.78 matt */
203 1.78 matt #define __align64 __aligned(sizeof(uint64_t))
204 1.78 matt #else
205 1.78 matt #define __align64
206 1.78 matt #endif
207 1.78 matt
208 1.1 cgd struct rt_msghdr {
209 1.78 matt u_short rtm_msglen __align64;
210 1.78 matt /* to skip over non-understood messages */
211 1.4 mycroft u_char rtm_version; /* future binary compatibility */
212 1.1 cgd u_char rtm_type; /* message type */
213 1.1 cgd u_short rtm_index; /* index for associated ifp */
214 1.4 mycroft int rtm_flags; /* flags, incl. kern & message, e.g. DONE */
215 1.4 mycroft int rtm_addrs; /* bitmask identifying sockaddrs in msg */
216 1.1 cgd pid_t rtm_pid; /* identify sender */
217 1.1 cgd int rtm_seq; /* for sender to identify action */
218 1.1 cgd int rtm_errno; /* why failed */
219 1.1 cgd int rtm_use; /* from rtentry */
220 1.78 matt int rtm_inits; /* which metrics we are initializing */
221 1.78 matt struct rt_metrics rtm_rmx __align64;
222 1.78 matt /* metrics themselves */
223 1.1 cgd };
224 1.1 cgd
225 1.78 matt #undef __align64
226 1.78 matt
227 1.78 matt #define RTM_VERSION 4 /* Up the ante and ignore older versions */
228 1.1 cgd
229 1.1 cgd #define RTM_ADD 0x1 /* Add Route */
230 1.1 cgd #define RTM_DELETE 0x2 /* Delete Route */
231 1.1 cgd #define RTM_CHANGE 0x3 /* Change Metrics or flags */
232 1.1 cgd #define RTM_GET 0x4 /* Report Metrics */
233 1.1 cgd #define RTM_LOSING 0x5 /* Kernel Suspects Partitioning */
234 1.1 cgd #define RTM_REDIRECT 0x6 /* Told to use different route */
235 1.1 cgd #define RTM_MISS 0x7 /* Lookup failed on this address */
236 1.1 cgd #define RTM_LOCK 0x8 /* fix specified metrics */
237 1.1 cgd #define RTM_OLDADD 0x9 /* caused by SIOCADDRT */
238 1.1 cgd #define RTM_OLDDEL 0xa /* caused by SIOCDELRT */
239 1.98 ozaki // #define RTM_RESOLVE 0xb /* req to resolve dst to LL addr */
240 1.103 roy #define RTM_ONEWADDR 0xc /* Old (pre-8.0) RTM_NEWADDR message */
241 1.103 roy #define RTM_ODELADDR 0xd /* Old (pre-8.0) RTM_DELADDR message */
242 1.72 christos #define RTM_OOIFINFO 0xe /* Old (pre-1.5) RTM_IFINFO message */
243 1.78 matt #define RTM_OIFINFO 0xf /* Old (pre-64bit time) RTM_IFINFO message */
244 1.21 thorpej #define RTM_IFANNOUNCE 0x10 /* iface arrival/departure */
245 1.41 dyoung #define RTM_IEEE80211 0x11 /* IEEE80211 wireless event */
246 1.58 dyoung #define RTM_SETGATE 0x12 /* set prototype gateway for clones
247 1.58 dyoung * (see example in arp_rtrequest).
248 1.58 dyoung */
249 1.71 dyoung #define RTM_LLINFO_UPD 0x13 /* indication to ARP/NDP/etc. that link-layer
250 1.71 dyoung * address has changed
251 1.71 dyoung */
252 1.72 christos #define RTM_IFINFO 0x14 /* iface/link going up/down etc. */
253 1.103 roy #define RTM_OCHGADDR 0x15 /* Old (pre-8.0) RTM_CHGADDR message */
254 1.103 roy #define RTM_NEWADDR 0x16 /* address being added to iface */
255 1.103 roy #define RTM_DELADDR 0x17 /* address being removed from iface */
256 1.103 roy #define RTM_CHGADDR 0x18 /* address properties changed */
257 1.1 cgd
258 1.112 roy /*
259 1.112 roy * setsockopt defines used for the filtering.
260 1.112 roy */
261 1.112 roy #define RO_MSGFILTER 1 /* array of which rtm_type to send to client */
262 1.112 roy
263 1.1 cgd #define RTV_MTU 0x1 /* init or lock _mtu */
264 1.1 cgd #define RTV_HOPCOUNT 0x2 /* init or lock _hopcount */
265 1.28 enami #define RTV_EXPIRE 0x4 /* init or lock _expire */
266 1.1 cgd #define RTV_RPIPE 0x8 /* init or lock _recvpipe */
267 1.1 cgd #define RTV_SPIPE 0x10 /* init or lock _sendpipe */
268 1.1 cgd #define RTV_SSTHRESH 0x20 /* init or lock _ssthresh */
269 1.1 cgd #define RTV_RTT 0x40 /* init or lock _rtt */
270 1.1 cgd #define RTV_RTTVAR 0x80 /* init or lock _rttvar */
271 1.1 cgd
272 1.115 christos #define RTVBITS "\020\1MTU\2HOPCOUNT\3EXPIRE\4RECVPIPE\5SENDPIPE" \
273 1.115 christos "\6SSTHRESH\7RTT\010RTTVAR"
274 1.115 christos
275 1.4 mycroft /*
276 1.4 mycroft * Bitmask values for rtm_addr.
277 1.4 mycroft */
278 1.1 cgd #define RTA_DST 0x1 /* destination sockaddr present */
279 1.1 cgd #define RTA_GATEWAY 0x2 /* gateway sockaddr present */
280 1.1 cgd #define RTA_NETMASK 0x4 /* netmask sockaddr present */
281 1.1 cgd #define RTA_GENMASK 0x8 /* cloning mask sockaddr present */
282 1.1 cgd #define RTA_IFP 0x10 /* interface name sockaddr present */
283 1.1 cgd #define RTA_IFA 0x20 /* interface addr sockaddr present */
284 1.1 cgd #define RTA_AUTHOR 0x40 /* sockaddr for author of redirect */
285 1.4 mycroft #define RTA_BRD 0x80 /* for NEWADDR, broadcast or p-p dest addr */
286 1.75 kefren #define RTA_TAG 0x100 /* route tag */
287 1.4 mycroft
288 1.115 christos #define RTABITS "\020\1DST\2GATEWAY\3NETMASK\4GENMASK\5IFP\6IFA\7AUTHOR" \
289 1.115 christos "\010BRD\011TAG"
290 1.115 christos
291 1.4 mycroft /*
292 1.4 mycroft * Index offsets for sockaddr array for alternate internal encoding.
293 1.4 mycroft */
294 1.4 mycroft #define RTAX_DST 0 /* destination sockaddr present */
295 1.4 mycroft #define RTAX_GATEWAY 1 /* gateway sockaddr present */
296 1.4 mycroft #define RTAX_NETMASK 2 /* netmask sockaddr present */
297 1.4 mycroft #define RTAX_GENMASK 3 /* cloning mask sockaddr present */
298 1.4 mycroft #define RTAX_IFP 4 /* interface name sockaddr present */
299 1.4 mycroft #define RTAX_IFA 5 /* interface addr sockaddr present */
300 1.4 mycroft #define RTAX_AUTHOR 6 /* sockaddr for author of redirect */
301 1.4 mycroft #define RTAX_BRD 7 /* for NEWADDR, broadcast or p-p dest addr */
302 1.75 kefren #define RTAX_TAG 8 /* route tag */
303 1.75 kefren #define RTAX_MAX 9 /* size of array to allocate */
304 1.4 mycroft
305 1.111 roy #define RT_ROUNDUP2(a, n) ((a) > 0 ? (1 + (((a) - 1U) | ((n) - 1))) : (n))
306 1.78 matt #define RT_ROUNDUP(a) RT_ROUNDUP2((a), sizeof(uint64_t))
307 1.78 matt #define RT_ADVANCE(x, n) (x += RT_ROUNDUP((n)->sa_len))
308 1.73 christos
309 1.4 mycroft struct rt_addrinfo {
310 1.4 mycroft int rti_addrs;
311 1.37 matt const struct sockaddr *rti_info[RTAX_MAX];
312 1.24 itojun int rti_flags;
313 1.24 itojun struct ifaddr *rti_ifa;
314 1.24 itojun struct ifnet *rti_ifp;
315 1.4 mycroft };
316 1.1 cgd
317 1.4 mycroft struct route_cb {
318 1.4 mycroft int ip_count;
319 1.18 itojun int ip6_count;
320 1.82 joerg int unused1;
321 1.75 kefren int mpls_count;
322 1.4 mycroft int any_count;
323 1.4 mycroft };
324 1.1 cgd
325 1.39 perry /*
326 1.12 kml * This structure, and the prototypes for the rt_timer_{init,remove_all,
327 1.12 kml * add,timer} functions all used with the kind permission of BSDI.
328 1.12 kml * These allow functions to be called for routes at specific times.
329 1.12 kml */
330 1.12 kml
331 1.12 kml struct rttimer {
332 1.17 thorpej TAILQ_ENTRY(rttimer) rtt_next; /* entry on timer queue */
333 1.17 thorpej LIST_ENTRY(rttimer) rtt_link; /* multiple timers per rtentry */
334 1.38 matt struct rttimer_queue *rtt_queue; /* back pointer to queue */
335 1.38 matt struct rtentry *rtt_rt; /* Back pointer to the route */
336 1.38 matt void (*rtt_func)(struct rtentry *, struct rttimer *);
337 1.38 matt time_t rtt_time; /* When this timer was registered */
338 1.12 kml };
339 1.12 kml
340 1.12 kml struct rttimer_queue {
341 1.12 kml long rtq_timeout;
342 1.23 itojun unsigned long rtq_count;
343 1.17 thorpej TAILQ_HEAD(, rttimer) rtq_head;
344 1.12 kml LIST_ENTRY(rttimer_queue) rtq_link;
345 1.17 thorpej };
346 1.12 kml
347 1.12 kml
348 1.79 dyoung struct rtbl;
349 1.79 dyoung typedef struct rtbl rtbl_t;
350 1.79 dyoung
351 1.8 jtc #ifdef _KERNEL
352 1.72 christos
353 1.79 dyoung struct rtbl {
354 1.79 dyoung struct radix_node_head t_rnh;
355 1.79 dyoung };
356 1.79 dyoung
357 1.72 christos struct rt_walkarg {
358 1.72 christos int w_op;
359 1.72 christos int w_arg;
360 1.72 christos int w_given;
361 1.72 christos int w_needed;
362 1.72 christos void * w_where;
363 1.72 christos int w_tmemsize;
364 1.72 christos int w_tmemneeded;
365 1.72 christos void * w_tmem;
366 1.72 christos };
367 1.72 christos
368 1.57 dyoung #if 0
369 1.57 dyoung #define RT_DPRINTF(__fmt, ...) do { } while (/*CONSTCOND*/0)
370 1.57 dyoung #else
371 1.57 dyoung #define RT_DPRINTF(__fmt, ...) /* do nothing */
372 1.57 dyoung #endif
373 1.57 dyoung
374 1.56 dyoung struct rtwalk {
375 1.56 dyoung int (*rw_f)(struct rtentry *, void *);
376 1.56 dyoung void *rw_v;
377 1.56 dyoung };
378 1.78 matt
379 1.78 matt /*
380 1.78 matt * Global data specific to the routing socket.
381 1.78 matt */
382 1.78 matt struct route_info {
383 1.78 matt struct sockaddr ri_dst;
384 1.78 matt struct sockaddr ri_src;
385 1.78 matt struct route_cb ri_cb;
386 1.78 matt int ri_maxqlen;
387 1.78 matt struct ifqueue ri_intrq;
388 1.78 matt void *ri_sih;
389 1.78 matt };
390 1.78 matt
391 1.78 matt extern struct route_info route_info;
392 1.29 matt extern struct rtstat rtstat;
393 1.4 mycroft
394 1.11 christos struct socket;
395 1.11 christos
396 1.90 ozaki void rt_init(void);
397 1.90 ozaki
398 1.90 ozaki int rt_timer_add(struct rtentry *,
399 1.90 ozaki void(*)(struct rtentry *, struct rttimer *),
400 1.90 ozaki struct rttimer_queue *);
401 1.90 ozaki unsigned long
402 1.90 ozaki rt_timer_count(struct rttimer_queue *);
403 1.90 ozaki void rt_timer_queue_change(struct rttimer_queue *, long);
404 1.12 kml struct rttimer_queue *
405 1.90 ozaki rt_timer_queue_create(u_int);
406 1.106 ozaki void rt_timer_queue_destroy(struct rttimer_queue *);
407 1.90 ozaki
408 1.109 ozaki void rt_free(struct rtentry *);
409 1.109 ozaki void rt_unref(struct rtentry *);
410 1.109 ozaki
411 1.109 ozaki int rt_update_prepare(struct rtentry *);
412 1.109 ozaki void rt_update_finish(struct rtentry *);
413 1.109 ozaki
414 1.97 ozaki void rt_newmsg(const int, const struct rtentry *);
415 1.4 mycroft struct rtentry *
416 1.90 ozaki rtalloc1(const struct sockaddr *, int);
417 1.90 ozaki int rtinit(struct ifaddr *, int, int);
418 1.90 ozaki void rtredirect(const struct sockaddr *, const struct sockaddr *,
419 1.37 matt const struct sockaddr *, int, const struct sockaddr *,
420 1.38 matt struct rtentry **);
421 1.90 ozaki int rtrequest(int, const struct sockaddr *,
422 1.37 matt const struct sockaddr *, const struct sockaddr *, int,
423 1.38 matt struct rtentry **);
424 1.90 ozaki int rtrequest1(int, struct rt_addrinfo *, struct rtentry **);
425 1.92 ozaki int rtrequest_newmsg(const int, const struct sockaddr *,
426 1.92 ozaki const struct sockaddr *, const struct sockaddr *, const int);
427 1.44 dyoung
428 1.90 ozaki int rt_ifa_addlocal(struct ifaddr *);
429 1.90 ozaki int rt_ifa_remlocal(struct ifaddr *, struct ifaddr *);
430 1.90 ozaki struct ifaddr *
431 1.90 ozaki rt_get_ifa(struct rtentry *);
432 1.102 ozaki struct ifaddr *
433 1.102 ozaki rt_getifa(struct rt_addrinfo *, struct psref *);
434 1.102 ozaki struct ifnet *
435 1.102 ozaki rt_getifp(struct rt_addrinfo *, struct psref *);
436 1.49 joerg void rt_replace_ifa(struct rtentry *, struct ifaddr *);
437 1.90 ozaki int rt_setgate(struct rtentry *, const struct sockaddr *);
438 1.49 joerg
439 1.90 ozaki const struct sockaddr *
440 1.90 ozaki rt_settag(struct rtentry *, const struct sockaddr *);
441 1.90 ozaki struct sockaddr *
442 1.101 ozaki rt_gettag(const struct rtentry *);
443 1.75 kefren
444 1.101 ozaki int rt_check_reject_route(const struct rtentry *, const struct ifnet *);
445 1.107 ozaki void rt_delete_matched_entries(sa_family_t,
446 1.107 ozaki int (*)(struct rtentry *, void *), void *);
447 1.109 ozaki int rt_walktree(sa_family_t, int (*)(struct rtentry *, void *), void *);
448 1.96 ozaki
449 1.96 ozaki static inline void
450 1.94 ozaki rt_assert_referenced(const struct rtentry *rt)
451 1.94 ozaki {
452 1.94 ozaki
453 1.94 ozaki KASSERT(rt->rt_refcnt > 0);
454 1.94 ozaki }
455 1.94 ozaki
456 1.109 ozaki void rtcache_copy(struct route *, struct route *);
457 1.49 joerg void rtcache_free(struct route *);
458 1.90 ozaki struct rtentry *
459 1.90 ozaki rtcache_init(struct route *);
460 1.90 ozaki struct rtentry *
461 1.90 ozaki rtcache_init_noclone(struct route *);
462 1.90 ozaki struct rtentry *
463 1.90 ozaki rtcache_lookup2(struct route *, const struct sockaddr *, int,
464 1.90 ozaki int *);
465 1.54 dyoung int rtcache_setdst(struct route *, const struct sockaddr *);
466 1.90 ozaki struct rtentry *
467 1.90 ozaki rtcache_update(struct route *, int);
468 1.49 joerg
469 1.71 dyoung static inline void
470 1.71 dyoung rtcache_invariants(const struct route *ro)
471 1.71 dyoung {
472 1.114 ozaki
473 1.71 dyoung KASSERT(ro->ro_sa != NULL || ro->_ro_rt == NULL);
474 1.71 dyoung }
475 1.71 dyoung
476 1.54 dyoung static inline struct rtentry *
477 1.55 dyoung rtcache_lookup1(struct route *ro, const struct sockaddr *dst, int clone)
478 1.55 dyoung {
479 1.55 dyoung int hit;
480 1.55 dyoung
481 1.55 dyoung return rtcache_lookup2(ro, dst, clone, &hit);
482 1.55 dyoung }
483 1.55 dyoung
484 1.55 dyoung static inline struct rtentry *
485 1.54 dyoung rtcache_lookup(struct route *ro, const struct sockaddr *dst)
486 1.51 dyoung {
487 1.54 dyoung return rtcache_lookup1(ro, dst, 1);
488 1.51 dyoung }
489 1.51 dyoung
490 1.54 dyoung static inline const struct sockaddr *
491 1.54 dyoung rtcache_getdst(const struct route *ro)
492 1.51 dyoung {
493 1.109 ozaki
494 1.71 dyoung rtcache_invariants(ro);
495 1.54 dyoung return ro->ro_sa;
496 1.51 dyoung }
497 1.51 dyoung
498 1.109 ozaki struct rtentry *
499 1.109 ozaki rtcache_validate(struct route *);
500 1.108 ozaki
501 1.109 ozaki void rtcache_unref(struct rtentry *, struct route *);
502 1.108 ozaki
503 1.90 ozaki /* rtsock */
504 1.90 ozaki void rt_ieee80211msg(struct ifnet *, int, void *, size_t);
505 1.90 ozaki void rt_ifannouncemsg(struct ifnet *, int);
506 1.90 ozaki void rt_ifmsg(struct ifnet *);
507 1.90 ozaki void rt_missmsg(int, const struct rt_addrinfo *, int, int);
508 1.90 ozaki struct mbuf *
509 1.90 ozaki rt_msg1(int, struct rt_addrinfo *, void *, int);
510 1.98 ozaki int rt_msg3(int, struct rt_addrinfo *, void *, struct rt_walkarg *, int *);
511 1.90 ozaki void rt_newaddrmsg(int, struct ifaddr *, int, struct rtentry *);
512 1.90 ozaki void route_enqueue(struct mbuf *, int);
513 1.90 ozaki
514 1.113 ozaki struct llentry;
515 1.113 ozaki void rt_clonedmsg(const struct sockaddr *, const struct ifnet *,
516 1.113 ozaki const struct rtentry *);
517 1.113 ozaki
518 1.90 ozaki /* rtbl */
519 1.90 ozaki int rt_addaddr(rtbl_t *, struct rtentry *, const struct sockaddr *);
520 1.90 ozaki void rt_assert_inactive(const struct rtentry *);
521 1.90 ozaki struct rtentry *
522 1.90 ozaki rt_deladdr(rtbl_t *, const struct sockaddr *,
523 1.90 ozaki const struct sockaddr *);
524 1.79 dyoung rtbl_t *rt_gettable(sa_family_t);
525 1.90 ozaki int rt_inithead(rtbl_t **, int);
526 1.90 ozaki struct rtentry *
527 1.90 ozaki rt_lookup(rtbl_t *, const struct sockaddr *,
528 1.90 ozaki const struct sockaddr *);
529 1.90 ozaki struct rtentry *
530 1.90 ozaki rt_matchaddr(rtbl_t *, const struct sockaddr *);
531 1.99 ozaki int rt_refines(const struct sockaddr *, const struct sockaddr *);
532 1.109 ozaki int rtbl_walktree(sa_family_t, int (*)(struct rtentry *, void *), void *);
533 1.107 ozaki struct rtentry *
534 1.107 ozaki rtbl_search_matched_entry(sa_family_t,
535 1.107 ozaki int (*)(struct rtentry *, void *), void *);
536 1.90 ozaki void rtbl_init(void);
537 1.56 dyoung
538 1.8 jtc #endif /* _KERNEL */
539 1.79 dyoung
540 1.42 elad #endif /* !_NET_ROUTE_H_ */
541