]> git.saurik.com Git - apple/xnu.git/blame - bsd/netinet/in_var.h
xnu-1699.26.8.tar.gz
[apple/xnu.git] / bsd / netinet / in_var.h
CommitLineData
1c79356b 1/*
6d2010ae 2 * Copyright (c) 2000-2011 Apple Inc. All rights reserved.
5d5c5d0d 3 *
2d21ac55 4 * @APPLE_OSREFERENCE_LICENSE_HEADER_START@
1c79356b 5 *
2d21ac55
A
6 * This file contains Original Code and/or Modifications of Original Code
7 * as defined in and that are subject to the Apple Public Source License
8 * Version 2.0 (the 'License'). You may not use this file except in
9 * compliance with the License. The rights granted to you under the License
10 * may not be used to create, or enable the creation or redistribution of,
11 * unlawful or unlicensed copies of an Apple operating system, or to
12 * circumvent, violate, or enable the circumvention or violation of, any
13 * terms of an Apple operating system software license agreement.
8f6c56a5 14 *
2d21ac55
A
15 * Please obtain a copy of the License at
16 * http://www.opensource.apple.com/apsl/ and read it before using this file.
17 *
18 * The Original Code and all software distributed under the License are
19 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
8f6c56a5
A
20 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
21 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
2d21ac55
A
22 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
23 * Please see the License for the specific language governing rights and
24 * limitations under the License.
8f6c56a5 25 *
2d21ac55 26 * @APPLE_OSREFERENCE_LICENSE_HEADER_END@
1c79356b
A
27 */
28/*
29 * Copyright (c) 1985, 1986, 1993
30 * The Regents of the University of California. All rights reserved.
31 *
32 * Redistribution and use in source and binary forms, with or without
33 * modification, are permitted provided that the following conditions
34 * are met:
35 * 1. Redistributions of source code must retain the above copyright
36 * notice, this list of conditions and the following disclaimer.
37 * 2. Redistributions in binary form must reproduce the above copyright
38 * notice, this list of conditions and the following disclaimer in the
39 * documentation and/or other materials provided with the distribution.
40 * 3. All advertising materials mentioning features or use of this software
41 * must display the following acknowledgement:
42 * This product includes software developed by the University of
43 * California, Berkeley and its contributors.
44 * 4. Neither the name of the University nor the names of its contributors
45 * may be used to endorse or promote products derived from this software
46 * without specific prior written permission.
47 *
48 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
49 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
50 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
51 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
52 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
53 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
54 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
55 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
56 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
57 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
58 * SUCH DAMAGE.
59 *
60 * @(#)in_var.h 8.2 (Berkeley) 1/9/95
9bccf70c 61 * $FreeBSD: src/sys/netinet/in_var.h,v 1.33.2.2 2001/07/17 10:50:01 ru Exp $
1c79356b
A
62 */
63
64#ifndef _NETINET_IN_VAR_H_
65#define _NETINET_IN_VAR_H_
9bccf70c 66#include <sys/appleapiopts.h>
1c79356b
A
67
68#include <sys/queue.h>
9bccf70c 69#ifdef __APPLE__
1c79356b 70#include <sys/kern_event.h>
9bccf70c
A
71#endif
72
6d2010ae 73#ifdef XNU_KERNEL_PRIVATE
2d21ac55 74#include <net/route.h>
1c79356b
A
75
76/*
77 * Interface address, Internet version. One of these structures
78 * is allocated for each Internet address on an interface.
79 * The ifaddr structure contains the protocol-independent part
80 * of the structure and is assumed to be first.
81 */
82struct in_ifaddr {
2d21ac55
A
83 struct ifaddr ia_ifa; /* protocol-independent info */
84#define ia_ifp ia_ifa.ifa_ifp
85#define ia_flags ia_ifa.ifa_flags
86 /* ia_{,sub}net{,mask} in host order */
b0d623f7
A
87 u_int32_t ia_net; /* network number of interface */
88 u_int32_t ia_netmask; /* mask of net part */
89 u_int32_t ia_subnet; /* subnet number, including net */
90 u_int32_t ia_subnetmask; /* mask of subnet part */
2d21ac55
A
91 struct in_addr ia_netbroadcast; /* to recognize net broadcasts */
92 TAILQ_ENTRY(in_ifaddr) ia_link; /* tailq macro glue */
93 struct sockaddr_in ia_addr; /* reserve space for interface name */
94 struct sockaddr_in ia_dstaddr; /* reserve space for broadcast addr */
95#define ia_broadaddr ia_dstaddr
96 struct sockaddr_in ia_sockmask; /* reserve space for general netmask */
b0d623f7 97 TAILQ_ENTRY(in_ifaddr) ia_hash; /* hash bucket entry */
1c79356b 98};
6d2010ae 99#endif /* XNU_KERNEL_PRIVATE */
1c79356b
A
100
101struct in_aliasreq {
2d21ac55
A
102 char ifra_name[IFNAMSIZ]; /* if name, e.g. "en0" */
103 struct sockaddr_in ifra_addr;
104 struct sockaddr_in ifra_broadaddr;
105#define ifra_dstaddr ifra_broadaddr
106 struct sockaddr_in ifra_mask;
107 u_int32_t ifra_unused; /* not used: used to be 'dlt' */
1c79356b
A
108};
109
1c79356b
A
110/*
111 * Event data, internet style.
112 */
1c79356b 113struct kev_in_data {
55e303ae 114 struct net_event_data link_data;
2d21ac55
A
115 struct in_addr ia_addr;
116 u_int32_t ia_net; /* network number of interface */
117 u_int32_t ia_netmask; /* mask of net part */
118 u_int32_t ia_subnet; /* subnet number, including net */
119 u_int32_t ia_subnetmask; /* mask of subnet part */
120 struct in_addr ia_netbroadcast;/* to recognize net broadcasts */
121 struct in_addr ia_dstaddr;
1c79356b
A
122};
123
90556fb8 124struct kev_in_collision {
2d21ac55
A
125 struct net_event_data link_data; /* link colliding arp was received on */
126 struct in_addr ia_ipaddr; /* IP address we and another node are using */
127 u_char hw_len; /* length of hardware address */
128 u_char hw_addr[0]; /* variable length hardware address */
129};
130
131#ifdef __APPLE_API_PRIVATE
132struct kev_in_portinuse {
133 u_int16_t port; /* conflicting port number in host order */
134 u_int32_t req_pid; /* PID port requestor */
135 u_int32_t reserved[2];
90556fb8 136};
2d21ac55 137#endif
90556fb8 138
1c79356b 139
1c79356b
A
140/*
141 * Define inet event subclass and specific inet events.
142 */
143
144#define KEV_INET_SUBCLASS 1
145
146#define KEV_INET_NEW_ADDR 1
147#define KEV_INET_CHANGED_ADDR 2
148#define KEV_INET_ADDR_DELETED 3
149#define KEV_INET_SIFDSTADDR 4
150#define KEV_INET_SIFBRDADDR 5
151#define KEV_INET_SIFNETMASK 6
90556fb8 152#define KEV_INET_ARPCOLLISION 7 /* use kev_in_collision */
1c79356b 153
2d21ac55
A
154#ifdef __APPLE_API_PRIVATE
155#define KEV_INET_PORTINUSE 8 /* use ken_in_portinuse */
156#endif
157
6d2010ae 158#ifdef XNU_KERNEL_PRIVATE
b0d623f7
A
159#include <net/if_var.h>
160#include <kern/locks.h>
6d2010ae 161#include <sys/tree.h>
1c79356b
A
162/*
163 * Given a pointer to an in_ifaddr (ifaddr),
164 * return a pointer to the addr as a sockaddr_in.
165 */
166#define IA_SIN(ia) (&(((struct in_ifaddr *)(ia))->ia_addr))
167#define IA_DSTSIN(ia) (&(((struct in_ifaddr *)(ia))->ia_dstaddr))
168
169#define IN_LNAOF(in, ifa) \
170 ((ntohl((in).s_addr) & ~((struct in_ifaddr *)(ifa)->ia_subnetmask))
171
b0d623f7
A
172/*
173 * Hash table for IPv4 addresses.
174 */
175__private_extern__ TAILQ_HEAD(in_ifaddrhead, in_ifaddr) in_ifaddrhead;
176__private_extern__ TAILQ_HEAD(in_ifaddrhashhead, in_ifaddr) *in_ifaddrhashtbl;
177__private_extern__ lck_rw_t *in_ifaddr_rwlock;
178
179#define INADDR_HASH(x) (&in_ifaddrhashtbl[inaddr_hashval(x)])
180
1c79356b
A
181extern struct ifqueue ipintrq; /* ip packet input queue */
182extern struct in_addr zeroin_addr;
183extern u_char inetctlerrmap[];
184
2d21ac55
A
185extern int apple_hwcksum_tx;
186extern int apple_hwcksum_rx;
187
1c79356b
A
188/*
189 * Macro for finding the interface (ifnet structure) corresponding to one
190 * of our IP addresses.
191 */
b0d623f7
A
192#define INADDR_TO_IFP(addr, ifp) \
193 /* struct in_addr addr; */ \
194 /* struct ifnet *ifp; */ \
195{ \
196 struct in_ifaddr *ia; \
197 \
198 lck_rw_lock_shared(in_ifaddr_rwlock); \
6d2010ae
A
199 TAILQ_FOREACH(ia, INADDR_HASH((addr).s_addr), ia_hash) { \
200 IFA_LOCK_SPIN(&ia->ia_ifa); \
201 if (IA_SIN(ia)->sin_addr.s_addr == (addr).s_addr) { \
202 IFA_UNLOCK(&ia->ia_ifa); \
b0d623f7 203 break; \
6d2010ae
A
204 } \
205 IFA_UNLOCK(&ia->ia_ifa); \
206 } \
b0d623f7
A
207 (ifp) = (ia == NULL) ? NULL : ia->ia_ifp; \
208 lck_rw_done(in_ifaddr_rwlock); \
1c79356b
A
209}
210
211/*
212 * Macro for finding the internet address structure (in_ifaddr) corresponding
b0d623f7
A
213 * to a given interface (ifnet structure). Caller is responsible for freeing
214 * the reference.
1c79356b 215 */
b0d623f7
A
216#define IFP_TO_IA(ifp, ia) \
217 /* struct ifnet *ifp; */ \
218 /* struct in_ifaddr *ia; */ \
219{ \
220 lck_rw_lock_shared(in_ifaddr_rwlock); \
221 for ((ia) = TAILQ_FIRST(&in_ifaddrhead); \
222 (ia) != NULL && (ia)->ia_ifp != (ifp); \
223 (ia) = TAILQ_NEXT((ia), ia_link)) \
224 continue; \
225 if ((ia) != NULL) \
6d2010ae 226 IFA_ADDREF(&(ia)->ia_ifa); \
b0d623f7 227 lck_rw_done(in_ifaddr_rwlock); \
1c79356b 228}
1c79356b
A
229
230/*
231 * This information should be part of the ifnet structure but we don't wish
232 * to change that - as it might break a number of things
233 */
234
6d2010ae
A
235/*
236 * Legacy IPv4 IGMP per-link structure.
237 */
1c79356b
A
238struct router_info {
239 struct ifnet *rti_ifp;
240 int rti_type; /* type of router which is querier on this interface */
241 int rti_time; /* # of slow timeouts since last old query */
6d2010ae
A
242 SLIST_ENTRY(router_info) rti_list;
243};
244
245/*
246 * IPv4 multicast IGMP-layer source entry.
247 */
248struct ip_msource {
249 RB_ENTRY(ip_msource) ims_link; /* RB tree links */
250 in_addr_t ims_haddr; /* host byte order */
251 struct ims_st {
252 uint16_t ex; /* # of exclusive members */
253 uint16_t in; /* # of inclusive members */
254 } ims_st[2]; /* state at t0, t1 */
255 uint8_t ims_stp; /* pending query */
256};
257
258/*
259 * IPv4 multicast PCB-layer source entry.
260 */
261struct in_msource {
262 RB_ENTRY(ip_msource) ims_link; /* RB tree links */
263 in_addr_t ims_haddr; /* host byte order */
264 uint8_t imsl_st[2]; /* state before/at commit */
1c79356b
A
265};
266
6d2010ae
A
267RB_HEAD(ip_msource_tree, ip_msource); /* define struct ip_msource_tree */
268
269RB_PROTOTYPE_SC_PREV(__private_extern__, ip_msource_tree, ip_msource,
270 ims_link, ip_msource_cmp);
271
272/*
273 * IPv4 multicast PCB-layer group filter descriptor.
274 */
275struct in_mfilter {
276 struct ip_msource_tree imf_sources; /* source list for (S,G) */
277 u_long imf_nsrc; /* # of source entries */
278 uint8_t imf_st[2]; /* state before/at commit */
279};
280
281struct igmp_ifinfo;
282
1c79356b 283/*
6d2010ae
A
284 * IPv4 group descriptor.
285 *
286 * For every entry on an ifnet's if_multiaddrs list which represents
287 * an IP multicast group, there is one of these structures.
288 *
289 * If any source filters are present, then a node will exist in the RB-tree
290 * to permit fast lookup by source whenever an operation takes place.
291 * This permits pre-order traversal when we issue reports.
292 * Source filter trees are kept separately from the socket layer to
293 * greatly simplify locking.
294 *
295 * When IGMPv3 is active, inm_timer is the response to group query timer.
296 * The state-change timer inm_sctimer is separate; whenever state changes
297 * for the group the state change record is generated and transmitted,
298 * and kept if retransmissions are necessary.
299 *
300 * FUTURE: inm_link is now only used when groups are being purged
301 * on a detaching ifnet. It could be demoted to a SLIST_ENTRY, but
302 * because it is at the very start of the struct, we can't do this
303 * w/o breaking the ABI for ifmcstat.
1c79356b
A
304 */
305struct in_multi {
6d2010ae
A
306 decl_lck_mtx_data(, inm_lock);
307 u_int32_t inm_refcount; /* reference count */
308 u_int32_t inm_reqcnt; /* request count for this address */
309 u_int32_t inm_debug; /* see ifa_debug flags */
1c79356b
A
310 LIST_ENTRY(in_multi) inm_link; /* queue macro glue */
311 struct in_addr inm_addr; /* IP multicast address, convenience */
312 struct ifnet *inm_ifp; /* back pointer to ifnet */
313 struct ifmultiaddr *inm_ifma; /* back pointer to ifmultiaddr */
6d2010ae 314 u_int inm_timer; /* IGMPv1/v2 group / v3 query timer */
1c79356b 315 u_int inm_state; /* state of the membership */
6d2010ae
A
316 void *inm_rti; /* unused, legacy field */
317
318 /* New fields for IGMPv3 follow. */
319 struct igmp_ifinfo *inm_igi; /* IGMP info */
320 SLIST_ENTRY(in_multi) inm_nrele; /* to-be-released by IGMP */
321 u_int32_t inm_nrelecnt; /* deferred release count */
322 struct ip_msource_tree inm_srcs; /* tree of sources */
323 u_long inm_nsrc; /* # of tree entries */
324
325 struct ifqueue inm_scq; /* queue of pending
326 * state-change packets */
327 struct timeval inm_lastgsrtv; /* Time of last G-S-R query */
328 uint16_t inm_sctimer; /* state-change timer */
329 uint16_t inm_scrv; /* state-change rexmit count */
330
331 /*
332 * SSM state counters which track state at T0 (the time the last
333 * state-change report's RV timer went to zero) and T1
334 * (time of pending report, i.e. now).
335 * Used for computing IGMPv3 state-change reports. Several refcounts
336 * are maintained here to optimize for common use-cases.
337 */
338 struct inm_st {
339 uint16_t iss_fmode; /* IGMP filter mode */
340 uint16_t iss_asm; /* # of ASM listeners */
341 uint16_t iss_ex; /* # of exclusive members */
342 uint16_t iss_in; /* # of inclusive members */
343 uint16_t iss_rec; /* # of recorded sources */
344 } inm_st[2]; /* state at t0, t1 */
345
346 void (*inm_trace) /* callback fn for tracing refs */
347 (struct in_multi *, int);
1c79356b 348};
1c79356b 349
6d2010ae
A
350#define INM_LOCK_ASSERT_HELD(_inm) \
351 lck_mtx_assert(&(_inm)->inm_lock, LCK_MTX_ASSERT_OWNED)
352
353#define INM_LOCK_ASSERT_NOTHELD(_inm) \
354 lck_mtx_assert(&(_inm)->inm_lock, LCK_MTX_ASSERT_NOTOWNED)
355
356#define INM_LOCK(_inm) \
357 lck_mtx_lock(&(_inm)->inm_lock)
358
359#define INM_LOCK_SPIN(_inm) \
360 lck_mtx_lock_spin(&(_inm)->inm_lock)
361
362#define INM_CONVERT_LOCK(_inm) do { \
363 INM_LOCK_ASSERT_HELD(_inm); \
364 lck_mtx_convert_spin(&(_inm)->inm_lock); \
365} while (0)
366
367#define INM_UNLOCK(_inm) \
368 lck_mtx_unlock(&(_inm)->inm_lock)
369
370#define INM_ADDREF(_inm) \
371 inm_addref(_inm, 0)
372
373#define INM_ADDREF_LOCKED(_inm) \
374 inm_addref(_inm, 1)
375
376#define INM_REMREF(_inm) \
377 inm_remref(_inm, 0)
378
379#define INM_REMREF_LOCKED(_inm) \
380 inm_remref(_inm, 1)
381
1c79356b
A
382#ifdef SYSCTL_DECL
383SYSCTL_DECL(_net_inet_ip);
384SYSCTL_DECL(_net_inet_raw);
385#endif
386
387extern LIST_HEAD(in_multihead, in_multi) in_multihead;
388
389/*
390 * Structure used by macros below to remember position when stepping through
391 * all of the in_multi records.
392 */
393struct in_multistep {
394 struct in_multi *i_inm;
395};
396
397/*
398 * Macro for looking up the in_multi record for a given IP multicast address
399 * on a given interface. If no matching record is found, "inm" is set null.
6d2010ae
A
400 *
401 * We do this differently compared other BSD implementations; instead of
402 * walking the if_multiaddrs list at the interface and returning the
403 * ifma_protospec value of a matching entry, we search the global list
404 * of in_multi records and find it that way. Otherwise either the two
405 * structures (in_multi, ifmultiaddr) need to be ref counted both ways,
406 * which will make things too complicated, or they need to reside in the
407 * same protected domain, which they aren't.
408 *
409 * Must be called with in_multihead_lock held.
1c79356b 410 */
6d2010ae
A
411#define IN_LOOKUP_MULTI(addr, ifp, inm) \
412 /* struct in_addr *addr; */ \
413 /* struct ifnet *ifp; */ \
414 /* struct in_multi *inm; */ \
415do { \
416 struct in_multistep _step; \
417 IN_FIRST_MULTI(_step, inm); \
418 while ((inm) != NULL) { \
419 INM_LOCK_SPIN(inm); \
420 if ((inm)->inm_ifp == (ifp) && \
421 (inm)->inm_addr.s_addr == (addr)->s_addr) { \
422 INM_ADDREF_LOCKED(inm); \
423 INM_UNLOCK(inm); \
424 break; \
425 } \
426 INM_UNLOCK(inm); \
427 IN_NEXT_MULTI(_step, inm); \
428 } \
429} while (0)
1c79356b
A
430
431/*
432 * Macro to step through all of the in_multi records, one at a time.
433 * The current position is remembered in "step", which the caller must
434 * provide. IN_FIRST_MULTI(), below, must be called to initialize "step"
435 * and get the first record. Both macros return a NULL "inm" when there
436 * are no remaining records.
6d2010ae
A
437 *
438 * Must be called with in_multihead_lock held.
1c79356b 439 */
6d2010ae
A
440#define IN_NEXT_MULTI(step, inm) \
441 /* struct in_multistep step; */ \
442 /* struct in_multi *inm; */ \
443do { \
444 in_multihead_lock_assert(LCK_RW_ASSERT_HELD); \
445 if (((inm) = (step).i_inm) != NULL) \
446 (step).i_inm = LIST_NEXT((step).i_inm, inm_link); \
447} while (0)
448
449#define IN_FIRST_MULTI(step, inm) \
450 /* struct in_multistep step; */ \
451 /* struct in_multi *inm; */ \
452do { \
453 in_multihead_lock_assert(LCK_RW_ASSERT_HELD); \
454 (step).i_inm = LIST_FIRST(&in_multihead); \
455 IN_NEXT_MULTI((step), (inm)); \
456} while (0)
1c79356b
A
457
458struct route;
6d2010ae
A
459struct ip_moptions;
460
461/*
462 * Return values for imo_multi_filter().
463 */
464#define MCAST_PASS 0 /* Pass */
465#define MCAST_NOTGMEMBER 1 /* This host not a member of group */
466#define MCAST_NOTSMEMBER 2 /* This host excluded source */
467#define MCAST_MUTED 3 /* [deprecated] */
b0d623f7
A
468
469extern void in_ifaddr_init(void);
6d2010ae
A
470extern int imo_multi_filter(const struct ip_moptions *, const struct ifnet *,
471 const struct sockaddr *, const struct sockaddr *);
472extern int imo_clone(struct ip_moptions *, struct ip_moptions *);
473extern void inm_commit(struct in_multi *);
474extern void inm_clear_recorded(struct in_multi *);
475extern void inm_print(const struct in_multi *);
476extern int inm_record_source(struct in_multi *inm, const in_addr_t);
477extern void inm_release(struct in_multi *);
478extern void in_multi_init(void);
b0d623f7 479extern struct in_multi *in_addmulti(struct in_addr *, struct ifnet *);
6d2010ae
A
480extern void in_delmulti(struct in_multi *);
481extern int in_leavegroup(struct in_multi *, /*const*/ struct in_mfilter *);
482extern int in_multi_detach(struct in_multi *);
483extern void inm_addref(struct in_multi *, int);
484extern void inm_remref(struct in_multi *, int);
485extern void inm_purge(struct in_multi *);
486extern uint8_t ims_get_mode(const struct in_multi *,
487 const struct ip_msource *, uint8_t);
b0d623f7
A
488extern int in_control(struct socket *, u_long, caddr_t, struct ifnet *,
489 struct proc *);
490extern void in_rtqdrain(void);
c910b4d9 491extern struct radix_node *in_validate(struct radix_node *);
b0d623f7
A
492extern void ip_input(struct mbuf *);
493extern int in_ifadown(struct ifaddr *ifa, int);
494extern void in_ifscrub(struct ifnet *, struct in_ifaddr *, int);
b0d623f7 495extern u_int32_t inaddr_hashval(u_int32_t);
6d2010ae
A
496extern void in_purgeaddrs(struct ifnet *);
497extern void imf_leave(struct in_mfilter *);
498extern void imf_purge(struct in_mfilter *);
499
500struct inpcb;
501
502__private_extern__ int inp_join_group(struct inpcb *, struct sockopt *);
503__private_extern__ int inp_leave_group(struct inpcb *, struct sockopt *);
504__private_extern__ void in_multihead_lock_exclusive(void);
505__private_extern__ void in_multihead_lock_shared(void);
506__private_extern__ void in_multihead_lock_assert(int);
507__private_extern__ void in_multihead_lock_done(void);
508#endif /* XNU_KERNEL_PRIVATE */
9bccf70c 509
1c79356b
A
510/* INET6 stuff */
511#include <netinet6/in6_var.h>
1c79356b
A
512
513#endif /* _NETINET_IN_VAR_H_ */