geom_subr.c revision 110541 
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_subr.c 110541 2003-02-08 13:03:57Z phk $
36 */
37
38
39#include <sys/param.h>
40#include <sys/stdint.h>
41#ifndef _KERNEL
42#include <stdio.h>
43#include <unistd.h>
44#include <stdlib.h>
45#include <signal.h>
46#include <string.h>
47#include <err.h>
48#else
49#include <sys/systm.h>
50#include <sys/kernel.h>
51#include <sys/malloc.h>
52#include <sys/bio.h>
53#include <sys/sysctl.h>
54#include <sys/proc.h>
55#include <sys/kthread.h>
56#include <sys/lock.h>
57#include <sys/mutex.h>
58#endif
59#include <sys/errno.h>
60#include <sys/sbuf.h>
61#include <geom/geom.h>
62#include <geom/geom_int.h>
63#include <geom/geom_stats.h>
64#include <machine/stdarg.h>
65
66struct class_list_head g_classes = LIST_HEAD_INITIALIZER(g_classes);
67static struct g_tailq_head geoms = TAILQ_HEAD_INITIALIZER(geoms);
68static int g_nproviders;
69char *g_wait_event, *g_wait_up, *g_wait_down, *g_wait_sim;
70
71static int g_ignition;
72
73void
74g_add_class(struct g_class *mp)
75{
76
77	if (!g_ignition) {
78		g_ignition++;
79		g_init();
80	}
81	mp->protect = 0x020016600;
82	g_topology_lock();
83	g_trace(G_T_TOPOLOGY, "g_add_class(%s)", mp->name);
84	LIST_INIT(&mp->geom);
85	LIST_INSERT_HEAD(&g_classes, mp, class);
86	if (g_nproviders > 0)
87		g_post_event(EV_NEW_CLASS, mp, NULL, NULL, NULL);
88	g_topology_unlock();
89}
90
91struct g_geom *
92g_new_geomf(struct g_class *mp, const char *fmt, ...)
93{
94	struct g_geom *gp;
95	va_list ap;
96	struct sbuf *sb;
97
98	g_topology_assert();
99	va_start(ap, fmt);
100	sb = sbuf_new(NULL, NULL, 0, SBUF_AUTOEXTEND);
101	sbuf_vprintf(sb, fmt, ap);
102	sbuf_finish(sb);
103	gp = g_malloc(sizeof *gp, M_ZERO);
104	gp->protect = 0x020016601;
105	gp->name = g_malloc(sbuf_len(sb) + 1, M_ZERO);
106	gp->class = mp;
107	gp->rank = 1;
108	LIST_INIT(&gp->consumer);
109	LIST_INIT(&gp->provider);
110	LIST_INSERT_HEAD(&mp->geom, gp, geom);
111	TAILQ_INSERT_HEAD(&geoms, gp, geoms);
112	strcpy(gp->name, sbuf_data(sb));
113	sbuf_delete(sb);
114	return (gp);
115}
116
117void
118g_destroy_geom(struct g_geom *gp)
119{
120
121	g_trace(G_T_TOPOLOGY, "g_destroy_geom(%p(%s))", gp, gp->name);
122	g_topology_assert();
123	KASSERT(gp->event == NULL, ("g_destroy_geom() with event"));
124	KASSERT(LIST_EMPTY(&gp->consumer),
125	    ("g_destroy_geom(%s) with consumer(s) [%p]",
126	    gp->name, LIST_FIRST(&gp->consumer)));
127	KASSERT(LIST_EMPTY(&gp->provider),
128	    ("g_destroy_geom(%s) with provider(s) [%p]",
129	    gp->name, LIST_FIRST(&gp->consumer)));
130	LIST_REMOVE(gp, geom);
131	TAILQ_REMOVE(&geoms, gp, geoms);
132	g_free(gp->name);
133	g_free(gp);
134}
135
136struct g_consumer *
137g_new_consumer(struct g_geom *gp)
138{
139	struct g_consumer *cp;
140
141	g_topology_assert();
142	KASSERT(gp->orphan != NULL,
143	    ("g_new_consumer on geom(%s) (class %s) without orphan",
144	    gp->name, gp->class->name));
145
146	cp = g_malloc(sizeof *cp, M_ZERO);
147	cp->protect = 0x020016602;
148	cp->geom = gp;
149	cp->stat = g_stat_new(cp);
150	LIST_INSERT_HEAD(&gp->consumer, cp, consumer);
151	return(cp);
152}
153
154void
155g_destroy_consumer(struct g_consumer *cp)
156{
157
158	g_trace(G_T_TOPOLOGY, "g_destroy_consumer(%p)", cp);
159	g_topology_assert();
160	KASSERT(cp->event == NULL, ("g_destroy_consumer() with event"));
161	KASSERT (cp->provider == NULL, ("g_destroy_consumer but attached"));
162	KASSERT (cp->acr == 0, ("g_destroy_consumer with acr"));
163	KASSERT (cp->acw == 0, ("g_destroy_consumer with acw"));
164	KASSERT (cp->ace == 0, ("g_destroy_consumer with ace"));
165	LIST_REMOVE(cp, consumer);
166	g_stat_delete(cp->stat);
167	g_free(cp);
168}
169
170struct g_provider *
171g_new_providerf(struct g_geom *gp, const char *fmt, ...)
172{
173	struct g_provider *pp;
174	struct sbuf *sb;
175	va_list ap;
176
177	g_topology_assert();
178	va_start(ap, fmt);
179	sb = sbuf_new(NULL, NULL, 0, SBUF_AUTOEXTEND);
180	sbuf_vprintf(sb, fmt, ap);
181	sbuf_finish(sb);
182	pp = g_malloc(sizeof *pp + sbuf_len(sb) + 1, M_ZERO);
183	pp->protect = 0x020016603;
184	pp->name = (char *)(pp + 1);
185	strcpy(pp->name, sbuf_data(sb));
186	sbuf_delete(sb);
187	LIST_INIT(&pp->consumers);
188	pp->error = ENXIO;
189	pp->geom = gp;
190	pp->stat = g_stat_new(pp);
191	LIST_INSERT_HEAD(&gp->provider, pp, provider);
192	g_nproviders++;
193	g_post_event(EV_NEW_PROVIDER, NULL, NULL, pp, NULL);
194	return (pp);
195}
196
197void
198g_error_provider(struct g_provider *pp, int error)
199{
200
201	pp->error = error;
202}
203
204
205void
206g_destroy_provider(struct g_provider *pp)
207{
208	struct g_geom *gp;
209	struct g_consumer *cp;
210
211	g_topology_assert();
212	KASSERT(pp->event == NULL, ("g_destroy_provider() with event"));
213	KASSERT(LIST_EMPTY(&pp->consumers),
214	    ("g_destroy_provider but attached"));
215	KASSERT (pp->acr == 0, ("g_destroy_provider with acr"));
216	KASSERT (pp->acw == 0, ("g_destroy_provider with acw"));
217	KASSERT (pp->acw == 0, ("g_destroy_provider with ace"));
218	g_nproviders--;
219	LIST_REMOVE(pp, provider);
220	gp = pp->geom;
221	g_stat_delete(pp->stat);
222	g_free(pp);
223	if (!(gp->flags & G_GEOM_WITHER))
224		return;
225	if (!LIST_EMPTY(&gp->provider))
226		return;
227	for (;;) {
228		cp = LIST_FIRST(&gp->consumer);
229		if (cp == NULL)
230			break;
231		g_detach(cp);
232		g_destroy_consumer(cp);
233	}
234	g_destroy_geom(gp);
235}
236
237/*
238 * We keep the "geoms" list sorted by topological order (== increasing
239 * numerical rank) at all times.
240 * When an attach is done, the attaching geoms rank is invalidated
241 * and it is moved to the tail of the list.
242 * All geoms later in the sequence has their ranks reevaluated in
243 * sequence.  If we cannot assign rank to a geom because it's
244 * prerequisites do not have rank, we move that element to the tail
245 * of the sequence with invalid rank as well.
246 * At some point we encounter our original geom and if we stil fail
247 * to assign it a rank, there must be a loop and we fail back to
248 * g_attach() which detach again and calls redo_rank again
249 * to fix up the damage.
250 * It would be much simpler code wise to do it recursively, but we
251 * can't risk that on the kernel stack.
252 */
253
254static int
255redo_rank(struct g_geom *gp)
256{
257	struct g_consumer *cp;
258	struct g_geom *gp1, *gp2;
259	int n, m;
260
261	g_topology_assert();
262
263	/* Invalidate this geoms rank and move it to the tail */
264	gp1 = TAILQ_NEXT(gp, geoms);
265	if (gp1 != NULL) {
266		gp->rank = 0;
267		TAILQ_REMOVE(&geoms, gp, geoms);
268		TAILQ_INSERT_TAIL(&geoms, gp, geoms);
269	} else {
270		gp1 = gp;
271	}
272
273	/* re-rank the rest of the sequence */
274	for (; gp1 != NULL; gp1 = gp2) {
275		gp1->rank = 0;
276		m = 1;
277		LIST_FOREACH(cp, &gp1->consumer, consumer) {
278			if (cp->provider == NULL)
279				continue;
280			n = cp->provider->geom->rank;
281			if (n == 0) {
282				m = 0;
283				break;
284			} else if (n >= m)
285				m = n + 1;
286		}
287		gp1->rank = m;
288		gp2 = TAILQ_NEXT(gp1, geoms);
289
290		/* got a rank, moving on */
291		if (m != 0)
292			continue;
293
294		/* no rank to original geom means loop */
295		if (gp == gp1)
296			return (ELOOP);
297
298		/* no rank, put it at the end move on */
299		TAILQ_REMOVE(&geoms, gp1, geoms);
300		TAILQ_INSERT_TAIL(&geoms, gp1, geoms);
301	}
302	return (0);
303}
304
305int
306g_attach(struct g_consumer *cp, struct g_provider *pp)
307{
308	int error;
309
310	g_topology_assert();
311	KASSERT(cp->provider == NULL, ("attach but attached"));
312	cp->provider = pp;
313	LIST_INSERT_HEAD(&pp->consumers, cp, consumers);
314	error = redo_rank(cp->geom);
315	if (error) {
316		LIST_REMOVE(cp, consumers);
317		cp->provider = NULL;
318		redo_rank(cp->geom);
319	}
320	return (error);
321}
322
323void
324g_detach(struct g_consumer *cp)
325{
326	struct g_provider *pp;
327
328	g_trace(G_T_TOPOLOGY, "g_detach(%p)", cp);
329	KASSERT(cp != (void*)0xd0d0d0d0, ("ARGH!"));
330	g_topology_assert();
331	KASSERT(cp->provider != NULL, ("detach but not attached"));
332	KASSERT(cp->acr == 0, ("detach but nonzero acr"));
333	KASSERT(cp->acw == 0, ("detach but nonzero acw"));
334	KASSERT(cp->ace == 0, ("detach but nonzero ace"));
335	KASSERT(cp->stat->nop == cp->stat->nend,
336	    ("detach with active requests"));
337	pp = cp->provider;
338	LIST_REMOVE(cp, consumers);
339	cp->provider = NULL;
340	if (LIST_EMPTY(&pp->consumers)) {
341		if (pp->geom->flags & G_GEOM_WITHER)
342			g_destroy_provider(pp);
343	}
344	redo_rank(cp->geom);
345}
346
347
348/*
349 * g_access_abs()
350 *
351 * Access-check with absolute new values:  Just fall through
352 * and use the relative version.
353 */
354int
355g_access_abs(struct g_consumer *cp, int acr, int acw, int ace)
356{
357
358	g_topology_assert();
359	return(g_access_rel(cp,
360		acr - cp->acr,
361		acw - cp->acw,
362		ace - cp->ace));
363}
364
365/*
366 * g_access_rel()
367 *
368 * Access-check with delta values.  The question asked is "can provider
369 * "cp" change the access counters by the relative amounts dc[rwe] ?"
370 */
371
372int
373g_access_rel(struct g_consumer *cp, int dcr, int dcw, int dce)
374{
375	struct g_provider *pp;
376	int pr,pw,pe;
377	int error;
378
379	pp = cp->provider;
380
381	g_trace(G_T_ACCESS, "g_access_rel(%p(%s), %d, %d, %d)",
382	    cp, pp->name, dcr, dcw, dce);
383
384	g_topology_assert();
385	KASSERT(cp->provider != NULL, ("access but not attached"));
386	KASSERT(cp->acr + dcr >= 0, ("access resulting in negative acr"));
387	KASSERT(cp->acw + dcw >= 0, ("access resulting in negative acw"));
388	KASSERT(cp->ace + dce >= 0, ("access resulting in negative ace"));
389	KASSERT(pp->geom->access != NULL, ("NULL geom->access"));
390
391	/*
392	 * If our class cares about being spoiled, and we have been, we
393	 * are probably just ahead of the event telling us that.  Fail
394	 * now rather than having to unravel this later.
395	 */
396	if (cp->geom->spoiled != NULL && cp->spoiled) {
397		KASSERT(dcr >= 0, ("spoiled but dcr = %d", dcr));
398		KASSERT(dcw >= 0, ("spoiled but dce = %d", dcw));
399		KASSERT(dce >= 0, ("spoiled but dcw = %d", dce));
400		KASSERT(cp->acr == 0, ("spoiled but cp->acr = %d", cp->acr));
401		KASSERT(cp->acw == 0, ("spoiled but cp->acw = %d", cp->acw));
402		KASSERT(cp->ace == 0, ("spoiled but cp->ace = %d", cp->ace));
403		return(ENXIO);
404	}
405
406	/*
407	 * Figure out what counts the provider would have had, if this
408	 * consumer had (r0w0e0) at this time.
409	 */
410	pr = pp->acr - cp->acr;
411	pw = pp->acw - cp->acw;
412	pe = pp->ace - cp->ace;
413
414	g_trace(G_T_ACCESS,
415    "open delta:[r%dw%de%d] old:[r%dw%de%d] provider:[r%dw%de%d] %p(%s)",
416	    dcr, dcw, dce,
417	    cp->acr, cp->acw, cp->ace,
418	    pp->acr, pp->acw, pp->ace,
419	    pp, pp->name);
420
421	/* If we try exclusive but already write: fail */
422	if (dce > 0 && pw > 0)
423		return (EPERM);
424	/* If we try write but already exclusive: fail */
425	if (dcw > 0 && pe > 0)
426		return (EPERM);
427	/* If we try to open more but provider is error'ed: fail */
428	if ((dcr > 0 || dcw > 0 || dce > 0) && pp->error != 0)
429		return (pp->error);
430
431	/* Ok then... */
432
433	/*
434	 * If we open first write, spoil any partner consumers.
435	 * If we close last write, trigger re-taste.
436	 */
437	if (pp->acw == 0 && dcw != 0)
438		g_spoil(pp, cp);
439	else if (pp->acw != 0 && pp->acw == -dcw &&
440	    !(pp->geom->flags & G_GEOM_WITHER))
441		g_post_event(EV_NEW_PROVIDER, NULL, NULL, pp, NULL);
442
443	error = pp->geom->access(pp, dcr, dcw, dce);
444	if (!error) {
445		pp->acr += dcr;
446		pp->acw += dcw;
447		pp->ace += dce;
448		cp->acr += dcr;
449		cp->acw += dcw;
450		cp->ace += dce;
451	}
452	return (error);
453}
454
455int
456g_handleattr_int(struct bio *bp, const char *attribute, int val)
457{
458
459	return (g_handleattr(bp, attribute, &val, sizeof val));
460}
461
462int
463g_handleattr_off_t(struct bio *bp, const char *attribute, off_t val)
464{
465
466	return (g_handleattr(bp, attribute, &val, sizeof val));
467}
468
469
470int
471g_handleattr(struct bio *bp, const char *attribute, void *val, int len)
472{
473	int error;
474
475	if (strcmp(bp->bio_attribute, attribute))
476		return (0);
477	if (bp->bio_length != len) {
478		printf("bio_length %jd len %d -> EFAULT\n",
479		    (intmax_t)bp->bio_length, len);
480		error = EFAULT;
481	} else {
482		error = 0;
483		bcopy(val, bp->bio_data, len);
484		bp->bio_completed = len;
485	}
486	g_io_deliver(bp, error);
487	return (1);
488}
489
490int
491g_std_access(struct g_provider *pp __unused,
492	int dr __unused, int dw __unused, int de __unused)
493{
494
495        return (0);
496}
497
498void
499g_std_done(struct bio *bp)
500{
501	struct bio *bp2;
502
503	bp2 = bp->bio_parent;
504	if (bp2->bio_error == 0)
505		bp2->bio_error = bp->bio_error;
506	bp2->bio_completed += bp->bio_completed;
507	g_destroy_bio(bp);
508	bp2->bio_inbed++;
509	if (bp2->bio_children == bp2->bio_inbed)
510		g_io_deliver(bp2, bp2->bio_error);
511}
512
513/* XXX: maybe this is only g_slice_spoiled */
514
515void
516g_std_spoiled(struct g_consumer *cp)
517{
518	struct g_geom *gp;
519	struct g_provider *pp;
520
521	g_trace(G_T_TOPOLOGY, "g_std_spoiled(%p)", cp);
522	g_topology_assert();
523	g_detach(cp);
524	gp = cp->geom;
525	LIST_FOREACH(pp, &gp->provider, provider)
526		g_orphan_provider(pp, ENXIO);
527	g_destroy_consumer(cp);
528	if (LIST_EMPTY(&gp->provider) && LIST_EMPTY(&gp->consumer))
529		g_destroy_geom(gp);
530	else
531		gp->flags |= G_GEOM_WITHER;
532}
533
534/*
535 * Spoiling happens when a provider is opened for writing, but consumers
536 * which are configured by in-band data are attached (slicers for instance).
537 * Since the write might potentially change the in-band data, such consumers
538 * need to re-evaluate their existence after the writing session closes.
539 * We do this by (offering to) tear them down when the open for write happens
540 * in return for a re-taste when it closes again.
541 * Together with the fact that such consumers grab an 'e' bit whenever they
542 * are open, regardless of mode, this ends up DTRT.
543 */
544
545void
546g_spoil(struct g_provider *pp, struct g_consumer *cp)
547{
548	struct g_consumer *cp2;
549
550	g_topology_assert();
551
552	if (!strcmp(pp->name, "geom.ctl"))
553		return;
554	LIST_FOREACH(cp2, &pp->consumers, consumers) {
555		if (cp2 == cp)
556			continue;
557/*
558		KASSERT(cp2->acr == 0, ("spoiling cp->acr = %d", cp2->acr));
559		KASSERT(cp2->acw == 0, ("spoiling cp->acw = %d", cp2->acw));
560*/
561		KASSERT(cp2->ace == 0, ("spoiling cp->ace = %d", cp2->ace));
562		cp2->spoiled++;
563	}
564	g_post_event(EV_SPOILED, NULL, NULL, pp, cp);
565}
566
567static struct g_class *
568g_class_by_name(const char *name)
569{
570	struct g_class *mp;
571
572	g_trace(G_T_TOPOLOGY, "g_class_by_name(%s)", name);
573	g_topology_assert();
574	LIST_FOREACH(mp, &g_classes, class)
575		if (!strcmp(mp->name, name))
576			return (mp);
577	return (NULL);
578}
579
580struct g_geom *
581g_insert_geom(const char *class, struct g_consumer *cp)
582{
583	struct g_class *mp;
584	struct g_geom *gp;
585	struct g_provider *pp, *pp2;
586	struct g_consumer *cp2;
587	int error;
588
589	g_trace(G_T_TOPOLOGY, "g_insert_geomf(%s, %p)", class, cp);
590	g_topology_assert();
591	KASSERT(cp->provider != NULL, ("g_insert_geomf but not attached"));
592	/* XXX: check for events ?? */
593	mp = g_class_by_name(class);
594	if (mp == NULL)
595		return (NULL);
596	if (mp->config == NULL)
597		return (NULL);
598	pp = cp->provider;
599	gp = mp->taste(mp, pp, G_TF_TRANSPARENT);
600	if (gp == NULL)
601		return (NULL);
602	pp2 = LIST_FIRST(&gp->provider);
603	cp2 = LIST_FIRST(&gp->consumer);
604	cp2->acr += pp->acr;
605	cp2->acw += pp->acw;
606	cp2->ace += pp->ace;
607	pp2->acr += pp->acr;
608	pp2->acw += pp->acw;
609	pp2->ace += pp->ace;
610	LIST_REMOVE(cp, consumers);
611	LIST_INSERT_HEAD(&pp2->consumers, cp, consumers);
612	cp->provider = pp2;
613	error = redo_rank(gp);
614	KASSERT(error == 0, ("redo_rank failed in g_insert_geom"));
615	return (gp);
616}
617
618int
619g_getattr__(const char *attr, struct g_consumer *cp, void *var, int len)
620{
621	int error, i;
622
623	i = len;
624	error = g_io_getattr(attr, cp, &i, var);
625	if (error)
626		return (error);
627	if (i != len)
628		return (EINVAL);
629	return (0);
630}
631
632/*
633 * Check if the given pointer is a live object
634 */
635
636void
637g_sanity(void *ptr)
638{
639	struct g_class *mp;
640	struct g_geom *gp;
641	struct g_consumer *cp;
642	struct g_provider *pp;
643
644	if (!(g_debugflags & 0x8))
645		return;
646	LIST_FOREACH(mp, &g_classes, class) {
647		KASSERT(mp != ptr, ("Ptr is live class"));
648		KASSERT(mp->protect == 0x20016600,
649		    ("corrupt class %p %x", mp, mp->protect));
650		LIST_FOREACH(gp, &mp->geom, geom) {
651			KASSERT(gp != ptr, ("Ptr is live geom"));
652			KASSERT(gp->protect == 0x20016601,
653			    ("corrupt geom, %p %x", gp, gp->protect));
654			KASSERT(gp->name != ptr, ("Ptr is live geom's name"));
655			LIST_FOREACH(cp, &gp->consumer, consumer) {
656				KASSERT(cp != ptr, ("Ptr is live consumer"));
657				KASSERT(cp->protect == 0x20016602,
658				    ("corrupt consumer %p %x",
659				    cp, cp->protect));
660			}
661			LIST_FOREACH(pp, &gp->provider, provider) {
662				KASSERT(pp != ptr, ("Ptr is live provider"));
663				KASSERT(pp->protect == 0x20016603,
664				    ("corrupt provider %p %x",
665				    pp, pp->protect));
666			}
667		}
668	}
669}
670
671#ifdef _KERNEL
672struct g_class *
673g_idclass(struct geomidorname *p)
674{
675	struct g_class *mp;
676	char *n;
677
678	if (p->len == 0) {
679		LIST_FOREACH(mp, &g_classes, class)
680			if ((uintptr_t)mp == p->u.id)
681				return (mp);
682		return (NULL);
683	}
684	n = g_malloc(p->len + 1, 0);
685	if (copyin(p->u.name, n, p->len) == 0) {
686		n[p->len] = '\0';
687		LIST_FOREACH(mp, &g_classes, class)
688			if (!bcmp(n, mp->name, p->len + 1)) {
689				g_free(n);
690				return (mp);
691			}
692	}
693	g_free(n);
694	return (NULL);
695}
696
697struct g_geom *
698g_idgeom(struct geomidorname *p)
699{
700	struct g_class *mp;
701	struct g_geom *gp;
702	char *n;
703
704	if (p->len == 0) {
705		LIST_FOREACH(mp, &g_classes, class)
706			LIST_FOREACH(gp, &mp->geom, geom)
707				if ((uintptr_t)gp == p->u.id)
708					return (gp);
709		return (NULL);
710	}
711	n = g_malloc(p->len + 1, 0);
712	if (copyin(p->u.name, n, p->len) == 0) {
713		n[p->len] = '\0';
714		LIST_FOREACH(mp, &g_classes, class)
715			LIST_FOREACH(gp, &mp->geom, geom)
716				if (!bcmp(n, gp->name, p->len + 1)) {
717					g_free(n);
718					return (gp);
719				}
720	}
721	g_free(n);
722	return (NULL);
723}
724
725struct g_provider *
726g_idprovider(struct geomidorname *p)
727{
728	struct g_class *mp;
729	struct g_geom *gp;
730	struct g_provider *pp;
731	char *n;
732
733	if (p->len == 0) {
734		LIST_FOREACH(mp, &g_classes, class)
735			LIST_FOREACH(gp, &mp->geom, geom)
736				LIST_FOREACH(pp, &gp->provider, provider)
737					if ((uintptr_t)pp == p->u.id)
738						return (pp);
739		return (NULL);
740	}
741	n = g_malloc(p->len + 1, 0);
742	if (copyin(p->u.name, n, p->len) == 0) {
743		n[p->len] = '\0';
744		LIST_FOREACH(mp, &g_classes, class)
745			LIST_FOREACH(gp, &mp->geom, geom)
746				LIST_FOREACH(pp, &gp->provider, provider)
747					if (!bcmp(n, pp->name, p->len + 1)) {
748						g_free(n);
749						return (pp);
750					}
751	}
752	g_free(n);
753	return (NULL);
754}
755#endif /* _KERNEL */
756