1 /* $NetBSD: dm_table.c,v 1.5 2010/01/04 00:19:08 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 37 #include "dm.h" 38 39 /* 40 * There are two types of users of this interface: 41 * 42 * a) Readers such as 43 * dmstrategy, dmgetdisklabel, dmsize, dm_dev_status_ioctl, 44 * dm_table_deps_ioctl, dm_table_status_ioctl, dm_table_reload_ioctl 45 * 46 * b) Writers such as 47 * dm_dev_remove_ioctl, dm_dev_resume_ioctl, dm_table_clear_ioctl 48 * 49 * Writers can work with table_head only when there are no readers. I 50 * use reference counting on io_cnt. 51 * 52 */ 53 54 static int dm_table_busy(dm_table_head_t *, uint8_t); 55 static void dm_table_unbusy(dm_table_head_t *); 56 57 /* 58 * Function to increment table user reference counter. Return id 59 * of table_id table. 60 * DM_TABLE_ACTIVE will return active table id. 61 * DM_TABLE_INACTIVE will return inactive table id. 62 */ 63 static int 64 dm_table_busy(dm_table_head_t * head, uint8_t table_id) 65 { 66 uint8_t id; 67 68 id = 0; 69 70 lockmgr(&head->table_mtx, LK_EXCLUSIVE); 71 72 if (table_id == DM_TABLE_ACTIVE) 73 id = head->cur_active_table; 74 else 75 id = 1 - head->cur_active_table; 76 77 head->io_cnt++; 78 79 lockmgr(&head->table_mtx, LK_RELEASE); 80 return id; 81 } 82 /* 83 * Function release table lock and eventually wakeup all waiters. 84 */ 85 static void 86 dm_table_unbusy(dm_table_head_t * head) 87 { 88 KKASSERT(head->io_cnt != 0); 89 90 lockmgr(&head->table_mtx, LK_EXCLUSIVE); 91 92 if (--head->io_cnt == 0) 93 cv_broadcast(&head->table_cv); 94 95 lockmgr(&head->table_mtx, LK_RELEASE); 96 } 97 /* 98 * Return current active table to caller, increment io_cnt reference counter. 99 */ 100 dm_table_t * 101 dm_table_get_entry(dm_table_head_t * head, uint8_t table_id) 102 { 103 uint8_t id; 104 105 id = dm_table_busy(head, table_id); 106 107 return &head->tables[id]; 108 } 109 /* 110 * Decrement io reference counter and wake up all callers, with table_head cv. 111 */ 112 void 113 dm_table_release(dm_table_head_t * head, uint8_t table_id) 114 { 115 dm_table_unbusy(head); 116 } 117 /* 118 * Switch table from inactive to active mode. Have to wait until io_cnt is 0. 119 */ 120 void 121 dm_table_switch_tables(dm_table_head_t * head) 122 { 123 lockmgr(&head->table_mtx, LK_EXCLUSIVE); 124 125 while (head->io_cnt != 0) 126 cv_wait(&head->table_cv, &head->table_mtx); 127 128 head->cur_active_table = 1 - head->cur_active_table; 129 130 lockmgr(&head->table_mtx, LK_RELEASE); 131 } 132 /* 133 * Destroy all table data. This function can run when there are no 134 * readers on table lists. 135 * 136 * XXX Is it ok to call kmem_free and potentialy VOP_CLOSE with held mutex ?xs 137 */ 138 int 139 dm_table_destroy(dm_table_head_t * head, uint8_t table_id) 140 { 141 dm_table_t *tbl; 142 dm_table_entry_t *table_en; 143 uint8_t id; 144 145 lockmgr(&head->table_mtx, LK_EXCLUSIVE); 146 147 aprint_debug("dm_Table_destroy called with %d--%d\n", table_id, head->io_cnt); 148 149 while (head->io_cnt != 0) 150 cv_wait(&head->table_cv, &head->table_mtx); 151 152 if (table_id == DM_TABLE_ACTIVE) 153 id = head->cur_active_table; 154 else 155 id = 1 - head->cur_active_table; 156 157 tbl = &head->tables[id]; 158 159 while (!SLIST_EMPTY(tbl)) { /* List Deletion. */ 160 table_en = SLIST_FIRST(tbl); 161 /* 162 * Remove target specific config data. After successfull 163 * call table_en->target_config must be set to NULL. 164 */ 165 table_en->target->destroy(table_en); 166 167 SLIST_REMOVE_HEAD(tbl, next); 168 169 kfree(table_en, M_DM); 170 } 171 172 lockmgr(&head->table_mtx, LK_RELEASE); 173 174 return 0; 175 } 176 /* 177 * Return length of active table in device. 178 */ 179 uint64_t 180 dm_table_size(dm_table_head_t * head) 181 { 182 dm_table_t *tbl; 183 dm_table_entry_t *table_en; 184 uint64_t length; 185 uint8_t id; 186 187 length = 0; 188 189 id = dm_table_busy(head, DM_TABLE_ACTIVE); 190 191 /* Select active table */ 192 tbl = &head->tables[id]; 193 194 /* 195 * Find out what tables I want to select. 196 * if length => rawblkno then we should used that table. 197 */ 198 SLIST_FOREACH(table_en, tbl, next) { 199 length += table_en->length; 200 } 201 202 dm_table_unbusy(head); 203 204 return length; 205 } 206 /* 207 * Return > 0 if table is at least one table entry (returns number of entries) 208 * and return 0 if there is not. Target count returned from this function 209 * doesn't need to be true when userspace user receive it (after return 210 * there can be dm_dev_resume_ioctl), therfore this isonly informative. 211 */ 212 int 213 dm_table_get_target_count(dm_table_head_t * head, uint8_t table_id) 214 { 215 dm_table_entry_t *table_en; 216 dm_table_t *tbl; 217 uint32_t target_count; 218 uint8_t id; 219 220 target_count = 0; 221 222 id = dm_table_busy(head, table_id); 223 224 tbl = &head->tables[id]; 225 226 SLIST_FOREACH(table_en, tbl, next) 227 target_count++; 228 229 dm_table_unbusy(head); 230 231 return target_count; 232 } 233 234 235 /* 236 * Initialize table_head structures, I'm trying to keep this structure as 237 * opaque as possible. 238 */ 239 void 240 dm_table_head_init(dm_table_head_t * head) 241 { 242 head->cur_active_table = 0; 243 head->io_cnt = 0; 244 245 /* Initialize tables. */ 246 SLIST_INIT(&head->tables[0]); 247 SLIST_INIT(&head->tables[1]); 248 249 lockinit(&head->table_mtx, "dmtbl", 0, LK_CANRECURSE); 250 cv_init(&head->table_cv, "dm_io"); 251 } 252 /* 253 * Destroy all variables in table_head 254 */ 255 void 256 dm_table_head_destroy(dm_table_head_t * head) 257 { 258 KKASSERT(lockcount(&head->table_mtx) == 0); 259 #if 0 260 KKASSERT(!cv_has_waiters(&head->table_cv)); 261 #endif 262 /* tables doens't exists when I call this routine, therefore it 263 * doesn't make sense to have io_cnt != 0 */ 264 KKASSERT(head->io_cnt == 0); 265 266 cv_destroy(&head->table_cv); 267 lockuninit(&head->table_mtx); 268 } 269