Annotation of src/sys/dev/dm/dm_dev.c, revision 1.1.2.11
1.1.2.11! haad 1: /* $NetBSD: dm_dev.c,v 1.1.2.10 2008/09/26 22:57:13 haad Exp $ */
1.1.2.4 haad 2:
1.1.2.1 haad 3: /*
4: * Copyright (c) 1996, 1997, 1998, 1999, 2002 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:
1.1.2.3 haad 35: #include <sys/disklabel.h>
1.1.2.1 haad 36: #include <sys/ioctl.h>
37: #include <sys/ioccom.h>
38: #include <sys/kmem.h>
39:
40: #include "netbsd-dm.h"
41: #include "dm.h"
42:
1.1.2.9 haad 43: static struct dm_dev* dm_dev_lookup_name(const char *);
44: static struct dm_dev* dm_dev_lookup_uuid(const char *);
45: static struct dm_dev* dm_dev_lookup_minor(int);
46:
1.1.2.1 haad 47: static struct dm_dev_head dm_dev_list =
48: TAILQ_HEAD_INITIALIZER(dm_dev_list);
49:
50: kmutex_t dm_dev_mutex;
51:
1.1.2.11! haad 52: #define DISABLE_DEV(dmv) do { \
! 53: TAILQ_REMOVE(&dm_dev_list, dmv, next_devlist); \
! 54: mutex_enter(&dmv->dev_mtx); \
! 55: mutex_exit(&dm_dev_mutex); \
! 56: while(dmv->ref_cnt != 0) \
! 57: cv_wait(&dmv->dev_cv, &dmv->dev_mtx); \
! 58: mutex_exit(&dmv->dev_mtx); \
! 59: } while (/*CONSTCOND*/0)
1.1.2.1 haad 60:
61: /*
1.1.2.9 haad 62: * Generic function used to lookup struct dm_dev. Calling with dm_dev_name
63: * and dm_dev_uuid NULL is allowed.
1.1.2.1 haad 64: */
65: struct dm_dev*
1.1.2.9 haad 66: dm_dev_lookup(const char *dm_dev_name, const char *dm_dev_uuid,
67: int dm_dev_minor)
68: {
69: struct dm_dev *dmv;
70:
71: dmv = NULL;
1.1.2.11! haad 72: mutex_enter(&dm_dev_mutex);
1.1.2.9 haad 73:
1.1.2.11! haad 74: /* KASSERT(dm_dev_name != NULL && dm_dev_uuid != NULL && dm_dev_minor > 0); */
1.1.2.9 haad 75: if (dm_dev_minor > 0)
1.1.2.11! haad 76: if ((dmv = dm_dev_lookup_minor(dm_dev_minor)) != NULL){
! 77: dm_dev_busy(dmv);
! 78: mutex_exit(&dm_dev_mutex);
1.1.2.9 haad 79: return dmv;
1.1.2.11! haad 80: }
1.1.2.9 haad 81:
82: if (dm_dev_name != NULL)
1.1.2.11! haad 83: if ((dmv = dm_dev_lookup_name(dm_dev_name)) != NULL){
! 84: dm_dev_busy(dmv);
! 85: mutex_exit(&dm_dev_mutex);
1.1.2.9 haad 86: return dmv;
1.1.2.11! haad 87: }
1.1.2.9 haad 88:
89: if (dm_dev_uuid != NULL)
1.1.2.11! haad 90: if ((dmv = dm_dev_lookup_name(dm_dev_uuid)) != NULL){
! 91: dm_dev_busy(dmv);
! 92: mutex_exit(&dm_dev_mutex);
1.1.2.9 haad 93: return dmv;
1.1.2.11! haad 94: }
! 95: mutex_exit(&dm_dev_mutex);
1.1.2.9 haad 96: return NULL;
97: }
98:
1.1.2.11! haad 99:
1.1.2.9 haad 100: /*
101: * Lookup device with its minor number.
102: */
103: static struct dm_dev*
1.1.2.1 haad 104: dm_dev_lookup_minor(int dm_dev_minor)
105: {
106: struct dm_dev *dm_dev;
107:
1.1.2.2 haad 108: TAILQ_FOREACH(dm_dev, &dm_dev_list, next_devlist){
1.1.2.11! haad 109: if (dm_dev_minor == dm_dev->minor)
1.1.2.1 haad 110: return dm_dev;
111: }
112:
113: return NULL;
114: }
115:
116: /*
117: * Lookup device with it's device name.
118: */
1.1.2.9 haad 119: static struct dm_dev*
1.1.2.1 haad 120: dm_dev_lookup_name(const char *dm_dev_name)
121: {
122: struct dm_dev *dm_dev;
123: int dlen; int slen;
124:
1.1.2.9 haad 125: slen = strlen(dm_dev_name);
126:
127: if (slen == 0)
1.1.2.1 haad 128: return NULL;
129:
1.1.2.2 haad 130: TAILQ_FOREACH(dm_dev, &dm_dev_list, next_devlist){
1.1.2.11! haad 131:
1.1.2.1 haad 132: dlen = strlen(dm_dev->name);
1.1.2.9 haad 133:
1.1.2.1 haad 134: if(slen != dlen)
135: continue;
1.1.2.9 haad 136:
1.1.2.11! haad 137: if (strncmp(dm_dev_name, dm_dev->name, slen) == 0)
1.1.2.1 haad 138: return dm_dev;
139: }
140:
141: return NULL;
142: }
143:
144: /*
145: * Lookup device with it's device uuid. Used mostly by LVM2tools.
146: */
1.1.2.9 haad 147: static struct dm_dev*
1.1.2.1 haad 148: dm_dev_lookup_uuid(const char *dm_dev_uuid)
149: {
150: struct dm_dev *dm_dev;
1.1.2.6 haad 151: size_t len;
152:
153: len = 0;
1.1.2.9 haad 154: len = strlen(dm_dev_uuid);
1.1.2.6 haad 155:
1.1.2.9 haad 156: if (len == 0)
1.1.2.1 haad 157: return NULL;
158:
1.1.2.6 haad 159: TAILQ_FOREACH(dm_dev, &dm_dev_list, next_devlist){
1.1.2.11! haad 160:
1.1.2.6 haad 161: if (strlen(dm_dev->uuid) != len)
1.1.2.9 haad 162: continue;
1.1.2.6 haad 163:
1.1.2.11! haad 164: if (strncmp(dm_dev_uuid, dm_dev->uuid, strlen(dm_dev->uuid)) == 0)
1.1.2.9 haad 165: return dm_dev;
1.1.2.6 haad 166: }
1.1.2.11! haad 167:
1.1.2.1 haad 168: return NULL;
169: }
170:
171: /*
172: * Insert new device to the global list of devices.
173: */
174: int
175: dm_dev_insert(struct dm_dev *dev)
176: {
177: struct dm_dev *dmt;
178: int r;
179:
180: dmt = NULL;
181: r = 0;
1.1.2.11! haad 182:
! 183: KASSERT(dev != NULL);
! 184: mutex_enter(&dm_dev_mutex);
1.1.2.6 haad 185: if (((dmt = dm_dev_lookup_uuid(dev->uuid)) == NULL) &&
186: ((dmt = dm_dev_lookup_name(dev->name)) == NULL) &&
187: ((dmt = dm_dev_lookup_minor(dev->minor)) == NULL)){
1.1.2.1 haad 188:
189: TAILQ_INSERT_TAIL(&dm_dev_list, dev, next_devlist);
1.1.2.11! haad 190:
1.1.2.1 haad 191: } else
192: r = EEXIST;
1.1.2.11! haad 193:
! 194: mutex_exit(&dm_dev_mutex);
1.1.2.1 haad 195: return r;
196: }
197:
198:
1.1.2.11! haad 199:
! 200:
! 201: /*
! 202: * Lookup device with its minor number.
! 203: */
! 204: int
! 205: dm_dev_test_minor(int dm_dev_minor)
! 206: {
! 207: struct dm_dev *dm_dev;
! 208:
! 209: mutex_enter(&dm_dev_mutex);
! 210: TAILQ_FOREACH(dm_dev, &dm_dev_list, next_devlist){
! 211: if (dm_dev_minor == dm_dev->minor){
! 212: mutex_exit(&dm_dev_mutex);
! 213: return 1;
! 214: }
! 215: }
! 216: mutex_exit(&dm_dev_mutex);
! 217:
! 218: return 0;
! 219: }
! 220:
1.1.2.1 haad 221: /*
1.1.2.6 haad 222: * Remove device selected with dm_dev from global list of devices.
1.1.2.1 haad 223: */
1.1.2.11! haad 224: struct dm_dev*
! 225: dm_dev_rem(const char *dm_dev_name, const char *dm_dev_uuid,
! 226: int dm_dev_minor)
1.1.2.6 haad 227: {
1.1.2.11! haad 228: struct dm_dev *dmv;
! 229: dmv = NULL;
! 230:
1.1.2.1 haad 231: mutex_enter(&dm_dev_mutex);
232:
1.1.2.11! haad 233: if (dm_dev_minor > 0)
! 234: if ((dmv = dm_dev_lookup_minor(dm_dev_minor)) != NULL){
! 235: DISABLE_DEV(dmv);
! 236: return dmv;
! 237: }
! 238:
! 239: if (dm_dev_name != NULL)
! 240: if ((dmv = dm_dev_lookup_name(dm_dev_name)) != NULL){
! 241: DISABLE_DEV(dmv);
! 242: return dmv;
! 243: }
1.1.2.1 haad 244:
1.1.2.11! haad 245: if (dm_dev_uuid != NULL)
! 246: if ((dmv = dm_dev_lookup_name(dm_dev_uuid)) != NULL){
! 247: DISABLE_DEV(dmv);
! 248: return dmv;
! 249: }
1.1.2.1 haad 250: mutex_exit(&dm_dev_mutex);
251:
1.1.2.11! haad 252: return NULL;
1.1.2.1 haad 253: }
254:
255: /*
1.1.2.5 haad 256: * Destroy all devices created in device-mapper. Remove all tables
257: * free all allocated memmory.
258: */
259: int
260: dm_dev_destroy(void)
261: {
262: struct dm_dev *dm_dev;
263: mutex_enter(&dm_dev_mutex);
264:
265: while (TAILQ_FIRST(&dm_dev_list) != NULL){
266:
267: dm_dev = TAILQ_FIRST(&dm_dev_list);
268:
269: TAILQ_REMOVE(&dm_dev_list, TAILQ_FIRST(&dm_dev_list),
1.1.2.10 haad 270: next_devlist);
1.1.2.5 haad 271:
1.1.2.11! haad 272: mutex_enter(&dm_dev->dev_mtx);
! 273:
! 274: while (dm_dev->ref_cnt != 0)
! 275: cv_wait(&dm_dev->dev_cv, &dm_dev->dev_mtx);
1.1.2.10 haad 276:
1.1.2.5 haad 277: /* Destroy active table first. */
1.1.2.11! haad 278: dm_table_destroy(&dm_dev->table_head, DM_TABLE_ACTIVE);
1.1.2.5 haad 279:
1.1.2.11! haad 280: /* Destroy inactive table if exits, too. */
! 281: dm_table_destroy(&dm_dev->table_head, DM_TABLE_INACTIVE);
1.1.2.10 haad 282:
1.1.2.11! haad 283: dm_table_head_destroy(&dm_dev->table_head);
1.1.2.10 haad 284:
1.1.2.11! haad 285: mutex_exit(&dm_dev->dev_mtx);
! 286: mutex_destroy(&dm_dev->dev_mtx);
! 287: cv_destroy(&dm_dev->dev_cv);
1.1.2.5 haad 288:
289: (void)kmem_free(dm_dev, sizeof(struct dm_dev));
290: }
291: mutex_exit(&dm_dev_mutex);
1.1.2.11! haad 292:
1.1.2.10 haad 293: mutex_destroy(&dm_dev_mutex);
1.1.2.11! haad 294: return 0;
1.1.2.5 haad 295: }
296:
297: /*
1.1.2.1 haad 298: * Allocate new device entry.
299: */
300: struct dm_dev*
301: dm_dev_alloc()
1.1.2.10 haad 302: {
303: struct dm_dev *dmv;
304:
305: dmv = kmem_zalloc(sizeof(struct dm_dev), KM_NOSLEEP);
306: dmv->dk_label = kmem_zalloc(sizeof(struct disklabel), KM_NOSLEEP);
307:
308: return dmv;
1.1.2.1 haad 309: }
310:
311: /*
312: * Freed device entry.
313: */
314: int
315: dm_dev_free(struct dm_dev *dmv)
316: {
1.1.2.11! haad 317: KASSERT(dmv != NULL);
! 318:
1.1.2.10 haad 319: if (dmv->dk_label != NULL)
1.1.2.11! haad 320: (void)kmem_free(dmv->dk_label, sizeof(struct disklabel));
1.1.2.10 haad 321:
1.1.2.11! haad 322: (void)kmem_free(dmv, sizeof(struct dm_dev));
1.1.2.1 haad 323:
324: return 0;
325: }
326:
1.1.2.11! haad 327: void
! 328: dm_dev_busy(struct dm_dev *dmv)
! 329: {
! 330: mutex_enter(&dmv->dev_mtx);
! 331: dmv->ref_cnt++;
! 332: mutex_exit(&dmv->dev_mtx);
! 333: }
! 334:
! 335: void
! 336: dm_dev_unbusy(struct dm_dev *dmv)
! 337: {
! 338: KASSERT(dmv->ref_cnt != 0);
! 339:
! 340: mutex_enter(&dmv->dev_mtx);
! 341: if (--dmv->ref_cnt == 0)
! 342: cv_broadcast(&dmv->dev_cv);
! 343: mutex_exit(&dmv->dev_mtx);
! 344: }
1.1.2.1 haad 345:
346: /*
347: * Return prop_array of dm_targer_list dictionaries.
348: */
349: prop_array_t
350: dm_dev_prop_list(void)
351: {
352: struct dm_dev *dmd;
353:
354: int j;
355:
356: prop_array_t dev_array;
357: prop_dictionary_t dev_dict;
358:
359: j =0;
360:
361: dev_array = prop_array_create();
362:
363: mutex_enter(&dm_dev_mutex);
364:
1.1.2.2 haad 365: TAILQ_FOREACH(dmd, &dm_dev_list,next_devlist) {
1.1.2.1 haad 366: dev_dict = prop_dictionary_create();
367:
1.1.2.2 haad 368: prop_dictionary_set_cstring(dev_dict, DM_DEV_NAME, dmd->name);
1.1.2.1 haad 369:
1.1.2.2 haad 370: prop_dictionary_set_uint32(dev_dict, DM_DEV_DEV, dmd->minor);
1.1.2.1 haad 371:
1.1.2.2 haad 372: prop_array_set(dev_array, j, dev_dict);
1.1.2.1 haad 373:
374: prop_object_release(dev_dict);
375:
376: j++;
377: }
378:
1.1.2.11! haad 379: mutex_exit(&dm_dev_mutex);
1.1.2.1 haad 380: return dev_array;
381: }
382:
383: /*
1.1.2.7 haad 384: * Initialize global device mutex.
1.1.2.1 haad 385: */
386: int
387: dm_dev_init()
388: {
1.1.2.7 haad 389: TAILQ_INIT(&dm_dev_list); /* initialize global dev list */
1.1.2.2 haad 390: mutex_init(&dm_dev_mutex, MUTEX_DEFAULT, IPL_NONE);
1.1.2.1 haad 391: return 0;
392: }
CVSweb <webmaster@jp.NetBSD.org>