sys/dev/disk/dm/dm_target.c

   1 /*        $NetBSD: dm_target.c,v 1.12 2010/01/04 00:14:41 haad Exp $      */
   2
   3 /*
   4  * Copyright (c) 2008 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
  35 #include <sys/malloc.h>
  36 #include <sys/module.h>
  37
  38
  39 #include "netbsd-dm.h"
  40 #include "dm.h"
  41
  42 static dm_target_t *dm_target_lookup_name(const char *);
  43
  44 TAILQ_HEAD(dm_target_head, dm_target);
  45
  46 static struct dm_target_head dm_target_list =
  47 TAILQ_HEAD_INITIALIZER(dm_target_list);
  48
  49 struct lock dm_target_mutex;
  50
  51 /*
  52  * Called indirectly from dm_table_load_ioctl to mark target as used.
  53  */
  54 void
  55 dm_target_busy(dm_target_t * target)
  56 {
  57         atomic_add_int(&target->ref_cnt, 1);
  58 }
  59 /*
  60  * Release reference counter on target.
  61  */
  62 void
  63 dm_target_unbusy(dm_target_t * target)
  64 {
  65         KKASSERT(target->ref_cnt > 0);
  66         atomic_subtract_int(&target->ref_cnt, 1);
  67 }
  68
  69 /*
  70  * Lookup for target in global target list.
  71  */
  72 dm_target_t *
  73 dm_target_lookup(const char *dm_target_name)
  74 {
  75         dm_target_t *dmt;
  76
  77         dmt = NULL;
  78
  79         if (dm_target_name == NULL)
  80                 return NULL;
  81
  82         lockmgr(&dm_target_mutex, LK_EXCLUSIVE);
  83
  84         dmt = dm_target_lookup_name(dm_target_name);
  85         if (dmt != NULL)
  86                 dm_target_busy(dmt);
  87
  88         lockmgr(&dm_target_mutex, LK_RELEASE);
  89
  90         return dmt;
  91 }
  92 /*
  93  * Search for name in TAIL and return apropriate pointer.
  94  */
  95 static dm_target_t *
  96 dm_target_lookup_name(const char *dm_target_name)
  97 {
  98         dm_target_t *dm_target;
  99
 100         TAILQ_FOREACH(dm_target, &dm_target_list, dm_target_next) {
 101                 if (strcmp(dm_target_name, dm_target->name) == 0)
 102                         return dm_target;
 103         }
 104
 105         return NULL;
 106 }
 107 /*
 108  * Insert new target struct into the TAIL.
 109  * dm_target
 110  *   contains name, version, function pointer to specifif target functions.
 111  */
 112 int
 113 dm_target_insert(dm_target_t * dm_target)
 114 {
 115         dm_target_t *dmt;
 116
 117         lockmgr(&dm_target_mutex, LK_EXCLUSIVE);
 118
 119         dmt = dm_target_lookup_name(dm_target->name);
 120         if (dmt != NULL) {
 121                 kprintf("uhoh, target_insert EEXIST\n");
 122                 lockmgr(&dm_target_mutex, LK_RELEASE);
 123                 return EEXIST;
 124         }
 125         TAILQ_INSERT_TAIL(&dm_target_list, dm_target, dm_target_next);
 126
 127         lockmgr(&dm_target_mutex, LK_RELEASE);
 128
 129         return 0;
 130 }
 131
 132
 133 /*
 134  * Remove target from TAIL, target is selected with it's name.
 135  */
 136 int
 137 dm_target_rem(char *dm_target_name)
 138 {
 139         dm_target_t *dmt;
 140
 141         KKASSERT(dm_target_name != NULL);
 142
 143         lockmgr(&dm_target_mutex, LK_EXCLUSIVE);
 144
 145         dmt = dm_target_lookup_name(dm_target_name);
 146         if (dmt == NULL) {
 147                 lockmgr(&dm_target_mutex, LK_RELEASE);
 148                 return ENOENT;
 149         }
 150         if (dmt->ref_cnt > 0) {
 151                 lockmgr(&dm_target_mutex, LK_RELEASE);
 152                 return EBUSY;
 153         }
 154         TAILQ_REMOVE(&dm_target_list,
 155             dmt, dm_target_next);
 156
 157         lockmgr(&dm_target_mutex, LK_RELEASE);
 158
 159         (void) kfree(dmt, M_DM);
 160
 161         return 0;
 162 }
 163 /*
 164  * Destroy all targets and remove them from queue.
 165  * This routine is called from dm_detach, before module
 166  * is unloaded.
 167  */
 168 int
 169 dm_target_destroy(void)
 170 {
 171         dm_target_t *dm_target;
 172
 173         lockmgr(&dm_target_mutex, LK_EXCLUSIVE);
 174         while (TAILQ_FIRST(&dm_target_list) != NULL) {
 175
 176                 dm_target = TAILQ_FIRST(&dm_target_list);
 177
 178                 TAILQ_REMOVE(&dm_target_list, TAILQ_FIRST(&dm_target_list),
 179                     dm_target_next);
 180
 181                 (void) kfree(dm_target, M_DM);
 182         }
 183         lockmgr(&dm_target_mutex, LK_RELEASE);
 184
 185         lockuninit(&dm_target_mutex);
 186
 187         return 0;
 188 }
 189 /*
 190  * Allocate new target entry.
 191  */
 192 dm_target_t *
 193 dm_target_alloc(const char *name)
 194 {
 195         return kmalloc(sizeof(dm_target_t), M_DM, M_WAITOK | M_ZERO);
 196 }
 197 /*
 198  * Return prop_array of dm_target dictionaries.
 199  */
 200 prop_array_t
 201 dm_target_prop_list(void)
 202 {
 203         prop_array_t target_array, ver;
 204         prop_dictionary_t target_dict;
 205         dm_target_t *dm_target;
 206
 207         size_t i;
 208
 209         target_array = prop_array_create();
 210
 211         lockmgr(&dm_target_mutex, LK_EXCLUSIVE);
 212
 213         TAILQ_FOREACH(dm_target, &dm_target_list, dm_target_next) {
 214
 215                 target_dict = prop_dictionary_create();
 216                 ver = prop_array_create();
 217                 prop_dictionary_set_cstring(target_dict, DM_TARGETS_NAME,
 218                     dm_target->name);
 219
 220                 for (i = 0; i < 3; i++)
 221                         prop_array_add_uint32(ver, dm_target->version[i]);
 222
 223                 prop_dictionary_set(target_dict, DM_TARGETS_VERSION, ver);
 224                 prop_array_add(target_array, target_dict);
 225
 226                 prop_object_release(ver);
 227                 prop_object_release(target_dict);
 228         }
 229
 230         lockmgr(&dm_target_mutex, LK_RELEASE);
 231
 232         return target_array;
 233 }
 234
 235 /* Initialize dm_target subsystem. */
 236 int
 237 dm_target_init(void)
 238 {
 239         lockinit(&dm_target_mutex, "dmtrgt", 0, LK_CANRECURSE);
 240
 241         return 0;
 242 }