]>
Commit | Line | Data |
---|---|---|
1c79356b A |
1 | /* |
2 | * Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project. | |
3 | * 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. Neither the name of the project nor the names of its contributors | |
14 | * may be used to endorse or promote products derived from this software | |
15 | * without specific prior written permission. | |
16 | * | |
17 | * THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND | |
18 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
19 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
20 | * ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE | |
21 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
22 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
23 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
24 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
25 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
26 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
27 | * SUCH DAMAGE. | |
28 | */ | |
29 | ||
30 | /* | |
31 | * Copyright (c) 1985, 1986, 1993 | |
32 | * The Regents of the University of California. All rights reserved. | |
33 | * | |
34 | * Redistribution and use in source and binary forms, with or without | |
35 | * modification, are permitted provided that the following conditions | |
36 | * are met: | |
37 | * 1. Redistributions of source code must retain the above copyright | |
38 | * notice, this list of conditions and the following disclaimer. | |
39 | * 2. Redistributions in binary form must reproduce the above copyright | |
40 | * notice, this list of conditions and the following disclaimer in the | |
41 | * documentation and/or other materials provided with the distribution. | |
42 | * 3. All advertising materials mentioning features or use of this software | |
43 | * must display the following acknowledgement: | |
44 | * This product includes software developed by the University of | |
45 | * California, Berkeley and its contributors. | |
46 | * 4. Neither the name of the University nor the names of its contributors | |
47 | * may be used to endorse or promote products derived from this software | |
48 | * without specific prior written permission. | |
49 | * | |
50 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND | |
51 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE | |
52 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE | |
53 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE | |
54 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL | |
55 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS | |
56 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) | |
57 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT | |
58 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY | |
59 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF | |
60 | * SUCH DAMAGE. | |
61 | * | |
62 | * @(#)in_var.h 8.1 (Berkeley) 6/10/93 | |
63 | */ | |
64 | ||
65 | #ifndef _NETINET6_IN6_VAR_H_ | |
66 | #define _NETINET6_IN6_VAR_H_ | |
67 | ||
68 | /* | |
69 | * Interface address, Internet version. One of these structures | |
70 | * is allocated for each interface with an Internet address. | |
71 | * The ifaddr structure contains the protocol-independent part | |
72 | * of the structure and is assumed to be first. | |
73 | */ | |
74 | ||
75 | /* | |
76 | * pltime/vltime are just for future reference (required to implements 2 | |
77 | * hour rule for hosts). they should never be modified by nd6_timeout or | |
78 | * anywhere else. | |
79 | * userland -> kernel: accept pltime/vltime | |
80 | * kernel -> userland: throuw up everything | |
81 | * in kernel: modify preferred/expire only | |
82 | */ | |
83 | struct in6_addrlifetime { | |
84 | time_t ia6t_expire; /* valid lifetime expiration time */ | |
85 | time_t ia6t_preferred; /* preferred lifetime expiration time */ | |
86 | u_int32_t ia6t_vltime; /* valid lifetime */ | |
87 | u_int32_t ia6t_pltime; /* prefix lifetime */ | |
88 | }; | |
89 | ||
90 | struct in6_ifaddr { | |
91 | struct ifaddr ia_ifa; /* protocol-independent info */ | |
92 | #define ia_ifp ia_ifa.ifa_ifp | |
93 | #define ia_flags ia_ifa.ifa_flags | |
94 | struct sockaddr_in6 ia_addr; /* interface address */ | |
95 | struct sockaddr_in6 ia_net; /* network number of interface */ | |
96 | struct sockaddr_in6 ia_dstaddr; /* space for destination addr */ | |
97 | struct sockaddr_in6 ia_prefixmask; /* prefix mask */ | |
98 | u_int32_t ia_plen; /* prefix length */ | |
99 | struct in6_ifaddr *ia_next; /* next in6 list of IP6 addresses */ | |
100 | #if !(defined(__FreeBSD__) && __FreeBSD__ >= 3) && !defined(__APPLE__) | |
101 | LIST_HEAD(in6_multihead, in6_multi) ia6_multiaddrs; | |
102 | /* list of multicast addresses */ | |
103 | #endif | |
104 | int ia6_flags; | |
105 | ||
106 | struct in6_addrlifetime ia6_lifetime; /* NULL = infty */ | |
107 | struct ifprefix *ia6_ifpr; /* back pointer to ifprefix */ | |
108 | }; | |
109 | ||
110 | /* | |
111 | * IPv6 interface statistics, as defined in RFC2465 Ipv6IfStatsEntry (p12). | |
112 | */ | |
113 | struct in6_ifstat { | |
114 | u_quad_t ifs6_in_receive; /* # of total input datagram */ | |
115 | u_quad_t ifs6_in_hdrerr; /* # of datagrams with invalid hdr */ | |
116 | u_quad_t ifs6_in_toobig; /* # of datagrams exceeded MTU */ | |
117 | u_quad_t ifs6_in_noroute; /* # of datagrams with no route */ | |
118 | u_quad_t ifs6_in_addrerr; /* # of datagrams with invalid dst */ | |
119 | u_quad_t ifs6_in_protounknown; /* # of datagrams with unknown proto */ | |
120 | /* NOTE: increment on final dst if */ | |
121 | u_quad_t ifs6_in_truncated; /* # of truncated datagrams */ | |
122 | u_quad_t ifs6_in_discard; /* # of discarded datagrams */ | |
123 | /* NOTE: fragment timeout is not here */ | |
124 | u_quad_t ifs6_in_deliver; /* # of datagrams delivered to ULP */ | |
125 | /* NOTE: increment on final dst if */ | |
126 | u_quad_t ifs6_out_forward; /* # of datagrams forwarded */ | |
127 | /* NOTE: increment on outgoing if */ | |
128 | u_quad_t ifs6_out_request; /* # of outgoing datagrams from ULP */ | |
129 | /* NOTE: does not include forwrads */ | |
130 | u_quad_t ifs6_out_discard; /* # of discarded datagrams */ | |
131 | u_quad_t ifs6_out_fragok; /* # of datagrams fragmented */ | |
132 | u_quad_t ifs6_out_fragfail; /* # of datagrams failed on fragment */ | |
133 | u_quad_t ifs6_out_fragcreat; /* # of fragment datagrams */ | |
134 | /* NOTE: this is # after fragment */ | |
135 | u_quad_t ifs6_reass_reqd; /* # of incoming fragmented packets */ | |
136 | /* NOTE: increment on final dst if */ | |
137 | u_quad_t ifs6_reass_ok; /* # of reassembled packets */ | |
138 | /* NOTE: this is # after reass */ | |
139 | /* NOTE: increment on final dst if */ | |
140 | u_quad_t ifs6_reass_fail; /* # of reass failures */ | |
141 | /* NOTE: may not be packet count */ | |
142 | /* NOTE: increment on final dst if */ | |
143 | u_quad_t ifs6_in_mcast; /* # of inbound multicast datagrams */ | |
144 | u_quad_t ifs6_out_mcast; /* # of outbound multicast datagrams */ | |
145 | }; | |
146 | ||
147 | /* | |
148 | * ICMPv6 interface statistics, as defined in RFC2466 Ipv6IfIcmpEntry. | |
149 | * XXX: I'm not sure if this file is the right place for this structure... | |
150 | */ | |
151 | struct icmp6_ifstat { | |
152 | /* | |
153 | * Input statistics | |
154 | */ | |
155 | /* ipv6IfIcmpInMsgs, total # of input messages */ | |
156 | u_quad_t ifs6_in_msg; | |
157 | /* ipv6IfIcmpInErrors, # of input error messages */ | |
158 | u_quad_t ifs6_in_error; | |
159 | /* ipv6IfIcmpInDestUnreachs, # of input dest unreach errors */ | |
160 | u_quad_t ifs6_in_dstunreach; | |
161 | /* ipv6IfIcmpInAdminProhibs, # of input administratively prohibited errs */ | |
162 | u_quad_t ifs6_in_adminprohib; | |
163 | /* ipv6IfIcmpInTimeExcds, # of input time exceeded errors */ | |
164 | u_quad_t ifs6_in_timeexceed; | |
165 | /* ipv6IfIcmpInParmProblems, # of input parameter problem errors */ | |
166 | u_quad_t ifs6_in_paramprob; | |
167 | /* ipv6IfIcmpInPktTooBigs, # of input packet too big errors */ | |
168 | u_quad_t ifs6_in_pkttoobig; | |
169 | /* ipv6IfIcmpInEchos, # of input echo requests */ | |
170 | u_quad_t ifs6_in_echo; | |
171 | /* ipv6IfIcmpInEchoReplies, # of input echo replies */ | |
172 | u_quad_t ifs6_in_echoreply; | |
173 | /* ipv6IfIcmpInRouterSolicits, # of input router solicitations */ | |
174 | u_quad_t ifs6_in_routersolicit; | |
175 | /* ipv6IfIcmpInRouterAdvertisements, # of input router advertisements */ | |
176 | u_quad_t ifs6_in_routeradvert; | |
177 | /* ipv6IfIcmpInNeighborSolicits, # of input neighbor solicitations */ | |
178 | u_quad_t ifs6_in_neighborsolicit; | |
179 | /* ipv6IfIcmpInNeighborAdvertisements, # of input neighbor advertisements */ | |
180 | u_quad_t ifs6_in_neighboradvert; | |
181 | /* ipv6IfIcmpInRedirects, # of input redirects */ | |
182 | u_quad_t ifs6_in_redirect; | |
183 | /* ipv6IfIcmpInGroupMembQueries, # of input MLD queries */ | |
184 | u_quad_t ifs6_in_mldquery; | |
185 | /* ipv6IfIcmpInGroupMembResponses, # of input MLD reports */ | |
186 | u_quad_t ifs6_in_mldreport; | |
187 | /* ipv6IfIcmpInGroupMembReductions, # of input MLD done */ | |
188 | u_quad_t ifs6_in_mlddone; | |
189 | ||
190 | /* | |
191 | * Output statistics. We should solve unresolved routing problem... | |
192 | */ | |
193 | /* ipv6IfIcmpOutMsgs, total # of output messages */ | |
194 | u_quad_t ifs6_out_msg; | |
195 | /* ipv6IfIcmpOutErrors, # of output error messages */ | |
196 | u_quad_t ifs6_out_error; | |
197 | /* ipv6IfIcmpOutDestUnreachs, # of output dest unreach errors */ | |
198 | u_quad_t ifs6_out_dstunreach; | |
199 | /* ipv6IfIcmpOutAdminProhibs, # of output administratively prohibited errs */ | |
200 | u_quad_t ifs6_out_adminprohib; | |
201 | /* ipv6IfIcmpOutTimeExcds, # of output time exceeded errors */ | |
202 | u_quad_t ifs6_out_timeexceed; | |
203 | /* ipv6IfIcmpOutParmProblems, # of output parameter problem errors */ | |
204 | u_quad_t ifs6_out_paramprob; | |
205 | /* ipv6IfIcmpOutPktTooBigs, # of output packet too big errors */ | |
206 | u_quad_t ifs6_out_pkttoobig; | |
207 | /* ipv6IfIcmpOutEchos, # of output echo requests */ | |
208 | u_quad_t ifs6_out_echo; | |
209 | /* ipv6IfIcmpOutEchoReplies, # of output echo replies */ | |
210 | u_quad_t ifs6_out_echoreply; | |
211 | /* ipv6IfIcmpOutRouterSolicits, # of output router solicitations */ | |
212 | u_quad_t ifs6_out_routersolicit; | |
213 | /* ipv6IfIcmpOutRouterAdvertisements, # of output router advertisements */ | |
214 | u_quad_t ifs6_out_routeradvert; | |
215 | /* ipv6IfIcmpOutNeighborSolicits, # of output neighbor solicitations */ | |
216 | u_quad_t ifs6_out_neighborsolicit; | |
217 | /* ipv6IfIcmpOutNeighborAdvertisements, # of output neighbor advertisements */ | |
218 | u_quad_t ifs6_out_neighboradvert; | |
219 | /* ipv6IfIcmpOutRedirects, # of output redirects */ | |
220 | u_quad_t ifs6_out_redirect; | |
221 | /* ipv6IfIcmpOutGroupMembQueries, # of output MLD queries */ | |
222 | u_quad_t ifs6_out_mldquery; | |
223 | /* ipv6IfIcmpOutGroupMembResponses, # of output MLD reports */ | |
224 | u_quad_t ifs6_out_mldreport; | |
225 | /* ipv6IfIcmpOutGroupMembReductions, # of output MLD done */ | |
226 | u_quad_t ifs6_out_mlddone; | |
227 | }; | |
228 | ||
229 | struct in6_ifreq { | |
230 | char ifr_name[IFNAMSIZ]; | |
231 | union { | |
232 | struct sockaddr_in6 ifru_addr; | |
233 | struct sockaddr_in6 ifru_dstaddr; | |
234 | short ifru_flags; | |
235 | int ifru_flags6; | |
236 | int ifru_metric; | |
237 | caddr_t ifru_data; | |
238 | struct in6_addrlifetime ifru_lifetime; | |
239 | struct in6_ifstat ifru_stat; | |
240 | struct icmp6_ifstat ifru_icmp6stat; | |
241 | } ifr_ifru; | |
242 | }; | |
243 | ||
244 | struct in6_aliasreq { | |
245 | char ifra_name[IFNAMSIZ]; | |
246 | struct sockaddr_in6 ifra_addr; | |
247 | struct sockaddr_in6 ifra_dstaddr; | |
248 | struct sockaddr_in6 ifra_prefixmask; | |
249 | int ifra_flags; | |
250 | struct in6_addrlifetime ifra_lifetime; | |
251 | }; | |
252 | ||
253 | /* prefix type macro */ | |
254 | #define IN6_PREFIX_ND 1 | |
255 | #define IN6_PREFIX_RR 2 | |
256 | ||
257 | /* | |
258 | * prefix related flags passed between kernel(NDP related part) and | |
259 | * user land command(ifconfig) and daemon(rtadvd). | |
260 | */ | |
261 | struct in6_prflags { | |
262 | struct prf_ra { | |
263 | u_char onlink : 1; | |
264 | u_char autonomous : 1; | |
265 | u_char reserved : 6; | |
266 | } prf_ra; | |
267 | u_char prf_reserved1; | |
268 | u_short prf_reserved2; | |
269 | /* want to put this on 4byte offset */ | |
270 | struct prf_rr { | |
271 | u_char decrvalid : 1; | |
272 | u_char decrprefd : 1; | |
273 | u_char reserved : 6; | |
274 | } prf_rr; | |
275 | u_char prf_reserved3; | |
276 | u_short prf_reserved4; | |
277 | }; | |
278 | ||
279 | struct in6_prefixreq { | |
280 | char ipr_name[IFNAMSIZ]; | |
281 | u_char ipr_origin; | |
282 | u_char ipr_plen; | |
283 | u_int32_t ipr_vltime; | |
284 | u_int32_t ipr_pltime; | |
285 | struct in6_prflags ipr_flags; | |
286 | struct sockaddr_in6 ipr_prefix; | |
287 | }; | |
288 | ||
289 | #define PR_ORIG_RA 0 | |
290 | #define PR_ORIG_RR 1 | |
291 | #define PR_ORIG_STATIC 2 | |
292 | #define PR_ORIG_KERNEL 3 | |
293 | ||
294 | #define ipr_raf_onlink ipr_flags.prf_ra.onlink | |
295 | #define ipr_raf_auto ipr_flags.prf_ra.autonomous | |
296 | ||
297 | #define ipr_statef_onlink ipr_flags.prf_state.onlink | |
298 | ||
299 | #define ipr_rrf_decrvalid ipr_flags.prf_rr.decrvalid | |
300 | #define ipr_rrf_decrprefd ipr_flags.prf_rr.decrprefd | |
301 | ||
302 | struct in6_rrenumreq { | |
303 | char irr_name[IFNAMSIZ]; | |
304 | u_char irr_origin; | |
305 | u_char irr_m_len; /* match len for matchprefix */ | |
306 | u_char irr_m_minlen; /* minlen for matching prefix */ | |
307 | u_char irr_m_maxlen; /* maxlen for matching prefix */ | |
308 | u_char irr_u_uselen; /* uselen for adding prefix */ | |
309 | u_char irr_u_keeplen; /* keeplen from matching prefix */ | |
310 | struct irr_raflagmask { | |
311 | u_char onlink : 1; | |
312 | u_char autonomous : 1; | |
313 | u_char reserved : 6; | |
314 | } irr_raflagmask; | |
315 | u_int32_t irr_vltime; | |
316 | u_int32_t irr_pltime; | |
317 | struct in6_prflags irr_flags; | |
318 | struct sockaddr_in6 irr_matchprefix; | |
319 | struct sockaddr_in6 irr_useprefix; | |
320 | }; | |
321 | ||
322 | #define irr_raf_mask_onlink irr_raflagmask.onlink | |
323 | #define irr_raf_mask_auto irr_raflagmask.autonomous | |
324 | #define irr_raf_mask_reserved irr_raflagmask.reserved | |
325 | ||
326 | #define irr_raf_onlink irr_flags.prf_ra.onlink | |
327 | #define irr_raf_auto irr_flags.prf_ra.autonomous | |
328 | ||
329 | #define irr_statef_onlink irr_flags.prf_state.onlink | |
330 | ||
331 | #define irr_rrf irr_flags.prf_rr | |
332 | #define irr_rrf_decrvalid irr_flags.prf_rr.decrvalid | |
333 | #define irr_rrf_decrprefd irr_flags.prf_rr.decrprefd | |
334 | ||
335 | /* | |
336 | * Given a pointer to an in6_ifaddr (ifaddr), | |
337 | * return a pointer to the addr as a sockaddr_in6 | |
338 | */ | |
339 | #define IA6_IN6(ia) (&((ia)->ia_addr.sin6_addr)) | |
340 | #define IA6_DSTIN6(ia) (&((ia)->ia_dstaddr.sin6_addr)) | |
341 | #define IA6_MASKIN6(ia) (&((ia)->ia_prefixmask.sin6_addr)) | |
342 | #define IA6_SIN6(ia) (&((ia)->ia_addr)) | |
343 | #define IA6_DSTSIN6(ia) (&((ia)->ia_dstaddr)) | |
344 | #define IFA_IN6(x) (&((struct sockaddr_in6 *)((x)->ifa_addr))->sin6_addr) | |
345 | #define IFA_DSTIN6(x) (&((struct sockaddr_in6 *)((x)->ifa_dstaddr))->sin6_addr) | |
346 | ||
347 | #define IFPR_IN6(x) (&((struct sockaddr_in6 *)((x)->ifpr_prefix))->sin6_addr) | |
348 | ||
349 | #ifdef KERNEL | |
350 | #define IN6_ARE_MASKED_ADDR_EQUAL(d, a, m) ( \ | |
351 | (((d)->s6_addr32[0] ^ (a)->s6_addr32[0]) & (m)->s6_addr32[0]) == 0 && \ | |
352 | (((d)->s6_addr32[1] ^ (a)->s6_addr32[1]) & (m)->s6_addr32[1]) == 0 && \ | |
353 | (((d)->s6_addr32[2] ^ (a)->s6_addr32[2]) & (m)->s6_addr32[2]) == 0 && \ | |
354 | (((d)->s6_addr32[3] ^ (a)->s6_addr32[3]) & (m)->s6_addr32[3]) == 0 ) | |
355 | #endif | |
356 | ||
357 | #define SIOCSIFADDR_IN6 _IOW('i', 12, struct in6_ifreq) | |
358 | #define SIOCGIFADDR_IN6 _IOWR('i', 33, struct in6_ifreq) | |
359 | ||
360 | #ifdef KERNEL | |
361 | /* | |
362 | * SIOCSxxx ioctls should be unused (see comments in in6.c), but | |
363 | * we do not shift numbers for binary compatibility. | |
364 | */ | |
365 | #define SIOCSIFDSTADDR_IN6 _IOW('i', 14, struct in6_ifreq) | |
366 | #define SIOCSIFNETMASK_IN6 _IOW('i', 22, struct in6_ifreq) | |
367 | #endif | |
368 | ||
369 | #define SIOCGIFDSTADDR_IN6 _IOWR('i', 34, struct in6_ifreq) | |
370 | #define SIOCGIFNETMASK_IN6 _IOWR('i', 37, struct in6_ifreq) | |
371 | ||
372 | #define SIOCDIFADDR_IN6 _IOW('i', 25, struct in6_ifreq) | |
373 | #define SIOCAIFADDR_IN6 _IOW('i', 26, struct in6_aliasreq) | |
374 | ||
375 | #define SIOCSIFPHYADDR_IN6 _IOW('i', 70, struct in6_aliasreq) | |
376 | #define SIOCGIFPSRCADDR_IN6 _IOWR('i', 71, struct in6_ifreq) | |
377 | #define SIOCGIFPDSTADDR_IN6 _IOWR('i', 72, struct in6_ifreq) | |
378 | ||
379 | #define SIOCGIFAFLAG_IN6 _IOWR('i', 73, struct in6_ifreq) | |
380 | ||
381 | #define SIOCGDRLST_IN6 _IOWR('i', 74, struct in6_drlist) | |
382 | #define SIOCGPRLST_IN6 _IOWR('i', 75, struct in6_prlist) | |
383 | #define SIOCGIFINFO_IN6 _IOWR('i', 76, struct in6_ndireq) | |
384 | #define SIOCSNDFLUSH_IN6 _IOWR('i', 77, struct in6_ifreq) | |
385 | #define SIOCGNBRINFO_IN6 _IOWR('i', 78, struct in6_nbrinfo) | |
386 | #define SIOCSPFXFLUSH_IN6 _IOWR('i', 79, struct in6_ifreq) | |
387 | #define SIOCSRTRFLUSH_IN6 _IOWR('i', 80, struct in6_ifreq) | |
388 | ||
389 | #define SIOCGIFALIFETIME_IN6 _IOWR('i', 81, struct in6_ifreq) | |
390 | #define SIOCSIFALIFETIME_IN6 _IOWR('i', 82, struct in6_ifreq) | |
391 | #define SIOCGIFSTAT_IN6 _IOWR('i', 83, struct in6_ifreq) | |
392 | #define SIOCGIFSTAT_ICMP6 _IOWR('i', 84, struct in6_ifreq) | |
393 | ||
394 | #define SIOCSDEFIFACE_IN6 _IOWR('i', 85, struct in6_ndifreq) | |
395 | #define SIOCGDEFIFACE_IN6 _IOWR('i', 86, struct in6_ndifreq) | |
396 | ||
397 | #define SIOCSIFINFO_FLAGS _IOWR('i', 87, struct in6_ndireq) /* XXX */ | |
398 | ||
399 | #define SIOCSIFPREFIX_IN6 _IOW('i', 100, struct in6_prefixreq) /* set */ | |
400 | #define SIOCGIFPREFIX_IN6 _IOWR('i', 101, struct in6_prefixreq) /* get */ | |
401 | #define SIOCDIFPREFIX_IN6 _IOW('i', 102, struct in6_prefixreq) /* del */ | |
402 | #define SIOCAIFPREFIX_IN6 _IOW('i', 103, struct in6_rrenumreq) /* add */ | |
403 | #define SIOCCIFPREFIX_IN6 _IOW('i', 104, \ | |
404 | struct in6_rrenumreq) /* change */ | |
405 | #define SIOCSGIFPREFIX_IN6 _IOW('i', 105, \ | |
406 | struct in6_rrenumreq) /* set global */ | |
407 | ||
408 | #define SIOCGETSGCNT_IN6 _IOWR('u', 106, \ | |
409 | struct sioc_sg_req6) /* get s,g pkt cnt */ | |
410 | #define SIOCGETMIFCNT_IN6 _IOWR('u', 107, \ | |
411 | struct sioc_mif_req6) /* get pkt cnt per if */ | |
412 | ||
413 | #define IN6_IFF_ANYCAST 0x01 /* anycast address */ | |
414 | #define IN6_IFF_TENTATIVE 0x02 /* tentative address */ | |
415 | #define IN6_IFF_DUPLICATED 0x04 /* DAD detected duplicate */ | |
416 | #define IN6_IFF_DETACHED 0x08 /* may be detached from the link */ | |
417 | #define IN6_IFF_DEPRECATED 0x10 /* deprecated address */ | |
418 | #define IN6_IFF_NODAD 0x20 /* don't perform DAD on this address | |
419 | * (used only at first SIOC* call) | |
420 | */ | |
421 | ||
422 | /* do not input/output */ | |
423 | #define IN6_IFF_NOTREADY (IN6_IFF_TENTATIVE|IN6_IFF_DUPLICATED) | |
424 | ||
425 | #ifdef KERNEL | |
426 | #define IN6_ARE_SCOPE_CMP(a,b) ((a)-(b)) | |
427 | #define IN6_ARE_SCOPE_EQUAL(a,b) ((a)==(b)) | |
428 | #endif | |
429 | ||
430 | #ifdef KERNEL | |
431 | extern struct in6_ifaddr *in6_ifaddr; | |
432 | ||
433 | extern struct in6_ifstat **in6_ifstat; | |
434 | extern size_t in6_ifstatmax; | |
435 | extern struct icmp6stat icmp6stat; | |
436 | extern struct icmp6_ifstat **icmp6_ifstat; | |
437 | extern size_t icmp6_ifstatmax; | |
438 | #define in6_ifstat_inc(ifp, tag) \ | |
439 | do { \ | |
440 | if ((ifp) && (ifp)->if_index <= if_index \ | |
441 | && (ifp)->if_index < in6_ifstatmax \ | |
442 | && in6_ifstat && in6_ifstat[(ifp)->if_index]) { \ | |
443 | in6_ifstat[(ifp)->if_index]->tag++; \ | |
444 | } \ | |
445 | } while (0) | |
446 | ||
447 | extern struct ifqueue ip6intrq; /* IP6 packet input queue */ | |
448 | extern struct in6_addr zeroin6_addr; | |
449 | extern u_char inet6ctlerrmap[]; | |
450 | extern unsigned long in6_maxmtu; | |
451 | #if defined(__FreeBSD__) && __FreeBSD__ >= 3 | |
452 | #ifdef MALLOC_DECLARE | |
453 | MALLOC_DECLARE(M_IPMADDR); | |
454 | #endif /* MALLOC_DECLARE */ | |
455 | #endif | |
456 | ||
457 | /* | |
458 | * Macro for finding the internet address structure (in6_ifaddr) corresponding | |
459 | * to a given interface (ifnet structure). | |
460 | */ | |
461 | #if defined(__bsdi__) || (defined(__FreeBSD__) && __FreeBSD__ < 3) | |
462 | ||
463 | #define IFP_TO_IA6(ifp, ia) \ | |
464 | /* struct ifnet *ifp; */ \ | |
465 | /* struct in6_ifaddr *ia; */ \ | |
466 | do { \ | |
467 | struct ifaddr *ifa; \ | |
468 | for (ifa = (ifp)->if_addrlist; ifa; ifa = ifa->ifa_next) { \ | |
469 | if (!ifa->ifa_addr) \ | |
470 | continue; \ | |
471 | if (ifa->ifa_addr->sa_family == AF_INET6) \ | |
472 | break; \ | |
473 | } \ | |
474 | (ia) = (struct in6_ifaddr *)ifa; \ | |
475 | } while (0) | |
476 | ||
477 | #else | |
478 | ||
479 | #define IFP_TO_IA6(ifp, ia) \ | |
480 | /* struct ifnet *ifp; */ \ | |
481 | /* struct in6_ifaddr *ia; */ \ | |
482 | do { \ | |
483 | struct ifaddr *ifa; \ | |
484 | for (ifa = (ifp)->if_addrlist.tqh_first; ifa; ifa = ifa->ifa_list.tqe_next) { \ | |
485 | if (!ifa->ifa_addr) \ | |
486 | continue; \ | |
487 | if (ifa->ifa_addr->sa_family == AF_INET6) \ | |
488 | break; \ | |
489 | } \ | |
490 | (ia) = (struct in6_ifaddr *)ifa; \ | |
491 | } while (0) | |
492 | #endif | |
493 | ||
494 | #endif /* _KERNEL */ | |
495 | ||
496 | /* | |
497 | * Multi-cast membership entry. One for each group/ifp that a PCB | |
498 | * belongs to. | |
499 | */ | |
500 | struct in6_multi_mship { | |
501 | struct in6_multi *i6mm_maddr; /* Multicast address pointer */ | |
502 | LIST_ENTRY(in6_multi_mship) i6mm_chain; /* multicast options chain */ | |
503 | }; | |
504 | ||
505 | struct in6_multi { | |
506 | LIST_ENTRY(in6_multi) in6m_entry; /* list glue */ | |
507 | struct in6_addr in6m_addr; /* IP6 multicast address */ | |
508 | struct ifnet *in6m_ifp; /* back pointer to ifnet */ | |
509 | #if !(defined(__FreeBSD__) && __FreeBSD__ >= 3) && !defined (__APPLE__) | |
510 | struct in6_ifaddr *in6m_ia; /* back pointer to in6_ifaddr */ | |
511 | #else | |
512 | struct ifmultiaddr *in6m_ifma; /* back pointer to ifmultiaddr */ | |
513 | #endif | |
514 | u_int in6m_refcount; /* # membership claims by sockets */ | |
515 | u_int in6m_state; /* state of the membership */ | |
516 | u_int in6m_timer; /* MLD6 listener report timer */ | |
517 | }; | |
518 | ||
519 | #ifdef KERNEL | |
520 | #if defined(__FreeBSD__) && __FreeBSD__ >= 3 || defined (__APPLE__) | |
521 | extern LIST_HEAD(in6_multihead, in6_multi) in6_multihead; | |
522 | #endif | |
523 | ||
524 | /* | |
525 | * Structure used by macros below to remember position when stepping through | |
526 | * all of eht in6_multi records. | |
527 | */ | |
528 | struct in6_multistep { | |
529 | struct in6_ifaddr *i_ia; | |
530 | struct in6_multi *i_in6m; | |
531 | }; | |
532 | ||
533 | /* | |
534 | * Macros for looking up the in6_multi record for a given IP6 multicast | |
535 | * address on a given interface. If no matching record is found, "in6m" | |
536 | * returns NLL. | |
537 | */ | |
538 | ||
539 | #if defined(__FreeBSD__) && __FreeBSD__ >= 3 || defined (__APPLE__) | |
540 | ||
541 | #define IN6_LOOKUP_MULTI(addr, ifp, in6m) \ | |
542 | /* struct in6_addr addr; */ \ | |
543 | /* struct ifnet *ifp; */ \ | |
544 | /* struct in6_multi *in6m; */ \ | |
545 | do { \ | |
546 | register struct ifmultiaddr *ifma; \ | |
547 | for (ifma = (ifp)->if_multiaddrs.lh_first; ifma; \ | |
548 | ifma = ifma->ifma_link.le_next) { \ | |
549 | if (ifma->ifma_addr->sa_family == AF_INET6 \ | |
550 | && IN6_ARE_ADDR_EQUAL(&((struct sockaddr_in6 *)ifma->ifma_addr)->sin6_addr, \ | |
551 | &(addr))) \ | |
552 | break; \ | |
553 | } \ | |
554 | (in6m) = (struct in6_multi *)(ifma ? ifma->ifma_protospec : 0); \ | |
555 | } while(0) | |
556 | ||
557 | /* | |
558 | * Macro to step through all of the in6_multi records, one at a time. | |
559 | * The current position is remembered in "step", which the caller must | |
560 | * provide. IN6_FIRST_MULTI(), below, must be called to initialize "step" | |
561 | * and get the first record. Both macros return a NULL "in6m" when there | |
562 | * are no remaining records. | |
563 | */ | |
564 | #define IN6_NEXT_MULTI(step, in6m) \ | |
565 | /* struct in6_multistep step; */ \ | |
566 | /* struct in6_multi *in6m; */ \ | |
567 | do { \ | |
568 | if (((in6m) = (step).i_in6m) != NULL) \ | |
569 | (step).i_in6m = (step).i_in6m->in6m_entry.le_next; \ | |
570 | } while(0) | |
571 | ||
572 | #define IN6_FIRST_MULTI(step, in6m) \ | |
573 | /* struct in6_multistep step; */ \ | |
574 | /* struct in6_multi *in6m */ \ | |
575 | do { \ | |
576 | (step).i_in6m = in6_multihead.lh_first; \ | |
577 | IN6_NEXT_MULTI((step), (in6m)); \ | |
578 | } while(0) | |
579 | ||
580 | #else /* not FreeBSD3 */ | |
581 | ||
582 | #define IN6_LOOKUP_MULTI(addr, ifp, in6m) \ | |
583 | /* struct in6_addr addr; */ \ | |
584 | /* struct ifnet *ifp; */ \ | |
585 | /* struct in6_multi *in6m; */ \ | |
586 | do { \ | |
587 | register struct in6_ifaddr *ia; \ | |
588 | \ | |
589 | IFP_TO_IA6((ifp), ia); \ | |
590 | if (ia == NULL) \ | |
591 | (in6m) = NULL; \ | |
592 | else \ | |
593 | for ((in6m) = ia->ia6_multiaddrs.lh_first; \ | |
594 | (in6m) != NULL && \ | |
595 | !IN6_ARE_ADDR_EQUAL(&(in6m)->in6m_addr, &(addr)); \ | |
596 | (in6m) = in6m->in6m_entry.le_next) \ | |
597 | continue; \ | |
598 | } while (0) | |
599 | ||
600 | /* | |
601 | * Macro to step through all of the in6_multi records, one at a time. | |
602 | * The current position is remembered in "step", which the caller must | |
603 | * provide. IN6_FIRST_MULTI(), below, must be called to initialize "step" | |
604 | * and get the first record. Both macros return a NULL "in6m" when there | |
605 | * are no remaining records. | |
606 | */ | |
607 | #define IN6_NEXT_MULTI(step, in6m) \ | |
608 | /* struct in6_multistep step; */ \ | |
609 | /* struct in6_multi *in6m; */ \ | |
610 | do { \ | |
611 | if (((in6m) = (step).i_in6m) != NULL) \ | |
612 | (step).i_in6m = (in6m)->in6m_entry.le_next; \ | |
613 | else \ | |
614 | while ((step).i_ia != NULL) { \ | |
615 | (in6m) = (step).i_ia->ia6_multiaddrs.lh_first; \ | |
616 | (step).i_ia = (step).i_ia->ia_next; \ | |
617 | if ((in6m) != NULL) { \ | |
618 | (step).i_in6m = (in6m)->in6m_entry.le_next; \ | |
619 | break; \ | |
620 | } \ | |
621 | } \ | |
622 | } while (0) | |
623 | ||
624 | #define IN6_FIRST_MULTI(step, in6m) \ | |
625 | /* struct in6_multistep step; */ \ | |
626 | /* struct in6_multi *in6m */ \ | |
627 | do { \ | |
628 | (step).i_ia = in6_ifaddr; \ | |
629 | (step).i_in6m = NULL; \ | |
630 | IN6_NEXT_MULTI((step), (in6m)); \ | |
631 | } while (0) | |
632 | ||
633 | #endif /* not FreeBSD3 */ | |
634 | ||
635 | int in6_ifinit __P((struct ifnet *, | |
636 | struct in6_ifaddr *, struct sockaddr_in6 *, int)); | |
637 | struct in6_multi *in6_addmulti __P((struct in6_addr *, struct ifnet *, | |
638 | int *)); | |
639 | void in6_delmulti __P((struct in6_multi *)); | |
640 | void in6_ifscrub __P((struct ifnet *, struct in6_ifaddr *)); | |
641 | extern int in6_ifindex2scopeid __P((int)); | |
642 | extern int in6_mask2len __P((struct in6_addr *)); | |
643 | extern void in6_len2mask __P((struct in6_addr *, int)); | |
644 | #if !defined(__bsdi__) && !(defined(__FreeBSD__) && __FreeBSD__ < 3) && !defined (__APPLE__) | |
645 | int in6_control __P((struct socket *, | |
646 | u_long, caddr_t, struct ifnet *, struct proc *)); | |
647 | #else | |
648 | int in6_control __P((struct socket *, u_long, caddr_t, struct ifnet *)); | |
649 | #endif | |
650 | void in6_purgeaddr __P((struct ifaddr *, struct ifnet *)); | |
651 | void in6_savemkludge __P((struct in6_ifaddr *)); | |
652 | void in6_setmaxmtu __P((void)); | |
653 | void in6_restoremkludge __P((struct in6_ifaddr *, struct ifnet *)); | |
654 | void in6_purgemkludge __P((struct ifnet *)); | |
655 | struct in6_ifaddr *in6ifa_ifpforlinklocal __P((struct ifnet *, int)); | |
656 | struct in6_ifaddr *in6ifa_ifpwithaddr __P((struct ifnet *, | |
657 | struct in6_addr *)); | |
658 | char *ip6_sprintf __P((struct in6_addr *)); | |
659 | int in6_addr2scopeid __P((struct ifnet *, struct in6_addr *)); | |
660 | int in6_matchlen __P((struct in6_addr *, struct in6_addr *)); | |
661 | int in6_are_prefix_equal __P((struct in6_addr *p1, struct in6_addr *p2, | |
662 | int len)); | |
663 | void in6_prefixlen2mask __P((struct in6_addr *maskp, int len)); | |
664 | int in6_prefix_ioctl __P((struct socket *so, u_long cmd, caddr_t data, | |
665 | struct ifnet *ifp)); | |
666 | int in6_prefix_add_ifid __P((int iilen, struct in6_ifaddr *ia)); | |
667 | void in6_prefix_remove_ifid __P((int iilen, struct in6_ifaddr *ia)); | |
668 | void in6_purgeprefix __P((struct ifnet *)); | |
669 | #endif /* _KERNEL */ | |
670 | ||
671 | #endif /* _NETINET6_IN6_VAR_H_ */ |