FreeBSD/Linux Kernel Cross Reference
sys/geom/geom_subr.c
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: releng/8.4/sys/geom/geom_subr.c 240268 2012-09-09 08:30:22Z trociny $");
38
39 #include "opt_ddb.h"
40
41 #include <sys/param.h>
42 #include <sys/systm.h>
43 #include <sys/devicestat.h>
44 #include <sys/kernel.h>
45 #include <sys/malloc.h>
46 #include <sys/bio.h>
47 #include <sys/sysctl.h>
48 #include <sys/proc.h>
49 #include <sys/kthread.h>
50 #include <sys/lock.h>
51 #include <sys/mutex.h>
52 #include <sys/errno.h>
53 #include <sys/sbuf.h>
54 #include <geom/geom.h>
55 #include <geom/geom_int.h>
56 #include <machine/stdarg.h>
57
58 #ifdef DDB
59 #include <ddb/ddb.h>
60 #endif
61
62 #ifdef KDB
63 #include <sys/kdb.h>
64 #endif
65
66 struct class_list_head g_classes = LIST_HEAD_INITIALIZER(g_classes);
67 static struct g_tailq_head geoms = TAILQ_HEAD_INITIALIZER(geoms);
68 char *g_wait_event, *g_wait_up, *g_wait_down, *g_wait_sim;
69
70 struct g_hh00 {
71 struct g_class *mp;
72 int error;
73 int post;
74 };
75
76 /*
77 * This event offers a new class a chance to taste all preexisting providers.
78 */
79 static void
80 g_load_class(void *arg, int flag)
81 {
82 struct g_hh00 *hh;
83 struct g_class *mp2, *mp;
84 struct g_geom *gp;
85 struct g_provider *pp;
86
87 g_topology_assert();
88 if (flag == EV_CANCEL) /* XXX: can't happen ? */
89 return;
90 if (g_shutdown)
91 return;
92
93 hh = arg;
94 mp = hh->mp;
95 hh->error = 0;
96 if (hh->post) {
97 g_free(hh);
98 hh = NULL;
99 }
100 g_trace(G_T_TOPOLOGY, "g_load_class(%s)", mp->name);
101 KASSERT(mp->name != NULL && *mp->name != '\0',
102 ("GEOM class has no name"));
103 LIST_FOREACH(mp2, &g_classes, class) {
104 if (mp2 == mp) {
105 printf("The GEOM class %s is already loaded.\n",
106 mp2->name);
107 if (hh != NULL)
108 hh->error = EEXIST;
109 return;
110 } else if (strcmp(mp2->name, mp->name) == 0) {
111 printf("A GEOM class %s is already loaded.\n",
112 mp2->name);
113 if (hh != NULL)
114 hh->error = EEXIST;
115 return;
116 }
117 }
118
119 LIST_INIT(&mp->geom);
120 LIST_INSERT_HEAD(&g_classes, mp, class);
121 if (mp->init != NULL)
122 mp->init(mp);
123 if (mp->taste == NULL)
124 return;
125 LIST_FOREACH(mp2, &g_classes, class) {
126 if (mp == mp2)
127 continue;
128 LIST_FOREACH(gp, &mp2->geom, geom) {
129 LIST_FOREACH(pp, &gp->provider, provider) {
130 mp->taste(mp, pp, 0);
131 g_topology_assert();
132 }
133 }
134 }
135 }
136
137 static int
138 g_unload_class(struct g_class *mp)
139 {
140 struct g_geom *gp;
141 struct g_provider *pp;
142 struct g_consumer *cp;
143 int error;
144
145 g_topology_lock();
146 g_trace(G_T_TOPOLOGY, "g_unload_class(%s)", mp->name);
147 retry:
148 G_VALID_CLASS(mp);
149 LIST_FOREACH(gp, &mp->geom, geom) {
150 /* We refuse to unload if anything is open */
151 LIST_FOREACH(pp, &gp->provider, provider)
152 if (pp->acr || pp->acw || pp->ace) {
153 g_topology_unlock();
154 return (EBUSY);
155 }
156 LIST_FOREACH(cp, &gp->consumer, consumer)
157 if (cp->acr || cp->acw || cp->ace) {
158 g_topology_unlock();
159 return (EBUSY);
160 }
161 /* If the geom is withering, wait for it to finish. */
162 if (gp->flags & G_GEOM_WITHER) {
163 g_topology_sleep(mp, 1);
164 goto retry;
165 }
166 }
167
168 /*
169 * We allow unloading if we have no geoms, or a class
170 * method we can use to get rid of them.
171 */
172 if (!LIST_EMPTY(&mp->geom) && mp->destroy_geom == NULL) {
173 g_topology_unlock();
174 return (EOPNOTSUPP);
175 }
176
177 /* Bar new entries */
178 mp->taste = NULL;
179 mp->config = NULL;
180
181 LIST_FOREACH(gp, &mp->geom, geom) {
182 error = mp->destroy_geom(NULL, mp, gp);
183 if (error != 0) {
184 g_topology_unlock();
185 return (error);
186 }
187 }
188 /* Wait for withering to finish. */
189 for (;;) {
190 gp = LIST_FIRST(&mp->geom);
191 if (gp == NULL)
192 break;
193 KASSERT(gp->flags & G_GEOM_WITHER,
194 ("Non-withering geom in class %s", mp->name));
195 g_topology_sleep(mp, 1);
196 }
197 G_VALID_CLASS(mp);
198 if (mp->fini != NULL)
199 mp->fini(mp);
200 LIST_REMOVE(mp, class);
201 g_topology_unlock();
202
203 return (0);
204 }
205
206 int
207 g_modevent(module_t mod, int type, void *data)
208 {
209 struct g_hh00 *hh;
210 int error;
211 static int g_ignition;
212 struct g_class *mp;
213
214 mp = data;
215 if (mp->version != G_VERSION) {
216 printf("GEOM class %s has Wrong version %x\n",
217 mp->name, mp->version);
218 return (EINVAL);
219 }
220 if (!g_ignition) {
221 g_ignition++;
222 g_init();
223 }
224 error = EOPNOTSUPP;
225 switch (type) {
226 case MOD_LOAD:
227 g_trace(G_T_TOPOLOGY, "g_modevent(%s, LOAD)", mp->name);
228 hh = g_malloc(sizeof *hh, M_WAITOK | M_ZERO);
229 hh->mp = mp;
230 /*
231 * Once the system is not cold, MOD_LOAD calls will be
232 * from the userland and the g_event thread will be able
233 * to acknowledge their completion.
234 */
235 if (cold) {
236 hh->post = 1;
237 error = g_post_event(g_load_class, hh, M_WAITOK, NULL);
238 } else {
239 error = g_waitfor_event(g_load_class, hh, M_WAITOK,
240 NULL);
241 if (error == 0)
242 error = hh->error;
243 g_free(hh);
244 }
245 break;
246 case MOD_UNLOAD:
247 g_trace(G_T_TOPOLOGY, "g_modevent(%s, UNLOAD)", mp->name);
248 DROP_GIANT();
249 error = g_unload_class(mp);
250 PICKUP_GIANT();
251 if (error == 0) {
252 KASSERT(LIST_EMPTY(&mp->geom),
253 ("Unloaded class (%s) still has geom", mp->name));
254 }
255 break;
256 }
257 return (error);
258 }
259
260 static void
261 g_retaste_event(void *arg, int flag)
262 {
263 struct g_class *cp, *mp;
264 struct g_geom *gp, *gp2;
265 struct g_hh00 *hh;
266 struct g_provider *pp;
267
268 g_topology_assert();
269 if (flag == EV_CANCEL) /* XXX: can't happen ? */
270 return;
271 if (g_shutdown)
272 return;
273
274 hh = arg;
275 mp = hh->mp;
276 hh->error = 0;
277 if (hh->post) {
278 g_free(hh);
279 hh = NULL;
280 }
281 g_trace(G_T_TOPOLOGY, "g_retaste(%s)", mp->name);
282
283 LIST_FOREACH(cp, &g_classes, class) {
284 LIST_FOREACH(gp, &cp->geom, geom) {
285 LIST_FOREACH(pp, &gp->provider, provider) {
286 if (pp->acr || pp->acw || pp->ace)
287 continue;
288 LIST_FOREACH(gp2, &mp->geom, geom) {
289 if (!strcmp(pp->name, gp2->name))
290 break;
291 }
292 if (gp2 != NULL)
293 g_wither_geom(gp2, ENXIO);
294 mp->taste(mp, pp, 0);
295 g_topology_assert();
296 }
297 }
298 }
299 }
300
301 int
302 g_retaste(struct g_class *mp)
303 {
304 struct g_hh00 *hh;
305 int error;
306
307 if (mp->taste == NULL)
308 return (EINVAL);
309
310 hh = g_malloc(sizeof *hh, M_WAITOK | M_ZERO);
311 hh->mp = mp;
312
313 if (cold) {
314 hh->post = 1;
315 error = g_post_event(g_retaste_event, hh, M_WAITOK, NULL);
316 } else {
317 error = g_waitfor_event(g_retaste_event, hh, M_WAITOK, NULL);
318 if (error == 0)
319 error = hh->error;
320 g_free(hh);
321 }
322
323 return (error);
324 }
325
326 struct g_geom *
327 g_new_geomf(struct g_class *mp, const char *fmt, ...)
328 {
329 struct g_geom *gp;
330 va_list ap;
331 struct sbuf *sb;
332
333 g_topology_assert();
334 G_VALID_CLASS(mp);
335 sb = sbuf_new_auto();
336 va_start(ap, fmt);
337 sbuf_vprintf(sb, fmt, ap);
338 va_end(ap);
339 sbuf_finish(sb);
340 gp = g_malloc(sizeof *gp, M_WAITOK | M_ZERO);
341 gp->name = g_malloc(sbuf_len(sb) + 1, M_WAITOK | M_ZERO);
342 gp->class = mp;
343 gp->rank = 1;
344 LIST_INIT(&gp->consumer);
345 LIST_INIT(&gp->provider);
346 LIST_INSERT_HEAD(&mp->geom, gp, geom);
347 TAILQ_INSERT_HEAD(&geoms, gp, geoms);
348 strcpy(gp->name, sbuf_data(sb));
349 sbuf_delete(sb);
350 /* Fill in defaults from class */
351 gp->start = mp->start;
352 gp->spoiled = mp->spoiled;
353 gp->dumpconf = mp->dumpconf;
354 gp->access = mp->access;
355 gp->orphan = mp->orphan;
356 gp->ioctl = mp->ioctl;
357 return (gp);
358 }
359
360 void
361 g_destroy_geom(struct g_geom *gp)
362 {
363
364 g_topology_assert();
365 G_VALID_GEOM(gp);
366 g_trace(G_T_TOPOLOGY, "g_destroy_geom(%p(%s))", gp, gp->name);
367 KASSERT(LIST_EMPTY(&gp->consumer),
368 ("g_destroy_geom(%s) with consumer(s) [%p]",
369 gp->name, LIST_FIRST(&gp->consumer)));
370 KASSERT(LIST_EMPTY(&gp->provider),
371 ("g_destroy_geom(%s) with provider(s) [%p]",
372 gp->name, LIST_FIRST(&gp->provider)));
373 g_cancel_event(gp);
374 LIST_REMOVE(gp, geom);
375 TAILQ_REMOVE(&geoms, gp, geoms);
376 g_free(gp->name);
377 g_free(gp);
378 }
379
380 /*
381 * This function is called (repeatedly) until the geom has withered away.
382 */
383 void
384 g_wither_geom(struct g_geom *gp, int error)
385 {
386 struct g_provider *pp;
387
388 g_topology_assert();
389 G_VALID_GEOM(gp);
390 g_trace(G_T_TOPOLOGY, "g_wither_geom(%p(%s))", gp, gp->name);
391 if (!(gp->flags & G_GEOM_WITHER)) {
392 gp->flags |= G_GEOM_WITHER;
393 LIST_FOREACH(pp, &gp->provider, provider)
394 if (!(pp->flags & G_PF_ORPHAN))
395 g_orphan_provider(pp, error);
396 }
397 g_do_wither();
398 }
399
400 /*
401 * Convenience function to destroy a particular provider.
402 */
403 void
404 g_wither_provider(struct g_provider *pp, int error)
405 {
406
407 pp->flags |= G_PF_WITHER;
408 if (!(pp->flags & G_PF_ORPHAN))
409 g_orphan_provider(pp, error);
410 }
411
412 /*
413 * This function is called (repeatedly) until the has withered away.
414 */
415 void
416 g_wither_geom_close(struct g_geom *gp, int error)
417 {
418 struct g_consumer *cp;
419
420 g_topology_assert();
421 G_VALID_GEOM(gp);
422 g_trace(G_T_TOPOLOGY, "g_wither_geom_close(%p(%s))", gp, gp->name);
423 LIST_FOREACH(cp, &gp->consumer, consumer)
424 if (cp->acr || cp->acw || cp->ace)
425 g_access(cp, -cp->acr, -cp->acw, -cp->ace);
426 g_wither_geom(gp, error);
427 }
428
429 /*
430 * This function is called (repeatedly) until we cant wash away more
431 * withered bits at present. Return value contains two bits. Bit 0
432 * set means "withering stuff we can't wash now", bit 1 means "call
433 * me again, there may be stuff I didn't get the first time around.
434 */
435 int
436 g_wither_washer()
437 {
438 struct g_class *mp;
439 struct g_geom *gp, *gp2;
440 struct g_provider *pp, *pp2;
441 struct g_consumer *cp, *cp2;
442 int result;
443
444 result = 0;
445 g_topology_assert();
446 LIST_FOREACH(mp, &g_classes, class) {
447 LIST_FOREACH_SAFE(gp, &mp->geom, geom, gp2) {
448 LIST_FOREACH_SAFE(pp, &gp->provider, provider, pp2) {
449 if (!(pp->flags & G_PF_WITHER))
450 continue;
451 if (LIST_EMPTY(&pp->consumers))
452 g_destroy_provider(pp);
453 else
454 result |= 1;
455 }
456 if (!(gp->flags & G_GEOM_WITHER))
457 continue;
458 LIST_FOREACH_SAFE(pp, &gp->provider, provider, pp2) {
459 if (LIST_EMPTY(&pp->consumers))
460 g_destroy_provider(pp);
461 else
462 result |= 1;
463 }
464 LIST_FOREACH_SAFE(cp, &gp->consumer, consumer, cp2) {
465 if (cp->acr || cp->acw || cp->ace) {
466 result |= 1;
467 continue;
468 }
469 if (cp->provider != NULL)
470 g_detach(cp);
471 g_destroy_consumer(cp);
472 result |= 2;
473 }
474 if (LIST_EMPTY(&gp->provider) &&
475 LIST_EMPTY(&gp->consumer))
476 g_destroy_geom(gp);
477 else
478 result |= 1;
479 }
480 }
481 return (result);
482 }
483
484 struct g_consumer *
485 g_new_consumer(struct g_geom *gp)
486 {
487 struct g_consumer *cp;
488
489 g_topology_assert();
490 G_VALID_GEOM(gp);
491 KASSERT(!(gp->flags & G_GEOM_WITHER),
492 ("g_new_consumer on WITHERing geom(%s) (class %s)",
493 gp->name, gp->class->name));
494 KASSERT(gp->orphan != NULL,
495 ("g_new_consumer on geom(%s) (class %s) without orphan",
496 gp->name, gp->class->name));
497
498 cp = g_malloc(sizeof *cp, M_WAITOK | M_ZERO);
499 cp->geom = gp;
500 cp->stat = devstat_new_entry(cp, -1, 0, DEVSTAT_ALL_SUPPORTED,
501 DEVSTAT_TYPE_DIRECT, DEVSTAT_PRIORITY_MAX);
502 LIST_INSERT_HEAD(&gp->consumer, cp, consumer);
503 return(cp);
504 }
505
506 void
507 g_destroy_consumer(struct g_consumer *cp)
508 {
509 struct g_geom *gp;
510
511 g_topology_assert();
512 G_VALID_CONSUMER(cp);
513 g_trace(G_T_TOPOLOGY, "g_destroy_consumer(%p)", cp);
514 KASSERT (cp->provider == NULL, ("g_destroy_consumer but attached"));
515 KASSERT (cp->acr == 0, ("g_destroy_consumer with acr"));
516 KASSERT (cp->acw == 0, ("g_destroy_consumer with acw"));
517 KASSERT (cp->ace == 0, ("g_destroy_consumer with ace"));
518 g_cancel_event(cp);
519 gp = cp->geom;
520 LIST_REMOVE(cp, consumer);
521 devstat_remove_entry(cp->stat);
522 g_free(cp);
523 if (gp->flags & G_GEOM_WITHER)
524 g_do_wither();
525 }
526
527 static void
528 g_new_provider_event(void *arg, int flag)
529 {
530 struct g_class *mp;
531 struct g_provider *pp;
532 struct g_consumer *cp;
533
534 g_topology_assert();
535 if (flag == EV_CANCEL)
536 return;
537 if (g_shutdown)
538 return;
539 pp = arg;
540 G_VALID_PROVIDER(pp);
541 KASSERT(!(pp->flags & G_PF_WITHER),
542 ("g_new_provider_event but withered"));
543 LIST_FOREACH(mp, &g_classes, class) {
544 if (mp->taste == NULL)
545 continue;
546 LIST_FOREACH(cp, &pp->consumers, consumers)
547 if (cp->geom->class == mp)
548 break;
549 if (cp != NULL)
550 continue;
551 mp->taste(mp, pp, 0);
552 g_topology_assert();
553 }
554 }
555
556
557 struct g_provider *
558 g_new_providerf(struct g_geom *gp, const char *fmt, ...)
559 {
560 struct g_provider *pp;
561 struct sbuf *sb;
562 va_list ap;
563
564 g_topology_assert();
565 G_VALID_GEOM(gp);
566 KASSERT(gp->access != NULL,
567 ("new provider on geom(%s) without ->access (class %s)",
568 gp->name, gp->class->name));
569 KASSERT(gp->start != NULL,
570 ("new provider on geom(%s) without ->start (class %s)",
571 gp->name, gp->class->name));
572 KASSERT(!(gp->flags & G_GEOM_WITHER),
573 ("new provider on WITHERing geom(%s) (class %s)",
574 gp->name, gp->class->name));
575 sb = sbuf_new_auto();
576 va_start(ap, fmt);
577 sbuf_vprintf(sb, fmt, ap);
578 va_end(ap);
579 sbuf_finish(sb);
580 pp = g_malloc(sizeof *pp + sbuf_len(sb) + 1, M_WAITOK | M_ZERO);
581 pp->name = (char *)(pp + 1);
582 strcpy(pp->name, sbuf_data(sb));
583 sbuf_delete(sb);
584 LIST_INIT(&pp->consumers);
585 pp->error = ENXIO;
586 pp->geom = gp;
587 pp->stat = devstat_new_entry(pp, -1, 0, DEVSTAT_ALL_SUPPORTED,
588 DEVSTAT_TYPE_DIRECT, DEVSTAT_PRIORITY_MAX);
589 LIST_INSERT_HEAD(&gp->provider, pp, provider);
590 g_post_event(g_new_provider_event, pp, M_WAITOK, pp, gp, NULL);
591 return (pp);
592 }
593
594 void
595 g_error_provider(struct g_provider *pp, int error)
596 {
597
598 /* G_VALID_PROVIDER(pp); We may not have g_topology */
599 pp->error = error;
600 }
601
602 #ifndef _PATH_DEV
603 #define _PATH_DEV "/dev/"
604 #endif
605
606 struct g_provider *
607 g_provider_by_name(char const *arg)
608 {
609 struct g_class *cp;
610 struct g_geom *gp;
611 struct g_provider *pp;
612
613 if (strncmp(arg, _PATH_DEV, sizeof(_PATH_DEV) - 1) == 0)
614 arg += sizeof(_PATH_DEV) - 1;
615
616 LIST_FOREACH(cp, &g_classes, class) {
617 LIST_FOREACH(gp, &cp->geom, geom) {
618 LIST_FOREACH(pp, &gp->provider, provider) {
619 if (!strcmp(arg, pp->name))
620 return (pp);
621 }
622 }
623 }
624
625 return (NULL);
626 }
627
628 void
629 g_destroy_provider(struct g_provider *pp)
630 {
631 struct g_geom *gp;
632
633 g_topology_assert();
634 G_VALID_PROVIDER(pp);
635 KASSERT(LIST_EMPTY(&pp->consumers),
636 ("g_destroy_provider but attached"));
637 KASSERT (pp->acr == 0, ("g_destroy_provider with acr"));
638 KASSERT (pp->acw == 0, ("g_destroy_provider with acw"));
639 KASSERT (pp->ace == 0, ("g_destroy_provider with ace"));
640 g_cancel_event(pp);
641 LIST_REMOVE(pp, provider);
642 gp = pp->geom;
643 devstat_remove_entry(pp->stat);
644 g_free(pp);
645 if ((gp->flags & G_GEOM_WITHER))
646 g_do_wither();
647 }
648
649 /*
650 * We keep the "geoms" list sorted by topological order (== increasing
651 * numerical rank) at all times.
652 * When an attach is done, the attaching geoms rank is invalidated
653 * and it is moved to the tail of the list.
654 * All geoms later in the sequence has their ranks reevaluated in
655 * sequence. If we cannot assign rank to a geom because it's
656 * prerequisites do not have rank, we move that element to the tail
657 * of the sequence with invalid rank as well.
658 * At some point we encounter our original geom and if we stil fail
659 * to assign it a rank, there must be a loop and we fail back to
660 * g_attach() which detach again and calls redo_rank again
661 * to fix up the damage.
662 * It would be much simpler code wise to do it recursively, but we
663 * can't risk that on the kernel stack.
664 */
665
666 static int
667 redo_rank(struct g_geom *gp)
668 {
669 struct g_consumer *cp;
670 struct g_geom *gp1, *gp2;
671 int n, m;
672
673 g_topology_assert();
674 G_VALID_GEOM(gp);
675
676 /* Invalidate this geoms rank and move it to the tail */
677 gp1 = TAILQ_NEXT(gp, geoms);
678 if (gp1 != NULL) {
679 gp->rank = 0;
680 TAILQ_REMOVE(&geoms, gp, geoms);
681 TAILQ_INSERT_TAIL(&geoms, gp, geoms);
682 } else {
683 gp1 = gp;
684 }
685
686 /* re-rank the rest of the sequence */
687 for (; gp1 != NULL; gp1 = gp2) {
688 gp1->rank = 0;
689 m = 1;
690 LIST_FOREACH(cp, &gp1->consumer, consumer) {
691 if (cp->provider == NULL)
692 continue;
693 n = cp->provider->geom->rank;
694 if (n == 0) {
695 m = 0;
696 break;
697 } else if (n >= m)
698 m = n + 1;
699 }
700 gp1->rank = m;
701 gp2 = TAILQ_NEXT(gp1, geoms);
702
703 /* got a rank, moving on */
704 if (m != 0)
705 continue;
706
707 /* no rank to original geom means loop */
708 if (gp == gp1)
709 return (ELOOP);
710
711 /* no rank, put it at the end move on */
712 TAILQ_REMOVE(&geoms, gp1, geoms);
713 TAILQ_INSERT_TAIL(&geoms, gp1, geoms);
714 }
715 return (0);
716 }
717
718 int
719 g_attach(struct g_consumer *cp, struct g_provider *pp)
720 {
721 int error;
722
723 g_topology_assert();
724 G_VALID_CONSUMER(cp);
725 G_VALID_PROVIDER(pp);
726 KASSERT(cp->provider == NULL, ("attach but attached"));
727 cp->provider = pp;
728 LIST_INSERT_HEAD(&pp->consumers, cp, consumers);
729 error = redo_rank(cp->geom);
730 if (error) {
731 LIST_REMOVE(cp, consumers);
732 cp->provider = NULL;
733 redo_rank(cp->geom);
734 }
735 return (error);
736 }
737
738 void
739 g_detach(struct g_consumer *cp)
740 {
741 struct g_provider *pp;
742
743 g_topology_assert();
744 G_VALID_CONSUMER(cp);
745 g_trace(G_T_TOPOLOGY, "g_detach(%p)", cp);
746 KASSERT(cp->provider != NULL, ("detach but not attached"));
747 KASSERT(cp->acr == 0, ("detach but nonzero acr"));
748 KASSERT(cp->acw == 0, ("detach but nonzero acw"));
749 KASSERT(cp->ace == 0, ("detach but nonzero ace"));
750 KASSERT(cp->nstart == cp->nend,
751 ("detach with active requests"));
752 pp = cp->provider;
753 LIST_REMOVE(cp, consumers);
754 cp->provider = NULL;
755 if (pp->geom->flags & G_GEOM_WITHER)
756 g_do_wither();
757 else if (pp->flags & G_PF_WITHER)
758 g_do_wither();
759 redo_rank(cp->geom);
760 }
761
762 /*
763 * g_access()
764 *
765 * Access-check with delta values. The question asked is "can provider
766 * "cp" change the access counters by the relative amounts dc[rwe] ?"
767 */
768
769 int
770 g_access(struct g_consumer *cp, int dcr, int dcw, int dce)
771 {
772 struct g_provider *pp;
773 int pr,pw,pe;
774 int error;
775
776 g_topology_assert();
777 G_VALID_CONSUMER(cp);
778 pp = cp->provider;
779 KASSERT(pp != NULL, ("access but not attached"));
780 G_VALID_PROVIDER(pp);
781
782 g_trace(G_T_ACCESS, "g_access(%p(%s), %d, %d, %d)",
783 cp, pp->name, dcr, dcw, dce);
784
785 KASSERT(cp->acr + dcr >= 0, ("access resulting in negative acr"));
786 KASSERT(cp->acw + dcw >= 0, ("access resulting in negative acw"));
787 KASSERT(cp->ace + dce >= 0, ("access resulting in negative ace"));
788 KASSERT(dcr != 0 || dcw != 0 || dce != 0, ("NOP access request"));
789 KASSERT(pp->geom->access != NULL, ("NULL geom->access"));
790
791 /*
792 * If our class cares about being spoiled, and we have been, we
793 * are probably just ahead of the event telling us that. Fail
794 * now rather than having to unravel this later.
795 */
796 if (cp->geom->spoiled != NULL && cp->spoiled &&
797 (dcr > 0 || dcw > 0 || dce > 0))
798 return (ENXIO);
799
800 /*
801 * Figure out what counts the provider would have had, if this
802 * consumer had (r0w0e0) at this time.
803 */
804 pr = pp->acr - cp->acr;
805 pw = pp->acw - cp->acw;
806 pe = pp->ace - cp->ace;
807
808 g_trace(G_T_ACCESS,
809 "open delta:[r%dw%de%d] old:[r%dw%de%d] provider:[r%dw%de%d] %p(%s)",
810 dcr, dcw, dce,
811 cp->acr, cp->acw, cp->ace,
812 pp->acr, pp->acw, pp->ace,
813 pp, pp->name);
814
815 /* If foot-shooting is enabled, any open on rank#1 is OK */
816 if ((g_debugflags & 16) && pp->geom->rank == 1)
817 ;
818 /* If we try exclusive but already write: fail */
819 else if (dce > 0 && pw > 0)
820 return (EPERM);
821 /* If we try write but already exclusive: fail */
822 else if (dcw > 0 && pe > 0)
823 return (EPERM);
824 /* If we try to open more but provider is error'ed: fail */
825 else if ((dcr > 0 || dcw > 0 || dce > 0) && pp->error != 0)
826 return (pp->error);
827
828 /* Ok then... */
829
830 error = pp->geom->access(pp, dcr, dcw, dce);
831 KASSERT(dcr > 0 || dcw > 0 || dce > 0 || error == 0,
832 ("Geom provider %s::%s failed closing ->access()",
833 pp->geom->class->name, pp->name));
834 if (!error) {
835 /*
836 * If we open first write, spoil any partner consumers.
837 * If we close last write and provider is not errored,
838 * trigger re-taste.
839 */
840 if (pp->acw == 0 && dcw != 0)
841 g_spoil(pp, cp);
842 else if (pp->acw != 0 && pp->acw == -dcw && pp->error == 0 &&
843 !(pp->geom->flags & G_GEOM_WITHER))
844 g_post_event(g_new_provider_event, pp, M_WAITOK,
845 pp, NULL);
846
847 pp->acr += dcr;
848 pp->acw += dcw;
849 pp->ace += dce;
850 cp->acr += dcr;
851 cp->acw += dcw;
852 cp->ace += dce;
853 if (pp->acr != 0 || pp->acw != 0 || pp->ace != 0)
854 KASSERT(pp->sectorsize > 0,
855 ("Provider %s lacks sectorsize", pp->name));
856 }
857 return (error);
858 }
859
860 int
861 g_handleattr_int(struct bio *bp, const char *attribute, int val)
862 {
863
864 return (g_handleattr(bp, attribute, &val, sizeof val));
865 }
866
867 int
868 g_handleattr_off_t(struct bio *bp, const char *attribute, off_t val)
869 {
870
871 return (g_handleattr(bp, attribute, &val, sizeof val));
872 }
873
874 int
875 g_handleattr_str(struct bio *bp, const char *attribute, const char *str)
876 {
877
878 return (g_handleattr(bp, attribute, str, 0));
879 }
880
881 int
882 g_handleattr(struct bio *bp, const char *attribute, const void *val, int len)
883 {
884 int error = 0;
885
886 if (strcmp(bp->bio_attribute, attribute))
887 return (0);
888 if (len == 0) {
889 bzero(bp->bio_data, bp->bio_length);
890 if (strlcpy(bp->bio_data, val, bp->bio_length) >=
891 bp->bio_length) {
892 printf("%s: %s bio_length %jd len %zu -> EFAULT\n",
893 __func__, bp->bio_to->name,
894 (intmax_t)bp->bio_length, strlen(val));
895 error = EFAULT;
896 }
897 } else if (bp->bio_length == len) {
898 bcopy(val, bp->bio_data, len);
899 } else {
900 printf("%s: %s bio_length %jd len %d -> EFAULT\n", __func__,
901 bp->bio_to->name, (intmax_t)bp->bio_length, len);
902 error = EFAULT;
903 }
904 if (error == 0)
905 bp->bio_completed = bp->bio_length;
906 g_io_deliver(bp, error);
907 return (1);
908 }
909
910 int
911 g_std_access(struct g_provider *pp,
912 int dr __unused, int dw __unused, int de __unused)
913 {
914
915 g_topology_assert();
916 G_VALID_PROVIDER(pp);
917 return (0);
918 }
919
920 void
921 g_std_done(struct bio *bp)
922 {
923 struct bio *bp2;
924
925 bp2 = bp->bio_parent;
926 if (bp2->bio_error == 0)
927 bp2->bio_error = bp->bio_error;
928 bp2->bio_completed += bp->bio_completed;
929 g_destroy_bio(bp);
930 bp2->bio_inbed++;
931 if (bp2->bio_children == bp2->bio_inbed)
932 g_io_deliver(bp2, bp2->bio_error);
933 }
934
935 /* XXX: maybe this is only g_slice_spoiled */
936
937 void
938 g_std_spoiled(struct g_consumer *cp)
939 {
940 struct g_geom *gp;
941 struct g_provider *pp;
942
943 g_topology_assert();
944 G_VALID_CONSUMER(cp);
945 g_trace(G_T_TOPOLOGY, "g_std_spoiled(%p)", cp);
946 g_detach(cp);
947 gp = cp->geom;
948 LIST_FOREACH(pp, &gp->provider, provider)
949 g_orphan_provider(pp, ENXIO);
950 g_destroy_consumer(cp);
951 if (LIST_EMPTY(&gp->provider) && LIST_EMPTY(&gp->consumer))
952 g_destroy_geom(gp);
953 else
954 gp->flags |= G_GEOM_WITHER;
955 }
956
957 /*
958 * Spoiling happens when a provider is opened for writing, but consumers
959 * which are configured by in-band data are attached (slicers for instance).
960 * Since the write might potentially change the in-band data, such consumers
961 * need to re-evaluate their existence after the writing session closes.
962 * We do this by (offering to) tear them down when the open for write happens
963 * in return for a re-taste when it closes again.
964 * Together with the fact that such consumers grab an 'e' bit whenever they
965 * are open, regardless of mode, this ends up DTRT.
966 */
967
968 static void
969 g_spoil_event(void *arg, int flag)
970 {
971 struct g_provider *pp;
972 struct g_consumer *cp, *cp2;
973
974 g_topology_assert();
975 if (flag == EV_CANCEL)
976 return;
977 pp = arg;
978 G_VALID_PROVIDER(pp);
979 for (cp = LIST_FIRST(&pp->consumers); cp != NULL; cp = cp2) {
980 cp2 = LIST_NEXT(cp, consumers);
981 if (!cp->spoiled)
982 continue;
983 cp->spoiled = 0;
984 if (cp->geom->spoiled == NULL)
985 continue;
986 cp->geom->spoiled(cp);
987 g_topology_assert();
988 }
989 }
990
991 void
992 g_spoil(struct g_provider *pp, struct g_consumer *cp)
993 {
994 struct g_consumer *cp2;
995
996 g_topology_assert();
997 G_VALID_PROVIDER(pp);
998 G_VALID_CONSUMER(cp);
999
1000 LIST_FOREACH(cp2, &pp->consumers, consumers) {
1001 if (cp2 == cp)
1002 continue;
1003 /*
1004 KASSERT(cp2->acr == 0, ("spoiling cp->acr = %d", cp2->acr));
1005 KASSERT(cp2->acw == 0, ("spoiling cp->acw = %d", cp2->acw));
1006 */
1007 KASSERT(cp2->ace == 0, ("spoiling cp->ace = %d", cp2->ace));
1008 cp2->spoiled++;
1009 }
1010 g_post_event(g_spoil_event, pp, M_WAITOK, pp, NULL);
1011 }
1012
1013 int
1014 g_getattr__(const char *attr, struct g_consumer *cp, void *var, int len)
1015 {
1016 int error, i;
1017
1018 i = len;
1019 error = g_io_getattr(attr, cp, &i, var);
1020 if (error)
1021 return (error);
1022 if (i != len)
1023 return (EINVAL);
1024 return (0);
1025 }
1026
1027 static int
1028 g_get_device_prefix_len(const char *name)
1029 {
1030 int len;
1031
1032 if (strncmp(name, "ada", 3) == 0)
1033 len = 3;
1034 else if (strncmp(name, "ad", 2) == 0)
1035 len = 2;
1036 else
1037 return (0);
1038 if (name[len] < '' || name[len] > '9')
1039 return (0);
1040 do {
1041 len++;
1042 } while (name[len] >= '' && name[len] <= '9');
1043 return (len);
1044 }
1045
1046 int
1047 g_compare_names(const char *namea, const char *nameb)
1048 {
1049 int deva, devb;
1050
1051 if (strcmp(namea, nameb) == 0)
1052 return (1);
1053 deva = g_get_device_prefix_len(namea);
1054 if (deva == 0)
1055 return (0);
1056 devb = g_get_device_prefix_len(nameb);
1057 if (devb == 0)
1058 return (0);
1059 if (strcmp(namea + deva, nameb + devb) == 0)
1060 return (1);
1061 return (0);
1062 }
1063
1064 #if defined(DIAGNOSTIC) || defined(DDB)
1065 /*
1066 * This function walks the mesh and returns a non-zero integer if it
1067 * finds the argument pointer is an object. The return value indicates
1068 * which type of object it is believed to be. If topology is not locked,
1069 * this function is potentially dangerous, but we don't assert that the
1070 * topology lock is held when called from debugger.
1071 */
1072 int
1073 g_valid_obj(void const *ptr)
1074 {
1075 struct g_class *mp;
1076 struct g_geom *gp;
1077 struct g_consumer *cp;
1078 struct g_provider *pp;
1079
1080 #ifdef KDB
1081 if (kdb_active == 0)
1082 #endif
1083 g_topology_assert();
1084
1085 LIST_FOREACH(mp, &g_classes, class) {
1086 if (ptr == mp)
1087 return (1);
1088 LIST_FOREACH(gp, &mp->geom, geom) {
1089 if (ptr == gp)
1090 return (2);
1091 LIST_FOREACH(cp, &gp->consumer, consumer)
1092 if (ptr == cp)
1093 return (3);
1094 LIST_FOREACH(pp, &gp->provider, provider)
1095 if (ptr == pp)
1096 return (4);
1097 }
1098 }
1099 return(0);
1100 }
1101 #endif
1102
1103 #ifdef DDB
1104
1105 #define gprintf(...) do { \
1106 db_printf("%*s", indent, ""); \
1107 db_printf(__VA_ARGS__); \
1108 } while (0)
1109 #define gprintln(...) do { \
1110 gprintf(__VA_ARGS__); \
1111 db_printf("\n"); \
1112 } while (0)
1113
1114 #define ADDFLAG(obj, flag, sflag) do { \
1115 if ((obj)->flags & (flag)) { \
1116 if (comma) \
1117 strlcat(str, ",", size); \
1118 strlcat(str, (sflag), size); \
1119 comma = 1; \
1120 } \
1121 } while (0)
1122
1123 static char *
1124 provider_flags_to_string(struct g_provider *pp, char *str, size_t size)
1125 {
1126 int comma = 0;
1127
1128 bzero(str, size);
1129 if (pp->flags == 0) {
1130 strlcpy(str, "NONE", size);
1131 return (str);
1132 }
1133 ADDFLAG(pp, G_PF_CANDELETE, "G_PF_CANDELETE");
1134 ADDFLAG(pp, G_PF_WITHER, "G_PF_WITHER");
1135 ADDFLAG(pp, G_PF_ORPHAN, "G_PF_ORPHAN");
1136 return (str);
1137 }
1138
1139 static char *
1140 geom_flags_to_string(struct g_geom *gp, char *str, size_t size)
1141 {
1142 int comma = 0;
1143
1144 bzero(str, size);
1145 if (gp->flags == 0) {
1146 strlcpy(str, "NONE", size);
1147 return (str);
1148 }
1149 ADDFLAG(gp, G_GEOM_WITHER, "G_GEOM_WITHER");
1150 return (str);
1151 }
1152 static void
1153 db_show_geom_consumer(int indent, struct g_consumer *cp)
1154 {
1155
1156 if (indent == 0) {
1157 gprintln("consumer: %p", cp);
1158 gprintln(" class: %s (%p)", cp->geom->class->name,
1159 cp->geom->class);
1160 gprintln(" geom: %s (%p)", cp->geom->name, cp->geom);
1161 if (cp->provider == NULL)
1162 gprintln(" provider: none");
1163 else {
1164 gprintln(" provider: %s (%p)", cp->provider->name,
1165 cp->provider);
1166 }
1167 gprintln(" access: r%dw%de%d", cp->acr, cp->acw, cp->ace);
1168 gprintln(" spoiled: %d", cp->spoiled);
1169 gprintln(" nstart: %u", cp->nstart);
1170 gprintln(" nend: %u", cp->nend);
1171 } else {
1172 gprintf("consumer: %p (%s), access=r%dw%de%d", cp,
1173 cp->provider != NULL ? cp->provider->name : "none",
1174 cp->acr, cp->acw, cp->ace);
1175 if (cp->spoiled)
1176 db_printf(", spoiled=%d", cp->spoiled);
1177 db_printf("\n");
1178 }
1179 }
1180
1181 static void
1182 db_show_geom_provider(int indent, struct g_provider *pp)
1183 {
1184 struct g_consumer *cp;
1185 char flags[64];
1186
1187 if (indent == 0) {
1188 gprintln("provider: %s (%p)", pp->name, pp);
1189 gprintln(" class: %s (%p)", pp->geom->class->name,
1190 pp->geom->class);
1191 gprintln(" geom: %s (%p)", pp->geom->name, pp->geom);
1192 gprintln(" mediasize: %jd", (intmax_t)pp->mediasize);
1193 gprintln(" sectorsize: %u", pp->sectorsize);
1194 gprintln(" stripesize: %u", pp->stripesize);
1195 gprintln(" stripeoffset: %u", pp->stripeoffset);
1196 gprintln(" access: r%dw%de%d", pp->acr, pp->acw,
1197 pp->ace);
1198 gprintln(" flags: %s (0x%04x)",
1199 provider_flags_to_string(pp, flags, sizeof(flags)),
1200 pp->flags);
1201 gprintln(" error: %d", pp->error);
1202 gprintln(" nstart: %u", pp->nstart);
1203 gprintln(" nend: %u", pp->nend);
1204 if (LIST_EMPTY(&pp->consumers))
1205 gprintln(" consumers: none");
1206 } else {
1207 gprintf("provider: %s (%p), access=r%dw%de%d",
1208 pp->name, pp, pp->acr, pp->acw, pp->ace);
1209 if (pp->flags != 0) {
1210 db_printf(", flags=%s (0x%04x)",
1211 provider_flags_to_string(pp, flags, sizeof(flags)),
1212 pp->flags);
1213 }
1214 db_printf("\n");
1215 }
1216 if (!LIST_EMPTY(&pp->consumers)) {
1217 LIST_FOREACH(cp, &pp->consumers, consumers) {
1218 db_show_geom_consumer(indent + 2, cp);
1219 if (db_pager_quit)
1220 break;
1221 }
1222 }
1223 }
1224
1225 static void
1226 db_show_geom_geom(int indent, struct g_geom *gp)
1227 {
1228 struct g_provider *pp;
1229 struct g_consumer *cp;
1230 char flags[64];
1231
1232 if (indent == 0) {
1233 gprintln("geom: %s (%p)", gp->name, gp);
1234 gprintln(" class: %s (%p)", gp->class->name, gp->class);
1235 gprintln(" flags: %s (0x%04x)",
1236 geom_flags_to_string(gp, flags, sizeof(flags)), gp->flags);
1237 gprintln(" rank: %d", gp->rank);
1238 if (LIST_EMPTY(&gp->provider))
1239 gprintln(" providers: none");
1240 if (LIST_EMPTY(&gp->consumer))
1241 gprintln(" consumers: none");
1242 } else {
1243 gprintf("geom: %s (%p), rank=%d", gp->name, gp, gp->rank);
1244 if (gp->flags != 0) {
1245 db_printf(", flags=%s (0x%04x)",
1246 geom_flags_to_string(gp, flags, sizeof(flags)),
1247 gp->flags);
1248 }
1249 db_printf("\n");
1250 }
1251 if (!LIST_EMPTY(&gp->provider)) {
1252 LIST_FOREACH(pp, &gp->provider, provider) {
1253 db_show_geom_provider(indent + 2, pp);
1254 if (db_pager_quit)
1255 break;
1256 }
1257 }
1258 if (!LIST_EMPTY(&gp->consumer)) {
1259 LIST_FOREACH(cp, &gp->consumer, consumer) {
1260 db_show_geom_consumer(indent + 2, cp);
1261 if (db_pager_quit)
1262 break;
1263 }
1264 }
1265 }
1266
1267 static void
1268 db_show_geom_class(struct g_class *mp)
1269 {
1270 struct g_geom *gp;
1271
1272 db_printf("class: %s (%p)\n", mp->name, mp);
1273 LIST_FOREACH(gp, &mp->geom, geom) {
1274 db_show_geom_geom(2, gp);
1275 if (db_pager_quit)
1276 break;
1277 }
1278 }
1279
1280 /*
1281 * Print the GEOM topology or the given object.
1282 */
1283 DB_SHOW_COMMAND(geom, db_show_geom)
1284 {
1285 struct g_class *mp;
1286
1287 if (!have_addr) {
1288 /* No address given, print the entire topology. */
1289 LIST_FOREACH(mp, &g_classes, class) {
1290 db_show_geom_class(mp);
1291 db_printf("\n");
1292 if (db_pager_quit)
1293 break;
1294 }
1295 } else {
1296 switch (g_valid_obj((void *)addr)) {
1297 case 1:
1298 db_show_geom_class((struct g_class *)addr);
1299 break;
1300 case 2:
1301 db_show_geom_geom(0, (struct g_geom *)addr);
1302 break;
1303 case 3:
1304 db_show_geom_consumer(0, (struct g_consumer *)addr);
1305 break;
1306 case 4:
1307 db_show_geom_provider(0, (struct g_provider *)addr);
1308 break;
1309 default:
1310 db_printf("Not a GEOM object.\n");
1311 break;
1312 }
1313 }
1314 }
1315
1316 static void
1317 db_print_bio_cmd(struct bio *bp)
1318 {
1319 db_printf(" cmd: ");
1320 switch (bp->bio_cmd) {
1321 case BIO_READ: db_printf("BIO_READ"); break;
1322 case BIO_WRITE: db_printf("BIO_WRITE"); break;
1323 case BIO_DELETE: db_printf("BIO_DELETE"); break;
1324 case BIO_GETATTR: db_printf("BIO_GETATTR"); break;
1325 case BIO_FLUSH: db_printf("BIO_FLUSH"); break;
1326 case BIO_CMD0: db_printf("BIO_CMD0"); break;
1327 case BIO_CMD1: db_printf("BIO_CMD1"); break;
1328 case BIO_CMD2: db_printf("BIO_CMD2"); break;
1329 default: db_printf("UNKNOWN"); break;
1330 }
1331 db_printf("\n");
1332 }
1333
1334 static void
1335 db_print_bio_flags(struct bio *bp)
1336 {
1337 int comma;
1338
1339 comma = 0;
1340 db_printf(" flags: ");
1341 if (bp->bio_flags & BIO_ERROR) {
1342 db_printf("BIO_ERROR");
1343 comma = 1;
1344 }
1345 if (bp->bio_flags & BIO_DONE) {
1346 db_printf("%sBIO_DONE", (comma ? ", " : ""));
1347 comma = 1;
1348 }
1349 if (bp->bio_flags & BIO_ONQUEUE)
1350 db_printf("%sBIO_ONQUEUE", (comma ? ", " : ""));
1351 db_printf("\n");
1352 }
1353
1354 /*
1355 * Print useful information in a BIO
1356 */
1357 DB_SHOW_COMMAND(bio, db_show_bio)
1358 {
1359 struct bio *bp;
1360
1361 if (have_addr) {
1362 bp = (struct bio *)addr;
1363 db_printf("BIO %p\n", bp);
1364 db_print_bio_cmd(bp);
1365 db_print_bio_flags(bp);
1366 db_printf(" cflags: 0x%hhx\n", bp->bio_cflags);
1367 db_printf(" pflags: 0x%hhx\n", bp->bio_pflags);
1368 db_printf(" offset: %jd\n", (intmax_t)bp->bio_offset);
1369 db_printf(" length: %jd\n", (intmax_t)bp->bio_length);
1370 db_printf(" bcount: %ld\n", bp->bio_bcount);
1371 db_printf(" resid: %ld\n", bp->bio_resid);
1372 db_printf(" completed: %jd\n", (intmax_t)bp->bio_completed);
1373 db_printf(" children: %u\n", bp->bio_children);
1374 db_printf(" inbed: %u\n", bp->bio_inbed);
1375 db_printf(" error: %d\n", bp->bio_error);
1376 db_printf(" parent: %p\n", bp->bio_parent);
1377 db_printf(" driver1: %p\n", bp->bio_driver1);
1378 db_printf(" driver2: %p\n", bp->bio_driver2);
1379 db_printf(" caller1: %p\n", bp->bio_caller1);
1380 db_printf(" caller2: %p\n", bp->bio_caller2);
1381 db_printf(" bio_from: %p\n", bp->bio_from);
1382 db_printf(" bio_to: %p\n", bp->bio_to);
1383 }
1384 }
1385
1386 #undef gprintf
1387 #undef gprintln
1388 #undef ADDFLAG
1389
1390 #endif /* DDB */
Cache object: 26a82c16058f3c3f97830a3a3cd5eb0f
|