1/*-
2 * Copyright (c) 2010 Lawrence Stewart <lstewart@freebsd.org>
3 * Copyright (c) 2010 The FreeBSD Foundation
4 * All rights reserved.
5 *
6 * This software was developed by Lawrence Stewart while studying at the Centre
7 * for Advanced Internet Architectures, Swinburne University of Technology,
8 * made possible in part by grants from the FreeBSD Foundation and Cisco
9 * University Research Program Fund at Community Foundation Silicon Valley.
10 *
11 * Portions of this software were developed at the Centre for Advanced
12 * Internet Architectures, Swinburne University of Technology, Melbourne,
13 * Australia by Lawrence Stewart under sponsorship from the FreeBSD Foundation.
14 *
15 * Redistribution and use in source and binary forms, with or without
16 * modification, are permitted provided that the following conditions
17 * are met:
18 * 1. Redistributions of source code must retain the above copyright
19 * notice, this list of conditions and the following disclaimer.
20 * 2. Redistributions in binary form must reproduce the above copyright
21 * notice, this list of conditions and the following disclaimer in the
22 * documentation and/or other materials provided with the distribution.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
35 */
36
37#include <sys/cdefs.h>
| 1/*-
2 * Copyright (c) 2010 Lawrence Stewart <lstewart@freebsd.org>
3 * Copyright (c) 2010 The FreeBSD Foundation
4 * All rights reserved.
5 *
6 * This software was developed by Lawrence Stewart while studying at the Centre
7 * for Advanced Internet Architectures, Swinburne University of Technology,
8 * made possible in part by grants from the FreeBSD Foundation and Cisco
9 * University Research Program Fund at Community Foundation Silicon Valley.
10 *
11 * Portions of this software were developed at the Centre for Advanced
12 * Internet Architectures, Swinburne University of Technology, Melbourne,
13 * Australia by Lawrence Stewart under sponsorship from the FreeBSD Foundation.
14 *
15 * Redistribution and use in source and binary forms, with or without
16 * modification, are permitted provided that the following conditions
17 * are met:
18 * 1. Redistributions of source code must retain the above copyright
19 * notice, this list of conditions and the following disclaimer.
20 * 2. Redistributions in binary form must reproduce the above copyright
21 * notice, this list of conditions and the following disclaimer in the
22 * documentation and/or other materials provided with the distribution.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
35 */
36
37#include <sys/cdefs.h>
|
63
64LIST_HEAD(hhookheadhead, hhook_head);
65VNET_DEFINE(struct hhookheadhead, hhook_head_list);
66#define V_hhook_head_list VNET(hhook_head_list)
67
68static struct mtx hhook_head_list_lock;
69MTX_SYSINIT(hhookheadlistlock, &hhook_head_list_lock, "hhook_head list lock",
70 MTX_DEF);
71
72/* Private function prototypes. */
73static void hhook_head_destroy(struct hhook_head *hhh);
74
75#define HHHLIST_LOCK() mtx_lock(&hhook_head_list_lock)
76#define HHHLIST_UNLOCK() mtx_unlock(&hhook_head_list_lock)
77#define HHHLIST_LOCK_ASSERT() mtx_assert(&hhook_head_list_lock, MA_OWNED)
78
79#define HHH_LOCK_INIT(hhh) rm_init(&(hhh)->hhh_lock, "hhook_head rm lock")
80#define HHH_LOCK_DESTROY(hhh) rm_destroy(&(hhh)->hhh_lock)
81#define HHH_WLOCK(hhh) rm_wlock(&(hhh)->hhh_lock)
82#define HHH_WUNLOCK(hhh) rm_wunlock(&(hhh)->hhh_lock)
83#define HHH_RLOCK(hhh, rmpt) rm_rlock(&(hhh)->hhh_lock, (rmpt))
84#define HHH_RUNLOCK(hhh, rmpt) rm_runlock(&(hhh)->hhh_lock, (rmpt))
85
86/*
87 * Run all helper hook functions for a given hook point.
88 */
89void
90hhook_run_hooks(struct hhook_head *hhh, void *ctx_data, struct osd *hosd)
91{
92 struct hhook *hhk;
93 void *hdata;
94 struct rm_priotracker rmpt;
95
96 KASSERT(hhh->hhh_refcount > 0, ("hhook_head %p refcount is 0", hhh));
97
98 HHH_RLOCK(hhh, &rmpt);
99 STAILQ_FOREACH(hhk, &hhh->hhh_hooks, hhk_next) {
100 if (hhk->hhk_helper->h_flags & HELPER_NEEDS_OSD) {
101 hdata = osd_get(OSD_KHELP, hosd, hhk->hhk_helper->h_id);
102 if (hdata == NULL)
103 continue;
104 } else
105 hdata = NULL;
106
107 /*
108 * XXXLAS: We currently ignore the int returned by the hook,
109 * but will likely want to handle it in future to allow hhook to
110 * be used like pfil and effect changes at the hhook calling
111 * site e.g. we could define a new hook type of HHOOK_TYPE_PFIL
112 * and standardise what particular return values mean and set
113 * the context data to pass exactly the same information as pfil
114 * hooks currently receive, thus replicating pfil with hhook.
115 */
116 hhk->hhk_func(hhh->hhh_type, hhh->hhh_id, hhk->hhk_udata,
117 ctx_data, hdata, hosd);
118 }
119 HHH_RUNLOCK(hhh, &rmpt);
120}
121
122/*
123 * Register a new helper hook function with a helper hook point.
124 */
125int
126hhook_add_hook(struct hhook_head *hhh, struct hookinfo *hki, uint32_t flags)
127{
128 struct hhook *hhk, *tmp;
129 int error;
130
131 error = 0;
132
133 if (hhh == NULL)
134 return (ENOENT);
135
136 hhk = malloc(sizeof(struct hhook), M_HHOOK,
137 M_ZERO | ((flags & HHOOK_WAITOK) ? M_WAITOK : M_NOWAIT));
138
139 if (hhk == NULL)
140 return (ENOMEM);
141
142 hhk->hhk_helper = hki->hook_helper;
143 hhk->hhk_func = hki->hook_func;
144 hhk->hhk_udata = hki->hook_udata;
145
146 HHH_WLOCK(hhh);
147 STAILQ_FOREACH(tmp, &hhh->hhh_hooks, hhk_next) {
148 if (tmp->hhk_func == hki->hook_func &&
149 tmp->hhk_udata == hki->hook_udata) {
150 /* The helper hook function is already registered. */
151 error = EEXIST;
152 break;
153 }
154 }
155
156 if (!error) {
157 STAILQ_INSERT_TAIL(&hhh->hhh_hooks, hhk, hhk_next);
158 hhh->hhh_nhooks++;
159 } else
160 free(hhk, M_HHOOK);
161
162 HHH_WUNLOCK(hhh);
163
164 return (error);
165}
166
167/*
168 * Lookup a helper hook point and register a new helper hook function with it.
169 */
170int
171hhook_add_hook_lookup(struct hookinfo *hki, uint32_t flags)
172{
173 struct hhook_head *hhh;
174 int error;
175
176 hhh = hhook_head_get(hki->hook_type, hki->hook_id);
177
178 if (hhh == NULL)
179 return (ENOENT);
180
181 error = hhook_add_hook(hhh, hki, flags);
182 hhook_head_release(hhh);
183
184 return (error);
185}
186
187/*
188 * Remove a helper hook function from a helper hook point.
189 */
190int
191hhook_remove_hook(struct hhook_head *hhh, struct hookinfo *hki)
192{
193 struct hhook *tmp;
194
195 if (hhh == NULL)
196 return (ENOENT);
197
198 HHH_WLOCK(hhh);
199 STAILQ_FOREACH(tmp, &hhh->hhh_hooks, hhk_next) {
200 if (tmp->hhk_func == hki->hook_func &&
201 tmp->hhk_udata == hki->hook_udata) {
202 STAILQ_REMOVE(&hhh->hhh_hooks, tmp, hhook, hhk_next);
203 free(tmp, M_HHOOK);
204 hhh->hhh_nhooks--;
205 break;
206 }
207 }
208 HHH_WUNLOCK(hhh);
209
210 return (0);
211}
212
213/*
214 * Lookup a helper hook point and remove a helper hook function from it.
215 */
216int
217hhook_remove_hook_lookup(struct hookinfo *hki)
218{
219 struct hhook_head *hhh;
220
221 hhh = hhook_head_get(hki->hook_type, hki->hook_id);
222
223 if (hhh == NULL)
224 return (ENOENT);
225
226 hhook_remove_hook(hhh, hki);
227 hhook_head_release(hhh);
228
229 return (0);
230}
231
232/*
233 * Register a new helper hook point.
234 */
235int
236hhook_head_register(int32_t hhook_type, int32_t hhook_id, struct hhook_head **hhh,
237 uint32_t flags)
238{
239 struct hhook_head *tmphhh;
240
241 tmphhh = hhook_head_get(hhook_type, hhook_id);
242
243 if (tmphhh != NULL) {
244 /* Hook point previously registered. */
245 hhook_head_release(tmphhh);
246 return (EEXIST);
247 }
248
249 /* XXXLAS: Need to implement support for non-virtualised hooks. */
250 if ((flags & HHOOK_HEADISINVNET) == 0) {
251 printf("%s: only vnet-style virtualised hooks can be used\n",
252 __func__);
253 return (EINVAL);
254 }
255
256 tmphhh = malloc(sizeof(struct hhook_head), M_HHOOK,
257 M_ZERO | ((flags & HHOOK_WAITOK) ? M_WAITOK : M_NOWAIT));
258
259 if (tmphhh == NULL)
260 return (ENOMEM);
261
262 tmphhh->hhh_type = hhook_type;
263 tmphhh->hhh_id = hhook_id;
264 tmphhh->hhh_nhooks = 0;
265 STAILQ_INIT(&tmphhh->hhh_hooks);
266 HHH_LOCK_INIT(tmphhh);
267
268 if (hhh != NULL)
269 refcount_init(&tmphhh->hhh_refcount, 1);
270 else
271 refcount_init(&tmphhh->hhh_refcount, 0);
272
273 if (flags & HHOOK_HEADISINVNET) {
274 tmphhh->hhh_flags |= HHH_ISINVNET;
275 HHHLIST_LOCK();
276 LIST_INSERT_HEAD(&V_hhook_head_list, tmphhh, hhh_next);
277 HHHLIST_UNLOCK();
278 } else {
279 /* XXXLAS: Add tmphhh to the non-virtualised list. */
280 }
281
282 *hhh = tmphhh;
283
284 return (0);
285}
286
287static void
288hhook_head_destroy(struct hhook_head *hhh)
289{
290 struct hhook *tmp, *tmp2;
291
292 HHHLIST_LOCK_ASSERT();
293
294 LIST_REMOVE(hhh, hhh_next);
295 HHH_WLOCK(hhh);
296 STAILQ_FOREACH_SAFE(tmp, &hhh->hhh_hooks, hhk_next, tmp2)
297 free(tmp, M_HHOOK);
298 HHH_WUNLOCK(hhh);
299 HHH_LOCK_DESTROY(hhh);
300 free(hhh, M_HHOOK);
301}
302
303/*
304 * Remove a helper hook point.
305 */
306int
307hhook_head_deregister(struct hhook_head *hhh)
308{
309 int error;
310
311 error = 0;
312
313 HHHLIST_LOCK();
314 if (hhh == NULL)
315 error = ENOENT;
316 else if (hhh->hhh_refcount > 1)
317 error = EBUSY;
318 else
319 hhook_head_destroy(hhh);
320 HHHLIST_UNLOCK();
321
322 return (error);
323}
324
325/*
326 * Remove a helper hook point via a hhook_head lookup.
327 */
328int
329hhook_head_deregister_lookup(int32_t hhook_type, int32_t hhook_id)
330{
331 struct hhook_head *hhh;
332 int error;
333
334 hhh = hhook_head_get(hhook_type, hhook_id);
335 error = hhook_head_deregister(hhh);
336
337 if (error == EBUSY)
338 hhook_head_release(hhh);
339
340 return (error);
341}
342
343/*
344 * Lookup and return the hhook_head struct associated with the specified type
345 * and id, or NULL if not found. If found, the hhook_head's refcount is bumped.
346 */
347struct hhook_head *
348hhook_head_get(int32_t hhook_type, int32_t hhook_id)
349{
350 struct hhook_head *hhh;
351
352 /* XXXLAS: Pick hhook_head_list based on hhook_head flags. */
353 HHHLIST_LOCK();
354 LIST_FOREACH(hhh, &V_hhook_head_list, hhh_next) {
355 if (hhh->hhh_type == hhook_type && hhh->hhh_id == hhook_id) {
356 refcount_acquire(&hhh->hhh_refcount);
357 break;
358 }
359 }
360 HHHLIST_UNLOCK();
361
362 return (hhh);
363}
364
365void
366hhook_head_release(struct hhook_head *hhh)
367{
368
369 refcount_release(&hhh->hhh_refcount);
370}
371
372/*
373 * Check the hhook_head private flags and return the appropriate public
374 * representation of the flag to the caller. The function is implemented in a
375 * way that allows us to cope with other subsystems becoming virtualised in the
376 * future.
377 */
378uint32_t
379hhook_head_is_virtualised(struct hhook_head *hhh)
380{
381 uint32_t ret;
382
383 ret = 0;
384
385 if (hhh != NULL) {
386 if (hhh->hhh_flags & HHH_ISINVNET)
387 ret = HHOOK_HEADISINVNET;
388 }
389
390 return (ret);
391}
392
393uint32_t
394hhook_head_is_virtualised_lookup(int32_t hook_type, int32_t hook_id)
395{
396 struct hhook_head *hhh;
397 uint32_t ret;
398
399 hhh = hhook_head_get(hook_type, hook_id);
400
401 if (hhh == NULL)
402 return (0);
403
404 ret = hhook_head_is_virtualised(hhh);
405 hhook_head_release(hhh);
406
407 return (ret);
408}
409
410/*
411 * Vnet created and being initialised.
412 */
413static void
414hhook_vnet_init(const void *unused __unused)
415{
416
417 LIST_INIT(&V_hhook_head_list);
418}
419
420/*
421 * Vnet being torn down and destroyed.
422 */
423static void
424hhook_vnet_uninit(const void *unused __unused)
425{
426 struct hhook_head *hhh, *tmphhh;
427
428 /*
429 * If subsystems which export helper hook points use the hhook KPI
430 * correctly, the loop below should have no work to do because the
431 * subsystem should have already called hhook_head_deregister().
432 */
433 HHHLIST_LOCK();
434 LIST_FOREACH_SAFE(hhh, &V_hhook_head_list, hhh_next, tmphhh) {
435 printf("%s: hhook_head type=%d, id=%d cleanup required\n",
436 __func__, hhh->hhh_type, hhh->hhh_id);
437 hhook_head_destroy(hhh);
438 }
439 HHHLIST_UNLOCK();
440}
441
442
443/*
444 * When a vnet is created and being initialised, init the V_hhook_head_list.
445 */
446VNET_SYSINIT(hhook_vnet_init, SI_SUB_PROTO_BEGIN, SI_ORDER_FIRST,
447 hhook_vnet_init, NULL);
448
449/*
450 * The hhook KPI provides a mechanism for subsystems which export helper hook
451 * points to clean up on vnet tear down, but in case the KPI is misused,
452 * provide a function to clean up and free memory for a vnet being destroyed.
453 */
454VNET_SYSUNINIT(hhook_vnet_uninit, SI_SUB_PROTO_BEGIN, SI_ORDER_FIRST,
455 hhook_vnet_uninit, NULL);
| 62
63LIST_HEAD(hhookheadhead, hhook_head);
64VNET_DEFINE(struct hhookheadhead, hhook_head_list);
65#define V_hhook_head_list VNET(hhook_head_list)
66
67static struct mtx hhook_head_list_lock;
68MTX_SYSINIT(hhookheadlistlock, &hhook_head_list_lock, "hhook_head list lock",
69 MTX_DEF);
70
71/* Private function prototypes. */
72static void hhook_head_destroy(struct hhook_head *hhh);
73
74#define HHHLIST_LOCK() mtx_lock(&hhook_head_list_lock)
75#define HHHLIST_UNLOCK() mtx_unlock(&hhook_head_list_lock)
76#define HHHLIST_LOCK_ASSERT() mtx_assert(&hhook_head_list_lock, MA_OWNED)
77
78#define HHH_LOCK_INIT(hhh) rm_init(&(hhh)->hhh_lock, "hhook_head rm lock")
79#define HHH_LOCK_DESTROY(hhh) rm_destroy(&(hhh)->hhh_lock)
80#define HHH_WLOCK(hhh) rm_wlock(&(hhh)->hhh_lock)
81#define HHH_WUNLOCK(hhh) rm_wunlock(&(hhh)->hhh_lock)
82#define HHH_RLOCK(hhh, rmpt) rm_rlock(&(hhh)->hhh_lock, (rmpt))
83#define HHH_RUNLOCK(hhh, rmpt) rm_runlock(&(hhh)->hhh_lock, (rmpt))
84
85/*
86 * Run all helper hook functions for a given hook point.
87 */
88void
89hhook_run_hooks(struct hhook_head *hhh, void *ctx_data, struct osd *hosd)
90{
91 struct hhook *hhk;
92 void *hdata;
93 struct rm_priotracker rmpt;
94
95 KASSERT(hhh->hhh_refcount > 0, ("hhook_head %p refcount is 0", hhh));
96
97 HHH_RLOCK(hhh, &rmpt);
98 STAILQ_FOREACH(hhk, &hhh->hhh_hooks, hhk_next) {
99 if (hhk->hhk_helper->h_flags & HELPER_NEEDS_OSD) {
100 hdata = osd_get(OSD_KHELP, hosd, hhk->hhk_helper->h_id);
101 if (hdata == NULL)
102 continue;
103 } else
104 hdata = NULL;
105
106 /*
107 * XXXLAS: We currently ignore the int returned by the hook,
108 * but will likely want to handle it in future to allow hhook to
109 * be used like pfil and effect changes at the hhook calling
110 * site e.g. we could define a new hook type of HHOOK_TYPE_PFIL
111 * and standardise what particular return values mean and set
112 * the context data to pass exactly the same information as pfil
113 * hooks currently receive, thus replicating pfil with hhook.
114 */
115 hhk->hhk_func(hhh->hhh_type, hhh->hhh_id, hhk->hhk_udata,
116 ctx_data, hdata, hosd);
117 }
118 HHH_RUNLOCK(hhh, &rmpt);
119}
120
121/*
122 * Register a new helper hook function with a helper hook point.
123 */
124int
125hhook_add_hook(struct hhook_head *hhh, struct hookinfo *hki, uint32_t flags)
126{
127 struct hhook *hhk, *tmp;
128 int error;
129
130 error = 0;
131
132 if (hhh == NULL)
133 return (ENOENT);
134
135 hhk = malloc(sizeof(struct hhook), M_HHOOK,
136 M_ZERO | ((flags & HHOOK_WAITOK) ? M_WAITOK : M_NOWAIT));
137
138 if (hhk == NULL)
139 return (ENOMEM);
140
141 hhk->hhk_helper = hki->hook_helper;
142 hhk->hhk_func = hki->hook_func;
143 hhk->hhk_udata = hki->hook_udata;
144
145 HHH_WLOCK(hhh);
146 STAILQ_FOREACH(tmp, &hhh->hhh_hooks, hhk_next) {
147 if (tmp->hhk_func == hki->hook_func &&
148 tmp->hhk_udata == hki->hook_udata) {
149 /* The helper hook function is already registered. */
150 error = EEXIST;
151 break;
152 }
153 }
154
155 if (!error) {
156 STAILQ_INSERT_TAIL(&hhh->hhh_hooks, hhk, hhk_next);
157 hhh->hhh_nhooks++;
158 } else
159 free(hhk, M_HHOOK);
160
161 HHH_WUNLOCK(hhh);
162
163 return (error);
164}
165
166/*
167 * Lookup a helper hook point and register a new helper hook function with it.
168 */
169int
170hhook_add_hook_lookup(struct hookinfo *hki, uint32_t flags)
171{
172 struct hhook_head *hhh;
173 int error;
174
175 hhh = hhook_head_get(hki->hook_type, hki->hook_id);
176
177 if (hhh == NULL)
178 return (ENOENT);
179
180 error = hhook_add_hook(hhh, hki, flags);
181 hhook_head_release(hhh);
182
183 return (error);
184}
185
186/*
187 * Remove a helper hook function from a helper hook point.
188 */
189int
190hhook_remove_hook(struct hhook_head *hhh, struct hookinfo *hki)
191{
192 struct hhook *tmp;
193
194 if (hhh == NULL)
195 return (ENOENT);
196
197 HHH_WLOCK(hhh);
198 STAILQ_FOREACH(tmp, &hhh->hhh_hooks, hhk_next) {
199 if (tmp->hhk_func == hki->hook_func &&
200 tmp->hhk_udata == hki->hook_udata) {
201 STAILQ_REMOVE(&hhh->hhh_hooks, tmp, hhook, hhk_next);
202 free(tmp, M_HHOOK);
203 hhh->hhh_nhooks--;
204 break;
205 }
206 }
207 HHH_WUNLOCK(hhh);
208
209 return (0);
210}
211
212/*
213 * Lookup a helper hook point and remove a helper hook function from it.
214 */
215int
216hhook_remove_hook_lookup(struct hookinfo *hki)
217{
218 struct hhook_head *hhh;
219
220 hhh = hhook_head_get(hki->hook_type, hki->hook_id);
221
222 if (hhh == NULL)
223 return (ENOENT);
224
225 hhook_remove_hook(hhh, hki);
226 hhook_head_release(hhh);
227
228 return (0);
229}
230
231/*
232 * Register a new helper hook point.
233 */
234int
235hhook_head_register(int32_t hhook_type, int32_t hhook_id, struct hhook_head **hhh,
236 uint32_t flags)
237{
238 struct hhook_head *tmphhh;
239
240 tmphhh = hhook_head_get(hhook_type, hhook_id);
241
242 if (tmphhh != NULL) {
243 /* Hook point previously registered. */
244 hhook_head_release(tmphhh);
245 return (EEXIST);
246 }
247
248 /* XXXLAS: Need to implement support for non-virtualised hooks. */
249 if ((flags & HHOOK_HEADISINVNET) == 0) {
250 printf("%s: only vnet-style virtualised hooks can be used\n",
251 __func__);
252 return (EINVAL);
253 }
254
255 tmphhh = malloc(sizeof(struct hhook_head), M_HHOOK,
256 M_ZERO | ((flags & HHOOK_WAITOK) ? M_WAITOK : M_NOWAIT));
257
258 if (tmphhh == NULL)
259 return (ENOMEM);
260
261 tmphhh->hhh_type = hhook_type;
262 tmphhh->hhh_id = hhook_id;
263 tmphhh->hhh_nhooks = 0;
264 STAILQ_INIT(&tmphhh->hhh_hooks);
265 HHH_LOCK_INIT(tmphhh);
266
267 if (hhh != NULL)
268 refcount_init(&tmphhh->hhh_refcount, 1);
269 else
270 refcount_init(&tmphhh->hhh_refcount, 0);
271
272 if (flags & HHOOK_HEADISINVNET) {
273 tmphhh->hhh_flags |= HHH_ISINVNET;
274 HHHLIST_LOCK();
275 LIST_INSERT_HEAD(&V_hhook_head_list, tmphhh, hhh_next);
276 HHHLIST_UNLOCK();
277 } else {
278 /* XXXLAS: Add tmphhh to the non-virtualised list. */
279 }
280
281 *hhh = tmphhh;
282
283 return (0);
284}
285
286static void
287hhook_head_destroy(struct hhook_head *hhh)
288{
289 struct hhook *tmp, *tmp2;
290
291 HHHLIST_LOCK_ASSERT();
292
293 LIST_REMOVE(hhh, hhh_next);
294 HHH_WLOCK(hhh);
295 STAILQ_FOREACH_SAFE(tmp, &hhh->hhh_hooks, hhk_next, tmp2)
296 free(tmp, M_HHOOK);
297 HHH_WUNLOCK(hhh);
298 HHH_LOCK_DESTROY(hhh);
299 free(hhh, M_HHOOK);
300}
301
302/*
303 * Remove a helper hook point.
304 */
305int
306hhook_head_deregister(struct hhook_head *hhh)
307{
308 int error;
309
310 error = 0;
311
312 HHHLIST_LOCK();
313 if (hhh == NULL)
314 error = ENOENT;
315 else if (hhh->hhh_refcount > 1)
316 error = EBUSY;
317 else
318 hhook_head_destroy(hhh);
319 HHHLIST_UNLOCK();
320
321 return (error);
322}
323
324/*
325 * Remove a helper hook point via a hhook_head lookup.
326 */
327int
328hhook_head_deregister_lookup(int32_t hhook_type, int32_t hhook_id)
329{
330 struct hhook_head *hhh;
331 int error;
332
333 hhh = hhook_head_get(hhook_type, hhook_id);
334 error = hhook_head_deregister(hhh);
335
336 if (error == EBUSY)
337 hhook_head_release(hhh);
338
339 return (error);
340}
341
342/*
343 * Lookup and return the hhook_head struct associated with the specified type
344 * and id, or NULL if not found. If found, the hhook_head's refcount is bumped.
345 */
346struct hhook_head *
347hhook_head_get(int32_t hhook_type, int32_t hhook_id)
348{
349 struct hhook_head *hhh;
350
351 /* XXXLAS: Pick hhook_head_list based on hhook_head flags. */
352 HHHLIST_LOCK();
353 LIST_FOREACH(hhh, &V_hhook_head_list, hhh_next) {
354 if (hhh->hhh_type == hhook_type && hhh->hhh_id == hhook_id) {
355 refcount_acquire(&hhh->hhh_refcount);
356 break;
357 }
358 }
359 HHHLIST_UNLOCK();
360
361 return (hhh);
362}
363
364void
365hhook_head_release(struct hhook_head *hhh)
366{
367
368 refcount_release(&hhh->hhh_refcount);
369}
370
371/*
372 * Check the hhook_head private flags and return the appropriate public
373 * representation of the flag to the caller. The function is implemented in a
374 * way that allows us to cope with other subsystems becoming virtualised in the
375 * future.
376 */
377uint32_t
378hhook_head_is_virtualised(struct hhook_head *hhh)
379{
380 uint32_t ret;
381
382 ret = 0;
383
384 if (hhh != NULL) {
385 if (hhh->hhh_flags & HHH_ISINVNET)
386 ret = HHOOK_HEADISINVNET;
387 }
388
389 return (ret);
390}
391
392uint32_t
393hhook_head_is_virtualised_lookup(int32_t hook_type, int32_t hook_id)
394{
395 struct hhook_head *hhh;
396 uint32_t ret;
397
398 hhh = hhook_head_get(hook_type, hook_id);
399
400 if (hhh == NULL)
401 return (0);
402
403 ret = hhook_head_is_virtualised(hhh);
404 hhook_head_release(hhh);
405
406 return (ret);
407}
408
409/*
410 * Vnet created and being initialised.
411 */
412static void
413hhook_vnet_init(const void *unused __unused)
414{
415
416 LIST_INIT(&V_hhook_head_list);
417}
418
419/*
420 * Vnet being torn down and destroyed.
421 */
422static void
423hhook_vnet_uninit(const void *unused __unused)
424{
425 struct hhook_head *hhh, *tmphhh;
426
427 /*
428 * If subsystems which export helper hook points use the hhook KPI
429 * correctly, the loop below should have no work to do because the
430 * subsystem should have already called hhook_head_deregister().
431 */
432 HHHLIST_LOCK();
433 LIST_FOREACH_SAFE(hhh, &V_hhook_head_list, hhh_next, tmphhh) {
434 printf("%s: hhook_head type=%d, id=%d cleanup required\n",
435 __func__, hhh->hhh_type, hhh->hhh_id);
436 hhook_head_destroy(hhh);
437 }
438 HHHLIST_UNLOCK();
439}
440
441
442/*
443 * When a vnet is created and being initialised, init the V_hhook_head_list.
444 */
445VNET_SYSINIT(hhook_vnet_init, SI_SUB_PROTO_BEGIN, SI_ORDER_FIRST,
446 hhook_vnet_init, NULL);
447
448/*
449 * The hhook KPI provides a mechanism for subsystems which export helper hook
450 * points to clean up on vnet tear down, but in case the KPI is misused,
451 * provide a function to clean up and free memory for a vnet being destroyed.
452 */
453VNET_SYSUNINIT(hhook_vnet_uninit, SI_SUB_PROTO_BEGIN, SI_ORDER_FIRST,
454 hhook_vnet_uninit, NULL);
|