dm_pdev.c revision 1.7 1 1.7 dholland /* $NetBSD: dm_pdev.c,v 1.7 2010/11/19 06:44:40 dholland 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/disk.h>
36 1.2 haad #include <sys/fcntl.h>
37 1.2 haad #include <sys/kmem.h>
38 1.2 haad #include <sys/namei.h>
39 1.2 haad #include <sys/vnode.h>
40 1.2 haad
41 1.2 haad #include <dev/dkvar.h>
42 1.2 haad
43 1.2 haad #include "dm.h"
44 1.2 haad
45 1.2 haad SLIST_HEAD(dm_pdevs, dm_pdev) dm_pdev_list;
46 1.2 haad
47 1.6 haad kmutex_t dm_pdev_mutex;
48 1.2 haad
49 1.6 haad static dm_pdev_t *dm_pdev_alloc(const char *);
50 1.6 haad static int dm_pdev_rem(dm_pdev_t *);
51 1.6 haad static dm_pdev_t *dm_pdev_lookup_name(const char *);
52 1.2 haad
53 1.2 haad /*
54 1.2 haad * Find used pdev with name == dm_pdev_name.
55 1.2 haad */
56 1.6 haad dm_pdev_t *
57 1.6 haad dm_pdev_lookup_name(const char *dm_pdev_name)
58 1.2 haad {
59 1.2 haad dm_pdev_t *dm_pdev;
60 1.6 haad int dlen;
61 1.6 haad int slen;
62 1.2 haad
63 1.2 haad KASSERT(dm_pdev_name != NULL);
64 1.2 haad
65 1.2 haad slen = strlen(dm_pdev_name);
66 1.2 haad
67 1.2 haad SLIST_FOREACH(dm_pdev, &dm_pdev_list, next_pdev) {
68 1.2 haad dlen = strlen(dm_pdev->name);
69 1.2 haad
70 1.2 haad if (slen != dlen)
71 1.2 haad continue;
72 1.6 haad
73 1.2 haad if (strncmp(dm_pdev_name, dm_pdev->name, slen) == 0)
74 1.2 haad return dm_pdev;
75 1.2 haad }
76 1.2 haad
77 1.2 haad return NULL;
78 1.2 haad }
79 1.2 haad /*
80 1.2 haad * Create entry for device with name dev_name and open vnode for it.
81 1.2 haad * If entry already exists in global SLIST I will only increment
82 1.2 haad * reference counter.
83 1.2 haad */
84 1.6 haad dm_pdev_t *
85 1.2 haad dm_pdev_insert(const char *dev_name)
86 1.2 haad {
87 1.7 dholland struct pathbuf *dev_pb;
88 1.2 haad dm_pdev_t *dmp;
89 1.2 haad int error;
90 1.6 haad
91 1.2 haad KASSERT(dev_name != NULL);
92 1.6 haad
93 1.2 haad mutex_enter(&dm_pdev_mutex);
94 1.2 haad dmp = dm_pdev_lookup_name(dev_name);
95 1.2 haad
96 1.2 haad if (dmp != NULL) {
97 1.2 haad dmp->ref_cnt++;
98 1.6 haad aprint_debug("dmp_pdev_insert pdev %s already in tree\n", dev_name);
99 1.2 haad mutex_exit(&dm_pdev_mutex);
100 1.2 haad return dmp;
101 1.2 haad }
102 1.2 haad mutex_exit(&dm_pdev_mutex);
103 1.6 haad
104 1.2 haad if ((dmp = dm_pdev_alloc(dev_name)) == NULL)
105 1.2 haad return NULL;
106 1.2 haad
107 1.7 dholland dev_pb = pathbuf_create(dev_name);
108 1.7 dholland if (dev_pb == NULL) {
109 1.7 dholland aprint_debug("pathbuf_create on device: %s failed!\n",
110 1.7 dholland dev_name);
111 1.7 dholland kmem_free(dmp, sizeof(dm_pdev_t));
112 1.7 dholland return NULL;
113 1.7 dholland }
114 1.7 dholland error = dk_lookup(dev_pb, curlwp, &dmp->pdev_vnode);
115 1.7 dholland pathbuf_destroy(dev_pb);
116 1.2 haad if (error) {
117 1.5 haad aprint_debug("dk_lookup on device: %s failed with error %d!\n",
118 1.2 haad dev_name, error);
119 1.2 haad kmem_free(dmp, sizeof(dm_pdev_t));
120 1.2 haad return NULL;
121 1.2 haad }
122 1.6 haad dmp->ref_cnt = 1;
123 1.2 haad
124 1.2 haad mutex_enter(&dm_pdev_mutex);
125 1.2 haad SLIST_INSERT_HEAD(&dm_pdev_list, dmp, next_pdev);
126 1.2 haad mutex_exit(&dm_pdev_mutex);
127 1.2 haad
128 1.2 haad return dmp;
129 1.2 haad }
130 1.2 haad /*
131 1.2 haad * Initialize pdev subsystem.
132 1.2 haad */
133 1.2 haad int
134 1.2 haad dm_pdev_init(void)
135 1.2 haad {
136 1.6 haad SLIST_INIT(&dm_pdev_list); /* initialize global pdev list */
137 1.2 haad mutex_init(&dm_pdev_mutex, MUTEX_DEFAULT, IPL_NONE);
138 1.6 haad
139 1.2 haad return 0;
140 1.2 haad }
141 1.2 haad /*
142 1.2 haad * Allocat new pdev structure if is not already present and
143 1.2 haad * set name.
144 1.2 haad */
145 1.6 haad static dm_pdev_t *
146 1.2 haad dm_pdev_alloc(const char *name)
147 1.2 haad {
148 1.2 haad dm_pdev_t *dmp;
149 1.2 haad
150 1.4 haad if ((dmp = kmem_zalloc(sizeof(dm_pdev_t), KM_SLEEP)) == NULL)
151 1.2 haad return NULL;
152 1.2 haad
153 1.2 haad strlcpy(dmp->name, name, MAX_DEV_NAME);
154 1.6 haad
155 1.2 haad dmp->ref_cnt = 0;
156 1.2 haad dmp->pdev_vnode = NULL;
157 1.6 haad
158 1.2 haad return dmp;
159 1.2 haad }
160 1.2 haad /*
161 1.2 haad * Destroy allocated dm_pdev.
162 1.2 haad */
163 1.2 haad static int
164 1.6 haad dm_pdev_rem(dm_pdev_t * dmp)
165 1.2 haad {
166 1.2 haad int err;
167 1.2 haad
168 1.2 haad KASSERT(dmp != NULL);
169 1.6 haad
170 1.2 haad if (dmp->pdev_vnode != NULL) {
171 1.2 haad err = vn_close(dmp->pdev_vnode, FREAD | FWRITE, FSCRED);
172 1.2 haad if (err != 0)
173 1.2 haad return err;
174 1.2 haad }
175 1.2 haad kmem_free(dmp, sizeof(*dmp));
176 1.2 haad dmp = NULL;
177 1.6 haad
178 1.2 haad return 0;
179 1.2 haad }
180 1.2 haad /*
181 1.2 haad * Destroy all existing pdev's in device-mapper.
182 1.2 haad */
183 1.2 haad int
184 1.2 haad dm_pdev_destroy(void)
185 1.2 haad {
186 1.2 haad dm_pdev_t *dm_pdev;
187 1.2 haad
188 1.2 haad mutex_enter(&dm_pdev_mutex);
189 1.6 haad while (!SLIST_EMPTY(&dm_pdev_list)) { /* List Deletion. */
190 1.6 haad
191 1.2 haad dm_pdev = SLIST_FIRST(&dm_pdev_list);
192 1.6 haad
193 1.2 haad SLIST_REMOVE_HEAD(&dm_pdev_list, next_pdev);
194 1.2 haad
195 1.2 haad dm_pdev_rem(dm_pdev);
196 1.2 haad }
197 1.2 haad mutex_exit(&dm_pdev_mutex);
198 1.2 haad
199 1.2 haad mutex_destroy(&dm_pdev_mutex);
200 1.2 haad return 0;
201 1.2 haad }
202 1.2 haad /*
203 1.2 haad * This funcion is called from dm_dev_remove_ioctl.
204 1.2 haad * When I'm removing device from list, I have to decrement
205 1.2 haad * reference counter. If reference counter is 0 I will remove
206 1.2 haad * dmp from global list and from device list to. And I will CLOSE
207 1.2 haad * dmp vnode too.
208 1.2 haad */
209 1.2 haad
210 1.2 haad /*
211 1.2 haad * Decrement pdev reference counter if 0 remove it.
212 1.2 haad */
213 1.2 haad int
214 1.6 haad dm_pdev_decr(dm_pdev_t * dmp)
215 1.2 haad {
216 1.2 haad KASSERT(dmp != NULL);
217 1.2 haad /*
218 1.2 haad * If this was last reference remove dmp from
219 1.2 haad * global list also.
220 1.2 haad */
221 1.2 haad mutex_enter(&dm_pdev_mutex);
222 1.6 haad
223 1.2 haad if (--dmp->ref_cnt == 0) {
224 1.6 haad SLIST_REMOVE(&dm_pdev_list, dmp, dm_pdev, next_pdev);
225 1.2 haad mutex_exit(&dm_pdev_mutex);
226 1.2 haad dm_pdev_rem(dmp);
227 1.2 haad return 0;
228 1.2 haad }
229 1.2 haad mutex_exit(&dm_pdev_mutex);
230 1.2 haad return 0;
231 1.2 haad }
232 1.2 haad /*static int
233 1.3 cegger dm_pdev_dump_list(void)
234 1.2 haad {
235 1.2 haad dm_pdev_t *dmp;
236 1.2 haad
237 1.2 haad aprint_verbose("Dumping dm_pdev_list \n");
238 1.2 haad
239 1.2 haad SLIST_FOREACH(dmp, &dm_pdev_list, next_pdev) {
240 1.2 haad aprint_verbose("dm_pdev_name %s ref_cnt %d list_rf_cnt %d\n",
241 1.2 haad dmp->name, dmp->ref_cnt, dmp->list_ref_cnt);
242 1.2 haad }
243 1.2 haad
244 1.6 haad return 0;
245 1.2 haad
246 1.2 haad }*/
247