1 /* $NetBSD: dm_target.c,v 1.12 2010/01/04 00:14:41 haad Exp $ */
4 * Copyright (c) 2008 The NetBSD Foundation, Inc.
7 * This code is derived from software contributed to The NetBSD Foundation
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code Must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
19 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 * POSSIBILITY OF SUCH DAMAGE.
32 #include <sys/types.h>
33 #include <sys/param.h>
35 #include <sys/malloc.h>
36 #include <sys/module.h>
39 #include "netbsd-dm.h"
42 static dm_target_t *dm_target_lookup_name(const char *);
44 TAILQ_HEAD(dm_target_head, dm_target);
46 static struct dm_target_head dm_target_list =
47 TAILQ_HEAD_INITIALIZER(dm_target_list);
51 struct lock dm_target_mutex;
54 * Called indirectly from dm_table_load_ioctl to mark target as used.
57 dm_target_busy(dm_target_t * target)
59 atomic_add_int(&target->ref_cnt, 1);
62 * Release reference counter on target.
65 dm_target_unbusy(dm_target_t * target)
67 KKASSERT(target->ref_cnt > 0);
68 atomic_subtract_int(&target->ref_cnt, 1);
71 * Try to autoload target module if it was not found in current
75 dm_target_autoload(const char *dm_target_name)
82 ksnprintf(name, sizeof(name), "dm_target_%s", dm_target_name);
88 /* Try to autoload target module */
89 lockmgr(&module_lock, LK_EXCLUSIVE);
90 (void) module_autoload(name, MODULE_CLASS_MISC);
91 lockmgr(&module_lock, LK_RELEASE);
92 } while (gen != module_gen);
94 lockmgr(&dm_target_mutex, LK_EXCLUSIVE);
95 dmt = dm_target_lookup_name(dm_target_name);
98 lockmgr(&dm_target_mutex, LK_RELEASE);
105 * Lookup for target in global target list.
108 dm_target_lookup(const char *dm_target_name)
114 if (dm_target_name == NULL)
117 lockmgr(&dm_target_mutex, LK_EXCLUSIVE);
119 dmt = dm_target_lookup_name(dm_target_name);
123 lockmgr(&dm_target_mutex, LK_RELEASE);
128 * Search for name in TAIL and return apropriate pointer.
131 dm_target_lookup_name(const char *dm_target_name)
133 dm_target_t *dm_target;
137 slen = strlen(dm_target_name) + 1;
139 TAILQ_FOREACH(dm_target, &dm_target_list, dm_target_next) {
140 dlen = strlen(dm_target->name) + 1;
144 if (strncmp(dm_target_name, dm_target->name, slen) == 0)
151 * Insert new target struct into the TAIL.
153 * contains name, version, function pointer to specifif target functions.
156 dm_target_insert(dm_target_t * dm_target)
160 lockmgr(&dm_target_mutex, LK_EXCLUSIVE);
162 dmt = dm_target_lookup_name(dm_target->name);
164 kprintf("uhoh, target_insert EEXIST\n");
165 lockmgr(&dm_target_mutex, LK_RELEASE);
168 TAILQ_INSERT_TAIL(&dm_target_list, dm_target, dm_target_next);
170 lockmgr(&dm_target_mutex, LK_RELEASE);
177 * Remove target from TAIL, target is selected with it's name.
180 dm_target_rem(char *dm_target_name)
184 KKASSERT(dm_target_name != NULL);
186 lockmgr(&dm_target_mutex, LK_EXCLUSIVE);
188 dmt = dm_target_lookup_name(dm_target_name);
190 lockmgr(&dm_target_mutex, LK_RELEASE);
193 if (dmt->ref_cnt > 0) {
194 lockmgr(&dm_target_mutex, LK_RELEASE);
197 TAILQ_REMOVE(&dm_target_list,
198 dmt, dm_target_next);
200 lockmgr(&dm_target_mutex, LK_RELEASE);
202 (void) kfree(dmt, M_DM);
207 * Destroy all targets and remove them from queue.
208 * This routine is called from dm_detach, before module
212 dm_target_destroy(void)
214 dm_target_t *dm_target;
216 lockmgr(&dm_target_mutex, LK_EXCLUSIVE);
217 while (TAILQ_FIRST(&dm_target_list) != NULL) {
219 dm_target = TAILQ_FIRST(&dm_target_list);
221 TAILQ_REMOVE(&dm_target_list, TAILQ_FIRST(&dm_target_list),
224 (void) kfree(dm_target, M_DM);
226 lockmgr(&dm_target_mutex, LK_RELEASE);
228 lockuninit(&dm_target_mutex);
233 * Allocate new target entry.
236 dm_target_alloc(const char *name)
238 return kmalloc(sizeof(dm_target_t), M_DM, M_WAITOK | M_ZERO);
241 * Return prop_array of dm_target dictionaries.
244 dm_target_prop_list(void)
246 prop_array_t target_array, ver;
247 prop_dictionary_t target_dict;
248 dm_target_t *dm_target;
252 target_array = prop_array_create();
254 lockmgr(&dm_target_mutex, LK_EXCLUSIVE);
256 TAILQ_FOREACH(dm_target, &dm_target_list, dm_target_next) {
258 target_dict = prop_dictionary_create();
259 ver = prop_array_create();
260 prop_dictionary_set_cstring(target_dict, DM_TARGETS_NAME,
263 for (i = 0; i < 3; i++)
264 prop_array_add_uint32(ver, dm_target->version[i]);
266 prop_dictionary_set(target_dict, DM_TARGETS_VERSION, ver);
267 prop_array_add(target_array, target_dict);
269 prop_object_release(ver);
270 prop_object_release(target_dict);
273 lockmgr(&dm_target_mutex, LK_RELEASE);
277 /* Initialize dm_target subsystem. */
281 dm_target_t *dmt, *dmt3, *dmt5;
286 lockinit(&dm_target_mutex, "dmtrgt", 0, LK_CANRECURSE);
288 dmt = dm_target_alloc("linear");
289 dmt3 = dm_target_alloc("striped");
290 dmt5 = dm_target_alloc("crypt");
295 strlcpy(dmt->name, "linear", DM_MAX_TYPE_NAME);
296 dmt->init = &dm_target_linear_init;
297 dmt->status = &dm_target_linear_status;
298 dmt->strategy = &dm_target_linear_strategy;
299 dmt->deps = &dm_target_linear_deps;
300 dmt->destroy = &dm_target_linear_destroy;
301 dmt->upcall = &dm_target_linear_upcall;
303 r = dm_target_insert(dmt);
305 dmt3->version[0] = 1;
306 dmt3->version[1] = 0;
307 dmt3->version[2] = 3;
308 strlcpy(dmt3->name, "striped", DM_MAX_TYPE_NAME);
309 dmt3->init = &dm_target_stripe_init;
310 dmt3->status = &dm_target_stripe_status;
311 dmt3->strategy = &dm_target_stripe_strategy;
312 dmt3->deps = &dm_target_stripe_deps;
313 dmt3->destroy = &dm_target_stripe_destroy;
314 dmt3->upcall = &dm_target_stripe_upcall;
316 r = dm_target_insert(dmt3);
318 dmt5->version[0] = 1;
319 dmt5->version[1] = 0;
320 dmt5->version[2] = 0;
321 strlcpy(dmt5->name, "crypt", DM_MAX_TYPE_NAME);
322 dmt5->init = &dm_target_crypt_init;
323 dmt5->status = &dm_target_crypt_status;
324 dmt5->strategy = &dm_target_crypt_strategy;
325 dmt5->deps = &dm_target_crypt_deps;
326 dmt5->destroy = &dm_target_crypt_destroy;
327 dmt5->upcall = &dm_target_crypt_upcall;
329 r = dm_target_insert(dmt5);