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
36 #include <sys/cdefs.h>
37 __FBSDID("$FreeBSD$");
39 #include <sys/param.h>
41 #include <sys/systm.h>
42 #include <sys/malloc.h>
43 #include <machine/stdarg.h>
45 #include <geom/geom.h>
46 #include <geom/geom_int.h>
47 #include <geom/geom_disk.h>
51 g_confdot_consumer(struct sbuf *sb, struct g_consumer *cp)
54 sbuf_printf(sb, "z%p [label=\"r%dw%de%d\"];\n",
55 cp, cp->acr, cp->acw, cp->ace);
57 sbuf_printf(sb, "z%p -> z%p;\n", cp, cp->provider);
61 g_confdot_provider(struct sbuf *sb, struct g_provider *pp)
64 sbuf_printf(sb, "z%p [shape=hexagon,label=\"%s\\nr%dw%de%d\\nerr#%d\\n"
65 "sector=%u\\nstripe=%u\"];\n", pp, pp->name, pp->acr, pp->acw,
66 pp->ace, pp->error, pp->sectorsize, pp->stripesize);
70 g_confdot_geom(struct sbuf *sb, struct g_geom *gp)
72 struct g_consumer *cp;
73 struct g_provider *pp;
75 sbuf_printf(sb, "z%p [shape=box,label=\"%s\\n%s\\nr#%d\"];\n",
76 gp, gp->class->name, gp->name, gp->rank);
77 LIST_FOREACH(cp, &gp->consumer, consumer) {
78 g_confdot_consumer(sb, cp);
79 sbuf_printf(sb, "z%p -> z%p;\n", gp, cp);
82 LIST_FOREACH(pp, &gp->provider, provider) {
83 g_confdot_provider(sb, pp);
84 sbuf_printf(sb, "z%p -> z%p;\n", pp, gp);
89 g_confdot_class(struct sbuf *sb, struct g_class *mp)
93 LIST_FOREACH(gp, &mp->geom, geom)
94 g_confdot_geom(sb, gp);
98 g_confdot(void *p, int flag )
103 KASSERT(flag != EV_CANCEL, ("g_confdot was cancelled"));
106 sbuf_printf(sb, "digraph geom {\n");
107 LIST_FOREACH(mp, &g_classes, class)
108 g_confdot_class(sb, mp);
109 sbuf_printf(sb, "}\n");
114 g_conftxt_geom(struct sbuf *sb, struct g_geom *gp, int level)
116 struct g_provider *pp;
117 struct g_consumer *cp;
119 if (gp->flags & G_GEOM_WITHER)
121 LIST_FOREACH(pp, &gp->provider, provider) {
122 sbuf_printf(sb, "%d %s %s %ju %u", level, gp->class->name,
123 pp->name, (uintmax_t)pp->mediasize, pp->sectorsize);
124 if (gp->dumpconf != NULL)
125 gp->dumpconf(sb, NULL, gp, NULL, pp);
126 sbuf_printf(sb, "\n");
127 LIST_FOREACH(cp, &pp->consumers, consumers)
128 g_conftxt_geom(sb, cp->geom, level + 1);
133 g_conftxt_class(struct sbuf *sb, struct g_class *mp)
137 LIST_FOREACH(gp, &mp->geom, geom)
138 g_conftxt_geom(sb, gp, 0);
142 g_conftxt(void *p, int flag)
147 KASSERT(flag != EV_CANCEL, ("g_conftxt was cancelled"));
150 LIST_FOREACH(mp, &g_classes, class) {
151 if (!strcmp(mp->name, G_DISK_CLASS_NAME) || !strcmp(mp->name, "MD"))
152 g_conftxt_class(sb, mp);
159 g_conf_printf_escaped(struct sbuf *sb, const char *fmt, ...)
167 sbuf_vprintf(s, fmt, ap);
171 for (c = sbuf_data(s); *c != '\0'; c++) {
172 if (*c == '&' || *c == '<' || *c == '>' ||
173 *c == '\'' || *c == '"' || *c > 0x7e)
174 sbuf_printf(sb, "&#x%X;", *c);
175 else if (*c == '\t' || *c == '\n' || *c == '\r' || *c > 0x1f)
184 g_conf_consumer(struct sbuf *sb, struct g_consumer *cp)
187 sbuf_printf(sb, "\t<consumer id=\"%p\">\n", cp);
188 sbuf_printf(sb, "\t <geom ref=\"%p\"/>\n", cp->geom);
189 if (cp->provider != NULL)
190 sbuf_printf(sb, "\t <provider ref=\"%p\"/>\n", cp->provider);
191 sbuf_printf(sb, "\t <mode>r%dw%de%d</mode>\n",
192 cp->acr, cp->acw, cp->ace);
193 if (cp->geom->flags & G_GEOM_WITHER)
195 else if (cp->geom->dumpconf != NULL) {
196 sbuf_printf(sb, "\t <config>\n");
197 cp->geom->dumpconf(sb, "\t ", cp->geom, cp, NULL);
198 sbuf_printf(sb, "\t </config>\n");
200 sbuf_printf(sb, "\t</consumer>\n");
204 g_conf_provider(struct sbuf *sb, struct g_provider *pp)
207 sbuf_printf(sb, "\t<provider id=\"%p\">\n", pp);
208 sbuf_printf(sb, "\t <geom ref=\"%p\"/>\n", pp->geom);
209 sbuf_printf(sb, "\t <mode>r%dw%de%d</mode>\n",
210 pp->acr, pp->acw, pp->ace);
211 sbuf_printf(sb, "\t <name>");
212 g_conf_printf_escaped(sb, "%s", pp->name);
213 sbuf_printf(sb, "</name>\n");
214 sbuf_printf(sb, "\t <mediasize>%jd</mediasize>\n",
215 (intmax_t)pp->mediasize);
216 sbuf_printf(sb, "\t <sectorsize>%u</sectorsize>\n", pp->sectorsize);
217 sbuf_printf(sb, "\t <stripesize>%u</stripesize>\n", pp->stripesize);
218 sbuf_printf(sb, "\t <stripeoffset>%u</stripeoffset>\n", pp->stripeoffset);
219 if (pp->flags & G_PF_WITHER)
220 sbuf_printf(sb, "\t <wither/>\n");
221 else if (pp->geom->flags & G_GEOM_WITHER)
223 else if (pp->geom->dumpconf != NULL) {
224 sbuf_printf(sb, "\t <config>\n");
225 pp->geom->dumpconf(sb, "\t ", pp->geom, NULL, pp);
226 sbuf_printf(sb, "\t </config>\n");
228 sbuf_printf(sb, "\t</provider>\n");
233 g_conf_geom(struct sbuf *sb, struct g_geom *gp, struct g_provider *pp, struct g_consumer *cp)
235 struct g_consumer *cp2;
236 struct g_provider *pp2;
237 struct g_geom_alias *gap;
239 sbuf_printf(sb, " <geom id=\"%p\">\n", gp);
240 sbuf_printf(sb, " <class ref=\"%p\"/>\n", gp->class);
241 sbuf_printf(sb, " <name>");
242 g_conf_printf_escaped(sb, "%s", gp->name);
243 sbuf_printf(sb, "</name>\n");
244 sbuf_printf(sb, " <rank>%d</rank>\n", gp->rank);
245 if (gp->flags & G_GEOM_WITHER)
246 sbuf_printf(sb, " <wither/>\n");
247 else if (gp->dumpconf != NULL) {
248 sbuf_printf(sb, " <config>\n");
249 gp->dumpconf(sb, "\t", gp, NULL, NULL);
250 sbuf_printf(sb, " </config>\n");
252 LIST_FOREACH(cp2, &gp->consumer, consumer) {
253 if (cp != NULL && cp != cp2)
255 g_conf_consumer(sb, cp2);
258 LIST_FOREACH(pp2, &gp->provider, provider) {
259 if (pp != NULL && pp != pp2)
261 g_conf_provider(sb, pp2);
263 LIST_FOREACH(gap, &gp->aliases, ga_next) {
264 sbuf_printf(sb, " <alias>\n");
265 g_conf_printf_escaped(sb, "%s", gap->ga_alias);
266 sbuf_printf(sb, " </alias>\n");
268 sbuf_printf(sb, " </geom>\n");
272 g_conf_class(struct sbuf *sb, struct g_class *mp, struct g_geom *gp, struct g_provider *pp, struct g_consumer *cp)
276 sbuf_printf(sb, " <class id=\"%p\">\n", mp);
277 sbuf_printf(sb, " <name>");
278 g_conf_printf_escaped(sb, "%s", mp->name);
279 sbuf_printf(sb, "</name>\n");
280 LIST_FOREACH(gp2, &mp->geom, geom) {
281 if (gp != NULL && gp != gp2)
283 g_conf_geom(sb, gp2, pp, cp);
285 sbuf_printf(sb, " </class>\n");
289 g_conf_specific(struct sbuf *sb, struct g_class *mp, struct g_geom *gp, struct g_provider *pp, struct g_consumer *cp)
294 sbuf_printf(sb, "<mesh>\n");
295 LIST_FOREACH(mp2, &g_classes, class) {
296 if (mp != NULL && mp != mp2)
298 g_conf_class(sb, mp2, gp, pp, cp);
300 sbuf_printf(sb, "</mesh>\n");
305 g_confxml(void *p, int flag)
308 KASSERT(flag != EV_CANCEL, ("g_confxml was cancelled"));
310 g_conf_specific(p, NULL, NULL, NULL, NULL);
314 g_trace(int level, const char *fmt, ...)
318 if (!(g_debugflags & level))