sainfo.c   [plain text]

/*	$KAME: sainfo.c,v 1.16 2003/06/27 07:32:39 sakane 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.
 */

#include "config.h"

#include <sys/param.h>
#include <sys/types.h>
#include <sys/socket.h>
#include <sys/queue.h>

#include <netinet/in.h>
#include <netinet/in.h> 
#ifdef HAVE_NETINET6_IPSEC
#  include <netinet6/ipsec.h>
#else 
#  include <netinet/ipsec.h>
#endif

#include <stdlib.h>
#include <stdio.h>
#include <string.h>
#include <errno.h>

#include "var.h"
#include "misc.h"
#include "vmbuf.h"
#include "plog.h"
#include "sockmisc.h"
#include "debug.h"

#include "localconf.h"
#include "isakmp_var.h"
#include "isakmp.h"
#include "ipsec_doi.h"
#include "oakley.h"
#include "handler.h"
#include "algorithm.h"
#include "sainfo.h"
#include "gcmalloc.h"

static LIST_HEAD(_sitree, sainfo) sitree;

/* %%%
 * modules for ipsec sa info
 */
/*
 * return matching entry.
 * no matching entry found and if there is anonymous entry, return it.
 * else return NULL.
 * XXX by each data type, should be changed to compare the buffer.
 * First pass is for sainfo from a specified peer, second for others.
 */
struct sainfo *
getsainfo(src, dst, peer, use_nat_addr)
	const vchar_t *src, *dst, *peer;
	int use_nat_addr;
{
	struct sainfo *s = NULL;
	struct sainfo *anonymous = NULL;
	int pass = 1;
	
	if (use_nat_addr && lcconf->ext_nat_id == NULL)
		return NULL;

	plog(LLV_DEBUG2, LOCATION, NULL, "getsainfo - src id:\n");
	if (src != NULL)
		plogdump(LLV_DEBUG2, src->v, src->l);
	else
		plog(LLV_DEBUG2, LOCATION, NULL, " anonymous\n");
	plog(LLV_DEBUG2, LOCATION, NULL, "getsainfo - dst id:\n");
	if (dst != NULL)
		plogdump(LLV_DEBUG2, dst->v, dst->l);
	else
		plog(LLV_DEBUG2, LOCATION, NULL, " anonymous\n");
	if (peer == NULL)
		pass = 2;
    again:
	LIST_FOREACH(s, &sitree, chain) {
#ifdef __APPLE__
		if (s->to_delete || s->to_remove) {
			continue;
		}
#endif /* __APPLE__ */
		if (s->idsrc != NULL) {
			plog(LLV_DEBUG2, LOCATION, NULL, "getsainfo - sainfo id - src & dst:\n");
			plogdump(LLV_DEBUG2, s->idsrc->v, s->idsrc->l);
			plogdump(LLV_DEBUG2, s->iddst->v, s->iddst->l);
		} else {
			plog(LLV_DEBUG2, LOCATION, NULL, "getsainfo - sainfo id = anonymous\n");
		}
		if (s->id_i != NULL) {
			if (pass == 2)
				continue;
			if (memcmp(peer->v, s->id_i->v, s->id_i->l) != 0)
				continue;
		} else if (pass == 1)
			continue;
		if (s->idsrc == NULL) {
			anonymous = s;
			continue;
		}

		/* anonymous ? */
		if (src == NULL) {
			if (anonymous != NULL)
				break;
			continue;
		}

		if (memcmp(src->v, s->idsrc->v, s->idsrc->l) == 0) {
			if (use_nat_addr) {
				if (memcmp(lcconf->ext_nat_id->v, s->iddst->v, s->iddst->l) == 0) {
					plog(LLV_DEBUG, LOCATION, NULL,
						"matched external nat address.\n");
					plogdump(LLV_DEBUG2, lcconf->ext_nat_id->v, lcconf->ext_nat_id->l);
					return s;
				}
			} else if (memcmp(dst->v, s->iddst->v, s->iddst->l) == 0)
				return s;
		}
	}

	if (anonymous) {
		plog(LLV_DEBUG, LOCATION, NULL,
			"anonymous sainfo selected.\n");
	} else if (pass == 1) {
		pass = 2;
		goto again;
	}

	return anonymous;
}

#ifdef __APPLE__
int
link_sainfo_to_ph2 (struct sainfo *new)
{
	if (!new) {
		return(-1);
	}
	if (new->to_delete ||
		new->to_remove) {
		return(-1);
	}
	new->linked_to_ph2++;
	return(0);
}

/*
 * return matching entry.
 * no matching entry found and if there is anonymous entry, return it.
 * else return NULL.
 * XXX by each data type, should be changed to compare the buffer.
 */
