Annotation of src/sys/dev/dm/dm_target.c, revision 1.12.2.2
1.12.2.1 uebayasi 1: /* $NetBSD$ */
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: */
31:
32: #include <sys/types.h>
33: #include <sys/param.h>
34:
35: #include <sys/kmem.h>
1.7 haad 36: #include <sys/module.h>
37:
1.2 haad 38:
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.3 haad 49: kmutex_t dm_target_mutex;
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.12 haad 55: dm_target_busy(dm_target_t * target)
1.3 haad 56: {
1.7 haad 57: atomic_inc_32(&target->ref_cnt);
1.3 haad 58: }
1.7 haad 59: /*
60: * Release reference counter on target.
61: */
1.3 haad 62: void
1.12 haad 63: dm_target_unbusy(dm_target_t * target)
1.3 haad 64: {
1.7 haad 65: KASSERT(target->ref_cnt > 0);
66: atomic_dec_32(&target->ref_cnt);
1.3 haad 67: }
1.7 haad 68: /*
69: * Try to autoload target module if it was not found in current
70: * target list.
71: */
72: dm_target_t *
73: dm_target_autoload(const char *dm_target_name)
74: {
1.8 haad 75: char name[30];
1.7 haad 76: u_int gen;
77: dm_target_t *dmt;
78:
1.8 haad 79: snprintf(name, sizeof(name), "dm_target_%s", dm_target_name);
1.12 haad 80: name[29] = '\0';
81:
1.7 haad 82: do {
83: gen = module_gen;
1.12 haad 84:
1.7 haad 85: /* Try to autoload target module */
1.8 haad 86: (void) module_autoload(name, MODULE_CLASS_MISC);
1.12 haad 87: } while (gen != module_gen);
1.7 haad 88:
89: mutex_enter(&dm_target_mutex);
90: dmt = dm_target_lookup_name(dm_target_name);
1.9 haad 91: if (dmt != NULL)
92: dm_target_busy(dmt);
1.7 haad 93: mutex_exit(&dm_target_mutex);
1.12 haad 94:
1.7 haad 95: return dmt;
96: }
97: /*
98: * Lookup for target in global target list.
99: */
1.3 haad 100: dm_target_t *
101: dm_target_lookup(const char *dm_target_name)
102: {
103: dm_target_t *dmt;
104:
105: dmt = NULL;
106:
1.7 haad 107: if (dm_target_name == NULL)
108: return NULL;
109:
1.3 haad 110: mutex_enter(&dm_target_mutex);
111:
1.7 haad 112: dmt = dm_target_lookup_name(dm_target_name);
1.3 haad 113: if (dmt != NULL)
114: dm_target_busy(dmt);
1.12 haad 115:
1.3 haad 116: mutex_exit(&dm_target_mutex);
1.12 haad 117:
118: return dmt;
1.3 haad 119: }
1.2 haad 120: /*
121: * Search for name in TAIL and return apropriate pointer.
122: */
1.12 haad 123: static dm_target_t *
1.2 haad 124: dm_target_lookup_name(const char *dm_target_name)
125: {
126: dm_target_t *dm_target;
1.12 haad 127: int dlen;
128: int slen;
1.2 haad 129:
1.3 haad 130: slen = strlen(dm_target_name) + 1;
1.2 haad 131:
1.3 haad 132: TAILQ_FOREACH(dm_target, &dm_target_list, dm_target_next) {
133: dlen = strlen(dm_target->name) + 1;
1.2 haad 134: if (dlen != slen)
135: continue;
1.12 haad 136:
1.7 haad 137: if (strncmp(dm_target_name, dm_target->name, slen) == 0)
1.3 haad 138: return dm_target;
1.2 haad 139: }
140:
141: return NULL;
142: }
143: /*
144: * Insert new target struct into the TAIL.
145: * dm_target
146: * contains name, version, function pointer to specifif target functions.
147: */
148: int
1.12 haad 149: dm_target_insert(dm_target_t * dm_target)
1.2 haad 150: {
151: dm_target_t *dmt;
1.12 haad 152:
1.3 haad 153: mutex_enter(&dm_target_mutex);
1.2 haad 154:
155: dmt = dm_target_lookup_name(dm_target->name);
1.3 haad 156: if (dmt != NULL) {
157: mutex_exit(&dm_target_mutex);
1.2 haad 158: return EEXIST;
1.3 haad 159: }
1.2 haad 160: TAILQ_INSERT_TAIL(&dm_target_list, dm_target, dm_target_next);
1.3 haad 161:
162: mutex_exit(&dm_target_mutex);
1.12 haad 163:
1.2 haad 164: return 0;
165: }
166:
167:
168: /*
169: * Remove target from TAIL, target is selected with it's name.
170: */
171: int
172: dm_target_rem(char *dm_target_name)
173: {
1.3 haad 174: dm_target_t *dmt;
1.12 haad 175:
1.2 haad 176: KASSERT(dm_target_name != NULL);
1.3 haad 177:
178: mutex_enter(&dm_target_mutex);
1.12 haad 179:
1.3 haad 180: dmt = dm_target_lookup_name(dm_target_name);
181: if (dmt == NULL) {
182: mutex_exit(&dm_target_mutex);
1.2 haad 183: return ENOENT;
1.3 haad 184: }
185: if (dmt->ref_cnt > 0) {
186: mutex_exit(&dm_target_mutex);
187: return EBUSY;
188: }
1.2 haad 189: TAILQ_REMOVE(&dm_target_list,
1.3 haad 190: dmt, dm_target_next);
191:
192: mutex_exit(&dm_target_mutex);
1.12 haad 193:
194: (void) kmem_free(dmt, sizeof(dm_target_t));
1.2 haad 195:
196: return 0;
197: }
198: /*
199: * Destroy all targets and remove them from queue.
200: * This routine is called from dm_detach, before module
201: * is unloaded.
202: */
203: int
204: dm_target_destroy(void)
205: {
206: dm_target_t *dm_target;
207:
1.3 haad 208: mutex_enter(&dm_target_mutex);
1.12 haad 209: while (TAILQ_FIRST(&dm_target_list) != NULL) {
1.2 haad 210:
211: dm_target = TAILQ_FIRST(&dm_target_list);
1.12 haad 212:
1.2 haad 213: TAILQ_REMOVE(&dm_target_list, TAILQ_FIRST(&dm_target_list),
1.12 haad 214: dm_target_next);
215:
216: (void) kmem_free(dm_target, sizeof(dm_target_t));
1.2 haad 217: }
1.3 haad 218: mutex_exit(&dm_target_mutex);
1.12 haad 219:
1.4 haad 220: mutex_destroy(&dm_target_mutex);
1.12 haad 221:
1.2 haad 222: return 0;
223: }
224: /*
225: * Allocate new target entry.
226: */
1.12 haad 227: dm_target_t *
1.2 haad 228: dm_target_alloc(const char *name)
229: {
1.11 haad 230: return kmem_zalloc(sizeof(dm_target_t), KM_SLEEP);
1.2 haad 231: }
232: /*
233: * Return prop_array of dm_target dictionaries.
234: */
235: prop_array_t
236: dm_target_prop_list(void)
237: {
1.12 haad 238: prop_array_t target_array, ver;
1.2 haad 239: prop_dictionary_t target_dict;
240: dm_target_t *dm_target;
241:
242: size_t i;
243:
244: target_array = prop_array_create();
1.3 haad 245:
246: mutex_enter(&dm_target_mutex);
1.2 haad 247:
1.12 haad 248: TAILQ_FOREACH(dm_target, &dm_target_list, dm_target_next) {
249:
250: target_dict = prop_dictionary_create();
1.2 haad 251: ver = prop_array_create();
252: prop_dictionary_set_cstring(target_dict, DM_TARGETS_NAME,
253: dm_target->name);
254:
255: for (i = 0; i < 3; i++)
256: prop_array_add_uint32(ver, dm_target->version[i]);
257:
258: prop_dictionary_set(target_dict, DM_TARGETS_VERSION, ver);
259: prop_array_add(target_array, target_dict);
260:
261: prop_object_release(ver);
262: prop_object_release(target_dict);
263: }
264:
1.3 haad 265: mutex_exit(&dm_target_mutex);
1.12 haad 266:
1.2 haad 267: return target_array;
268: }
269: /* Initialize dm_target subsystem. */
270: int
271: dm_target_init(void)
272: {
1.12 haad 273: dm_target_t *dmt, *dmt3;
1.2 haad 274: int r;
275:
276: r = 0;
1.3 haad 277:
278: mutex_init(&dm_target_mutex, MUTEX_DEFAULT, IPL_NONE);
1.12 haad 279:
1.2 haad 280: dmt = dm_target_alloc("linear");
281: dmt3 = dm_target_alloc("striped");
1.12 haad 282:
1.2 haad 283: dmt->version[0] = 1;
284: dmt->version[1] = 0;
285: dmt->version[2] = 2;
286: strlcpy(dmt->name, "linear", DM_MAX_TYPE_NAME);
287: dmt->init = &dm_target_linear_init;
288: dmt->status = &dm_target_linear_status;
289: dmt->strategy = &dm_target_linear_strategy;
1.12.2.1 uebayasi 290: dmt->sync = &dm_target_linear_sync;
1.2 haad 291: dmt->deps = &dm_target_linear_deps;
292: dmt->destroy = &dm_target_linear_destroy;
293: dmt->upcall = &dm_target_linear_upcall;
1.12 haad 294:
1.2 haad 295: r = dm_target_insert(dmt);
1.12 haad 296:
1.2 haad 297: dmt3->version[0] = 1;
298: dmt3->version[1] = 0;
299: dmt3->version[2] = 3;
300: strlcpy(dmt3->name, "striped", DM_MAX_TYPE_NAME);
1.5 haad 301: dmt3->init = &dm_target_stripe_init;
302: dmt3->status = &dm_target_stripe_status;
303: dmt3->strategy = &dm_target_stripe_strategy;
1.12.2.1 uebayasi 304: dmt3->sync = &dm_target_stripe_sync;
1.5 haad 305: dmt3->deps = &dm_target_stripe_deps;
306: dmt3->destroy = &dm_target_stripe_destroy;
307: dmt3->upcall = &dm_target_stripe_upcall;
1.12 haad 308:
1.2 haad 309: r = dm_target_insert(dmt3);
310:
311: return r;
312: }
CVSweb <webmaster@jp.NetBSD.org>