2 * SPDX-License-Identifier: BSD-3-Clause
4 * Copyright (c) 2002 Poul-Henning Kamp
5 * Copyright (c) 2002 Networks Associates Technology, Inc.
8 * This software was developed for the FreeBSD Project by Poul-Henning Kamp
9 * and NAI Labs, the Security Research Division of Network Associates, Inc.
10 * under DARPA/SPAWAR contract N66001-01-C-8035 ("CBOSS"), as part of the
11 * DARPA CHATS research program.
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. The names of the authors may not be used to endorse or promote
22 * products derived from this software without specific prior written
25 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 * XXX: How do we in general know that objects referenced in events
40 * have not been destroyed before we get around to handle the event ?
43 #include <sys/cdefs.h>
44 __FBSDID("$FreeBSD$");
46 #include <sys/param.h>
47 #include <sys/malloc.h>
48 #include <sys/systm.h>
49 #include <sys/kernel.h>
51 #include <sys/mutex.h>
53 #include <sys/errno.h>
55 #include <geom/geom.h>
56 #include <geom/geom_int.h>
58 #include <machine/stdarg.h>
60 TAILQ_HEAD(event_tailq_head, g_event);
62 static struct event_tailq_head g_events = TAILQ_HEAD_INITIALIZER(g_events);
63 static u_int g_pending_events;
64 static TAILQ_HEAD(,g_provider) g_doorstep = TAILQ_HEAD_INITIALIZER(g_doorstep);
65 static struct mtx g_eventlock;
66 static int g_wither_work;
68 #define G_N_EVENTREFS 20
71 TAILQ_ENTRY(g_event) events;
75 void *ref[G_N_EVENTREFS];
78 #define EV_DONE 0x80000
79 #define EV_WAKEUP 0x40000
80 #define EV_CANCELED 0x20000
81 #define EV_INPROGRESS 0x10000
84 g_waitidle(struct thread *td)
87 g_topology_assert_not();
89 mtx_lock(&g_eventlock);
90 TSWAIT("GEOM events");
91 while (!TAILQ_EMPTY(&g_events))
92 msleep(&g_pending_events, &g_eventlock, PPAUSE,
94 TSUNWAIT("GEOM events");
95 mtx_unlock(&g_eventlock);
96 td->td_pflags &= ~TDP_GEOM;
100 ast_geom(struct thread *td, int tda __unused)
103 * If this thread tickled GEOM, we need to wait for the giggling to
104 * stop before we return to userland.
110 geom_event_init(void *arg __unused)
112 ast_register(TDA_GEOM, ASTR_ASTF_REQUIRED | ASTR_TDP | ASTR_KCLEAR,
115 SYSINIT(geom_event, SI_SUB_INTRINSIC, SI_ORDER_ANY, geom_event_init, NULL);
117 struct g_attrchanged_args {
118 struct g_provider *pp;
123 g_attr_changed_event(void *arg, int flag)
125 struct g_attrchanged_args *args;
126 struct g_provider *pp;
127 struct g_consumer *cp;
128 struct g_consumer *next_cp;
134 if (flag != EV_CANCEL && g_shutdown == 0) {
136 * Tell all consumers of the change.
138 LIST_FOREACH_SAFE(cp, &pp->consumers, consumers, next_cp) {
139 if (cp->geom->attrchanged != NULL)
140 cp->geom->attrchanged(cp, args->attr);
147 g_attr_changed(struct g_provider *pp, const char *attr, int flag)
149 struct g_attrchanged_args *args;
152 args = g_malloc(sizeof *args, flag);
157 error = g_post_event(g_attr_changed_event, args, flag, pp, NULL);
164 g_orphan_provider(struct g_provider *pp, int error)
167 /* G_VALID_PROVIDER(pp) We likely lack topology lock */
168 g_trace(G_T_TOPOLOGY, "g_orphan_provider(%p(%s), %d)",
169 pp, pp->name, error);
171 ("g_orphan_provider(%p(%s), 0) error must be non-zero\n",
175 mtx_lock(&g_eventlock);
176 KASSERT(!(pp->flags & G_PF_ORPHAN),
177 ("g_orphan_provider(%p(%s)), already an orphan", pp, pp->name));
178 pp->flags |= G_PF_ORPHAN;
179 TAILQ_INSERT_TAIL(&g_doorstep, pp, orphan);
180 mtx_unlock(&g_eventlock);
181 wakeup(&g_wait_event);
185 * This function is called once on each provider which the event handler
186 * finds on its g_doorstep.
190 g_orphan_register(struct g_provider *pp)
192 struct g_consumer *cp, *cp2;
196 G_VALID_PROVIDER(pp);
197 g_trace(G_T_TOPOLOGY, "g_orphan_register(%s)", pp->name);
201 wf = pp->flags & G_PF_WITHER;
202 pp->flags &= ~G_PF_WITHER;
205 * Tell all consumers the bad news.
206 * Don't be surprised if they self-destruct.
208 LIST_FOREACH_SAFE(cp, &pp->consumers, consumers, cp2) {
209 KASSERT(cp->geom->orphan != NULL,
210 ("geom %s has no orphan, class %s",
211 cp->geom->name, cp->geom->class->name));
213 * XXX: g_dev_orphan method does deferred destroying
214 * and it is possible, that other event could already
215 * call the orphan method. Check consumer's flags to
216 * do not schedule it twice.
218 if (cp->flags & G_CF_ORPHAN)
220 cp->flags |= G_CF_ORPHAN;
221 cp->geom->orphan(cp);
223 if (LIST_EMPTY(&pp->consumers) && wf)
224 g_destroy_provider(pp);
228 cp = LIST_FIRST(&pp->consumers);
231 if (pp->geom->flags & G_GEOM_WITHER)
232 g_destroy_provider(pp);
240 struct g_provider *pp;
243 mtx_lock(&g_eventlock);
244 pp = TAILQ_FIRST(&g_doorstep);
246 G_VALID_PROVIDER(pp);
247 TAILQ_REMOVE(&g_doorstep, pp, orphan);
248 mtx_unlock(&g_eventlock);
249 g_orphan_register(pp);
253 ep = TAILQ_FIRST(&g_events);
255 wakeup(&g_pending_events);
258 ep->flag |= EV_INPROGRESS;
259 mtx_unlock(&g_eventlock);
261 ep->func(ep->arg, 0);
263 mtx_lock(&g_eventlock);
264 TSRELEASE("GEOM events");
265 TAILQ_REMOVE(&g_events, ep, events);
266 ep->flag &= ~EV_INPROGRESS;
267 if (ep->flag & EV_WAKEUP) {
270 mtx_unlock(&g_eventlock);
272 mtx_unlock(&g_eventlock);
286 mtx_assert(&g_eventlock, MA_OWNED);
289 mtx_unlock(&g_eventlock);
294 msleep(&g_wait_event, &g_eventlock, PRIBIO | PDROP,
302 g_cancel_event(void *ref)
304 struct g_event *ep, *epn;
305 struct g_provider *pp;
308 mtx_lock(&g_eventlock);
309 TAILQ_FOREACH(pp, &g_doorstep, orphan) {
312 TAILQ_REMOVE(&g_doorstep, pp, orphan);
315 TAILQ_FOREACH_SAFE(ep, &g_events, events, epn) {
316 if (ep->flag & EV_INPROGRESS)
318 for (n = 0; n < G_N_EVENTREFS; n++) {
319 if (ep->ref[n] == NULL)
321 if (ep->ref[n] != ref)
323 TSRELEASE("GEOM events");
324 TAILQ_REMOVE(&g_events, ep, events);
325 ep->func(ep->arg, EV_CANCEL);
326 mtx_assert(&g_eventlock, MA_OWNED);
327 if (ep->flag & EV_WAKEUP) {
328 ep->flag |= (EV_DONE|EV_CANCELED);
336 if (TAILQ_EMPTY(&g_events))
337 wakeup(&g_pending_events);
338 mtx_unlock(&g_eventlock);
342 g_alloc_event(int flag)
344 KASSERT(flag == M_WAITOK || flag == M_NOWAIT,
345 ("Wrong flag to g_alloc_event"));
347 return (g_malloc(sizeof(struct g_event), flag | M_ZERO));
351 g_post_event_ep_va(g_event_t *func, void *arg, int wuflag,
352 struct g_event *ep, va_list ap)
358 for (n = 0; n < G_N_EVENTREFS; n++) {
359 p = va_arg(ap, void *);
362 g_trace(G_T_TOPOLOGY, " ref %p", p);
365 KASSERT(p == NULL, ("Too many references to event"));
368 mtx_lock(&g_eventlock);
369 TSHOLD("GEOM events");
370 TAILQ_INSERT_TAIL(&g_events, ep, events);
371 mtx_unlock(&g_eventlock);
372 wakeup(&g_wait_event);
373 curthread->td_pflags |= TDP_GEOM;
374 ast_sched(curthread, TDA_GEOM);
378 g_post_event_ep(g_event_t *func, void *arg, struct g_event *ep, ...)
383 g_post_event_ep_va(func, arg, 0, ep, ap);
389 g_post_event_x(g_event_t *func, void *arg, int flag, int wuflag, struct g_event **epp, va_list ap)
393 g_trace(G_T_TOPOLOGY, "g_post_event_x(%p, %p, %d, %d)",
394 func, arg, flag, wuflag);
395 KASSERT(wuflag == 0 || wuflag == EV_WAKEUP,
396 ("Wrong wuflag in g_post_event_x(0x%x)", wuflag));
397 ep = g_alloc_event(flag);
402 g_post_event_ep_va(func, arg, wuflag, ep, ap);
407 g_post_event(g_event_t *func, void *arg, int flag, ...)
412 KASSERT(flag == M_WAITOK || flag == M_NOWAIT,
413 ("Wrong flag to g_post_event"));
415 i = g_post_event_x(func, arg, flag, 0, NULL, ap);
424 mtx_lock(&g_eventlock);
426 mtx_unlock(&g_eventlock);
427 wakeup(&g_wait_event);
431 * XXX: It might actually be useful to call this function with topology held.
432 * XXX: This would ensure that the event gets created before anything else
433 * XXX: changes. At present all users have a handle on things in some other
434 * XXX: way, so this remains an XXX for now.
438 g_waitfor_event(g_event_t *func, void *arg, int flag, ...)
444 g_topology_assert_not();
445 KASSERT(flag == M_WAITOK || flag == M_NOWAIT,
446 ("Wrong flag to g_post_event"));
448 error = g_post_event_x(func, arg, flag, EV_WAKEUP, &ep, ap);
453 mtx_lock(&g_eventlock);
454 while (!(ep->flag & EV_DONE))
455 msleep(ep, &g_eventlock, PRIBIO, "g_waitfor_event", 0);
456 if (ep->flag & EV_CANCELED)
458 mtx_unlock(&g_eventlock);
468 mtx_init(&g_eventlock, "GEOM orphanage", NULL, MTX_DEF);