2 * Copyright (c) 2002 Poul-Henning Kamp
3 * Copyright (c) 2002 Networks Associates Technology, Inc.
6 * This software was developed for the FreeBSD Project by Poul-Henning Kamp
7 * and NAI Labs, the Security Research Division of Network Associates, Inc.
8 * under DARPA/SPAWAR contract N66001-01-C-8035 ("CBOSS"), as part of the
9 * DARPA CHATS research program.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. The names of the authors may not be used to endorse or promote
20 * products derived from this software without specific prior written
23 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 * XXX: How do we in general know that objects referenced in events
38 * have not been destroyed before we get around to handle the event ?
41 #include <sys/cdefs.h>
42 __FBSDID("$FreeBSD$");
44 #include <sys/param.h>
45 #include <sys/malloc.h>
46 #include <sys/systm.h>
47 #include <sys/kernel.h>
49 #include <sys/mutex.h>
51 #include <sys/errno.h>
53 #include <geom/geom.h>
54 #include <geom/geom_int.h>
56 #include <machine/stdarg.h>
58 TAILQ_HEAD(event_tailq_head, g_event);
60 static struct event_tailq_head g_events = TAILQ_HEAD_INITIALIZER(g_events);
61 static u_int g_pending_events;
62 static TAILQ_HEAD(,g_provider) g_doorstep = TAILQ_HEAD_INITIALIZER(g_doorstep);
63 static struct mtx g_eventlock;
64 static int g_wither_work;
66 #define G_N_EVENTREFS 20
69 TAILQ_ENTRY(g_event) events;
73 void *ref[G_N_EVENTREFS];
76 #define EV_DONE 0x80000
77 #define EV_WAKEUP 0x40000
78 #define EV_CANCELED 0x20000
79 #define EV_INPROGRESS 0x10000
85 g_topology_assert_not();
87 mtx_lock(&g_eventlock);
88 while (!TAILQ_EMPTY(&g_events))
89 msleep(&g_pending_events, &g_eventlock, PPAUSE,
91 mtx_unlock(&g_eventlock);
92 curthread->td_pflags &= ~TDP_GEOM;
101 mtx_lock(&g_eventlock);
102 while (!TAILQ_EMPTY(&g_events)) {
104 msleep(&g_pending_events, &g_eventlock, PPAUSE,
105 "g_waitidlel", hz/5);
108 mtx_unlock(&g_eventlock);
112 struct g_attrchanged_args {
113 struct g_provider *pp;
118 g_attr_changed_event(void *arg, int flag)
120 struct g_attrchanged_args *args;
121 struct g_provider *pp;
122 struct g_consumer *cp;
123 struct g_consumer *next_cp;
129 if (flag != EV_CANCEL && g_shutdown == 0) {
132 * Tell all consumers of the change.
134 LIST_FOREACH_SAFE(cp, &pp->consumers, consumers, next_cp) {
135 if (cp->geom->attrchanged != NULL)
136 cp->geom->attrchanged(cp, args->attr);
143 g_attr_changed(struct g_provider *pp, const char *attr, int flag)
145 struct g_attrchanged_args *args;
148 args = g_malloc(sizeof *args, flag);
153 error = g_post_event(g_attr_changed_event, args, flag, pp, NULL);
160 g_orphan_provider(struct g_provider *pp, int error)
163 /* G_VALID_PROVIDER(pp) We likely lack topology lock */
164 g_trace(G_T_TOPOLOGY, "g_orphan_provider(%p(%s), %d)",
165 pp, pp->name, error);
167 ("g_orphan_provider(%p(%s), 0) error must be non-zero\n",
171 mtx_lock(&g_eventlock);
172 KASSERT(!(pp->flags & G_PF_ORPHAN),
173 ("g_orphan_provider(%p(%s)), already an orphan", pp, pp->name));
174 pp->flags |= G_PF_ORPHAN;
175 TAILQ_INSERT_TAIL(&g_doorstep, pp, orphan);
176 mtx_unlock(&g_eventlock);
177 wakeup(&g_wait_event);
181 * This function is called once on each provider which the event handler
182 * finds on its g_doorstep.
186 g_orphan_register(struct g_provider *pp)
188 struct g_consumer *cp, *cp2;
192 G_VALID_PROVIDER(pp);
193 g_trace(G_T_TOPOLOGY, "g_orphan_register(%s)", pp->name);
197 wf = pp->flags & G_PF_WITHER;
198 pp->flags &= ~G_PF_WITHER;
201 * Tell all consumers the bad news.
202 * Don't be surprised if they self-destruct.
204 LIST_FOREACH_SAFE(cp, &pp->consumers, consumers, cp2) {
205 KASSERT(cp->geom->orphan != NULL,
206 ("geom %s has no orphan, class %s",
207 cp->geom->name, cp->geom->class->name));
209 * XXX: g_dev_orphan method does deferred destroying
210 * and it is possible, that other event could already
211 * call the orphan method. Check consumer's flags to
212 * do not schedule it twice.
214 if (cp->flags & G_CF_ORPHAN)
216 cp->flags |= G_CF_ORPHAN;
217 cp->geom->orphan(cp);
219 if (LIST_EMPTY(&pp->consumers) && wf)
220 g_destroy_provider(pp);
224 cp = LIST_FIRST(&pp->consumers);
227 if (pp->geom->flags & G_GEOM_WITHER)
228 g_destroy_provider(pp);
236 struct g_provider *pp;
239 mtx_lock(&g_eventlock);
240 TAILQ_FOREACH(pp, &g_doorstep, orphan) {
241 if (pp->nstart == pp->nend)
245 G_VALID_PROVIDER(pp);
246 TAILQ_REMOVE(&g_doorstep, pp, orphan);
247 mtx_unlock(&g_eventlock);
248 g_orphan_register(pp);
252 ep = TAILQ_FIRST(&g_events);
254 wakeup(&g_pending_events);
257 if (ep->flag & EV_INPROGRESS) {
258 mtx_unlock(&g_eventlock);
261 ep->flag |= EV_INPROGRESS;
262 mtx_unlock(&g_eventlock);
264 ep->func(ep->arg, 0);
266 mtx_lock(&g_eventlock);
267 TAILQ_REMOVE(&g_events, ep, events);
268 ep->flag &= ~EV_INPROGRESS;
269 if (ep->flag & EV_WAKEUP) {
271 mtx_unlock(&g_eventlock);
274 mtx_unlock(&g_eventlock);
288 mtx_assert(&g_eventlock, MA_OWNED);
291 mtx_unlock(&g_eventlock);
296 msleep(&g_wait_event, &g_eventlock, PRIBIO | PDROP,
297 "-", TAILQ_EMPTY(&g_doorstep) ? 0 : hz / 10);
304 g_cancel_event(void *ref)
306 struct g_event *ep, *epn;
307 struct g_provider *pp;
310 mtx_lock(&g_eventlock);
311 TAILQ_FOREACH(pp, &g_doorstep, orphan) {
314 TAILQ_REMOVE(&g_doorstep, pp, orphan);
317 TAILQ_FOREACH_SAFE(ep, &g_events, events, epn) {
318 if (ep->flag & EV_INPROGRESS)
320 for (n = 0; n < G_N_EVENTREFS; n++) {
321 if (ep->ref[n] == NULL)
323 if (ep->ref[n] != ref)
325 TAILQ_REMOVE(&g_events, ep, events);
326 ep->func(ep->arg, EV_CANCEL);
327 mtx_assert(&g_eventlock, MA_OWNED);
328 if (ep->flag & EV_WAKEUP) {
329 ep->flag |= (EV_DONE|EV_CANCELED);
337 if (TAILQ_EMPTY(&g_events))
338 wakeup(&g_pending_events);
339 mtx_unlock(&g_eventlock);
343 g_post_event_x(g_event_t *func, void *arg, int flag, int wuflag, struct g_event **epp, va_list ap)
349 g_trace(G_T_TOPOLOGY, "g_post_event_x(%p, %p, %d, %d)",
350 func, arg, flag, wuflag);
351 KASSERT(wuflag == 0 || wuflag == EV_WAKEUP,
352 ("Wrong wuflag in g_post_event_x(0x%x)", wuflag));
353 ep = g_malloc(sizeof *ep, flag | M_ZERO);
357 for (n = 0; n < G_N_EVENTREFS; n++) {
358 p = va_arg(ap, void *);
361 g_trace(G_T_TOPOLOGY, " ref %p", p);
364 KASSERT(p == NULL, ("Too many references to event"));
367 mtx_lock(&g_eventlock);
368 TAILQ_INSERT_TAIL(&g_events, ep, events);
369 mtx_unlock(&g_eventlock);
370 wakeup(&g_wait_event);
373 curthread->td_pflags |= TDP_GEOM;
378 g_post_event(g_event_t *func, void *arg, int flag, ...)
383 KASSERT(flag == M_WAITOK || flag == M_NOWAIT,
384 ("Wrong flag to g_post_event"));
386 i = g_post_event_x(func, arg, flag, 0, NULL, ap);
395 mtx_lock(&g_eventlock);
397 mtx_unlock(&g_eventlock);
398 wakeup(&g_wait_event);
402 * XXX: It might actually be useful to call this function with topology held.
403 * XXX: This would ensure that the event gets created before anything else
404 * XXX: changes. At present all users have a handle on things in some other
405 * XXX: way, so this remains an XXX for now.
409 g_waitfor_event(g_event_t *func, void *arg, int flag, ...)
415 g_topology_assert_not();
416 KASSERT(flag == M_WAITOK || flag == M_NOWAIT,
417 ("Wrong flag to g_post_event"));
419 error = g_post_event_x(func, arg, flag, EV_WAKEUP, &ep, ap);
424 mtx_lock(&g_eventlock);
425 while (!(ep->flag & EV_DONE))
426 msleep(ep, &g_eventlock, PRIBIO, "g_waitfor_event", hz);
427 if (ep->flag & EV_CANCELED)
429 mtx_unlock(&g_eventlock);
439 mtx_init(&g_eventlock, "GEOM orphanage", NULL, MTX_DEF);