1/*- 2 * Copyright (c) 2002 Poul-Henning Kamp 3 * Copyright (c) 2002 Networks Associates Technology, Inc. 4 * All rights reserved. 5 * 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. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 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 21 * permission. 22 * 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 33 * SUCH DAMAGE. 34 *
| 1/*- 2 * Copyright (c) 2002 Poul-Henning Kamp 3 * Copyright (c) 2002 Networks Associates Technology, Inc. 4 * All rights reserved. 5 * 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. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 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 21 * permission. 22 * 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 33 * SUCH DAMAGE. 34 *
|
35 * $FreeBSD: head/sys/geom/geom_int.h 112370 2003-03-18 09:42:33Z phk $
| 35 * $FreeBSD: head/sys/geom/geom_int.h 112476 2003-03-21 22:05:33Z phk $
|
36 */ 37 38LIST_HEAD(class_list_head, g_class); 39TAILQ_HEAD(g_tailq_head, g_geom); 40TAILQ_HEAD(event_tailq_head, g_event); 41 42extern struct event_tailq_head events; 43extern int g_collectstats; 44extern int g_debugflags; 45/* 46 * 1 G_T_TOPOLOGY 47 * 2 G_T_BIO 48 * 4 G_T_ACCESS
| 36 */ 37 38LIST_HEAD(class_list_head, g_class); 39TAILQ_HEAD(g_tailq_head, g_geom); 40TAILQ_HEAD(event_tailq_head, g_event); 41 42extern struct event_tailq_head events; 43extern int g_collectstats; 44extern int g_debugflags; 45/* 46 * 1 G_T_TOPOLOGY 47 * 2 G_T_BIO 48 * 4 G_T_ACCESS
|
49 * 8 enable sanity checks
| 49 * 8 Enable sanity checks
|
50 * 16 Allow footshooting on rank#1 providers
| 50 * 16 Allow footshooting on rank#1 providers
|
| 51 * 32 G_T_DETAILS
|
51 */
| 52 */
|
| 53#define G_F_DISKIOCTL 64
|
52
| 54
|
| 55
|
53/* 54 * Various internal actions are tracked by tagging g_event[s] onto 55 * an internal eventqueue. 56 */ 57enum g_events { 58 EV_NEW_CLASS, /* class */ 59 EV_NEW_PROVIDER, /* provider */ 60 EV_SPOILED, /* provider, consumer */ 61 EV_CALL_ME, /* func, arg */ 62 EV_LAST 63}; 64 65struct g_event { 66 enum g_events event; 67 TAILQ_ENTRY(g_event) events; 68 struct g_class *class; 69 struct g_geom *geom; 70 struct g_provider *provider; 71 struct g_consumer *consumer; 72 void *arg; 73 g_call_me_t *func; 74}; 75 76/* 77 * We actually have a number of drivers sharing the same major number 78 * so we coordinate the major/minor usage here 79 */ 80#define GEOM_MAJOR 4 81#define GEOM_MINOR_STATS 0 82#define GEOM_MINOR_PROVIDERS 10 83 84/* geom_dump.c */ 85void g_confxml(void *); 86void g_conf_specific(struct sbuf *sb, struct g_class *mp, struct g_geom *gp, struct g_provider *pp, struct g_consumer *cp); 87void g_confdot(void *); 88void g_conftxt(void *); 89 90/* geom_event.c */ 91void g_event_init(void); 92void g_post_event(enum g_events ev, struct g_class *mp, struct g_geom *gp, struct g_provider *pp, struct g_consumer *cp); 93void g_run_events(void); 94 95/* geom_subr.c */ 96extern struct class_list_head g_classes; 97extern char *g_wait_event, *g_wait_sim, *g_wait_up, *g_wait_down; 98 99/* geom_io.c */ 100void g_io_init(void); 101void g_io_schedule_down(struct thread *tp); 102void g_io_schedule_up(struct thread *tp); 103 104/* geom_kern.c / geom_kernsim.c */ 105void g_init(void);
| 56/* 57 * Various internal actions are tracked by tagging g_event[s] onto 58 * an internal eventqueue. 59 */ 60enum g_events { 61 EV_NEW_CLASS, /* class */ 62 EV_NEW_PROVIDER, /* provider */ 63 EV_SPOILED, /* provider, consumer */ 64 EV_CALL_ME, /* func, arg */ 65 EV_LAST 66}; 67 68struct g_event { 69 enum g_events event; 70 TAILQ_ENTRY(g_event) events; 71 struct g_class *class; 72 struct g_geom *geom; 73 struct g_provider *provider; 74 struct g_consumer *consumer; 75 void *arg; 76 g_call_me_t *func; 77}; 78 79/* 80 * We actually have a number of drivers sharing the same major number 81 * so we coordinate the major/minor usage here 82 */ 83#define GEOM_MAJOR 4 84#define GEOM_MINOR_STATS 0 85#define GEOM_MINOR_PROVIDERS 10 86 87/* geom_dump.c */ 88void g_confxml(void *); 89void g_conf_specific(struct sbuf *sb, struct g_class *mp, struct g_geom *gp, struct g_provider *pp, struct g_consumer *cp); 90void g_confdot(void *); 91void g_conftxt(void *); 92 93/* geom_event.c */ 94void g_event_init(void); 95void g_post_event(enum g_events ev, struct g_class *mp, struct g_geom *gp, struct g_provider *pp, struct g_consumer *cp); 96void g_run_events(void); 97 98/* geom_subr.c */ 99extern struct class_list_head g_classes; 100extern char *g_wait_event, *g_wait_sim, *g_wait_up, *g_wait_down; 101 102/* geom_io.c */ 103void g_io_init(void); 104void g_io_schedule_down(struct thread *tp); 105void g_io_schedule_up(struct thread *tp); 106 107/* geom_kern.c / geom_kernsim.c */ 108void g_init(void);
|