2011-04-14 19:53:36 +04:00
|
|
|
/* $NetBSD: ip_output.c,v 1.208 2011/04/14 15:53:36 yamt Exp $ */
|
1999-07-01 12:12:45 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
|
|
|
|
* All rights reserved.
|
2002-06-09 20:33:36 +04:00
|
|
|
*
|
1999-07-01 12:12:45 +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.
|
2002-06-09 20:33:36 +04:00
|
|
|
*
|
1999-07-01 12:12:45 +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.
|
|
|
|
*/
|
1998-12-19 05:46:12 +03:00
|
|
|
|
|
|
|
/*-
|
|
|
|
* Copyright (c) 1998 The NetBSD Foundation, Inc.
|
|
|
|
* All rights reserved.
|
|
|
|
*
|
|
|
|
* This code is derived from software contributed to The NetBSD Foundation
|
|
|
|
* by Public Access Networks Corporation ("Panix"). It was developed under
|
|
|
|
* contract to Panix by Eric Haszlakiewicz and Thor Lancelot Simon.
|
|
|
|
*
|
|
|
|
* 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.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. 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 FOUNDATION 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.
|
|
|
|
*/
|
1994-06-29 10:29:24 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
1994-05-13 10:02:48 +04:00
|
|
|
* Copyright (c) 1982, 1986, 1988, 1990, 1993
|
|
|
|
* The Regents of the University of California. All rights reserved.
|
1993-03-21 12:45:37 +03: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.
|
2003-08-07 20:26:28 +04:00
|
|
|
* 3. Neither the name of the University nor the names of its contributors
|
1993-03-21 12:45:37 +03: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.
|
|
|
|
*
|
1994-06-29 10:29:24 +04:00
|
|
|
* @(#)ip_output.c 8.3 (Berkeley) 1/21/94
|
1993-03-21 12:45:37 +03:00
|
|
|
*/
|
|
|
|
|
2001-11-13 03:32:34 +03:00
|
|
|
#include <sys/cdefs.h>
|
2011-04-14 19:53:36 +04:00
|
|
|
__KERNEL_RCSID(0, "$NetBSD: ip_output.c,v 1.208 2011/04/14 15:53:36 yamt Exp $");
|
2001-11-13 03:32:34 +03:00
|
|
|
|
1998-08-09 12:58:18 +04:00
|
|
|
#include "opt_pfil_hooks.h"
|
2003-11-19 21:39:34 +03:00
|
|
|
#include "opt_inet.h"
|
1999-07-10 02:57:15 +04:00
|
|
|
#include "opt_ipsec.h"
|
1998-01-12 06:02:48 +03:00
|
|
|
#include "opt_mrouting.h"
|
|
|
|
|
1993-12-18 03:40:47 +03:00
|
|
|
#include <sys/param.h>
|
|
|
|
#include <sys/malloc.h>
|
|
|
|
#include <sys/mbuf.h>
|
|
|
|
#include <sys/errno.h>
|
|
|
|
#include <sys/protosw.h>
|
|
|
|
#include <sys/socket.h>
|
|
|
|
#include <sys/socketvar.h>
|
2006-05-15 04:05:16 +04:00
|
|
|
#include <sys/kauth.h>
|
2003-08-23 05:41:10 +04:00
|
|
|
#ifdef FAST_IPSEC
|
|
|
|
#include <sys/domain.h>
|
|
|
|
#endif
|
1996-02-14 02:40:59 +03:00
|
|
|
#include <sys/systm.h>
|
1999-07-01 12:12:45 +04:00
|
|
|
#include <sys/proc.h>
|
|
|
|
|
1993-12-18 03:40:47 +03:00
|
|
|
#include <net/if.h>
|
|
|
|
#include <net/route.h>
|
1997-02-18 23:49:32 +03:00
|
|
|
#include <net/pfil.h>
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1993-12-18 03:40:47 +03:00
|
|
|
#include <netinet/in.h>
|
|
|
|
#include <netinet/in_systm.h>
|
|
|
|
#include <netinet/ip.h>
|
|
|
|
#include <netinet/in_pcb.h>
|
|
|
|
#include <netinet/in_var.h>
|
|
|
|
#include <netinet/ip_var.h>
|
2008-04-12 09:58:22 +04:00
|
|
|
#include <netinet/ip_private.h>
|
2005-04-19 02:06:28 +04:00
|
|
|
#include <netinet/in_offload.h>
|
1993-03-21 12:45:37 +03:00
|
|
|
|
2000-03-31 18:31:03 +04:00
|
|
|
#ifdef MROUTING
|
|
|
|
#include <netinet/ip_mroute.h>
|
|
|
|
#endif
|
|
|
|
|
1996-02-14 02:40:59 +03:00
|
|
|
#include <machine/stdarg.h>
|
|
|
|
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef IPSEC
|
|
|
|
#include <netinet6/ipsec.h>
|
2008-04-23 10:09:04 +04:00
|
|
|
#include <netinet6/ipsec_private.h>
|
1999-07-01 12:12:45 +04:00
|
|
|
#include <netkey/key.h>
|
|
|
|
#include <netkey/key_debug.h>
|
|
|
|
#endif /*IPSEC*/
|
|
|
|
|
2003-08-15 07:42:00 +04:00
|
|
|
#ifdef FAST_IPSEC
|
|
|
|
#include <netipsec/ipsec.h>
|
|
|
|
#include <netipsec/key.h>
|
|
|
|
#include <netipsec/xform.h>
|
|
|
|
#endif /* FAST_IPSEC*/
|
|
|
|
|
2006-02-23 04:35:19 +03:00
|
|
|
#ifdef IPSEC_NAT_T
|
|
|
|
#include <netinet/udp.h>
|
|
|
|
#endif
|
|
|
|
|
2005-02-03 00:41:55 +03:00
|
|
|
static struct mbuf *ip_insertoptions(struct mbuf *, struct mbuf *, int *);
|
|
|
|
static struct ifnet *ip_multicast_if(struct in_addr *, int *);
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
static void ip_mloopback(struct ifnet *, struct mbuf *,
|
|
|
|
const struct sockaddr_in *);
|
1993-03-21 12:45:37 +03:00
|
|
|
|
Restructure the PFIL_HOOKS mechanism a bit:
- All packets are passed to PFIL_HOOKS as they come off the wire, i.e.
fields in protocol headers in network order, etc.
- Allow for multiple hooks to be registered, using a "key" and a "dlt".
The "dlt" is a BPF data link type, indicating what type of header is
present.
- INET and INET6 register with key == AF_INET or AF_INET6, and
dlt == DLT_RAW.
- PFIL_HOOKS now take an argument for the filter hook, and mbuf **,
an ifnet *, and a direction (PFIL_IN or PFIL_OUT), thus making them
less IP (really, IP Filter) centric.
Maintain compatibility with IP Filter by adding wrapper functions for
IP Filter.
2000-11-11 03:52:36 +03:00
|
|
|
#ifdef PFIL_HOOKS
|
|
|
|
extern struct pfil_head inet_pfil_hook; /* XXX */
|
|
|
|
#endif
|
|
|
|
|
2005-04-19 01:50:25 +04:00
|
|
|
int ip_do_loopback_cksum = 0;
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* IP output. The packet in mbuf chain m contains a skeletal IP
|
|
|
|
* header (with len, off, ttl, proto, tos, src, dst).
|
|
|
|
* The mbuf chain containing the packet will be freed.
|
|
|
|
* The mbuf opt, if present, will not be freed.
|
|
|
|
*/
|
1994-01-09 04:06:02 +03:00
|
|
|
int
|
1996-02-14 02:40:59 +03:00
|
|
|
ip_output(struct mbuf *m0, ...)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
2007-12-20 22:53:29 +03:00
|
|
|
struct rtentry *rt;
|
2003-08-19 02:23:22 +04:00
|
|
|
struct ip *ip;
|
2000-03-30 16:51:13 +04:00
|
|
|
struct ifnet *ifp;
|
|
|
|
struct mbuf *m = m0;
|
|
|
|
int hlen = sizeof (struct ip);
|
2003-08-19 02:23:22 +04:00
|
|
|
int len, error = 0;
|
1993-03-21 12:45:37 +03:00
|
|
|
struct route iproute;
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
const struct sockaddr_in *dst;
|
1993-03-21 12:45:37 +03:00
|
|
|
struct in_ifaddr *ia;
|
2006-11-13 08:13:38 +03:00
|
|
|
struct ifaddr *xifa;
|
1996-02-14 02:40:59 +03:00
|
|
|
struct mbuf *opt;
|
|
|
|
struct route *ro;
|
2001-06-02 20:17:09 +04:00
|
|
|
int flags, sw_csum;
|
1997-10-14 04:52:39 +04:00
|
|
|
int *mtu_p;
|
2002-05-31 09:26:42 +04:00
|
|
|
u_long mtu;
|
1996-02-14 02:40:59 +03:00
|
|
|
struct ip_moptions *imo;
|
2003-08-23 01:53:01 +04:00
|
|
|
struct socket *so;
|
1996-02-14 02:40:59 +03:00
|
|
|
va_list ap;
|
2005-02-12 15:31:07 +03:00
|
|
|
#ifdef IPSEC_NAT_T
|
|
|
|
int natt_frag = 0;
|
|
|
|
#endif
|
2006-02-23 04:35:19 +03:00
|
|
|
#ifdef IPSEC
|
|
|
|
struct secpolicy *sp = NULL;
|
1999-07-01 12:12:45 +04:00
|
|
|
#endif /*IPSEC*/
|
2003-08-15 07:42:00 +04:00
|
|
|
#ifdef FAST_IPSEC
|
2003-08-23 01:53:01 +04:00
|
|
|
struct inpcb *inp;
|
2003-08-15 07:42:00 +04:00
|
|
|
struct secpolicy *sp = NULL;
|
|
|
|
int s;
|
|
|
|
#endif
|
2000-11-11 03:55:51 +03:00
|
|
|
u_int16_t ip_len;
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
union {
|
|
|
|
struct sockaddr dst;
|
|
|
|
struct sockaddr_in dst4;
|
|
|
|
} u;
|
|
|
|
struct sockaddr *rdst = &u.dst; /* real IP destination, as opposed
|
|
|
|
* to the nexthop
|
|
|
|
*/
|
1996-02-14 02:40:59 +03:00
|
|
|
|
2002-09-17 17:10:59 +04:00
|
|
|
len = 0;
|
1996-02-14 02:40:59 +03:00
|
|
|
va_start(ap, m0);
|
|
|
|
opt = va_arg(ap, struct mbuf *);
|
|
|
|
ro = va_arg(ap, struct route *);
|
|
|
|
flags = va_arg(ap, int);
|
|
|
|
imo = va_arg(ap, struct ip_moptions *);
|
2003-08-23 01:53:01 +04:00
|
|
|
so = va_arg(ap, struct socket *);
|
1997-10-14 04:52:39 +04:00
|
|
|
if (flags & IP_RETURNMTU)
|
|
|
|
mtu_p = va_arg(ap, int *);
|
|
|
|
else
|
|
|
|
mtu_p = NULL;
|
1996-02-14 02:40:59 +03:00
|
|
|
va_end(ap);
|
|
|
|
|
2003-02-26 09:31:08 +03:00
|
|
|
MCLAIM(m, &ip_tx_mowner);
|
2003-08-23 01:53:01 +04:00
|
|
|
#ifdef FAST_IPSEC
|
2003-09-19 04:27:56 +04:00
|
|
|
if (so != NULL && so->so_proto->pr_domain->dom_family == AF_INET)
|
2003-08-23 01:53:01 +04:00
|
|
|
inp = (struct inpcb *)so->so_pcb;
|
|
|
|
else
|
|
|
|
inp = NULL;
|
2004-03-02 05:28:28 +03:00
|
|
|
#endif /* FAST_IPSEC */
|
1999-07-01 12:12:45 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if ((m->m_flags & M_PKTHDR) == 0)
|
2006-07-12 17:11:27 +04:00
|
|
|
panic("ip_output: no HDR");
|
|
|
|
|
2006-07-12 18:07:02 +04:00
|
|
|
if ((m->m_pkthdr.csum_flags & (M_CSUM_TCPv6|M_CSUM_UDPv6)) != 0) {
|
2006-07-12 17:11:27 +04:00
|
|
|
panic("ip_output: IPv6 checksum offload flags: %d",
|
|
|
|
m->m_pkthdr.csum_flags);
|
|
|
|
}
|
|
|
|
|
|
|
|
if ((m->m_pkthdr.csum_flags & (M_CSUM_TCPv4|M_CSUM_UDPv4)) ==
|
|
|
|
(M_CSUM_TCPv4|M_CSUM_UDPv4)) {
|
|
|
|
panic("ip_output: conflicting checksum offload flags: %d",
|
|
|
|
m->m_pkthdr.csum_flags);
|
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
#endif
|
|
|
|
if (opt) {
|
|
|
|
m = ip_insertoptions(m, opt, &len);
|
2002-09-17 17:10:59 +04:00
|
|
|
if (len >= sizeof(struct ip))
|
|
|
|
hlen = len;
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
|
|
|
ip = mtod(m, struct ip *);
|
|
|
|
/*
|
|
|
|
* Fill in IP header.
|
|
|
|
*/
|
1994-05-13 10:02:48 +04:00
|
|
|
if ((flags & (IP_FORWARDING|IP_RAWOUTPUT)) == 0) {
|
1993-03-21 12:45:37 +03:00
|
|
|
ip->ip_v = IPVERSION;
|
2002-08-14 04:23:27 +04:00
|
|
|
ip->ip_off = htons(0);
|
2008-02-06 06:20:50 +03:00
|
|
|
/* ip->ip_id filled in after we find out source ia */
|
1993-03-21 12:45:37 +03:00
|
|
|
ip->ip_hl = hlen >> 2;
|
2008-04-12 09:58:22 +04:00
|
|
|
IP_STATINC(IP_STAT_LOCALOUT);
|
1993-03-21 12:45:37 +03:00
|
|
|
} else {
|
|
|
|
hlen = ip->ip_hl << 2;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Route packet.
|
|
|
|
*/
|
2007-01-29 09:00:11 +03:00
|
|
|
memset(&iproute, 0, sizeof(iproute));
|
2007-01-14 02:13:46 +03:00
|
|
|
if (ro == NULL)
|
1993-03-21 12:45:37 +03:00
|
|
|
ro = &iproute;
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
sockaddr_in_init(&u.dst4, &ip->ip_dst, 0);
|
|
|
|
dst = satocsin(rtcache_getdst(ro));
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* If there is a cached route,
|
|
|
|
* check that it is to the same destination
|
|
|
|
* and is still up. If not, free it and try again.
|
2002-01-22 06:53:55 +03:00
|
|
|
* The address family should also be checked in case of sharing the
|
|
|
|
* cache with IPv6.
|
1993-03-21 12:45:37 +03:00
|
|
|
*/
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
if (dst == NULL)
|
|
|
|
;
|
|
|
|
else if (dst->sin_family != AF_INET ||
|
|
|
|
!in_hosteq(dst->sin_addr, ip->ip_dst))
|
2006-12-16 00:18:52 +03:00
|
|
|
rtcache_free(ro);
|
2008-01-12 05:58:58 +03:00
|
|
|
|
|
|
|
if ((rt = rtcache_validate(ro)) == NULL &&
|
|
|
|
(rt = rtcache_update(ro, 1)) == NULL) {
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
dst = &u.dst4;
|
|
|
|
rtcache_setdst(ro, &u.dst);
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
|
|
|
/*
|
|
|
|
* If routing to interface only,
|
|
|
|
* short circuit routing lookup.
|
|
|
|
*/
|
|
|
|
if (flags & IP_ROUTETOIF) {
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
if ((ia = ifatoia(ifa_ifwithladdr(sintocsa(dst)))) == NULL) {
|
2008-04-12 09:58:22 +04:00
|
|
|
IP_STATINC(IP_STAT_NOROUTE);
|
1993-03-21 12:45:37 +03:00
|
|
|
error = ENETUNREACH;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
ifp = ia->ia_ifp;
|
1998-04-28 19:26:00 +04:00
|
|
|
mtu = ifp->if_mtu;
|
1994-05-13 10:02:48 +04:00
|
|
|
ip->ip_ttl = 1;
|
2002-06-24 12:01:35 +04:00
|
|
|
} else if ((IN_MULTICAST(ip->ip_dst.s_addr) ||
|
|
|
|
ip->ip_dst.s_addr == INADDR_BROADCAST) &&
|
|
|
|
imo != NULL && imo->imo_multicast_ifp != NULL) {
|
|
|
|
ifp = imo->imo_multicast_ifp;
|
|
|
|
mtu = ifp->if_mtu;
|
2002-06-24 12:11:30 +04:00
|
|
|
IFP_TO_IA(ifp, ia);
|
1993-03-21 12:45:37 +03:00
|
|
|
} else {
|
2007-12-20 22:53:29 +03:00
|
|
|
if (rt == NULL)
|
2008-01-12 05:58:58 +03:00
|
|
|
rt = rtcache_init(ro);
|
|
|
|
if (rt == NULL) {
|
2008-04-12 09:58:22 +04:00
|
|
|
IP_STATINC(IP_STAT_NOROUTE);
|
1993-03-21 12:45:37 +03:00
|
|
|
error = EHOSTUNREACH;
|
|
|
|
goto bad;
|
|
|
|
}
|
2007-12-20 22:53:29 +03:00
|
|
|
ia = ifatoia(rt->rt_ifa);
|
|
|
|
ifp = rt->rt_ifp;
|
|
|
|
if ((mtu = rt->rt_rmx.rmx_mtu) == 0)
|
1998-04-28 19:26:00 +04:00
|
|
|
mtu = ifp->if_mtu;
|
2007-12-20 22:53:29 +03:00
|
|
|
rt->rt_use++;
|
|
|
|
if (rt->rt_flags & RTF_GATEWAY)
|
|
|
|
dst = satosin(rt->rt_gateway);
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
1999-12-13 20:04:11 +03:00
|
|
|
if (IN_MULTICAST(ip->ip_dst.s_addr) ||
|
|
|
|
(ip->ip_dst.s_addr == INADDR_BROADCAST)) {
|
1993-12-06 07:50:19 +03:00
|
|
|
struct in_multi *inm;
|
|
|
|
|
1999-12-13 20:04:11 +03:00
|
|
|
m->m_flags |= (ip->ip_dst.s_addr == INADDR_BROADCAST) ?
|
|
|
|
M_BCAST : M_MCAST;
|
1993-12-06 07:50:19 +03:00
|
|
|
/*
|
|
|
|
* See if the caller provided any multicast options
|
|
|
|
*/
|
2002-06-24 12:01:35 +04:00
|
|
|
if (imo != NULL)
|
1993-12-06 07:50:19 +03:00
|
|
|
ip->ip_ttl = imo->imo_multicast_ttl;
|
2002-06-24 12:01:35 +04:00
|
|
|
else
|
1993-12-06 07:50:19 +03:00
|
|
|
ip->ip_ttl = IP_DEFAULT_MULTICAST_TTL;
|
2002-06-24 12:01:35 +04:00
|
|
|
|
|
|
|
/*
|
|
|
|
* if we don't know the outgoing ifp yet, we can't generate
|
|
|
|
* output
|
|
|
|
*/
|
|
|
|
if (!ifp) {
|
2008-04-12 09:58:22 +04:00
|
|
|
IP_STATINC(IP_STAT_NOROUTE);
|
2002-06-24 12:01:35 +04:00
|
|
|
error = ENETUNREACH;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
1993-12-06 07:50:19 +03:00
|
|
|
/*
|
2002-02-08 00:47:45 +03:00
|
|
|
* If the packet is multicast or broadcast, confirm that
|
|
|
|
* the outgoing interface can transmit it.
|
1993-12-06 07:50:19 +03:00
|
|
|
*/
|
1999-12-13 20:04:11 +03:00
|
|
|
if (((m->m_flags & M_MCAST) &&
|
|
|
|
(ifp->if_flags & IFF_MULTICAST) == 0) ||
|
2002-06-09 20:33:36 +04:00
|
|
|
((m->m_flags & M_BCAST) &&
|
2002-02-08 00:47:45 +03:00
|
|
|
(ifp->if_flags & (IFF_BROADCAST|IFF_POINTOPOINT)) == 0)) {
|
2008-04-12 09:58:22 +04:00
|
|
|
IP_STATINC(IP_STAT_NOROUTE);
|
1993-12-06 07:50:19 +03:00
|
|
|
error = ENETUNREACH;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
/*
|
1998-02-13 21:21:38 +03:00
|
|
|
* If source address not specified yet, use an address
|
1993-12-06 07:50:19 +03:00
|
|
|
* of outgoing interface.
|
|
|
|
*/
|
1996-09-09 18:51:07 +04:00
|
|
|
if (in_nullhost(ip->ip_src)) {
|
2005-05-30 01:41:23 +04:00
|
|
|
struct in_ifaddr *xia;
|
1993-12-06 07:50:19 +03:00
|
|
|
|
2005-05-30 01:41:23 +04:00
|
|
|
IFP_TO_IA(ifp, xia);
|
|
|
|
if (!xia) {
|
2002-01-08 13:05:13 +03:00
|
|
|
error = EADDRNOTAVAIL;
|
|
|
|
goto bad;
|
|
|
|
}
|
2006-11-13 08:13:38 +03:00
|
|
|
xifa = &xia->ia_ifa;
|
|
|
|
if (xifa->ifa_getifa != NULL) {
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
xia = ifatoia((*xifa->ifa_getifa)(xifa, rdst));
|
2006-11-13 08:13:38 +03:00
|
|
|
}
|
2005-05-30 01:41:23 +04:00
|
|
|
ip->ip_src = xia->ia_addr.sin_addr;
|
1993-12-06 07:50:19 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
IN_LOOKUP_MULTI(ip->ip_dst, ifp, inm);
|
|
|
|
if (inm != NULL &&
|
|
|
|
(imo == NULL || imo->imo_multicast_loop)) {
|
|
|
|
/*
|
1994-01-09 00:21:28 +03:00
|
|
|
* If we belong to the destination multicast group
|
1993-12-06 07:50:19 +03:00
|
|
|
* on the outgoing interface, and the caller did not
|
|
|
|
* forbid loopback, loop back a copy.
|
|
|
|
*/
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
ip_mloopback(ifp, m, &u.dst4);
|
1993-12-06 07:50:19 +03:00
|
|
|
}
|
|
|
|
#ifdef MROUTING
|
1994-05-13 10:02:48 +04:00
|
|
|
else {
|
1993-12-06 07:50:19 +03:00
|
|
|
/*
|
|
|
|
* If we are acting as a multicast router, perform
|
|
|
|
* multicast forwarding as if the packet had just
|
|
|
|
* arrived on the interface to which we are about
|
|
|
|
* to send. The multicast forwarding function
|
|
|
|
* recursively calls this function, using the
|
|
|
|
* IP_FORWARDING flag to prevent infinite recursion.
|
|
|
|
*
|
|
|
|
* Multicasts that are looped back by ip_mloopback(),
|
|
|
|
* above, will be forwarded by the ip_input() routine,
|
|
|
|
* if necessary.
|
|
|
|
*/
|
1994-05-13 10:02:48 +04:00
|
|
|
extern struct socket *ip_mrouter;
|
1995-05-15 05:24:53 +04:00
|
|
|
|
1994-05-13 10:02:48 +04:00
|
|
|
if (ip_mrouter && (flags & IP_FORWARDING) == 0) {
|
|
|
|
if (ip_mforward(m, ifp) != 0) {
|
|
|
|
m_freem(m);
|
|
|
|
goto done;
|
|
|
|
}
|
1993-12-06 07:50:19 +03:00
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
/*
|
|
|
|
* Multicasts with a time-to-live of zero may be looped-
|
|
|
|
* back, above, but must not be transmitted on a network.
|
|
|
|
* Also, multicasts addressed to the loopback interface
|
|
|
|
* are not sent -- the above call to ip_mloopback() will
|
|
|
|
* loop back a copy if this host actually belongs to the
|
|
|
|
* destination group on the loopback interface.
|
|
|
|
*/
|
1995-04-11 08:30:47 +04:00
|
|
|
if (ip->ip_ttl == 0 || (ifp->if_flags & IFF_LOOPBACK) != 0) {
|
1993-12-06 07:50:19 +03:00
|
|
|
m_freem(m);
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
|
|
|
goto sendit;
|
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* If source address not specified yet, use address
|
|
|
|
* of outgoing interface.
|
|
|
|
*/
|
2006-11-13 08:13:38 +03:00
|
|
|
if (in_nullhost(ip->ip_src)) {
|
|
|
|
xifa = &ia->ia_ifa;
|
|
|
|
if (xifa->ifa_getifa != NULL)
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
ia = ifatoia((*xifa->ifa_getifa)(xifa, rdst));
|
1995-06-04 09:58:20 +04:00
|
|
|
ip->ip_src = ia->ia_addr.sin_addr;
|
2006-11-13 08:13:38 +03:00
|
|
|
}
|
1999-05-04 23:50:23 +04:00
|
|
|
|
|
|
|
/*
|
2002-06-09 20:33:36 +04:00
|
|
|
* packets with Class-D address as source are not valid per
|
1999-05-04 23:50:23 +04:00
|
|
|
* RFC 1112
|
|
|
|
*/
|
|
|
|
if (IN_MULTICAST(ip->ip_src.s_addr)) {
|
2008-04-12 09:58:22 +04:00
|
|
|
IP_STATINC(IP_STAT_ODROPPED);
|
1999-05-04 23:50:23 +04:00
|
|
|
error = EADDRNOTAVAIL;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* Look for broadcast address and
|
|
|
|
* and verify user is allowed to send
|
|
|
|
* such a packet.
|
|
|
|
*/
|
1994-05-13 10:02:48 +04:00
|
|
|
if (in_broadcast(dst->sin_addr, ifp)) {
|
1993-03-21 12:45:37 +03:00
|
|
|
if ((ifp->if_flags & IFF_BROADCAST) == 0) {
|
|
|
|
error = EADDRNOTAVAIL;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
if ((flags & IP_ALLOWBROADCAST) == 0) {
|
|
|
|
error = EACCES;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
/* don't allow broadcast messages to be fragmented */
|
2002-08-14 04:23:27 +04:00
|
|
|
if (ntohs(ip->ip_len) > ifp->if_mtu) {
|
1993-03-21 12:45:37 +03:00
|
|
|
error = EMSGSIZE;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
m->m_flags |= M_BCAST;
|
1994-05-13 10:02:48 +04:00
|
|
|
} else
|
|
|
|
m->m_flags &= ~M_BCAST;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1999-06-07 05:26:04 +04:00
|
|
|
sendit:
|
2008-02-06 06:20:50 +03:00
|
|
|
if ((flags & (IP_FORWARDING|IP_NOIPNEWID)) == 0) {
|
|
|
|
if (m->m_pkthdr.len < IP_MINFRAGSIZE) {
|
|
|
|
ip->ip_id = 0;
|
|
|
|
} else if ((m->m_pkthdr.csum_flags & M_CSUM_TSOv4) == 0) {
|
|
|
|
ip->ip_id = ip_newid(ia);
|
|
|
|
} else {
|
|
|
|
|
|
|
|
/*
|
|
|
|
* TSO capable interfaces (typically?) increment
|
|
|
|
* ip_id for each segment.
|
|
|
|
* "allocate" enough ids here to increase the chance
|
|
|
|
* for them to be unique.
|
|
|
|
*
|
|
|
|
* note that the following calculation is not
|
|
|
|
* needed to be precise. wasting some ip_id is fine.
|
|
|
|
*/
|
|
|
|
|
|
|
|
unsigned int segsz = m->m_pkthdr.segsz;
|
|
|
|
unsigned int datasz = ntohs(ip->ip_len) - hlen;
|
|
|
|
unsigned int num = howmany(datasz, segsz);
|
|
|
|
|
|
|
|
ip->ip_id = ip_newid_range(ia, num);
|
|
|
|
}
|
|
|
|
}
|
2000-10-17 06:57:01 +04:00
|
|
|
/*
|
|
|
|
* If we're doing Path MTU Discovery, we need to set DF unless
|
|
|
|
* the route's MTU is locked.
|
|
|
|
*/
|
2007-12-20 22:53:29 +03:00
|
|
|
if ((flags & IP_MTUDISC) != 0 && rt != NULL &&
|
|
|
|
(rt->rt_rmx.rmx_locks & RTV_MTU) == 0)
|
2002-08-14 04:23:27 +04:00
|
|
|
ip->ip_off |= htons(IP_DF);
|
2000-10-17 06:57:01 +04:00
|
|
|
|
2002-08-14 04:23:27 +04:00
|
|
|
/* Remember the current ip_len */
|
|
|
|
ip_len = ntohs(ip->ip_len);
|
Restructure the PFIL_HOOKS mechanism a bit:
- All packets are passed to PFIL_HOOKS as they come off the wire, i.e.
fields in protocol headers in network order, etc.
- Allow for multiple hooks to be registered, using a "key" and a "dlt".
The "dlt" is a BPF data link type, indicating what type of header is
present.
- INET and INET6 register with key == AF_INET or AF_INET6, and
dlt == DLT_RAW.
- PFIL_HOOKS now take an argument for the filter hook, and mbuf **,
an ifnet *, and a direction (PFIL_IN or PFIL_OUT), thus making them
less IP (really, IP Filter) centric.
Maintain compatibility with IP Filter by adding wrapper functions for
IP Filter.
2000-11-11 03:52:36 +03:00
|
|
|
|
1999-07-01 12:12:45 +04:00
|
|
|
#ifdef IPSEC
|
|
|
|
/* get SP for this packet */
|
|
|
|
if (so == NULL)
|
2003-08-19 02:23:22 +04:00
|
|
|
sp = ipsec4_getpolicybyaddr(m, IPSEC_DIR_OUTBOUND,
|
|
|
|
flags, &error);
|
2004-03-02 05:28:28 +03:00
|
|
|
else {
|
|
|
|
if (IPSEC_PCB_SKIP_IPSEC(sotoinpcb_hdr(so)->inph_sp,
|
|
|
|
IPSEC_DIR_OUTBOUND))
|
|
|
|
goto skip_ipsec;
|
2000-01-31 17:18:52 +03:00
|
|
|
sp = ipsec4_getpolicybysock(m, IPSEC_DIR_OUTBOUND, so, &error);
|
2004-03-02 05:28:28 +03:00
|
|
|
}
|
1999-07-01 12:12:45 +04:00
|
|
|
|
|
|
|
if (sp == NULL) {
|
2008-04-23 10:09:04 +04:00
|
|
|
IPSEC_STATINC(IPSEC_STAT_IN_INVAL);
|
1999-07-01 12:12:45 +04:00
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
|
|
|
error = 0;
|
|
|
|
|
|
|
|
/* check policy */
|
|
|
|
switch (sp->policy) {
|
|
|
|
case IPSEC_POLICY_DISCARD:
|
|
|
|
/*
|
|
|
|
* This packet is just discarded.
|
|
|
|
*/
|
2008-04-23 10:09:04 +04:00
|
|
|
IPSEC_STATINC(IPSEC_STAT_OUT_POLVIO);
|
1999-07-01 12:12:45 +04:00
|
|
|
goto bad;
|
|
|
|
|
|
|
|
case IPSEC_POLICY_BYPASS:
|
|
|
|
case IPSEC_POLICY_NONE:
|
|
|
|
/* no need to do IPsec. */
|
|
|
|
goto skip_ipsec;
|
2002-06-09 20:33:36 +04:00
|
|
|
|
1999-07-01 12:12:45 +04:00
|
|
|
case IPSEC_POLICY_IPSEC:
|
|
|
|
if (sp->req == NULL) {
|
|
|
|
/* XXX should be panic ? */
|
|
|
|
printf("ip_output: No IPsec request specified.\n");
|
|
|
|
error = EINVAL;
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case IPSEC_POLICY_ENTRUST:
|
|
|
|
default:
|
|
|
|
printf("ip_output: Invalid policy found. %d\n", sp->policy);
|
|
|
|
}
|
|
|
|
|
2005-02-12 15:31:07 +03:00
|
|
|
#ifdef IPSEC_NAT_T
|
|
|
|
/*
|
2005-02-27 01:45:09 +03:00
|
|
|
* NAT-T ESP fragmentation: don't do IPSec processing now,
|
|
|
|
* we'll do it on each fragmented packet.
|
2005-02-12 15:31:07 +03:00
|
|
|
*/
|
|
|
|
if (sp->req->sav &&
|
|
|
|
((sp->req->sav->natt_type & UDP_ENCAP_ESPINUDP) ||
|
|
|
|
(sp->req->sav->natt_type & UDP_ENCAP_ESPINUDP_NON_IKE))) {
|
|
|
|
if (ntohs(ip->ip_len) > sp->req->sav->esp_frag) {
|
|
|
|
natt_frag = 1;
|
|
|
|
mtu = sp->req->sav->esp_frag;
|
|
|
|
goto skip_ipsec;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif /* IPSEC_NAT_T */
|
|
|
|
|
Restructure the PFIL_HOOKS mechanism a bit:
- All packets are passed to PFIL_HOOKS as they come off the wire, i.e.
fields in protocol headers in network order, etc.
- Allow for multiple hooks to be registered, using a "key" and a "dlt".
The "dlt" is a BPF data link type, indicating what type of header is
present.
- INET and INET6 register with key == AF_INET or AF_INET6, and
dlt == DLT_RAW.
- PFIL_HOOKS now take an argument for the filter hook, and mbuf **,
an ifnet *, and a direction (PFIL_IN or PFIL_OUT), thus making them
less IP (really, IP Filter) centric.
Maintain compatibility with IP Filter by adding wrapper functions for
IP Filter.
2000-11-11 03:52:36 +03:00
|
|
|
/*
|
|
|
|
* ipsec4_output() expects ip_len and ip_off in network
|
|
|
|
* order. They have been set to network order above.
|
|
|
|
*/
|
1999-07-01 12:12:45 +04:00
|
|
|
|
|
|
|
{
|
|
|
|
struct ipsec_output_state state;
|
2009-03-18 19:00:08 +03:00
|
|
|
memset(&state, 0, sizeof(state));
|
1999-07-01 12:12:45 +04:00
|
|
|
state.m = m;
|
|
|
|
if (flags & IP_ROUTETOIF) {
|
|
|
|
state.ro = &iproute;
|
2007-01-29 09:00:11 +03:00
|
|
|
memset(&iproute, 0, sizeof(iproute));
|
1999-07-01 12:12:45 +04:00
|
|
|
} else
|
|
|
|
state.ro = ro;
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
state.dst = sintocsa(dst);
|
1999-07-01 12:12:45 +04:00
|
|
|
|
2001-06-02 20:17:09 +04:00
|
|
|
/*
|
|
|
|
* We can't defer the checksum of payload data if
|
|
|
|
* we're about to encrypt/authenticate it.
|
|
|
|
*
|
|
|
|
* XXX When we support crypto offloading functions of
|
|
|
|
* XXX network interfaces, we need to reconsider this,
|
|
|
|
* XXX since it's likely that they'll support checksumming,
|
|
|
|
* XXX as well.
|
|
|
|
*/
|
|
|
|
if (m->m_pkthdr.csum_flags & (M_CSUM_TCPv4|M_CSUM_UDPv4)) {
|
|
|
|
in_delayed_cksum(m);
|
|
|
|
m->m_pkthdr.csum_flags &= ~(M_CSUM_TCPv4|M_CSUM_UDPv4);
|
|
|
|
}
|
|
|
|
|
1999-07-01 12:12:45 +04:00
|
|
|
error = ipsec4_output(&state, sp, flags);
|
|
|
|
|
|
|
|
m = state.m;
|
|
|
|
if (flags & IP_ROUTETOIF) {
|
|
|
|
/*
|
|
|
|
* if we have tunnel mode SA, we may need to ignore
|
|
|
|
* IP_ROUTETOIF.
|
|
|
|
*/
|
2008-01-14 07:19:09 +03:00
|
|
|
if (state.ro != &iproute ||
|
|
|
|
rtcache_validate(state.ro) != NULL) {
|
1999-07-01 12:12:45 +04:00
|
|
|
flags &= ~IP_ROUTETOIF;
|
|
|
|
ro = state.ro;
|
|
|
|
}
|
|
|
|
} else
|
|
|
|
ro = state.ro;
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
dst = satocsin(state.dst);
|
1999-07-01 12:12:45 +04:00
|
|
|
if (error) {
|
|
|
|
/* mbuf is already reclaimed in ipsec4_output. */
|
|
|
|
m0 = NULL;
|
|
|
|
switch (error) {
|
|
|
|
case EHOSTUNREACH:
|
|
|
|
case ENETUNREACH:
|
|
|
|
case EMSGSIZE:
|
|
|
|
case ENOBUFS:
|
|
|
|
case ENOMEM:
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
printf("ip4_output (ipsec): error code %d\n", error);
|
|
|
|
/*fall through*/
|
|
|
|
case ENOENT:
|
|
|
|
/* don't show these error codes to the user */
|
|
|
|
error = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* be sure to update variables that are affected by ipsec4_output() */
|
|
|
|
ip = mtod(m, struct ip *);
|
|
|
|
hlen = ip->ip_hl << 2;
|
Restructure the PFIL_HOOKS mechanism a bit:
- All packets are passed to PFIL_HOOKS as they come off the wire, i.e.
fields in protocol headers in network order, etc.
- Allow for multiple hooks to be registered, using a "key" and a "dlt".
The "dlt" is a BPF data link type, indicating what type of header is
present.
- INET and INET6 register with key == AF_INET or AF_INET6, and
dlt == DLT_RAW.
- PFIL_HOOKS now take an argument for the filter hook, and mbuf **,
an ifnet *, and a direction (PFIL_IN or PFIL_OUT), thus making them
less IP (really, IP Filter) centric.
Maintain compatibility with IP Filter by adding wrapper functions for
IP Filter.
2000-11-11 03:52:36 +03:00
|
|
|
ip_len = ntohs(ip->ip_len);
|
|
|
|
|
2008-01-14 07:19:09 +03:00
|
|
|
if ((rt = rtcache_validate(ro)) == NULL) {
|
1999-07-01 12:12:45 +04:00
|
|
|
if ((flags & IP_ROUTETOIF) == 0) {
|
|
|
|
printf("ip_output: "
|
|
|
|
"can't update route after IPsec processing\n");
|
|
|
|
error = EHOSTUNREACH; /*XXX*/
|
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* nobody uses ia beyond here */
|
2004-06-01 09:06:56 +04:00
|
|
|
if (state.encap) {
|
2007-12-20 22:53:29 +03:00
|
|
|
ifp = rt->rt_ifp;
|
|
|
|
if ((mtu = rt->rt_rmx.rmx_mtu) == 0)
|
2004-06-01 09:06:56 +04:00
|
|
|
mtu = ifp->if_mtu;
|
|
|
|
}
|
1999-07-01 12:12:45 +04:00
|
|
|
}
|
2001-11-21 09:28:08 +03:00
|
|
|
}
|
1999-07-01 12:12:45 +04:00
|
|
|
skip_ipsec:
|
|
|
|
#endif /*IPSEC*/
|
2003-08-15 07:42:00 +04:00
|
|
|
#ifdef FAST_IPSEC
|
|
|
|
/*
|
|
|
|
* Check the security policy (SP) for the packet and, if
|
|
|
|
* required, do IPsec-related processing. There are two
|
|
|
|
* cases here; the first time a packet is sent through
|
|
|
|
* it will be untagged and handled by ipsec4_checkpolicy.
|
|
|
|
* If the packet is resubmitted to ip_output (e.g. after
|
|
|
|
* AH, ESP, etc. processing), there will be a tag to bypass
|
|
|
|
* the lookup and related policy checking.
|
|
|
|
*/
|
2007-12-29 17:53:24 +03:00
|
|
|
if (!ipsec_outdone(m)) {
|
|
|
|
s = splsoftnet();
|
2004-03-02 05:28:28 +03:00
|
|
|
if (inp != NULL &&
|
2009-07-01 18:47:54 +04:00
|
|
|
IPSEC_PCB_SKIP_IPSEC(inp->inp_sp, IPSEC_DIR_OUTBOUND)) {
|
|
|
|
splx(s);
|
2004-03-02 05:28:28 +03:00
|
|
|
goto spd_done;
|
2009-07-01 18:47:54 +04:00
|
|
|
}
|
2003-08-15 07:42:00 +04:00
|
|
|
sp = ipsec4_checkpolicy(m, IPSEC_DIR_OUTBOUND, flags,
|
2007-12-29 17:53:24 +03:00
|
|
|
&error, inp);
|
2006-02-23 04:35:19 +03:00
|
|
|
/*
|
2007-12-29 17:53:24 +03:00
|
|
|
* There are four return cases:
|
|
|
|
* sp != NULL apply IPsec policy
|
|
|
|
* sp == NULL, error == 0 no IPsec handling needed
|
|
|
|
* sp == NULL, error == -EINVAL discard packet w/o error
|
|
|
|
* sp == NULL, error != 0 discard packet, report error
|
2006-02-23 04:35:19 +03:00
|
|
|
*/
|
2007-12-29 17:53:24 +03:00
|
|
|
if (sp != NULL) {
|
|
|
|
#ifdef IPSEC_NAT_T
|
|
|
|
/*
|
|
|
|
* NAT-T ESP fragmentation: don't do IPSec processing now,
|
|
|
|
* we'll do it on each fragmented packet.
|
|
|
|
*/
|
|
|
|
if (sp->req->sav &&
|
|
|
|
((sp->req->sav->natt_type & UDP_ENCAP_ESPINUDP) ||
|
|
|
|
(sp->req->sav->natt_type & UDP_ENCAP_ESPINUDP_NON_IKE))) {
|
|
|
|
if (ntohs(ip->ip_len) > sp->req->sav->esp_frag) {
|
|
|
|
natt_frag = 1;
|
|
|
|
mtu = sp->req->sav->esp_frag;
|
2007-12-29 18:13:55 +03:00
|
|
|
splx(s);
|
2007-12-29 17:53:24 +03:00
|
|
|
goto spd_done;
|
|
|
|
}
|
2006-02-23 04:35:19 +03:00
|
|
|
}
|
|
|
|
#endif /* IPSEC_NAT_T */
|
2007-12-29 17:53:24 +03:00
|
|
|
|
2003-08-15 07:42:00 +04:00
|
|
|
/*
|
2007-12-29 17:53:24 +03:00
|
|
|
* Do delayed checksums now because we send before
|
|
|
|
* this is done in the normal processing path.
|
2003-08-15 07:42:00 +04:00
|
|
|
*/
|
2007-12-29 17:53:24 +03:00
|
|
|
if (m->m_pkthdr.csum_flags & (M_CSUM_TCPv4|M_CSUM_UDPv4)) {
|
|
|
|
in_delayed_cksum(m);
|
|
|
|
m->m_pkthdr.csum_flags &= ~(M_CSUM_TCPv4|M_CSUM_UDPv4);
|
2003-08-15 07:42:00 +04:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef __FreeBSD__
|
2007-12-29 17:53:24 +03:00
|
|
|
ip->ip_len = htons(ip->ip_len);
|
|
|
|
ip->ip_off = htons(ip->ip_off);
|
2003-08-15 07:42:00 +04:00
|
|
|
#endif
|
|
|
|
|
2007-12-29 17:53:24 +03:00
|
|
|
/* NB: callee frees mbuf */
|
|
|
|
error = ipsec4_process_packet(m, sp->req, flags, 0);
|
2003-08-15 07:42:00 +04:00
|
|
|
/*
|
2007-12-29 17:53:24 +03:00
|
|
|
* Preserve KAME behaviour: ENOENT can be returned
|
|
|
|
* when an SA acquire is in progress. Don't propagate
|
|
|
|
* this to user-level; it confuses applications.
|
|
|
|
*
|
|
|
|
* XXX this will go away when the SADB is redone.
|
2003-08-15 07:42:00 +04:00
|
|
|
*/
|
2007-12-29 17:53:24 +03:00
|
|
|
if (error == ENOENT)
|
2003-08-15 07:42:00 +04:00
|
|
|
error = 0;
|
2007-12-29 17:53:24 +03:00
|
|
|
splx(s);
|
|
|
|
goto done;
|
2003-08-15 07:42:00 +04:00
|
|
|
} else {
|
2007-12-29 17:53:24 +03:00
|
|
|
splx(s);
|
|
|
|
|
|
|
|
if (error != 0) {
|
|
|
|
/*
|
|
|
|
* Hack: -EINVAL is used to signal that a packet
|
|
|
|
* should be silently discarded. This is typically
|
|
|
|
* because we asked key management for an SA and
|
|
|
|
* it was delayed (e.g. kicked up to IKE).
|
|
|
|
*/
|
|
|
|
if (error == -EINVAL)
|
|
|
|
error = 0;
|
|
|
|
goto bad;
|
|
|
|
} else {
|
|
|
|
/* No IPsec processing for this packet. */
|
|
|
|
}
|
2003-08-15 07:42:00 +04:00
|
|
|
}
|
|
|
|
}
|
|
|
|
spd_done:
|
|
|
|
#endif /* FAST_IPSEC */
|
1999-07-01 12:12:45 +04:00
|
|
|
|
2001-01-24 12:04:15 +03:00
|
|
|
#ifdef PFIL_HOOKS
|
|
|
|
/*
|
|
|
|
* Run through list of hooks for output packets.
|
|
|
|
*/
|
2003-06-30 05:22:51 +04:00
|
|
|
if ((error = pfil_run_hooks(&inet_pfil_hook, &m, ifp, PFIL_OUT)) != 0)
|
2001-01-24 12:04:15 +03:00
|
|
|
goto done;
|
|
|
|
if (m == NULL)
|
|
|
|
goto done;
|
|
|
|
|
|
|
|
ip = mtod(m, struct ip *);
|
2003-06-30 05:22:51 +04:00
|
|
|
hlen = ip->ip_hl << 2;
|
2007-01-08 07:14:54 +03:00
|
|
|
ip_len = ntohs(ip->ip_len);
|
2001-01-24 12:04:15 +03:00
|
|
|
#endif /* PFIL_HOOKS */
|
|
|
|
|
2005-03-06 03:35:07 +03:00
|
|
|
m->m_pkthdr.csum_data |= hlen << 16;
|
|
|
|
|
2004-10-06 09:42:24 +04:00
|
|
|
#if IFA_STATS
|
|
|
|
/*
|
|
|
|
* search for the source address structure to
|
|
|
|
* maintain output statistics.
|
|
|
|
*/
|
|
|
|
INADDR_TO_IA(ip->ip_src, ia);
|
|
|
|
#endif
|
|
|
|
|
2004-12-15 07:25:19 +03:00
|
|
|
/* Maybe skip checksums on loopback interfaces. */
|
2005-04-19 01:50:25 +04:00
|
|
|
if (IN_NEED_CHECKSUM(ifp, M_CSUM_IPv4)) {
|
2004-12-15 07:25:19 +03:00
|
|
|
m->m_pkthdr.csum_flags |= M_CSUM_IPv4;
|
2005-04-19 01:50:25 +04:00
|
|
|
}
|
2003-05-26 19:12:11 +04:00
|
|
|
sw_csum = m->m_pkthdr.csum_flags & ~ifp->if_csum_flags_tx;
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
2005-03-09 06:39:27 +03:00
|
|
|
* If small enough for mtu of path, or if using TCP segmentation
|
|
|
|
* offload, can just send directly.
|
1993-03-21 12:45:37 +03:00
|
|
|
*/
|
2005-03-09 06:39:27 +03:00
|
|
|
if (ip_len <= mtu ||
|
|
|
|
(m->m_pkthdr.csum_flags & M_CSUM_TSOv4) != 0) {
|
1999-12-13 18:17:17 +03:00
|
|
|
#if IFA_STATS
|
|
|
|
if (ia)
|
Restructure the PFIL_HOOKS mechanism a bit:
- All packets are passed to PFIL_HOOKS as they come off the wire, i.e.
fields in protocol headers in network order, etc.
- Allow for multiple hooks to be registered, using a "key" and a "dlt".
The "dlt" is a BPF data link type, indicating what type of header is
present.
- INET and INET6 register with key == AF_INET or AF_INET6, and
dlt == DLT_RAW.
- PFIL_HOOKS now take an argument for the filter hook, and mbuf **,
an ifnet *, and a direction (PFIL_IN or PFIL_OUT), thus making them
less IP (really, IP Filter) centric.
Maintain compatibility with IP Filter by adding wrapper functions for
IP Filter.
2000-11-11 03:52:36 +03:00
|
|
|
ia->ia_ifa.ifa_data.ifad_outbytes += ip_len;
|
1999-12-13 18:17:17 +03:00
|
|
|
#endif
|
2001-06-02 20:17:09 +04:00
|
|
|
/*
|
|
|
|
* Always initialize the sum to 0! Some HW assisted
|
|
|
|
* checksumming requires this.
|
|
|
|
*/
|
1993-03-21 12:45:37 +03:00
|
|
|
ip->ip_sum = 0;
|
2001-06-02 20:17:09 +04:00
|
|
|
|
2005-03-11 20:07:51 +03:00
|
|
|
if ((m->m_pkthdr.csum_flags & M_CSUM_TSOv4) == 0) {
|
2005-03-09 06:39:27 +03:00
|
|
|
/*
|
|
|
|
* Perform any checksums that the hardware can't do
|
|
|
|
* for us.
|
|
|
|
*
|
|
|
|
* XXX Does any hardware require the {th,uh}_sum
|
|
|
|
* XXX fields to be 0?
|
|
|
|
*/
|
|
|
|
if (sw_csum & M_CSUM_IPv4) {
|
2005-04-19 01:50:25 +04:00
|
|
|
KASSERT(IN_NEED_CHECKSUM(ifp, M_CSUM_IPv4));
|
2005-03-09 06:39:27 +03:00
|
|
|
ip->ip_sum = in_cksum(m, hlen);
|
|
|
|
m->m_pkthdr.csum_flags &= ~M_CSUM_IPv4;
|
|
|
|
}
|
|
|
|
if (sw_csum & (M_CSUM_TCPv4|M_CSUM_UDPv4)) {
|
2005-04-19 01:50:25 +04:00
|
|
|
if (IN_NEED_CHECKSUM(ifp,
|
|
|
|
sw_csum & (M_CSUM_TCPv4|M_CSUM_UDPv4))) {
|
|
|
|
in_delayed_cksum(m);
|
|
|
|
}
|
2005-03-09 06:39:27 +03:00
|
|
|
m->m_pkthdr.csum_flags &=
|
|
|
|
~(M_CSUM_TCPv4|M_CSUM_UDPv4);
|
|
|
|
}
|
2005-03-06 03:35:07 +03:00
|
|
|
}
|
2001-06-02 20:17:09 +04:00
|
|
|
|
2001-01-24 12:04:15 +03:00
|
|
|
#ifdef IPSEC
|
|
|
|
/* clean ipsec history once it goes out of the node */
|
|
|
|
ipsec_delaux(m);
|
|
|
|
#endif
|
2005-04-19 02:06:28 +04:00
|
|
|
|
|
|
|
if (__predict_true(
|
|
|
|
(m->m_pkthdr.csum_flags & M_CSUM_TSOv4) == 0 ||
|
|
|
|
(ifp->if_capenable & IFCAP_TSOv4) != 0)) {
|
2011-04-14 19:53:36 +04:00
|
|
|
KERNEL_LOCK(1, NULL);
|
2005-04-19 02:06:28 +04:00
|
|
|
error =
|
2007-08-29 03:45:39 +04:00
|
|
|
(*ifp->if_output)(ifp, m,
|
|
|
|
(m->m_flags & M_MCAST) ?
|
|
|
|
sintocsa(rdst) : sintocsa(dst),
|
2007-12-20 22:53:29 +03:00
|
|
|
rt);
|
2011-04-14 19:53:36 +04:00
|
|
|
KERNEL_UNLOCK_ONE(NULL);
|
2005-04-19 02:06:28 +04:00
|
|
|
} else {
|
|
|
|
error =
|
2007-08-29 03:45:39 +04:00
|
|
|
ip_tso_output(ifp, m,
|
|
|
|
(m->m_flags & M_MCAST) ?
|
|
|
|
sintocsa(rdst) : sintocsa(dst),
|
2007-12-20 22:53:29 +03:00
|
|
|
rt);
|
2005-04-19 02:06:28 +04:00
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
goto done;
|
|
|
|
}
|
1999-07-01 12:12:45 +04:00
|
|
|
|
2001-06-02 20:17:09 +04:00
|
|
|
/*
|
|
|
|
* We can't use HW checksumming if we're about to
|
|
|
|
* to fragment the packet.
|
|
|
|
*
|
|
|
|
* XXX Some hardware can do this.
|
|
|
|
*/
|
|
|
|
if (m->m_pkthdr.csum_flags & (M_CSUM_TCPv4|M_CSUM_UDPv4)) {
|
2005-04-19 01:50:25 +04:00
|
|
|
if (IN_NEED_CHECKSUM(ifp,
|
|
|
|
m->m_pkthdr.csum_flags & (M_CSUM_TCPv4|M_CSUM_UDPv4))) {
|
|
|
|
in_delayed_cksum(m);
|
|
|
|
}
|
2001-06-02 20:17:09 +04:00
|
|
|
m->m_pkthdr.csum_flags &= ~(M_CSUM_TCPv4|M_CSUM_UDPv4);
|
|
|
|
}
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* Too large for interface; fragment if possible.
|
|
|
|
* Must be able to put at least 8 bytes per fragment.
|
|
|
|
*/
|
2002-08-14 04:23:27 +04:00
|
|
|
if (ntohs(ip->ip_off) & IP_DF) {
|
1997-10-14 04:52:39 +04:00
|
|
|
if (flags & IP_RETURNMTU)
|
1998-04-28 19:26:00 +04:00
|
|
|
*mtu_p = mtu;
|
1993-03-21 12:45:37 +03:00
|
|
|
error = EMSGSIZE;
|
2008-04-12 09:58:22 +04:00
|
|
|
IP_STATINC(IP_STAT_CANTFRAG);
|
1993-03-21 12:45:37 +03:00
|
|
|
goto bad;
|
|
|
|
}
|
2003-08-19 02:23:22 +04:00
|
|
|
|
|
|
|
error = ip_fragment(m, ifp, mtu);
|
2003-10-14 07:38:49 +04:00
|
|
|
if (error) {
|
|
|
|
m = NULL;
|
1993-03-21 12:45:37 +03:00
|
|
|
goto bad;
|
2003-10-14 07:38:49 +04:00
|
|
|
}
|
2003-08-19 02:23:22 +04:00
|
|
|
|
2003-08-27 06:09:59 +04:00
|
|
|
for (; m; m = m0) {
|
2003-08-19 02:23:22 +04:00
|
|
|
m0 = m->m_nextpkt;
|
|
|
|
m->m_nextpkt = 0;
|
|
|
|
if (error == 0) {
|
|
|
|
#if IFA_STATS
|
2004-10-06 09:42:24 +04:00
|
|
|
if (ia)
|
2003-08-19 02:23:22 +04:00
|
|
|
ia->ia_ifa.ifa_data.ifad_outbytes +=
|
|
|
|
ntohs(ip->ip_len);
|
|
|
|
#endif
|
|
|
|
#ifdef IPSEC
|
|
|
|
/* clean ipsec history once it goes out of the node */
|
|
|
|
ipsec_delaux(m);
|
2006-02-23 04:35:19 +03:00
|
|
|
#endif /* IPSEC */
|
2005-02-12 15:31:07 +03:00
|
|
|
|
|
|
|
#ifdef IPSEC_NAT_T
|
2005-02-27 01:45:09 +03:00
|
|
|
/*
|
2005-02-12 15:31:07 +03:00
|
|
|
* If we get there, the packet has not been handeld by
|
2005-02-27 01:45:09 +03:00
|
|
|
* IPSec whereas it should have. Now that it has been
|
2005-02-12 15:31:07 +03:00
|
|
|
* fragmented, re-inject it in ip_output so that IPsec
|
|
|
|
* processing can occur.
|
|
|
|
*/
|
|
|
|
if (natt_frag) {
|
2005-02-27 01:45:09 +03:00
|
|
|
error = ip_output(m, opt,
|
2005-02-12 15:31:07 +03:00
|
|
|
ro, flags, imo, so, mtu_p);
|
2005-02-27 01:45:09 +03:00
|
|
|
} else
|
2005-02-12 15:31:07 +03:00
|
|
|
#endif /* IPSEC_NAT_T */
|
|
|
|
{
|
|
|
|
KASSERT((m->m_pkthdr.csum_flags &
|
|
|
|
(M_CSUM_UDPv4 | M_CSUM_TCPv4)) == 0);
|
2011-04-14 19:53:36 +04:00
|
|
|
KERNEL_LOCK(1, NULL);
|
2007-08-29 03:45:39 +04:00
|
|
|
error = (*ifp->if_output)(ifp, m,
|
|
|
|
(m->m_flags & M_MCAST) ?
|
|
|
|
sintocsa(rdst) : sintocsa(dst),
|
2007-12-20 22:53:29 +03:00
|
|
|
rt);
|
2011-04-14 19:53:36 +04:00
|
|
|
KERNEL_UNLOCK_ONE(NULL);
|
2005-02-12 15:31:07 +03:00
|
|
|
}
|
2003-08-19 02:23:22 +04:00
|
|
|
} else
|
|
|
|
m_freem(m);
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
|
|
|
|
2003-08-19 02:23:22 +04:00
|
|
|
if (error == 0)
|
2008-04-12 09:58:22 +04:00
|
|
|
IP_STATINC(IP_STAT_FRAGMENTED);
|
2003-08-19 02:23:22 +04:00
|
|
|
done:
|
2007-01-14 02:13:46 +03:00
|
|
|
rtcache_free(&iproute);
|
2003-08-19 02:23:22 +04:00
|
|
|
|
|
|
|
#ifdef IPSEC
|
|
|
|
if (sp != NULL) {
|
|
|
|
KEYDEBUG(KEYDEBUG_IPSEC_STAMP,
|
|
|
|
printf("DP ip_output call free SP:%p\n", sp));
|
|
|
|
key_freesp(sp);
|
|
|
|
}
|
|
|
|
#endif /* IPSEC */
|
|
|
|
#ifdef FAST_IPSEC
|
|
|
|
if (sp != NULL)
|
|
|
|
KEY_FREESP(&sp);
|
|
|
|
#endif /* FAST_IPSEC */
|
|
|
|
|
|
|
|
return (error);
|
|
|
|
bad:
|
|
|
|
m_freem(m);
|
|
|
|
goto done;
|
|
|
|
}
|
|
|
|
|
2003-08-19 05:20:03 +04:00
|
|
|
int
|
2003-08-19 02:23:22 +04:00
|
|
|
ip_fragment(struct mbuf *m, struct ifnet *ifp, u_long mtu)
|
|
|
|
{
|
|
|
|
struct ip *ip, *mhip;
|
|
|
|
struct mbuf *m0;
|
|
|
|
int len, hlen, off;
|
|
|
|
int mhlen, firstlen;
|
|
|
|
struct mbuf **mnext;
|
2004-09-05 03:29:44 +04:00
|
|
|
int sw_csum = m->m_pkthdr.csum_flags;
|
1998-04-28 19:26:00 +04:00
|
|
|
int fragments = 0;
|
|
|
|
int s;
|
2003-08-19 02:23:22 +04:00
|
|
|
int error = 0;
|
|
|
|
|
|
|
|
ip = mtod(m, struct ip *);
|
|
|
|
hlen = ip->ip_hl << 2;
|
2004-09-05 03:29:44 +04:00
|
|
|
if (ifp != NULL)
|
|
|
|
sw_csum &= ~ifp->if_csum_flags_tx;
|
2003-08-19 02:23:22 +04:00
|
|
|
|
|
|
|
len = (mtu - hlen) &~ 7;
|
2003-10-14 07:38:49 +04:00
|
|
|
if (len < 8) {
|
|
|
|
m_freem(m);
|
2003-08-19 02:23:22 +04:00
|
|
|
return (EMSGSIZE);
|
2003-10-14 07:38:49 +04:00
|
|
|
}
|
2003-08-19 02:23:22 +04:00
|
|
|
|
|
|
|
firstlen = len;
|
|
|
|
mnext = &m->m_nextpkt;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
/*
|
|
|
|
* Loop through length of segment after first fragment,
|
|
|
|
* make new header and copy data of each part and link onto chain.
|
|
|
|
*/
|
|
|
|
m0 = m;
|
|
|
|
mhlen = sizeof (struct ip);
|
2002-08-14 04:23:27 +04:00
|
|
|
for (off = hlen + len; off < ntohs(ip->ip_len); off += len) {
|
1993-03-21 12:45:37 +03:00
|
|
|
MGETHDR(m, M_DONTWAIT, MT_HEADER);
|
|
|
|
if (m == 0) {
|
|
|
|
error = ENOBUFS;
|
2008-04-12 09:58:22 +04:00
|
|
|
IP_STATINC(IP_STAT_ODROPPED);
|
1993-03-21 12:45:37 +03:00
|
|
|
goto sendorfree;
|
|
|
|
}
|
2003-02-26 09:31:08 +03:00
|
|
|
MCLAIM(m, m0->m_owner);
|
1995-05-15 05:24:53 +04:00
|
|
|
*mnext = m;
|
|
|
|
mnext = &m->m_nextpkt;
|
1993-03-21 12:45:37 +03:00
|
|
|
m->m_data += max_linkhdr;
|
|
|
|
mhip = mtod(m, struct ip *);
|
|
|
|
*mhip = *ip;
|
2000-04-13 15:48:07 +04:00
|
|
|
/* we must inherit MCAST and BCAST flags */
|
|
|
|
m->m_flags |= m0->m_flags & (M_MCAST|M_BCAST);
|
1993-03-21 12:45:37 +03:00
|
|
|
if (hlen > sizeof (struct ip)) {
|
|
|
|
mhlen = ip_optcopy(ip, mhip) + sizeof (struct ip);
|
|
|
|
mhip->ip_hl = mhlen >> 2;
|
|
|
|
}
|
|
|
|
m->m_len = mhlen;
|
2003-10-02 03:54:40 +04:00
|
|
|
mhip->ip_off = ((off - hlen) >> 3) +
|
|
|
|
(ntohs(ip->ip_off) & ~IP_MF);
|
|
|
|
if (ip->ip_off & htons(IP_MF))
|
1993-03-21 12:45:37 +03:00
|
|
|
mhip->ip_off |= IP_MF;
|
2002-08-14 04:23:27 +04:00
|
|
|
if (off + len >= ntohs(ip->ip_len))
|
|
|
|
len = ntohs(ip->ip_len) - off;
|
1993-03-21 12:45:37 +03:00
|
|
|
else
|
|
|
|
mhip->ip_off |= IP_MF;
|
2002-08-14 04:23:27 +04:00
|
|
|
HTONS(mhip->ip_off);
|
1995-04-13 10:35:38 +04:00
|
|
|
mhip->ip_len = htons((u_int16_t)(len + mhlen));
|
2007-09-02 07:12:23 +04:00
|
|
|
m->m_next = m_copym(m0, off, len, M_DONTWAIT);
|
1993-03-21 12:45:37 +03:00
|
|
|
if (m->m_next == 0) {
|
|
|
|
error = ENOBUFS; /* ??? */
|
2008-04-12 09:58:22 +04:00
|
|
|
IP_STATINC(IP_STAT_ODROPPED);
|
1993-03-21 12:45:37 +03:00
|
|
|
goto sendorfree;
|
|
|
|
}
|
|
|
|
m->m_pkthdr.len = mhlen + len;
|
|
|
|
m->m_pkthdr.rcvif = (struct ifnet *)0;
|
|
|
|
mhip->ip_sum = 0;
|
2003-05-26 19:12:11 +04:00
|
|
|
if (sw_csum & M_CSUM_IPv4) {
|
|
|
|
mhip->ip_sum = in_cksum(m, mhlen);
|
|
|
|
KASSERT((m->m_pkthdr.csum_flags & M_CSUM_IPv4) == 0);
|
|
|
|
} else {
|
|
|
|
m->m_pkthdr.csum_flags |= M_CSUM_IPv4;
|
2005-03-10 09:03:00 +03:00
|
|
|
m->m_pkthdr.csum_data |= mhlen << 16;
|
2003-05-26 19:12:11 +04:00
|
|
|
}
|
2008-04-12 09:58:22 +04:00
|
|
|
IP_STATINC(IP_STAT_OFRAGMENTS);
|
1998-04-28 19:26:00 +04:00
|
|
|
fragments++;
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Update first fragment by trimming what's been copied out
|
|
|
|
* and updating header, then send each fragment (in order).
|
|
|
|
*/
|
|
|
|
m = m0;
|
2002-08-14 04:23:27 +04:00
|
|
|
m_adj(m, hlen + firstlen - ntohs(ip->ip_len));
|
1993-03-21 12:45:37 +03:00
|
|
|
m->m_pkthdr.len = hlen + firstlen;
|
1995-04-13 10:35:38 +04:00
|
|
|
ip->ip_len = htons((u_int16_t)m->m_pkthdr.len);
|
2002-08-14 04:23:27 +04:00
|
|
|
ip->ip_off |= htons(IP_MF);
|
1993-03-21 12:45:37 +03:00
|
|
|
ip->ip_sum = 0;
|
2011-04-10 00:34:36 +04:00
|
|
|
/*
|
2011-04-10 01:00:53 +04:00
|
|
|
* We may not use checksums on loopback interfaces
|
2011-04-10 00:34:36 +04:00
|
|
|
*/
|
2011-04-10 01:00:53 +04:00
|
|
|
if (__predict_false(ifp == NULL) ||
|
|
|
|
IN_NEED_CHECKSUM(ifp, M_CSUM_IPv4)) {
|
2011-04-10 00:34:36 +04:00
|
|
|
if (sw_csum & M_CSUM_IPv4) {
|
|
|
|
ip->ip_sum = in_cksum(m, hlen);
|
|
|
|
m->m_pkthdr.csum_flags &= ~M_CSUM_IPv4;
|
|
|
|
} else {
|
|
|
|
KASSERT(m->m_pkthdr.csum_flags & M_CSUM_IPv4);
|
|
|
|
KASSERT(M_CSUM_DATA_IPv4_IPHL(m->m_pkthdr.csum_data) >=
|
|
|
|
sizeof(struct ip));
|
|
|
|
}
|
2003-05-26 19:12:11 +04:00
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
sendorfree:
|
1998-04-28 19:26:00 +04:00
|
|
|
/*
|
|
|
|
* If there is no room for all the fragments, don't queue
|
|
|
|
* any of them.
|
|
|
|
*/
|
2004-09-05 03:29:44 +04:00
|
|
|
if (ifp != NULL) {
|
|
|
|
s = splnet();
|
|
|
|
if (ifp->if_snd.ifq_maxlen - ifp->if_snd.ifq_len < fragments &&
|
|
|
|
error == 0) {
|
|
|
|
error = ENOBUFS;
|
2008-04-12 09:58:22 +04:00
|
|
|
IP_STATINC(IP_STAT_ODROPPED);
|
2004-09-05 03:29:44 +04:00
|
|
|
IFQ_INC_DROPS(&ifp->if_snd);
|
|
|
|
}
|
|
|
|
splx(s);
|
2003-10-18 00:31:12 +04:00
|
|
|
}
|
2003-10-14 07:38:49 +04:00
|
|
|
if (error) {
|
2003-10-14 10:36:48 +04:00
|
|
|
for (m = m0; m; m = m0) {
|
2003-10-14 07:38:49 +04:00
|
|
|
m0 = m->m_nextpkt;
|
|
|
|
m->m_nextpkt = NULL;
|
|
|
|
m_freem(m);
|
|
|
|
}
|
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
2001-06-02 20:17:09 +04:00
|
|
|
/*
|
|
|
|
* Process a delayed payload checksum calculation.
|
|
|
|
*/
|
|
|
|
void
|
|
|
|
in_delayed_cksum(struct mbuf *m)
|
|
|
|
{
|
|
|
|
struct ip *ip;
|
|
|
|
u_int16_t csum, offset;
|
|
|
|
|
|
|
|
ip = mtod(m, struct ip *);
|
|
|
|
offset = ip->ip_hl << 2;
|
|
|
|
csum = in4_cksum(m, 0, offset, ntohs(ip->ip_len) - offset);
|
|
|
|
if (csum == 0 && (m->m_pkthdr.csum_flags & M_CSUM_UDPv4) != 0)
|
|
|
|
csum = 0xffff;
|
|
|
|
|
2005-03-05 05:46:38 +03:00
|
|
|
offset += M_CSUM_DATA_IPv4_OFFSET(m->m_pkthdr.csum_data);
|
2001-06-02 20:17:09 +04:00
|
|
|
|
|
|
|
if ((offset + sizeof(u_int16_t)) > m->m_len) {
|
2001-08-11 16:26:50 +04:00
|
|
|
/* This happen when ip options were inserted
|
2001-06-02 20:17:09 +04:00
|
|
|
printf("in_delayed_cksum: pullup len %d off %d proto %d\n",
|
|
|
|
m->m_len, offset, ip->ip_p);
|
2001-08-11 16:26:50 +04:00
|
|
|
*/
|
2007-03-04 08:59:00 +03:00
|
|
|
m_copyback(m, offset, sizeof(csum), (void *) &csum);
|
2001-06-02 20:17:09 +04:00
|
|
|
} else
|
2007-03-04 08:59:00 +03:00
|
|
|
*(u_int16_t *)(mtod(m, char *) + offset) = csum;
|
2001-06-02 20:17:09 +04:00
|
|
|
}
|
|
|
|
|
1998-03-24 06:10:02 +03:00
|
|
|
/*
|
|
|
|
* Determine the maximum length of the options to be inserted;
|
|
|
|
* we would far rather allocate too much space rather than too little.
|
|
|
|
*/
|
|
|
|
|
|
|
|
u_int
|
2005-02-04 02:13:20 +03:00
|
|
|
ip_optlen(struct inpcb *inp)
|
1998-03-24 06:10:02 +03:00
|
|
|
{
|
|
|
|
struct mbuf *m = inp->inp_options;
|
|
|
|
|
|
|
|
if (m && m->m_len > offsetof(struct ipoption, ipopt_dst))
|
2002-09-11 06:46:42 +04:00
|
|
|
return (m->m_len - offsetof(struct ipoption, ipopt_dst));
|
1998-03-24 06:10:02 +03:00
|
|
|
else
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* Insert IP options into preformed packet.
|
|
|
|
* Adjust IP destination as required for IP source routing,
|
|
|
|
* as indicated by a non-zero in_addr at the start of the options.
|
|
|
|
*/
|
1994-01-09 04:06:02 +03:00
|
|
|
static struct mbuf *
|
2005-02-04 02:13:20 +03:00
|
|
|
ip_insertoptions(struct mbuf *m, struct mbuf *opt, int *phlen)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
2000-03-30 16:51:13 +04:00
|
|
|
struct ipoption *p = mtod(opt, struct ipoption *);
|
1993-03-21 12:45:37 +03:00
|
|
|
struct mbuf *n;
|
2000-03-30 16:51:13 +04:00
|
|
|
struct ip *ip = mtod(m, struct ip *);
|
1993-03-21 12:45:37 +03:00
|
|
|
unsigned optlen;
|
|
|
|
|
|
|
|
optlen = opt->m_len - sizeof(p->ipopt_dst);
|
2002-08-14 04:23:27 +04:00
|
|
|
if (optlen + ntohs(ip->ip_len) > IP_MAXPACKET)
|
1993-03-21 12:45:37 +03:00
|
|
|
return (m); /* XXX should fail */
|
1996-09-09 18:51:07 +04:00
|
|
|
if (!in_nullhost(p->ipopt_dst))
|
1993-03-21 12:45:37 +03:00
|
|
|
ip->ip_dst = p->ipopt_dst;
|
2003-10-04 00:56:11 +04:00
|
|
|
if (M_READONLY(m) || M_LEADINGSPACE(m) < optlen) {
|
1993-03-21 12:45:37 +03:00
|
|
|
MGETHDR(n, M_DONTWAIT, MT_HEADER);
|
|
|
|
if (n == 0)
|
|
|
|
return (m);
|
2003-02-26 09:31:08 +03:00
|
|
|
MCLAIM(n, m->m_owner);
|
2005-08-18 04:30:58 +04:00
|
|
|
M_MOVE_PKTHDR(n, m);
|
1993-03-21 12:45:37 +03:00
|
|
|
m->m_len -= sizeof(struct ip);
|
|
|
|
m->m_data += sizeof(struct ip);
|
|
|
|
n->m_next = m;
|
|
|
|
m = n;
|
|
|
|
m->m_len = optlen + sizeof(struct ip);
|
|
|
|
m->m_data += max_linkhdr;
|
2007-03-04 08:59:00 +03:00
|
|
|
bcopy((void *)ip, mtod(m, void *), sizeof(struct ip));
|
1993-03-21 12:45:37 +03:00
|
|
|
} else {
|
|
|
|
m->m_data -= optlen;
|
|
|
|
m->m_len += optlen;
|
2007-03-04 08:59:00 +03:00
|
|
|
memmove(mtod(m, void *), ip, sizeof(struct ip));
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
2001-08-11 16:26:50 +04:00
|
|
|
m->m_pkthdr.len += optlen;
|
1993-03-21 12:45:37 +03:00
|
|
|
ip = mtod(m, struct ip *);
|
2007-03-04 08:59:00 +03:00
|
|
|
bcopy((void *)p->ipopt_list, (void *)(ip + 1), (unsigned)optlen);
|
1993-03-21 12:45:37 +03:00
|
|
|
*phlen = sizeof(struct ip) + optlen;
|
2002-08-14 04:23:27 +04:00
|
|
|
ip->ip_len = htons(ntohs(ip->ip_len) + optlen);
|
1993-03-21 12:45:37 +03:00
|
|
|
return (m);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Copy options from ip to jp,
|
|
|
|
* omitting those not copied during fragmentation.
|
|
|
|
*/
|
1994-01-09 04:06:02 +03:00
|
|
|
int
|
2005-02-04 02:13:20 +03:00
|
|
|
ip_optcopy(struct ip *ip, struct ip *jp)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
2000-03-30 16:51:13 +04:00
|
|
|
u_char *cp, *dp;
|
1993-03-21 12:45:37 +03:00
|
|
|
int opt, optlen, cnt;
|
|
|
|
|
|
|
|
cp = (u_char *)(ip + 1);
|
|
|
|
dp = (u_char *)(jp + 1);
|
|
|
|
cnt = (ip->ip_hl << 2) - sizeof (struct ip);
|
|
|
|
for (; cnt > 0; cnt -= optlen, cp += optlen) {
|
|
|
|
opt = cp[0];
|
|
|
|
if (opt == IPOPT_EOL)
|
|
|
|
break;
|
1994-05-13 10:02:48 +04:00
|
|
|
if (opt == IPOPT_NOP) {
|
|
|
|
/* Preserve for IP mcast tunnel's LSRR alignment. */
|
|
|
|
*dp++ = IPOPT_NOP;
|
1993-03-21 12:45:37 +03:00
|
|
|
optlen = 1;
|
1994-05-13 10:02:48 +04:00
|
|
|
continue;
|
2000-05-10 07:31:30 +04:00
|
|
|
}
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (cnt < IPOPT_OLEN + sizeof(*cp))
|
|
|
|
panic("malformed IPv4 option passed to ip_optcopy");
|
|
|
|
#endif
|
|
|
|
optlen = cp[IPOPT_OLEN];
|
|
|
|
#ifdef DIAGNOSTIC
|
|
|
|
if (optlen < IPOPT_OLEN + sizeof(*cp) || optlen > cnt)
|
|
|
|
panic("malformed IPv4 option passed to ip_optcopy");
|
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
/* bogus lengths should have been caught by ip_dooptions */
|
|
|
|
if (optlen > cnt)
|
|
|
|
optlen = cnt;
|
|
|
|
if (IPOPT_COPIED(opt)) {
|
2007-03-04 08:59:00 +03:00
|
|
|
bcopy((void *)cp, (void *)dp, (unsigned)optlen);
|
1993-03-21 12:45:37 +03:00
|
|
|
dp += optlen;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
for (optlen = dp - (u_char *)(jp+1); optlen & 0x3; optlen++)
|
|
|
|
*dp++ = IPOPT_EOL;
|
|
|
|
return (optlen);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* IP socket option processing.
|
|
|
|
*/
|
1994-01-09 04:06:02 +03:00
|
|
|
int
|
2008-08-06 19:01:23 +04:00
|
|
|
ip_ctloutput(int op, struct socket *so, struct sockopt *sopt)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
2000-03-30 16:51:13 +04:00
|
|
|
struct inpcb *inp = sotoinpcb(so);
|
|
|
|
int optval = 0;
|
1993-03-21 12:45:37 +03:00
|
|
|
int error = 0;
|
2003-08-15 07:42:00 +04:00
|
|
|
#if defined(IPSEC) || defined(FAST_IPSEC)
|
2006-07-24 02:06:03 +04:00
|
|
|
struct lwp *l = curlwp; /*XXX*/
|
1999-07-01 12:12:45 +04:00
|
|
|
#endif
|
1993-03-21 12:45:37 +03:00
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
if (sopt->sopt_level != IPPROTO_IP) {
|
|
|
|
if (sopt->sopt_level == SOL_SOCKET && sopt->sopt_name == SO_NOHEADER)
|
1) Introduce a new socket option, (SOL_SOCKET, SO_NOHEADER), that
tells a socket that it should both add a protocol header to tx'd
datagrams and remove the header from rx'd datagrams:
int onoff = 1, s = socket(...);
setsockopt(s, SOL_SOCKET, SO_NOHEADER, &onoff);
2) Add an implementation of (SOL_SOCKET, SO_NOHEADER) for raw IPv4
sockets.
3) Reorganize the protocols' pr_ctloutput implementations a bit.
Consistently return ENOPROTOOPT when an option is unsupported,
and EINVAL if a supported option's arguments are incorrect.
Reorganize the flow of code so that it's more clear how/when
options are passed down the stack until they are handled.
Shorten some pr_ctloutput staircases for readability.
4) Extract common mbuf code into subroutines, add new sockaddr
methods, and introduce a new subroutine, fsocreate(), for reuse
later; use it first in sys_socket():
struct mbuf *m_getsombuf(struct socket *so)
Create an mbuf and make its owner the socket `so'.
struct mbuf *m_intopt(struct socket *so, int val)
Create an mbuf, make its owner the socket `so', put the
int `val' into it, and set its length to sizeof(int).
int fsocreate(..., int *fd)
Create a socket, a la socreate(9), put the socket into the
given LWP's descriptor table, return the descriptor at `fd'
on success.
void *sockaddr_addr(struct sockaddr *sa, socklen_t *slenp)
const void *sockaddr_const_addr(const struct sockaddr *sa, socklen_t *slenp)
Extract a pointer to the address part of a sockaddr. Write
the length of the address part at `slenp', if `slenp' is
not NULL.
socklen_t sockaddr_getlen(const struct sockaddr *sa)
Return the length of a sockaddr. This just evaluates to
sa->sa_len. I only add this for consistency with code that
appears in a portable userland library that I am going to
import.
const struct sockaddr *sockaddr_any(const struct sockaddr *sa)
Return the "don't care" sockaddr in the same family as
`sa'. This is the address a client should sobind(9) if it
does not care the source address and, if applicable, the
port et cetera that it uses.
const void *sockaddr_anyaddr(const struct sockaddr *sa, socklen_t *slenp)
Return the "don't care" sockaddr in the same family as
`sa'. This is the address a client should sobind(9) if it
does not care the source address and, if applicable, the
port et cetera that it uses.
2007-09-19 08:33:42 +04:00
|
|
|
return 0;
|
|
|
|
return ENOPROTOOPT;
|
|
|
|
}
|
|
|
|
|
|
|
|
switch (op) {
|
1993-03-21 12:45:37 +03:00
|
|
|
case PRCO_SETOPT:
|
2008-08-06 19:01:23 +04:00
|
|
|
switch (sopt->sopt_name) {
|
1993-03-21 12:45:37 +03:00
|
|
|
case IP_OPTIONS:
|
|
|
|
#ifdef notyet
|
|
|
|
case IP_RETOPTS:
|
|
|
|
#endif
|
2008-10-12 15:15:54 +04:00
|
|
|
error = ip_pcbopts(&inp->inp_options, sopt);
|
2008-08-06 19:01:23 +04:00
|
|
|
break;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
case IP_TOS:
|
|
|
|
case IP_TTL:
|
2009-07-18 02:02:54 +04:00
|
|
|
case IP_MINTTL:
|
1993-03-21 12:45:37 +03:00
|
|
|
case IP_RECVOPTS:
|
|
|
|
case IP_RECVRETOPTS:
|
|
|
|
case IP_RECVDSTADDR:
|
1997-01-11 08:21:07 +03:00
|
|
|
case IP_RECVIF:
|
2009-07-16 08:09:51 +04:00
|
|
|
case IP_RECVTTL:
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_getint(sopt, &optval);
|
|
|
|
if (error)
|
|
|
|
break;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
switch (sopt->sopt_name) {
|
|
|
|
case IP_TOS:
|
|
|
|
inp->inp_ip.ip_tos = optval;
|
|
|
|
break;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
case IP_TTL:
|
|
|
|
inp->inp_ip.ip_ttl = optval;
|
|
|
|
break;
|
2009-07-18 02:02:54 +04:00
|
|
|
|
|
|
|
case IP_MINTTL:
|
|
|
|
if (optval > 0 && optval <= MAXTTL)
|
|
|
|
inp->inp_ip_minttl = optval;
|
|
|
|
else
|
|
|
|
error = EINVAL;
|
|
|
|
break;
|
1993-03-21 12:45:37 +03:00
|
|
|
#define OPTSET(bit) \
|
|
|
|
if (optval) \
|
|
|
|
inp->inp_flags |= bit; \
|
|
|
|
else \
|
|
|
|
inp->inp_flags &= ~bit;
|
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
case IP_RECVOPTS:
|
|
|
|
OPTSET(INP_RECVOPTS);
|
|
|
|
break;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
case IP_RECVRETOPTS:
|
|
|
|
OPTSET(INP_RECVRETOPTS);
|
|
|
|
break;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
case IP_RECVDSTADDR:
|
|
|
|
OPTSET(INP_RECVDSTADDR);
|
|
|
|
break;
|
1997-01-11 08:21:07 +03:00
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
case IP_RECVIF:
|
|
|
|
OPTSET(INP_RECVIF);
|
|
|
|
break;
|
2009-07-16 08:09:51 +04:00
|
|
|
|
|
|
|
case IP_RECVTTL:
|
|
|
|
OPTSET(INP_RECVTTL);
|
|
|
|
break;
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
2008-08-06 19:01:23 +04:00
|
|
|
break;
|
1993-03-21 12:45:37 +03:00
|
|
|
#undef OPTSET
|
1994-05-13 10:02:48 +04:00
|
|
|
|
|
|
|
case IP_MULTICAST_IF:
|
|
|
|
case IP_MULTICAST_TTL:
|
|
|
|
case IP_MULTICAST_LOOP:
|
|
|
|
case IP_ADD_MEMBERSHIP:
|
|
|
|
case IP_DROP_MEMBERSHIP:
|
2008-08-06 19:01:23 +04:00
|
|
|
error = ip_setmoptions(&inp->inp_moptions, sopt);
|
1994-05-13 10:02:48 +04:00
|
|
|
break;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1998-01-08 01:51:22 +03:00
|
|
|
case IP_PORTRANGE:
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_getint(sopt, &optval);
|
|
|
|
if (error)
|
|
|
|
break;
|
1998-01-08 01:51:22 +03:00
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
/* INP_LOCK(inp); */
|
|
|
|
switch (optval) {
|
|
|
|
case IP_PORTRANGE_DEFAULT:
|
|
|
|
case IP_PORTRANGE_HIGH:
|
|
|
|
inp->inp_flags &= ~(INP_LOWPORT);
|
|
|
|
break;
|
1998-01-08 01:51:22 +03:00
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
case IP_PORTRANGE_LOW:
|
|
|
|
inp->inp_flags |= INP_LOWPORT;
|
|
|
|
break;
|
1998-01-08 01:51:22 +03:00
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
default:
|
|
|
|
error = EINVAL;
|
|
|
|
break;
|
1998-01-08 01:51:22 +03:00
|
|
|
}
|
2008-08-06 19:01:23 +04:00
|
|
|
/* INP_UNLOCK(inp); */
|
1998-01-08 01:51:22 +03:00
|
|
|
break;
|
|
|
|
|
2003-08-15 07:42:00 +04:00
|
|
|
#if defined(IPSEC) || defined(FAST_IPSEC)
|
1999-07-01 12:12:45 +04:00
|
|
|
case IP_IPSEC_POLICY:
|
2008-08-06 19:01:23 +04:00
|
|
|
{
|
|
|
|
error = ipsec4_set_policy(inp, sopt->sopt_name,
|
2009-05-07 01:41:59 +04:00
|
|
|
sopt->sopt_data, sopt->sopt_size, l->l_cred);
|
1999-07-01 12:12:45 +04:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
#endif /*IPSEC*/
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
default:
|
1994-05-13 10:02:48 +04:00
|
|
|
error = ENOPROTOOPT;
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
|
|
|
|
case PRCO_GETOPT:
|
2008-08-06 19:01:23 +04:00
|
|
|
switch (sopt->sopt_name) {
|
1993-03-21 12:45:37 +03:00
|
|
|
case IP_OPTIONS:
|
|
|
|
case IP_RETOPTS:
|
|
|
|
if (inp->inp_options) {
|
2008-08-06 19:01:23 +04:00
|
|
|
struct mbuf *m;
|
|
|
|
|
2008-10-12 14:23:18 +04:00
|
|
|
m = m_copym(inp->inp_options, 0, M_COPYALL,
|
|
|
|
M_DONTWAIT);
|
|
|
|
if (m == NULL) {
|
|
|
|
error = ENOBUFS;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_setmbuf(sopt, m);
|
|
|
|
}
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
case IP_TOS:
|
|
|
|
case IP_TTL:
|
2009-07-18 02:02:54 +04:00
|
|
|
case IP_MINTTL:
|
1993-03-21 12:45:37 +03:00
|
|
|
case IP_RECVOPTS:
|
|
|
|
case IP_RECVRETOPTS:
|
|
|
|
case IP_RECVDSTADDR:
|
1997-01-11 08:21:07 +03:00
|
|
|
case IP_RECVIF:
|
2009-07-16 08:09:51 +04:00
|
|
|
case IP_RECVTTL:
|
1997-10-14 04:52:39 +04:00
|
|
|
case IP_ERRORMTU:
|
2008-08-06 19:01:23 +04:00
|
|
|
switch (sopt->sopt_name) {
|
1993-03-21 12:45:37 +03:00
|
|
|
case IP_TOS:
|
|
|
|
optval = inp->inp_ip.ip_tos;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case IP_TTL:
|
|
|
|
optval = inp->inp_ip.ip_ttl;
|
|
|
|
break;
|
|
|
|
|
2009-07-18 02:02:54 +04:00
|
|
|
case IP_MINTTL:
|
|
|
|
optval = inp->inp_ip_minttl;
|
|
|
|
break;
|
|
|
|
|
1997-10-14 04:52:39 +04:00
|
|
|
case IP_ERRORMTU:
|
|
|
|
optval = inp->inp_errormtu;
|
|
|
|
break;
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
#define OPTBIT(bit) (inp->inp_flags & bit ? 1 : 0)
|
|
|
|
|
|
|
|
case IP_RECVOPTS:
|
|
|
|
optval = OPTBIT(INP_RECVOPTS);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case IP_RECVRETOPTS:
|
|
|
|
optval = OPTBIT(INP_RECVRETOPTS);
|
|
|
|
break;
|
|
|
|
|
|
|
|
case IP_RECVDSTADDR:
|
|
|
|
optval = OPTBIT(INP_RECVDSTADDR);
|
|
|
|
break;
|
1997-01-11 08:21:07 +03:00
|
|
|
|
|
|
|
case IP_RECVIF:
|
|
|
|
optval = OPTBIT(INP_RECVIF);
|
|
|
|
break;
|
2009-07-16 08:09:51 +04:00
|
|
|
|
|
|
|
case IP_RECVTTL:
|
|
|
|
optval = OPTBIT(INP_RECVTTL);
|
|
|
|
break;
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_setint(sopt, optval);
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
1994-05-13 10:02:48 +04:00
|
|
|
|
2004-07-06 08:30:27 +04:00
|
|
|
#if 0 /* defined(IPSEC) || defined(FAST_IPSEC) */
|
1999-07-01 12:12:45 +04:00
|
|
|
case IP_IPSEC_POLICY:
|
2000-01-31 17:18:52 +03:00
|
|
|
{
|
2008-08-06 19:01:23 +04:00
|
|
|
struct mbuf *m = NULL;
|
2000-01-31 17:18:52 +03:00
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
/* XXX this will return EINVAL as sopt is empty */
|
|
|
|
error = ipsec4_get_policy(inp, sopt->sopt_data,
|
|
|
|
sopt->sopt_size, &m);
|
|
|
|
if (error == 0)
|
|
|
|
error = sockopt_setmbuf(sopt, m);
|
1999-07-01 12:12:45 +04:00
|
|
|
break;
|
2000-01-31 17:18:52 +03:00
|
|
|
}
|
1999-07-01 12:12:45 +04:00
|
|
|
#endif /*IPSEC*/
|
|
|
|
|
1994-05-13 10:02:48 +04:00
|
|
|
case IP_MULTICAST_IF:
|
|
|
|
case IP_MULTICAST_TTL:
|
|
|
|
case IP_MULTICAST_LOOP:
|
|
|
|
case IP_ADD_MEMBERSHIP:
|
|
|
|
case IP_DROP_MEMBERSHIP:
|
2008-08-06 19:01:23 +04:00
|
|
|
error = ip_getmoptions(inp->inp_moptions, sopt);
|
1994-05-13 10:02:48 +04:00
|
|
|
break;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
1998-01-08 01:51:22 +03:00
|
|
|
case IP_PORTRANGE:
|
|
|
|
if (inp->inp_flags & INP_LOWPORT)
|
|
|
|
optval = IP_PORTRANGE_LOW;
|
|
|
|
else
|
|
|
|
optval = IP_PORTRANGE_DEFAULT;
|
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_setint(sopt, optval);
|
|
|
|
|
1998-01-08 01:51:22 +03:00
|
|
|
break;
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
default:
|
1994-05-13 10:02:48 +04:00
|
|
|
error = ENOPROTOOPT;
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Set up IP options in pcb for insertion in output packets.
|
|
|
|
* Store in mbuf with pointer in pcbopt, adding pseudo-option
|
|
|
|
* with destination address if source routed.
|
|
|
|
*/
|
1994-01-09 04:06:02 +03:00
|
|
|
int
|
2008-10-12 15:15:54 +04:00
|
|
|
ip_pcbopts(struct mbuf **pcbopt, const struct sockopt *sopt)
|
1993-03-21 12:45:37 +03:00
|
|
|
{
|
2008-10-12 15:15:54 +04:00
|
|
|
struct mbuf *m;
|
|
|
|
const u_char *cp;
|
|
|
|
u_char *dp;
|
|
|
|
int cnt;
|
|
|
|
uint8_t optval, olen, offset;
|
1993-03-21 12:45:37 +03:00
|
|
|
|
|
|
|
/* turn off any old options */
|
|
|
|
if (*pcbopt)
|
|
|
|
(void)m_free(*pcbopt);
|
2008-10-12 15:15:54 +04:00
|
|
|
*pcbopt = NULL;
|
|
|
|
|
|
|
|
cp = sopt->sopt_data;
|
|
|
|
cnt = sopt->sopt_size;
|
|
|
|
|
|
|
|
if (cnt == 0)
|
|
|
|
return (0); /* Only turning off any previous options */
|
1993-03-21 12:45:37 +03:00
|
|
|
|
2001-05-27 01:27:09 +04:00
|
|
|
#ifndef __vax__
|
2008-10-12 15:15:54 +04:00
|
|
|
if (cnt % sizeof(int32_t))
|
|
|
|
return (EINVAL);
|
1993-03-21 12:45:37 +03:00
|
|
|
#endif
|
2008-10-12 15:15:54 +04:00
|
|
|
|
|
|
|
m = m_get(M_DONTWAIT, MT_SOOPTS);
|
|
|
|
if (m == NULL)
|
|
|
|
return (ENOBUFS);
|
|
|
|
|
|
|
|
dp = mtod(m, u_char *);
|
|
|
|
memset(dp, 0, sizeof(struct in_addr));
|
|
|
|
dp += sizeof(struct in_addr);
|
|
|
|
m->m_len = sizeof(struct in_addr);
|
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
2008-10-12 15:15:54 +04:00
|
|
|
* IP option list according to RFC791. Each option is of the form
|
|
|
|
*
|
|
|
|
* [optval] [olen] [(olen - 2) data bytes]
|
|
|
|
*
|
|
|
|
* we validate the list and copy options to an mbuf for prepending
|
|
|
|
* to data packets. The IP first-hop destination address will be
|
|
|
|
* stored before actual options and is zero if unset.
|
1993-03-21 12:45:37 +03:00
|
|
|
*/
|
2008-10-12 15:15:54 +04:00
|
|
|
while (cnt > 0) {
|
|
|
|
optval = cp[IPOPT_OPTVAL];
|
1993-03-21 12:45:37 +03:00
|
|
|
|
2008-10-12 15:15:54 +04:00
|
|
|
if (optval == IPOPT_EOL || optval == IPOPT_NOP) {
|
|
|
|
olen = 1;
|
|
|
|
} else {
|
|
|
|
if (cnt < IPOPT_OLEN + 1)
|
2000-05-10 07:31:30 +04:00
|
|
|
goto bad;
|
2008-10-12 15:15:54 +04:00
|
|
|
|
|
|
|
olen = cp[IPOPT_OLEN];
|
|
|
|
if (olen < IPOPT_OLEN + 1 || olen > cnt)
|
1993-03-21 12:45:37 +03:00
|
|
|
goto bad;
|
|
|
|
}
|
|
|
|
|
2008-10-12 15:15:54 +04:00
|
|
|
if (optval == IPOPT_LSRR || optval == IPOPT_SSRR) {
|
1993-03-21 12:45:37 +03:00
|
|
|
/*
|
|
|
|
* user process specifies route as:
|
|
|
|
* ->A->B->C->D
|
|
|
|
* D must be our final destination (but we can't
|
|
|
|
* check that since we may not have connected yet).
|
|
|
|
* A is first hop destination, which doesn't appear in
|
|
|
|
* actual IP option, but is stored before the options.
|
|
|
|
*/
|
2008-10-12 15:15:54 +04:00
|
|
|
if (olen < IPOPT_OFFSET + 1 + sizeof(struct in_addr))
|
1993-03-21 12:45:37 +03:00
|
|
|
goto bad;
|
2008-10-12 15:15:54 +04:00
|
|
|
|
|
|
|
offset = cp[IPOPT_OFFSET];
|
|
|
|
memcpy(mtod(m, u_char *), cp + IPOPT_OFFSET + 1,
|
1993-03-21 12:45:37 +03:00
|
|
|
sizeof(struct in_addr));
|
2008-10-12 15:15:54 +04:00
|
|
|
|
|
|
|
cp += sizeof(struct in_addr);
|
|
|
|
cnt -= sizeof(struct in_addr);
|
|
|
|
olen -= sizeof(struct in_addr);
|
|
|
|
|
|
|
|
if (m->m_len + olen > MAX_IPOPTLEN + sizeof(struct in_addr))
|
|
|
|
goto bad;
|
|
|
|
|
|
|
|
memcpy(dp, cp, olen);
|
|
|
|
dp[IPOPT_OPTVAL] = optval;
|
|
|
|
dp[IPOPT_OLEN] = olen;
|
|
|
|
dp[IPOPT_OFFSET] = offset;
|
|
|
|
break;
|
|
|
|
} else {
|
|
|
|
if (m->m_len + olen > MAX_IPOPTLEN + sizeof(struct in_addr))
|
|
|
|
goto bad;
|
|
|
|
|
|
|
|
memcpy(dp, cp, olen);
|
1993-03-21 12:45:37 +03:00
|
|
|
break;
|
|
|
|
}
|
2008-10-12 15:15:54 +04:00
|
|
|
|
|
|
|
dp += olen;
|
|
|
|
m->m_len += olen;
|
|
|
|
|
|
|
|
if (optval == IPOPT_EOL)
|
|
|
|
break;
|
|
|
|
|
|
|
|
cp += olen;
|
|
|
|
cnt -= olen;
|
1993-03-21 12:45:37 +03:00
|
|
|
}
|
2008-10-12 15:15:54 +04:00
|
|
|
|
1993-03-21 12:45:37 +03:00
|
|
|
*pcbopt = m;
|
|
|
|
return (0);
|
|
|
|
|
|
|
|
bad:
|
|
|
|
(void)m_free(m);
|
|
|
|
return (EINVAL);
|
|
|
|
}
|
1993-12-06 07:50:19 +03:00
|
|
|
|
2001-01-13 10:19:33 +03:00
|
|
|
/*
|
|
|
|
* following RFC1724 section 3.3, 0.0.0.0/8 is interpreted as interface index.
|
|
|
|
*/
|
|
|
|
static struct ifnet *
|
2005-02-04 02:13:20 +03:00
|
|
|
ip_multicast_if(struct in_addr *a, int *ifindexp)
|
2001-01-13 10:19:33 +03:00
|
|
|
{
|
|
|
|
int ifindex;
|
2003-08-19 04:17:38 +04:00
|
|
|
struct ifnet *ifp = NULL;
|
2003-08-19 02:23:22 +04:00
|
|
|
struct in_ifaddr *ia;
|
2001-01-13 10:19:33 +03:00
|
|
|
|
|
|
|
if (ifindexp)
|
|
|
|
*ifindexp = 0;
|
|
|
|
if (ntohl(a->s_addr) >> 24 == 0) {
|
|
|
|
ifindex = ntohl(a->s_addr) & 0xffffff;
|
2003-12-10 14:46:33 +03:00
|
|
|
if (ifindex < 0 || if_indexlim <= ifindex)
|
2001-01-13 10:19:33 +03:00
|
|
|
return NULL;
|
|
|
|
ifp = ifindex2ifnet[ifindex];
|
2003-12-10 14:46:33 +03:00
|
|
|
if (!ifp)
|
|
|
|
return NULL;
|
2001-01-13 10:19:33 +03:00
|
|
|
if (ifindexp)
|
|
|
|
*ifindexp = ifindex;
|
|
|
|
} else {
|
2003-08-19 02:23:22 +04:00
|
|
|
LIST_FOREACH(ia, &IN_IFADDR_HASH(a->s_addr), ia_hash) {
|
|
|
|
if (in_hosteq(ia->ia_addr.sin_addr, *a) &&
|
2003-08-19 04:17:38 +04:00
|
|
|
(ia->ia_ifp->if_flags & IFF_MULTICAST) != 0) {
|
|
|
|
ifp = ia->ia_ifp;
|
2003-08-19 02:23:22 +04:00
|
|
|
break;
|
2003-08-19 04:17:38 +04:00
|
|
|
}
|
2003-08-19 02:23:22 +04:00
|
|
|
}
|
2001-01-13 10:19:33 +03:00
|
|
|
}
|
|
|
|
return ifp;
|
|
|
|
}
|
|
|
|
|
2005-09-12 01:57:24 +04:00
|
|
|
static int
|
2008-08-17 01:51:43 +04:00
|
|
|
ip_getoptval(const struct sockopt *sopt, u_int8_t *val, u_int maxval)
|
2005-09-12 01:57:24 +04:00
|
|
|
{
|
|
|
|
u_int tval;
|
2008-08-06 19:01:23 +04:00
|
|
|
u_char cval;
|
|
|
|
int error;
|
2005-09-12 01:57:24 +04:00
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
if (sopt == NULL)
|
2005-09-12 01:57:24 +04:00
|
|
|
return EINVAL;
|
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
switch (sopt->sopt_size) {
|
2005-09-12 01:57:24 +04:00
|
|
|
case sizeof(u_char):
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_get(sopt, &cval, sizeof(u_char));
|
|
|
|
tval = cval;
|
2005-09-12 01:57:24 +04:00
|
|
|
break;
|
2008-08-06 19:01:23 +04:00
|
|
|
|
2005-09-12 01:57:24 +04:00
|
|
|
case sizeof(u_int):
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_get(sopt, &tval, sizeof(u_int));
|
2005-09-12 01:57:24 +04:00
|
|
|
break;
|
2008-08-06 19:01:23 +04:00
|
|
|
|
2005-09-12 01:57:24 +04:00
|
|
|
default:
|
2008-08-06 19:01:23 +04:00
|
|
|
error = EINVAL;
|
2005-09-12 01:57:24 +04:00
|
|
|
}
|
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
if (error)
|
|
|
|
return error;
|
|
|
|
|
2005-09-12 01:57:24 +04:00
|
|
|
if (tval > maxval)
|
|
|
|
return EINVAL;
|
|
|
|
|
|
|
|
*val = tval;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
1993-12-06 07:50:19 +03:00
|
|
|
/*
|
|
|
|
* Set the IP multicast options in response to user setsockopt().
|
|
|
|
*/
|
|
|
|
int
|
2008-08-17 01:51:43 +04:00
|
|
|
ip_setmoptions(struct ip_moptions **imop, const struct sockopt *sopt)
|
1993-12-06 07:50:19 +03:00
|
|
|
{
|
2000-03-30 16:51:13 +04:00
|
|
|
int error = 0;
|
|
|
|
int i;
|
1993-12-06 07:50:19 +03:00
|
|
|
struct in_addr addr;
|
2008-08-06 19:01:23 +04:00
|
|
|
struct ip_mreq lmreq, *mreq;
|
2000-03-30 16:51:13 +04:00
|
|
|
struct ifnet *ifp;
|
|
|
|
struct ip_moptions *imo = *imop;
|
2001-01-13 10:19:33 +03:00
|
|
|
int ifindex;
|
1993-12-06 07:50:19 +03:00
|
|
|
|
|
|
|
if (imo == NULL) {
|
|
|
|
/*
|
|
|
|
* No multicast option buffer attached to the pcb;
|
|
|
|
* allocate one and initialize to default values.
|
|
|
|
*/
|
2008-10-12 14:23:18 +04:00
|
|
|
imo = malloc(sizeof(*imo), M_IPMOPTS, M_NOWAIT);
|
1993-12-06 07:50:19 +03:00
|
|
|
if (imo == NULL)
|
|
|
|
return (ENOBUFS);
|
2008-10-12 14:23:18 +04:00
|
|
|
|
1993-12-06 07:50:19 +03:00
|
|
|
*imop = imo;
|
|
|
|
imo->imo_multicast_ifp = NULL;
|
2001-01-13 10:19:33 +03:00
|
|
|
imo->imo_multicast_addr.s_addr = INADDR_ANY;
|
1993-12-06 07:50:19 +03:00
|
|
|
imo->imo_multicast_ttl = IP_DEFAULT_MULTICAST_TTL;
|
|
|
|
imo->imo_multicast_loop = IP_DEFAULT_MULTICAST_LOOP;
|
|
|
|
imo->imo_num_memberships = 0;
|
|
|
|
}
|
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
switch (sopt->sopt_name) {
|
1993-12-06 07:50:19 +03:00
|
|
|
case IP_MULTICAST_IF:
|
|
|
|
/*
|
|
|
|
* Select the interface for outgoing multicast packets.
|
|
|
|
*/
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_get(sopt, &addr, sizeof(addr));
|
|
|
|
if (error)
|
1993-12-06 07:50:19 +03:00
|
|
|
break;
|
2008-08-06 19:01:23 +04:00
|
|
|
|
1993-12-06 07:50:19 +03:00
|
|
|
/*
|
|
|
|
* INADDR_ANY is used to remove a previous selection.
|
1994-01-09 00:21:28 +03:00
|
|
|
* When no interface is selected, a default one is
|
1993-12-06 07:50:19 +03:00
|
|
|
* chosen every time a multicast packet is sent.
|
|
|
|
*/
|
1996-09-09 18:51:07 +04:00
|
|
|
if (in_nullhost(addr)) {
|
1993-12-06 07:50:19 +03:00
|
|
|
imo->imo_multicast_ifp = NULL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* The selected interface is identified by its local
|
|
|
|
* IP address. Find the interface and confirm that
|
1994-01-09 00:21:28 +03:00
|
|
|
* it supports multicasting.
|
1993-12-06 07:50:19 +03:00
|
|
|
*/
|
2001-01-13 10:19:33 +03:00
|
|
|
ifp = ip_multicast_if(&addr, &ifindex);
|
1993-12-06 07:50:19 +03:00
|
|
|
if (ifp == NULL || (ifp->if_flags & IFF_MULTICAST) == 0) {
|
|
|
|
error = EADDRNOTAVAIL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
imo->imo_multicast_ifp = ifp;
|
2001-01-13 10:19:33 +03:00
|
|
|
if (ifindex)
|
|
|
|
imo->imo_multicast_addr = addr;
|
|
|
|
else
|
|
|
|
imo->imo_multicast_addr.s_addr = INADDR_ANY;
|
1993-12-06 07:50:19 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
case IP_MULTICAST_TTL:
|
|
|
|
/*
|
|
|
|
* Set the IP time-to-live for outgoing multicast packets.
|
|
|
|
*/
|
2008-08-06 19:01:23 +04:00
|
|
|
error = ip_getoptval(sopt, &imo->imo_multicast_ttl, MAXTTL);
|
1993-12-06 07:50:19 +03:00
|
|
|
break;
|
1994-01-09 00:21:28 +03:00
|
|
|
|
1993-12-06 07:50:19 +03:00
|
|
|
case IP_MULTICAST_LOOP:
|
|
|
|
/*
|
|
|
|
* Set the loopback flag for outgoing multicast packets.
|
|
|
|
* Must be zero or one.
|
|
|
|
*/
|
2008-08-06 19:01:23 +04:00
|
|
|
error = ip_getoptval(sopt, &imo->imo_multicast_loop, 1);
|
1993-12-06 07:50:19 +03:00
|
|
|
break;
|
|
|
|
|
|
|
|
case IP_ADD_MEMBERSHIP:
|
|
|
|
/*
|
|
|
|
* Add a multicast group membership.
|
|
|
|
* Group must be a valid IP multicast address.
|
|
|
|
*/
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_get(sopt, &lmreq, sizeof(lmreq));
|
|
|
|
if (error)
|
1993-12-06 07:50:19 +03:00
|
|
|
break;
|
2008-08-06 19:01:23 +04:00
|
|
|
|
|
|
|
mreq = &lmreq;
|
|
|
|
|
1995-06-02 01:35:34 +04:00
|
|
|
if (!IN_MULTICAST(mreq->imr_multiaddr.s_addr)) {
|
1993-12-06 07:50:19 +03:00
|
|
|
error = EINVAL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* If no interface address was provided, use the interface of
|
|
|
|
* the route to the given multicast address.
|
|
|
|
*/
|
1996-09-09 18:51:07 +04:00
|
|
|
if (in_nullhost(mreq->imr_interface)) {
|
2007-12-20 22:53:29 +03:00
|
|
|
struct rtentry *rt;
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
union {
|
|
|
|
struct sockaddr dst;
|
|
|
|
struct sockaddr_in dst4;
|
|
|
|
} u;
|
|
|
|
struct route ro;
|
|
|
|
|
2007-01-29 09:00:11 +03:00
|
|
|
memset(&ro, 0, sizeof(ro));
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
|
|
|
|
sockaddr_in_init(&u.dst4, &mreq->imr_multiaddr, 0);
|
|
|
|
rtcache_setdst(&ro, &u.dst);
|
2008-01-12 05:58:58 +03:00
|
|
|
ifp = (rt = rtcache_init(&ro)) != NULL ? rt->rt_ifp
|
2007-12-20 22:53:29 +03:00
|
|
|
: NULL;
|
2006-12-16 00:18:52 +03:00
|
|
|
rtcache_free(&ro);
|
1995-06-02 01:35:34 +04:00
|
|
|
} else {
|
2001-01-13 10:19:33 +03:00
|
|
|
ifp = ip_multicast_if(&mreq->imr_interface, NULL);
|
1993-12-06 07:50:19 +03:00
|
|
|
}
|
|
|
|
/*
|
|
|
|
* See if we found an interface, and confirm that it
|
|
|
|
* supports multicast.
|
|
|
|
*/
|
1994-01-09 00:21:28 +03:00
|
|
|
if (ifp == NULL || (ifp->if_flags & IFF_MULTICAST) == 0) {
|
1993-12-06 07:50:19 +03:00
|
|
|
error = EADDRNOTAVAIL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* See if the membership already exists or if all the
|
|
|
|
* membership slots are full.
|
1994-01-09 00:21:28 +03:00
|
|
|
*/
|
1993-12-06 07:50:19 +03:00
|
|
|
for (i = 0; i < imo->imo_num_memberships; ++i) {
|
|
|
|
if (imo->imo_membership[i]->inm_ifp == ifp &&
|
1996-09-09 18:51:07 +04:00
|
|
|
in_hosteq(imo->imo_membership[i]->inm_addr,
|
|
|
|
mreq->imr_multiaddr))
|
1993-12-06 07:50:19 +03:00
|
|
|
break;
|
1994-01-09 00:21:28 +03:00
|
|
|
}
|
1993-12-06 07:50:19 +03:00
|
|
|
if (i < imo->imo_num_memberships) {
|
|
|
|
error = EADDRINUSE;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (i == IP_MAX_MEMBERSHIPS) {
|
1994-01-09 00:21:28 +03:00
|
|
|
error = ETOOMANYREFS;
|
1993-12-06 07:50:19 +03:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Everything looks good; add a new record to the multicast
|
|
|
|
* address list for the given interface.
|
|
|
|
*/
|
|
|
|
if ((imo->imo_membership[i] =
|
|
|
|
in_addmulti(&mreq->imr_multiaddr, ifp)) == NULL) {
|
|
|
|
error = ENOBUFS;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
++imo->imo_num_memberships;
|
|
|
|
break;
|
|
|
|
|
|
|
|
case IP_DROP_MEMBERSHIP:
|
|
|
|
/*
|
|
|
|
* Drop a multicast group membership.
|
|
|
|
* Group must be a valid IP multicast address.
|
|
|
|
*/
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_get(sopt, &lmreq, sizeof(lmreq));
|
|
|
|
if (error)
|
1993-12-06 07:50:19 +03:00
|
|
|
break;
|
2008-08-06 19:01:23 +04:00
|
|
|
|
|
|
|
mreq = &lmreq;
|
|
|
|
|
1995-06-02 01:35:34 +04:00
|
|
|
if (!IN_MULTICAST(mreq->imr_multiaddr.s_addr)) {
|
1993-12-06 07:50:19 +03:00
|
|
|
error = EINVAL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* If an interface address was specified, get a pointer
|
|
|
|
* to its ifnet structure.
|
|
|
|
*/
|
1996-09-09 18:51:07 +04:00
|
|
|
if (in_nullhost(mreq->imr_interface))
|
1993-12-06 07:50:19 +03:00
|
|
|
ifp = NULL;
|
|
|
|
else {
|
2001-01-13 10:19:33 +03:00
|
|
|
ifp = ip_multicast_if(&mreq->imr_interface, NULL);
|
1993-12-06 07:50:19 +03:00
|
|
|
if (ifp == NULL) {
|
|
|
|
error = EADDRNOTAVAIL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Find the membership in the membership array.
|
|
|
|
*/
|
|
|
|
for (i = 0; i < imo->imo_num_memberships; ++i) {
|
|
|
|
if ((ifp == NULL ||
|
|
|
|
imo->imo_membership[i]->inm_ifp == ifp) &&
|
1996-09-09 18:51:07 +04:00
|
|
|
in_hosteq(imo->imo_membership[i]->inm_addr,
|
|
|
|
mreq->imr_multiaddr))
|
1993-12-06 07:50:19 +03:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
if (i == imo->imo_num_memberships) {
|
|
|
|
error = EADDRNOTAVAIL;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Give up the multicast address record to which the
|
|
|
|
* membership points.
|
|
|
|
*/
|
1994-01-09 00:21:28 +03:00
|
|
|
in_delmulti(imo->imo_membership[i]);
|
1993-12-06 07:50:19 +03:00
|
|
|
/*
|
|
|
|
* Remove the gap in the membership array.
|
|
|
|
*/
|
|
|
|
for (++i; i < imo->imo_num_memberships; ++i)
|
|
|
|
imo->imo_membership[i-1] = imo->imo_membership[i];
|
|
|
|
--imo->imo_num_memberships;
|
|
|
|
break;
|
|
|
|
|
|
|
|
default:
|
|
|
|
error = EOPNOTSUPP;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* If all options have default values, no need to keep the mbuf.
|
|
|
|
*/
|
|
|
|
if (imo->imo_multicast_ifp == NULL &&
|
|
|
|
imo->imo_multicast_ttl == IP_DEFAULT_MULTICAST_TTL &&
|
|
|
|
imo->imo_multicast_loop == IP_DEFAULT_MULTICAST_LOOP &&
|
|
|
|
imo->imo_num_memberships == 0) {
|
|
|
|
free(*imop, M_IPMOPTS);
|
|
|
|
*imop = NULL;
|
|
|
|
}
|
|
|
|
|
|
|
|
return (error);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Return the IP multicast options in response to user getsockopt().
|
|
|
|
*/
|
|
|
|
int
|
2008-08-06 19:01:23 +04:00
|
|
|
ip_getmoptions(struct ip_moptions *imo, struct sockopt *sopt)
|
1993-12-06 07:50:19 +03:00
|
|
|
{
|
2008-08-06 19:01:23 +04:00
|
|
|
struct in_addr addr;
|
1993-12-06 07:50:19 +03:00
|
|
|
struct in_ifaddr *ia;
|
2008-08-06 19:01:23 +04:00
|
|
|
int error;
|
|
|
|
uint8_t optval;
|
1993-12-06 07:50:19 +03:00
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
error = 0;
|
1993-12-06 07:50:19 +03:00
|
|
|
|
2008-08-06 19:01:23 +04:00
|
|
|
switch (sopt->sopt_name) {
|
1993-12-06 07:50:19 +03:00
|
|
|
case IP_MULTICAST_IF:
|
|
|
|
if (imo == NULL || imo->imo_multicast_ifp == NULL)
|
2008-08-06 19:01:23 +04:00
|
|
|
addr = zeroin_addr;
|
2001-01-13 10:19:33 +03:00
|
|
|
else if (imo->imo_multicast_addr.s_addr) {
|
|
|
|
/* return the value user has set */
|
2008-08-06 19:01:23 +04:00
|
|
|
addr = imo->imo_multicast_addr;
|
2001-01-13 10:19:33 +03:00
|
|
|
} else {
|
1993-12-06 07:50:19 +03:00
|
|
|
IFP_TO_IA(imo->imo_multicast_ifp, ia);
|
2008-08-06 19:01:23 +04:00
|
|
|
addr = ia ? ia->ia_addr.sin_addr : zeroin_addr;
|
1993-12-06 07:50:19 +03:00
|
|
|
}
|
2008-08-06 19:01:23 +04:00
|
|
|
error = sockopt_set(sopt, &addr, sizeof(addr));
|
|
|
|
break;
|
1993-12-06 07:50:19 +03:00
|
|
|
|
|
|
|
case IP_MULTICAST_TTL:
|
2008-08-06 19:01:23 +04:00
|
|
|
optval = imo ? imo->imo_multicast_ttl
|
|
|
|
: IP_DEFAULT_MULTICAST_TTL;
|
|
|
|
|
|
|
|
error = sockopt_set(sopt, &optval, sizeof(optval));
|
|
|
|
break;
|
1993-12-06 07:50:19 +03:00
|
|
|
|
|
|
|
case IP_MULTICAST_LOOP:
|
2008-08-06 19:01:23 +04:00
|
|
|
optval = imo ? imo->imo_multicast_loop
|
|
|
|
: IP_DEFAULT_MULTICAST_LOOP;
|
|
|
|
|
|
|
|
error = sockopt_set(sopt, &optval, sizeof(optval));
|
|
|
|
break;
|
1993-12-06 07:50:19 +03:00
|
|
|
|
|
|
|
default:
|
2008-08-06 19:01:23 +04:00
|
|
|
error = EOPNOTSUPP;
|
1993-12-06 07:50:19 +03:00
|
|
|
}
|
2008-08-06 19:01:23 +04:00
|
|
|
|
|
|
|
return (error);
|
1993-12-06 07:50:19 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Discard the IP multicast options.
|
|
|
|
*/
|
|
|
|
void
|
2005-02-04 02:13:20 +03:00
|
|
|
ip_freemoptions(struct ip_moptions *imo)
|
1993-12-06 07:50:19 +03:00
|
|
|
{
|
2000-03-30 16:51:13 +04:00
|
|
|
int i;
|
1993-12-06 07:50:19 +03:00
|
|
|
|
|
|
|
if (imo != NULL) {
|
|
|
|
for (i = 0; i < imo->imo_num_memberships; ++i)
|
|
|
|
in_delmulti(imo->imo_membership[i]);
|
|
|
|
free(imo, M_IPMOPTS);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Routine called from ip_output() to loop back a copy of an IP multicast
|
|
|
|
* packet to the input queue of a specified interface. Note that this
|
|
|
|
* calls the output routine of the loopback "driver", but with an interface
|
2004-12-04 19:10:25 +03:00
|
|
|
* pointer that might NOT be lo0ifp -- easier than replicating that code here.
|
1993-12-06 07:50:19 +03:00
|
|
|
*/
|
1994-01-09 04:06:02 +03:00
|
|
|
static void
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
ip_mloopback(struct ifnet *ifp, struct mbuf *m, const struct sockaddr_in *dst)
|
1993-12-06 07:50:19 +03:00
|
|
|
{
|
2000-03-30 16:51:13 +04:00
|
|
|
struct ip *ip;
|
1993-12-06 07:50:19 +03:00
|
|
|
struct mbuf *copym;
|
|
|
|
|
2007-09-02 11:18:55 +04:00
|
|
|
copym = m_copypacket(m, M_DONTWAIT);
|
2000-03-22 09:10:39 +03:00
|
|
|
if (copym != NULL
|
1999-12-20 08:46:33 +03:00
|
|
|
&& (copym->m_flags & M_EXT || copym->m_len < sizeof(struct ip)))
|
|
|
|
copym = m_pullup(copym, sizeof(struct ip));
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
if (copym == NULL)
|
|
|
|
return;
|
|
|
|
/*
|
|
|
|
* We don't bother to fragment if the IP length is greater
|
|
|
|
* than the interface's MTU. Can this possibly matter?
|
|
|
|
*/
|
|
|
|
ip = mtod(copym, struct ip *);
|
2002-01-31 10:45:22 +03:00
|
|
|
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
if (copym->m_pkthdr.csum_flags & (M_CSUM_TCPv4|M_CSUM_UDPv4)) {
|
|
|
|
in_delayed_cksum(copym);
|
|
|
|
copym->m_pkthdr.csum_flags &=
|
|
|
|
~(M_CSUM_TCPv4|M_CSUM_UDPv4);
|
1993-12-06 07:50:19 +03:00
|
|
|
}
|
Eliminate address family-specific route caches (struct route, struct
route_in6, struct route_iso), replacing all caches with a struct
route.
The principle benefit of this change is that all of the protocol
families can benefit from route cache-invalidation, which is
necessary for correct routing. Route-cache invalidation fixes an
ancient PR, kern/3508, at long last; it fixes various other PRs,
also.
Discussions with and ideas from Joerg Sonnenberger influenced this
work tremendously. Of course, all design oversights and bugs are
mine.
DETAILS
1 I added to each address family a pool of sockaddrs. I have
introduced routines for allocating, copying, and duplicating,
and freeing sockaddrs:
struct sockaddr *sockaddr_alloc(sa_family_t af, int flags);
struct sockaddr *sockaddr_copy(struct sockaddr *dst,
const struct sockaddr *src);
struct sockaddr *sockaddr_dup(const struct sockaddr *src, int flags);
void sockaddr_free(struct sockaddr *sa);
sockaddr_alloc() returns either a sockaddr from the pool belonging
to the specified family, or NULL if the pool is exhausted. The
returned sockaddr has the right size for that family; sa_family
and sa_len fields are initialized to the family and sockaddr
length---e.g., sa_family = AF_INET and sa_len = sizeof(struct
sockaddr_in). sockaddr_free() puts the given sockaddr back into
its family's pool.
sockaddr_dup() and sockaddr_copy() work analogously to strdup()
and strcpy(), respectively. sockaddr_copy() KASSERTs that the
family of the destination and source sockaddrs are alike.
The 'flags' argumet for sockaddr_alloc() and sockaddr_dup() is
passed directly to pool_get(9).
2 I added routines for initializing sockaddrs in each address
family, sockaddr_in_init(), sockaddr_in6_init(), sockaddr_iso_init(),
etc. They are fairly self-explanatory.
3 structs route_in6 and route_iso are no more. All protocol families
use struct route. I have changed the route cache, 'struct route',
so that it does not contain storage space for a sockaddr. Instead,
struct route points to a sockaddr coming from the pool the sockaddr
belongs to. I added a new method to struct route, rtcache_setdst(),
for setting the cache destination:
int rtcache_setdst(struct route *, const struct sockaddr *);
rtcache_setdst() returns 0 on success, or ENOMEM if no memory is
available to create the sockaddr storage.
It is now possible for rtcache_getdst() to return NULL if, say,
rtcache_setdst() failed. I check the return value for NULL
everywhere in the kernel.
4 Each routing domain (struct domain) has a list of live route
caches, dom_rtcache. rtflushall(sa_family_t af) looks up the
domain indicated by 'af', walks the domain's list of route caches
and invalidates each one.
2007-05-03 00:40:22 +04:00
|
|
|
|
|
|
|
ip->ip_sum = 0;
|
|
|
|
ip->ip_sum = in_cksum(copym, ip->ip_hl << 2);
|
|
|
|
(void)looutput(ifp, copym, sintocsa(dst), NULL);
|
1993-12-06 07:50:19 +03:00
|
|
|
}
|