2 * Copyright (c) 2002 Poul-Henning Kamp
3 * Copyright (c) 2002 Networks Associates Technology, Inc.
6 * This software was developed for the FreeBSD Project by Poul-Henning Kamp
7 * and NAI Labs, the Security Research Division of Network Associates, Inc.
8 * under DARPA/SPAWAR contract N66001-01-C-8035 ("CBOSS"), as part of the
9 * DARPA CHATS research program.
11 * Redistribution and use in source and binary forms, with or without
12 * modification, are permitted provided that the following conditions
14 * 1. Redistributions of source code must retain the above copyright
15 * notice, this list of conditions and the following disclaimer.
16 * 2. Redistributions in binary form must reproduce the above copyright
17 * notice, this list of conditions and the following disclaimer in the
18 * documentation and/or other materials provided with the distribution.
19 * 3. The names of the authors may not be used to endorse or promote
20 * products derived from this software without specific prior written
23 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
42 #include <sys/mutex.h>
44 #include <sys/queue.h>
45 #include <sys/ioccom.h>
47 #include <sys/module.h>
60 typedef int g_config_t (struct g_configargs *ca);
61 typedef void g_ctl_req_t (struct gctl_req *, struct g_class *cp, char const *verb);
62 typedef int g_ctl_create_geom_t (struct gctl_req *, struct g_class *cp, struct g_provider *pp);
63 typedef int g_ctl_destroy_geom_t (struct gctl_req *, struct g_class *cp, struct g_geom *gp);
64 typedef int g_ctl_config_geom_t (struct gctl_req *, struct g_geom *gp, const char *verb);
65 typedef void g_init_t (struct g_class *mp);
66 typedef void g_fini_t (struct g_class *mp);
67 typedef struct g_geom * g_taste_t (struct g_class *, struct g_provider *, int flags);
68 typedef int g_ioctl_t(struct g_provider *pp, u_long cmd, void *data, int fflag, struct thread *td);
71 #define G_TF_TRANSPARENT 2
72 typedef int g_access_t (struct g_provider *, int, int, int);
73 /* XXX: not sure about the thread arg */
74 typedef void g_orphan_t (struct g_consumer *);
76 typedef void g_start_t (struct bio *);
77 typedef void g_spoiled_t (struct g_consumer *);
78 typedef void g_dumpconf_t (struct sbuf *, const char *indent, struct g_geom *,
79 struct g_consumer *, struct g_provider *);
82 * The g_class structure describes a transformation class. In other words
83 * all BSD disklabel handlers share one g_class, all MBR handlers share
84 * one common g_class and so on.
85 * Certain operations are instantiated on the class, most notably the
86 * taste and config_geom functions.
96 g_ctl_destroy_geom_t *destroy_geom;
98 * Defaults values for geom methods
101 g_spoiled_t *spoiled;
102 g_dumpconf_t *dumpconf;
107 * The remaining elements are private
109 LIST_ENTRY(g_class) class;
110 LIST_HEAD(,g_geom) geom;
113 #define G_VERSION_00 0x19950323
114 #define G_VERSION_01 0x20041207 /* add fflag to g_ioctl_t */
115 #define G_VERSION G_VERSION_01
118 * The g_geom is an instance of a g_class.
122 struct g_class *class;
123 LIST_ENTRY(g_geom) geom;
124 LIST_HEAD(,g_consumer) consumer;
125 LIST_HEAD(,g_provider) provider;
126 TAILQ_ENTRY(g_geom) geoms; /* XXX: better name */
129 g_spoiled_t *spoiled;
130 g_dumpconf_t *dumpconf;
136 #define G_GEOM_WITHER 1
140 * The g_bioq is a queue of struct bio's.
141 * XXX: possibly collection point for statistics.
142 * XXX: should (possibly) be collapsed with sys/bio.h::bio_queue_head.
145 TAILQ_HEAD(, bio) bio_queue;
146 struct mtx bio_queue_lock;
147 int bio_queue_length;
151 * A g_consumer is an attachment point for a g_provider. One g_consumer
152 * can only be attached to one g_provider, but multiple g_consumers
153 * can be attached to one g_provider.
158 LIST_ENTRY(g_consumer) consumer;
159 struct g_provider *provider;
160 LIST_ENTRY(g_consumer) consumers; /* XXX: better name */
163 struct devstat *stat;
166 /* Two fields for the implementing class to use */
172 * A g_provider is a "logical disk".
176 LIST_ENTRY(g_provider) provider;
178 LIST_HEAD(,g_consumer) consumers;
181 TAILQ_ENTRY(g_provider) orphan;
186 struct devstat *stat;
189 #define G_PF_CANDELETE 0x1
190 #define G_PF_WITHER 0x2
191 #define G_PF_ORPHAN 0x4
193 /* Two fields for the implementing class to use */
200 void g_dev_print(void);
201 struct g_provider *g_dev_getprovider(struct cdev *dev);
204 void g_trace(int level, const char *, ...);
205 # define G_T_TOPOLOGY 1
207 # define G_T_ACCESS 4
211 typedef void g_event_t(void *, int flag);
213 int g_post_event(g_event_t *func, void *arg, int flag, ...);
214 int g_waitfor_event(g_event_t *func, void *arg, int flag, ...);
215 void g_cancel_event(void *ref);
216 void g_orphan_provider(struct g_provider *pp, int error);
217 void g_waitidlelock(void);
220 int g_access(struct g_consumer *cp, int nread, int nwrite, int nexcl);
221 int g_attach(struct g_consumer *cp, struct g_provider *pp);
222 void g_destroy_consumer(struct g_consumer *cp);
223 void g_destroy_geom(struct g_geom *pp);
224 void g_destroy_provider(struct g_provider *pp);
225 void g_detach(struct g_consumer *cp);
226 void g_error_provider(struct g_provider *pp, int error);
227 struct g_provider *g_provider_by_name(char const *arg);
228 int g_getattr__(const char *attr, struct g_consumer *cp, void *var, int len);
229 #define g_getattr(a, c, v) g_getattr__((a), (c), (v), sizeof *(v))
230 int g_handleattr(struct bio *bp, const char *attribute, void *val, int len);
231 int g_handleattr_int(struct bio *bp, const char *attribute, int val);
232 int g_handleattr_off_t(struct bio *bp, const char *attribute, off_t val);
233 struct g_consumer * g_new_consumer(struct g_geom *gp);
234 struct g_geom * g_new_geomf(struct g_class *mp, const char *fmt, ...);
235 struct g_provider * g_new_providerf(struct g_geom *gp, const char *fmt, ...);
236 void g_spoil(struct g_provider *pp, struct g_consumer *cp);
237 int g_std_access(struct g_provider *pp, int dr, int dw, int de);
238 void g_std_done(struct bio *bp);
239 void g_std_spoiled(struct g_consumer *cp);
240 void g_wither_geom(struct g_geom *gp, int error);
241 void g_wither_geom_close(struct g_geom *gp, int error);
244 int g_valid_obj(void const *ptr);
245 #define G_VALID_CLASS(foo) \
246 KASSERT(g_valid_obj(foo) == 1, ("%p is not a g_class", foo))
247 #define G_VALID_GEOM(foo) \
248 KASSERT(g_valid_obj(foo) == 2, ("%p is not a g_geom", foo))
249 #define G_VALID_CONSUMER(foo) \
250 KASSERT(g_valid_obj(foo) == 3, ("%p is not a g_consumer", foo))
251 #define G_VALID_PROVIDER(foo) \
252 KASSERT(g_valid_obj(foo) == 4, ("%p is not a g_provider", foo))
254 #define G_VALID_CLASS(foo) do { } while (0)
255 #define G_VALID_GEOM(foo) do { } while (0)
256 #define G_VALID_CONSUMER(foo) do { } while (0)
257 #define G_VALID_PROVIDER(foo) do { } while (0)
260 int g_modevent(module_t, int, void *);
263 struct bio * g_clone_bio(struct bio *);
264 void g_destroy_bio(struct bio *);
265 void g_io_deliver(struct bio *bp, int error);
266 int g_io_getattr(const char *attr, struct g_consumer *cp, int *len, void *ptr);
267 void g_io_request(struct bio *bp, struct g_consumer *cp);
268 struct bio *g_new_bio(void);
269 struct bio *g_alloc_bio(void);
270 void * g_read_data(struct g_consumer *cp, off_t offset, off_t length, int *error);
271 int g_write_data(struct g_consumer *cp, off_t offset, void *ptr, off_t length);
272 void g_print_bio(struct bio *bp);
274 /* geom_kern.c / geom_kernsim.c */
278 struct g_kerneldump {
283 MALLOC_DECLARE(M_GEOM);
285 static __inline void *
286 g_malloc(int size, int flags)
290 p = malloc(size, M_GEOM, flags);
299 KASSERT(g_valid_obj(ptr) == 0,
300 ("g_free(%p) of live object, type %d", ptr, g_valid_obj(ptr)));
305 extern struct sx topology_lock;
307 #define g_topology_lock() \
309 mtx_assert(&Giant, MA_NOTOWNED); \
310 sx_xlock(&topology_lock); \
313 #define g_topology_try_lock() sx_try_xlock(&topology_lock)
315 #define g_topology_unlock() \
317 sx_xunlock(&topology_lock); \
320 #define g_topology_assert() \
322 sx_assert(&topology_lock, SX_XLOCKED); \
325 #define g_topology_assert_not() \
327 sx_assert(&topology_lock, SX_UNLOCKED); \
330 #define DECLARE_GEOM_CLASS(class, name) \
331 static moduledata_t name##_mod = { \
332 #name, g_modevent, &class \
334 DECLARE_MODULE(name, name##_mod, SI_SUB_DRIVERS, SI_ORDER_FIRST);
339 void gctl_set_param(struct gctl_req *req, const char *param, void const *ptr, int len);
340 void *gctl_get_param(struct gctl_req *req, const char *param, int *len);
341 char const *gctl_get_asciiparam(struct gctl_req *req, const char *param);
342 void *gctl_get_paraml(struct gctl_req *req, const char *param, int len);
343 int gctl_error(struct gctl_req *req, const char *fmt, ...);
344 struct g_class *gctl_get_class(struct gctl_req *req, char const *arg);
345 struct g_geom *gctl_get_geom(struct gctl_req *req, struct g_class *mpr, char const *arg);
346 struct g_provider *gctl_get_provider(struct gctl_req *req, char const *arg);
348 #endif /* _GEOM_GEOM_H_ */