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();
86 mtx_assert(&Giant, MA_NOTOWNED);
88 mtx_lock(&g_eventlock);
89 while (!TAILQ_EMPTY(&g_events))
90 msleep(&g_pending_events, &g_eventlock, PPAUSE,
92 mtx_unlock(&g_eventlock);
93 curthread->td_pflags &= ~TDP_GEOM;
102 mtx_lock(&g_eventlock);
103 while (!TAILQ_EMPTY(&g_events)) {
105 msleep(&g_pending_events, &g_eventlock, PPAUSE,
106 "g_waitidlel", hz/5);
109 mtx_unlock(&g_eventlock);
114 g_orphan_provider(struct g_provider *pp, int error)
117 /* G_VALID_PROVIDER(pp) We likely lack topology lock */
118 g_trace(G_T_TOPOLOGY, "g_orphan_provider(%p(%s), %d)",
119 pp, pp->name, error);
121 ("g_orphan_provider(%p(%s), 0) error must be non-zero\n",
125 mtx_lock(&g_eventlock);
126 KASSERT(!(pp->flags & G_PF_ORPHAN),
127 ("g_orphan_provider(%p(%s)), already an orphan", pp, pp->name));
128 pp->flags |= G_PF_ORPHAN;
129 TAILQ_INSERT_TAIL(&g_doorstep, pp, orphan);
130 mtx_unlock(&g_eventlock);
131 wakeup(&g_wait_event);
135 * This function is called once on each provider which the event handler
136 * finds on its g_doorstep.
140 g_orphan_register(struct g_provider *pp)
142 struct g_consumer *cp, *cp2;
146 G_VALID_PROVIDER(pp);
147 g_trace(G_T_TOPOLOGY, "g_orphan_register(%s)", pp->name);
151 wf = pp->flags & G_PF_WITHER;
152 pp->flags &= ~G_PF_WITHER;
155 * Tell all consumers the bad news.
156 * Don't be surprised if they self-destruct.
158 cp = LIST_FIRST(&pp->consumers);
160 cp2 = LIST_NEXT(cp, consumers);
161 KASSERT(cp->geom->orphan != NULL,
162 ("geom %s has no orphan, class %s",
163 cp->geom->name, cp->geom->class->name));
164 cp->geom->orphan(cp);
167 if (LIST_EMPTY(&pp->consumers) && wf)
168 g_destroy_provider(pp);
172 cp = LIST_FIRST(&pp->consumers);
175 if (pp->geom->flags & G_GEOM_WITHER)
176 g_destroy_provider(pp);
184 struct g_provider *pp;
187 mtx_lock(&g_eventlock);
188 TAILQ_FOREACH(pp, &g_doorstep, orphan) {
189 if (pp->nstart == pp->nend)
193 G_VALID_PROVIDER(pp);
194 TAILQ_REMOVE(&g_doorstep, pp, orphan);
195 mtx_unlock(&g_eventlock);
196 g_orphan_register(pp);
200 ep = TAILQ_FIRST(&g_events);
202 wakeup(&g_pending_events);
205 if (ep->flag & EV_INPROGRESS) {
206 mtx_unlock(&g_eventlock);
209 ep->flag |= EV_INPROGRESS;
210 mtx_unlock(&g_eventlock);
212 ep->func(ep->arg, 0);
214 mtx_lock(&g_eventlock);
215 TAILQ_REMOVE(&g_events, ep, events);
216 ep->flag &= ~EV_INPROGRESS;
217 if (ep->flag & EV_WAKEUP) {
219 mtx_unlock(&g_eventlock);
222 mtx_unlock(&g_eventlock);
237 mtx_assert(&g_eventlock, MA_OWNED);
240 mtx_unlock(&g_eventlock);
242 i = g_wither_washer();
243 g_wither_work = i & 1;
249 msleep(&g_wait_event, &g_eventlock, PRIBIO | PDROP,
250 "-", TAILQ_EMPTY(&g_doorstep) ? 0 : hz / 10);
257 g_cancel_event(void *ref)
259 struct g_event *ep, *epn;
260 struct g_provider *pp;
263 mtx_lock(&g_eventlock);
264 TAILQ_FOREACH(pp, &g_doorstep, orphan) {
267 TAILQ_REMOVE(&g_doorstep, pp, orphan);
270 TAILQ_FOREACH_SAFE(ep, &g_events, events, epn) {
271 if (ep->flag & EV_INPROGRESS)
273 for (n = 0; n < G_N_EVENTREFS; n++) {
274 if (ep->ref[n] == NULL)
276 if (ep->ref[n] != ref)
278 TAILQ_REMOVE(&g_events, ep, events);
279 ep->func(ep->arg, EV_CANCEL);
280 mtx_assert(&g_eventlock, MA_OWNED);
281 if (ep->flag & EV_WAKEUP) {
282 ep->flag |= (EV_DONE|EV_CANCELED);
290 if (TAILQ_EMPTY(&g_events))
291 wakeup(&g_pending_events);
292 mtx_unlock(&g_eventlock);
296 g_post_event_x(g_event_t *func, void *arg, int flag, int wuflag, struct g_event **epp, va_list ap)
302 g_trace(G_T_TOPOLOGY, "g_post_event_x(%p, %p, %d, %d)",
303 func, arg, flag, wuflag);
304 KASSERT(wuflag == 0 || wuflag == EV_WAKEUP,
305 ("Wrong wuflag in g_post_event_x(0x%x)", wuflag));
306 ep = g_malloc(sizeof *ep, flag | M_ZERO);
310 for (n = 0; n < G_N_EVENTREFS; n++) {
311 p = va_arg(ap, void *);
314 g_trace(G_T_TOPOLOGY, " ref %p", p);
317 KASSERT(p == NULL, ("Too many references to event"));
320 mtx_lock(&g_eventlock);
321 TAILQ_INSERT_TAIL(&g_events, ep, events);
322 mtx_unlock(&g_eventlock);
323 wakeup(&g_wait_event);
326 curthread->td_pflags |= TDP_GEOM;
331 g_post_event(g_event_t *func, void *arg, int flag, ...)
336 KASSERT(flag == M_WAITOK || flag == M_NOWAIT,
337 ("Wrong flag to g_post_event"));
339 i = g_post_event_x(func, arg, flag, 0, NULL, ap);
348 mtx_lock(&g_eventlock);
350 mtx_unlock(&g_eventlock);
351 wakeup(&g_wait_event);
355 * XXX: It might actually be useful to call this function with topology held.
356 * XXX: This would ensure that the event gets created before anything else
357 * XXX: changes. At present all users have a handle on things in some other
358 * XXX: way, so this remains an XXX for now.
362 g_waitfor_event(g_event_t *func, void *arg, int flag, ...)
368 g_topology_assert_not();
369 KASSERT(flag == M_WAITOK || flag == M_NOWAIT,
370 ("Wrong flag to g_post_event"));
372 error = g_post_event_x(func, arg, flag, EV_WAKEUP, &ep, ap);
377 mtx_lock(&g_eventlock);
378 while (!(ep->flag & EV_DONE))
379 msleep(ep, &g_eventlock, PRIBIO, "g_waitfor_event", hz);
380 if (ep->flag & EV_CANCELED)
382 mtx_unlock(&g_eventlock);
392 mtx_init(&g_eventlock, "GEOM orphanage", NULL, MTX_DEF);