72f0a6dfb0
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.
87 lines
3.1 KiB
C
87 lines
3.1 KiB
C
/* $NetBSD: if_gif.h,v 1.17 2007/05/02 20:40:23 dyoung Exp $ */
|
|
/* $KAME: if_gif.h,v 1.23 2001/07/27 09:21:42 itojun Exp $ */
|
|
|
|
/*
|
|
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
|
|
* All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 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.
|
|
*
|
|
* 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.
|
|
*/
|
|
|
|
/*
|
|
* if_gif.h
|
|
*/
|
|
|
|
#ifndef _NET_IF_GIF_H_
|
|
#define _NET_IF_GIF_H_
|
|
|
|
#include <sys/queue.h>
|
|
|
|
#if defined(_KERNEL) && !defined(_LKM)
|
|
#include "opt_inet.h"
|
|
#endif
|
|
|
|
#include <netinet/in.h>
|
|
/* xxx sigh, why route have struct route instead of pointer? */
|
|
|
|
struct encaptab;
|
|
|
|
struct gif_softc {
|
|
struct ifnet gif_if; /* common area - must be at the top */
|
|
struct sockaddr *gif_psrc; /* Physical src addr */
|
|
struct sockaddr *gif_pdst; /* Physical dst addr */
|
|
union {
|
|
struct route gifscr_ro; /* xxx */
|
|
} gifsc_gifscr;
|
|
int gif_flags;
|
|
const struct encaptab *encap_cookie4;
|
|
const struct encaptab *encap_cookie6;
|
|
LIST_ENTRY(gif_softc) gif_list; /* list of all gifs */
|
|
#ifdef __HAVE_GENERIC_SOFT_INTERRUPTS
|
|
void *gif_si; /* softintr handle */
|
|
#endif
|
|
};
|
|
#define GIF_ROUTE_TTL 10
|
|
|
|
#define gif_ro gifsc_gifscr.gifscr_ro
|
|
|
|
#define GIF_MTU (1280) /* Default MTU */
|
|
#define GIF_MTU_MIN (1280) /* Minimum MTU */
|
|
#define GIF_MTU_MAX (8192) /* Maximum MTU */
|
|
|
|
/* Prototypes */
|
|
void gifattach0(struct gif_softc *);
|
|
void gif_input(struct mbuf *, int, struct ifnet *);
|
|
int gif_output(struct ifnet *, struct mbuf *,
|
|
const struct sockaddr *, struct rtentry *);
|
|
int gif_ioctl(struct ifnet *, u_long, void *);
|
|
int gif_set_tunnel(struct ifnet *, struct sockaddr *, struct sockaddr *);
|
|
void gif_delete_tunnel(struct ifnet *);
|
|
#ifdef GIF_ENCAPCHECK
|
|
int gif_encapcheck(struct mbuf *, int, int, void *);
|
|
#endif
|
|
|
|
#endif /* !_NET_IF_GIF_H_ */
|