2009-01-15 21:20:48 +03:00
|
|
|
/* $NetBSD: in6_var.h,v 1.62 2009/01/15 18:20:48 christos Exp $ */
|
2002-06-09 01:22:29 +04:00
|
|
|
/* $KAME: in6_var.h,v 1.81 2002/06/08 11:16:51 itojun Exp $ */
|
1999-07-04 01:24:45 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
|
|
|
|
* All rights reserved.
|
2000-04-16 19:00:56 +04:00
|
|
|
*
|
1999-06-28 10:36:47 +04:00
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. Neither the name of the project nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
2000-04-16 19:00:56 +04:00
|
|
|
*
|
1999-06-28 10:36:47 +04:00
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (c) 1985, 1986, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
2003-08-07 20:26:28 +04:00
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
1999-06-28 10:36:47 +04:00
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* @(#)in_var.h 8.1 (Berkeley) 6/10/93
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _NETINET6_IN6_VAR_H_
|
|
|
|
#define _NETINET6_IN6_VAR_H_
|
|
|
|
|
2007-10-17 08:35:34 +04:00
|
|
|
#include <sys/callout.h>
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Interface address, Internet version. One of these structures
|
|
|
|
* is allocated for each interface with an Internet address.
|
|
|
|
* The ifaddr structure contains the protocol-independent part
|
|
|
|
* of the structure and is assumed to be first.
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* pltime/vltime are just for future reference (required to implements 2
|
|
|
|
* hour rule for hosts). they should never be modified by nd6_timeout or
|
|
|
|
* anywhere else.
|
|
|
|
* userland -> kernel: accept pltime/vltime
|
2001-12-18 06:04:02 +03:00
|
|
|
* kernel -> userland: throw up everything
|
1999-06-28 10:36:47 +04:00
|
|
|
* in kernel: modify preferred/expire only
|
|
|
|
*/
|
|
|
|
struct in6_addrlifetime {
|
2009-01-15 21:20:48 +03:00
|
|
|
time_t ia6t_expire; /* valid lifetime expiration time */
|
|
|
|
time_t ia6t_preferred; /* preferred lifetime expiration time */
|
1999-06-28 10:36:47 +04:00
|
|
|
u_int32_t ia6t_vltime; /* valid lifetime */
|
|
|
|
u_int32_t ia6t_pltime; /* prefix lifetime */
|
|
|
|
};
|
|
|
|
|
2002-05-29 06:58:28 +04:00
|
|
|
struct nd_ifinfo;
|
|
|
|
struct in6_ifextra {
|
|
|
|
struct in6_ifstat *in6_ifstat;
|
|
|
|
struct icmp6_ifstat *icmp6_ifstat;
|
|
|
|
struct nd_ifinfo *nd_ifinfo;
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
struct scope6_id *scope6_id;
|
2002-05-29 06:58:28 +04:00
|
|
|
};
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
struct in6_ifaddr {
|
|
|
|
struct ifaddr ia_ifa; /* protocol-independent info */
|
|
|
|
#define ia_ifp ia_ifa.ifa_ifp
|
|
|
|
#define ia_flags ia_ifa.ifa_flags
|
|
|
|
struct sockaddr_in6 ia_addr; /* interface address */
|
|
|
|
struct sockaddr_in6 ia_net; /* network number of interface */
|
|
|
|
struct sockaddr_in6 ia_dstaddr; /* space for destination addr */
|
|
|
|
struct sockaddr_in6 ia_prefixmask; /* prefix mask */
|
1999-07-22 07:59:42 +04:00
|
|
|
u_int32_t ia_plen; /* prefix length */
|
1999-06-28 10:36:47 +04:00
|
|
|
struct in6_ifaddr *ia_next; /* next in6 list of IP6 addresses */
|
|
|
|
LIST_HEAD(in6_multihead, in6_multi) ia6_multiaddrs;
|
|
|
|
/* list of multicast addresses */
|
|
|
|
int ia6_flags;
|
|
|
|
|
2002-06-09 01:22:29 +04:00
|
|
|
struct in6_addrlifetime ia6_lifetime;
|
|
|
|
time_t ia6_createtime; /* the creation time of this address, which is
|
|
|
|
* currently used for temporary addresses only.
|
|
|
|
*/
|
|
|
|
time_t ia6_updatetime;
|
|
|
|
|
|
|
|
/* back pointer to the ND prefix (for autoconfigured addresses only) */
|
|
|
|
struct nd_prefix *ia6_ndpr;
|
|
|
|
|
|
|
|
/* multicast addresses joined from the kernel */
|
|
|
|
LIST_HEAD(, in6_multi_mship) ia6_memberships;
|
1999-12-13 18:17:17 +03:00
|
|
|
};
|
|
|
|
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
/* control structure to manage address selection policy */
|
|
|
|
struct in6_addrpolicy {
|
|
|
|
struct sockaddr_in6 addr; /* prefix address */
|
|
|
|
struct sockaddr_in6 addrmask; /* prefix mask */
|
|
|
|
int preced; /* precedence */
|
|
|
|
int label; /* matching label */
|
|
|
|
u_quad_t use; /* statistics */
|
|
|
|
};
|
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
/*
|
|
|
|
* IPv6 interface statistics, as defined in RFC2465 Ipv6IfStatsEntry (p12).
|
|
|
|
*/
|
|
|
|
struct in6_ifstat {
|
|
|
|
u_quad_t ifs6_in_receive; /* # of total input datagram */
|
|
|
|
u_quad_t ifs6_in_hdrerr; /* # of datagrams with invalid hdr */
|
|
|
|
u_quad_t ifs6_in_toobig; /* # of datagrams exceeded MTU */
|
|
|
|
u_quad_t ifs6_in_noroute; /* # of datagrams with no route */
|
|
|
|
u_quad_t ifs6_in_addrerr; /* # of datagrams with invalid dst */
|
|
|
|
u_quad_t ifs6_in_protounknown; /* # of datagrams with unknown proto */
|
|
|
|
/* NOTE: increment on final dst if */
|
|
|
|
u_quad_t ifs6_in_truncated; /* # of truncated datagrams */
|
|
|
|
u_quad_t ifs6_in_discard; /* # of discarded datagrams */
|
|
|
|
/* NOTE: fragment timeout is not here */
|
|
|
|
u_quad_t ifs6_in_deliver; /* # of datagrams delivered to ULP */
|
|
|
|
/* NOTE: increment on final dst if */
|
|
|
|
u_quad_t ifs6_out_forward; /* # of datagrams forwarded */
|
|
|
|
/* NOTE: increment on outgoing if */
|
|
|
|
u_quad_t ifs6_out_request; /* # of outgoing datagrams from ULP */
|
|
|
|
/* NOTE: does not include forwrads */
|
|
|
|
u_quad_t ifs6_out_discard; /* # of discarded datagrams */
|
|
|
|
u_quad_t ifs6_out_fragok; /* # of datagrams fragmented */
|
|
|
|
u_quad_t ifs6_out_fragfail; /* # of datagrams failed on fragment */
|
|
|
|
u_quad_t ifs6_out_fragcreat; /* # of fragment datagrams */
|
|
|
|
/* NOTE: this is # after fragment */
|
|
|
|
u_quad_t ifs6_reass_reqd; /* # of incoming fragmented packets */
|
|
|
|
/* NOTE: increment on final dst if */
|
|
|
|
u_quad_t ifs6_reass_ok; /* # of reassembled packets */
|
|
|
|
/* NOTE: this is # after reass */
|
|
|
|
/* NOTE: increment on final dst if */
|
|
|
|
u_quad_t ifs6_reass_fail; /* # of reass failures */
|
|
|
|
/* NOTE: may not be packet count */
|
|
|
|
/* NOTE: increment on final dst if */
|
|
|
|
u_quad_t ifs6_in_mcast; /* # of inbound multicast datagrams */
|
|
|
|
u_quad_t ifs6_out_mcast; /* # of outbound multicast datagrams */
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* ICMPv6 interface statistics, as defined in RFC2466 Ipv6IfIcmpEntry.
|
|
|
|
* XXX: I'm not sure if this file is the right place for this structure...
|
|
|
|
*/
|
|
|
|
struct icmp6_ifstat {
|
|
|
|
/*
|
|
|
|
* Input statistics
|
|
|
|
*/
|
|
|
|
/* ipv6IfIcmpInMsgs, total # of input messages */
|
|
|
|
u_quad_t ifs6_in_msg;
|
|
|
|
/* ipv6IfIcmpInErrors, # of input error messages */
|
|
|
|
u_quad_t ifs6_in_error;
|
|
|
|
/* ipv6IfIcmpInDestUnreachs, # of input dest unreach errors */
|
|
|
|
u_quad_t ifs6_in_dstunreach;
|
|
|
|
/* ipv6IfIcmpInAdminProhibs, # of input administratively prohibited errs */
|
|
|
|
u_quad_t ifs6_in_adminprohib;
|
|
|
|
/* ipv6IfIcmpInTimeExcds, # of input time exceeded errors */
|
|
|
|
u_quad_t ifs6_in_timeexceed;
|
|
|
|
/* ipv6IfIcmpInParmProblems, # of input parameter problem errors */
|
|
|
|
u_quad_t ifs6_in_paramprob;
|
|
|
|
/* ipv6IfIcmpInPktTooBigs, # of input packet too big errors */
|
|
|
|
u_quad_t ifs6_in_pkttoobig;
|
|
|
|
/* ipv6IfIcmpInEchos, # of input echo requests */
|
|
|
|
u_quad_t ifs6_in_echo;
|
|
|
|
/* ipv6IfIcmpInEchoReplies, # of input echo replies */
|
|
|
|
u_quad_t ifs6_in_echoreply;
|
|
|
|
/* ipv6IfIcmpInRouterSolicits, # of input router solicitations */
|
|
|
|
u_quad_t ifs6_in_routersolicit;
|
|
|
|
/* ipv6IfIcmpInRouterAdvertisements, # of input router advertisements */
|
|
|
|
u_quad_t ifs6_in_routeradvert;
|
|
|
|
/* ipv6IfIcmpInNeighborSolicits, # of input neighbor solicitations */
|
|
|
|
u_quad_t ifs6_in_neighborsolicit;
|
|
|
|
/* ipv6IfIcmpInNeighborAdvertisements, # of input neighbor advertisements */
|
|
|
|
u_quad_t ifs6_in_neighboradvert;
|
|
|
|
/* ipv6IfIcmpInRedirects, # of input redirects */
|
|
|
|
u_quad_t ifs6_in_redirect;
|
|
|
|
/* ipv6IfIcmpInGroupMembQueries, # of input MLD queries */
|
|
|
|
u_quad_t ifs6_in_mldquery;
|
|
|
|
/* ipv6IfIcmpInGroupMembResponses, # of input MLD reports */
|
|
|
|
u_quad_t ifs6_in_mldreport;
|
|
|
|
/* ipv6IfIcmpInGroupMembReductions, # of input MLD done */
|
|
|
|
u_quad_t ifs6_in_mlddone;
|
|
|
|
|
|
|
|
/*
|
2000-04-16 19:00:56 +04:00
|
|
|
* Output statistics. We should solve unresolved routing problem...
|
1999-12-13 18:17:17 +03:00
|
|
|
*/
|
|
|
|
/* ipv6IfIcmpOutMsgs, total # of output messages */
|
|
|
|
u_quad_t ifs6_out_msg;
|
|
|
|
/* ipv6IfIcmpOutErrors, # of output error messages */
|
|
|
|
u_quad_t ifs6_out_error;
|
|
|
|
/* ipv6IfIcmpOutDestUnreachs, # of output dest unreach errors */
|
|
|
|
u_quad_t ifs6_out_dstunreach;
|
|
|
|
/* ipv6IfIcmpOutAdminProhibs, # of output administratively prohibited errs */
|
|
|
|
u_quad_t ifs6_out_adminprohib;
|
|
|
|
/* ipv6IfIcmpOutTimeExcds, # of output time exceeded errors */
|
|
|
|
u_quad_t ifs6_out_timeexceed;
|
|
|
|
/* ipv6IfIcmpOutParmProblems, # of output parameter problem errors */
|
|
|
|
u_quad_t ifs6_out_paramprob;
|
|
|
|
/* ipv6IfIcmpOutPktTooBigs, # of output packet too big errors */
|
|
|
|
u_quad_t ifs6_out_pkttoobig;
|
|
|
|
/* ipv6IfIcmpOutEchos, # of output echo requests */
|
|
|
|
u_quad_t ifs6_out_echo;
|
|
|
|
/* ipv6IfIcmpOutEchoReplies, # of output echo replies */
|
|
|
|
u_quad_t ifs6_out_echoreply;
|
|
|
|
/* ipv6IfIcmpOutRouterSolicits, # of output router solicitations */
|
|
|
|
u_quad_t ifs6_out_routersolicit;
|
|
|
|
/* ipv6IfIcmpOutRouterAdvertisements, # of output router advertisements */
|
|
|
|
u_quad_t ifs6_out_routeradvert;
|
|
|
|
/* ipv6IfIcmpOutNeighborSolicits, # of output neighbor solicitations */
|
|
|
|
u_quad_t ifs6_out_neighborsolicit;
|
|
|
|
/* ipv6IfIcmpOutNeighborAdvertisements, # of output neighbor advertisements */
|
|
|
|
u_quad_t ifs6_out_neighboradvert;
|
|
|
|
/* ipv6IfIcmpOutRedirects, # of output redirects */
|
|
|
|
u_quad_t ifs6_out_redirect;
|
|
|
|
/* ipv6IfIcmpOutGroupMembQueries, # of output MLD queries */
|
|
|
|
u_quad_t ifs6_out_mldquery;
|
|
|
|
/* ipv6IfIcmpOutGroupMembResponses, # of output MLD reports */
|
|
|
|
u_quad_t ifs6_out_mldreport;
|
|
|
|
/* ipv6IfIcmpOutGroupMembReductions, # of output MLD done */
|
|
|
|
u_quad_t ifs6_out_mlddone;
|
1999-06-28 10:36:47 +04:00
|
|
|
};
|
|
|
|
|
|
|
|
struct in6_ifreq {
|
|
|
|
char ifr_name[IFNAMSIZ];
|
|
|
|
union {
|
|
|
|
struct sockaddr_in6 ifru_addr;
|
|
|
|
struct sockaddr_in6 ifru_dstaddr;
|
|
|
|
short ifru_flags;
|
|
|
|
int ifru_flags6;
|
|
|
|
int ifru_metric;
|
2007-03-04 08:59:00 +03:00
|
|
|
void * ifru_data;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct in6_addrlifetime ifru_lifetime;
|
1999-12-13 18:17:17 +03:00
|
|
|
struct in6_ifstat ifru_stat;
|
|
|
|
struct icmp6_ifstat ifru_icmp6stat;
|
1999-06-28 10:36:47 +04:00
|
|
|
} ifr_ifru;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct in6_aliasreq {
|
|
|
|
char ifra_name[IFNAMSIZ];
|
|
|
|
struct sockaddr_in6 ifra_addr;
|
|
|
|
struct sockaddr_in6 ifra_dstaddr;
|
|
|
|
struct sockaddr_in6 ifra_prefixmask;
|
|
|
|
int ifra_flags;
|
|
|
|
struct in6_addrlifetime ifra_lifetime;
|
|
|
|
};
|
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
/* prefix type macro */
|
|
|
|
#define IN6_PREFIX_ND 1
|
|
|
|
#define IN6_PREFIX_RR 2
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* prefix related flags passed between kernel(NDP related part) and
|
|
|
|
* user land command(ifconfig) and daemon(rtadvd).
|
2006-03-06 02:47:08 +03:00
|
|
|
* Note: We originally intended to use prf_ra{} only within in6_prflags{}, but
|
|
|
|
* it was (probably unintentionally) used in nd6.h as well. Since C++ does
|
|
|
|
* not allow such a reference, prf_ra{} was then moved outside. In general,
|
|
|
|
* however, this structure should not be used directly.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
2003-10-15 05:28:28 +04:00
|
|
|
struct prf_ra {
|
2006-10-17 18:52:21 +04:00
|
|
|
u_int32_t onlink : 1;
|
|
|
|
u_int32_t autonomous : 1;
|
|
|
|
u_int32_t router : 1;
|
|
|
|
u_int32_t reserved : 5;
|
2003-10-15 05:28:28 +04:00
|
|
|
};
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
struct in6_prflags {
|
2003-10-15 05:28:28 +04:00
|
|
|
struct prf_ra prf_ra;
|
1999-06-28 10:36:47 +04:00
|
|
|
u_char prf_reserved1;
|
|
|
|
u_short prf_reserved2;
|
|
|
|
/* want to put this on 4byte offset */
|
|
|
|
struct prf_rr {
|
2006-10-17 18:52:21 +04:00
|
|
|
u_int32_t decrvalid : 1;
|
|
|
|
u_int32_t decrprefd : 1;
|
|
|
|
u_int32_t reserved : 6;
|
1999-06-28 10:36:47 +04:00
|
|
|
} prf_rr;
|
|
|
|
u_char prf_reserved3;
|
|
|
|
u_short prf_reserved4;
|
|
|
|
};
|
|
|
|
|
|
|
|
struct in6_prefixreq {
|
|
|
|
char ipr_name[IFNAMSIZ];
|
|
|
|
u_char ipr_origin;
|
|
|
|
u_char ipr_plen;
|
1999-07-22 07:59:42 +04:00
|
|
|
u_int32_t ipr_vltime;
|
|
|
|
u_int32_t ipr_pltime;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct in6_prflags ipr_flags;
|
|
|
|
struct sockaddr_in6 ipr_prefix;
|
|
|
|
};
|
|
|
|
|
|
|
|
#define PR_ORIG_RA 0
|
|
|
|
#define PR_ORIG_RR 1
|
|
|
|
#define PR_ORIG_STATIC 2
|
1999-12-13 18:17:17 +03:00
|
|
|
#define PR_ORIG_KERNEL 3
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#define ipr_raf_onlink ipr_flags.prf_ra.onlink
|
|
|
|
#define ipr_raf_auto ipr_flags.prf_ra.autonomous
|
|
|
|
|
|
|
|
#define ipr_statef_onlink ipr_flags.prf_state.onlink
|
|
|
|
|
|
|
|
#define ipr_rrf_decrvalid ipr_flags.prf_rr.decrvalid
|
|
|
|
#define ipr_rrf_decrprefd ipr_flags.prf_rr.decrprefd
|
|
|
|
|
|
|
|
struct in6_rrenumreq {
|
|
|
|
char irr_name[IFNAMSIZ];
|
|
|
|
u_char irr_origin;
|
|
|
|
u_char irr_m_len; /* match len for matchprefix */
|
|
|
|
u_char irr_m_minlen; /* minlen for matching prefix */
|
|
|
|
u_char irr_m_maxlen; /* maxlen for matching prefix */
|
|
|
|
u_char irr_u_uselen; /* uselen for adding prefix */
|
|
|
|
u_char irr_u_keeplen; /* keeplen from matching prefix */
|
|
|
|
struct irr_raflagmask {
|
2006-10-17 18:52:21 +04:00
|
|
|
u_int32_t onlink : 1;
|
|
|
|
u_int32_t autonomous : 1;
|
|
|
|
u_int32_t reserved : 6;
|
1999-06-28 10:36:47 +04:00
|
|
|
} irr_raflagmask;
|
1999-07-22 07:59:42 +04:00
|
|
|
u_int32_t irr_vltime;
|
|
|
|
u_int32_t irr_pltime;
|
1999-06-28 10:36:47 +04:00
|
|
|
struct in6_prflags irr_flags;
|
|
|
|
struct sockaddr_in6 irr_matchprefix;
|
|
|
|
struct sockaddr_in6 irr_useprefix;
|
|
|
|
};
|
|
|
|
|
|
|
|
#define irr_raf_mask_onlink irr_raflagmask.onlink
|
|
|
|
#define irr_raf_mask_auto irr_raflagmask.autonomous
|
|
|
|
#define irr_raf_mask_reserved irr_raflagmask.reserved
|
|
|
|
|
|
|
|
#define irr_raf_onlink irr_flags.prf_ra.onlink
|
|
|
|
#define irr_raf_auto irr_flags.prf_ra.autonomous
|
|
|
|
|
|
|
|
#define irr_statef_onlink irr_flags.prf_state.onlink
|
|
|
|
|
|
|
|
#define irr_rrf irr_flags.prf_rr
|
|
|
|
#define irr_rrf_decrvalid irr_flags.prf_rr.decrvalid
|
|
|
|
#define irr_rrf_decrprefd irr_flags.prf_rr.decrprefd
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Given a pointer to an in6_ifaddr (ifaddr),
|
|
|
|
* return a pointer to the addr as a sockaddr_in6
|
|
|
|
*/
|
1999-12-13 18:17:17 +03:00
|
|
|
#define IA6_IN6(ia) (&((ia)->ia_addr.sin6_addr))
|
|
|
|
#define IA6_DSTIN6(ia) (&((ia)->ia_dstaddr.sin6_addr))
|
|
|
|
#define IA6_MASKIN6(ia) (&((ia)->ia_prefixmask.sin6_addr))
|
|
|
|
#define IA6_SIN6(ia) (&((ia)->ia_addr))
|
|
|
|
#define IA6_DSTSIN6(ia) (&((ia)->ia_dstaddr))
|
|
|
|
#define IFA_IN6(x) (&((struct sockaddr_in6 *)((x)->ifa_addr))->sin6_addr)
|
|
|
|
#define IFA_DSTIN6(x) (&((struct sockaddr_in6 *)((x)->ifa_dstaddr))->sin6_addr)
|
1999-06-28 10:36:47 +04:00
|
|
|
|
1999-12-13 18:17:17 +03:00
|
|
|
#ifdef _KERNEL
|
1999-06-28 10:36:47 +04:00
|
|
|
#define IN6_ARE_MASKED_ADDR_EQUAL(d, a, m) ( \
|
|
|
|
(((d)->s6_addr32[0] ^ (a)->s6_addr32[0]) & (m)->s6_addr32[0]) == 0 && \
|
|
|
|
(((d)->s6_addr32[1] ^ (a)->s6_addr32[1]) & (m)->s6_addr32[1]) == 0 && \
|
|
|
|
(((d)->s6_addr32[2] ^ (a)->s6_addr32[2]) & (m)->s6_addr32[2]) == 0 && \
|
|
|
|
(((d)->s6_addr32[3] ^ (a)->s6_addr32[3]) & (m)->s6_addr32[3]) == 0 )
|
1999-12-13 18:17:17 +03:00
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#define SIOCSIFADDR_IN6 _IOW('i', 12, struct in6_ifreq)
|
|
|
|
#define SIOCGIFADDR_IN6 _IOWR('i', 33, struct in6_ifreq)
|
2000-02-25 08:13:05 +03:00
|
|
|
|
|
|
|
#ifdef _KERNEL
|
|
|
|
/*
|
|
|
|
* SIOCSxxx ioctls should be unused (see comments in in6.c), but
|
|
|
|
* we do not shift numbers for binary compatibility.
|
|
|
|
*/
|
1999-06-28 10:36:47 +04:00
|
|
|
#define SIOCSIFDSTADDR_IN6 _IOW('i', 14, struct in6_ifreq)
|
|
|
|
#define SIOCSIFNETMASK_IN6 _IOW('i', 22, struct in6_ifreq)
|
2000-04-16 19:00:56 +04:00
|
|
|
#endif
|
2000-02-25 08:13:05 +03:00
|
|
|
|
|
|
|
#define SIOCGIFDSTADDR_IN6 _IOWR('i', 34, struct in6_ifreq)
|
1999-06-28 10:36:47 +04:00
|
|
|
#define SIOCGIFNETMASK_IN6 _IOWR('i', 37, struct in6_ifreq)
|
|
|
|
|
|
|
|
#define SIOCDIFADDR_IN6 _IOW('i', 25, struct in6_ifreq)
|
|
|
|
#define SIOCAIFADDR_IN6 _IOW('i', 26, struct in6_aliasreq)
|
|
|
|
|
|
|
|
#define SIOCSIFPHYADDR_IN6 _IOW('i', 70, struct in6_aliasreq)
|
|
|
|
#define SIOCGIFPSRCADDR_IN6 _IOWR('i', 71, struct in6_ifreq)
|
|
|
|
#define SIOCGIFPDSTADDR_IN6 _IOWR('i', 72, struct in6_ifreq)
|
|
|
|
|
|
|
|
#define SIOCGIFAFLAG_IN6 _IOWR('i', 73, struct in6_ifreq)
|
|
|
|
|
|
|
|
#define SIOCGDRLST_IN6 _IOWR('i', 74, struct in6_drlist)
|
2002-06-09 01:22:29 +04:00
|
|
|
#define SIOCGPRLST_IN6 _IOWR('i', 75, struct in6_oprlist)
|
2002-05-29 11:53:39 +04:00
|
|
|
#ifdef _KERNEL
|
|
|
|
#define OSIOCGIFINFO_IN6 _IOWR('i', 76, struct in6_ondireq)
|
|
|
|
#endif
|
|
|
|
#define SIOCGIFINFO_IN6 _IOWR('i', 108, struct in6_ndireq)
|
2006-03-06 02:47:08 +03:00
|
|
|
#define SIOCSIFINFO_IN6 _IOWR('i', 109, struct in6_ndireq)
|
1999-06-28 10:36:47 +04:00
|
|
|
#define SIOCSNDFLUSH_IN6 _IOWR('i', 77, struct in6_ifreq)
|
|
|
|
#define SIOCGNBRINFO_IN6 _IOWR('i', 78, struct in6_nbrinfo)
|
|
|
|
#define SIOCSPFXFLUSH_IN6 _IOWR('i', 79, struct in6_ifreq)
|
|
|
|
#define SIOCSRTRFLUSH_IN6 _IOWR('i', 80, struct in6_ifreq)
|
2009-01-15 21:20:48 +03:00
|
|
|
/* 81 was old SIOCGIFALIFETIME_IN6 */
|
2007-09-11 23:54:51 +04:00
|
|
|
#if 0
|
|
|
|
/* withdrawn - do not reuse number 82 */
|
1999-06-28 10:36:47 +04:00
|
|
|
#define SIOCSIFALIFETIME_IN6 _IOWR('i', 82, struct in6_ifreq)
|
2007-09-11 23:54:51 +04:00
|
|
|
#endif
|
1999-12-13 18:17:17 +03:00
|
|
|
#define SIOCGIFSTAT_IN6 _IOWR('i', 83, struct in6_ifreq)
|
|
|
|
#define SIOCGIFSTAT_ICMP6 _IOWR('i', 84, struct in6_ifreq)
|
|
|
|
|
|
|
|
#define SIOCSDEFIFACE_IN6 _IOWR('i', 85, struct in6_ndifreq)
|
|
|
|
#define SIOCGDEFIFACE_IN6 _IOWR('i', 86, struct in6_ndifreq)
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-04-16 19:27:59 +04:00
|
|
|
#define SIOCSIFINFO_FLAGS _IOWR('i', 87, struct in6_ndireq) /* XXX */
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
#define SIOCSIFPREFIX_IN6 _IOW('i', 100, struct in6_prefixreq) /* set */
|
|
|
|
#define SIOCGIFPREFIX_IN6 _IOWR('i', 101, struct in6_prefixreq) /* get */
|
|
|
|
#define SIOCDIFPREFIX_IN6 _IOW('i', 102, struct in6_prefixreq) /* del */
|
|
|
|
#define SIOCAIFPREFIX_IN6 _IOW('i', 103, struct in6_rrenumreq) /* add */
|
|
|
|
#define SIOCCIFPREFIX_IN6 _IOW('i', 104, \
|
|
|
|
struct in6_rrenumreq) /* change */
|
|
|
|
#define SIOCSGIFPREFIX_IN6 _IOW('i', 105, \
|
|
|
|
struct in6_rrenumreq) /* set global */
|
2009-01-15 21:20:48 +03:00
|
|
|
#define SIOCGIFALIFETIME_IN6 _IOWR('i', 106, struct in6_ifreq)
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2009-01-15 21:20:48 +03:00
|
|
|
/* XXX: Someone decided to switch to 'u' here for unknown reasons! */
|
1999-06-28 10:36:47 +04:00
|
|
|
#define SIOCGETSGCNT_IN6 _IOWR('u', 106, \
|
|
|
|
struct sioc_sg_req6) /* get s,g pkt cnt */
|
|
|
|
#define SIOCGETMIFCNT_IN6 _IOWR('u', 107, \
|
|
|
|
struct sioc_mif_req6) /* get pkt cnt per if */
|
Better support of IPv6 scoped addresses.
- most of the kernel code will not care about the actual encoding of
scope zone IDs and won't touch "s6_addr16[1]" directly.
- similarly, most of the kernel code will not care about link-local
scoped addresses as a special case.
- scope boundary check will be stricter. For example, the current
*BSD code allows a packet with src=::1 and dst=(some global IPv6
address) to be sent outside of the node, if the application do:
s = socket(AF_INET6);
bind(s, "::1");
sendto(s, some_global_IPv6_addr);
This is clearly wrong, since ::1 is only meaningful within a single
node, but the current implementation of the *BSD kernel cannot
reject this attempt.
- and, while there, don't try to remove the ff02::/32 interface route
entry in in6_ifdetach() as it's already gone.
This also includes some level of support for the standard source
address selection algorithm defined in RFC3484, which will be
completed on in the future.
From the KAME project via JINMEI Tatuya.
Approved by core@.
2006-01-21 03:15:35 +03:00
|
|
|
#define SIOCAADDRCTL_POLICY _IOW('u', 108, struct in6_addrpolicy)
|
|
|
|
#define SIOCDADDRCTL_POLICY _IOW('u', 109, struct in6_addrpolicy)
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#define IN6_IFF_ANYCAST 0x01 /* anycast address */
|
|
|
|
#define IN6_IFF_TENTATIVE 0x02 /* tentative address */
|
|
|
|
#define IN6_IFF_DUPLICATED 0x04 /* DAD detected duplicate */
|
|
|
|
#define IN6_IFF_DETACHED 0x08 /* may be detached from the link */
|
|
|
|
#define IN6_IFF_DEPRECATED 0x10 /* deprecated address */
|
2002-06-09 01:22:29 +04:00
|
|
|
#define IN6_IFF_NODAD 0x20 /* don't perform DAD on this address
|
|
|
|
* (used only at first SIOC* call)
|
|
|
|
*/
|
|
|
|
#define IN6_IFF_AUTOCONF 0x40 /* autoconfigurable address. */
|
2006-03-06 02:47:08 +03:00
|
|
|
#define IN6_IFF_TEMPORARY 0x80 /* temporary (anonymous) address. */
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/* do not input/output */
|
|
|
|
#define IN6_IFF_NOTREADY (IN6_IFF_TENTATIVE|IN6_IFF_DUPLICATED)
|
|
|
|
|
2000-02-25 08:13:05 +03:00
|
|
|
#ifdef _KERNEL
|
|
|
|
#define IN6_ARE_SCOPE_CMP(a,b) ((a)-(b))
|
|
|
|
#define IN6_ARE_SCOPE_EQUAL(a,b) ((a)==(b))
|
|
|
|
#endif
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
#ifdef _KERNEL
|
2003-02-01 09:23:35 +03:00
|
|
|
MALLOC_DECLARE(M_IP6OPT);
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
extern struct in6_ifaddr *in6_ifaddr;
|
1999-12-13 18:17:17 +03:00
|
|
|
|
|
|
|
#define in6_ifstat_inc(ifp, tag) \
|
|
|
|
do { \
|
2002-05-29 06:58:28 +04:00
|
|
|
if (ifp) \
|
|
|
|
((struct in6_ifextra *)((ifp)->if_afdata[AF_INET6]))->in6_ifstat->tag++; \
|
2002-11-02 10:30:55 +03:00
|
|
|
} while (/*CONSTCOND*/ 0)
|
1999-12-13 18:17:17 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
extern struct ifqueue ip6intrq; /* IP6 packet input queue */
|
2008-08-20 22:35:20 +04:00
|
|
|
extern const struct in6_addr zeroin6_addr;
|
|
|
|
extern const u_char inet6ctlerrmap[];
|
1999-06-28 10:36:47 +04:00
|
|
|
extern unsigned long in6_maxmtu;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Macro for finding the internet address structure (in6_ifaddr) corresponding
|
|
|
|
* to a given interface (ifnet structure).
|
|
|
|
*/
|
Take steps to hide the radix_node implementation of the forwarding table
from the forwarding table's users:
Introduce rt_walktree() for walking the routing table and
applying a function to each rtentry. Replace most
rn_walktree() calls with it.
Use rt_getkey()/rt_setkey() to get/set a route's destination.
Keep a pointer to the sockaddr key in the rtentry, so that
rtentry users do not have to grovel in the radix_node for
the key.
Add a RTM_GET method to rtrequest. Use that instead of
radix_node lookups in, e.g., carp(4).
Add sys/net/link_proto.c, which supplies sockaddr routines for
link-layer socket addresses (sockaddr_dl).
Cosmetic:
Constify. KNF. Stop open-coding LIST_FOREACH, TAILQ_FOREACH,
et cetera. Use NULL instead of 0 for null pointers. Use
__arraycount(). Reduce gratuitous parenthesization.
Stop using variadic arguments for rip6_output(), it is
unnecessary.
Remove the unnecessary rtentry member rt_genmask and the
code to maintain it, since nothing actually used it.
Make rt_maskedcopy() easier to read by using meaningful variable
names.
Extract a subroutine intern_netmask() for looking up a netmask in
the masks table.
Start converting backslash-ridden IPv6 macros in
sys/netinet6/in6_var.h into inline subroutines that one
can read without special eyeglasses.
One functional change: when the kernel serves an RTM_GET, RTM_LOCK,
or RTM_CHANGE request, it applies the netmask (if supplied) to a
destination before searching for it in the forwarding table.
I have changed sys/netinet/ip_carp.c, carp_setroute(), to remove
the unlawful radix_node knowledge.
Apart from the changes to carp(4), netiso, ATM, and strip(4), I
have run the changes on three nodes in my wireless routing testbed,
which involves IPv4 + IPv6 dynamic routing acrobatics, and it's
working beautifully so far.
2007-07-20 00:48:52 +04:00
|
|
|
static inline struct in6_ifaddr *
|
|
|
|
ifp_to_ia6(struct ifnet *ifp)
|
|
|
|
{
|
|
|
|
struct ifaddr *ifa;
|
|
|
|
|
2007-12-05 04:17:16 +03:00
|
|
|
IFADDR_FOREACH(ifa, ifp) {
|
Take steps to hide the radix_node implementation of the forwarding table
from the forwarding table's users:
Introduce rt_walktree() for walking the routing table and
applying a function to each rtentry. Replace most
rn_walktree() calls with it.
Use rt_getkey()/rt_setkey() to get/set a route's destination.
Keep a pointer to the sockaddr key in the rtentry, so that
rtentry users do not have to grovel in the radix_node for
the key.
Add a RTM_GET method to rtrequest. Use that instead of
radix_node lookups in, e.g., carp(4).
Add sys/net/link_proto.c, which supplies sockaddr routines for
link-layer socket addresses (sockaddr_dl).
Cosmetic:
Constify. KNF. Stop open-coding LIST_FOREACH, TAILQ_FOREACH,
et cetera. Use NULL instead of 0 for null pointers. Use
__arraycount(). Reduce gratuitous parenthesization.
Stop using variadic arguments for rip6_output(), it is
unnecessary.
Remove the unnecessary rtentry member rt_genmask and the
code to maintain it, since nothing actually used it.
Make rt_maskedcopy() easier to read by using meaningful variable
names.
Extract a subroutine intern_netmask() for looking up a netmask in
the masks table.
Start converting backslash-ridden IPv6 macros in
sys/netinet6/in6_var.h into inline subroutines that one
can read without special eyeglasses.
One functional change: when the kernel serves an RTM_GET, RTM_LOCK,
or RTM_CHANGE request, it applies the netmask (if supplied) to a
destination before searching for it in the forwarding table.
I have changed sys/netinet/ip_carp.c, carp_setroute(), to remove
the unlawful radix_node knowledge.
Apart from the changes to carp(4), netiso, ATM, and strip(4), I
have run the changes on three nodes in my wireless routing testbed,
which involves IPv4 + IPv6 dynamic routing acrobatics, and it's
working beautifully so far.
2007-07-20 00:48:52 +04:00
|
|
|
if (ifa->ifa_addr == NULL)
|
|
|
|
continue;
|
|
|
|
if (ifa->ifa_addr->sa_family == AF_INET6)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return (struct in6_ifaddr *)ifa;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define IFP_TO_IA6(__ifp, __ia) \
|
|
|
|
do { \
|
|
|
|
(__ia) = ifp_to_ia6((__ifp)); \
|
|
|
|
} while (/*CONSTCOND*/0)
|
1999-12-13 18:17:17 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-01-06 18:46:07 +03:00
|
|
|
#endif /* _KERNEL */
|
1999-12-13 18:17:17 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Multi-cast membership entry. One for each group/ifp that a PCB
|
|
|
|
* belongs to.
|
|
|
|
*/
|
|
|
|
struct in6_multi_mship {
|
|
|
|
struct in6_multi *i6mm_maddr; /* Multicast address pointer */
|
|
|
|
LIST_ENTRY(in6_multi_mship) i6mm_chain; /* multicast options chain */
|
|
|
|
};
|
|
|
|
|
|
|
|
struct in6_multi {
|
|
|
|
LIST_ENTRY(in6_multi) in6m_entry; /* list glue */
|
|
|
|
struct in6_addr in6m_addr; /* IP6 multicast address */
|
|
|
|
struct ifnet *in6m_ifp; /* back pointer to ifnet */
|
2001-02-10 07:14:26 +03:00
|
|
|
struct in6_ifaddr *in6m_ia; /* back pointer to in6_ifaddr */
|
1999-06-28 10:36:47 +04:00
|
|
|
u_int in6m_refcount; /* # membership claims by sockets */
|
|
|
|
u_int in6m_state; /* state of the membership */
|
2006-03-06 02:47:08 +03:00
|
|
|
int in6m_timer; /* delay to send the 1st report */
|
|
|
|
struct timeval in6m_timer_expire; /* when the timer expires */
|
2007-10-17 00:31:33 +04:00
|
|
|
callout_t in6m_timer_ch;
|
1999-06-28 10:36:47 +04:00
|
|
|
};
|
2006-03-06 02:47:08 +03:00
|
|
|
|
|
|
|
#define IN6M_TIMER_UNDEF -1
|
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
#ifdef _KERNEL
|
2006-03-06 02:47:08 +03:00
|
|
|
/* flags to in6_update_ifa */
|
|
|
|
#define IN6_IFAUPDATE_DADDELAY 0x1 /* first time to configure an address */
|
1999-12-13 18:17:17 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Structure used by macros below to remember position when stepping through
|
2001-10-16 10:24:44 +04:00
|
|
|
* all of the in6_multi records.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
struct in6_multistep {
|
|
|
|
struct in6_ifaddr *i_ia;
|
|
|
|
struct in6_multi *i_in6m;
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Macros for looking up the in6_multi record for a given IP6 multicast
|
|
|
|
* address on a given interface. If no matching record is found, "in6m"
|
2006-03-03 17:07:06 +03:00
|
|
|
* returns NULL.
|
1999-06-28 10:36:47 +04:00
|
|
|
*/
|
|
|
|
|
Take steps to hide the radix_node implementation of the forwarding table
from the forwarding table's users:
Introduce rt_walktree() for walking the routing table and
applying a function to each rtentry. Replace most
rn_walktree() calls with it.
Use rt_getkey()/rt_setkey() to get/set a route's destination.
Keep a pointer to the sockaddr key in the rtentry, so that
rtentry users do not have to grovel in the radix_node for
the key.
Add a RTM_GET method to rtrequest. Use that instead of
radix_node lookups in, e.g., carp(4).
Add sys/net/link_proto.c, which supplies sockaddr routines for
link-layer socket addresses (sockaddr_dl).
Cosmetic:
Constify. KNF. Stop open-coding LIST_FOREACH, TAILQ_FOREACH,
et cetera. Use NULL instead of 0 for null pointers. Use
__arraycount(). Reduce gratuitous parenthesization.
Stop using variadic arguments for rip6_output(), it is
unnecessary.
Remove the unnecessary rtentry member rt_genmask and the
code to maintain it, since nothing actually used it.
Make rt_maskedcopy() easier to read by using meaningful variable
names.
Extract a subroutine intern_netmask() for looking up a netmask in
the masks table.
Start converting backslash-ridden IPv6 macros in
sys/netinet6/in6_var.h into inline subroutines that one
can read without special eyeglasses.
One functional change: when the kernel serves an RTM_GET, RTM_LOCK,
or RTM_CHANGE request, it applies the netmask (if supplied) to a
destination before searching for it in the forwarding table.
I have changed sys/netinet/ip_carp.c, carp_setroute(), to remove
the unlawful radix_node knowledge.
Apart from the changes to carp(4), netiso, ATM, and strip(4), I
have run the changes on three nodes in my wireless routing testbed,
which involves IPv4 + IPv6 dynamic routing acrobatics, and it's
working beautifully so far.
2007-07-20 00:48:52 +04:00
|
|
|
static inline struct in6_multi *
|
|
|
|
in6_lookup_multi(struct in6_addr *addr, struct ifnet *ifp)
|
|
|
|
{
|
|
|
|
struct in6_multi *in6m;
|
|
|
|
struct in6_ifaddr *ia;
|
|
|
|
|
|
|
|
if ((ia = ifp_to_ia6(ifp)) == NULL)
|
|
|
|
return NULL;
|
|
|
|
LIST_FOREACH(in6m, &ia->ia6_multiaddrs, in6m_entry) {
|
|
|
|
if (IN6_ARE_ADDR_EQUAL(&in6m->in6m_addr, addr))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return in6m;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define IN6_LOOKUP_MULTI(__addr, __ifp, __in6m) \
|
|
|
|
/* struct in6_addr __addr; */ \
|
|
|
|
/* struct ifnet *__ifp; */ \
|
|
|
|
/* struct in6_multi *__in6m; */ \
|
1999-12-13 18:17:17 +03:00
|
|
|
do { \
|
Take steps to hide the radix_node implementation of the forwarding table
from the forwarding table's users:
Introduce rt_walktree() for walking the routing table and
applying a function to each rtentry. Replace most
rn_walktree() calls with it.
Use rt_getkey()/rt_setkey() to get/set a route's destination.
Keep a pointer to the sockaddr key in the rtentry, so that
rtentry users do not have to grovel in the radix_node for
the key.
Add a RTM_GET method to rtrequest. Use that instead of
radix_node lookups in, e.g., carp(4).
Add sys/net/link_proto.c, which supplies sockaddr routines for
link-layer socket addresses (sockaddr_dl).
Cosmetic:
Constify. KNF. Stop open-coding LIST_FOREACH, TAILQ_FOREACH,
et cetera. Use NULL instead of 0 for null pointers. Use
__arraycount(). Reduce gratuitous parenthesization.
Stop using variadic arguments for rip6_output(), it is
unnecessary.
Remove the unnecessary rtentry member rt_genmask and the
code to maintain it, since nothing actually used it.
Make rt_maskedcopy() easier to read by using meaningful variable
names.
Extract a subroutine intern_netmask() for looking up a netmask in
the masks table.
Start converting backslash-ridden IPv6 macros in
sys/netinet6/in6_var.h into inline subroutines that one
can read without special eyeglasses.
One functional change: when the kernel serves an RTM_GET, RTM_LOCK,
or RTM_CHANGE request, it applies the netmask (if supplied) to a
destination before searching for it in the forwarding table.
I have changed sys/netinet/ip_carp.c, carp_setroute(), to remove
the unlawful radix_node knowledge.
Apart from the changes to carp(4), netiso, ATM, and strip(4), I
have run the changes on three nodes in my wireless routing testbed,
which involves IPv4 + IPv6 dynamic routing acrobatics, and it's
working beautifully so far.
2007-07-20 00:48:52 +04:00
|
|
|
(__in6m) = in6_lookup_multi(&(__addr), (__ifp)); \
|
2002-11-02 10:30:55 +03:00
|
|
|
} while (/*CONSTCOND*/ 0)
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Macro to step through all of the in6_multi records, one at a time.
|
|
|
|
* The current position is remembered in "step", which the caller must
|
|
|
|
* provide. IN6_FIRST_MULTI(), below, must be called to initialize "step"
|
|
|
|
* and get the first record. Both macros return a NULL "in6m" when there
|
|
|
|
* are no remaining records.
|
|
|
|
*/
|
Take steps to hide the radix_node implementation of the forwarding table
from the forwarding table's users:
Introduce rt_walktree() for walking the routing table and
applying a function to each rtentry. Replace most
rn_walktree() calls with it.
Use rt_getkey()/rt_setkey() to get/set a route's destination.
Keep a pointer to the sockaddr key in the rtentry, so that
rtentry users do not have to grovel in the radix_node for
the key.
Add a RTM_GET method to rtrequest. Use that instead of
radix_node lookups in, e.g., carp(4).
Add sys/net/link_proto.c, which supplies sockaddr routines for
link-layer socket addresses (sockaddr_dl).
Cosmetic:
Constify. KNF. Stop open-coding LIST_FOREACH, TAILQ_FOREACH,
et cetera. Use NULL instead of 0 for null pointers. Use
__arraycount(). Reduce gratuitous parenthesization.
Stop using variadic arguments for rip6_output(), it is
unnecessary.
Remove the unnecessary rtentry member rt_genmask and the
code to maintain it, since nothing actually used it.
Make rt_maskedcopy() easier to read by using meaningful variable
names.
Extract a subroutine intern_netmask() for looking up a netmask in
the masks table.
Start converting backslash-ridden IPv6 macros in
sys/netinet6/in6_var.h into inline subroutines that one
can read without special eyeglasses.
One functional change: when the kernel serves an RTM_GET, RTM_LOCK,
or RTM_CHANGE request, it applies the netmask (if supplied) to a
destination before searching for it in the forwarding table.
I have changed sys/netinet/ip_carp.c, carp_setroute(), to remove
the unlawful radix_node knowledge.
Apart from the changes to carp(4), netiso, ATM, and strip(4), I
have run the changes on three nodes in my wireless routing testbed,
which involves IPv4 + IPv6 dynamic routing acrobatics, and it's
working beautifully so far.
2007-07-20 00:48:52 +04:00
|
|
|
static inline struct in6_multi *
|
|
|
|
in6_next_multi(struct in6_multistep *step)
|
|
|
|
{
|
|
|
|
struct in6_multi *in6m;
|
|
|
|
|
|
|
|
if ((in6m = step->i_in6m) != NULL) {
|
|
|
|
step->i_in6m = LIST_NEXT(in6m, in6m_entry);
|
|
|
|
return in6m;
|
|
|
|
}
|
|
|
|
while (step->i_ia != NULL) {
|
|
|
|
in6m = LIST_FIRST(&step->i_ia->ia6_multiaddrs);
|
|
|
|
step->i_ia = step->i_ia->ia_next;
|
|
|
|
if (in6m != NULL) {
|
|
|
|
step->i_in6m = LIST_NEXT(in6m, in6m_entry);
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return in6m;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline struct in6_multi *
|
|
|
|
in6_first_multi(struct in6_multistep *step)
|
|
|
|
{
|
|
|
|
step->i_ia = in6_ifaddr;
|
|
|
|
step->i_in6m = NULL;
|
|
|
|
return in6_next_multi(step);
|
|
|
|
}
|
|
|
|
|
|
|
|
#define IN6_NEXT_MULTI(__step, __in6m) \
|
|
|
|
/* struct in6_multistep __step; */ \
|
|
|
|
/* struct in6_multi *__in6m; */ \
|
|
|
|
do { \
|
|
|
|
(__in6m) = in6_next_multi(&(__step)); \
|
2002-11-02 10:30:55 +03:00
|
|
|
} while (/*CONSTCOND*/ 0)
|
1999-06-28 10:36:47 +04:00
|
|
|
|
Take steps to hide the radix_node implementation of the forwarding table
from the forwarding table's users:
Introduce rt_walktree() for walking the routing table and
applying a function to each rtentry. Replace most
rn_walktree() calls with it.
Use rt_getkey()/rt_setkey() to get/set a route's destination.
Keep a pointer to the sockaddr key in the rtentry, so that
rtentry users do not have to grovel in the radix_node for
the key.
Add a RTM_GET method to rtrequest. Use that instead of
radix_node lookups in, e.g., carp(4).
Add sys/net/link_proto.c, which supplies sockaddr routines for
link-layer socket addresses (sockaddr_dl).
Cosmetic:
Constify. KNF. Stop open-coding LIST_FOREACH, TAILQ_FOREACH,
et cetera. Use NULL instead of 0 for null pointers. Use
__arraycount(). Reduce gratuitous parenthesization.
Stop using variadic arguments for rip6_output(), it is
unnecessary.
Remove the unnecessary rtentry member rt_genmask and the
code to maintain it, since nothing actually used it.
Make rt_maskedcopy() easier to read by using meaningful variable
names.
Extract a subroutine intern_netmask() for looking up a netmask in
the masks table.
Start converting backslash-ridden IPv6 macros in
sys/netinet6/in6_var.h into inline subroutines that one
can read without special eyeglasses.
One functional change: when the kernel serves an RTM_GET, RTM_LOCK,
or RTM_CHANGE request, it applies the netmask (if supplied) to a
destination before searching for it in the forwarding table.
I have changed sys/netinet/ip_carp.c, carp_setroute(), to remove
the unlawful radix_node knowledge.
Apart from the changes to carp(4), netiso, ATM, and strip(4), I
have run the changes on three nodes in my wireless routing testbed,
which involves IPv4 + IPv6 dynamic routing acrobatics, and it's
working beautifully so far.
2007-07-20 00:48:52 +04:00
|
|
|
#define IN6_FIRST_MULTI(__step, __in6m) \
|
|
|
|
/* struct in6_multistep __step; */ \
|
|
|
|
/* struct in6_multi *__in6m */ \
|
1999-12-13 18:17:17 +03:00
|
|
|
do { \
|
Take steps to hide the radix_node implementation of the forwarding table
from the forwarding table's users:
Introduce rt_walktree() for walking the routing table and
applying a function to each rtentry. Replace most
rn_walktree() calls with it.
Use rt_getkey()/rt_setkey() to get/set a route's destination.
Keep a pointer to the sockaddr key in the rtentry, so that
rtentry users do not have to grovel in the radix_node for
the key.
Add a RTM_GET method to rtrequest. Use that instead of
radix_node lookups in, e.g., carp(4).
Add sys/net/link_proto.c, which supplies sockaddr routines for
link-layer socket addresses (sockaddr_dl).
Cosmetic:
Constify. KNF. Stop open-coding LIST_FOREACH, TAILQ_FOREACH,
et cetera. Use NULL instead of 0 for null pointers. Use
__arraycount(). Reduce gratuitous parenthesization.
Stop using variadic arguments for rip6_output(), it is
unnecessary.
Remove the unnecessary rtentry member rt_genmask and the
code to maintain it, since nothing actually used it.
Make rt_maskedcopy() easier to read by using meaningful variable
names.
Extract a subroutine intern_netmask() for looking up a netmask in
the masks table.
Start converting backslash-ridden IPv6 macros in
sys/netinet6/in6_var.h into inline subroutines that one
can read without special eyeglasses.
One functional change: when the kernel serves an RTM_GET, RTM_LOCK,
or RTM_CHANGE request, it applies the netmask (if supplied) to a
destination before searching for it in the forwarding table.
I have changed sys/netinet/ip_carp.c, carp_setroute(), to remove
the unlawful radix_node knowledge.
Apart from the changes to carp(4), netiso, ATM, and strip(4), I
have run the changes on three nodes in my wireless routing testbed,
which involves IPv4 + IPv6 dynamic routing acrobatics, and it's
working beautifully so far.
2007-07-20 00:48:52 +04:00
|
|
|
(__in6m) = in6_first_multi(&(__step)); \
|
2002-11-02 10:30:55 +03:00
|
|
|
} while (/*CONSTCOND*/ 0)
|
1999-12-13 18:17:17 +03:00
|
|
|
|
2006-03-06 02:47:08 +03:00
|
|
|
|
Take steps to hide the radix_node implementation of the forwarding table
from the forwarding table's users:
Introduce rt_walktree() for walking the routing table and
applying a function to each rtentry. Replace most
rn_walktree() calls with it.
Use rt_getkey()/rt_setkey() to get/set a route's destination.
Keep a pointer to the sockaddr key in the rtentry, so that
rtentry users do not have to grovel in the radix_node for
the key.
Add a RTM_GET method to rtrequest. Use that instead of
radix_node lookups in, e.g., carp(4).
Add sys/net/link_proto.c, which supplies sockaddr routines for
link-layer socket addresses (sockaddr_dl).
Cosmetic:
Constify. KNF. Stop open-coding LIST_FOREACH, TAILQ_FOREACH,
et cetera. Use NULL instead of 0 for null pointers. Use
__arraycount(). Reduce gratuitous parenthesization.
Stop using variadic arguments for rip6_output(), it is
unnecessary.
Remove the unnecessary rtentry member rt_genmask and the
code to maintain it, since nothing actually used it.
Make rt_maskedcopy() easier to read by using meaningful variable
names.
Extract a subroutine intern_netmask() for looking up a netmask in
the masks table.
Start converting backslash-ridden IPv6 macros in
sys/netinet6/in6_var.h into inline subroutines that one
can read without special eyeglasses.
One functional change: when the kernel serves an RTM_GET, RTM_LOCK,
or RTM_CHANGE request, it applies the netmask (if supplied) to a
destination before searching for it in the forwarding table.
I have changed sys/netinet/ip_carp.c, carp_setroute(), to remove
the unlawful radix_node knowledge.
Apart from the changes to carp(4), netiso, ATM, and strip(4), I
have run the changes on three nodes in my wireless routing testbed,
which involves IPv4 + IPv6 dynamic routing acrobatics, and it's
working beautifully so far.
2007-07-20 00:48:52 +04:00
|
|
|
#if 0
|
2006-03-06 02:47:08 +03:00
|
|
|
/*
|
|
|
|
* Macros for looking up the in6_multi_mship record for a given IP6 multicast
|
|
|
|
* address on a given interface. If no matching record is found, "imm"
|
|
|
|
* returns NULL.
|
|
|
|
*/
|
Take steps to hide the radix_node implementation of the forwarding table
from the forwarding table's users:
Introduce rt_walktree() for walking the routing table and
applying a function to each rtentry. Replace most
rn_walktree() calls with it.
Use rt_getkey()/rt_setkey() to get/set a route's destination.
Keep a pointer to the sockaddr key in the rtentry, so that
rtentry users do not have to grovel in the radix_node for
the key.
Add a RTM_GET method to rtrequest. Use that instead of
radix_node lookups in, e.g., carp(4).
Add sys/net/link_proto.c, which supplies sockaddr routines for
link-layer socket addresses (sockaddr_dl).
Cosmetic:
Constify. KNF. Stop open-coding LIST_FOREACH, TAILQ_FOREACH,
et cetera. Use NULL instead of 0 for null pointers. Use
__arraycount(). Reduce gratuitous parenthesization.
Stop using variadic arguments for rip6_output(), it is
unnecessary.
Remove the unnecessary rtentry member rt_genmask and the
code to maintain it, since nothing actually used it.
Make rt_maskedcopy() easier to read by using meaningful variable
names.
Extract a subroutine intern_netmask() for looking up a netmask in
the masks table.
Start converting backslash-ridden IPv6 macros in
sys/netinet6/in6_var.h into inline subroutines that one
can read without special eyeglasses.
One functional change: when the kernel serves an RTM_GET, RTM_LOCK,
or RTM_CHANGE request, it applies the netmask (if supplied) to a
destination before searching for it in the forwarding table.
I have changed sys/netinet/ip_carp.c, carp_setroute(), to remove
the unlawful radix_node knowledge.
Apart from the changes to carp(4), netiso, ATM, and strip(4), I
have run the changes on three nodes in my wireless routing testbed,
which involves IPv4 + IPv6 dynamic routing acrobatics, and it's
working beautifully so far.
2007-07-20 00:48:52 +04:00
|
|
|
static inline struct in6_multi_mship *
|
|
|
|
in6_lookup_mship(struct in6_addr *addr, struct ifnet *ifp,
|
|
|
|
struct ip6_moptions *imop)
|
|
|
|
{
|
|
|
|
struct in6_multi_mship *imm;
|
|
|
|
|
|
|
|
LIST_FOREACH(imm, &imop->im6o_memberships, i6mm_chain) {
|
|
|
|
if (imm->i6mm_maddr->in6m_ifp != ifp)
|
|
|
|
continue;
|
|
|
|
if (IN6_ARE_ADDR_EQUAL(&imm->i6mm_maddr->in6m_addr,
|
|
|
|
addr))
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return imm;
|
|
|
|
}
|
|
|
|
|
|
|
|
#define IN6_LOOKUP_MSHIP(__addr, __ifp, __imop, __imm) \
|
|
|
|
/* struct in6_addr __addr; */ \
|
|
|
|
/* struct ifnet *__ifp; */ \
|
|
|
|
/* struct ip6_moptions *__imop */ \
|
|
|
|
/* struct in6_multi_mship *__imm; */ \
|
2006-03-06 02:47:08 +03:00
|
|
|
do { \
|
Take steps to hide the radix_node implementation of the forwarding table
from the forwarding table's users:
Introduce rt_walktree() for walking the routing table and
applying a function to each rtentry. Replace most
rn_walktree() calls with it.
Use rt_getkey()/rt_setkey() to get/set a route's destination.
Keep a pointer to the sockaddr key in the rtentry, so that
rtentry users do not have to grovel in the radix_node for
the key.
Add a RTM_GET method to rtrequest. Use that instead of
radix_node lookups in, e.g., carp(4).
Add sys/net/link_proto.c, which supplies sockaddr routines for
link-layer socket addresses (sockaddr_dl).
Cosmetic:
Constify. KNF. Stop open-coding LIST_FOREACH, TAILQ_FOREACH,
et cetera. Use NULL instead of 0 for null pointers. Use
__arraycount(). Reduce gratuitous parenthesization.
Stop using variadic arguments for rip6_output(), it is
unnecessary.
Remove the unnecessary rtentry member rt_genmask and the
code to maintain it, since nothing actually used it.
Make rt_maskedcopy() easier to read by using meaningful variable
names.
Extract a subroutine intern_netmask() for looking up a netmask in
the masks table.
Start converting backslash-ridden IPv6 macros in
sys/netinet6/in6_var.h into inline subroutines that one
can read without special eyeglasses.
One functional change: when the kernel serves an RTM_GET, RTM_LOCK,
or RTM_CHANGE request, it applies the netmask (if supplied) to a
destination before searching for it in the forwarding table.
I have changed sys/netinet/ip_carp.c, carp_setroute(), to remove
the unlawful radix_node knowledge.
Apart from the changes to carp(4), netiso, ATM, and strip(4), I
have run the changes on three nodes in my wireless routing testbed,
which involves IPv4 + IPv6 dynamic routing acrobatics, and it's
working beautifully so far.
2007-07-20 00:48:52 +04:00
|
|
|
(__imm) = in6_lookup_mship(&(__addr), (__ifp), (__imop)); \
|
2006-03-06 02:47:08 +03:00
|
|
|
} while (/*CONSTCOND*/ 0)
|
Take steps to hide the radix_node implementation of the forwarding table
from the forwarding table's users:
Introduce rt_walktree() for walking the routing table and
applying a function to each rtentry. Replace most
rn_walktree() calls with it.
Use rt_getkey()/rt_setkey() to get/set a route's destination.
Keep a pointer to the sockaddr key in the rtentry, so that
rtentry users do not have to grovel in the radix_node for
the key.
Add a RTM_GET method to rtrequest. Use that instead of
radix_node lookups in, e.g., carp(4).
Add sys/net/link_proto.c, which supplies sockaddr routines for
link-layer socket addresses (sockaddr_dl).
Cosmetic:
Constify. KNF. Stop open-coding LIST_FOREACH, TAILQ_FOREACH,
et cetera. Use NULL instead of 0 for null pointers. Use
__arraycount(). Reduce gratuitous parenthesization.
Stop using variadic arguments for rip6_output(), it is
unnecessary.
Remove the unnecessary rtentry member rt_genmask and the
code to maintain it, since nothing actually used it.
Make rt_maskedcopy() easier to read by using meaningful variable
names.
Extract a subroutine intern_netmask() for looking up a netmask in
the masks table.
Start converting backslash-ridden IPv6 macros in
sys/netinet6/in6_var.h into inline subroutines that one
can read without special eyeglasses.
One functional change: when the kernel serves an RTM_GET, RTM_LOCK,
or RTM_CHANGE request, it applies the netmask (if supplied) to a
destination before searching for it in the forwarding table.
I have changed sys/netinet/ip_carp.c, carp_setroute(), to remove
the unlawful radix_node knowledge.
Apart from the changes to carp(4), netiso, ATM, and strip(4), I
have run the changes on three nodes in my wireless routing testbed,
which involves IPv4 + IPv6 dynamic routing acrobatics, and it's
working beautifully so far.
2007-07-20 00:48:52 +04:00
|
|
|
#endif
|
2006-03-06 02:47:08 +03:00
|
|
|
|
2006-12-02 21:59:17 +03:00
|
|
|
struct in6_multi *in6_addmulti(struct in6_addr *, struct ifnet *,
|
|
|
|
int *, int);
|
|
|
|
void in6_delmulti(struct in6_multi *);
|
|
|
|
struct in6_multi_mship *in6_joingroup(struct ifnet *, struct in6_addr *,
|
|
|
|
int *, int);
|
|
|
|
int in6_leavegroup(struct in6_multi_mship *);
|
|
|
|
int in6_mask2len(struct in6_addr *, u_char *);
|
2007-03-04 08:59:00 +03:00
|
|
|
int in6_control(struct socket *, u_long, void *, struct ifnet *,
|
2006-12-02 21:59:17 +03:00
|
|
|
struct lwp *);
|
|
|
|
int in6_update_ifa(struct ifnet *, struct in6_aliasreq *,
|
|
|
|
struct in6_ifaddr *, int);
|
|
|
|
void in6_purgeaddr(struct ifaddr *);
|
|
|
|
int in6if_do_dad(struct ifnet *);
|
|
|
|
void in6_purgeif(struct ifnet *);
|
|
|
|
void in6_savemkludge(struct in6_ifaddr *);
|
|
|
|
void in6_setmaxmtu (void);
|
|
|
|
int in6_if2idlen (struct ifnet *);
|
|
|
|
void *in6_domifattach(struct ifnet *);
|
|
|
|
void in6_domifdetach(struct ifnet *, void *);
|
|
|
|
void in6_restoremkludge(struct in6_ifaddr *, struct ifnet *);
|
2006-05-18 13:05:49 +04:00
|
|
|
void in6_ifremloop(struct ifaddr *);
|
|
|
|
void in6_ifaddloop(struct ifaddr *);
|
2006-12-02 21:59:17 +03:00
|
|
|
void in6_createmkludge(struct ifnet *);
|
|
|
|
void in6_purgemkludge(struct ifnet *);
|
KNF: de-__P, bzero -> memset, bcmp -> memcmp. Remove extraneous
parentheses in return statements.
Cosmetic: don't open-code TAILQ_FOREACH().
Cosmetic: change types of variables to avoid oodles of casts: in
in6_src.c, avoid casts by changing several route_in6 pointers
to struct route pointers. Remove unnecessary casts to caddr_t
elsewhere.
Pave the way for eliminating address family-specific route caches:
soon, struct route will not embed a sockaddr, but it will hold
a reference to an external sockaddr, instead. We will set the
destination sockaddr using rtcache_setdst(). (I created a stub
for it, but it isn't used anywhere, yet.) rtcache_free() will
free the sockaddr. I have extracted from rtcache_free() a helper
subroutine, rtcache_clear(). rtcache_clear() will "forget" a
cached route, but it will not forget the destination by releasing
the sockaddr. I use rtcache_clear() instead of rtcache_free()
in rtcache_update(), because rtcache_update() is not supposed
to forget the destination.
Constify:
1 Introduce const accessor for route->ro_dst, rtcache_getdst().
2 Constify the 'dst' argument to ifnet->if_output(). This
led me to constify a lot of code called by output routines.
3 Constify the sockaddr argument to protosw->pr_ctlinput. This
led me to constify a lot of code called by ctlinput routines.
4 Introduce const macros for converting from a generic sockaddr
to family-specific sockaddrs, e.g., sockaddr_in: satocsin6,
satocsin, et cetera.
2007-02-18 01:34:07 +03:00
|
|
|
struct in6_ifaddr *in6ifa_ifpforlinklocal(const struct ifnet *, int);
|
2008-07-31 22:24:07 +04:00
|
|
|
struct in6_ifaddr *in6ifa_ifplocaladdr(const struct ifnet *,
|
|
|
|
const struct in6_addr *);
|
KNF: de-__P, bzero -> memset, bcmp -> memcmp. Remove extraneous
parentheses in return statements.
Cosmetic: don't open-code TAILQ_FOREACH().
Cosmetic: change types of variables to avoid oodles of casts: in
in6_src.c, avoid casts by changing several route_in6 pointers
to struct route pointers. Remove unnecessary casts to caddr_t
elsewhere.
Pave the way for eliminating address family-specific route caches:
soon, struct route will not embed a sockaddr, but it will hold
a reference to an external sockaddr, instead. We will set the
destination sockaddr using rtcache_setdst(). (I created a stub
for it, but it isn't used anywhere, yet.) rtcache_free() will
free the sockaddr. I have extracted from rtcache_free() a helper
subroutine, rtcache_clear(). rtcache_clear() will "forget" a
cached route, but it will not forget the destination by releasing
the sockaddr. I use rtcache_clear() instead of rtcache_free()
in rtcache_update(), because rtcache_update() is not supposed
to forget the destination.
Constify:
1 Introduce const accessor for route->ro_dst, rtcache_getdst().
2 Constify the 'dst' argument to ifnet->if_output(). This
led me to constify a lot of code called by output routines.
3 Constify the sockaddr argument to protosw->pr_ctlinput. This
led me to constify a lot of code called by ctlinput routines.
4 Introduce const macros for converting from a generic sockaddr
to family-specific sockaddrs, e.g., sockaddr_in: satocsin6,
satocsin, et cetera.
2007-02-18 01:34:07 +03:00
|
|
|
struct in6_ifaddr *in6ifa_ifpwithaddr(const struct ifnet *,
|
|
|
|
const struct in6_addr *);
|
2006-12-02 21:59:17 +03:00
|
|
|
char *ip6_sprintf(const struct in6_addr *);
|
|
|
|
int in6_matchlen(struct in6_addr *, struct in6_addr *);
|
|
|
|
int in6_are_prefix_equal(struct in6_addr *, struct in6_addr *, int);
|
|
|
|
void in6_prefixlen2mask(struct in6_addr *, int);
|
|
|
|
void in6_purgeprefix(struct ifnet *);
|
|
|
|
|
2007-03-08 01:20:04 +03:00
|
|
|
int ip6flow_fastforward(struct mbuf *); /* IPv6 fast forward routine */
|
|
|
|
|
2007-03-04 08:59:00 +03:00
|
|
|
int in6_src_ioctl(u_long, void *);
|
2006-12-02 21:59:17 +03:00
|
|
|
int in6_is_addr_deprecated(struct sockaddr_in6 *);
|
2001-02-08 17:56:15 +03:00
|
|
|
struct in6pcb;
|
1999-06-28 10:36:47 +04:00
|
|
|
#endif /* _KERNEL */
|
|
|
|
|
2005-12-11 02:31:41 +03:00
|
|
|
#endif /* !_NETINET6_IN6_VAR_H_ */
|