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