2 * Copyright (c) 1999 Michael Smith <msmith@freebsd.org>
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
27 #include <sys/cdefs.h>
28 __FBSDID("$FreeBSD$");
30 #include <sys/param.h>
31 #include <sys/kernel.h>
33 #include <sys/malloc.h>
34 #include <sys/mutex.h>
36 #include <sys/systm.h>
37 #include <sys/eventhandler.h>
39 static MALLOC_DEFINE(M_EVENTHANDLER
, "eventhandler", "Event handler records");
41 /* List of 'slow' lists */
42 static TAILQ_HEAD(, eventhandler_list
) eventhandler_lists
;
43 static int eventhandler_lists_initted
= 0;
44 static struct mtx eventhandler_mutex
;
46 struct eventhandler_entry_generic
48 struct eventhandler_entry ee
;
52 static struct eventhandler_list
*_eventhandler_find_list(const char *name
);
55 * Initialize the eventhandler mutex and list.
58 eventhandler_init(void *dummy __unused
)
60 TAILQ_INIT(&eventhandler_lists
);
61 mtx_init(&eventhandler_mutex
, "eventhandler", NULL
, MTX_DEF
);
62 atomic_store_rel_int(&eventhandler_lists_initted
, 1);
64 SYSINIT(eventhandlers
, SI_SUB_EVENTHANDLER
, SI_ORDER_FIRST
, eventhandler_init
,
68 * Insertion is O(n) due to the priority scan, but optimises to O(1)
69 * if all priorities are identical.
72 eventhandler_register(struct eventhandler_list
*list
, const char *name
,
73 void *func
, void *arg
, int priority
)
75 struct eventhandler_list
*new_list
;
76 struct eventhandler_entry_generic
*eg
;
77 struct eventhandler_entry
*ep
;
79 KASSERT(eventhandler_lists_initted
, ("eventhandler registered too early"));
81 /* lock the eventhandler lists */
82 mtx_lock(&eventhandler_mutex
);
84 /* Do we need to find/create the (slow) list? */
86 /* look for a matching, existing list */
87 list
= _eventhandler_find_list(name
);
89 /* Do we need to create the list? */
91 mtx_unlock(&eventhandler_mutex
);
93 new_list
= malloc(sizeof(struct eventhandler_list
) +
94 strlen(name
) + 1, M_EVENTHANDLER
, M_WAITOK
);
96 /* If someone else created it already, then use that one. */
97 mtx_lock(&eventhandler_mutex
);
98 list
= _eventhandler_find_list(name
);
100 free(new_list
, M_EVENTHANDLER
);
102 CTR2(KTR_EVH
, "%s: creating list \"%s\"", __func__
, name
);
105 list
->el_runcount
= 0;
106 bzero(&list
->el_lock
, sizeof(list
->el_lock
));
107 list
->el_name
= (char *)list
+ sizeof(struct eventhandler_list
);
108 strcpy(list
->el_name
, name
);
109 TAILQ_INSERT_HEAD(&eventhandler_lists
, list
, el_link
);
113 if (!(list
->el_flags
& EHL_INITTED
)) {
114 TAILQ_INIT(&list
->el_entries
);
115 mtx_init(&list
->el_lock
, name
, "eventhandler list", MTX_DEF
);
116 atomic_store_rel_int(&list
->el_flags
, EHL_INITTED
);
118 mtx_unlock(&eventhandler_mutex
);
120 /* allocate an entry for this handler, populate it */
121 eg
= malloc(sizeof(struct eventhandler_entry_generic
), M_EVENTHANDLER
,
125 eg
->ee
.ee_priority
= priority
;
126 KASSERT(priority
!= EHE_DEAD_PRIORITY
,
127 ("%s: handler for %s registered with dead priority", __func__
, name
));
129 /* sort it into the list */
130 CTR4(KTR_EVH
, "%s: adding item %p (function %p) to \"%s\"", __func__
, eg
,
133 TAILQ_FOREACH(ep
, &list
->el_entries
, ee_link
) {
134 if (ep
->ee_priority
!= EHE_DEAD_PRIORITY
&&
135 eg
->ee
.ee_priority
< ep
->ee_priority
) {
136 TAILQ_INSERT_BEFORE(ep
, &eg
->ee
, ee_link
);
141 TAILQ_INSERT_TAIL(&list
->el_entries
, &eg
->ee
, ee_link
);
147 eventhandler_deregister(struct eventhandler_list
*list
, eventhandler_tag tag
)
149 struct eventhandler_entry
*ep
= tag
;
151 EHL_LOCK_ASSERT(list
, MA_OWNED
);
153 /* remove just this entry */
154 if (list
->el_runcount
== 0) {
155 CTR3(KTR_EVH
, "%s: removing item %p from \"%s\"", __func__
, ep
,
157 TAILQ_REMOVE(&list
->el_entries
, ep
, ee_link
);
158 free(ep
, M_EVENTHANDLER
);
160 CTR3(KTR_EVH
, "%s: marking item %p from \"%s\" as dead", __func__
,
162 ep
->ee_priority
= EHE_DEAD_PRIORITY
;
165 /* remove entire list */
166 if (list
->el_runcount
== 0) {
167 CTR2(KTR_EVH
, "%s: removing all items from \"%s\"", __func__
,
169 while (!TAILQ_EMPTY(&list
->el_entries
)) {
170 ep
= TAILQ_FIRST(&list
->el_entries
);
171 TAILQ_REMOVE(&list
->el_entries
, ep
, ee_link
);
172 free(ep
, M_EVENTHANDLER
);
175 CTR2(KTR_EVH
, "%s: marking all items from \"%s\" as dead",
176 __func__
, list
->el_name
);
177 TAILQ_FOREACH(ep
, &list
->el_entries
, ee_link
)
178 ep
->ee_priority
= EHE_DEAD_PRIORITY
;
185 * Internal version for use when eventhandler list is already locked.
187 static struct eventhandler_list
*
188 _eventhandler_find_list(const char *name
)
190 struct eventhandler_list
*list
;
192 mtx_assert(&eventhandler_mutex
, MA_OWNED
);
193 TAILQ_FOREACH(list
, &eventhandler_lists
, el_link
) {
194 if (!strcmp(name
, list
->el_name
))
201 * Lookup a "slow" list by name. Returns with the list locked.
203 struct eventhandler_list
*
204 eventhandler_find_list(const char *name
)
206 struct eventhandler_list
*list
;
208 if (!eventhandler_lists_initted
)
211 /* scan looking for the requested list */
212 mtx_lock(&eventhandler_mutex
);
213 list
= _eventhandler_find_list(name
);
216 mtx_unlock(&eventhandler_mutex
);
222 * Prune "dead" entries from an eventhandler list.
225 eventhandler_prune_list(struct eventhandler_list
*list
)
227 struct eventhandler_entry
*ep
, *en
;
229 CTR2(KTR_EVH
, "%s: pruning list \"%s\"", __func__
, list
->el_name
);
230 EHL_LOCK_ASSERT(list
, MA_OWNED
);
231 ep
= TAILQ_FIRST(&list
->el_entries
);
233 en
= TAILQ_NEXT(ep
, ee_link
);
234 if (ep
->ee_priority
== EHE_DEAD_PRIORITY
) {
235 TAILQ_REMOVE(&list
->el_entries
, ep
, ee_link
);
236 free(ep
, M_EVENTHANDLER
);