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