Annotation of src/sys/dev/dm/dm_target.c, revision 1.37
1.37 ! tkusumi 1: /* $NetBSD: dm_target.c,v 1.36 2019/12/21 16:00:29 tkusumi Exp $ */
1.2 haad 2:
3: /*
4: * Copyright (c) 2008 The NetBSD Foundation, Inc.
5: * All rights reserved.
6: *
7: * This code is derived from software contributed to The NetBSD Foundation
8: * by Adam Hamsik.
9: *
10: * Redistribution and use in source and binary forms, with or without
11: * modification, are permitted provided that the following conditions
12: * are met:
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.
18: *
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.
30: */
1.20 christos 31: #include <sys/cdefs.h>
1.37 ! tkusumi 32: __KERNEL_RCSID(0, "$NetBSD: dm_target.c,v 1.36 2019/12/21 16:00:29 tkusumi Exp $");
1.2 haad 33:
34: #include <sys/types.h>
35: #include <sys/param.h>
36: #include <sys/kmem.h>
1.7 haad 37: #include <sys/module.h>
38:
1.2 haad 39: #include "netbsd-dm.h"
40: #include "dm.h"
41:
1.12 haad 42: static dm_target_t *dm_target_lookup_name(const char *);
1.2 haad 43:
44: TAILQ_HEAD(dm_target_head, dm_target);
45:
46: static struct dm_target_head dm_target_list =
47: TAILQ_HEAD_INITIALIZER(dm_target_list);
48:
1.21 tkusumi 49: static kmutex_t dm_target_mutex;
1.3 haad 50:
51: /*
1.10 yamt 52: * Called indirectly from dm_table_load_ioctl to mark target as used.
1.3 haad 53: */
54: void
1.25 tkusumi 55: dm_target_busy(dm_target_t *target)
1.3 haad 56: {
1.32 tkusumi 57:
1.7 haad 58: atomic_inc_32(&target->ref_cnt);
1.3 haad 59: }
1.20 christos 60:
1.7 haad 61: /*
62: * Release reference counter on target.
63: */
1.3 haad 64: void
1.25 tkusumi 65: dm_target_unbusy(dm_target_t *target)
1.3 haad 66: {
1.32 tkusumi 67:
1.7 haad 68: KASSERT(target->ref_cnt > 0);
69: atomic_dec_32(&target->ref_cnt);
1.3 haad 70: }
1.20 christos 71:
1.7 haad 72: /*
73: * Try to autoload target module if it was not found in current
74: * target list.
75: */
76: dm_target_t *
77: dm_target_autoload(const char *dm_target_name)
78: {
1.8 haad 79: char name[30];
1.34 tkusumi 80: unsigned int gen;
1.7 haad 81: dm_target_t *dmt;
82:
1.8 haad 83: snprintf(name, sizeof(name), "dm_target_%s", dm_target_name);
1.12 haad 84: name[29] = '\0';
85:
1.7 haad 86: do {
87: gen = module_gen;
1.12 haad 88:
1.7 haad 89: /* Try to autoload target module */
1.28 tkusumi 90: module_autoload(name, MODULE_CLASS_MISC);
1.12 haad 91: } while (gen != module_gen);
1.7 haad 92:
93: mutex_enter(&dm_target_mutex);
94: dmt = dm_target_lookup_name(dm_target_name);
1.9 haad 95: if (dmt != NULL)
96: dm_target_busy(dmt);
1.7 haad 97: mutex_exit(&dm_target_mutex);
1.12 haad 98:
1.7 haad 99: return dmt;
100: }
1.20 christos 101:
1.7 haad 102: /*
103: * Lookup for target in global target list.
104: */
1.3 haad 105: dm_target_t *
106: dm_target_lookup(const char *dm_target_name)
107: {
108: dm_target_t *dmt;
109:
1.7 haad 110: if (dm_target_name == NULL)
111: return NULL;
112:
1.3 haad 113: mutex_enter(&dm_target_mutex);
114:
1.7 haad 115: dmt = dm_target_lookup_name(dm_target_name);
1.3 haad 116: if (dmt != NULL)
117: dm_target_busy(dmt);
1.12 haad 118:
1.3 haad 119: mutex_exit(&dm_target_mutex);
1.12 haad 120:
121: return dmt;
1.3 haad 122: }
1.20 christos 123:
1.2 haad 124: /*
125: * Search for name in TAIL and return apropriate pointer.
126: */
1.12 haad 127: static dm_target_t *
1.2 haad 128: dm_target_lookup_name(const char *dm_target_name)
129: {
130: dm_target_t *dm_target;
1.20 christos 131: size_t dlen;
132: size_t slen;
1.2 haad 133:
1.3 haad 134: slen = strlen(dm_target_name) + 1;
1.2 haad 135:
1.3 haad 136: TAILQ_FOREACH(dm_target, &dm_target_list, dm_target_next) {
137: dlen = strlen(dm_target->name) + 1;
1.2 haad 138: if (dlen != slen)
139: continue;
1.12 haad 140:
1.7 haad 141: if (strncmp(dm_target_name, dm_target->name, slen) == 0)
1.3 haad 142: return dm_target;
1.2 haad 143: }
144:
145: return NULL;
146: }
1.20 christos 147:
1.2 haad 148: /*
149: * Insert new target struct into the TAIL.
150: * dm_target
151: * contains name, version, function pointer to specifif target functions.
152: */
153: int
1.25 tkusumi 154: dm_target_insert(dm_target_t *dm_target)
1.2 haad 155: {
156: dm_target_t *dmt;
1.12 haad 157:
1.18 ahoka 158: /* Sanity check for any missing function */
1.27 tkusumi 159: if (dm_target->init == NULL) {
160: printf("%s missing init\n", dm_target->name);
161: return EINVAL;
162: }
163: if (dm_target->strategy == NULL) {
164: printf("%s missing strategy\n", dm_target->name);
165: return EINVAL;
166: }
167: if (dm_target->destroy == NULL) {
168: printf("%s missing destroy\n", dm_target->name);
169: return EINVAL;
170: }
171: if (dm_target->upcall == NULL) {
172: printf("%s missing upcall\n", dm_target->name);
173: return EINVAL;
174: }
1.18 ahoka 175:
1.3 haad 176: mutex_enter(&dm_target_mutex);
1.2 haad 177:
178: dmt = dm_target_lookup_name(dm_target->name);
1.3 haad 179: if (dmt != NULL) {
180: mutex_exit(&dm_target_mutex);
1.2 haad 181: return EEXIST;
1.3 haad 182: }
1.2 haad 183: TAILQ_INSERT_TAIL(&dm_target_list, dm_target, dm_target_next);
1.3 haad 184:
185: mutex_exit(&dm_target_mutex);
1.12 haad 186:
1.2 haad 187: return 0;
188: }
189:
190: /*
1.19 snj 191: * Remove target from TAIL, target is selected with its name.
1.2 haad 192: */
193: int
1.26 tkusumi 194: dm_target_rem(const char *dm_target_name)
1.2 haad 195: {
1.3 haad 196: dm_target_t *dmt;
1.12 haad 197:
1.2 haad 198: KASSERT(dm_target_name != NULL);
1.3 haad 199:
200: mutex_enter(&dm_target_mutex);
1.12 haad 201:
1.3 haad 202: dmt = dm_target_lookup_name(dm_target_name);
203: if (dmt == NULL) {
204: mutex_exit(&dm_target_mutex);
1.2 haad 205: return ENOENT;
1.3 haad 206: }
207: if (dmt->ref_cnt > 0) {
208: mutex_exit(&dm_target_mutex);
209: return EBUSY;
210: }
1.22 tkusumi 211: TAILQ_REMOVE(&dm_target_list, dmt, dm_target_next);
1.3 haad 212:
213: mutex_exit(&dm_target_mutex);
1.12 haad 214:
1.28 tkusumi 215: kmem_free(dmt, sizeof(dm_target_t));
1.2 haad 216:
217: return 0;
218: }
1.20 christos 219:
1.2 haad 220: /*
221: * Destroy all targets and remove them from queue.
222: * This routine is called from dm_detach, before module
223: * is unloaded.
224: */
225: int
226: dm_target_destroy(void)
227: {
228: dm_target_t *dm_target;
229:
1.3 haad 230: mutex_enter(&dm_target_mutex);
1.12 haad 231:
1.24 tkusumi 232: while ((dm_target = TAILQ_FIRST(&dm_target_list)) != NULL) {
233: TAILQ_REMOVE(&dm_target_list, dm_target, dm_target_next);
1.28 tkusumi 234: kmem_free(dm_target, sizeof(dm_target_t));
1.2 haad 235: }
1.24 tkusumi 236: KASSERT(TAILQ_EMPTY(&dm_target_list));
237:
1.3 haad 238: mutex_exit(&dm_target_mutex);
1.12 haad 239:
1.4 haad 240: mutex_destroy(&dm_target_mutex);
1.12 haad 241:
1.2 haad 242: return 0;
243: }
1.20 christos 244:
1.2 haad 245: /*
246: * Allocate new target entry.
247: */
1.12 haad 248: dm_target_t *
1.2 haad 249: dm_target_alloc(const char *name)
250: {
1.23 tkusumi 251: dm_target_t *dmt;
252:
253: dmt = kmem_zalloc(sizeof(dm_target_t), KM_SLEEP);
254: if (dmt == NULL)
255: return NULL;
256:
257: if (name)
258: strlcpy(dmt->name, name, sizeof(dmt->name));
259:
260: return dmt;
1.2 haad 261: }
1.20 christos 262:
1.2 haad 263: /*
264: * Return prop_array of dm_target dictionaries.
265: */
266: prop_array_t
267: dm_target_prop_list(void)
268: {
1.32 tkusumi 269: prop_array_t target_array;
1.2 haad 270: dm_target_t *dm_target;
271:
272: target_array = prop_array_create();
1.3 haad 273:
274: mutex_enter(&dm_target_mutex);
1.2 haad 275:
1.12 haad 276: TAILQ_FOREACH(dm_target, &dm_target_list, dm_target_next) {
1.32 tkusumi 277: prop_array_t ver;
278: prop_dictionary_t target_dict;
279: int i;
280:
1.12 haad 281: target_dict = prop_dictionary_create();
1.2 haad 282: ver = prop_array_create();
283: prop_dictionary_set_cstring(target_dict, DM_TARGETS_NAME,
284: dm_target->name);
285:
286: for (i = 0; i < 3; i++)
287: prop_array_add_uint32(ver, dm_target->version[i]);
288:
289: prop_dictionary_set(target_dict, DM_TARGETS_VERSION, ver);
290: prop_array_add(target_array, target_dict);
291:
292: prop_object_release(ver);
293: prop_object_release(target_dict);
294: }
295:
1.3 haad 296: mutex_exit(&dm_target_mutex);
1.12 haad 297:
1.2 haad 298: return target_array;
299: }
1.20 christos 300:
1.32 tkusumi 301: /*
302: * Initialize dm_target subsystem.
303: */
1.2 haad 304: int
305: dm_target_init(void)
306: {
1.33 tkusumi 307: dm_target_t *dmt;
1.2 haad 308:
1.3 haad 309: mutex_init(&dm_target_mutex, MUTEX_DEFAULT, IPL_NONE);
1.12 haad 310:
1.2 haad 311: dmt = dm_target_alloc("linear");
312: dmt->version[0] = 1;
313: dmt->version[1] = 0;
314: dmt->version[2] = 2;
315: dmt->init = &dm_target_linear_init;
1.29 tkusumi 316: dmt->table = &dm_target_linear_table;
1.2 haad 317: dmt->strategy = &dm_target_linear_strategy;
1.13 haad 318: dmt->sync = &dm_target_linear_sync;
1.2 haad 319: dmt->destroy = &dm_target_linear_destroy;
320: dmt->upcall = &dm_target_linear_upcall;
1.15 mlelstv 321: dmt->secsize = &dm_target_linear_secsize;
1.33 tkusumi 322: if (dm_target_insert(dmt))
323: printf("Failed to insert linear\n");
1.12 haad 324:
1.33 tkusumi 325: dmt = dm_target_alloc("striped");
326: dmt->version[0] = 1;
327: dmt->version[1] = 0;
328: dmt->version[2] = 3;
329: dmt->init = &dm_target_stripe_init;
1.36 tkusumi 330: dmt->info = &dm_target_stripe_info;
1.33 tkusumi 331: dmt->table = &dm_target_stripe_table;
332: dmt->strategy = &dm_target_stripe_strategy;
333: dmt->sync = &dm_target_stripe_sync;
334: dmt->destroy = &dm_target_stripe_destroy;
335: dmt->upcall = &dm_target_stripe_upcall;
336: dmt->secsize = &dm_target_stripe_secsize;
337: if (dm_target_insert(dmt))
338: printf("Failed to insert striped\n");
1.12 haad 339:
1.33 tkusumi 340: dmt = dm_target_alloc("error");
341: dmt->version[0] = 1;
342: dmt->version[1] = 0;
343: dmt->version[2] = 0;
344: dmt->init = &dm_target_error_init;
345: dmt->strategy = &dm_target_error_strategy;
346: dmt->destroy = &dm_target_error_destroy;
347: dmt->upcall = &dm_target_error_upcall;
348: if (dm_target_insert(dmt))
349: printf("Failed to insert error\n");
1.12 haad 350:
1.33 tkusumi 351: dmt = dm_target_alloc("zero");
352: dmt->version[0] = 1;
353: dmt->version[1] = 0;
354: dmt->version[2] = 0;
355: dmt->init = &dm_target_zero_init;
356: dmt->strategy = &dm_target_zero_strategy;
357: dmt->destroy = &dm_target_zero_destroy;
358: dmt->upcall = &dm_target_zero_upcall;
359: if (dm_target_insert(dmt))
360: printf("Failed to insert zero\n");
1.2 haad 361:
1.33 tkusumi 362: return 0;
1.2 haad 363: }
CVSweb <webmaster@jp.NetBSD.org>