1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 2002 Poul-Henning Kamp 5 * Copyright (c) 2002 Networks Associates Technology, Inc. 6 * All rights reserved. 7 * 8 * This software was developed for the FreeBSD Project by Poul-Henning Kamp 9 * and NAI Labs, the Security Research Division of Network Associates, Inc. 10 * under DARPA/SPAWAR contract N66001-01-C-8035 ("CBOSS"), as part of the 11 * DARPA CHATS research program. 12 * 13 * Redistribution and use in source and binary forms, with or without 14 * modification, are permitted provided that the following conditions 15 * are met: 16 * 1. Redistributions of source code must retain the above copyright 17 * notice, this list of conditions and the following disclaimer. 18 * 2. Redistributions in binary form must reproduce the above copyright 19 * notice, this list of conditions and the following disclaimer in the 20 * documentation and/or other materials provided with the distribution. 21 * 3. The names of the authors may not be used to endorse or promote 22 * products derived from this software without specific prior written 23 * permission. 24 * 25 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 28 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 35 * SUCH DAMAGE. 36 * 37 * $FreeBSD$ 38 */ 39 40 #ifndef _GEOM_GEOM_H_ 41 #define _GEOM_GEOM_H_ 42 43 #include <sys/lock.h> 44 #include <sys/mutex.h> 45 #include <sys/sx.h> 46 #include <sys/queue.h> 47 #include <sys/ioccom.h> 48 #include <sys/conf.h> 49 #include <sys/module.h> 50 51 struct g_class; 52 struct g_geom; 53 struct g_consumer; 54 struct g_provider; 55 struct g_stat; 56 struct thread; 57 struct bio; 58 struct sbuf; 59 struct gctl_req; 60 struct g_configargs; 61 struct disk_zone_args; 62 63 typedef int g_config_t (struct g_configargs *ca); 64 typedef void g_ctl_req_t (struct gctl_req *, struct g_class *cp, char const *verb); 65 typedef int g_ctl_create_geom_t (struct gctl_req *, struct g_class *cp, struct g_provider *pp); 66 typedef int g_ctl_destroy_geom_t (struct gctl_req *, struct g_class *cp, struct g_geom *gp); 67 typedef int g_ctl_config_geom_t (struct gctl_req *, struct g_geom *gp, const char *verb); 68 typedef void g_init_t (struct g_class *mp); 69 typedef void g_fini_t (struct g_class *mp); 70 typedef struct g_geom * g_taste_t (struct g_class *, struct g_provider *, int flags); 71 typedef int g_ioctl_t(struct g_provider *pp, u_long cmd, void *data, int fflag, struct thread *td); 72 #define G_TF_NORMAL 0 73 #define G_TF_INSIST 1 74 #define G_TF_TRANSPARENT 2 75 typedef int g_access_t (struct g_provider *, int, int, int); 76 /* XXX: not sure about the thread arg */ 77 typedef void g_orphan_t (struct g_consumer *); 78 79 typedef void g_start_t (struct bio *); 80 typedef void g_spoiled_t (struct g_consumer *); 81 typedef void g_attrchanged_t (struct g_consumer *, const char *attr); 82 typedef void g_provgone_t (struct g_provider *); 83 typedef void g_dumpconf_t (struct sbuf *, const char *indent, struct g_geom *, 84 struct g_consumer *, struct g_provider *); 85 typedef void g_resize_t(struct g_consumer *cp); 86 87 /* 88 * The g_class structure describes a transformation class. In other words 89 * all BSD disklabel handlers share one g_class, all MBR handlers share 90 * one common g_class and so on. 91 * Certain operations are instantiated on the class, most notably the 92 * taste and config_geom functions. 93 */ 94 struct g_class { 95 const char *name; 96 u_int version; 97 u_int spare0; 98 g_taste_t *taste; 99 g_config_t *config; 100 g_ctl_req_t *ctlreq; 101 g_init_t *init; 102 g_fini_t *fini; 103 g_ctl_destroy_geom_t *destroy_geom; 104 /* 105 * Default values for geom methods 106 */ 107 g_start_t *start; 108 g_spoiled_t *spoiled; 109 g_attrchanged_t *attrchanged; 110 g_dumpconf_t *dumpconf; 111 g_access_t *access; 112 g_orphan_t *orphan; 113 g_ioctl_t *ioctl; 114 g_provgone_t *providergone; 115 g_resize_t *resize; 116 void *spare1; 117 void *spare2; 118 /* 119 * The remaining elements are private 120 */ 121 LIST_ENTRY(g_class) class; 122 LIST_HEAD(,g_geom) geom; 123 }; 124 125 /* 126 * The g_geom_alias is a list node for aliases for the geom name 127 * for device node creation. 128 */ 129 struct g_geom_alias { 130 LIST_ENTRY(g_geom_alias) ga_next; 131 const char *ga_alias; 132 }; 133 134 #define G_VERSION_00 0x19950323 135 #define G_VERSION_01 0x20041207 /* add fflag to g_ioctl_t */ 136 #define G_VERSION G_VERSION_01 137 138 /* 139 * The g_geom is an instance of a g_class. 140 */ 141 struct g_geom { 142 char *name; 143 struct g_class *class; 144 LIST_ENTRY(g_geom) geom; 145 LIST_HEAD(,g_consumer) consumer; 146 LIST_HEAD(,g_provider) provider; 147 TAILQ_ENTRY(g_geom) geoms; /* XXX: better name */ 148 int rank; 149 g_start_t *start; 150 g_spoiled_t *spoiled; 151 g_attrchanged_t *attrchanged; 152 g_dumpconf_t *dumpconf; 153 g_access_t *access; 154 g_orphan_t *orphan; 155 g_ioctl_t *ioctl; 156 g_provgone_t *providergone; 157 g_resize_t *resize; 158 void *spare0; 159 void *spare1; 160 void *softc; 161 unsigned flags; 162 #define G_GEOM_WITHER 1 163 #define G_GEOM_VOLATILE_BIO 2 164 LIST_HEAD(,g_geom_alias) aliases; 165 }; 166 167 /* 168 * The g_bioq is a queue of struct bio's. 169 * XXX: possibly collection point for statistics. 170 * XXX: should (possibly) be collapsed with sys/bio.h::bio_queue_head. 171 */ 172 struct g_bioq { 173 TAILQ_HEAD(, bio) bio_queue; 174 struct mtx bio_queue_lock; 175 int bio_queue_length; 176 }; 177 178 /* 179 * A g_consumer is an attachment point for a g_provider. One g_consumer 180 * can only be attached to one g_provider, but multiple g_consumers 181 * can be attached to one g_provider. 182 */ 183 184 struct g_consumer { 185 struct g_geom *geom; 186 LIST_ENTRY(g_consumer) consumer; 187 struct g_provider *provider; 188 LIST_ENTRY(g_consumer) consumers; /* XXX: better name */ 189 int acr, acw, ace; 190 int flags; 191 #define G_CF_SPOILED 0x1 192 #define G_CF_ORPHAN 0x4 193 #define G_CF_DIRECT_SEND 0x10 194 #define G_CF_DIRECT_RECEIVE 0x20 195 struct devstat *stat; 196 u_int nstart, nend; 197 198 /* Two fields for the implementing class to use */ 199 void *private; 200 u_int index; 201 }; 202 203 /* 204 * A g_provider is a "logical disk". 205 */ 206 struct g_provider { 207 char *name; 208 LIST_ENTRY(g_provider) provider; 209 struct g_geom *geom; 210 LIST_HEAD(,g_consumer) consumers; 211 int acr, acw, ace; 212 int error; 213 TAILQ_ENTRY(g_provider) orphan; 214 off_t mediasize; 215 u_int sectorsize; 216 u_int stripesize; 217 u_int stripeoffset; 218 struct devstat *stat; 219 u_int nstart, nend; 220 u_int flags; 221 #define G_PF_WITHER 0x2 222 #define G_PF_ORPHAN 0x4 223 #define G_PF_ACCEPT_UNMAPPED 0x8 224 #define G_PF_DIRECT_SEND 0x10 225 #define G_PF_DIRECT_RECEIVE 0x20 226 227 /* Two fields for the implementing class to use */ 228 void *private; 229 u_int index; 230 }; 231 232 /* 233 * Descriptor of a classifier. We can register a function and 234 * an argument, which is called by g_io_request() on bio's 235 * that are not previously classified. 236 */ 237 struct g_classifier_hook { 238 TAILQ_ENTRY(g_classifier_hook) link; 239 int (*func)(void *arg, struct bio *bp); 240 void *arg; 241 }; 242 243 /* BIO_GETATTR("GEOM::setstate") argument values. */ 244 #define G_STATE_FAILED 0 245 #define G_STATE_REBUILD 1 246 #define G_STATE_RESYNC 2 247 #define G_STATE_ACTIVE 3 248 249 /* geom_dev.c */ 250 struct cdev; 251 void g_dev_print(void); 252 void g_dev_physpath_changed(void); 253 struct g_provider *g_dev_getprovider(struct cdev *dev); 254 255 /* geom_dump.c */ 256 void g_trace(int level, const char *, ...); 257 # define G_T_TOPOLOGY 1 258 # define G_T_BIO 2 259 # define G_T_ACCESS 4 260 261 262 /* geom_event.c */ 263 typedef void g_event_t(void *, int flag); 264 #define EV_CANCEL 1 265 int g_post_event(g_event_t *func, void *arg, int flag, ...); 266 int g_waitfor_event(g_event_t *func, void *arg, int flag, ...); 267 void g_cancel_event(void *ref); 268 int g_attr_changed(struct g_provider *pp, const char *attr, int flag); 269 int g_media_changed(struct g_provider *pp, int flag); 270 int g_media_gone(struct g_provider *pp, int flag); 271 void g_orphan_provider(struct g_provider *pp, int error); 272 void g_waitidlelock(void); 273 274 /* geom_subr.c */ 275 int g_access(struct g_consumer *cp, int nread, int nwrite, int nexcl); 276 int g_attach(struct g_consumer *cp, struct g_provider *pp); 277 int g_compare_names(const char *namea, const char *nameb); 278 void g_destroy_consumer(struct g_consumer *cp); 279 void g_destroy_geom(struct g_geom *pp); 280 void g_destroy_provider(struct g_provider *pp); 281 void g_detach(struct g_consumer *cp); 282 void g_error_provider(struct g_provider *pp, int error); 283 struct g_provider *g_provider_by_name(char const *arg); 284 void g_geom_add_alias(struct g_geom *gp, const char *alias); 285 int g_getattr__(const char *attr, struct g_consumer *cp, void *var, int len); 286 #define g_getattr(a, c, v) g_getattr__((a), (c), (v), sizeof *(v)) 287 int g_handleattr(struct bio *bp, const char *attribute, const void *val, 288 int len); 289 int g_handleattr_int(struct bio *bp, const char *attribute, int val); 290 int g_handleattr_off_t(struct bio *bp, const char *attribute, off_t val); 291 int g_handleattr_uint16_t(struct bio *bp, const char *attribute, uint16_t val); 292 int g_handleattr_str(struct bio *bp, const char *attribute, const char *str); 293 struct g_consumer * g_new_consumer(struct g_geom *gp); 294 struct g_geom * g_new_geomf(struct g_class *mp, const char *fmt, ...) 295 __printflike(2, 3); 296 struct g_provider * g_new_providerf(struct g_geom *gp, const char *fmt, ...) 297 __printflike(2, 3); 298 void g_resize_provider(struct g_provider *pp, off_t size); 299 int g_retaste(struct g_class *mp); 300 void g_spoil(struct g_provider *pp, struct g_consumer *cp); 301 int g_std_access(struct g_provider *pp, int dr, int dw, int de); 302 void g_std_done(struct bio *bp); 303 void g_std_spoiled(struct g_consumer *cp); 304 void g_wither_geom(struct g_geom *gp, int error); 305 void g_wither_geom_close(struct g_geom *gp, int error); 306 void g_wither_provider(struct g_provider *pp, int error); 307 308 #if defined(DIAGNOSTIC) || defined(DDB) 309 int g_valid_obj(void const *ptr); 310 #endif 311 #ifdef DIAGNOSTIC 312 #define G_VALID_CLASS(foo) \ 313 KASSERT(g_valid_obj(foo) == 1, ("%p is not a g_class", foo)) 314 #define G_VALID_GEOM(foo) \ 315 KASSERT(g_valid_obj(foo) == 2, ("%p is not a g_geom", foo)) 316 #define G_VALID_CONSUMER(foo) \ 317 KASSERT(g_valid_obj(foo) == 3, ("%p is not a g_consumer", foo)) 318 #define G_VALID_PROVIDER(foo) \ 319 KASSERT(g_valid_obj(foo) == 4, ("%p is not a g_provider", foo)) 320 #else 321 #define G_VALID_CLASS(foo) do { } while (0) 322 #define G_VALID_GEOM(foo) do { } while (0) 323 #define G_VALID_CONSUMER(foo) do { } while (0) 324 #define G_VALID_PROVIDER(foo) do { } while (0) 325 #endif 326 327 int g_modevent(module_t, int, void *); 328 329 /* geom_io.c */ 330 struct bio * g_clone_bio(struct bio *); 331 struct bio * g_duplicate_bio(struct bio *); 332 void g_destroy_bio(struct bio *); 333 void g_io_deliver(struct bio *bp, int error); 334 int g_io_getattr(const char *attr, struct g_consumer *cp, int *len, void *ptr); 335 int g_io_zonecmd(struct disk_zone_args *zone_args, struct g_consumer *cp); 336 int g_io_flush(struct g_consumer *cp); 337 int g_register_classifier(struct g_classifier_hook *hook); 338 void g_unregister_classifier(struct g_classifier_hook *hook); 339 void g_io_request(struct bio *bp, struct g_consumer *cp); 340 struct bio *g_new_bio(void); 341 struct bio *g_alloc_bio(void); 342 void g_reset_bio(struct bio *); 343 void * g_read_data(struct g_consumer *cp, off_t offset, off_t length, int *error); 344 int g_write_data(struct g_consumer *cp, off_t offset, void *ptr, off_t length); 345 int g_delete_data(struct g_consumer *cp, off_t offset, off_t length); 346 void g_print_bio(struct bio *bp); 347 int g_use_g_read_data(void *, off_t, void **, int); 348 int g_use_g_write_data(void *, off_t, void *, int); 349 350 /* geom_kern.c / geom_kernsim.c */ 351 352 #ifdef _KERNEL 353 354 extern struct sx topology_lock; 355 356 struct g_kerneldump { 357 off_t offset; 358 off_t length; 359 struct dumperinfo di; 360 }; 361 362 MALLOC_DECLARE(M_GEOM); 363 364 static __inline void * 365 g_malloc(int size, int flags) 366 { 367 void *p; 368 369 p = malloc(size, M_GEOM, flags); 370 return (p); 371 } 372 373 static __inline void 374 g_free(void *ptr) 375 { 376 377 #ifdef DIAGNOSTIC 378 if (sx_xlocked(&topology_lock)) { 379 KASSERT(g_valid_obj(ptr) == 0, 380 ("g_free(%p) of live object, type %d", ptr, 381 g_valid_obj(ptr))); 382 } 383 #endif 384 free(ptr, M_GEOM); 385 } 386 387 #define g_topology_lock() \ 388 do { \ 389 sx_xlock(&topology_lock); \ 390 } while (0) 391 392 #define g_topology_try_lock() sx_try_xlock(&topology_lock) 393 394 #define g_topology_unlock() \ 395 do { \ 396 sx_xunlock(&topology_lock); \ 397 } while (0) 398 399 #define g_topology_assert() \ 400 do { \ 401 sx_assert(&topology_lock, SX_XLOCKED); \ 402 } while (0) 403 404 #define g_topology_assert_not() \ 405 do { \ 406 sx_assert(&topology_lock, SX_UNLOCKED); \ 407 } while (0) 408 409 #define g_topology_sleep(chan, timo) \ 410 sx_sleep(chan, &topology_lock, 0, "gtopol", timo) 411 412 #define DECLARE_GEOM_CLASS(class, name) \ 413 static moduledata_t name##_mod = { \ 414 #name, g_modevent, &class \ 415 }; \ 416 DECLARE_MODULE(name, name##_mod, SI_SUB_DRIVERS, SI_ORDER_FIRST); 417 418 int g_is_geom_thread(struct thread *td); 419 420 #endif /* _KERNEL */ 421 422 /* geom_ctl.c */ 423 int gctl_set_param(struct gctl_req *req, const char *param, void const *ptr, int len); 424 void gctl_set_param_err(struct gctl_req *req, const char *param, void const *ptr, int len); 425 void *gctl_get_param(struct gctl_req *req, const char *param, int *len); 426 char const *gctl_get_asciiparam(struct gctl_req *req, const char *param); 427 void *gctl_get_paraml(struct gctl_req *req, const char *param, int len); 428 int gctl_error(struct gctl_req *req, const char *fmt, ...) __printflike(2, 3); 429 struct g_class *gctl_get_class(struct gctl_req *req, char const *arg); 430 struct g_geom *gctl_get_geom(struct gctl_req *req, struct g_class *mpr, char const *arg); 431 struct g_provider *gctl_get_provider(struct gctl_req *req, char const *arg); 432 433 #endif /* _GEOM_GEOM_H_ */ 434