1a9643ea8Slogwang /*-
2*22ce4affSfengbojiang  * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
3*22ce4affSfengbojiang  *
4a9643ea8Slogwang  * Copyright (c) 2005 Paolo Pisati <[email protected]>
5a9643ea8Slogwang  * All rights reserved.
6a9643ea8Slogwang  *
7a9643ea8Slogwang  * Redistribution and use in source and binary forms, with or without
8a9643ea8Slogwang  * modification, are permitted provided that the following conditions
9a9643ea8Slogwang  * are met:
10a9643ea8Slogwang  * 1. Redistributions of source code must retain the above copyright
11a9643ea8Slogwang  *    notice, this list of conditions and the following disclaimer.
12a9643ea8Slogwang  * 2. Redistributions in binary form must reproduce the above copyright
13a9643ea8Slogwang  *    notice, this list of conditions and the following disclaimer in the
14a9643ea8Slogwang  *    documentation and/or other materials provided with the distribution.
15a9643ea8Slogwang  *
16a9643ea8Slogwang  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
17a9643ea8Slogwang  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
18a9643ea8Slogwang  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
19a9643ea8Slogwang  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
20a9643ea8Slogwang  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21a9643ea8Slogwang  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22a9643ea8Slogwang  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23a9643ea8Slogwang  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24a9643ea8Slogwang  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25a9643ea8Slogwang  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26a9643ea8Slogwang  * SUCH DAMAGE.
27a9643ea8Slogwang  *
28a9643ea8Slogwang  */
29a9643ea8Slogwang #include <sys/cdefs.h>
30a9643ea8Slogwang __FBSDID("$FreeBSD$");
31a9643ea8Slogwang 
32a9643ea8Slogwang #ifdef _KERNEL
33a9643ea8Slogwang #include <sys/libkern.h>
34a9643ea8Slogwang #include <sys/param.h>
35a9643ea8Slogwang #include <sys/lock.h>
36a9643ea8Slogwang #include <sys/rwlock.h>
37a9643ea8Slogwang #else
38a9643ea8Slogwang #include <stdio.h>
39a9643ea8Slogwang #include <string.h>
40a9643ea8Slogwang #include <sys/types.h>
41a9643ea8Slogwang #include <errno.h>
42a9643ea8Slogwang #endif
43a9643ea8Slogwang 
44a9643ea8Slogwang #include <netinet/in_systm.h>
45a9643ea8Slogwang #include <netinet/in.h>
46a9643ea8Slogwang #include <netinet/ip.h>
47a9643ea8Slogwang 
48a9643ea8Slogwang #ifdef _KERNEL
49a9643ea8Slogwang #include <netinet/libalias/alias_local.h>
50a9643ea8Slogwang #include <netinet/libalias/alias_mod.h>
51a9643ea8Slogwang #else
52a9643ea8Slogwang #include "alias_local.h"
53a9643ea8Slogwang #include "alias_mod.h"
54a9643ea8Slogwang #endif
55a9643ea8Slogwang 
56a9643ea8Slogwang /* Protocol and userland module handlers chains. */
57a9643ea8Slogwang static TAILQ_HEAD(handler_chain, proto_handler) handler_chain =
58a9643ea8Slogwang     TAILQ_HEAD_INITIALIZER(handler_chain);
59a9643ea8Slogwang 
60a9643ea8Slogwang static int
attach_handler(struct proto_handler * p)61a9643ea8Slogwang attach_handler(struct proto_handler *p)
62a9643ea8Slogwang {
63a9643ea8Slogwang 	struct proto_handler *b;
64a9643ea8Slogwang 
65a9643ea8Slogwang 	TAILQ_FOREACH(b, &handler_chain, link) {
66a9643ea8Slogwang 		if ((b->pri == p->pri) &&
67a9643ea8Slogwang 		    (b->dir == p->dir) &&
68a9643ea8Slogwang 		    (b->proto == p->proto))
69a9643ea8Slogwang 			return (EEXIST);
70a9643ea8Slogwang 		if (b->pri > p->pri) {
71a9643ea8Slogwang 			TAILQ_INSERT_BEFORE(b, p, link);
72a9643ea8Slogwang 			return (0);
73a9643ea8Slogwang 		}
74a9643ea8Slogwang 	}
75a9643ea8Slogwang 
76a9643ea8Slogwang 	TAILQ_INSERT_TAIL(&handler_chain, p, link);
77a9643ea8Slogwang 
78a9643ea8Slogwang 	return (0);
79a9643ea8Slogwang }
80a9643ea8Slogwang 
81a9643ea8Slogwang int
LibAliasAttachHandlers(struct proto_handler * p)82a9643ea8Slogwang LibAliasAttachHandlers(struct proto_handler *p)
83a9643ea8Slogwang {
84a9643ea8Slogwang 	int error;
85a9643ea8Slogwang 
86a9643ea8Slogwang 	while (p->dir != NODIR) {
87a9643ea8Slogwang 		error = attach_handler(p);
88a9643ea8Slogwang 		if (error)
89a9643ea8Slogwang 			return (error);
90a9643ea8Slogwang 		p++;
91a9643ea8Slogwang 	}
92a9643ea8Slogwang 
93a9643ea8Slogwang 	return (0);
94a9643ea8Slogwang }
95a9643ea8Slogwang 
96a9643ea8Slogwang /* XXXGL: should be void, but no good reason to break ABI */
97a9643ea8Slogwang int
LibAliasDetachHandlers(struct proto_handler * p)98a9643ea8Slogwang LibAliasDetachHandlers(struct proto_handler *p)
99a9643ea8Slogwang {
100a9643ea8Slogwang 
101a9643ea8Slogwang 	while (p->dir != NODIR) {
102a9643ea8Slogwang 		TAILQ_REMOVE(&handler_chain, p, link);
103a9643ea8Slogwang 		p++;
104a9643ea8Slogwang 	}
105a9643ea8Slogwang 
106a9643ea8Slogwang 	return (0);
107a9643ea8Slogwang }
108a9643ea8Slogwang 
109a9643ea8Slogwang int
find_handler(int8_t dir,int8_t proto,struct libalias * la,struct ip * ip,struct alias_data * ad)110a9643ea8Slogwang find_handler(int8_t dir, int8_t proto, struct libalias *la, struct ip *ip,
111a9643ea8Slogwang     struct alias_data *ad)
112a9643ea8Slogwang {
113a9643ea8Slogwang 	struct proto_handler *p;
114a9643ea8Slogwang 
115a9643ea8Slogwang 	TAILQ_FOREACH(p, &handler_chain, link)
116a9643ea8Slogwang 		if ((p->dir & dir) && (p->proto & proto) &&
117a9643ea8Slogwang 		    p->fingerprint(la, ad) == 0)
118a9643ea8Slogwang 			return (p->protohandler(la, ip, ad));
119a9643ea8Slogwang 
120a9643ea8Slogwang 	return (ENOENT);
121a9643ea8Slogwang }
122a9643ea8Slogwang 
123a9643ea8Slogwang struct proto_handler *
first_handler(void)124a9643ea8Slogwang first_handler(void)
125a9643ea8Slogwang {
126a9643ea8Slogwang 
127a9643ea8Slogwang 	return (TAILQ_FIRST(&handler_chain));
128a9643ea8Slogwang }
129a9643ea8Slogwang 
130a9643ea8Slogwang #ifndef _KERNEL
131a9643ea8Slogwang /* Dll manipulation code - this code is not thread safe... */
132*22ce4affSfengbojiang static SLIST_HEAD(dll_chain, dll) dll_chain = SLIST_HEAD_INITIALIZER(dll_chain);
133a9643ea8Slogwang int
attach_dll(struct dll * p)134a9643ea8Slogwang attach_dll(struct dll *p)
135a9643ea8Slogwang {
136a9643ea8Slogwang 	struct dll *b;
137a9643ea8Slogwang 
138a9643ea8Slogwang 	SLIST_FOREACH(b, &dll_chain, next) {
139a9643ea8Slogwang 		if (!strncmp(b->name, p->name, DLL_LEN))
140a9643ea8Slogwang 			return (EEXIST); /* Dll name conflict. */
141a9643ea8Slogwang 	}
142a9643ea8Slogwang 	SLIST_INSERT_HEAD(&dll_chain, p, next);
143a9643ea8Slogwang 	return (0);
144a9643ea8Slogwang }
145a9643ea8Slogwang 
146a9643ea8Slogwang void *
detach_dll(char * p)147a9643ea8Slogwang detach_dll(char *p)
148a9643ea8Slogwang {
149a9643ea8Slogwang 	struct dll *b, *b_tmp;
150a9643ea8Slogwang 	void *error;
151a9643ea8Slogwang 
152a9643ea8Slogwang 	b = NULL;
153a9643ea8Slogwang 	error = NULL;
154a9643ea8Slogwang 	SLIST_FOREACH_SAFE(b, &dll_chain, next, b_tmp)
155a9643ea8Slogwang 		if (!strncmp(b->name, p, DLL_LEN)) {
156a9643ea8Slogwang 			SLIST_REMOVE(&dll_chain, b, dll, next);
157a9643ea8Slogwang 			error = b;
158a9643ea8Slogwang 			break;
159a9643ea8Slogwang 		}
160a9643ea8Slogwang 	return (error);
161a9643ea8Slogwang }
162a9643ea8Slogwang 
163a9643ea8Slogwang struct dll *
walk_dll_chain(void)164a9643ea8Slogwang walk_dll_chain(void)
165a9643ea8Slogwang {
166a9643ea8Slogwang 	struct dll *t;
167a9643ea8Slogwang 
168a9643ea8Slogwang 	t = SLIST_FIRST(&dll_chain);
169a9643ea8Slogwang 	if (t == NULL)
170a9643ea8Slogwang 		return (NULL);
171a9643ea8Slogwang 	SLIST_REMOVE_HEAD(&dll_chain, next);
172a9643ea8Slogwang 	return (t);
173a9643ea8Slogwang }
174a9643ea8Slogwang #endif /* !_KERNEL */
175