dm_dev.c revision 1.1.2.9 1 1.1.2.9 haad /* $NetBSD: dm_dev.c,v 1.1.2.9 2008/09/10 18:43:27 haad Exp $ */
2 1.1.2.4 haad
3 1.1.2.1 haad /*
4 1.1.2.1 haad * Copyright (c) 1996, 1997, 1998, 1999, 2002 The NetBSD Foundation, Inc.
5 1.1.2.1 haad * All rights reserved.
6 1.1.2.1 haad *
7 1.1.2.1 haad * This code is derived from software contributed to The NetBSD Foundation
8 1.1.2.1 haad * by Adam Hamsik.
9 1.1.2.1 haad *
10 1.1.2.1 haad * Redistribution and use in source and binary forms, with or without
11 1.1.2.1 haad * modification, are permitted provided that the following conditions
12 1.1.2.1 haad * are met:
13 1.1.2.1 haad * 1. Redistributions of source code must retain the above copyright
14 1.1.2.1 haad * notice, this list of conditions and the following disclaimer.
15 1.1.2.1 haad * 2. Redistributions in binary form must reproduce the above copyright
16 1.1.2.1 haad * notice, this list of conditions and the following disclaimer in the
17 1.1.2.1 haad * documentation and/or other materials provided with the distribution.
18 1.1.2.1 haad *
19 1.1.2.1 haad * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.1.2.1 haad * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.1.2.1 haad * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.1.2.1 haad * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.1.2.1 haad * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.1.2.1 haad * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.1.2.1 haad * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.1.2.1 haad * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.1.2.1 haad * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.1.2.1 haad * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.1.2.1 haad * POSSIBILITY OF SUCH DAMAGE.
30 1.1.2.1 haad */
31 1.1.2.1 haad
32 1.1.2.1 haad
33 1.1.2.1 haad #include <sys/types.h>
34 1.1.2.1 haad #include <sys/param.h>
35 1.1.2.1 haad
36 1.1.2.3 haad #include <sys/disklabel.h>
37 1.1.2.1 haad #include <sys/errno.h>
38 1.1.2.1 haad #include <sys/ioctl.h>
39 1.1.2.1 haad #include <sys/ioccom.h>
40 1.1.2.1 haad #include <sys/kmem.h>
41 1.1.2.1 haad #include <sys/lkm.h>
42 1.1.2.1 haad #include <sys/queue.h>
43 1.1.2.1 haad
44 1.1.2.1 haad #include "netbsd-dm.h"
45 1.1.2.1 haad #include "dm.h"
46 1.1.2.1 haad
47 1.1.2.9 haad static struct dm_dev* dm_dev_lookup_name(const char *);
48 1.1.2.9 haad static struct dm_dev* dm_dev_lookup_uuid(const char *);
49 1.1.2.9 haad static struct dm_dev* dm_dev_lookup_minor(int);
50 1.1.2.9 haad
51 1.1.2.1 haad static struct dm_dev_head dm_dev_list =
52 1.1.2.1 haad TAILQ_HEAD_INITIALIZER(dm_dev_list);
53 1.1.2.1 haad
54 1.1.2.1 haad kmutex_t dm_dev_mutex;
55 1.1.2.1 haad
56 1.1.2.1 haad /*
57 1.1.2.1 haad * Locking architecture, for now I use mutexes later we can convert them to
58 1.1.2.2 haad * rw_locks. I use IPL_NONE for specifing IPL type for mutex.
59 1.1.2.2 haad * I will enter into mutex everytime I'm working with dm_dev_list.
60 1.1.2.1 haad */
61 1.1.2.1 haad
62 1.1.2.1 haad /*
63 1.1.2.9 haad * Generic function used to lookup struct dm_dev. Calling with dm_dev_name
64 1.1.2.9 haad * and dm_dev_uuid NULL is allowed.
65 1.1.2.1 haad */
66 1.1.2.9 haad
67 1.1.2.1 haad struct dm_dev*
68 1.1.2.9 haad dm_dev_lookup(const char *dm_dev_name, const char *dm_dev_uuid,
69 1.1.2.9 haad int dm_dev_minor)
70 1.1.2.9 haad {
71 1.1.2.9 haad struct dm_dev *dmv;
72 1.1.2.9 haad
73 1.1.2.9 haad dmv = NULL;
74 1.1.2.9 haad
75 1.1.2.9 haad if (dm_dev_minor > 0)
76 1.1.2.9 haad if ((dmv = dm_dev_lookup_minor(dm_dev_minor)) != NULL)
77 1.1.2.9 haad return dmv;
78 1.1.2.9 haad
79 1.1.2.9 haad if (dm_dev_name != NULL)
80 1.1.2.9 haad if ((dmv = dm_dev_lookup_name(dm_dev_name)) != NULL)
81 1.1.2.9 haad return dmv;
82 1.1.2.9 haad
83 1.1.2.9 haad if (dm_dev_uuid != NULL)
84 1.1.2.9 haad if ((dmv = dm_dev_lookup_name(dm_dev_uuid)) != NULL)
85 1.1.2.9 haad return dmv;
86 1.1.2.9 haad
87 1.1.2.9 haad return NULL;
88 1.1.2.9 haad }
89 1.1.2.9 haad
90 1.1.2.9 haad
91 1.1.2.9 haad /*
92 1.1.2.9 haad * Lookup device with its minor number.
93 1.1.2.9 haad */
94 1.1.2.9 haad static struct dm_dev*
95 1.1.2.1 haad dm_dev_lookup_minor(int dm_dev_minor)
96 1.1.2.1 haad {
97 1.1.2.1 haad struct dm_dev *dm_dev;
98 1.1.2.1 haad
99 1.1.2.1 haad mutex_enter(&dm_dev_mutex);
100 1.1.2.1 haad
101 1.1.2.2 haad TAILQ_FOREACH(dm_dev, &dm_dev_list, next_devlist){
102 1.1.2.1 haad if (dm_dev_minor == dm_dev->minor){
103 1.1.2.1 haad mutex_exit(&dm_dev_mutex);
104 1.1.2.1 haad return dm_dev;
105 1.1.2.1 haad }
106 1.1.2.1 haad }
107 1.1.2.1 haad
108 1.1.2.1 haad mutex_exit(&dm_dev_mutex);
109 1.1.2.1 haad
110 1.1.2.1 haad return NULL;
111 1.1.2.1 haad }
112 1.1.2.1 haad
113 1.1.2.1 haad /*
114 1.1.2.1 haad * Lookup device with it's device name.
115 1.1.2.1 haad */
116 1.1.2.9 haad static struct dm_dev*
117 1.1.2.1 haad dm_dev_lookup_name(const char *dm_dev_name)
118 1.1.2.1 haad {
119 1.1.2.1 haad struct dm_dev *dm_dev;
120 1.1.2.1 haad int dlen; int slen;
121 1.1.2.1 haad
122 1.1.2.9 haad slen = strlen(dm_dev_name);
123 1.1.2.9 haad
124 1.1.2.9 haad if (slen == 0)
125 1.1.2.1 haad return NULL;
126 1.1.2.1 haad
127 1.1.2.1 haad mutex_enter(&dm_dev_mutex);
128 1.1.2.1 haad
129 1.1.2.2 haad TAILQ_FOREACH(dm_dev, &dm_dev_list, next_devlist){
130 1.1.2.9 haad
131 1.1.2.1 haad dlen = strlen(dm_dev->name);
132 1.1.2.9 haad
133 1.1.2.1 haad if(slen != dlen)
134 1.1.2.1 haad continue;
135 1.1.2.9 haad
136 1.1.2.2 haad if (strncmp(dm_dev_name, dm_dev->name, slen) == 0) {
137 1.1.2.1 haad mutex_exit(&dm_dev_mutex);
138 1.1.2.1 haad return dm_dev;
139 1.1.2.1 haad }
140 1.1.2.1 haad }
141 1.1.2.1 haad
142 1.1.2.1 haad mutex_exit(&dm_dev_mutex);
143 1.1.2.1 haad
144 1.1.2.1 haad return NULL;
145 1.1.2.1 haad }
146 1.1.2.1 haad
147 1.1.2.1 haad /*
148 1.1.2.1 haad * Lookup device with it's device uuid. Used mostly by LVM2tools.
149 1.1.2.1 haad */
150 1.1.2.9 haad static struct dm_dev*
151 1.1.2.1 haad dm_dev_lookup_uuid(const char *dm_dev_uuid)
152 1.1.2.1 haad {
153 1.1.2.1 haad struct dm_dev *dm_dev;
154 1.1.2.6 haad size_t len;
155 1.1.2.6 haad
156 1.1.2.6 haad len = 0;
157 1.1.2.9 haad
158 1.1.2.9 haad len = strlen(dm_dev_uuid);
159 1.1.2.6 haad
160 1.1.2.9 haad if (len == 0)
161 1.1.2.1 haad return NULL;
162 1.1.2.1 haad
163 1.1.2.1 haad mutex_enter(&dm_dev_mutex);
164 1.1.2.1 haad
165 1.1.2.6 haad TAILQ_FOREACH(dm_dev, &dm_dev_list, next_devlist){
166 1.1.2.6 haad
167 1.1.2.6 haad if (strlen(dm_dev->uuid) != len)
168 1.1.2.9 haad continue;
169 1.1.2.6 haad
170 1.1.2.9 haad if (strncmp(dm_dev_uuid, dm_dev->uuid, strlen(dm_dev->uuid)) == 0){
171 1.1.2.9 haad mutex_exit(&dm_dev_mutex);
172 1.1.2.9 haad return dm_dev;
173 1.1.2.9 haad }
174 1.1.2.6 haad }
175 1.1.2.6 haad mutex_exit(&dm_dev_mutex);
176 1.1.2.1 haad
177 1.1.2.1 haad return NULL;
178 1.1.2.1 haad }
179 1.1.2.1 haad
180 1.1.2.1 haad /*
181 1.1.2.1 haad * Insert new device to the global list of devices.
182 1.1.2.1 haad */
183 1.1.2.1 haad int
184 1.1.2.1 haad dm_dev_insert(struct dm_dev *dev)
185 1.1.2.1 haad {
186 1.1.2.1 haad struct dm_dev *dmt;
187 1.1.2.1 haad int r;
188 1.1.2.1 haad
189 1.1.2.1 haad dmt = NULL;
190 1.1.2.1 haad r = 0;
191 1.1.2.1 haad
192 1.1.2.6 haad if (((dmt = dm_dev_lookup_uuid(dev->uuid)) == NULL) &&
193 1.1.2.6 haad ((dmt = dm_dev_lookup_name(dev->name)) == NULL) &&
194 1.1.2.6 haad ((dmt = dm_dev_lookup_minor(dev->minor)) == NULL)){
195 1.1.2.1 haad
196 1.1.2.1 haad mutex_enter(&dm_dev_mutex);
197 1.1.2.1 haad TAILQ_INSERT_TAIL(&dm_dev_list, dev, next_devlist);
198 1.1.2.1 haad mutex_exit(&dm_dev_mutex);
199 1.1.2.1 haad } else
200 1.1.2.1 haad r = EEXIST;
201 1.1.2.1 haad
202 1.1.2.1 haad return r;
203 1.1.2.1 haad }
204 1.1.2.1 haad
205 1.1.2.1 haad
206 1.1.2.1 haad /*
207 1.1.2.6 haad * Remove device selected with dm_dev from global list of devices.
208 1.1.2.1 haad */
209 1.1.2.1 haad int
210 1.1.2.6 haad dm_dev_rem(struct dm_dev *dm_dev)
211 1.1.2.6 haad {
212 1.1.2.1 haad mutex_enter(&dm_dev_mutex);
213 1.1.2.1 haad
214 1.1.2.2 haad TAILQ_REMOVE(&dm_dev_list, dm_dev, next_devlist);
215 1.1.2.1 haad
216 1.1.2.1 haad mutex_exit(&dm_dev_mutex);
217 1.1.2.1 haad
218 1.1.2.6 haad return 0;
219 1.1.2.1 haad }
220 1.1.2.1 haad
221 1.1.2.1 haad /*
222 1.1.2.5 haad * Destroy all devices created in device-mapper. Remove all tables
223 1.1.2.5 haad * free all allocated memmory.
224 1.1.2.5 haad */
225 1.1.2.5 haad
226 1.1.2.5 haad int
227 1.1.2.5 haad dm_dev_destroy(void)
228 1.1.2.5 haad {
229 1.1.2.5 haad struct dm_dev *dm_dev;
230 1.1.2.5 haad
231 1.1.2.8 haad /* XXX should I get rw_lock here ? */
232 1.1.2.5 haad mutex_enter(&dm_dev_mutex);
233 1.1.2.5 haad
234 1.1.2.5 haad while (TAILQ_FIRST(&dm_dev_list) != NULL){
235 1.1.2.5 haad
236 1.1.2.5 haad dm_dev = TAILQ_FIRST(&dm_dev_list);
237 1.1.2.5 haad
238 1.1.2.5 haad TAILQ_REMOVE(&dm_dev_list, TAILQ_FIRST(&dm_dev_list),
239 1.1.2.5 haad next_devlist);
240 1.1.2.5 haad
241 1.1.2.5 haad /* Destroy active table first. */
242 1.1.2.8 haad if (!SLIST_EMPTY(&dm_dev->tables[dm_dev->cur_active_table]))
243 1.1.2.8 haad dm_table_destroy(&dm_dev->tables[dm_dev->cur_active_table]);
244 1.1.2.5 haad
245 1.1.2.5 haad /* Destroy unactive table if exits, too. */
246 1.1.2.5 haad if (!SLIST_EMPTY(&dm_dev->tables[1 - dm_dev->cur_active_table]))
247 1.1.2.5 haad dm_table_destroy(&dm_dev->tables[1 - dm_dev->cur_active_table]);
248 1.1.2.5 haad
249 1.1.2.5 haad (void)kmem_free(dm_dev, sizeof(struct dm_dev));
250 1.1.2.5 haad }
251 1.1.2.5 haad
252 1.1.2.5 haad mutex_exit(&dm_dev_mutex);
253 1.1.2.5 haad
254 1.1.2.5 haad return 0;
255 1.1.2.5 haad }
256 1.1.2.5 haad
257 1.1.2.5 haad /*
258 1.1.2.1 haad * Allocate new device entry.
259 1.1.2.1 haad */
260 1.1.2.1 haad struct dm_dev*
261 1.1.2.1 haad dm_dev_alloc()
262 1.1.2.8 haad {
263 1.1.2.8 haad return kmem_zalloc(sizeof(struct dm_dev), KM_NOSLEEP);
264 1.1.2.1 haad }
265 1.1.2.1 haad
266 1.1.2.1 haad /*
267 1.1.2.1 haad * Freed device entry.
268 1.1.2.1 haad */
269 1.1.2.1 haad int
270 1.1.2.1 haad dm_dev_free(struct dm_dev *dmv)
271 1.1.2.1 haad {
272 1.1.2.7 haad if (dmv != NULL)
273 1.1.2.6 haad (void)kmem_free(dmv, sizeof(struct dm_dev));
274 1.1.2.1 haad
275 1.1.2.1 haad return 0;
276 1.1.2.1 haad }
277 1.1.2.1 haad
278 1.1.2.1 haad
279 1.1.2.1 haad /*
280 1.1.2.1 haad * Return prop_array of dm_targer_list dictionaries.
281 1.1.2.1 haad */
282 1.1.2.1 haad prop_array_t
283 1.1.2.1 haad dm_dev_prop_list(void)
284 1.1.2.1 haad {
285 1.1.2.1 haad struct dm_dev *dmd;
286 1.1.2.1 haad
287 1.1.2.1 haad int j;
288 1.1.2.1 haad
289 1.1.2.1 haad prop_array_t dev_array;
290 1.1.2.1 haad prop_dictionary_t dev_dict;
291 1.1.2.1 haad
292 1.1.2.1 haad j =0;
293 1.1.2.1 haad
294 1.1.2.1 haad dev_array = prop_array_create();
295 1.1.2.1 haad
296 1.1.2.1 haad mutex_enter(&dm_dev_mutex);
297 1.1.2.1 haad
298 1.1.2.2 haad TAILQ_FOREACH(dmd, &dm_dev_list,next_devlist) {
299 1.1.2.1 haad dev_dict = prop_dictionary_create();
300 1.1.2.1 haad
301 1.1.2.2 haad prop_dictionary_set_cstring(dev_dict, DM_DEV_NAME, dmd->name);
302 1.1.2.1 haad
303 1.1.2.2 haad prop_dictionary_set_uint32(dev_dict, DM_DEV_DEV, dmd->minor);
304 1.1.2.1 haad
305 1.1.2.2 haad prop_array_set(dev_array, j, dev_dict);
306 1.1.2.1 haad
307 1.1.2.1 haad prop_object_release(dev_dict);
308 1.1.2.1 haad
309 1.1.2.1 haad j++;
310 1.1.2.1 haad }
311 1.1.2.1 haad
312 1.1.2.1 haad mutex_exit(&dm_dev_mutex);
313 1.1.2.1 haad
314 1.1.2.1 haad return dev_array;
315 1.1.2.1 haad }
316 1.1.2.1 haad
317 1.1.2.1 haad /*
318 1.1.2.7 haad * Initialize global device mutex.
319 1.1.2.1 haad */
320 1.1.2.1 haad int
321 1.1.2.1 haad dm_dev_init()
322 1.1.2.1 haad {
323 1.1.2.7 haad TAILQ_INIT(&dm_dev_list); /* initialize global dev list */
324 1.1.2.7 haad
325 1.1.2.2 haad mutex_init(&dm_dev_mutex, MUTEX_DEFAULT, IPL_NONE);
326 1.1.2.1 haad
327 1.1.2.1 haad return 0;
328 1.1.2.1 haad }
329