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.4 (Berkeley) 1/9/95
| 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.4 (Berkeley) 1/9/95
|
34 * $FreeBSD: head/sys/net/route.h 121770 2003-10-30 23:02:51Z sam $
| 34 * $FreeBSD: head/sys/net/route.h 122334 2003-11-08 23:36:32Z sam $
|
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-bandwidth product */
67 u_long rmx_sendpipe; /* outbound delay-bandwidth 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 u_long rmx_filler[4]; /* will be used for T/TCP later */
73};
74
75/*
76 * rmx_rtt and rmx_rttvar are stored as microseconds;
77 * RTTTOPRHZ(rtt) converts to a value suitable for use
78 * by a protocol slowtimo counter.
79 */
80#define RTM_RTTUNIT 1000000 /* units for rtt, rttvar, as units per sec */
81#define RTTTOPRHZ(r) ((r) / (RTM_RTTUNIT / PR_SLOWHZ))
82
83/*
84 * XXX kernel function pointer `rt_output' is visible to applications.
85 */
86struct mbuf;
87
88/*
89 * We distinguish between routes to hosts and routes to networks,
90 * preferring the former if available. For each route we infer
91 * the interface to use from the gateway address supplied when
92 * the route was entered. Routes that forward packets through
93 * gateways are marked so that the output routines know to address the
94 * gateway rather than the ultimate destination.
95 */
96#ifndef RNF_NORMAL
97#include <net/radix.h>
98#endif
99struct rtentry {
100 struct radix_node rt_nodes[2]; /* tree glue, and other values */
101#define rt_key(r) ((struct sockaddr *)((r)->rt_nodes->rn_key))
102#define rt_mask(r) ((struct sockaddr *)((r)->rt_nodes->rn_mask))
103 struct sockaddr *rt_gateway; /* value */
104 long rt_refcnt; /* # held references */
105 u_long rt_flags; /* up/down?, host/net */
106 struct ifnet *rt_ifp; /* the answer: interface to use */
107 struct ifaddr *rt_ifa; /* the answer: interface to use */
108 struct sockaddr *rt_genmask; /* for generation of cloned routes */
109 caddr_t rt_llinfo; /* pointer to link level info cache */
110 struct rt_metrics rt_rmx; /* metrics used by rx'ing protocols */
111 struct rtentry *rt_gwroute; /* implied entry for gatewayed routes */
112 int (*rt_output)(struct ifnet *, struct mbuf *, struct sockaddr *,
113 struct rtentry *);
114 /* output routine for this (rt,if) */
115 struct rtentry *rt_parent; /* cloning parent of this route */
116#ifdef _KERNEL
117 /* XXX ugly, user apps use this definition but don't have a mtx def */
118 struct mtx rt_mtx; /* mutex for routing entry */
119#endif
120};
121
122/*
123 * Following structure necessary for 4.3 compatibility;
124 * We should eventually move it to a compat file.
125 */
126struct ortentry {
127 u_long rt_hash; /* to speed lookups */
128 struct sockaddr rt_dst; /* key */
129 struct sockaddr rt_gateway; /* value */
130 short rt_flags; /* up/down?, host/net */
131 short rt_refcnt; /* # held references */
132 u_long rt_use; /* raw # packets forwarded */
133 struct ifnet *rt_ifp; /* the answer: interface to use */
134};
135
136#define rt_use rt_rmx.rmx_pksent
137
138#define RTF_UP 0x1 /* route usable */
139#define RTF_GATEWAY 0x2 /* destination is a gateway */
140#define RTF_HOST 0x4 /* host entry (net otherwise) */
141#define RTF_REJECT 0x8 /* host or net unreachable */
142#define RTF_DYNAMIC 0x10 /* created dynamically (by redirect) */
143#define RTF_MODIFIED 0x20 /* modified dynamically (by redirect) */
144#define RTF_DONE 0x40 /* message confirmed */
145/* 0x80 unused, was RTF_DELCLONE */
146#define RTF_CLONING 0x100 /* generate new routes on use */
147#define RTF_XRESOLVE 0x200 /* external daemon resolves name */
148#define RTF_LLINFO 0x400 /* generated by link layer (e.g. ARP) */
149#define RTF_STATIC 0x800 /* manually added */
150#define RTF_BLACKHOLE 0x1000 /* just discard pkts (during updates) */
151#define RTF_PROTO2 0x4000 /* protocol specific routing flag */
152#define RTF_PROTO1 0x8000 /* protocol specific routing flag */
153
154#define RTF_PRCLONING 0x10000 /* protocol requires cloning */
155#define RTF_WASCLONED 0x20000 /* route generated through cloning */
156#define RTF_PROTO3 0x40000 /* protocol specific routing flag */
157/* 0x80000 unused */
158#define RTF_PINNED 0x100000 /* future use */
159#define RTF_LOCAL 0x200000 /* route represents a local address */
160#define RTF_BROADCAST 0x400000 /* route represents a bcast address */
161#define RTF_MULTICAST 0x800000 /* route represents a mcast address */
162 /* 0x1000000 and up unassigned */
163
164/*
165 * Routing statistics.
166 */
167struct rtstat {
168 short rts_badredirect; /* bogus redirect calls */
169 short rts_dynamic; /* routes created by redirects */
170 short rts_newgateway; /* routes modified by redirects */
171 short rts_unreach; /* lookups which failed */
172 short rts_wildcard; /* lookups satisfied by a wildcard */
173};
174/*
175 * Structures for routing messages.
176 */
177struct rt_msghdr {
178 u_short rtm_msglen; /* to skip over non-understood messages */
179 u_char rtm_version; /* future binary compatibility */
180 u_char rtm_type; /* message type */
181 u_short rtm_index; /* index for associated ifp */
182 int rtm_flags; /* flags, incl. kern & message, e.g. DONE */
183 int rtm_addrs; /* bitmask identifying sockaddrs in msg */
184 pid_t rtm_pid; /* identify sender */
185 int rtm_seq; /* for sender to identify action */
186 int rtm_errno; /* why failed */
187 int rtm_use; /* from rtentry */
188 u_long rtm_inits; /* which metrics we are initializing */
189 struct rt_metrics rtm_rmx; /* metrics themselves */
190};
191
192#define RTM_VERSION 5 /* Up the ante and ignore older versions */
193
194/*
195 * Message types.
196 */
197#define RTM_ADD 0x1 /* Add Route */
198#define RTM_DELETE 0x2 /* Delete Route */
199#define RTM_CHANGE 0x3 /* Change Metrics or flags */
200#define RTM_GET 0x4 /* Report Metrics */
201#define RTM_LOSING 0x5 /* Kernel Suspects Partitioning */
202#define RTM_REDIRECT 0x6 /* Told to use different route */
203#define RTM_MISS 0x7 /* Lookup failed on this address */
204#define RTM_LOCK 0x8 /* fix specified metrics */
205#define RTM_OLDADD 0x9 /* caused by SIOCADDRT */
206#define RTM_OLDDEL 0xa /* caused by SIOCDELRT */
207#define RTM_RESOLVE 0xb /* req to resolve dst to LL addr */
208#define RTM_NEWADDR 0xc /* address being added to iface */
209#define RTM_DELADDR 0xd /* address being removed from iface */
210#define RTM_IFINFO 0xe /* iface going up/down etc. */
211#define RTM_NEWMADDR 0xf /* mcast group membership being added to if */
212#define RTM_DELMADDR 0x10 /* mcast group membership being deleted */
213#define RTM_IFANNOUNCE 0x11 /* iface arrival/departure */
214
215/*
216 * Bitmask values for rtm_inits and rmx_locks.
217 */
218#define RTV_MTU 0x1 /* init or lock _mtu */
219#define RTV_HOPCOUNT 0x2 /* init or lock _hopcount */
220#define RTV_EXPIRE 0x4 /* init or lock _expire */
221#define RTV_RPIPE 0x8 /* init or lock _recvpipe */
222#define RTV_SPIPE 0x10 /* init or lock _sendpipe */
223#define RTV_SSTHRESH 0x20 /* init or lock _ssthresh */
224#define RTV_RTT 0x40 /* init or lock _rtt */
225#define RTV_RTTVAR 0x80 /* init or lock _rttvar */
226
227/*
228 * Bitmask values for rtm_addrs.
229 */
230#define RTA_DST 0x1 /* destination sockaddr present */
231#define RTA_GATEWAY 0x2 /* gateway sockaddr present */
232#define RTA_NETMASK 0x4 /* netmask sockaddr present */
233#define RTA_GENMASK 0x8 /* cloning mask sockaddr present */
234#define RTA_IFP 0x10 /* interface name sockaddr present */
235#define RTA_IFA 0x20 /* interface addr sockaddr present */
236#define RTA_AUTHOR 0x40 /* sockaddr for author of redirect */
237#define RTA_BRD 0x80 /* for NEWADDR, broadcast or p-p dest addr */
238
239/*
240 * Index offsets for sockaddr array for alternate internal encoding.
241 */
242#define RTAX_DST 0 /* destination sockaddr present */
243#define RTAX_GATEWAY 1 /* gateway sockaddr present */
244#define RTAX_NETMASK 2 /* netmask sockaddr present */
245#define RTAX_GENMASK 3 /* cloning mask sockaddr present */
246#define RTAX_IFP 4 /* interface name sockaddr present */
247#define RTAX_IFA 5 /* interface addr sockaddr present */
248#define RTAX_AUTHOR 6 /* sockaddr for author of redirect */
249#define RTAX_BRD 7 /* for NEWADDR, broadcast or p-p dest addr */
250#define RTAX_MAX 8 /* size of array to allocate */
251
252struct rt_addrinfo {
253 int rti_addrs;
254 struct sockaddr *rti_info[RTAX_MAX];
255 int rti_flags;
256 struct ifaddr *rti_ifa;
257 struct ifnet *rti_ifp;
258};
259
260#ifdef _KERNEL
261
262#define RT_LOCK_INIT(_rt) \
263 mtx_init(&(_rt)->rt_mtx, "rtentry", NULL, MTX_DEF | MTX_DUPOK)
264#define RT_LOCK(_rt) mtx_lock(&(_rt)->rt_mtx)
265#define RT_UNLOCK(_rt) mtx_unlock(&(_rt)->rt_mtx)
266#define RT_LOCK_DESTROY(_rt) mtx_destroy(&(_rt)->rt_mtx)
267#define RT_LOCK_ASSERT(_rt) mtx_assert(&(_rt)->rt_mtx, MA_OWNED)
268
| 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-bandwidth product */
67 u_long rmx_sendpipe; /* outbound delay-bandwidth 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 u_long rmx_filler[4]; /* will be used for T/TCP later */
73};
74
75/*
76 * rmx_rtt and rmx_rttvar are stored as microseconds;
77 * RTTTOPRHZ(rtt) converts to a value suitable for use
78 * by a protocol slowtimo counter.
79 */
80#define RTM_RTTUNIT 1000000 /* units for rtt, rttvar, as units per sec */
81#define RTTTOPRHZ(r) ((r) / (RTM_RTTUNIT / PR_SLOWHZ))
82
83/*
84 * XXX kernel function pointer `rt_output' is visible to applications.
85 */
86struct mbuf;
87
88/*
89 * We distinguish between routes to hosts and routes to networks,
90 * preferring the former if available. For each route we infer
91 * the interface to use from the gateway address supplied when
92 * the route was entered. Routes that forward packets through
93 * gateways are marked so that the output routines know to address the
94 * gateway rather than the ultimate destination.
95 */
96#ifndef RNF_NORMAL
97#include <net/radix.h>
98#endif
99struct rtentry {
100 struct radix_node rt_nodes[2]; /* tree glue, and other values */
101#define rt_key(r) ((struct sockaddr *)((r)->rt_nodes->rn_key))
102#define rt_mask(r) ((struct sockaddr *)((r)->rt_nodes->rn_mask))
103 struct sockaddr *rt_gateway; /* value */
104 long rt_refcnt; /* # held references */
105 u_long rt_flags; /* up/down?, host/net */
106 struct ifnet *rt_ifp; /* the answer: interface to use */
107 struct ifaddr *rt_ifa; /* the answer: interface to use */
108 struct sockaddr *rt_genmask; /* for generation of cloned routes */
109 caddr_t rt_llinfo; /* pointer to link level info cache */
110 struct rt_metrics rt_rmx; /* metrics used by rx'ing protocols */
111 struct rtentry *rt_gwroute; /* implied entry for gatewayed routes */
112 int (*rt_output)(struct ifnet *, struct mbuf *, struct sockaddr *,
113 struct rtentry *);
114 /* output routine for this (rt,if) */
115 struct rtentry *rt_parent; /* cloning parent of this route */
116#ifdef _KERNEL
117 /* XXX ugly, user apps use this definition but don't have a mtx def */
118 struct mtx rt_mtx; /* mutex for routing entry */
119#endif
120};
121
122/*
123 * Following structure necessary for 4.3 compatibility;
124 * We should eventually move it to a compat file.
125 */
126struct ortentry {
127 u_long rt_hash; /* to speed lookups */
128 struct sockaddr rt_dst; /* key */
129 struct sockaddr rt_gateway; /* value */
130 short rt_flags; /* up/down?, host/net */
131 short rt_refcnt; /* # held references */
132 u_long rt_use; /* raw # packets forwarded */
133 struct ifnet *rt_ifp; /* the answer: interface to use */
134};
135
136#define rt_use rt_rmx.rmx_pksent
137
138#define RTF_UP 0x1 /* route usable */
139#define RTF_GATEWAY 0x2 /* destination is a gateway */
140#define RTF_HOST 0x4 /* host entry (net otherwise) */
141#define RTF_REJECT 0x8 /* host or net unreachable */
142#define RTF_DYNAMIC 0x10 /* created dynamically (by redirect) */
143#define RTF_MODIFIED 0x20 /* modified dynamically (by redirect) */
144#define RTF_DONE 0x40 /* message confirmed */
145/* 0x80 unused, was RTF_DELCLONE */
146#define RTF_CLONING 0x100 /* generate new routes on use */
147#define RTF_XRESOLVE 0x200 /* external daemon resolves name */
148#define RTF_LLINFO 0x400 /* generated by link layer (e.g. ARP) */
149#define RTF_STATIC 0x800 /* manually added */
150#define RTF_BLACKHOLE 0x1000 /* just discard pkts (during updates) */
151#define RTF_PROTO2 0x4000 /* protocol specific routing flag */
152#define RTF_PROTO1 0x8000 /* protocol specific routing flag */
153
154#define RTF_PRCLONING 0x10000 /* protocol requires cloning */
155#define RTF_WASCLONED 0x20000 /* route generated through cloning */
156#define RTF_PROTO3 0x40000 /* protocol specific routing flag */
157/* 0x80000 unused */
158#define RTF_PINNED 0x100000 /* future use */
159#define RTF_LOCAL 0x200000 /* route represents a local address */
160#define RTF_BROADCAST 0x400000 /* route represents a bcast address */
161#define RTF_MULTICAST 0x800000 /* route represents a mcast address */
162 /* 0x1000000 and up unassigned */
163
164/*
165 * Routing statistics.
166 */
167struct rtstat {
168 short rts_badredirect; /* bogus redirect calls */
169 short rts_dynamic; /* routes created by redirects */
170 short rts_newgateway; /* routes modified by redirects */
171 short rts_unreach; /* lookups which failed */
172 short rts_wildcard; /* lookups satisfied by a wildcard */
173};
174/*
175 * Structures for routing messages.
176 */
177struct rt_msghdr {
178 u_short rtm_msglen; /* to skip over non-understood messages */
179 u_char rtm_version; /* future binary compatibility */
180 u_char rtm_type; /* message type */
181 u_short rtm_index; /* index for associated ifp */
182 int rtm_flags; /* flags, incl. kern & message, e.g. DONE */
183 int rtm_addrs; /* bitmask identifying sockaddrs in msg */
184 pid_t rtm_pid; /* identify sender */
185 int rtm_seq; /* for sender to identify action */
186 int rtm_errno; /* why failed */
187 int rtm_use; /* from rtentry */
188 u_long rtm_inits; /* which metrics we are initializing */
189 struct rt_metrics rtm_rmx; /* metrics themselves */
190};
191
192#define RTM_VERSION 5 /* Up the ante and ignore older versions */
193
194/*
195 * Message types.
196 */
197#define RTM_ADD 0x1 /* Add Route */
198#define RTM_DELETE 0x2 /* Delete Route */
199#define RTM_CHANGE 0x3 /* Change Metrics or flags */
200#define RTM_GET 0x4 /* Report Metrics */
201#define RTM_LOSING 0x5 /* Kernel Suspects Partitioning */
202#define RTM_REDIRECT 0x6 /* Told to use different route */
203#define RTM_MISS 0x7 /* Lookup failed on this address */
204#define RTM_LOCK 0x8 /* fix specified metrics */
205#define RTM_OLDADD 0x9 /* caused by SIOCADDRT */
206#define RTM_OLDDEL 0xa /* caused by SIOCDELRT */
207#define RTM_RESOLVE 0xb /* req to resolve dst to LL addr */
208#define RTM_NEWADDR 0xc /* address being added to iface */
209#define RTM_DELADDR 0xd /* address being removed from iface */
210#define RTM_IFINFO 0xe /* iface going up/down etc. */
211#define RTM_NEWMADDR 0xf /* mcast group membership being added to if */
212#define RTM_DELMADDR 0x10 /* mcast group membership being deleted */
213#define RTM_IFANNOUNCE 0x11 /* iface arrival/departure */
214
215/*
216 * Bitmask values for rtm_inits and rmx_locks.
217 */
218#define RTV_MTU 0x1 /* init or lock _mtu */
219#define RTV_HOPCOUNT 0x2 /* init or lock _hopcount */
220#define RTV_EXPIRE 0x4 /* init or lock _expire */
221#define RTV_RPIPE 0x8 /* init or lock _recvpipe */
222#define RTV_SPIPE 0x10 /* init or lock _sendpipe */
223#define RTV_SSTHRESH 0x20 /* init or lock _ssthresh */
224#define RTV_RTT 0x40 /* init or lock _rtt */
225#define RTV_RTTVAR 0x80 /* init or lock _rttvar */
226
227/*
228 * Bitmask values for rtm_addrs.
229 */
230#define RTA_DST 0x1 /* destination sockaddr present */
231#define RTA_GATEWAY 0x2 /* gateway sockaddr present */
232#define RTA_NETMASK 0x4 /* netmask sockaddr present */
233#define RTA_GENMASK 0x8 /* cloning mask sockaddr present */
234#define RTA_IFP 0x10 /* interface name sockaddr present */
235#define RTA_IFA 0x20 /* interface addr sockaddr present */
236#define RTA_AUTHOR 0x40 /* sockaddr for author of redirect */
237#define RTA_BRD 0x80 /* for NEWADDR, broadcast or p-p dest addr */
238
239/*
240 * Index offsets for sockaddr array for alternate internal encoding.
241 */
242#define RTAX_DST 0 /* destination sockaddr present */
243#define RTAX_GATEWAY 1 /* gateway sockaddr present */
244#define RTAX_NETMASK 2 /* netmask sockaddr present */
245#define RTAX_GENMASK 3 /* cloning mask sockaddr present */
246#define RTAX_IFP 4 /* interface name sockaddr present */
247#define RTAX_IFA 5 /* interface addr sockaddr present */
248#define RTAX_AUTHOR 6 /* sockaddr for author of redirect */
249#define RTAX_BRD 7 /* for NEWADDR, broadcast or p-p dest addr */
250#define RTAX_MAX 8 /* size of array to allocate */
251
252struct rt_addrinfo {
253 int rti_addrs;
254 struct sockaddr *rti_info[RTAX_MAX];
255 int rti_flags;
256 struct ifaddr *rti_ifa;
257 struct ifnet *rti_ifp;
258};
259
260#ifdef _KERNEL
261
262#define RT_LOCK_INIT(_rt) \
263 mtx_init(&(_rt)->rt_mtx, "rtentry", NULL, MTX_DEF | MTX_DUPOK)
264#define RT_LOCK(_rt) mtx_lock(&(_rt)->rt_mtx)
265#define RT_UNLOCK(_rt) mtx_unlock(&(_rt)->rt_mtx)
266#define RT_LOCK_DESTROY(_rt) mtx_destroy(&(_rt)->rt_mtx)
267#define RT_LOCK_ASSERT(_rt) mtx_assert(&(_rt)->rt_mtx, MA_OWNED)
268
|
269#define RTFREE_LOCKED(_rt) do { \
270 if ((_rt)->rt_refcnt <= 1) \
271 rtfree(_rt); \
272 else { \
273 (_rt)->rt_refcnt--; \
274 RT_UNLOCK(_rt); \
275 } \
276 /* guard against invalid refs */ \
277 _rt = 0; \
| 269#define RT_ADDREF(_rt) do { \
270 RT_LOCK_ASSERT(_rt); \
271 KASSERT((_rt)->rt_refcnt >= 0, \
272 ("negative refcnt %ld", (_rt)->rt_refcnt)); \
273 (_rt)->rt_refcnt++; \
274} while (0);
275#define RT_REMREF(_rt) do { \
276 RT_LOCK_ASSERT(_rt); \
277 KASSERT((_rt)->rt_refcnt > 0, \
278 ("bogus refcnt %ld", (_rt)->rt_refcnt)); \
279 (_rt)->rt_refcnt--; \
280} while (0);
281
282#define RTFREE_LOCKED(_rt) do { \
283 if ((_rt)->rt_refcnt <= 1) \
284 rtfree(_rt); \
285 else { \
286 RT_REMREF(_rt); \
287 RT_UNLOCK(_rt); \
288 } \
289 /* guard against invalid refs */ \
290 _rt = 0; \
|
278 } while (0)
| 291 } while (0)
|
279#define RTFREE(_rt) do { \
280 RT_LOCK(_rt); \
281 RTFREE_LOCKED(_rt); \
| 292#define RTFREE(_rt) do { \
293 RT_LOCK(_rt); \
294 RTFREE_LOCKED(_rt); \
|
282 } while (0)
283
284extern struct radix_node_head *rt_tables[AF_MAX+1];
285
286struct ifmultiaddr;
287
288void route_init(void);
289int rt_getifa(struct rt_addrinfo *);
290void rt_ifannouncemsg(struct ifnet *, int);
291void rt_ifmsg(struct ifnet *);
292void rt_missmsg(int, struct rt_addrinfo *, int, int);
293void rt_newaddrmsg(int, struct ifaddr *, int, struct rtentry *);
294void rt_newmaddrmsg(int, struct ifmultiaddr *);
295void rtalloc(struct route *);
296int rt_setgate(struct rtentry *, struct sockaddr *, struct sockaddr *);
297void rtalloc_ign(struct route *, u_long);
298/* NB: the rtentry is returned locked */
299struct rtentry *rtalloc1(struct sockaddr *, int, u_long);
300int rtexpunge(struct rtentry *);
301void rtfree(struct rtentry *);
302int rtinit(struct ifaddr *, int, int);
303int rtioctl(u_long, caddr_t);
304void rtredirect(struct sockaddr *, struct sockaddr *,
305 struct sockaddr *, int, struct sockaddr *);
306int rtrequest(int, struct sockaddr *,
307 struct sockaddr *, struct sockaddr *, int, struct rtentry **);
308int rtrequest1(int, struct rt_addrinfo *, struct rtentry **);
309int rt_check(struct rtentry **, struct rtentry **, struct sockaddr *);
310#endif
311
312#endif
| 295 } while (0)
296
297extern struct radix_node_head *rt_tables[AF_MAX+1];
298
299struct ifmultiaddr;
300
301void route_init(void);
302int rt_getifa(struct rt_addrinfo *);
303void rt_ifannouncemsg(struct ifnet *, int);
304void rt_ifmsg(struct ifnet *);
305void rt_missmsg(int, struct rt_addrinfo *, int, int);
306void rt_newaddrmsg(int, struct ifaddr *, int, struct rtentry *);
307void rt_newmaddrmsg(int, struct ifmultiaddr *);
308void rtalloc(struct route *);
309int rt_setgate(struct rtentry *, struct sockaddr *, struct sockaddr *);
310void rtalloc_ign(struct route *, u_long);
311/* NB: the rtentry is returned locked */
312struct rtentry *rtalloc1(struct sockaddr *, int, u_long);
313int rtexpunge(struct rtentry *);
314void rtfree(struct rtentry *);
315int rtinit(struct ifaddr *, int, int);
316int rtioctl(u_long, caddr_t);
317void rtredirect(struct sockaddr *, struct sockaddr *,
318 struct sockaddr *, int, struct sockaddr *);
319int rtrequest(int, struct sockaddr *,
320 struct sockaddr *, struct sockaddr *, int, struct rtentry **);
321int rtrequest1(int, struct rt_addrinfo *, struct rtentry **);
322int rt_check(struct rtentry **, struct rtentry **, struct sockaddr *);
323#endif
324
325#endif
|