2009-03-14 17:45:51 +03:00
|
|
|
/* $NetBSD: keydb.h,v 1.29 2009/03/14 14:46:11 dsl Exp $ */
|
2003-09-07 19:59:36 +04:00
|
|
|
/* $KAME: keydb.h,v 1.23 2003/09/07 05:25:20 itojun Exp $ */
|
1999-07-04 01:24:45 +04:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
/*
|
|
|
|
* Copyright (C) 1995, 1996, 1997, and 1998 WIDE Project.
|
|
|
|
* All rights reserved.
|
2000-06-12 14:40:37 +04:00
|
|
|
*
|
1999-06-28 10:36:47 +04:00
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions
|
|
|
|
* are met:
|
|
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer.
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
|
|
* documentation and/or other materials provided with the distribution.
|
|
|
|
* 3. Neither the name of the project nor the names of its contributors
|
|
|
|
* may be used to endorse or promote products derived from this software
|
|
|
|
* without specific prior written permission.
|
2000-06-12 14:40:37 +04:00
|
|
|
*
|
1999-06-28 10:36:47 +04:00
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE PROJECT AND CONTRIBUTORS ``AS IS'' AND
|
|
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE PROJECT OR CONTRIBUTORS BE LIABLE
|
|
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
|
|
* SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef _NETKEY_KEYDB_H_
|
|
|
|
#define _NETKEY_KEYDB_H_
|
|
|
|
|
2000-01-31 17:18:52 +03:00
|
|
|
#ifdef _KERNEL
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2005-07-07 23:34:51 +04:00
|
|
|
#if defined(_KERNEL_OPT)
|
|
|
|
#include "opt_ipsec.h"
|
|
|
|
#endif
|
|
|
|
|
2003-02-01 09:23:35 +03:00
|
|
|
#include <sys/mallocvar.h>
|
1999-06-28 10:36:47 +04:00
|
|
|
#include <netkey/key_var.h>
|
|
|
|
|
2003-02-01 09:23:35 +03:00
|
|
|
MALLOC_DECLARE(M_SECA);
|
|
|
|
|
2000-01-31 17:18:52 +03:00
|
|
|
/* Security Assocciation Index */
|
|
|
|
/* NOTE: Ensure to be same address family */
|
|
|
|
struct secasindex {
|
|
|
|
struct sockaddr_storage src; /* srouce address for SA */
|
|
|
|
struct sockaddr_storage dst; /* destination address for SA */
|
|
|
|
u_int16_t proto; /* IPPROTO_ESP or IPPROTO_AH */
|
|
|
|
u_int8_t mode; /* mode of protocol, see ipsec.h */
|
2004-12-06 11:05:26 +03:00
|
|
|
u_int16_t reqid; /* reqid id who owned this SA */
|
2000-01-31 17:18:52 +03:00
|
|
|
/* see IPSEC_MANUAL_REQID_MAX. */
|
1999-06-28 10:36:47 +04:00
|
|
|
};
|
|
|
|
|
|
|
|
/* Security Association Data Base */
|
2000-01-31 17:18:52 +03:00
|
|
|
struct secashead {
|
|
|
|
LIST_ENTRY(secashead) chain;
|
|
|
|
|
|
|
|
struct secasindex saidx;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-01-31 17:18:52 +03:00
|
|
|
struct sadb_ident *idents; /* source identity */
|
|
|
|
struct sadb_ident *identd; /* destination identity */
|
|
|
|
/* XXX I don't know how to use them. */
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-01-31 17:18:52 +03:00
|
|
|
u_int8_t state; /* MATURE or DEAD. */
|
|
|
|
LIST_HEAD(_satree, secasvar) savtree[SADB_SASTATE_MAX+1];
|
1999-06-28 10:36:47 +04:00
|
|
|
/* SA chain */
|
2000-01-31 17:18:52 +03:00
|
|
|
/* The first of this list is newer SA */
|
1999-06-28 10:36:47 +04: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
|
|
|
struct route sa_route;
|
1999-06-28 10:36:47 +04:00
|
|
|
};
|
|
|
|
|
|
|
|
/* Security Association */
|
2000-01-31 17:18:52 +03:00
|
|
|
struct secasvar {
|
2003-09-07 19:59:36 +04:00
|
|
|
TAILQ_ENTRY(secasvar) tailq;
|
2000-01-31 17:18:52 +03:00
|
|
|
LIST_ENTRY(secasvar) chain;
|
2003-09-07 19:59:36 +04:00
|
|
|
LIST_ENTRY(secasvar) spihash;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
int refcnt; /* reference count */
|
|
|
|
u_int8_t state; /* Status of this Association */
|
2000-01-31 17:18:52 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
u_int8_t alg_auth; /* Authentication Algorithm Identifier*/
|
|
|
|
u_int8_t alg_enc; /* Cipher Algorithm Identifier */
|
|
|
|
u_int32_t spi; /* SPI Value, network byte order */
|
|
|
|
u_int32_t flags; /* holder for SADB_KEY_FLAGS */
|
2000-01-31 17:18:52 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
struct sadb_key *key_auth; /* Key for Authentication */
|
|
|
|
struct sadb_key *key_enc; /* Key for Encryption */
|
2007-03-04 08:59:00 +03:00
|
|
|
void *iv; /* Initilization Vector */
|
2000-01-31 17:18:52 +03:00
|
|
|
u_int ivlen; /* length of IV */
|
2000-07-23 09:23:04 +04:00
|
|
|
void *sched; /* intermediate encryption key */
|
|
|
|
size_t schedlen;
|
2000-01-31 17:18:52 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
struct secreplay *replay; /* replay prevention */
|
2000-09-22 20:55:04 +04:00
|
|
|
long created; /* for lifetime */
|
2000-01-31 17:18:52 +03:00
|
|
|
|
1999-06-28 10:36:47 +04:00
|
|
|
struct sadb_lifetime *lft_c; /* CURRENT lifetime, it's constant. */
|
|
|
|
struct sadb_lifetime *lft_h; /* HARD lifetime */
|
|
|
|
struct sadb_lifetime *lft_s; /* SOFT lifetime */
|
|
|
|
|
2003-09-07 19:59:36 +04:00
|
|
|
u_int64_t seq; /* sequence number */
|
2000-01-31 17:18:52 +03:00
|
|
|
pid_t pid; /* message's pid */
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2000-01-31 17:18:52 +03:00
|
|
|
struct secashead *sah; /* back pointer to the secashead */
|
2003-09-07 19:59:36 +04:00
|
|
|
|
|
|
|
u_int32_t id; /* SA id */
|
2005-02-27 01:31:44 +03:00
|
|
|
/* Nat-Traversal state */
|
2005-04-23 18:05:28 +04:00
|
|
|
#ifdef IPSEC_NAT_T
|
2005-02-12 15:31:07 +03:00
|
|
|
u_int16_t natt_type;
|
|
|
|
u_int16_t esp_frag;
|
2005-04-23 18:05:28 +04:00
|
|
|
#endif
|
1999-06-28 10:36:47 +04:00
|
|
|
};
|
|
|
|
|
|
|
|
/* replay prevention */
|
|
|
|
struct secreplay {
|
2003-09-07 19:59:36 +04:00
|
|
|
u_int64_t count;
|
1999-06-28 10:36:47 +04:00
|
|
|
u_int wsize; /* window size, i.g. 4 bytes */
|
2003-09-07 19:59:36 +04:00
|
|
|
u_int64_t seq; /* used by sender */
|
|
|
|
u_int64_t lastseq; /* used by receiver */
|
2002-09-11 06:41:19 +04:00
|
|
|
u_int8_t *bitmap; /* used by receiver */
|
2003-01-08 08:46:49 +03:00
|
|
|
int overflow; /* what round does the counter take. */
|
1999-06-28 10:36:47 +04:00
|
|
|
};
|
|
|
|
|
2000-06-12 14:40:37 +04:00
|
|
|
/* socket table due to send PF_KEY messages. */
|
1999-06-28 10:36:47 +04:00
|
|
|
struct secreg {
|
2000-01-31 17:18:52 +03:00
|
|
|
LIST_ENTRY(secreg) chain;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
struct socket *so;
|
|
|
|
};
|
|
|
|
|
2000-01-31 17:18:52 +03:00
|
|
|
#ifndef IPSEC_NONBLOCK_ACQUIRE
|
2000-06-12 14:40:37 +04:00
|
|
|
/* acquiring list table. */
|
1999-06-28 10:36:47 +04:00
|
|
|
struct secacq {
|
2000-01-31 17:18:52 +03:00
|
|
|
LIST_ENTRY(secacq) chain;
|
|
|
|
|
|
|
|
struct secasindex saidx;
|
1999-06-28 10:36:47 +04:00
|
|
|
|
|
|
|
u_int32_t seq; /* sequence number */
|
2000-09-22 20:55:04 +04:00
|
|
|
long created; /* for lifetime */
|
1999-06-28 10:36:47 +04:00
|
|
|
int count; /* for lifetime */
|
|
|
|
};
|
|
|
|
#endif
|
|
|
|
|
|
|
|
/* Sensitivity Level Specification */
|
|
|
|
/* nothing */
|
|
|
|
|
|
|
|
#define SADB_KILL_INTERVAL 600 /* six seconds */
|
|
|
|
|
|
|
|
struct key_cb {
|
|
|
|
int key_count;
|
|
|
|
int any_count;
|
|
|
|
};
|
|
|
|
|
2000-01-31 17:18:52 +03:00
|
|
|
/* secpolicy */
|
2002-06-12 05:47:34 +04:00
|
|
|
struct secpolicy;
|
|
|
|
struct secpolicyindex;
|
2009-03-14 17:45:51 +03:00
|
|
|
extern struct secpolicy *keydb_newsecpolicy(void);
|
|
|
|
extern u_int32_t keydb_newspid(void);
|
|
|
|
extern void keydb_delsecpolicy(struct secpolicy *);
|
2002-06-12 05:47:34 +04:00
|
|
|
extern int keydb_setsecpolicyindex
|
2009-03-14 17:45:51 +03:00
|
|
|
(struct secpolicy *, struct secpolicyindex *);
|
2000-01-31 17:18:52 +03:00
|
|
|
/* secashead */
|
2009-03-14 17:45:51 +03:00
|
|
|
extern struct secashead *keydb_newsecashead(void);
|
|
|
|
extern void keydb_delsecashead(struct secashead *);
|
2000-01-31 17:18:52 +03:00
|
|
|
/* secasvar */
|
2009-03-14 17:45:51 +03:00
|
|
|
extern struct secasvar *keydb_newsecasvar(void);
|
|
|
|
extern void keydb_delsecasvar(struct secasvar *);
|
2000-01-31 17:18:52 +03:00
|
|
|
/* secreplay */
|
2009-03-14 17:45:51 +03:00
|
|
|
extern struct secreplay *keydb_newsecreplay(size_t);
|
|
|
|
extern void keydb_delsecreplay(struct secreplay *);
|
2000-01-31 17:18:52 +03:00
|
|
|
/* secreg */
|
2009-03-14 17:45:51 +03:00
|
|
|
extern struct secreg *keydb_newsecreg(void);
|
|
|
|
extern void keydb_delsecreg(struct secreg *);
|
2000-01-31 17:18:52 +03:00
|
|
|
|
|
|
|
#endif /* _KERNEL */
|
1999-06-28 10:36:47 +04:00
|
|
|
|
2005-12-11 03:02:28 +03:00
|
|
|
#endif /* !_NETKEY_KEYDB_H_ */
|