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