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
36#include <sys/cdefs.h>
37__FBSDID("$FreeBSD$");
38
39#include <sys/param.h>
40#include <sys/sbuf.h>
41#include <sys/systm.h>
42#include <sys/malloc.h>
43#include <machine/stdarg.h>
44
45#include <geom/geom.h>
46#include <geom/geom_int.h>
47
48
49static void
50g_confdot_consumer(struct sbuf *sb, struct g_consumer *cp)
51{
52
53	sbuf_printf(sb, "z%p [label=\"r%dw%de%d\"];\n",
54	    cp, cp->acr, cp->acw, cp->ace);
55	if (cp->provider)
56		sbuf_printf(sb, "z%p -> z%p;\n", cp, cp->provider);
57}
58
59static void
60g_confdot_provider(struct sbuf *sb, struct g_provider *pp)
61{
62
63	sbuf_printf(sb, "z%p [shape=hexagon,label=\"%s\\nr%dw%de%d\\nerr#%d\"];\n",
64	    pp, pp->name, pp->acr, pp->acw, pp->ace, pp->error);
65}
66
67static void
68g_confdot_geom(struct sbuf *sb, struct g_geom *gp)
69{
70	struct g_consumer *cp;
71	struct g_provider *pp;
72
73	sbuf_printf(sb, "z%p [shape=box,label=\"%s\\n%s\\nr#%d\"];\n",
74	    gp, gp->class->name, gp->name, gp->rank);
75	LIST_FOREACH(cp, &gp->consumer, consumer) {
76		g_confdot_consumer(sb, cp);
77		sbuf_printf(sb, "z%p -> z%p;\n", gp, cp);
78	}
79
80	LIST_FOREACH(pp, &gp->provider, provider) {
81		g_confdot_provider(sb, pp);
82		sbuf_printf(sb, "z%p -> z%p;\n", pp, gp);
83	}
84}
85
86static void
87g_confdot_class(struct sbuf *sb, struct g_class *mp)
88{
89	struct g_geom *gp;
90
91	LIST_FOREACH(gp, &mp->geom, geom)
92		g_confdot_geom(sb, gp);
93}
94
95void
96g_confdot(void *p, int flag )
97{
98	struct g_class *mp;
99	struct sbuf *sb;
100
101	KASSERT(flag != EV_CANCEL, ("g_confdot was cancelled"));
102	sb = p;
103	g_topology_assert();
104	sbuf_printf(sb, "digraph geom {\n");
105	LIST_FOREACH(mp, &g_classes, class)
106		g_confdot_class(sb, mp);
107	sbuf_printf(sb, "}\n");
108	sbuf_finish(sb);
109}
110
111static void
112g_conftxt_geom(struct sbuf *sb, struct g_geom *gp, int level)
113{
114	struct g_provider *pp;
115	struct g_consumer *cp;
116
117	if (gp->flags & G_GEOM_WITHER)
118		return;
119	LIST_FOREACH(pp, &gp->provider, provider) {
120		sbuf_printf(sb, "%d %s %s %ju %u", level, gp->class->name,
121		    pp->name, (uintmax_t)pp->mediasize, pp->sectorsize);
122		if (gp->dumpconf != NULL)
123			gp->dumpconf(sb, NULL, gp, NULL, pp);
124		sbuf_printf(sb, "\n");
125		LIST_FOREACH(cp, &pp->consumers, consumers)
126			g_conftxt_geom(sb, cp->geom, level + 1);
127	}
128}
129
130static void
131g_conftxt_class(struct sbuf *sb, struct g_class *mp)
132{
133	struct g_geom *gp;
134
135	LIST_FOREACH(gp, &mp->geom, geom)
136		g_conftxt_geom(sb, gp, 0);
137}
138
139void
140g_conftxt(void *p, int flag)
141{
142	struct g_class *mp;
143	struct sbuf *sb;
144
145	KASSERT(flag != EV_CANCEL, ("g_conftxt was cancelled"));
146	sb = p;
147	g_topology_assert();
148	LIST_FOREACH(mp, &g_classes, class) {
149		if (!strcmp(mp->name, "DISK") || !strcmp(mp->name, "MD"))
150			g_conftxt_class(sb, mp);
151	}
152	sbuf_finish(sb);
153}
154
155
156void
157g_conf_printf_escaped(struct sbuf *sb, const char *fmt, ...)
158{
159	struct sbuf *s;
160	const u_char *c;
161	va_list ap;
162
163	s = sbuf_new_auto();
164	va_start(ap, fmt);
165	sbuf_vprintf(s, fmt, ap);
166	va_end(ap);
167	sbuf_finish(s);
168
169	for (c = sbuf_data(s); *c != '\0'; c++) {
170		if (*c == '&' || *c == '<' || *c == '>' ||
171		    *c == '\'' || *c == '"' || *c > 0x7e)
172			sbuf_printf(sb, "&#x%X;", *c);
173		else if (*c == '\t' || *c == '\n' || *c == '\r' || *c > 0x1f)
174			sbuf_putc(sb, *c);
175		else
176			sbuf_putc(sb, '?');
177	}
178	sbuf_delete(s);
179}
180
181static void
182g_conf_consumer(struct sbuf *sb, struct g_consumer *cp)
183{
184
185	sbuf_printf(sb, "\t<consumer id=\"%p\">\n", cp);
186	sbuf_printf(sb, "\t  <geom ref=\"%p\"/>\n", cp->geom);
187	if (cp->provider != NULL)
188		sbuf_printf(sb, "\t  <provider ref=\"%p\"/>\n", cp->provider);
189	sbuf_printf(sb, "\t  <mode>r%dw%de%d</mode>\n",
190	    cp->acr, cp->acw, cp->ace);
191	if (cp->geom->flags & G_GEOM_WITHER)
192		;
193	else if (cp->geom->dumpconf != NULL) {
194		sbuf_printf(sb, "\t  <config>\n");
195		cp->geom->dumpconf(sb, "\t    ", cp->geom, cp, NULL);
196		sbuf_printf(sb, "\t  </config>\n");
197	}
198	sbuf_printf(sb, "\t</consumer>\n");
199}
200
201static void
202g_conf_provider(struct sbuf *sb, struct g_provider *pp)
203{
204
205	sbuf_printf(sb, "\t<provider id=\"%p\">\n", pp);
206	sbuf_printf(sb, "\t  <geom ref=\"%p\"/>\n", pp->geom);
207	sbuf_printf(sb, "\t  <mode>r%dw%de%d</mode>\n",
208	    pp->acr, pp->acw, pp->ace);
209	sbuf_printf(sb, "\t  <name>");
210	g_conf_printf_escaped(sb, "%s", pp->name);
211	sbuf_printf(sb, "</name>\n");
212	sbuf_printf(sb, "\t  <mediasize>%jd</mediasize>\n",
213	    (intmax_t)pp->mediasize);
214	sbuf_printf(sb, "\t  <sectorsize>%u</sectorsize>\n", pp->sectorsize);
215	sbuf_printf(sb, "\t  <stripesize>%u</stripesize>\n", pp->stripesize);
216	sbuf_printf(sb, "\t  <stripeoffset>%u</stripeoffset>\n", pp->stripeoffset);
217	if (pp->geom->flags & G_GEOM_WITHER)
218		;
219	else if (pp->geom->dumpconf != NULL) {
220		sbuf_printf(sb, "\t  <config>\n");
221		pp->geom->dumpconf(sb, "\t    ", pp->geom, NULL, pp);
222		sbuf_printf(sb, "\t  </config>\n");
223	}
224	sbuf_printf(sb, "\t</provider>\n");
225}
226
227
228static void
229g_conf_geom(struct sbuf *sb, struct g_geom *gp, struct g_provider *pp, struct g_consumer *cp)
230{
231	struct g_consumer *cp2;
232	struct g_provider *pp2;
233
234	sbuf_printf(sb, "    <geom id=\"%p\">\n", gp);
235	sbuf_printf(sb, "      <class ref=\"%p\"/>\n", gp->class);
236	sbuf_printf(sb, "      <name>");
237	g_conf_printf_escaped(sb, "%s", gp->name);
238	sbuf_printf(sb, "</name>\n");
239	sbuf_printf(sb, "      <rank>%d</rank>\n", gp->rank);
240	if (gp->flags & G_GEOM_WITHER)
241		sbuf_printf(sb, "      <wither/>\n");
242	else if (gp->dumpconf != NULL) {
243		sbuf_printf(sb, "      <config>\n");
244		gp->dumpconf(sb, "\t", gp, NULL, NULL);
245		sbuf_printf(sb, "      </config>\n");
246	}
247	LIST_FOREACH(cp2, &gp->consumer, consumer) {
248		if (cp != NULL && cp != cp2)
249			continue;
250		g_conf_consumer(sb, cp2);
251	}
252
253	LIST_FOREACH(pp2, &gp->provider, provider) {
254		if (pp != NULL && pp != pp2)
255			continue;
256		g_conf_provider(sb, pp2);
257	}
258	sbuf_printf(sb, "    </geom>\n");
259}
260
261static void
262g_conf_class(struct sbuf *sb, struct g_class *mp, struct g_geom *gp, struct g_provider *pp, struct g_consumer *cp)
263{
264	struct g_geom *gp2;
265
266	sbuf_printf(sb, "  <class id=\"%p\">\n", mp);
267	sbuf_printf(sb, "    <name>");
268	g_conf_printf_escaped(sb, "%s", mp->name);
269	sbuf_printf(sb, "</name>\n");
270	LIST_FOREACH(gp2, &mp->geom, geom) {
271		if (gp != NULL && gp != gp2)
272			continue;
273		g_conf_geom(sb, gp2, pp, cp);
274	}
275	sbuf_printf(sb, "  </class>\n");
276}
277
278void
279g_conf_specific(struct sbuf *sb, struct g_class *mp, struct g_geom *gp, struct g_provider *pp, struct g_consumer *cp)
280{
281	struct g_class *mp2;
282
283	g_topology_assert();
284	sbuf_printf(sb, "<mesh>\n");
285	LIST_FOREACH(mp2, &g_classes, class) {
286		if (mp != NULL && mp != mp2)
287			continue;
288		g_conf_class(sb, mp2, gp, pp, cp);
289	}
290	sbuf_printf(sb, "</mesh>\n");
291	sbuf_finish(sb);
292}
293
294void
295g_confxml(void *p, int flag)
296{
297
298	KASSERT(flag != EV_CANCEL, ("g_confxml was cancelled"));
299	g_topology_assert();
300	g_conf_specific(p, NULL, NULL, NULL, NULL);
301}
302
303void
304g_trace(int level, const char *fmt, ...)
305{
306	va_list ap;
307
308	if (!(g_debugflags & level))
309		return;
310	va_start(ap, fmt);
311	vprintf(fmt, ap);
312	va_end(ap);
313	printf("\n");
314}
315