geom_kern.c revision 110686
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_kern.c 110686 2003-02-11 11:02:27Z phk $ 36 */ 37 38#include <sys/param.h> 39#include <sys/systm.h> 40#include <sys/kernel.h> 41#include <sys/malloc.h> 42#include <sys/bio.h> 43#include <sys/sysctl.h> 44#include <sys/proc.h> 45#include <sys/kthread.h> 46#include <sys/lock.h> 47#include <sys/mutex.h> 48#include <sys/sx.h> 49#include <sys/sbuf.h> 50#include <geom/geom.h> 51#include <geom/geom_int.h> 52#include <geom/geom_stats.h> 53 54MALLOC_DEFINE(M_GEOM, "GEOM", "Geom data structures"); 55 56struct sx topology_lock; 57 58static struct proc *g_up_proc; 59 60int g_debugflags; 61int g_collectstats = 1; 62 63/* 64 * G_UP and G_DOWN are the two threads which push I/O through the 65 * stack. 66 * 67 * Things are procesed in a FIFO order, but these threads could be 68 * part of I/O prioritization by deciding which bios/bioqs to service 69 * in what order. 70 * 71 * We have only one thread in each direction, it is belived that until 72 * a very non-trivial workload in the UP/DOWN path this will be enough, 73 * but more than one can actually be run without problems. 74 * 75 * Holding the "mymutex" is a debugging feature: It prevents people 76 * from sleeping in the UP/DOWN I/O path by mistake or design (doing 77 * so almost invariably result in deadlocks since it stalls all I/O 78 * processing in the given direction. 79 */ 80 81static void 82g_up_procbody(void) 83{ 84 struct proc *p = g_up_proc; 85 struct thread *tp = FIRST_THREAD_IN_PROC(p); 86 struct mtx mymutex; 87 88 mtx_assert(&Giant, MA_NOTOWNED); 89 bzero(&mymutex, sizeof mymutex); 90 mtx_init(&mymutex, "g_up", MTX_DEF, 0); 91 mtx_lock(&mymutex); 92 tp->td_base_pri = PRIBIO; 93 for(;;) { 94 g_io_schedule_up(tp); 95 msleep(&g_wait_up, &mymutex, PRIBIO, "g_up", hz/10); 96 } 97} 98 99struct kproc_desc g_up_kp = { 100 "g_up", 101 g_up_procbody, 102 &g_up_proc, 103}; 104 105static struct proc *g_down_proc; 106 107static void 108g_down_procbody(void) 109{ 110 struct proc *p = g_down_proc; 111 struct thread *tp = FIRST_THREAD_IN_PROC(p); 112 struct mtx mymutex; 113 114 mtx_assert(&Giant, MA_NOTOWNED); 115 bzero(&mymutex, sizeof mymutex); 116 mtx_init(&mymutex, "g_down", MTX_DEF, 0); 117 mtx_lock(&mymutex); 118 tp->td_base_pri = PRIBIO; 119 for(;;) { 120 g_io_schedule_down(tp); 121 msleep(&g_wait_down, &mymutex, PRIBIO, "g_down", hz/10); 122 } 123} 124 125struct kproc_desc g_down_kp = { 126 "g_down", 127 g_down_procbody, 128 &g_down_proc, 129}; 130 131static struct proc *g_event_proc; 132 133static void 134g_event_procbody(void) 135{ 136 struct proc *p = g_event_proc; 137 struct thread *tp = FIRST_THREAD_IN_PROC(p); 138 139 mtx_assert(&Giant, MA_NOTOWNED); 140 tp->td_base_pri = PRIBIO; 141 for(;;) { 142 g_run_events(); 143 tsleep(&g_wait_event, PRIBIO, "g_events", hz/10); 144 } 145} 146 147struct kproc_desc g_event_kp = { 148 "g_event", 149 g_event_procbody, 150 &g_event_proc, 151}; 152 153void 154g_init(void) 155{ 156 sx_init(&topology_lock, "GEOM topology"); 157 g_stat_init(); 158 g_io_init(); 159 g_event_init(); 160 mtx_lock(&Giant); 161 kproc_start(&g_event_kp); 162 kproc_start(&g_up_kp); 163 kproc_start(&g_down_kp); 164 mtx_unlock(&Giant); 165} 166 167static int 168sysctl_kern_geom_conftxt(SYSCTL_HANDLER_ARGS) 169{ 170 int error; 171 struct sbuf *sb; 172 173 sb = sbuf_new(NULL, NULL, 0, SBUF_AUTOEXTEND); 174 sbuf_clear(sb); 175 g_call_me(g_conftxt, sb); 176 do { 177 tsleep(sb, PZERO, "g_conftxt", hz); 178 } while(!sbuf_done(sb)); 179 error = SYSCTL_OUT(req, sbuf_data(sb), sbuf_len(sb) + 1); 180 sbuf_delete(sb); 181 return error; 182} 183 184static int 185sysctl_kern_geom_confdot(SYSCTL_HANDLER_ARGS) 186{ 187 int error; 188 struct sbuf *sb; 189 190 sb = sbuf_new(NULL, NULL, 0, SBUF_AUTOEXTEND); 191 sbuf_clear(sb); 192 g_call_me(g_confdot, sb); 193 do { 194 tsleep(sb, PZERO, "g_confdot", hz); 195 } while(!sbuf_done(sb)); 196 error = SYSCTL_OUT(req, sbuf_data(sb), sbuf_len(sb) + 1); 197 sbuf_delete(sb); 198 return error; 199} 200 201static int 202sysctl_kern_geom_confxml(SYSCTL_HANDLER_ARGS) 203{ 204 int error; 205 struct sbuf *sb; 206 207 sb = sbuf_new(NULL, NULL, 0, SBUF_AUTOEXTEND); 208 sbuf_clear(sb); 209 g_call_me(g_confxml, sb); 210 do { 211 tsleep(sb, PZERO, "g_confxml", hz); 212 } while(!sbuf_done(sb)); 213 error = SYSCTL_OUT(req, sbuf_data(sb), sbuf_len(sb) + 1); 214 sbuf_delete(sb); 215 return error; 216} 217 218SYSCTL_NODE(_kern, OID_AUTO, geom, CTLFLAG_RW, 0, "GEOMetry management"); 219 220SYSCTL_PROC(_kern_geom, OID_AUTO, confxml, CTLTYPE_STRING|CTLFLAG_RD, 221 0, 0, sysctl_kern_geom_confxml, "", 222 "Dump the GEOM config in XML"); 223 224SYSCTL_PROC(_kern_geom, OID_AUTO, confdot, CTLTYPE_STRING|CTLFLAG_RD, 225 0, 0, sysctl_kern_geom_confdot, "", 226 "Dump the GEOM config in dot"); 227 228SYSCTL_PROC(_kern_geom, OID_AUTO, conftxt, CTLTYPE_STRING|CTLFLAG_RD, 229 0, 0, sysctl_kern_geom_conftxt, "", 230 "Dump the GEOM config in txt"); 231 232SYSCTL_INT(_kern_geom, OID_AUTO, debugflags, CTLFLAG_RW, 233 &g_debugflags, 0, ""); 234 235SYSCTL_INT(_kern_geom, OID_AUTO, collectstats, CTLFLAG_RW, 236 &g_collectstats, 0, ""); 237 238SYSCTL_INT(_debug_sizeof, OID_AUTO, g_class, CTLFLAG_RD, 239 0, sizeof(struct g_class), ""); 240SYSCTL_INT(_debug_sizeof, OID_AUTO, g_geom, CTLFLAG_RD, 241 0, sizeof(struct g_geom), ""); 242SYSCTL_INT(_debug_sizeof, OID_AUTO, g_provider, CTLFLAG_RD, 243 0, sizeof(struct g_provider), ""); 244SYSCTL_INT(_debug_sizeof, OID_AUTO, g_consumer, CTLFLAG_RD, 245 0, sizeof(struct g_consumer), ""); 246SYSCTL_INT(_debug_sizeof, OID_AUTO, g_bioq, CTLFLAG_RD, 247 0, sizeof(struct g_bioq), ""); 248SYSCTL_INT(_debug_sizeof, OID_AUTO, g_event, CTLFLAG_RD, 249 0, sizeof(struct g_event), ""); 250SYSCTL_INT(_debug_sizeof, OID_AUTO, g_stat, CTLFLAG_RD, 251 0, sizeof(struct g_stat), ""); 252