Home | History | Annotate | Line # | Download | only in dm
dm_target.c revision 1.29
      1  1.29   tkusumi /*        $NetBSD: dm_target.c,v 1.29 2019/12/15 05:56:02 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.29   tkusumi __KERNEL_RCSID(0, "$NetBSD: dm_target.c,v 1.29 2019/12/15 05:56:02 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 
     37   1.2      haad #include <sys/kmem.h>
     38   1.7      haad #include <sys/module.h>
     39   1.7      haad 
     40   1.2      haad 
     41   1.2      haad #include "netbsd-dm.h"
     42   1.2      haad #include "dm.h"
     43   1.2      haad 
     44  1.12      haad static dm_target_t *dm_target_lookup_name(const char *);
     45   1.2      haad 
     46   1.2      haad TAILQ_HEAD(dm_target_head, dm_target);
     47   1.2      haad 
     48   1.2      haad static struct dm_target_head dm_target_list =
     49   1.2      haad TAILQ_HEAD_INITIALIZER(dm_target_list);
     50   1.2      haad 
     51  1.21   tkusumi static kmutex_t dm_target_mutex;
     52   1.3      haad 
     53   1.3      haad /*
     54  1.10      yamt  * Called indirectly from dm_table_load_ioctl to mark target as used.
     55   1.3      haad  */
     56   1.3      haad void
     57  1.25   tkusumi dm_target_busy(dm_target_t *target)
     58   1.3      haad {
     59   1.7      haad 	atomic_inc_32(&target->ref_cnt);
     60   1.3      haad }
     61  1.20  christos 
     62   1.7      haad /*
     63   1.7      haad  * Release reference counter on target.
     64   1.7      haad  */
     65   1.3      haad void
     66  1.25   tkusumi dm_target_unbusy(dm_target_t *target)
     67   1.3      haad {
     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.7      haad 	u_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->deps == NULL) {
    172  1.27   tkusumi 		printf("%s missing deps\n", dm_target->name);
    173  1.27   tkusumi 		return EINVAL;
    174  1.27   tkusumi 	}
    175  1.27   tkusumi 	if (dm_target->destroy == NULL) {
    176  1.27   tkusumi 		printf("%s missing destroy\n", dm_target->name);
    177  1.27   tkusumi 		return EINVAL;
    178  1.27   tkusumi 	}
    179  1.27   tkusumi 	if (dm_target->upcall == NULL) {
    180  1.27   tkusumi 		printf("%s missing upcall\n", dm_target->name);
    181  1.27   tkusumi 		return EINVAL;
    182  1.27   tkusumi 	}
    183  1.27   tkusumi 	if (dm_target->sync == NULL) {
    184  1.27   tkusumi 		printf("%s missing sync\n", dm_target->name);
    185  1.27   tkusumi 		return EINVAL;
    186  1.27   tkusumi 	}
    187  1.27   tkusumi 	if (dm_target->secsize == NULL) {
    188  1.27   tkusumi 		printf("%s missing secsize\n", dm_target->name);
    189  1.27   tkusumi 		return EINVAL;
    190  1.27   tkusumi 	}
    191  1.18     ahoka 
    192   1.3      haad 	mutex_enter(&dm_target_mutex);
    193   1.2      haad 
    194   1.2      haad 	dmt = dm_target_lookup_name(dm_target->name);
    195   1.3      haad 	if (dmt != NULL) {
    196   1.3      haad 		mutex_exit(&dm_target_mutex);
    197   1.2      haad 		return EEXIST;
    198   1.3      haad 	}
    199   1.2      haad 	TAILQ_INSERT_TAIL(&dm_target_list, dm_target, dm_target_next);
    200   1.3      haad 
    201   1.3      haad 	mutex_exit(&dm_target_mutex);
    202  1.12      haad 
    203   1.2      haad 	return 0;
    204   1.2      haad }
    205   1.2      haad 
    206   1.2      haad /*
    207  1.19       snj  * Remove target from TAIL, target is selected with its name.
    208   1.2      haad  */
    209   1.2      haad int
    210  1.26   tkusumi dm_target_rem(const char *dm_target_name)
    211   1.2      haad {
    212   1.3      haad 	dm_target_t *dmt;
    213  1.12      haad 
    214   1.2      haad 	KASSERT(dm_target_name != NULL);
    215   1.3      haad 
    216   1.3      haad 	mutex_enter(&dm_target_mutex);
    217  1.12      haad 
    218   1.3      haad 	dmt = dm_target_lookup_name(dm_target_name);
    219   1.3      haad 	if (dmt == NULL) {
    220   1.3      haad 		mutex_exit(&dm_target_mutex);
    221   1.2      haad 		return ENOENT;
    222   1.3      haad 	}
    223   1.3      haad 	if (dmt->ref_cnt > 0) {
    224   1.3      haad 		mutex_exit(&dm_target_mutex);
    225   1.3      haad 		return EBUSY;
    226   1.3      haad 	}
    227  1.22   tkusumi 	TAILQ_REMOVE(&dm_target_list, dmt, dm_target_next);
    228   1.3      haad 
    229   1.3      haad 	mutex_exit(&dm_target_mutex);
    230  1.12      haad 
    231  1.28   tkusumi 	kmem_free(dmt, sizeof(dm_target_t));
    232   1.2      haad 
    233   1.2      haad 	return 0;
    234   1.2      haad }
    235  1.20  christos 
    236   1.2      haad /*
    237   1.2      haad  * Destroy all targets and remove them from queue.
    238   1.2      haad  * This routine is called from dm_detach, before module
    239   1.2      haad  * is unloaded.
    240   1.2      haad  */
    241   1.2      haad int
    242   1.2      haad dm_target_destroy(void)
    243   1.2      haad {
    244   1.2      haad 	dm_target_t *dm_target;
    245   1.2      haad 
    246   1.3      haad 	mutex_enter(&dm_target_mutex);
    247  1.12      haad 
    248  1.24   tkusumi 	while ((dm_target = TAILQ_FIRST(&dm_target_list)) != NULL) {
    249  1.24   tkusumi 		TAILQ_REMOVE(&dm_target_list, dm_target, dm_target_next);
    250  1.28   tkusumi 		kmem_free(dm_target, sizeof(dm_target_t));
    251   1.2      haad 	}
    252  1.24   tkusumi 	KASSERT(TAILQ_EMPTY(&dm_target_list));
    253  1.24   tkusumi 
    254   1.3      haad 	mutex_exit(&dm_target_mutex);
    255  1.12      haad 
    256   1.4      haad 	mutex_destroy(&dm_target_mutex);
    257  1.12      haad 
    258   1.2      haad 	return 0;
    259   1.2      haad }
    260  1.20  christos 
    261   1.2      haad /*
    262   1.2      haad  * Allocate new target entry.
    263   1.2      haad  */
    264  1.12      haad dm_target_t *
    265   1.2      haad dm_target_alloc(const char *name)
    266   1.2      haad {
    267  1.23   tkusumi 	dm_target_t *dmt;
    268  1.23   tkusumi 
    269  1.23   tkusumi 	dmt = kmem_zalloc(sizeof(dm_target_t), KM_SLEEP);
    270  1.23   tkusumi 	if (dmt == NULL)
    271  1.23   tkusumi 		return NULL;
    272  1.23   tkusumi 
    273  1.23   tkusumi 	if (name)
    274  1.23   tkusumi 		strlcpy(dmt->name, name, sizeof(dmt->name));
    275  1.23   tkusumi 
    276  1.23   tkusumi 	return dmt;
    277   1.2      haad }
    278  1.20  christos 
    279   1.2      haad /*
    280   1.2      haad  * Return prop_array of dm_target dictionaries.
    281   1.2      haad  */
    282   1.2      haad prop_array_t
    283   1.2      haad dm_target_prop_list(void)
    284   1.2      haad {
    285  1.12      haad 	prop_array_t target_array, ver;
    286   1.2      haad 	prop_dictionary_t target_dict;
    287   1.2      haad 	dm_target_t *dm_target;
    288   1.2      haad 
    289   1.2      haad 	size_t i;
    290   1.2      haad 
    291   1.2      haad 	target_array = prop_array_create();
    292   1.3      haad 
    293   1.3      haad 	mutex_enter(&dm_target_mutex);
    294   1.2      haad 
    295  1.12      haad 	TAILQ_FOREACH(dm_target, &dm_target_list, dm_target_next) {
    296  1.12      haad 		target_dict = prop_dictionary_create();
    297   1.2      haad 		ver = prop_array_create();
    298   1.2      haad 		prop_dictionary_set_cstring(target_dict, DM_TARGETS_NAME,
    299   1.2      haad 		    dm_target->name);
    300   1.2      haad 
    301   1.2      haad 		for (i = 0; i < 3; i++)
    302   1.2      haad 			prop_array_add_uint32(ver, dm_target->version[i]);
    303   1.2      haad 
    304   1.2      haad 		prop_dictionary_set(target_dict, DM_TARGETS_VERSION, ver);
    305   1.2      haad 		prop_array_add(target_array, target_dict);
    306   1.2      haad 
    307   1.2      haad 		prop_object_release(ver);
    308   1.2      haad 		prop_object_release(target_dict);
    309   1.2      haad 	}
    310   1.2      haad 
    311   1.3      haad 	mutex_exit(&dm_target_mutex);
    312  1.12      haad 
    313   1.2      haad 	return target_array;
    314   1.2      haad }
    315  1.20  christos 
    316   1.2      haad /* Initialize dm_target subsystem. */
    317   1.2      haad int
    318   1.2      haad dm_target_init(void)
    319   1.2      haad {
    320  1.12      haad 	dm_target_t *dmt, *dmt3;
    321   1.2      haad 	int r;
    322   1.2      haad 
    323   1.2      haad 	r = 0;
    324   1.3      haad 
    325   1.3      haad 	mutex_init(&dm_target_mutex, MUTEX_DEFAULT, IPL_NONE);
    326  1.12      haad 
    327   1.2      haad 	dmt = dm_target_alloc("linear");
    328   1.2      haad 	dmt3 = dm_target_alloc("striped");
    329  1.12      haad 
    330   1.2      haad 	dmt->version[0] = 1;
    331   1.2      haad 	dmt->version[1] = 0;
    332   1.2      haad 	dmt->version[2] = 2;
    333   1.2      haad 	dmt->init = &dm_target_linear_init;
    334  1.29   tkusumi 	dmt->table = &dm_target_linear_table;
    335   1.2      haad 	dmt->strategy = &dm_target_linear_strategy;
    336  1.13      haad 	dmt->sync = &dm_target_linear_sync;
    337   1.2      haad 	dmt->deps = &dm_target_linear_deps;
    338   1.2      haad 	dmt->destroy = &dm_target_linear_destroy;
    339   1.2      haad 	dmt->upcall = &dm_target_linear_upcall;
    340  1.15   mlelstv 	dmt->secsize = &dm_target_linear_secsize;
    341  1.12      haad 
    342   1.2      haad 	r = dm_target_insert(dmt);
    343  1.12      haad 
    344   1.2      haad 	dmt3->version[0] = 1;
    345   1.2      haad 	dmt3->version[1] = 0;
    346   1.2      haad 	dmt3->version[2] = 3;
    347   1.5      haad 	dmt3->init = &dm_target_stripe_init;
    348  1.29   tkusumi 	dmt3->table = &dm_target_stripe_table;
    349   1.5      haad 	dmt3->strategy = &dm_target_stripe_strategy;
    350  1.13      haad 	dmt3->sync = &dm_target_stripe_sync;
    351   1.5      haad 	dmt3->deps = &dm_target_stripe_deps;
    352   1.5      haad 	dmt3->destroy = &dm_target_stripe_destroy;
    353   1.5      haad 	dmt3->upcall = &dm_target_stripe_upcall;
    354  1.15   mlelstv 	dmt3->secsize = &dm_target_stripe_secsize;
    355  1.12      haad 
    356   1.2      haad 	r = dm_target_insert(dmt3);
    357   1.2      haad 
    358   1.2      haad 	return r;
    359   1.2      haad }
    360