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/9.1/sys/geom/geom_subr.c 237873 2012-07-01 05:13:50Z ken $");
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->attrchanged = mp->attrchanged;
354 gp->providergone = mp->providergone;
355 gp->dumpconf = mp->dumpconf;
356 gp->access = mp->access;
357 gp->orphan = mp->orphan;
358 gp->ioctl = mp->ioctl;
359 return (gp);
360 }
361
362 void
363 g_destroy_geom(struct g_geom *gp)
364 {
365
366 g_topology_assert();
367 G_VALID_GEOM(gp);
368 g_trace(G_T_TOPOLOGY, "g_destroy_geom(%p(%s))", gp, gp->name);
369 KASSERT(LIST_EMPTY(&gp->consumer),
370 ("g_destroy_geom(%s) with consumer(s) [%p]",
371 gp->name, LIST_FIRST(&gp->consumer)));
372 KASSERT(LIST_EMPTY(&gp->provider),
373 ("g_destroy_geom(%s) with provider(s) [%p]",
374 gp->name, LIST_FIRST(&gp->provider)));
375 g_cancel_event(gp);
376 LIST_REMOVE(gp, geom);
377 TAILQ_REMOVE(&geoms, gp, geoms);
378 g_free(gp->name);
379 g_free(gp);
380 }
381
382 /*
383 * This function is called (repeatedly) until the geom has withered away.
384 */
385 void
386 g_wither_geom(struct g_geom *gp, int error)
387 {
388 struct g_provider *pp;
389
390 g_topology_assert();
391 G_VALID_GEOM(gp);
392 g_trace(G_T_TOPOLOGY, "g_wither_geom(%p(%s))", gp, gp->name);
393 if (!(gp->flags & G_GEOM_WITHER)) {
394 gp->flags |= G_GEOM_WITHER;
395 LIST_FOREACH(pp, &gp->provider, provider)
396 if (!(pp->flags & G_PF_ORPHAN))
397 g_orphan_provider(pp, error);
398 }
399 g_do_wither();
400 }
401
402 /*
403 * Convenience function to destroy a particular provider.
404 */
405 void
406 g_wither_provider(struct g_provider *pp, int error)
407 {
408
409 pp->flags |= G_PF_WITHER;
410 if (!(pp->flags & G_PF_ORPHAN))
411 g_orphan_provider(pp, error);
412 }
413
414 /*
415 * This function is called (repeatedly) until the has withered away.
416 */
417 void
418 g_wither_geom_close(struct g_geom *gp, int error)
419 {
420 struct g_consumer *cp;
421
422 g_topology_assert();
423 G_VALID_GEOM(gp);
424 g_trace(G_T_TOPOLOGY, "g_wither_geom_close(%p(%s))", gp, gp->name);
425 LIST_FOREACH(cp, &gp->consumer, consumer)
426 if (cp->acr || cp->acw || cp->ace)
427 g_access(cp, -cp->acr, -cp->acw, -cp->ace);
428 g_wither_geom(gp, error);
429 }
430
431 /*
432 * This function is called (repeatedly) until we cant wash away more
433 * withered bits at present. Return value contains two bits. Bit 0
434 * set means "withering stuff we can't wash now", bit 1 means "call
435 * me again, there may be stuff I didn't get the first time around.
436 */
437 int
438 g_wither_washer()
439 {
440 struct g_class *mp;
441 struct g_geom *gp, *gp2;
442 struct g_provider *pp, *pp2;
443 struct g_consumer *cp, *cp2;
444 int result;
445
446 result = 0;
447 g_topology_assert();
448 LIST_FOREACH(mp, &g_classes, class) {
449 LIST_FOREACH_SAFE(gp, &mp->geom, geom, gp2) {
450 LIST_FOREACH_SAFE(pp, &gp->provider, provider, pp2) {
451 if (!(pp->flags & G_PF_WITHER))
452 continue;
453 if (LIST_EMPTY(&pp->consumers))
454 g_destroy_provider(pp);
455 else
456 result |= 1;
457 }
458 if (!(gp->flags & G_GEOM_WITHER))
459 continue;
460 LIST_FOREACH_SAFE(pp, &gp->provider, provider, pp2) {
461 if (LIST_EMPTY(&pp->consumers))
462 g_destroy_provider(pp);
463 else
464 result |= 1;
465 }
466 LIST_FOREACH_SAFE(cp, &gp->consumer, consumer, cp2) {
467 if (cp->acr || cp->acw || cp->ace) {
468 result |= 1;
469 continue;
470 }
471 if (cp->provider != NULL)
472 g_detach(cp);
473 g_destroy_consumer(cp);
474 result |= 2;
475 }
476 if (LIST_EMPTY(&gp->provider) &&
477 LIST_EMPTY(&gp->consumer))
478 g_destroy_geom(gp);
479 else
480 result |= 1;
481 }
482 }
483 return (result);
484 }
485
486 struct g_consumer *
487 g_new_consumer(struct g_geom *gp)
488 {
489 struct g_consumer *cp;
490
491 g_topology_assert();
492 G_VALID_GEOM(gp);
493 KASSERT(!(gp->flags & G_GEOM_WITHER),
494 ("g_new_consumer on WITHERing geom(%s) (class %s)",
495 gp->name, gp->class->name));
496 KASSERT(gp->orphan != NULL,
497 ("g_new_consumer on geom(%s) (class %s) without orphan",
498 gp->name, gp->class->name));
499
500 cp = g_malloc(sizeof *cp, M_WAITOK | M_ZERO);
501 cp->geom = gp;
502 cp->stat = devstat_new_entry(cp, -1, 0, DEVSTAT_ALL_SUPPORTED,
503 DEVSTAT_TYPE_DIRECT, DEVSTAT_PRIORITY_MAX);
504 LIST_INSERT_HEAD(&gp->consumer, cp, consumer);
505 return(cp);
506 }
507
508 void
509 g_destroy_consumer(struct g_consumer *cp)
510 {
511 struct g_geom *gp;
512
513 g_topology_assert();
514 G_VALID_CONSUMER(cp);
515 g_trace(G_T_TOPOLOGY, "g_destroy_consumer(%p)", cp);
516 KASSERT (cp->provider == NULL, ("g_destroy_consumer but attached"));
517 KASSERT (cp->acr == 0, ("g_destroy_consumer with acr"));
518 KASSERT (cp->acw == 0, ("g_destroy_consumer with acw"));
519 KASSERT (cp->ace == 0, ("g_destroy_consumer with ace"));
520 g_cancel_event(cp);
521 gp = cp->geom;
522 LIST_REMOVE(cp, consumer);
523 devstat_remove_entry(cp->stat);
524 g_free(cp);
525 if (gp->flags & G_GEOM_WITHER)
526 g_do_wither();
527 }
528
529 static void
530 g_new_provider_event(void *arg, int flag)
531 {
532 struct g_class *mp;
533 struct g_provider *pp;
534 struct g_consumer *cp;
535
536 g_topology_assert();
537 if (flag == EV_CANCEL)
538 return;
539 if (g_shutdown)
540 return;
541 pp = arg;
542 G_VALID_PROVIDER(pp);
543 KASSERT(!(pp->flags & G_PF_WITHER),
544 ("g_new_provider_event but withered"));
545 LIST_FOREACH(mp, &g_classes, class) {
546 if (mp->taste == NULL)
547 continue;
548 LIST_FOREACH(cp, &pp->consumers, consumers)
549 if (cp->geom->class == mp)
550 break;
551 if (cp != NULL)
552 continue;
553 mp->taste(mp, pp, 0);
554 g_topology_assert();
555 }
556 }
557
558
559 struct g_provider *
560 g_new_providerf(struct g_geom *gp, const char *fmt, ...)
561 {
562 struct g_provider *pp;
563 struct sbuf *sb;
564 va_list ap;
565
566 g_topology_assert();
567 G_VALID_GEOM(gp);
568 KASSERT(gp->access != NULL,
569 ("new provider on geom(%s) without ->access (class %s)",
570 gp->name, gp->class->name));
571 KASSERT(gp->start != NULL,
572 ("new provider on geom(%s) without ->start (class %s)",
573 gp->name, gp->class->name));
574 KASSERT(!(gp->flags & G_GEOM_WITHER),
575 ("new provider on WITHERing geom(%s) (class %s)",
576 gp->name, gp->class->name));
577 sb = sbuf_new_auto();
578 va_start(ap, fmt);
579 sbuf_vprintf(sb, fmt, ap);
580 va_end(ap);
581 sbuf_finish(sb);
582 pp = g_malloc(sizeof *pp + sbuf_len(sb) + 1, M_WAITOK | M_ZERO);
583 pp->name = (char *)(pp + 1);
584 strcpy(pp->name, sbuf_data(sb));
585 sbuf_delete(sb);
586 LIST_INIT(&pp->consumers);
587 pp->error = ENXIO;
588 pp->geom = gp;
589 pp->stat = devstat_new_entry(pp, -1, 0, DEVSTAT_ALL_SUPPORTED,
590 DEVSTAT_TYPE_DIRECT, DEVSTAT_PRIORITY_MAX);
591 LIST_INSERT_HEAD(&gp->provider, pp, provider);
592 g_post_event(g_new_provider_event, pp, M_WAITOK, pp, gp, NULL);
593 return (pp);
594 }
595
596 void
597 g_error_provider(struct g_provider *pp, int error)
598 {
599
600 /* G_VALID_PROVIDER(pp); We may not have g_topology */
601 pp->error = error;
602 }
603
604 struct g_provider *
605 g_provider_by_name(char const *arg)
606 {
607 struct g_class *cp;
608 struct g_geom *gp;
609 struct g_provider *pp;
610
611 LIST_FOREACH(cp, &g_classes, class) {
612 LIST_FOREACH(gp, &cp->geom, geom) {
613 LIST_FOREACH(pp, &gp->provider, provider) {
614 if (!strcmp(arg, pp->name))
615 return (pp);
616 }
617 }
618 }
619 return (NULL);
620 }
621
622 void
623 g_destroy_provider(struct g_provider *pp)
624 {
625 struct g_geom *gp;
626
627 g_topology_assert();
628 G_VALID_PROVIDER(pp);
629 KASSERT(LIST_EMPTY(&pp->consumers),
630 ("g_destroy_provider but attached"));
631 KASSERT (pp->acr == 0, ("g_destroy_provider with acr"));
632 KASSERT (pp->acw == 0, ("g_destroy_provider with acw"));
633 KASSERT (pp->ace == 0, ("g_destroy_provider with ace"));
634 g_cancel_event(pp);
635 LIST_REMOVE(pp, provider);
636 gp = pp->geom;
637 devstat_remove_entry(pp->stat);
638 /*
639 * If a callback was provided, send notification that the provider
640 * is now gone.
641 */
642 if (gp->providergone != NULL)
643 gp->providergone(pp);
644
645 g_free(pp);
646 if ((gp->flags & G_GEOM_WITHER))
647 g_do_wither();
648 }
649
650 /*
651 * We keep the "geoms" list sorted by topological order (== increasing
652 * numerical rank) at all times.
653 * When an attach is done, the attaching geoms rank is invalidated
654 * and it is moved to the tail of the list.
655 * All geoms later in the sequence has their ranks reevaluated in
656 * sequence. If we cannot assign rank to a geom because it's
657 * prerequisites do not have rank, we move that element to the tail
658 * of the sequence with invalid rank as well.
659 * At some point we encounter our original geom and if we stil fail
660 * to assign it a rank, there must be a loop and we fail back to
661 * g_attach() which detach again and calls redo_rank again
662 * to fix up the damage.
663 * It would be much simpler code wise to do it recursively, but we
664 * can't risk that on the kernel stack.
665 */
666
667 static int
668 redo_rank(struct g_geom *gp)
669 {
670 struct g_consumer *cp;
671 struct g_geom *gp1, *gp2;
672 int n, m;
673
674 g_topology_assert();
675 G_VALID_GEOM(gp);
676
677 /* Invalidate this geoms rank and move it to the tail */
678 gp1 = TAILQ_NEXT(gp, geoms);
679 if (gp1 != NULL) {
680 gp->rank = 0;
681 TAILQ_REMOVE(&geoms, gp, geoms);
682 TAILQ_INSERT_TAIL(&geoms, gp, geoms);
683 } else {
684 gp1 = gp;
685 }
686
687 /* re-rank the rest of the sequence */
688 for (; gp1 != NULL; gp1 = gp2) {
689 gp1->rank = 0;
690 m = 1;
691 LIST_FOREACH(cp, &gp1->consumer, consumer) {
692 if (cp->provider == NULL)
693 continue;
694 n = cp->provider->geom->rank;
695 if (n == 0) {
696 m = 0;
697 break;
698 } else if (n >= m)
699 m = n + 1;
700 }
701 gp1->rank = m;
702 gp2 = TAILQ_NEXT(gp1, geoms);
703
704 /* got a rank, moving on */
705 if (m != 0)
706 continue;
707
708 /* no rank to original geom means loop */
709 if (gp == gp1)
710 return (ELOOP);
711
712 /* no rank, put it at the end move on */
713 TAILQ_REMOVE(&geoms, gp1, geoms);
714 TAILQ_INSERT_TAIL(&geoms, gp1, geoms);
715 }
716 return (0);
717 }
718
719 int
720 g_attach(struct g_consumer *cp, struct g_provider *pp)
721 {
722 int error;
723
724 g_topology_assert();
725 G_VALID_CONSUMER(cp);
726 G_VALID_PROVIDER(pp);
727 g_trace(G_T_TOPOLOGY, "g_attach(%p, %p)", cp, pp);
728 KASSERT(cp->provider == NULL, ("attach but attached"));
729 cp->provider = pp;
730 LIST_INSERT_HEAD(&pp->consumers, cp, consumers);
731 error = redo_rank(cp->geom);
732 if (error) {
733 LIST_REMOVE(cp, consumers);
734 cp->provider = NULL;
735 redo_rank(cp->geom);
736 }
737 return (error);
738 }
739
740 void
741 g_detach(struct g_consumer *cp)
742 {
743 struct g_provider *pp;
744
745 g_topology_assert();
746 G_VALID_CONSUMER(cp);
747 g_trace(G_T_TOPOLOGY, "g_detach(%p)", cp);
748 KASSERT(cp->provider != NULL, ("detach but not attached"));
749 KASSERT(cp->acr == 0, ("detach but nonzero acr"));
750 KASSERT(cp->acw == 0, ("detach but nonzero acw"));
751 KASSERT(cp->ace == 0, ("detach but nonzero ace"));
752 KASSERT(cp->nstart == cp->nend,
753 ("detach with active requests"));
754 pp = cp->provider;
755 LIST_REMOVE(cp, consumers);
756 cp->provider = NULL;
757 if (pp->geom->flags & G_GEOM_WITHER)
758 g_do_wither();
759 else if (pp->flags & G_PF_WITHER)
760 g_do_wither();
761 redo_rank(cp->geom);
762 }
763
764 /*
765 * g_access()
766 *
767 * Access-check with delta values. The question asked is "can provider
768 * "cp" change the access counters by the relative amounts dc[rwe] ?"
769 */
770
771 int
772 g_access(struct g_consumer *cp, int dcr, int dcw, int dce)
773 {
774 struct g_provider *pp;
775 int pr,pw,pe;
776 int error;
777
778 g_topology_assert();
779 G_VALID_CONSUMER(cp);
780 pp = cp->provider;
781 KASSERT(pp != NULL, ("access but not attached"));
782 G_VALID_PROVIDER(pp);
783
784 g_trace(G_T_ACCESS, "g_access(%p(%s), %d, %d, %d)",
785 cp, pp->name, dcr, dcw, dce);
786
787 KASSERT(cp->acr + dcr >= 0, ("access resulting in negative acr"));
788 KASSERT(cp->acw + dcw >= 0, ("access resulting in negative acw"));
789 KASSERT(cp->ace + dce >= 0, ("access resulting in negative ace"));
790 KASSERT(dcr != 0 || dcw != 0 || dce != 0, ("NOP access request"));
791 KASSERT(pp->geom->access != NULL, ("NULL geom->access"));
792
793 /*
794 * If our class cares about being spoiled, and we have been, we
795 * are probably just ahead of the event telling us that. Fail
796 * now rather than having to unravel this later.
797 */
798 if (cp->geom->spoiled != NULL && cp->spoiled &&
799 (dcr > 0 || dcw > 0 || dce > 0))
800 return (ENXIO);
801
802 /*
803 * Figure out what counts the provider would have had, if this
804 * consumer had (r0w0e0) at this time.
805 */
806 pr = pp->acr - cp->acr;
807 pw = pp->acw - cp->acw;
808 pe = pp->ace - cp->ace;
809
810 g_trace(G_T_ACCESS,
811 "open delta:[r%dw%de%d] old:[r%dw%de%d] provider:[r%dw%de%d] %p(%s)",
812 dcr, dcw, dce,
813 cp->acr, cp->acw, cp->ace,
814 pp->acr, pp->acw, pp->ace,
815 pp, pp->name);
816
817 /* If foot-shooting is enabled, any open on rank#1 is OK */
818 if ((g_debugflags & 16) && pp->geom->rank == 1)
819 ;
820 /* If we try exclusive but already write: fail */
821 else if (dce > 0 && pw > 0)
822 return (EPERM);
823 /* If we try write but already exclusive: fail */
824 else if (dcw > 0 && pe > 0)
825 return (EPERM);
826 /* If we try to open more but provider is error'ed: fail */
827 else if ((dcr > 0 || dcw > 0 || dce > 0) && pp->error != 0)
828 return (pp->error);
829
830 /* Ok then... */
831
832 error = pp->geom->access(pp, dcr, dcw, dce);
833 KASSERT(dcr > 0 || dcw > 0 || dce > 0 || error == 0,
834 ("Geom provider %s::%s failed closing ->access()",
835 pp->geom->class->name, pp->name));
836 if (!error) {
837 /*
838 * If we open first write, spoil any partner consumers.
839 * If we close last write and provider is not errored,
840 * trigger re-taste.
841 */
842 if (pp->acw == 0 && dcw != 0)
843 g_spoil(pp, cp);
844 else if (pp->acw != 0 && pp->acw == -dcw && pp->error == 0 &&
845 !(pp->geom->flags & G_GEOM_WITHER))
846 g_post_event(g_new_provider_event, pp, M_WAITOK,
847 pp, NULL);
848
849 pp->acr += dcr;
850 pp->acw += dcw;
851 pp->ace += dce;
852 cp->acr += dcr;
853 cp->acw += dcw;
854 cp->ace += dce;
855 if (pp->acr != 0 || pp->acw != 0 || pp->ace != 0)
856 KASSERT(pp->sectorsize > 0,
857 ("Provider %s lacks sectorsize", pp->name));
858 }
859 return (error);
860 }
861
862 int
863 g_handleattr_int(struct bio *bp, const char *attribute, int val)
864 {
865
866 return (g_handleattr(bp, attribute, &val, sizeof val));
867 }
868
869 int
870 g_handleattr_off_t(struct bio *bp, const char *attribute, off_t val)
871 {
872
873 return (g_handleattr(bp, attribute, &val, sizeof val));
874 }
875
876 int
877 g_handleattr_str(struct bio *bp, const char *attribute, const char *str)
878 {
879
880 return (g_handleattr(bp, attribute, str, 0));
881 }
882
883 int
884 g_handleattr(struct bio *bp, const char *attribute, const void *val, int len)
885 {
886 int error = 0;
887
888 if (strcmp(bp->bio_attribute, attribute))
889 return (0);
890 if (len == 0) {
891 bzero(bp->bio_data, bp->bio_length);
892 if (strlcpy(bp->bio_data, val, bp->bio_length) >=
893 bp->bio_length) {
894 printf("%s: %s bio_length %jd len %zu -> EFAULT\n",
895 __func__, bp->bio_to->name,
896 (intmax_t)bp->bio_length, strlen(val));
897 error = EFAULT;
898 }
899 } else if (bp->bio_length == len) {
900 bcopy(val, bp->bio_data, len);
901 } else {
902 printf("%s: %s bio_length %jd len %d -> EFAULT\n", __func__,
903 bp->bio_to->name, (intmax_t)bp->bio_length, len);
904 error = EFAULT;
905 }
906 if (error == 0)
907 bp->bio_completed = bp->bio_length;
908 g_io_deliver(bp, error);
909 return (1);
910 }
911
912 int
913 g_std_access(struct g_provider *pp,
914 int dr __unused, int dw __unused, int de __unused)
915 {
916
917 g_topology_assert();
918 G_VALID_PROVIDER(pp);
919 return (0);
920 }
921
922 void
923 g_std_done(struct bio *bp)
924 {
925 struct bio *bp2;
926
927 bp2 = bp->bio_parent;
928 if (bp2->bio_error == 0)
929 bp2->bio_error = bp->bio_error;
930 bp2->bio_completed += bp->bio_completed;
931 g_destroy_bio(bp);
932 bp2->bio_inbed++;
933 if (bp2->bio_children == bp2->bio_inbed)
934 g_io_deliver(bp2, bp2->bio_error);
935 }
936
937 /* XXX: maybe this is only g_slice_spoiled */
938
939 void
940 g_std_spoiled(struct g_consumer *cp)
941 {
942 struct g_geom *gp;
943 struct g_provider *pp;
944
945 g_topology_assert();
946 G_VALID_CONSUMER(cp);
947 g_trace(G_T_TOPOLOGY, "g_std_spoiled(%p)", cp);
948 g_detach(cp);
949 gp = cp->geom;
950 LIST_FOREACH(pp, &gp->provider, provider)
951 g_orphan_provider(pp, ENXIO);
952 g_destroy_consumer(cp);
953 if (LIST_EMPTY(&gp->provider) && LIST_EMPTY(&gp->consumer))
954 g_destroy_geom(gp);
955 else
956 gp->flags |= G_GEOM_WITHER;
957 }
958
959 /*
960 * Spoiling happens when a provider is opened for writing, but consumers
961 * which are configured by in-band data are attached (slicers for instance).
962 * Since the write might potentially change the in-band data, such consumers
963 * need to re-evaluate their existence after the writing session closes.
964 * We do this by (offering to) tear them down when the open for write happens
965 * in return for a re-taste when it closes again.
966 * Together with the fact that such consumers grab an 'e' bit whenever they
967 * are open, regardless of mode, this ends up DTRT.
968 */
969
970 static void
971 g_spoil_event(void *arg, int flag)
972 {
973 struct g_provider *pp;
974 struct g_consumer *cp, *cp2;
975
976 g_topology_assert();
977 if (flag == EV_CANCEL)
978 return;
979 pp = arg;
980 G_VALID_PROVIDER(pp);
981 for (cp = LIST_FIRST(&pp->consumers); cp != NULL; cp = cp2) {
982 cp2 = LIST_NEXT(cp, consumers);
983 if (!cp->spoiled)
984 continue;
985 cp->spoiled = 0;
986 if (cp->geom->spoiled == NULL)
987 continue;
988 cp->geom->spoiled(cp);
989 g_topology_assert();
990 }
991 }
992
993 void
994 g_spoil(struct g_provider *pp, struct g_consumer *cp)
995 {
996 struct g_consumer *cp2;
997
998 g_topology_assert();
999 G_VALID_PROVIDER(pp);
1000 G_VALID_CONSUMER(cp);
1001
1002 LIST_FOREACH(cp2, &pp->consumers, consumers) {
1003 if (cp2 == cp)
1004 continue;
1005 /*
1006 KASSERT(cp2->acr == 0, ("spoiling cp->acr = %d", cp2->acr));
1007 KASSERT(cp2->acw == 0, ("spoiling cp->acw = %d", cp2->acw));
1008 */
1009 KASSERT(cp2->ace == 0, ("spoiling cp->ace = %d", cp2->ace));
1010 cp2->spoiled++;
1011 }
1012 g_post_event(g_spoil_event, pp, M_WAITOK, pp, NULL);
1013 }
1014
1015 int
1016 g_getattr__(const char *attr, struct g_consumer *cp, void *var, int len)
1017 {
1018 int error, i;
1019
1020 i = len;
1021 error = g_io_getattr(attr, cp, &i, var);
1022 if (error)
1023 return (error);
1024 if (i != len)
1025 return (EINVAL);
1026 return (0);
1027 }
1028
1029 static int
1030 g_get_device_prefix_len(const char *name)
1031 {
1032 int len;
1033
1034 if (strncmp(name, "ada", 3) == 0)
1035 len = 3;
1036 else if (strncmp(name, "ad", 2) == 0)
1037 len = 2;
1038 else
1039 return (0);
1040 if (name[len] < '' || name[len] > '9')
1041 return (0);
1042 do {
1043 len++;
1044 } while (name[len] >= '' && name[len] <= '9');
1045 return (len);
1046 }
1047
1048 int
1049 g_compare_names(const char *namea, const char *nameb)
1050 {
1051 int deva, devb;
1052
1053 if (strcmp(namea, nameb) == 0)
1054 return (1);
1055 deva = g_get_device_prefix_len(namea);
1056 if (deva == 0)
1057 return (0);
1058 devb = g_get_device_prefix_len(nameb);
1059 if (devb == 0)
1060 return (0);
1061 if (strcmp(namea + deva, nameb + devb) == 0)
1062 return (1);
1063 return (0);
1064 }
1065
1066 #if defined(DIAGNOSTIC) || defined(DDB)
1067 /*
1068 * This function walks the mesh and returns a non-zero integer if it
1069 * finds the argument pointer is an object. The return value indicates
1070 * which type of object it is believed to be. If topology is not locked,
1071 * this function is potentially dangerous, but we don't assert that the
1072 * topology lock is held when called from debugger.
1073 */
1074 int
1075 g_valid_obj(void const *ptr)
1076 {
1077 struct g_class *mp;
1078 struct g_geom *gp;
1079 struct g_consumer *cp;
1080 struct g_provider *pp;
1081
1082 #ifdef KDB
1083 if (kdb_active == 0)
1084 #endif
1085 g_topology_assert();
1086
1087 LIST_FOREACH(mp, &g_classes, class) {
1088 if (ptr == mp)
1089 return (1);
1090 LIST_FOREACH(gp, &mp->geom, geom) {
1091 if (ptr == gp)
1092 return (2);
1093 LIST_FOREACH(cp, &gp->consumer, consumer)
1094 if (ptr == cp)
1095 return (3);
1096 LIST_FOREACH(pp, &gp->provider, provider)
1097 if (ptr == pp)
1098 return (4);
1099 }
1100 }
1101 return(0);
1102 }
1103 #endif
1104
1105 #ifdef DDB
1106
1107 #define gprintf(...) do { \
1108 db_printf("%*s", indent, ""); \
1109 db_printf(__VA_ARGS__); \
1110 } while (0)
1111 #define gprintln(...) do { \
1112 gprintf(__VA_ARGS__); \
1113 db_printf("\n"); \
1114 } while (0)
1115
1116 #define ADDFLAG(obj, flag, sflag) do { \
1117 if ((obj)->flags & (flag)) { \
1118 if (comma) \
1119 strlcat(str, ",", size); \
1120 strlcat(str, (sflag), size); \
1121 comma = 1; \
1122 } \
1123 } while (0)
1124
1125 static char *
1126 provider_flags_to_string(struct g_provider *pp, char *str, size_t size)
1127 {
1128 int comma = 0;
1129
1130 bzero(str, size);
1131 if (pp->flags == 0) {
1132 strlcpy(str, "NONE", size);
1133 return (str);
1134 }
1135 ADDFLAG(pp, G_PF_CANDELETE, "G_PF_CANDELETE");
1136 ADDFLAG(pp, G_PF_WITHER, "G_PF_WITHER");
1137 ADDFLAG(pp, G_PF_ORPHAN, "G_PF_ORPHAN");
1138 return (str);
1139 }
1140
1141 static char *
1142 geom_flags_to_string(struct g_geom *gp, char *str, size_t size)
1143 {
1144 int comma = 0;
1145
1146 bzero(str, size);
1147 if (gp->flags == 0) {
1148 strlcpy(str, "NONE", size);
1149 return (str);
1150 }
1151 ADDFLAG(gp, G_GEOM_WITHER, "G_GEOM_WITHER");
1152 return (str);
1153 }
1154 static void
1155 db_show_geom_consumer(int indent, struct g_consumer *cp)
1156 {
1157
1158 if (indent == 0) {
1159 gprintln("consumer: %p", cp);
1160 gprintln(" class: %s (%p)", cp->geom->class->name,
1161 cp->geom->class);
1162 gprintln(" geom: %s (%p)", cp->geom->name, cp->geom);
1163 if (cp->provider == NULL)
1164 gprintln(" provider: none");
1165 else {
1166 gprintln(" provider: %s (%p)", cp->provider->name,
1167 cp->provider);
1168 }
1169 gprintln(" access: r%dw%de%d", cp->acr, cp->acw, cp->ace);
1170 gprintln(" spoiled: %d", cp->spoiled);
1171 gprintln(" nstart: %u", cp->nstart);
1172 gprintln(" nend: %u", cp->nend);
1173 } else {
1174 gprintf("consumer: %p (%s), access=r%dw%de%d", cp,
1175 cp->provider != NULL ? cp->provider->name : "none",
1176 cp->acr, cp->acw, cp->ace);
1177 if (cp->spoiled)
1178 db_printf(", spoiled=%d", cp->spoiled);
1179 db_printf("\n");
1180 }
1181 }
1182
1183 static void
1184 db_show_geom_provider(int indent, struct g_provider *pp)
1185 {
1186 struct g_consumer *cp;
1187 char flags[64];
1188
1189 if (indent == 0) {
1190 gprintln("provider: %s (%p)", pp->name, pp);
1191 gprintln(" class: %s (%p)", pp->geom->class->name,
1192 pp->geom->class);
1193 gprintln(" geom: %s (%p)", pp->geom->name, pp->geom);
1194 gprintln(" mediasize: %jd", (intmax_t)pp->mediasize);
1195 gprintln(" sectorsize: %u", pp->sectorsize);
1196 gprintln(" stripesize: %u", pp->stripesize);
1197 gprintln(" stripeoffset: %u", pp->stripeoffset);
1198 gprintln(" access: r%dw%de%d", pp->acr, pp->acw,
1199 pp->ace);
1200 gprintln(" flags: %s (0x%04x)",
1201 provider_flags_to_string(pp, flags, sizeof(flags)),
1202 pp->flags);
1203 gprintln(" error: %d", pp->error);
1204 gprintln(" nstart: %u", pp->nstart);
1205 gprintln(" nend: %u", pp->nend);
1206 if (LIST_EMPTY(&pp->consumers))
1207 gprintln(" consumers: none");
1208 } else {
1209 gprintf("provider: %s (%p), access=r%dw%de%d",
1210 pp->name, pp, pp->acr, pp->acw, pp->ace);
1211 if (pp->flags != 0) {
1212 db_printf(", flags=%s (0x%04x)",
1213 provider_flags_to_string(pp, flags, sizeof(flags)),
1214 pp->flags);
1215 }
1216 db_printf("\n");
1217 }
1218 if (!LIST_EMPTY(&pp->consumers)) {
1219 LIST_FOREACH(cp, &pp->consumers, consumers) {
1220 db_show_geom_consumer(indent + 2, cp);
1221 if (db_pager_quit)
1222 break;
1223 }
1224 }
1225 }
1226
1227 static void
1228 db_show_geom_geom(int indent, struct g_geom *gp)
1229 {
1230 struct g_provider *pp;
1231 struct g_consumer *cp;
1232 char flags[64];
1233
1234 if (indent == 0) {
1235 gprintln("geom: %s (%p)", gp->name, gp);
1236 gprintln(" class: %s (%p)", gp->class->name, gp->class);
1237 gprintln(" flags: %s (0x%04x)",
1238 geom_flags_to_string(gp, flags, sizeof(flags)), gp->flags);
1239 gprintln(" rank: %d", gp->rank);
1240 if (LIST_EMPTY(&gp->provider))
1241 gprintln(" providers: none");
1242 if (LIST_EMPTY(&gp->consumer))
1243 gprintln(" consumers: none");
1244 } else {
1245 gprintf("geom: %s (%p), rank=%d", gp->name, gp, gp->rank);
1246 if (gp->flags != 0) {
1247 db_printf(", flags=%s (0x%04x)",
1248 geom_flags_to_string(gp, flags, sizeof(flags)),
1249 gp->flags);
1250 }
1251 db_printf("\n");
1252 }
1253 if (!LIST_EMPTY(&gp->provider)) {
1254 LIST_FOREACH(pp, &gp->provider, provider) {
1255 db_show_geom_provider(indent + 2, pp);
1256 if (db_pager_quit)
1257 break;
1258 }
1259 }
1260 if (!LIST_EMPTY(&gp->consumer)) {
1261 LIST_FOREACH(cp, &gp->consumer, consumer) {
1262 db_show_geom_consumer(indent + 2, cp);
1263 if (db_pager_quit)
1264 break;
1265 }
1266 }
1267 }
1268
1269 static void
1270 db_show_geom_class(struct g_class *mp)
1271 {
1272 struct g_geom *gp;
1273
1274 db_printf("class: %s (%p)\n", mp->name, mp);
1275 LIST_FOREACH(gp, &mp->geom, geom) {
1276 db_show_geom_geom(2, gp);
1277 if (db_pager_quit)
1278 break;
1279 }
1280 }
1281
1282 /*
1283 * Print the GEOM topology or the given object.
1284 */
1285 DB_SHOW_COMMAND(geom, db_show_geom)
1286 {
1287 struct g_class *mp;
1288
1289 if (!have_addr) {
1290 /* No address given, print the entire topology. */
1291 LIST_FOREACH(mp, &g_classes, class) {
1292 db_show_geom_class(mp);
1293 db_printf("\n");
1294 if (db_pager_quit)
1295 break;
1296 }
1297 } else {
1298 switch (g_valid_obj((void *)addr)) {
1299 case 1:
1300 db_show_geom_class((struct g_class *)addr);
1301 break;
1302 case 2:
1303 db_show_geom_geom(0, (struct g_geom *)addr);
1304 break;
1305 case 3:
1306 db_show_geom_consumer(0, (struct g_consumer *)addr);
1307 break;
1308 case 4:
1309 db_show_geom_provider(0, (struct g_provider *)addr);
1310 break;
1311 default:
1312 db_printf("Not a GEOM object.\n");
1313 break;
1314 }
1315 }
1316 }
1317
1318 static void
1319 db_print_bio_cmd(struct bio *bp)
1320 {
1321 db_printf(" cmd: ");
1322 switch (bp->bio_cmd) {
1323 case BIO_READ: db_printf("BIO_READ"); break;
1324 case BIO_WRITE: db_printf("BIO_WRITE"); break;
1325 case BIO_DELETE: db_printf("BIO_DELETE"); break;
1326 case BIO_GETATTR: db_printf("BIO_GETATTR"); break;
1327 case BIO_FLUSH: db_printf("BIO_FLUSH"); break;
1328 case BIO_CMD0: db_printf("BIO_CMD0"); break;
1329 case BIO_CMD1: db_printf("BIO_CMD1"); break;
1330 case BIO_CMD2: db_printf("BIO_CMD2"); break;
1331 default: db_printf("UNKNOWN"); break;
1332 }
1333 db_printf("\n");
1334 }
1335
1336 static void
1337 db_print_bio_flags(struct bio *bp)
1338 {
1339 int comma;
1340
1341 comma = 0;
1342 db_printf(" flags: ");
1343 if (bp->bio_flags & BIO_ERROR) {
1344 db_printf("BIO_ERROR");
1345 comma = 1;
1346 }
1347 if (bp->bio_flags & BIO_DONE) {
1348 db_printf("%sBIO_DONE", (comma ? ", " : ""));
1349 comma = 1;
1350 }
1351 if (bp->bio_flags & BIO_ONQUEUE)
1352 db_printf("%sBIO_ONQUEUE", (comma ? ", " : ""));
1353 db_printf("\n");
1354 }
1355
1356 /*
1357 * Print useful information in a BIO
1358 */
1359 DB_SHOW_COMMAND(bio, db_show_bio)
1360 {
1361 struct bio *bp;
1362
1363 if (have_addr) {
1364 bp = (struct bio *)addr;
1365 db_printf("BIO %p\n", bp);
1366 db_print_bio_cmd(bp);
1367 db_print_bio_flags(bp);
1368 db_printf(" cflags: 0x%hhx\n", bp->bio_cflags);
1369 db_printf(" pflags: 0x%hhx\n", bp->bio_pflags);
1370 db_printf(" offset: %jd\n", (intmax_t)bp->bio_offset);
1371 db_printf(" length: %jd\n", (intmax_t)bp->bio_length);
1372 db_printf(" bcount: %ld\n", bp->bio_bcount);
1373 db_printf(" resid: %ld\n", bp->bio_resid);
1374 db_printf(" completed: %jd\n", (intmax_t)bp->bio_completed);
1375 db_printf(" children: %u\n", bp->bio_children);
1376 db_printf(" inbed: %u\n", bp->bio_inbed);
1377 db_printf(" error: %d\n", bp->bio_error);
1378 db_printf(" parent: %p\n", bp->bio_parent);
1379 db_printf(" driver1: %p\n", bp->bio_driver1);
1380 db_printf(" driver2: %p\n", bp->bio_driver2);
1381 db_printf(" caller1: %p\n", bp->bio_caller1);
1382 db_printf(" caller2: %p\n", bp->bio_caller2);
1383 db_printf(" bio_from: %p\n", bp->bio_from);
1384 db_printf(" bio_to: %p\n", bp->bio_to);
1385 }
1386 }
1387
1388 #undef gprintf
1389 #undef gprintln
1390 #undef ADDFLAG
1391
1392 #endif /* DDB */
Cache object: b05f36467b72184e0ffcd0bb027303be
|