adden new isakmpd

1 files changed, 61 insertions, 0 deletions

diff --git a/keyexchange/isakmpd-20041012/doi.c b/keyexchange/isakmpd-20041012/doi.c
new file mode 100644
index 0000000..e9a5030
--- /dev/null
+++ b/keyexchange/isakmpd-20041012/doi.c
@@ -0,0 +1,61 @@
+/* $OpenBSD: doi.c,v 1.9 2004/07/09 16:06:48 deraadt Exp $	 */
+/* $EOM: doi.c,v 1.4 1999/04/02 00:57:36 niklas Exp $	 */
+
+/*
+ * Copyright (c) 1998, 1999 Niklas Hallqvist.  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.
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``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 AUTHOR 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.
+ */
+
+/*
+ * This code was written under funding by Ericsson Radio Systems.
+ */
+
+#include <sys/param.h>
+
+#include "sysdep.h"
+
+#include "doi.h"
+
+static
+LIST_HEAD(doi_list, doi) doi_tab;
+
+void
+doi_init(void)
+{
+	LIST_INIT(&doi_tab);
+}
+
+struct doi *
+doi_lookup(u_int8_t doi_id)
+{
+	struct doi     *doi;
+
+	for (doi = LIST_FIRST(&doi_tab); doi && doi->id != doi_id;
+	    doi = LIST_NEXT(doi, link));
+	return doi;
+}
+
+void
+doi_register(struct doi *doi)
+{
+	LIST_INSERT_HEAD(&doi_tab, doi, link);
+}