Expand PMF_FN_* macros.
[netbsd-mini2440.git] / sys / dev / dm / dm_table.c
blob2fd97352fc76207d3dd744504f1e7d69fcb59cea
1 /* $NetBSD: dm_table.c,v 1.4 2009/10/23 20:41:11 joerg Exp $ */
3 /*
4 * Copyright (c) 2008 The NetBSD Foundation, Inc.
5 * All rights reserved.
7 * This code is derived from software contributed to The NetBSD Foundation
8 * by Adam Hamsik.
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.
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.
32 #include <sys/types.h>
33 #include <sys/param.h>
35 #include <sys/kmem.h>
37 #include "dm.h"
40 * There are two types of users of this interface:
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
46 * b) Writers such as
47 * dm_dev_remove_ioctl, dm_dev_resume_ioctl, dm_table_clear_ioctl
49 * Writers can work with table_head only when there are no readers. I
50 * use reference counting on io_cnt.
54 static int dm_table_busy(dm_table_head_t *, uint8_t);
55 static void dm_table_unbusy(dm_table_head_t *);
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.
63 static int
64 dm_table_busy(dm_table_head_t * head, uint8_t table_id)
66 uint8_t id;
68 id = 0;
70 mutex_enter(&head->table_mtx);
72 if (table_id == DM_TABLE_ACTIVE)
73 id = head->cur_active_table;
74 else
75 id = 1 - head->cur_active_table;
77 head->io_cnt++;
79 mutex_exit(&head->table_mtx);
80 return id;
83 * Function release table lock and eventually wakeup all waiters.
85 static void
86 dm_table_unbusy(dm_table_head_t * head)
88 KASSERT(head->io_cnt != 0);
90 mutex_enter(&head->table_mtx);
92 if (--head->io_cnt == 0)
93 cv_broadcast(&head->table_cv);
95 mutex_exit(&head->table_mtx);
98 * Return current active table to caller, increment io_cnt reference counter.
100 dm_table_t *
101 dm_table_get_entry(dm_table_head_t * head, uint8_t table_id)
103 uint8_t id;
105 id = dm_table_busy(head, table_id);
107 return &head->tables[id];
110 * Decrement io reference counter and wake up all callers, with table_head cv.
112 void
113 dm_table_release(dm_table_head_t * head, uint8_t table_id)
115 dm_table_unbusy(head);
118 * Switch table from inactive to active mode. Have to wait until io_cnt is 0.
120 void
121 dm_table_switch_tables(dm_table_head_t * head)
123 mutex_enter(&head->table_mtx);
125 while (head->io_cnt != 0)
126 cv_wait(&head->table_cv, &head->table_mtx);
128 head->cur_active_table = 1 - head->cur_active_table;
130 mutex_exit(&head->table_mtx);
133 * Destroy all table data. This function can run when there are no
134 * readers on table lists.
136 * XXX Is it ok to call kmem_free and potentialy VOP_CLOSE with held mutex ?xs
139 dm_table_destroy(dm_table_head_t * head, uint8_t table_id)
141 dm_table_t *tbl;
142 dm_table_entry_t *table_en;
143 uint8_t id;
145 mutex_enter(&head->table_mtx);
147 aprint_debug("dm_Table_destroy called with %d--%d\n", table_id, head->io_cnt);
149 while (head->io_cnt != 0)
150 cv_wait(&head->table_cv, &head->table_mtx);
152 if (table_id == DM_TABLE_ACTIVE)
153 id = head->cur_active_table;
154 else
155 id = 1 - head->cur_active_table;
157 tbl = &head->tables[id];
159 while (!SLIST_EMPTY(tbl)) { /* List Deletion. */
160 table_en = SLIST_FIRST(tbl);
162 * Remove target specific config data. After successfull
163 * call table_en->target_config must be set to NULL.
165 table_en->target->destroy(table_en);
167 SLIST_REMOVE_HEAD(tbl, next);
169 kmem_free(table_en, sizeof(*table_en));
172 mutex_exit(&head->table_mtx);
174 return 0;
177 * Return length of active table in device.
179 uint64_t
180 dm_table_size(dm_table_head_t * head)
182 dm_table_t *tbl;
183 dm_table_entry_t *table_en;
184 uint64_t length;
185 uint8_t id;
187 length = 0;
189 id = dm_table_busy(head, DM_TABLE_ACTIVE);
191 /* Select active table */
192 tbl = &head->tables[id];
195 * Find out what tables I want to select.
196 * if length => rawblkno then we should used that table.
198 SLIST_FOREACH(table_en, tbl, next)
199 length += table_en->length;
201 dm_table_unbusy(head);
203 return length;
206 * Return > 0 if table is at least one table entry (returns number of entries)
207 * and return 0 if there is not. Target count returned from this function
208 * doesn't need to be true when userspace user receive it (after return
209 * there can be dm_dev_resume_ioctl), therfore this isonly informative.
212 dm_table_get_target_count(dm_table_head_t * head, uint8_t table_id)
214 dm_table_entry_t *table_en;
215 dm_table_t *tbl;
216 uint32_t target_count;
217 uint8_t id;
219 target_count = 0;
221 id = dm_table_busy(head, table_id);
223 tbl = &head->tables[id];
225 SLIST_FOREACH(table_en, tbl, next)
226 target_count++;
228 dm_table_unbusy(head);
230 return target_count;
235 * Initialize table_head structures, I'm trying to keep this structure as
236 * opaque as possible.
238 void
239 dm_table_head_init(dm_table_head_t * head)
241 head->cur_active_table = 0;
242 head->io_cnt = 0;
244 /* Initialize tables. */
245 SLIST_INIT(&head->tables[0]);
246 SLIST_INIT(&head->tables[1]);
248 mutex_init(&head->table_mtx, MUTEX_DEFAULT, IPL_NONE);
249 cv_init(&head->table_cv, "dm_io");
252 * Destroy all variables in table_head
254 void
255 dm_table_head_destroy(dm_table_head_t * head)
257 KASSERT(!mutex_owned(&head->table_mtx));
258 KASSERT(!cv_has_waiters(&head->table_cv));
259 /* tables doens't exists when I call this routine, therefore it
260 * doesn't make sense to have io_cnt != 0 */
261 KASSERT(head->io_cnt == 0);
263 cv_destroy(&head->table_cv);
264 mutex_destroy(&head->table_mtx);