struct sainfo *
getsainfo_by_dst_id(dst, peer)
	const vchar_t *dst, *peer;
{
	struct sainfo *s = NULL;
	struct sainfo *anonymous = NULL;

	plog(LLV_DEBUG2, LOCATION, NULL, "getsainfo_by_dst_id - dst id:\n");
	if (dst != NULL)
		plogdump(LLV_DEBUG2, dst->v, dst->l);
	else
		return NULL;

	LIST_FOREACH(s, &sitree, chain) {
		if (s->to_delete || s->to_remove) {
			continue;
		}
		if (s->idsrc != NULL) {
			plog(LLV_DEBUG2, LOCATION, NULL, "getsainfo_by_dst_id - sainfo id - src & dst:\n");
			plogdump(LLV_DEBUG2, s->idsrc->v, s->idsrc->l);
			plogdump(LLV_DEBUG2, s->iddst->v, s->iddst->l);
		} else {
			plog(LLV_DEBUG2, LOCATION, NULL, "getsainfo_by_dst_id - sainfo id = anonymous\n");
		}
		if (s->id_i != NULL) {
			plog(LLV_DEBUG2, LOCATION, NULL, "getsainfo_by_dst_id - sainfo id_i:\n");
			plogdump(LLV_DEBUG2, s->id_i->v, s->id_i->l);
			if (peer == NULL)
				continue;
			if (memcmp(peer->v, s->id_i->v, s->id_i->l) != 0)
				continue;
		}
		if (s->idsrc == NULL) {
			anonymous = s;
			continue;
		}

		if (memcmp(dst->v, s->iddst->v, s->iddst->l) == 0)
			return s;
	}

	if (anonymous) {
		plog(LLV_DEBUG, LOCATION, NULL,
			 "anonymous sainfo selected.\n");
	}
	
	return anonymous;
}

int
unlink_sainfo_from_ph2 (struct sainfo *old)
{
	if (!old) {
		return(-1);
	}
	if (old->linked_to_ph2 <= 0) {
		return(-1);
	}
	old->linked_to_ph2--;
	if (old->linked_to_ph2 == 0) {
		if (old->to_remove) {
			remsainfo(old);
		}
		if (old->to_delete) {
			delsainfo(old);
		}
	}
	return(0);
}
#endif

struct sainfo *
newsainfo()
{
	struct sainfo *new;

	new = racoon_calloc(1, sizeof(*new));
	if (new == NULL)
		return NULL;

	new->lifetime = IPSECDOI_ATTR_SA_LD_SEC_DEFAULT;
	new->lifebyte = IPSECDOI_ATTR_SA_LD_KB_MAX;
#ifdef __APPLE__
	new->to_remove = FALSE;
	new->to_delete = FALSE;
	new->linked_to_ph2 = 0;
#endif

	return new;
}

void
delsainfo(si)
	struct sainfo *si;
{
	int i;

#ifdef __APPLE__
	if (si->linked_to_ph2) {
		si->to_delete = TRUE;
		return;
	}
#endif
	
	for (i = 0; i < MAXALGCLASS; i++)
		delsainfoalg(si->algs[i]);

	if (si->idsrc)
		vfree(si->idsrc);
	if (si->iddst)
		vfree(si->iddst);

#ifdef ENABLE_HYBRID
	if (si->group)
		vfree(si->group);
#endif

	racoon_free(si);
}

void
inssainfo(new)
	struct sainfo *new;
{
	LIST_INSERT_HEAD(&sitree, new, chain);
}

void
remsainfo(si)
	struct sainfo *si;
{
#ifdef __APPLE__
	if (si->linked_to_ph2) {
		si->to_remove = TRUE;
		return;
	}
#endif
	LIST_REMOVE(si, chain);
}

void
flushsainfo()
{
	struct sainfo *s, *next;

	for (s = LIST_FIRST(&sitree); s; s = next) {
		next = LIST_NEXT(s, chain);
		if (s->dynamic == 0) {
			remsainfo(s);
			delsainfo(s);
		}
	}
}

void
flushsainfo_dynamic(u_int32_t addr)
{
	struct sainfo *s, *next;

	for (s = LIST_FIRST(&sitree); s; s = next) {
		next = LIST_NEXT(s, chain);
		if (s->dynamic == addr) {
			remsainfo(s);
			delsainfo(s);
		}
	}
}

void
initsainfo()
{
	LIST_INIT(&sitree);
}

struct sainfoalg *
newsainfoalg()
{
	struct sainfoalg *new;

	new = racoon_calloc(1, sizeof(*new));
	if (new == NULL)
		return NULL;

	return new;
}

void
delsainfoalg(alg)
	struct sainfoalg *alg;
{
	struct sainfoalg *a, *next;

	for (a = alg; a; a = next) {
		next = a->next;
		racoon_free(a);
	}
}

void
inssainfoalg(head, new)
	struct sainfoalg **head;
	struct sainfoalg *new;
{
	struct sainfoalg *a;

	for (a = *head; a && a->next; a = a->next)
		;
	if (a)
		a->next = new;
	else
		*head = new;
}

const char *
sainfo2str(si)
	const struct sainfo *si;
{
    char *idsrc_str;
    char *iddst_str;
    char *idi_str;
	static char buf[256];

	if (si->idsrc == NULL)
		snprintf(buf, sizeof(buf), "anonymous");
	else {
        idsrc_str = ipsecdoi_id2str(si->idsrc);
        if (idsrc_str) {
            snprintf(buf, sizeof(buf), "%s", idsrc_str);
            racoon_free(idsrc_str);
        }
        iddst_str = ipsecdoi_id2str(si->iddst);
        if (iddst_str) {
            snprintf(buf + strlen(buf), sizeof(buf) - strlen(buf),
                     " %s", iddst_str);
            racoon_free(iddst_str);
        }
	}

	if (si->id_i != NULL) {
        idi_str = ipsecdoi_id2str(si->id_i);
        if (idi_str) {
            snprintf(buf + strlen(buf), sizeof(buf) - strlen(buf),
                     " from %s", idi_str);
            racoon_free(idi_str);
        }
    }

	return buf;
}