Home | History | Annotate | Line # | Download | only in dm
dm_target.c revision 1.2
      1  1.2  haad /*        $NetBSD: dm_target.c,v 1.2 2008/12/19 15:24:03 haad 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.2  haad 
     32  1.2  haad #include <sys/types.h>
     33  1.2  haad #include <sys/param.h>
     34  1.2  haad 
     35  1.2  haad #include <sys/kmem.h>
     36  1.2  haad 
     37  1.2  haad #include "netbsd-dm.h"
     38  1.2  haad #include "dm.h"
     39  1.2  haad 
     40  1.2  haad static dm_target_t* dm_target_alloc(const char *);
     41  1.2  haad 
     42  1.2  haad TAILQ_HEAD(dm_target_head, dm_target);
     43  1.2  haad 
     44  1.2  haad static struct dm_target_head dm_target_list =
     45  1.2  haad TAILQ_HEAD_INITIALIZER(dm_target_list);
     46  1.2  haad 
     47  1.2  haad /*
     48  1.2  haad  * Search for name in TAIL and return apropriate pointer.
     49  1.2  haad  */
     50  1.2  haad dm_target_t*
     51  1.2  haad dm_target_lookup_name(const char *dm_target_name)
     52  1.2  haad {
     53  1.2  haad 	dm_target_t *dm_target;
     54  1.2  haad         int dlen; int slen;
     55  1.2  haad 
     56  1.2  haad 	slen = strlen(dm_target_name)+1;
     57  1.2  haad 
     58  1.2  haad 	TAILQ_FOREACH (dm_target, &dm_target_list, dm_target_next) {
     59  1.2  haad 		dlen = strlen(dm_target->name)+1;
     60  1.2  haad 
     61  1.2  haad 		if (dlen != slen)
     62  1.2  haad 			continue;
     63  1.2  haad 
     64  1.2  haad 		if (strncmp(dm_target_name, dm_target->name, slen) == 0)
     65  1.2  haad 					return dm_target;
     66  1.2  haad 	}
     67  1.2  haad 
     68  1.2  haad 	return NULL;
     69  1.2  haad }
     70  1.2  haad 
     71  1.2  haad /*
     72  1.2  haad  * Insert new target struct into the TAIL.
     73  1.2  haad  * dm_target
     74  1.2  haad  *   contains name, version, function pointer to specifif target functions.
     75  1.2  haad  */
     76  1.2  haad int
     77  1.2  haad dm_target_insert(dm_target_t *dm_target)
     78  1.2  haad {
     79  1.2  haad 	dm_target_t *dmt;
     80  1.2  haad 
     81  1.2  haad 	dmt = dm_target_lookup_name(dm_target->name);
     82  1.2  haad 
     83  1.2  haad 	if (dmt != NULL)
     84  1.2  haad 		return EEXIST;
     85  1.2  haad 
     86  1.2  haad 	TAILQ_INSERT_TAIL(&dm_target_list, dm_target, dm_target_next);
     87  1.2  haad 
     88  1.2  haad 	return 0;
     89  1.2  haad }
     90  1.2  haad 
     91  1.2  haad 
     92  1.2  haad /*
     93  1.2  haad  * Remove target from TAIL, target is selected with it's name.
     94  1.2  haad  */
     95  1.2  haad int
     96  1.2  haad dm_target_rem(char *dm_target_name)
     97  1.2  haad {
     98  1.2  haad 	dm_target_t *dm_target;
     99  1.2  haad 
    100  1.2  haad 	KASSERT(dm_target_name != NULL);
    101  1.2  haad 
    102  1.2  haad 	dm_target = dm_target_lookup_name(dm_target_name);
    103  1.2  haad 	if (dm_target == NULL)
    104  1.2  haad 		return ENOENT;
    105  1.2  haad 
    106  1.2  haad 	TAILQ_REMOVE(&dm_target_list,
    107  1.2  haad 	    dm_target, dm_target_next);
    108  1.2  haad 
    109  1.2  haad 	(void)kmem_free(dm_target, sizeof(dm_target_t));
    110  1.2  haad 
    111  1.2  haad 	return 0;
    112  1.2  haad }
    113  1.2  haad 
    114  1.2  haad /*
    115  1.2  haad  * Destroy all targets and remove them from queue.
    116  1.2  haad  * This routine is called from dm_detach, before module
    117  1.2  haad  * is unloaded.
    118  1.2  haad  */
    119  1.2  haad 
    120  1.2  haad int
    121  1.2  haad dm_target_destroy(void)
    122  1.2  haad {
    123  1.2  haad 	dm_target_t *dm_target;
    124  1.2  haad 
    125  1.2  haad 	while (TAILQ_FIRST(&dm_target_list) != NULL){
    126  1.2  haad 
    127  1.2  haad 		dm_target = TAILQ_FIRST(&dm_target_list);
    128  1.2  haad 
    129  1.2  haad 		TAILQ_REMOVE(&dm_target_list, TAILQ_FIRST(&dm_target_list),
    130  1.2  haad 		dm_target_next);
    131  1.2  haad 
    132  1.2  haad 		(void)kmem_free(dm_target, sizeof(dm_target_t));
    133  1.2  haad 	}
    134  1.2  haad 
    135  1.2  haad 	return 0;
    136  1.2  haad }
    137  1.2  haad 
    138  1.2  haad /*
    139  1.2  haad  * Allocate new target entry.
    140  1.2  haad  */
    141  1.2  haad dm_target_t*
    142  1.2  haad dm_target_alloc(const char *name)
    143  1.2  haad {
    144  1.2  haad 	return kmem_zalloc(sizeof(dm_target_t), KM_NOSLEEP);
    145  1.2  haad }
    146  1.2  haad 
    147  1.2  haad /*
    148  1.2  haad  * Return prop_array of dm_target dictionaries.
    149  1.2  haad  */
    150  1.2  haad prop_array_t
    151  1.2  haad dm_target_prop_list(void)
    152  1.2  haad {
    153  1.2  haad 	prop_array_t target_array,ver;
    154  1.2  haad 	prop_dictionary_t target_dict;
    155  1.2  haad 	dm_target_t *dm_target;
    156  1.2  haad 
    157  1.2  haad 	size_t i;
    158  1.2  haad 
    159  1.2  haad 	target_array = prop_array_create();
    160  1.2  haad 
    161  1.2  haad 	TAILQ_FOREACH (dm_target, &dm_target_list, dm_target_next){
    162  1.2  haad 
    163  1.2  haad 		target_dict  = prop_dictionary_create();
    164  1.2  haad 		ver = prop_array_create();
    165  1.2  haad 		prop_dictionary_set_cstring(target_dict, DM_TARGETS_NAME,
    166  1.2  haad 		    dm_target->name);
    167  1.2  haad 
    168  1.2  haad 		for (i = 0; i < 3; i++)
    169  1.2  haad 			prop_array_add_uint32(ver, dm_target->version[i]);
    170  1.2  haad 
    171  1.2  haad 		prop_dictionary_set(target_dict, DM_TARGETS_VERSION, ver);
    172  1.2  haad 		prop_array_add(target_array, target_dict);
    173  1.2  haad 
    174  1.2  haad 		prop_object_release(ver);
    175  1.2  haad 		prop_object_release(target_dict);
    176  1.2  haad 	}
    177  1.2  haad 
    178  1.2  haad 	return target_array;
    179  1.2  haad }
    180  1.2  haad 
    181  1.2  haad /* Initialize dm_target subsystem. */
    182  1.2  haad int
    183  1.2  haad dm_target_init(void)
    184  1.2  haad {
    185  1.2  haad 	dm_target_t *dmt,*dmt1,*dmt2,*dmt3,*dmt4,*dmt5,*dmt6;
    186  1.2  haad 	int r;
    187  1.2  haad 
    188  1.2  haad 	r = 0;
    189  1.2  haad 
    190  1.2  haad 	dmt = dm_target_alloc("linear");
    191  1.2  haad 	dmt1 = dm_target_alloc("zero");
    192  1.2  haad 	dmt2 = dm_target_alloc("error");
    193  1.2  haad 	dmt3 = dm_target_alloc("striped");
    194  1.2  haad 	dmt4 = dm_target_alloc("mirror");
    195  1.2  haad 	dmt5 = dm_target_alloc("snapshot");
    196  1.2  haad 	dmt6 = dm_target_alloc("snapshot-origin");
    197  1.2  haad 
    198  1.2  haad 	dmt->version[0] = 1;
    199  1.2  haad 	dmt->version[1] = 0;
    200  1.2  haad 	dmt->version[2] = 2;
    201  1.2  haad 	strlcpy(dmt->name, "linear", DM_MAX_TYPE_NAME);
    202  1.2  haad 	dmt->init = &dm_target_linear_init;
    203  1.2  haad 	dmt->status = &dm_target_linear_status;
    204  1.2  haad 	dmt->strategy = &dm_target_linear_strategy;
    205  1.2  haad 	dmt->deps = &dm_target_linear_deps;
    206  1.2  haad 	dmt->destroy = &dm_target_linear_destroy;
    207  1.2  haad 	dmt->upcall = &dm_target_linear_upcall;
    208  1.2  haad 
    209  1.2  haad 	r = dm_target_insert(dmt);
    210  1.2  haad 
    211  1.2  haad 	dmt1->version[0] = 1;
    212  1.2  haad 	dmt1->version[1] = 0;
    213  1.2  haad 	dmt1->version[2] = 0;
    214  1.2  haad 	strlcpy(dmt1->name, "zero", DM_MAX_TYPE_NAME);
    215  1.2  haad 	dmt1->init = &dm_target_zero_init;
    216  1.2  haad 	dmt1->status = &dm_target_zero_status;
    217  1.2  haad 	dmt1->strategy = &dm_target_zero_strategy;
    218  1.2  haad 	dmt1->deps = &dm_target_zero_deps;
    219  1.2  haad 	dmt1->destroy = &dm_target_zero_destroy;
    220  1.2  haad 	dmt1->upcall = &dm_target_zero_upcall;
    221  1.2  haad 
    222  1.2  haad 	r = dm_target_insert(dmt1);
    223  1.2  haad 
    224  1.2  haad 	dmt2->version[0] = 1;
    225  1.2  haad 	dmt2->version[1] = 0;
    226  1.2  haad 	dmt2->version[2] = 0;
    227  1.2  haad 	strlcpy(dmt2->name, "error", DM_MAX_TYPE_NAME);
    228  1.2  haad 	dmt2->init = &dm_target_error_init;
    229  1.2  haad 	dmt2->status = &dm_target_error_status;
    230  1.2  haad 	dmt2->strategy = &dm_target_error_strategy;
    231  1.2  haad 	dmt2->deps = &dm_target_error_deps;
    232  1.2  haad 	dmt2->destroy = &dm_target_error_destroy;
    233  1.2  haad 	dmt2->upcall = &dm_target_error_upcall;
    234  1.2  haad 
    235  1.2  haad 	r = dm_target_insert(dmt2);
    236  1.2  haad 
    237  1.2  haad 	dmt3->version[0] = 1;
    238  1.2  haad 	dmt3->version[1] = 0;
    239  1.2  haad 	dmt3->version[2] = 3;
    240  1.2  haad 	strlcpy(dmt3->name, "striped", DM_MAX_TYPE_NAME);
    241  1.2  haad 	dmt3->init = &dm_target_linear_init;
    242  1.2  haad 	dmt3->status = &dm_target_linear_status;
    243  1.2  haad 	dmt3->strategy = &dm_target_linear_strategy;
    244  1.2  haad 	dmt3->deps = &dm_target_linear_deps;
    245  1.2  haad 	dmt3->destroy = &dm_target_linear_destroy;
    246  1.2  haad 	dmt3->upcall = NULL;
    247  1.2  haad 
    248  1.2  haad 	r = dm_target_insert(dmt3);
    249  1.2  haad 
    250  1.2  haad 	dmt4->version[0] = 1;
    251  1.2  haad 	dmt4->version[1] = 0;
    252  1.2  haad 	dmt4->version[2] = 3;
    253  1.2  haad 	strlcpy(dmt4->name, "mirror", DM_MAX_TYPE_NAME);
    254  1.2  haad 	dmt4->init = NULL;
    255  1.2  haad 	dmt4->status = NULL;
    256  1.2  haad 	dmt4->strategy = NULL;
    257  1.2  haad 	dmt4->deps = NULL;
    258  1.2  haad 	dmt4->destroy = NULL;
    259  1.2  haad 	dmt4->upcall = NULL;
    260  1.2  haad 
    261  1.2  haad 	r = dm_target_insert(dmt4);
    262  1.2  haad 
    263  1.2  haad 	dmt5->version[0] = 1;
    264  1.2  haad 	dmt5->version[1] = 0;
    265  1.2  haad 	dmt5->version[2] = 5;
    266  1.2  haad 	strlcpy(dmt5->name, "snapshot", DM_MAX_TYPE_NAME);
    267  1.2  haad 	dmt5->init = &dm_target_snapshot_init;
    268  1.2  haad 	dmt5->status = &dm_target_snapshot_status;
    269  1.2  haad 	dmt5->strategy = &dm_target_snapshot_strategy;
    270  1.2  haad 	dmt5->deps = &dm_target_snapshot_deps;
    271  1.2  haad 	dmt5->destroy = &dm_target_snapshot_destroy;
    272  1.2  haad 	dmt5->upcall = &dm_target_snapshot_upcall;
    273  1.2  haad 
    274  1.2  haad 	r = dm_target_insert(dmt5);
    275  1.2  haad 
    276  1.2  haad 	dmt6->version[0] = 1;
    277  1.2  haad 	dmt6->version[1] = 0;
    278  1.2  haad 	dmt6->version[2] = 5;
    279  1.2  haad 	strlcpy(dmt6->name, "snapshot-origin", DM_MAX_TYPE_NAME);
    280  1.2  haad 	dmt6->init = &dm_target_snapshot_orig_init;
    281  1.2  haad 	dmt6->status = &dm_target_snapshot_orig_status;
    282  1.2  haad 	dmt6->strategy = &dm_target_snapshot_orig_strategy;
    283  1.2  haad 	dmt6->deps = &dm_target_snapshot_orig_deps;
    284  1.2  haad 	dmt6->destroy = &dm_target_snapshot_orig_destroy;
    285  1.2  haad 	dmt6->upcall = &dm_target_snapshot_orig_upcall;
    286  1.2  haad 
    287  1.2  haad 	r = dm_target_insert(dmt6);
    288  1.2  haad 
    289  1.2  haad 	return r;
    290  1.2  haad }
    291