dm_target.c revision 1.36 1 1.36 tkusumi /* $NetBSD: dm_target.c,v 1.36 2019/12/21 16:00:29 tkusumi Exp $ */
2 1.2 haad
3 1.2 haad /*
4 1.2 haad * Copyright (c) 2008 The NetBSD Foundation, Inc.
5 1.2 haad * All rights reserved.
6 1.2 haad *
7 1.2 haad * This code is derived from software contributed to The NetBSD Foundation
8 1.2 haad * by Adam Hamsik.
9 1.2 haad *
10 1.2 haad * Redistribution and use in source and binary forms, with or without
11 1.2 haad * modification, are permitted provided that the following conditions
12 1.2 haad * are met:
13 1.2 haad * 1. Redistributions of source code Must retain the above copyright
14 1.2 haad * notice, this list of conditions and the following disclaimer.
15 1.2 haad * 2. Redistributions in binary form must reproduce the above copyright
16 1.2 haad * notice, this list of conditions and the following disclaimer in the
17 1.2 haad * documentation and/or other materials provided with the distribution.
18 1.2 haad *
19 1.2 haad * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS
20 1.2 haad * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
21 1.2 haad * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
22 1.2 haad * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS
23 1.2 haad * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
24 1.2 haad * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
25 1.2 haad * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
26 1.2 haad * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
27 1.2 haad * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
28 1.2 haad * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
29 1.2 haad * POSSIBILITY OF SUCH DAMAGE.
30 1.2 haad */
31 1.20 christos #include <sys/cdefs.h>
32 1.36 tkusumi __KERNEL_RCSID(0, "$NetBSD: dm_target.c,v 1.36 2019/12/21 16:00:29 tkusumi Exp $");
33 1.2 haad
34 1.2 haad #include <sys/types.h>
35 1.2 haad #include <sys/param.h>
36 1.2 haad #include <sys/kmem.h>
37 1.7 haad #include <sys/module.h>
38 1.7 haad
39 1.2 haad #include "netbsd-dm.h"
40 1.2 haad #include "dm.h"
41 1.2 haad
42 1.12 haad static dm_target_t *dm_target_lookup_name(const char *);
43 1.2 haad
44 1.2 haad TAILQ_HEAD(dm_target_head, dm_target);
45 1.2 haad
46 1.2 haad static struct dm_target_head dm_target_list =
47 1.2 haad TAILQ_HEAD_INITIALIZER(dm_target_list);
48 1.2 haad
49 1.21 tkusumi static kmutex_t dm_target_mutex;
50 1.3 haad
51 1.3 haad /*
52 1.10 yamt * Called indirectly from dm_table_load_ioctl to mark target as used.
53 1.3 haad */
54 1.3 haad void
55 1.25 tkusumi dm_target_busy(dm_target_t *target)
56 1.3 haad {
57 1.32 tkusumi
58 1.7 haad atomic_inc_32(&target->ref_cnt);
59 1.3 haad }
60 1.20 christos
61 1.7 haad /*
62 1.7 haad * Release reference counter on target.
63 1.7 haad */
64 1.3 haad void
65 1.25 tkusumi dm_target_unbusy(dm_target_t *target)
66 1.3 haad {
67 1.32 tkusumi
68 1.7 haad KASSERT(target->ref_cnt > 0);
69 1.7 haad atomic_dec_32(&target->ref_cnt);
70 1.3 haad }
71 1.20 christos
72 1.7 haad /*
73 1.7 haad * Try to autoload target module if it was not found in current
74 1.7 haad * target list.
75 1.7 haad */
76 1.7 haad dm_target_t *
77 1.7 haad dm_target_autoload(const char *dm_target_name)
78 1.7 haad {
79 1.8 haad char name[30];
80 1.34 tkusumi unsigned int gen;
81 1.7 haad dm_target_t *dmt;
82 1.7 haad
83 1.8 haad snprintf(name, sizeof(name), "dm_target_%s", dm_target_name);
84 1.12 haad name[29] = '\0';
85 1.12 haad
86 1.7 haad do {
87 1.7 haad gen = module_gen;
88 1.12 haad
89 1.7 haad /* Try to autoload target module */
90 1.28 tkusumi module_autoload(name, MODULE_CLASS_MISC);
91 1.12 haad } while (gen != module_gen);
92 1.7 haad
93 1.7 haad mutex_enter(&dm_target_mutex);
94 1.7 haad dmt = dm_target_lookup_name(dm_target_name);
95 1.9 haad if (dmt != NULL)
96 1.9 haad dm_target_busy(dmt);
97 1.7 haad mutex_exit(&dm_target_mutex);
98 1.12 haad
99 1.7 haad return dmt;
100 1.7 haad }
101 1.20 christos
102 1.7 haad /*
103 1.7 haad * Lookup for target in global target list.
104 1.7 haad */
105 1.3 haad dm_target_t *
106 1.3 haad dm_target_lookup(const char *dm_target_name)
107 1.3 haad {
108 1.3 haad dm_target_t *dmt;
109 1.3 haad
110 1.7 haad if (dm_target_name == NULL)
111 1.7 haad return NULL;
112 1.7 haad
113 1.3 haad mutex_enter(&dm_target_mutex);
114 1.3 haad
115 1.7 haad dmt = dm_target_lookup_name(dm_target_name);
116 1.3 haad if (dmt != NULL)
117 1.3 haad dm_target_busy(dmt);
118 1.12 haad
119 1.3 haad mutex_exit(&dm_target_mutex);
120 1.12 haad
121 1.12 haad return dmt;
122 1.3 haad }
123 1.20 christos
124 1.2 haad /*
125 1.2 haad * Search for name in TAIL and return apropriate pointer.
126 1.2 haad */
127 1.12 haad static dm_target_t *
128 1.2 haad dm_target_lookup_name(const char *dm_target_name)
129 1.2 haad {
130 1.2 haad dm_target_t *dm_target;
131 1.20 christos size_t dlen;
132 1.20 christos size_t slen;
133 1.2 haad
134 1.3 haad slen = strlen(dm_target_name) + 1;
135 1.2 haad
136 1.3 haad TAILQ_FOREACH(dm_target, &dm_target_list, dm_target_next) {
137 1.3 haad dlen = strlen(dm_target->name) + 1;
138 1.2 haad if (dlen != slen)
139 1.2 haad continue;
140 1.12 haad
141 1.7 haad if (strncmp(dm_target_name, dm_target->name, slen) == 0)
142 1.3 haad return dm_target;
143 1.2 haad }
144 1.2 haad
145 1.2 haad return NULL;
146 1.2 haad }
147 1.20 christos
148 1.2 haad /*
149 1.2 haad * Insert new target struct into the TAIL.
150 1.2 haad * dm_target
151 1.2 haad * contains name, version, function pointer to specifif target functions.
152 1.2 haad */
153 1.2 haad int
154 1.25 tkusumi dm_target_insert(dm_target_t *dm_target)
155 1.2 haad {
156 1.2 haad dm_target_t *dmt;
157 1.12 haad
158 1.18 ahoka /* Sanity check for any missing function */
159 1.27 tkusumi if (dm_target->init == NULL) {
160 1.27 tkusumi printf("%s missing init\n", dm_target->name);
161 1.27 tkusumi return EINVAL;
162 1.27 tkusumi }
163 1.29 tkusumi if (dm_target->table == NULL) {
164 1.29 tkusumi printf("%s missing table\n", dm_target->name);
165 1.27 tkusumi return EINVAL;
166 1.27 tkusumi }
167 1.27 tkusumi if (dm_target->strategy == NULL) {
168 1.27 tkusumi printf("%s missing strategy\n", dm_target->name);
169 1.27 tkusumi return EINVAL;
170 1.27 tkusumi }
171 1.27 tkusumi if (dm_target->destroy == NULL) {
172 1.27 tkusumi printf("%s missing destroy\n", dm_target->name);
173 1.27 tkusumi return EINVAL;
174 1.27 tkusumi }
175 1.27 tkusumi if (dm_target->upcall == NULL) {
176 1.27 tkusumi printf("%s missing upcall\n", dm_target->name);
177 1.27 tkusumi return EINVAL;
178 1.27 tkusumi }
179 1.18 ahoka
180 1.3 haad mutex_enter(&dm_target_mutex);
181 1.2 haad
182 1.2 haad dmt = dm_target_lookup_name(dm_target->name);
183 1.3 haad if (dmt != NULL) {
184 1.3 haad mutex_exit(&dm_target_mutex);
185 1.2 haad return EEXIST;
186 1.3 haad }
187 1.2 haad TAILQ_INSERT_TAIL(&dm_target_list, dm_target, dm_target_next);
188 1.3 haad
189 1.3 haad mutex_exit(&dm_target_mutex);
190 1.12 haad
191 1.2 haad return 0;
192 1.2 haad }
193 1.2 haad
194 1.2 haad /*
195 1.19 snj * Remove target from TAIL, target is selected with its name.
196 1.2 haad */
197 1.2 haad int
198 1.26 tkusumi dm_target_rem(const char *dm_target_name)
199 1.2 haad {
200 1.3 haad dm_target_t *dmt;
201 1.12 haad
202 1.2 haad KASSERT(dm_target_name != NULL);
203 1.3 haad
204 1.3 haad mutex_enter(&dm_target_mutex);
205 1.12 haad
206 1.3 haad dmt = dm_target_lookup_name(dm_target_name);
207 1.3 haad if (dmt == NULL) {
208 1.3 haad mutex_exit(&dm_target_mutex);
209 1.2 haad return ENOENT;
210 1.3 haad }
211 1.3 haad if (dmt->ref_cnt > 0) {
212 1.3 haad mutex_exit(&dm_target_mutex);
213 1.3 haad return EBUSY;
214 1.3 haad }
215 1.22 tkusumi TAILQ_REMOVE(&dm_target_list, dmt, dm_target_next);
216 1.3 haad
217 1.3 haad mutex_exit(&dm_target_mutex);
218 1.12 haad
219 1.28 tkusumi kmem_free(dmt, sizeof(dm_target_t));
220 1.2 haad
221 1.2 haad return 0;
222 1.2 haad }
223 1.20 christos
224 1.2 haad /*
225 1.2 haad * Destroy all targets and remove them from queue.
226 1.2 haad * This routine is called from dm_detach, before module
227 1.2 haad * is unloaded.
228 1.2 haad */
229 1.2 haad int
230 1.2 haad dm_target_destroy(void)
231 1.2 haad {
232 1.2 haad dm_target_t *dm_target;
233 1.2 haad
234 1.3 haad mutex_enter(&dm_target_mutex);
235 1.12 haad
236 1.24 tkusumi while ((dm_target = TAILQ_FIRST(&dm_target_list)) != NULL) {
237 1.24 tkusumi TAILQ_REMOVE(&dm_target_list, dm_target, dm_target_next);
238 1.28 tkusumi kmem_free(dm_target, sizeof(dm_target_t));
239 1.2 haad }
240 1.24 tkusumi KASSERT(TAILQ_EMPTY(&dm_target_list));
241 1.24 tkusumi
242 1.3 haad mutex_exit(&dm_target_mutex);
243 1.12 haad
244 1.4 haad mutex_destroy(&dm_target_mutex);
245 1.12 haad
246 1.2 haad return 0;
247 1.2 haad }
248 1.20 christos
249 1.2 haad /*
250 1.2 haad * Allocate new target entry.
251 1.2 haad */
252 1.12 haad dm_target_t *
253 1.2 haad dm_target_alloc(const char *name)
254 1.2 haad {
255 1.23 tkusumi dm_target_t *dmt;
256 1.23 tkusumi
257 1.23 tkusumi dmt = kmem_zalloc(sizeof(dm_target_t), KM_SLEEP);
258 1.23 tkusumi if (dmt == NULL)
259 1.23 tkusumi return NULL;
260 1.23 tkusumi
261 1.23 tkusumi if (name)
262 1.23 tkusumi strlcpy(dmt->name, name, sizeof(dmt->name));
263 1.23 tkusumi
264 1.23 tkusumi return dmt;
265 1.2 haad }
266 1.20 christos
267 1.2 haad /*
268 1.2 haad * Return prop_array of dm_target dictionaries.
269 1.2 haad */
270 1.2 haad prop_array_t
271 1.2 haad dm_target_prop_list(void)
272 1.2 haad {
273 1.32 tkusumi prop_array_t target_array;
274 1.2 haad dm_target_t *dm_target;
275 1.2 haad
276 1.2 haad target_array = prop_array_create();
277 1.3 haad
278 1.3 haad mutex_enter(&dm_target_mutex);
279 1.2 haad
280 1.12 haad TAILQ_FOREACH(dm_target, &dm_target_list, dm_target_next) {
281 1.32 tkusumi prop_array_t ver;
282 1.32 tkusumi prop_dictionary_t target_dict;
283 1.32 tkusumi int i;
284 1.32 tkusumi
285 1.12 haad target_dict = prop_dictionary_create();
286 1.2 haad ver = prop_array_create();
287 1.2 haad prop_dictionary_set_cstring(target_dict, DM_TARGETS_NAME,
288 1.2 haad dm_target->name);
289 1.2 haad
290 1.2 haad for (i = 0; i < 3; i++)
291 1.2 haad prop_array_add_uint32(ver, dm_target->version[i]);
292 1.2 haad
293 1.2 haad prop_dictionary_set(target_dict, DM_TARGETS_VERSION, ver);
294 1.2 haad prop_array_add(target_array, target_dict);
295 1.2 haad
296 1.2 haad prop_object_release(ver);
297 1.2 haad prop_object_release(target_dict);
298 1.2 haad }
299 1.2 haad
300 1.3 haad mutex_exit(&dm_target_mutex);
301 1.12 haad
302 1.2 haad return target_array;
303 1.2 haad }
304 1.20 christos
305 1.32 tkusumi /*
306 1.32 tkusumi * Initialize dm_target subsystem.
307 1.32 tkusumi */
308 1.2 haad int
309 1.2 haad dm_target_init(void)
310 1.2 haad {
311 1.33 tkusumi dm_target_t *dmt;
312 1.2 haad
313 1.3 haad mutex_init(&dm_target_mutex, MUTEX_DEFAULT, IPL_NONE);
314 1.12 haad
315 1.2 haad dmt = dm_target_alloc("linear");
316 1.2 haad dmt->version[0] = 1;
317 1.2 haad dmt->version[1] = 0;
318 1.2 haad dmt->version[2] = 2;
319 1.2 haad dmt->init = &dm_target_linear_init;
320 1.29 tkusumi dmt->table = &dm_target_linear_table;
321 1.2 haad dmt->strategy = &dm_target_linear_strategy;
322 1.13 haad dmt->sync = &dm_target_linear_sync;
323 1.2 haad dmt->destroy = &dm_target_linear_destroy;
324 1.2 haad dmt->upcall = &dm_target_linear_upcall;
325 1.15 mlelstv dmt->secsize = &dm_target_linear_secsize;
326 1.33 tkusumi if (dm_target_insert(dmt))
327 1.33 tkusumi printf("Failed to insert linear\n");
328 1.12 haad
329 1.33 tkusumi dmt = dm_target_alloc("striped");
330 1.33 tkusumi dmt->version[0] = 1;
331 1.33 tkusumi dmt->version[1] = 0;
332 1.33 tkusumi dmt->version[2] = 3;
333 1.33 tkusumi dmt->init = &dm_target_stripe_init;
334 1.36 tkusumi dmt->info = &dm_target_stripe_info;
335 1.33 tkusumi dmt->table = &dm_target_stripe_table;
336 1.33 tkusumi dmt->strategy = &dm_target_stripe_strategy;
337 1.33 tkusumi dmt->sync = &dm_target_stripe_sync;
338 1.33 tkusumi dmt->destroy = &dm_target_stripe_destroy;
339 1.33 tkusumi dmt->upcall = &dm_target_stripe_upcall;
340 1.33 tkusumi dmt->secsize = &dm_target_stripe_secsize;
341 1.33 tkusumi if (dm_target_insert(dmt))
342 1.33 tkusumi printf("Failed to insert striped\n");
343 1.12 haad
344 1.33 tkusumi dmt = dm_target_alloc("error");
345 1.33 tkusumi dmt->version[0] = 1;
346 1.33 tkusumi dmt->version[1] = 0;
347 1.33 tkusumi dmt->version[2] = 0;
348 1.33 tkusumi dmt->init = &dm_target_error_init;
349 1.33 tkusumi dmt->table = &dm_target_error_table;
350 1.33 tkusumi dmt->strategy = &dm_target_error_strategy;
351 1.33 tkusumi dmt->destroy = &dm_target_error_destroy;
352 1.33 tkusumi dmt->upcall = &dm_target_error_upcall;
353 1.33 tkusumi if (dm_target_insert(dmt))
354 1.33 tkusumi printf("Failed to insert error\n");
355 1.12 haad
356 1.33 tkusumi dmt = dm_target_alloc("zero");
357 1.33 tkusumi dmt->version[0] = 1;
358 1.33 tkusumi dmt->version[1] = 0;
359 1.33 tkusumi dmt->version[2] = 0;
360 1.33 tkusumi dmt->init = &dm_target_zero_init;
361 1.33 tkusumi dmt->table = &dm_target_zero_table;
362 1.33 tkusumi dmt->strategy = &dm_target_zero_strategy;
363 1.33 tkusumi dmt->destroy = &dm_target_zero_destroy;
364 1.33 tkusumi dmt->upcall = &dm_target_zero_upcall;
365 1.33 tkusumi if (dm_target_insert(dmt))
366 1.33 tkusumi printf("Failed to insert zero\n");
367 1.2 haad
368 1.33 tkusumi return 0;
369 1.2 haad }
370