6e6b3f7cbc
1. separating L2 tables (ARP, NDP) from the L3 routing tables 2. removing as much locking dependencies among these layers as possible to allow for some parallelism in the search operations 3. simplify the logic in the routing code, The most notable end result is the obsolescent of the route cloning (RTF_CLONING) concept, which translated into code reduction in both IPv4 ARP and IPv6 NDP related modules, and size reduction in struct rtentry{}. The change in design obsoletes the semantics of RTF_CLONING, RTF_WASCLONE and RTF_LLINFO routing flags. The userland applications such as "arp" and "ndp" have been modified to reflect those changes. The output from "netstat -r" shows only the routing entries. Quite a few developers have contributed to this project in the past: Glebius Smirnoff, Luigi Rizzo, Alessandro Cerri, and Andre Oppermann. And most recently: - Kip Macy revised the locking code completely, thus completing the last piece of the puzzle, Kip has also been conducting active functional testing - Sam Leffler has helped me improving/refactoring the code, and provided valuable reviews - Julian Elischer setup the perforce tree for me and has helped me maintaining that branch before the svn conversion
348 lines
12 KiB
C
348 lines
12 KiB
C
/*-
|
|
* 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.
|
|
* 4. Neither the name of the University nor the names of its contributors
|
|
* 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.2 (Berkeley) 1/9/95
|
|
* $FreeBSD$
|
|
*/
|
|
|
|
#ifndef _NETINET_IN_VAR_H_
|
|
#define _NETINET_IN_VAR_H_
|
|
|
|
#include <sys/queue.h>
|
|
#include <sys/fnv_hash.h>
|
|
|
|
/*
|
|
* Interface address, Internet version. One of these structures
|
|
* is allocated for each Internet address on an interface.
|
|
* The ifaddr structure contains the protocol-independent part
|
|
* of the structure and is assumed to be first.
|
|
*/
|
|
struct in_ifaddr {
|
|
struct ifaddr ia_ifa; /* protocol-independent info */
|
|
#define ia_ifp ia_ifa.ifa_ifp
|
|
#define ia_flags ia_ifa.ifa_flags
|
|
/* ia_{,sub}net{,mask} in host order */
|
|
u_long ia_net; /* network number of interface */
|
|
u_long ia_netmask; /* mask of net part */
|
|
u_long ia_subnet; /* subnet number, including net */
|
|
u_long ia_subnetmask; /* mask of subnet part */
|
|
struct in_addr ia_netbroadcast; /* to recognize net broadcasts */
|
|
LIST_ENTRY(in_ifaddr) ia_hash; /* entry in bucket of inet addresses */
|
|
TAILQ_ENTRY(in_ifaddr) ia_link; /* list of internet addresses */
|
|
struct sockaddr_in ia_addr; /* reserve space for interface name */
|
|
struct sockaddr_in ia_dstaddr; /* reserve space for broadcast addr */
|
|
#define ia_broadaddr ia_dstaddr
|
|
struct sockaddr_in ia_sockmask; /* reserve space for general netmask */
|
|
};
|
|
|
|
struct in_aliasreq {
|
|
char ifra_name[IFNAMSIZ]; /* if name, e.g. "en0" */
|
|
struct sockaddr_in ifra_addr;
|
|
struct sockaddr_in ifra_broadaddr;
|
|
#define ifra_dstaddr ifra_broadaddr
|
|
struct sockaddr_in ifra_mask;
|
|
};
|
|
/*
|
|
* Given a pointer to an in_ifaddr (ifaddr),
|
|
* return a pointer to the addr as a sockaddr_in.
|
|
*/
|
|
#define IA_SIN(ia) (&(((struct in_ifaddr *)(ia))->ia_addr))
|
|
#define IA_DSTSIN(ia) (&(((struct in_ifaddr *)(ia))->ia_dstaddr))
|
|
|
|
#define IN_LNAOF(in, ifa) \
|
|
((ntohl((in).s_addr) & ~((struct in_ifaddr *)(ifa)->ia_subnetmask))
|
|
|
|
|
|
#ifdef _KERNEL
|
|
extern u_char inetctlerrmap[];
|
|
|
|
/*
|
|
* Hash table for IP addresses.
|
|
*/
|
|
TAILQ_HEAD(in_ifaddrhead, in_ifaddr);
|
|
LIST_HEAD(in_ifaddrhashhead, in_ifaddr);
|
|
#ifdef VIMAGE_GLOBALS
|
|
extern struct in_ifaddrhashhead *in_ifaddrhashtbl;
|
|
extern struct in_ifaddrhead in_ifaddrhead;
|
|
extern u_long in_ifaddrhmask; /* mask for hash table */
|
|
#endif
|
|
|
|
#define INADDR_NHASH_LOG2 9
|
|
#define INADDR_NHASH (1 << INADDR_NHASH_LOG2)
|
|
#define INADDR_HASHVAL(x) fnv_32_buf((&(x)), sizeof(x), FNV1_32_INIT)
|
|
#define INADDR_HASH(x) \
|
|
(&V_in_ifaddrhashtbl[INADDR_HASHVAL(x) & V_in_ifaddrhmask])
|
|
|
|
/*
|
|
* Macro for finding the internet address structure (in_ifaddr)
|
|
* corresponding to one of our IP addresses (in_addr).
|
|
*/
|
|
#define INADDR_TO_IFADDR(addr, ia) \
|
|
/* struct in_addr addr; */ \
|
|
/* struct in_ifaddr *ia; */ \
|
|
do { \
|
|
\
|
|
LIST_FOREACH(ia, INADDR_HASH((addr).s_addr), ia_hash) \
|
|
if (IA_SIN(ia)->sin_addr.s_addr == (addr).s_addr) \
|
|
break; \
|
|
} while (0)
|
|
|
|
/*
|
|
* Macro for finding the interface (ifnet structure) corresponding to one
|
|
* of our IP addresses.
|
|
*/
|
|
#define INADDR_TO_IFP(addr, ifp) \
|
|
/* struct in_addr addr; */ \
|
|
/* struct ifnet *ifp; */ \
|
|
{ \
|
|
struct in_ifaddr *ia; \
|
|
\
|
|
INADDR_TO_IFADDR(addr, ia); \
|
|
(ifp) = (ia == NULL) ? NULL : ia->ia_ifp; \
|
|
}
|
|
|
|
/*
|
|
* Macro for finding the internet address structure (in_ifaddr) corresponding
|
|
* to a given interface (ifnet structure).
|
|
*/
|
|
#define IFP_TO_IA(ifp, ia) \
|
|
/* struct ifnet *ifp; */ \
|
|
/* struct in_ifaddr *ia; */ \
|
|
{ \
|
|
for ((ia) = TAILQ_FIRST(&V_in_ifaddrhead); \
|
|
(ia) != NULL && (ia)->ia_ifp != (ifp); \
|
|
(ia) = TAILQ_NEXT((ia), ia_link)) \
|
|
continue; \
|
|
}
|
|
#endif
|
|
|
|
/*
|
|
* IP datagram reassembly.
|
|
*/
|
|
#define IPREASS_NHASH_LOG2 6
|
|
#define IPREASS_NHASH (1 << IPREASS_NHASH_LOG2)
|
|
#define IPREASS_HMASK (IPREASS_NHASH - 1)
|
|
#define IPREASS_HASH(x,y) \
|
|
(((((x) & 0xF) | ((((x) >> 8) & 0xF) << 4)) ^ (y)) & IPREASS_HMASK)
|
|
|
|
/*
|
|
* This information should be part of the ifnet structure but we don't wish
|
|
* to change that - as it might break a number of things
|
|
*/
|
|
|
|
struct router_info {
|
|
struct ifnet *rti_ifp;
|
|
int rti_type; /* type of router which is querier on this interface */
|
|
int rti_time; /* # of slow timeouts since last old query */
|
|
SLIST_ENTRY(router_info) rti_list;
|
|
#ifdef notyet
|
|
int rti_timev1; /* IGMPv1 querier present */
|
|
int rti_timev2; /* IGMPv2 querier present */
|
|
int rti_timer; /* report to general query */
|
|
int rti_qrv; /* querier robustness */
|
|
#endif
|
|
};
|
|
|
|
/*
|
|
* Internet multicast address structure. There is one of these for each IP
|
|
* multicast group to which this host belongs on a given network interface.
|
|
* For every entry on the interface's if_multiaddrs list which represents
|
|
* an IP multicast group, there is one of these structures. They are also
|
|
* kept on a system-wide list to make it easier to keep our legacy IGMP code
|
|
* compatible with the rest of the world (see IN_FIRST_MULTI et al, below).
|
|
*/
|
|
struct in_multi {
|
|
LIST_ENTRY(in_multi) inm_link; /* queue macro glue */
|
|
struct in_addr inm_addr; /* IP multicast address, convenience */
|
|
struct ifnet *inm_ifp; /* back pointer to ifnet */
|
|
struct ifmultiaddr *inm_ifma; /* back pointer to ifmultiaddr */
|
|
u_int inm_timer; /* IGMP membership report timer */
|
|
u_int inm_state; /* state of the membership */
|
|
struct router_info *inm_rti; /* router info*/
|
|
u_int inm_refcount; /* reference count */
|
|
#ifdef notyet /* IGMPv3 source-specific multicast fields */
|
|
TAILQ_HEAD(, in_msfentry) inm_msf; /* all active source filters */
|
|
TAILQ_HEAD(, in_msfentry) inm_msf_record; /* recorded sources */
|
|
TAILQ_HEAD(, in_msfentry) inm_msf_exclude; /* exclude sources */
|
|
TAILQ_HEAD(, in_msfentry) inm_msf_include; /* include sources */
|
|
/* XXX: should this lot go to the router_info structure? */
|
|
/* XXX: can/should these be callouts? */
|
|
/* IGMP protocol timers */
|
|
int32_t inm_ti_curstate; /* current state timer */
|
|
int32_t inm_ti_statechg; /* state change timer */
|
|
/* IGMP report timers */
|
|
uint16_t inm_rpt_statechg; /* state change report timer */
|
|
uint16_t inm_rpt_toxx; /* fmode change report timer */
|
|
/* IGMP protocol state */
|
|
uint16_t inm_fmode; /* filter mode */
|
|
uint32_t inm_recsrc_count; /* # of recorded sources */
|
|
uint16_t inm_exclude_sock_count; /* # of exclude-mode sockets */
|
|
uint16_t inm_gass_count; /* # of g-a-s queries */
|
|
#endif
|
|
};
|
|
|
|
#ifdef notyet
|
|
/*
|
|
* Internet multicast source filter list. This list is used to store
|
|
* IP multicast source addresses for each membership on an interface.
|
|
* TODO: Allocate these structures using UMA.
|
|
* TODO: Find an easier way of linking the struct into two lists at once.
|
|
*/
|
|
struct in_msfentry {
|
|
TAILQ_ENTRY(in_msfentry) isf_link; /* next filter in all-list */
|
|
TAILQ_ENTRY(in_msfentry) isf_next; /* next filter in queue */
|
|
struct in_addr isf_addr; /* the address of this source */
|
|
uint16_t isf_refcount; /* reference count */
|
|
uint16_t isf_reporttag; /* what to report to the IGMP router */
|
|
uint16_t isf_rexmit; /* retransmission state/count */
|
|
};
|
|
#endif
|
|
|
|
#ifdef _KERNEL
|
|
|
|
#ifdef SYSCTL_DECL
|
|
SYSCTL_DECL(_net_inet);
|
|
SYSCTL_DECL(_net_inet_ip);
|
|
SYSCTL_DECL(_net_inet_raw);
|
|
#endif
|
|
|
|
LIST_HEAD(in_multihead, in_multi);
|
|
#ifdef VIMAGE_GLOBALS
|
|
extern struct in_multihead in_multihead;
|
|
#endif
|
|
|
|
/*
|
|
* Lock macros for IPv4 layer multicast address lists. IPv4 lock goes
|
|
* before link layer multicast locks in the lock order. In most cases,
|
|
* consumers of IN_*_MULTI() macros should acquire the locks before
|
|
* calling them; users of the in_{add,del}multi() functions should not.
|
|
*/
|
|
extern struct mtx in_multi_mtx;
|
|
#define IN_MULTI_LOCK() mtx_lock(&in_multi_mtx)
|
|
#define IN_MULTI_UNLOCK() mtx_unlock(&in_multi_mtx)
|
|
#define IN_MULTI_LOCK_ASSERT() mtx_assert(&in_multi_mtx, MA_OWNED)
|
|
|
|
/*
|
|
* Structure used by macros below to remember position when stepping through
|
|
* all of the in_multi records.
|
|
*/
|
|
struct in_multistep {
|
|
struct in_multi *i_inm;
|
|
};
|
|
|
|
/*
|
|
* Macro for looking up the in_multi record for a given IP multicast address
|
|
* on a given interface. If no matching record is found, "inm" is set null.
|
|
*/
|
|
#define IN_LOOKUP_MULTI(addr, ifp, inm) \
|
|
/* struct in_addr addr; */ \
|
|
/* struct ifnet *ifp; */ \
|
|
/* struct in_multi *inm; */ \
|
|
do { \
|
|
struct ifmultiaddr *ifma; \
|
|
\
|
|
IN_MULTI_LOCK_ASSERT(); \
|
|
IF_ADDR_LOCK(ifp); \
|
|
TAILQ_FOREACH(ifma, &((ifp)->if_multiaddrs), ifma_link) { \
|
|
if (ifma->ifma_addr->sa_family == AF_INET \
|
|
&& ((struct sockaddr_in *)ifma->ifma_addr)->sin_addr.s_addr == \
|
|
(addr).s_addr) \
|
|
break; \
|
|
} \
|
|
(inm) = ifma ? ifma->ifma_protospec : 0; \
|
|
IF_ADDR_UNLOCK(ifp); \
|
|
} while(0)
|
|
|
|
/*
|
|
* Macro to step through all of the in_multi records, one at a time.
|
|
* The current position is remembered in "step", which the caller must
|
|
* provide. IN_FIRST_MULTI(), below, must be called to initialize "step"
|
|
* and get the first record. Both macros return a NULL "inm" when there
|
|
* are no remaining records.
|
|
*/
|
|
#define IN_NEXT_MULTI(step, inm) \
|
|
/* struct in_multistep step; */ \
|
|
/* struct in_multi *inm; */ \
|
|
do { \
|
|
IN_MULTI_LOCK_ASSERT(); \
|
|
if (((inm) = (step).i_inm) != NULL) \
|
|
(step).i_inm = LIST_NEXT((step).i_inm, inm_link); \
|
|
} while(0)
|
|
|
|
#define IN_FIRST_MULTI(step, inm) \
|
|
/* struct in_multistep step; */ \
|
|
/* struct in_multi *inm; */ \
|
|
do { \
|
|
IN_MULTI_LOCK_ASSERT(); \
|
|
(step).i_inm = LIST_FIRST(&V_in_multihead); \
|
|
IN_NEXT_MULTI((step), (inm)); \
|
|
} while(0)
|
|
|
|
struct rtentry;
|
|
struct route;
|
|
struct ip_moptions;
|
|
|
|
size_t imo_match_group(struct ip_moptions *, struct ifnet *,
|
|
struct sockaddr *);
|
|
struct in_msource *imo_match_source(struct ip_moptions *, size_t,
|
|
struct sockaddr *);
|
|
struct in_multi *in_addmulti(struct in_addr *, struct ifnet *);
|
|
void in_delmulti(struct in_multi *);
|
|
void in_delmulti_locked(struct in_multi *);
|
|
int in_control(struct socket *, u_long, caddr_t, struct ifnet *,
|
|
struct thread *);
|
|
void in_rtqdrain(void);
|
|
void ip_input(struct mbuf *);
|
|
int in_ifadown(struct ifaddr *ifa, int);
|
|
void in_ifscrub(struct ifnet *, struct in_ifaddr *);
|
|
struct mbuf *ip_fastforward(struct mbuf *);
|
|
void *in_domifattach(struct ifnet *);
|
|
void in_domifdetach(struct ifnet *, void *);
|
|
|
|
|
|
/* XXX */
|
|
void in_rtalloc_ign(struct route *ro, u_long ignflags, u_int fibnum);
|
|
void in_rtalloc(struct route *ro, u_int fibnum);
|
|
struct rtentry *in_rtalloc1(struct sockaddr *, int, u_long, u_int);
|
|
void in_rtredirect(struct sockaddr *, struct sockaddr *,
|
|
struct sockaddr *, int, struct sockaddr *, u_int);
|
|
int in_rtrequest(int, struct sockaddr *,
|
|
struct sockaddr *, struct sockaddr *, int, struct rtentry **, u_int);
|
|
|
|
#if 0
|
|
int in_rt_getifa(struct rt_addrinfo *, u_int fibnum);
|
|
int in_rtioctl(u_long, caddr_t, u_int);
|
|
int in_rtrequest1(int, struct rt_addrinfo *, struct rtentry **, u_int);
|
|
#endif
|
|
#endif /* _KERNEL */
|
|
|
|
/* INET6 stuff */
|
|
#include <netinet6/in6_var.h>
|
|
|
|
#endif /* _NETINET_IN_VAR_H_ */
|