sem.c revision 1.17 1 /* $NetBSD: sem.c,v 1.17 2005/12/18 23:43:15 cube Exp $ */
2
3 /*
4 * Copyright (c) 1992, 1993
5 * The Regents of the University of California. All rights reserved.
6 *
7 * This software was developed by the Computer Systems Engineering group
8 * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
9 * contributed to Berkeley.
10 *
11 * All advertising materials mentioning features or use of this software
12 * must display the following acknowledgement:
13 * This product includes software developed by the University of
14 * California, Lawrence Berkeley Laboratories.
15 *
16 * Redistribution and use in source and binary forms, with or without
17 * modification, are permitted provided that the following conditions
18 * are met:
19 * 1. Redistributions of source code must retain the above copyright
20 * notice, this list of conditions and the following disclaimer.
21 * 2. Redistributions in binary form must reproduce the above copyright
22 * notice, this list of conditions and the following disclaimer in the
23 * documentation and/or other materials provided with the distribution.
24 * 3. Neither the name of the University nor the names of its contributors
25 * may be used to endorse or promote products derived from this software
26 * without specific prior written permission.
27 *
28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * SUCH DAMAGE.
39 *
40 * from: @(#)sem.c 8.1 (Berkeley) 6/6/93
41 */
42
43 #if HAVE_NBTOOL_CONFIG_H
44 #include "nbtool_config.h"
45 #endif
46
47 #include <sys/param.h>
48 #include <ctype.h>
49 #include <stdio.h>
50 #include <stdlib.h>
51 #include <string.h>
52 #include "defs.h"
53 #include "sem.h"
54
55 /*
56 * config semantics.
57 */
58
59 #define NAMESIZE 100 /* local name buffers */
60
61 const char *s_ifnet; /* magic attribute */
62 const char *s_qmark;
63 const char *s_none;
64
65 static struct hashtab *cfhashtab; /* for config lookup */
66 struct hashtab *devitab; /* etc */
67
68 static struct attr errattr;
69 static struct devbase errdev;
70 static struct deva errdeva;
71
72 static int has_errobj(struct nvlist *, void *);
73 static struct nvlist *addtoattr(struct nvlist *, struct devbase *);
74 static int resolve(struct nvlist **, const char *, const char *,
75 struct nvlist *, int);
76 static struct pspec *getpspec(struct attr *, struct devbase *, int);
77 static struct devi *newdevi(const char *, int, struct devbase *d);
78 static struct devi *getdevi(const char *);
79 static void remove_devi(struct devi *);
80 static const char *concat(const char *, int);
81 static char *extend(char *, const char *);
82 static int split(const char *, size_t, char *, size_t, int *);
83 static void selectbase(struct devbase *, struct deva *);
84 static int onlist(struct nvlist *, void *);
85 static const char **fixloc(const char *, struct attr *, struct nvlist *);
86 static const char *makedevstr(int, int);
87 static const char *major2name(int);
88 static int dev2major(struct devbase *);
89
90 extern const char *yyfile;
91 extern int vflag;
92
93 void
94 initsem(void)
95 {
96
97 attrtab = ht_new();
98 errattr.a_name = "<internal>";
99
100 TAILQ_INIT(&allbases);
101
102 TAILQ_INIT(&alldevas);
103
104 TAILQ_INIT(&allpspecs);
105
106 cfhashtab = ht_new();
107 TAILQ_INIT(&allcf);
108
109 TAILQ_INIT(&alldevi);
110 errdev.d_name = "<internal>";
111
112 TAILQ_INIT(&allpseudo);
113
114 TAILQ_INIT(&alldevms);
115
116 s_ifnet = intern("ifnet");
117 s_qmark = intern("?");
118 s_none = intern("none");
119 }
120
121 /* Name of include file just ended (set in scan.l) */
122 extern const char *lastfile;
123
124 void
125 enddefs(void)
126 {
127 struct devbase *dev;
128
129 TAILQ_FOREACH(dev, &allbases, d_next) {
130 if (!dev->d_isdef) {
131 (void)fprintf(stderr,
132 "%s: device `%s' used but not defined\n",
133 lastfile, dev->d_name);
134 errors++;
135 continue;
136 }
137 }
138 if (errors) {
139 (void)fprintf(stderr, "*** Stop.\n");
140 exit(1);
141 }
142 }
143
144 void
145 setdefmaxusers(int min, int def, int max)
146 {
147
148 if (min < 1 || min > def || def > max)
149 error("maxusers must have 1 <= min (%d) <= default (%d) <= max (%d)", min, def, max);
150 else {
151 minmaxusers = min;
152 defmaxusers = def;
153 maxmaxusers = max;
154 }
155 }
156
157 void
158 setmaxusers(int n)
159 {
160
161 if (maxusers == n) {
162 error("duplicate maxusers parameter");
163 return;
164 }
165 if (vflag && maxusers != 0)
166 warn("maxusers already defined");
167 maxusers = n;
168 if (n < minmaxusers) {
169 error("warning: minimum of %d maxusers assumed", minmaxusers);
170 errors--; /* take it away */
171 maxusers = minmaxusers;
172 } else if (n > maxmaxusers) {
173 error("warning: maxusers (%d) > %d", n, maxmaxusers);
174 errors--;
175 }
176 }
177
178 void
179 setident(const char *i)
180 {
181
182 ident = intern(i);
183 }
184
185 /*
186 * Define an attribute, optionally with an interface (a locator list)
187 * and a set of attribute-dependencies.
188 *
189 * Attribute dependencies MAY NOT be interface attributes.
190 *
191 * Since an empty locator list is logically different from "no interface",
192 * all locator lists include a dummy head node, which we discard here.
193 */
194 int
195 defattr(const char *name, struct nvlist *locs, struct nvlist *deps,
196 int devclass)
197 {
198 struct attr *a, *dep;
199 struct nvlist *nv;
200 int len;
201
202 if (locs != NULL && devclass)
203 panic("defattr(%s): locators and devclass", name);
204
205 if (deps != NULL && devclass)
206 panic("defattr(%s): dependencies and devclass", name);
207
208 /*
209 * If this attribute depends on any others, make sure none of
210 * the dependencies are interface attributes.
211 */
212 for (nv = deps; nv != NULL; nv = nv->nv_next) {
213 dep = nv->nv_ptr;
214 if (dep->a_iattr) {
215 error("`%s' dependency `%s' is an interface attribute",
216 name, dep->a_name);
217 return (1);
218 }
219 }
220
221 a = ecalloc(1, sizeof *a);
222 if (ht_insert(attrtab, name, a)) {
223 free(a);
224 error("attribute `%s' already defined", name);
225 nvfreel(locs);
226 return (1);
227 }
228
229 a->a_name = name;
230 if (locs != NULL) {
231 a->a_iattr = 1;
232 a->a_locs = locs->nv_next;
233 nvfree(locs);
234 } else {
235 a->a_iattr = 0;
236 a->a_locs = NULL;
237 }
238 if (devclass) {
239 size_t l = strlen(name) + 4;
240 char *classenum = alloca(l), *cp;
241 int errored = 0;
242
243 strlcpy(classenum, "DV_", l);
244 strlcat(classenum, name, l);
245 for (cp = classenum + 3; *cp; cp++) {
246 if (!errored &&
247 (!isalnum((unsigned char)*cp) ||
248 (isalpha((unsigned char)*cp) && !islower((unsigned char)*cp)))) {
249 error("device class names must be lower-case alphanumeric characters");
250 errored = 1;
251 }
252 *cp = toupper((unsigned char)*cp);
253 }
254 a->a_devclass = intern(classenum);
255 } else
256 a->a_devclass = NULL;
257 len = 0;
258 for (nv = a->a_locs; nv != NULL; nv = nv->nv_next)
259 len++;
260 a->a_loclen = len;
261 a->a_devs = NULL;
262 a->a_refs = NULL;
263 a->a_deps = deps;
264 a->a_expanding = 0;
265
266 /* Expand the attribute to check for cycles in the graph. */
267 expandattr(a, NULL);
268
269 return (0);
270 }
271
272 /*
273 * Return true if the given `error object' is embedded in the given
274 * pointer list.
275 */
276 static int
277 has_errobj(struct nvlist *nv, void *obj)
278 {
279
280 for (; nv != NULL; nv = nv->nv_next)
281 if (nv->nv_ptr == obj)
282 return (1);
283 return (0);
284 }
285
286 /*
287 * Return true if the given attribute is embedded in the given
288 * pointer list.
289 */
290 int
291 has_attr(struct nvlist *nv, const char *attr)
292 {
293 struct attr *a;
294
295 if ((a = getattr(attr)) == NULL)
296 return (0);
297
298 for (; nv != NULL; nv = nv->nv_next)
299 if (nv->nv_ptr == a)
300 return (1);
301 return (0);
302 }
303
304 /*
305 * Add a device base to a list in an attribute (actually, to any list).
306 * Note that this does not check for duplicates, and does reverse the
307 * list order, but no one cares anyway.
308 */
309 static struct nvlist *
310 addtoattr(struct nvlist *l, struct devbase *dev)
311 {
312 struct nvlist *n;
313
314 n = newnv(NULL, NULL, dev, 0, l);
315 return (n);
316 }
317
318 /*
319 * Define a device. This may (or may not) also define an interface
320 * attribute and/or refer to existing attributes.
321 */
322 void
323 defdev(struct devbase *dev, struct nvlist *loclist, struct nvlist *attrs,
324 int ispseudo)
325 {
326 struct nvlist *nv;
327 struct attr *a;
328
329 if (dev == &errdev)
330 goto bad;
331 if (dev->d_isdef) {
332 error("redefinition of `%s'", dev->d_name);
333 goto bad;
334 }
335
336 dev->d_isdef = 1;
337 if (has_errobj(attrs, &errattr))
338 goto bad;
339
340 /*
341 * Handle implicit attribute definition from locator list. Do
342 * this before scanning the `at' list so that we can have, e.g.:
343 * device foo at other, foo { slot = -1 }
344 * (where you can plug in a foo-bus extender to a foo-bus).
345 */
346 if (loclist != NULL) {
347 nv = loclist;
348 loclist = NULL; /* defattr disposes of them for us */
349 if (defattr(dev->d_name, nv, NULL, 0))
350 goto bad;
351 attrs = newnv(dev->d_name, NULL, getattr(dev->d_name), 0,
352 attrs);
353
354 }
355
356 /*
357 * Pseudo-devices can have children. Consider them as
358 * attaching at root.
359 */
360 if (ispseudo) {
361 for (nv = attrs; nv != NULL; nv = nv->nv_next)
362 if (((struct attr *)(nv->nv_ptr))->a_iattr)
363 break;
364 if (nv != NULL)
365 ht_insert(devroottab, dev->d_name, dev);
366 }
367
368 /* Committed! Set up fields. */
369 dev->d_ispseudo = ispseudo;
370 dev->d_attrs = attrs;
371 dev->d_classattr = NULL; /* for now */
372
373 /*
374 * For each interface attribute this device refers to, add this
375 * device to its reference list. This makes, e.g., finding all
376 * "scsi"s easier.
377 *
378 * While looking through the attributes, set up the device
379 * class if any are devclass attributes (and error out if the
380 * device has two classes).
381 */
382 for (nv = attrs; nv != NULL; nv = nv->nv_next) {
383 a = nv->nv_ptr;
384 if (a->a_iattr)
385 a->a_refs = addtoattr(a->a_refs, dev);
386 if (a->a_devclass != NULL) {
387 if (dev->d_classattr != NULL) {
388 error("device `%s' has multiple classes (`%s' and `%s')",
389 dev->d_name, dev->d_classattr->a_name,
390 a->a_name);
391 }
392 dev->d_classattr = a;
393 }
394 }
395 return;
396 bad:
397 nvfreel(loclist);
398 nvfreel(attrs);
399 }
400
401 /*
402 * Look up a devbase. Also makes sure it is a reasonable name,
403 * i.e., does not end in a digit or contain special characters.
404 */
405 struct devbase *
406 getdevbase(const char *name)
407 {
408 u_char *p;
409 struct devbase *dev;
410
411 p = (u_char *)name;
412 if (!isalpha(*p))
413 goto badname;
414 while (*++p) {
415 if (!isalnum(*p) && *p != '_')
416 goto badname;
417 }
418 if (isdigit(*--p)) {
419 badname:
420 error("bad device base name `%s'", name);
421 return (&errdev);
422 }
423 dev = ht_lookup(devbasetab, name);
424 if (dev == NULL) {
425 dev = ecalloc(1, sizeof *dev);
426 dev->d_name = name;
427 dev->d_isdef = 0;
428 dev->d_major = NODEV;
429 dev->d_attrs = NULL;
430 dev->d_ihead = NULL;
431 dev->d_ipp = &dev->d_ihead;
432 dev->d_ahead = NULL;
433 dev->d_app = &dev->d_ahead;
434 dev->d_umax = 0;
435 TAILQ_INSERT_TAIL(&allbases, dev, d_next);
436 if (ht_insert(devbasetab, name, dev))
437 panic("getdevbase(%s)", name);
438 }
439 return (dev);
440 }
441
442 /*
443 * Define some of a device's allowable parent attachments.
444 * There may be a list of (plain) attributes.
445 */
446 void
447 defdevattach(struct deva *deva, struct devbase *dev, struct nvlist *atlist,
448 struct nvlist *attrs)
449 {
450 struct nvlist *nv;
451 struct attr *a;
452 struct deva *da;
453
454 if (dev == &errdev)
455 goto bad;
456 if (deva == NULL)
457 deva = getdevattach(dev->d_name);
458 if (deva == &errdeva)
459 goto bad;
460 if (!dev->d_isdef) {
461 error("attaching undefined device `%s'", dev->d_name);
462 goto bad;
463 }
464 if (deva->d_isdef) {
465 error("redefinition of `%s'", deva->d_name);
466 goto bad;
467 }
468 if (dev->d_ispseudo) {
469 error("pseudo-devices can't attach");
470 goto bad;
471 }
472
473 deva->d_isdef = 1;
474 if (has_errobj(attrs, &errattr))
475 goto bad;
476 for (nv = attrs; nv != NULL; nv = nv->nv_next) {
477 a = nv->nv_ptr;
478 if (a == &errattr)
479 continue; /* already complained */
480 if (a->a_iattr || a->a_devclass != NULL)
481 error("`%s' is not a plain attribute", a->a_name);
482 }
483
484 /* Committed! Set up fields. */
485 deva->d_attrs = attrs;
486 deva->d_atlist = atlist;
487 deva->d_devbase = dev;
488
489 /*
490 * Turn the `at' list into interface attributes (map each
491 * nv_name to an attribute, or to NULL for root), and add
492 * this device to those attributes, so that children can
493 * be listed at this particular device if they are supported
494 * by that attribute.
495 */
496 for (nv = atlist; nv != NULL; nv = nv->nv_next) {
497 if (nv->nv_name == NULL)
498 nv->nv_ptr = a = NULL; /* at root */
499 else
500 nv->nv_ptr = a = getattr(nv->nv_name);
501 if (a == &errattr)
502 continue; /* already complained */
503
504 /*
505 * Make sure that an attachment spec doesn't
506 * already say how to attach to this attribute.
507 */
508 for (da = dev->d_ahead; da != NULL; da = da->d_bsame)
509 if (onlist(da->d_atlist, a))
510 error("attach at `%s' already done by `%s'",
511 a ? a->a_name : "root", da->d_name);
512
513 if (a == NULL) {
514 ht_insert(devroottab, dev->d_name, dev);
515 continue; /* at root; don't add */
516 }
517 if (!a->a_iattr)
518 error("%s cannot be at plain attribute `%s'",
519 dev->d_name, a->a_name);
520 else
521 a->a_devs = addtoattr(a->a_devs, dev);
522 }
523
524 /* attach to parent */
525 *dev->d_app = deva;
526 dev->d_app = &deva->d_bsame;
527 return;
528 bad:
529 nvfreel(atlist);
530 nvfreel(attrs);
531 }
532
533 /*
534 * Look up a device attachment. Also makes sure it is a reasonable
535 * name, i.e., does not contain digits or special characters.
536 */
537 struct deva *
538 getdevattach(const char *name)
539 {
540 u_char *p;
541 struct deva *deva;
542
543 p = (u_char *)name;
544 if (!isalpha(*p))
545 goto badname;
546 while (*++p) {
547 if (!isalnum(*p) && *p != '_')
548 goto badname;
549 }
550 if (isdigit(*--p)) {
551 badname:
552 error("bad device attachment name `%s'", name);
553 return (&errdeva);
554 }
555 deva = ht_lookup(devatab, name);
556 if (deva == NULL) {
557 deva = ecalloc(1, sizeof *deva);
558 deva->d_name = name;
559 deva->d_bsame = NULL;
560 deva->d_isdef = 0;
561 deva->d_devbase = NULL;
562 deva->d_atlist = NULL;
563 deva->d_attrs = NULL;
564 deva->d_ihead = NULL;
565 deva->d_ipp = &deva->d_ihead;
566 TAILQ_INSERT_TAIL(&alldevas, deva, d_next);
567 if (ht_insert(devatab, name, deva))
568 panic("getdeva(%s)", name);
569 }
570 return (deva);
571 }
572
573 /*
574 * Look up an attribute.
575 */
576 struct attr *
577 getattr(const char *name)
578 {
579 struct attr *a;
580
581 if ((a = ht_lookup(attrtab, name)) == NULL) {
582 error("undefined attribute `%s'", name);
583 a = &errattr;
584 }
585 return (a);
586 }
587
588 /*
589 * Recursively expand an attribute and its dependencies, checking for
590 * cycles, and invoking a callback for each attribute found.
591 */
592 void
593 expandattr(struct attr *a, void (*callback)(struct attr *))
594 {
595 struct nvlist *nv;
596 struct attr *dep;
597
598 if (a->a_expanding) {
599 error("circular dependency on attribute `%s'", a->a_name);
600 return;
601 }
602
603 a->a_expanding = 1;
604
605 /* First expand all of this attribute's dependencies. */
606 for (nv = a->a_deps; nv != NULL; nv = nv->nv_next) {
607 dep = nv->nv_ptr;
608 expandattr(dep, callback);
609 }
610
611 /* ...and now invoke the callback for ourself. */
612 if (callback != NULL)
613 (*callback)(a);
614
615 a->a_expanding = 0;
616 }
617
618 /*
619 * Set the major device number for a device, so that it can be used
620 * as a root/dumps "on" device in a configuration.
621 */
622 void
623 setmajor(struct devbase *d, int n)
624 {
625
626 if (d != &errdev && d->d_major != NODEV)
627 error("device `%s' is already major %d",
628 d->d_name, d->d_major);
629 else
630 d->d_major = n;
631 }
632
633 const char *
634 major2name(int maj)
635 {
636 struct devbase *dev;
637 struct devm *dm;
638
639 if (!do_devsw) {
640 TAILQ_FOREACH(dev, &allbases, d_next) {
641 if (dev->d_major == maj)
642 return (dev->d_name);
643 }
644 } else {
645 TAILQ_FOREACH(dm, &alldevms, dm_next) {
646 if (dm->dm_bmajor == maj)
647 return (dm->dm_name);
648 }
649 }
650 return (NULL);
651 }
652
653 int
654 dev2major(struct devbase *dev)
655 {
656 struct devm *dm;
657
658 if (!do_devsw)
659 return (dev->d_major);
660
661 TAILQ_FOREACH(dm, &alldevms, dm_next) {
662 if (strcmp(dm->dm_name, dev->d_name) == 0)
663 return (dm->dm_bmajor);
664 }
665 return (NODEV);
666 }
667
668 /*
669 * Make a string description of the device at maj/min.
670 */
671 static const char *
672 makedevstr(int maj, int min)
673 {
674 const char *devname;
675 char buf[32];
676
677 devname = major2name(maj);
678 if (devname == NULL)
679 (void)snprintf(buf, sizeof(buf), "<%d/%d>", maj, min);
680 else
681 (void)snprintf(buf, sizeof(buf), "%s%d%c", devname,
682 min / maxpartitions, (min % maxpartitions) + 'a');
683
684 return (intern(buf));
685 }
686
687 /*
688 * Map things like "ra0b" => makedev(major("ra"), 0*maxpartitions + 'b'-'a').
689 * Handle the case where the device number is given but there is no
690 * corresponding name, and map NULL to the default.
691 */
692 static int
693 resolve(struct nvlist **nvp, const char *name, const char *what,
694 struct nvlist *dflt, int part)
695 {
696 struct nvlist *nv;
697 struct devbase *dev;
698 const char *cp;
699 int maj, min, i, l;
700 int unit;
701 char buf[NAMESIZE];
702
703 if ((u_int)(part -= 'a') >= maxpartitions)
704 panic("resolve");
705 if ((nv = *nvp) == NULL) {
706 dev_t d = NODEV;
707 /*
708 * Apply default. Easiest to do this by number.
709 * Make sure to retain NODEVness, if this is dflt's disposition.
710 */
711 if (dflt->nv_int != NODEV) {
712 maj = major(dflt->nv_int);
713 min = ((minor(dflt->nv_int) / maxpartitions) *
714 maxpartitions) + part;
715 d = makedev(maj, min);
716 cp = makedevstr(maj, min);
717 } else
718 cp = NULL;
719 *nvp = nv = newnv(NULL, cp, NULL, d, NULL);
720 }
721 if (nv->nv_int != NODEV) {
722 /*
723 * By the numbers. Find the appropriate major number
724 * to make a name.
725 */
726 maj = major(nv->nv_int);
727 min = minor(nv->nv_int);
728 nv->nv_str = makedevstr(maj, min);
729 return (0);
730 }
731
732 if (nv->nv_str == NULL || nv->nv_str == s_qmark)
733 /*
734 * Wildcarded or unspecified; leave it as NODEV.
735 */
736 return (0);
737
738 /*
739 * The normal case: things like "ra2b". Check for partition
740 * suffix, remove it if there, and split into name ("ra") and
741 * unit (2).
742 */
743 l = i = strlen(nv->nv_str);
744 cp = &nv->nv_str[l];
745 if (l > 1 && *--cp >= 'a' && *cp < 'a' + maxpartitions &&
746 isdigit((unsigned char)cp[-1])) {
747 l--;
748 part = *cp - 'a';
749 }
750 cp = nv->nv_str;
751 if (split(cp, l, buf, sizeof buf, &unit)) {
752 error("%s: invalid %s device name `%s'", name, what, cp);
753 return (1);
754 }
755 dev = ht_lookup(devbasetab, intern(buf));
756 if (dev == NULL) {
757 error("%s: device `%s' does not exist", name, buf);
758 return (1);
759 }
760
761 /*
762 * Check for the magic network interface attribute, and
763 * don't bother making a device number.
764 */
765 if (has_attr(dev->d_attrs, s_ifnet)) {
766 nv->nv_int = NODEV;
767 nv->nv_ifunit = unit; /* XXX XXX XXX */
768 } else {
769 maj = dev2major(dev);
770 if (maj == NODEV) {
771 error("%s: can't make %s device from `%s'",
772 name, what, nv->nv_str);
773 return (1);
774 }
775 nv->nv_int = makedev(maj, unit * maxpartitions + part);
776 }
777
778 nv->nv_name = dev->d_name;
779 return (0);
780 }
781
782 /*
783 * Add a completed configuration to the list.
784 */
785 void
786 addconf(struct config *cf0)
787 {
788 struct config *cf;
789 const char *name;
790
791 name = cf0->cf_name;
792 cf = ecalloc(1, sizeof *cf);
793 if (ht_insert(cfhashtab, name, cf)) {
794 error("configuration `%s' already defined", name);
795 free(cf);
796 goto bad;
797 }
798 *cf = *cf0;
799
800 /*
801 * Resolve the root device.
802 */
803 if (cf->cf_root == NULL) {
804 error("%s: no root device specified", name);
805 goto bad;
806 }
807 if (cf->cf_root && cf->cf_root->nv_str != s_qmark) {
808 struct nvlist *nv;
809 nv = cf->cf_root;
810 if (resolve(&cf->cf_root, name, "root", nv, 'a'))
811 goto bad;
812 }
813
814 /*
815 * Resolve the dump device.
816 */
817 if (cf->cf_dump == NULL || cf->cf_dump->nv_str == s_qmark) {
818 /*
819 * Wildcarded dump device is equivalent to unspecified.
820 */
821 cf->cf_dump = NULL;
822 } else if (cf->cf_dump->nv_str == s_none) {
823 /*
824 * Operator has requested that no dump device should be
825 * configured; do nothing.
826 */
827 } else {
828 if (resolve(&cf->cf_dump, name, "dumps", cf->cf_dump, 'b'))
829 goto bad;
830 }
831
832 /* Wildcarded fstype is `unspecified'. */
833 if (cf->cf_fstype == s_qmark)
834 cf->cf_fstype = NULL;
835
836 TAILQ_INSERT_TAIL(&allcf, cf, cf_next);
837 return;
838 bad:
839 nvfreel(cf0->cf_root);
840 nvfreel(cf0->cf_dump);
841 }
842
843 void
844 setconf(struct nvlist **npp, const char *what, struct nvlist *v)
845 {
846
847 if (*npp != NULL) {
848 error("duplicate %s specification", what);
849 nvfreel(v);
850 } else
851 *npp = v;
852 }
853
854 void
855 setfstype(const char **fstp, const char *v)
856 {
857
858 if (*fstp != NULL) {
859 error("multiple fstype specifications");
860 return;
861 }
862
863 if (v != s_qmark && OPT_FSOPT(v)) {
864 error("\"%s\" is not a configured file system", v);
865 return;
866 }
867
868 *fstp = v;
869 }
870
871 static struct devi *
872 newdevi(const char *name, int unit, struct devbase *d)
873 {
874 struct devi *i;
875
876 i = ecalloc(1, sizeof *i);
877 i->i_name = name;
878 i->i_unit = unit;
879 i->i_base = d;
880 i->i_bsame = NULL;
881 i->i_asame = NULL;
882 i->i_alias = NULL;
883 i->i_at = NULL;
884 i->i_pspec = NULL;
885 i->i_atdeva = NULL;
886 i->i_locs = NULL;
887 i->i_cfflags = 0;
888 i->i_lineno = currentline();
889 i->i_srcfile = yyfile;
890 i->i_active = DEVI_ORPHAN; /* Proper analysis comes later */
891 i->i_level = devilevel;
892 if (unit >= d->d_umax)
893 d->d_umax = unit + 1;
894 return (i);
895 }
896
897 /*
898 * Add the named device as attaching to the named attribute (or perhaps
899 * another device instead) plus unit number.
900 */
901 void
902 adddev(const char *name, const char *at, struct nvlist *loclist, int flags)
903 {
904 struct devi *i; /* the new instance */
905 struct pspec *p; /* and its pspec */
906 struct attr *attr; /* attribute that allows attach */
907 struct devbase *ib; /* i->i_base */
908 struct devbase *ab; /* not NULL => at another dev */
909 struct nvlist *nv;
910 struct deva *iba; /* devbase attachment used */
911 const char *cp;
912 int atunit;
913 char atbuf[NAMESIZE];
914 int hit;
915
916 ab = NULL;
917 iba = NULL;
918 if (at == NULL) {
919 /* "at root" */
920 p = NULL;
921 if ((i = getdevi(name)) == NULL)
922 goto bad;
923 /*
924 * Must warn about i_unit > 0 later, after taking care of
925 * the STAR cases (we could do non-star's here but why
926 * bother?). Make sure this device can be at root.
927 */
928 ib = i->i_base;
929 hit = 0;
930 for (iba = ib->d_ahead; iba != NULL; iba = iba->d_bsame)
931 if (onlist(iba->d_atlist, NULL)) {
932 hit = 1;
933 break;
934 }
935 if (!hit) {
936 error("`%s' cannot attach to the root", ib->d_name);
937 i->i_active = DEVI_BROKEN;
938 goto bad;
939 }
940 attr = &errattr; /* a convenient "empty" attr */
941 } else {
942 if (split(at, strlen(at), atbuf, sizeof atbuf, &atunit)) {
943 error("invalid attachment name `%s'", at);
944 /* (void)getdevi(name); -- ??? */
945 goto bad;
946 }
947 if ((i = getdevi(name)) == NULL)
948 goto bad;
949 ib = i->i_base;
950
951 /*
952 * Devices can attach to two types of things: Attributes,
953 * and other devices (which have the appropriate attributes
954 * to allow attachment).
955 *
956 * (1) If we're attached to an attribute, then we don't need
957 * look at the parent base device to see what attributes
958 * it has, and make sure that we can attach to them.
959 *
960 * (2) If we're attached to a real device (i.e. named in
961 * the config file), we want to remember that so that
962 * at cross-check time, if the device we're attached to
963 * is missing but other devices which also provide the
964 * attribute are present, we don't get a false "OK."
965 *
966 * (3) If the thing we're attached to is an attribute
967 * but is actually named in the config file, we still
968 * have to remember its devbase.
969 */
970 cp = intern(atbuf);
971
972 /* Figure out parent's devbase, to satisfy case (3). */
973 ab = ht_lookup(devbasetab, cp);
974
975 /* Find out if it's an attribute. */
976 attr = ht_lookup(attrtab, cp);
977
978 /* Make sure we're _really_ attached to the attr. Case (1). */
979 if (attr != NULL && onlist(attr->a_devs, ib))
980 goto findattachment;
981
982 /*
983 * Else a real device, and not just an attribute. Case (2).
984 *
985 * Have to work a bit harder to see whether we have
986 * something like "tg0 at esp0" (where esp is merely
987 * not an attribute) or "tg0 at nonesuch0" (where
988 * nonesuch is not even a device).
989 */
990 if (ab == NULL) {
991 error("%s at %s: `%s' unknown",
992 name, at, atbuf);
993 i->i_active = DEVI_BROKEN;
994 goto bad;
995 }
996
997 /*
998 * See if the named parent carries an attribute
999 * that allows it to supervise device ib.
1000 */
1001 for (nv = ab->d_attrs; nv != NULL; nv = nv->nv_next) {
1002 attr = nv->nv_ptr;
1003 if (onlist(attr->a_devs, ib))
1004 goto findattachment;
1005 }
1006 error("`%s' cannot attach to `%s'", ib->d_name, atbuf);
1007 i->i_active = DEVI_BROKEN;
1008 goto bad;
1009
1010 findattachment:
1011 /*
1012 * Find the parent spec. If a matching one has not yet been
1013 * created, create one.
1014 */
1015 p = getpspec(attr, ab, atunit);
1016 p->p_devs = newnv(NULL, NULL, i, 0, p->p_devs);
1017
1018 /* find out which attachment it uses */
1019 hit = 0;
1020 for (iba = ib->d_ahead; iba != NULL; iba = iba->d_bsame)
1021 if (onlist(iba->d_atlist, attr)) {
1022 hit = 1;
1023 break;
1024 }
1025 if (!hit)
1026 panic("adddev: can't figure out attachment");
1027 }
1028 if ((i->i_locs = fixloc(name, attr, loclist)) == NULL) {
1029 i->i_active = DEVI_BROKEN;
1030 goto bad;
1031 }
1032 i->i_at = at;
1033 i->i_pspec = p;
1034 i->i_atdeva = iba;
1035 i->i_cfflags = flags;
1036
1037 *iba->d_ipp = i;
1038 iba->d_ipp = &i->i_asame;
1039
1040 /* all done, fall into ... */
1041 bad:
1042 nvfreel(loclist);
1043 return;
1044 }
1045
1046 void
1047 deldevi(const char *name, const char *at)
1048 {
1049 struct devi *firsti, *i;
1050 struct devbase *d;
1051 int unit;
1052 char base[NAMESIZE];
1053
1054 if (split(name, strlen(name), base, sizeof base, &unit)) {
1055 error("invalid device name `%s'", name);
1056 return;
1057 }
1058 d = ht_lookup(devbasetab, intern(base));
1059 if (d == NULL) {
1060 error("%s: unknown device `%s'", name, base);
1061 return;
1062 }
1063 if (d->d_ispseudo) {
1064 error("%s: %s is a pseudo-device", name, base);
1065 return;
1066 }
1067 if ((firsti = ht_lookup(devitab, name)) == NULL) {
1068 error("`%s' not defined", name);
1069 return;
1070 }
1071 if (at == NULL && firsti->i_at == NULL) {
1072 /* 'at root' */
1073 remove_devi(firsti);
1074 return;
1075 } else if (at != NULL)
1076 for (i = firsti; i != NULL; i = i->i_alias)
1077 if (strcmp(at, i->i_at) == 0) {
1078 remove_devi(i);
1079 return;
1080 }
1081 error("`%s' at `%s' not found", name, at ? at : "root");
1082 }
1083
1084 static void
1085 remove_devi(struct devi *i)
1086 {
1087 struct devbase *d = i->i_base;
1088 struct devi *f, *j, **ppi;
1089 struct deva *iba;
1090
1091 f = ht_lookup(devitab, i->i_name);
1092
1093 /*
1094 * We have the device instance, i.
1095 * We have to:
1096 * - delete the alias
1097 *
1098 * If the devi was an alias of an already listed devi, all is
1099 * good we don't have to do more.
1100 * If it was the first alias, we have to replace i's entry in
1101 * d's list by its first alias.
1102 * If it was the only entry, we must remove i's entry from d's
1103 * list.
1104 */
1105 if (i != f) {
1106 for (j = f; j->i_alias != i; j = j->i_alias);
1107 j->i_alias = i->i_alias;
1108 } else {
1109 if (i->i_alias == NULL) {
1110 /* No alias, must unlink the entry from devitab */
1111 ht_remove(devitab, i->i_name);
1112 j = i->i_bsame;
1113 } else {
1114 /* Or have the first alias replace i in d's list */
1115 i->i_alias->i_bsame = i->i_bsame;
1116 j = i->i_alias;
1117 if (i == f)
1118 ht_replace(devitab, i->i_name, i->i_alias);
1119 }
1120
1121 /*
1122 * - remove/replace the instance from the devbase's list
1123 *
1124 * A double-linked list would make this much easier. Oh, well,
1125 * what is done is done.
1126 */
1127 for (ppi = &d->d_ihead;
1128 *ppi != NULL && *ppi != i && (*ppi)->i_bsame != i;
1129 ppi = &(*ppi)->i_bsame);
1130 if (*ppi == NULL)
1131 panic("deldev: dev (%s) doesn't list the devi"
1132 " (%s at %s)", d->d_name, i->i_name, i->i_at);
1133 f = *ppi;
1134 if (f == i)
1135 /* That implies d->d_ihead == i */
1136 *ppi = j;
1137 else
1138 (*ppi)->i_bsame = j;
1139 if (d->d_ipp == &i->i_bsame) {
1140 if (i->i_alias == NULL) {
1141 if (f == i)
1142 d->d_ipp = &d->d_ihead;
1143 else
1144 d->d_ipp = &f->i_bsame;
1145 } else
1146 d->d_ipp = &i->i_alias->i_bsame;
1147 }
1148 }
1149 /*
1150 * - delete the attachment instance
1151 */
1152 iba = i->i_atdeva;
1153 for (ppi = &iba->d_ihead;
1154 *ppi != NULL && *ppi != i && (*ppi)->i_asame != i;
1155 ppi = &(*ppi)->i_asame);
1156 if (*ppi == NULL)
1157 panic("deldev: deva (%s) doesn't list the devi (%s)",
1158 iba->d_name, i->i_name);
1159 f = *ppi;
1160 if (f == i)
1161 /* That implies iba->d_ihead == i */
1162 *ppi = i->i_asame;
1163 else
1164 (*ppi)->i_asame = i->i_asame;
1165 if (iba->d_ipp == &i->i_asame) {
1166 if (f == i)
1167 iba->d_ipp = &iba->d_ihead;
1168 else
1169 iba->d_ipp = &f->i_asame;
1170 }
1171 /*
1172 * - delete the pspec
1173 */
1174 if (i->i_pspec) {
1175 struct pspec *p = i->i_pspec;
1176 struct nvlist *nv, *onv;
1177
1178 /* Double-linked nvlist anyone? */
1179 for (nv = p->p_devs; nv->nv_ptr != NULL; nv = nv->nv_next) {
1180 if (nv->nv_next && nv->nv_next->nv_ptr == i) {
1181 onv = nv->nv_next;
1182 nv->nv_next = onv->nv_next;
1183 nvfree(onv);
1184 break;
1185 } if (nv->nv_ptr == i) {
1186 /* nv is p->p_devs in that case */
1187 p->p_devs = nv->nv_next;
1188 nvfree(nv);
1189 break;
1190 }
1191 }
1192 if (p->p_devs == NULL)
1193 TAILQ_REMOVE(&allpspecs, p, p_list);
1194 }
1195 /*
1196 * - delete the alldevi entry
1197 */
1198 TAILQ_REMOVE(&alldevi, i, i_next);
1199 ndevi--;
1200 /*
1201 * Put it in deaddevitab
1202 *
1203 * Each time a devi is removed, devilevel is increased so that later on
1204 * it is possible to tell if an instance was added before or after the
1205 * removal of its parent.
1206 *
1207 * For active instances, i_level contains the number of devi removed so
1208 * far, and for dead devis, it contains its index.
1209 */
1210 i->i_level = devilevel++;
1211 i->i_alias = NULL;
1212 f = ht_lookup(deaddevitab, i->i_name);
1213 if (f == NULL) {
1214 if (ht_insert(deaddevitab, i->i_name, i))
1215 panic("remove_devi(%s) - can't add to deaddevitab",
1216 i->i_name);
1217 } else {
1218 for (j = f; j->i_alias != NULL; j = j->i_alias);
1219 j->i_alias = i;
1220 }
1221 /*
1222 * - reconstuct d->d_umax
1223 */
1224 d->d_umax = 0;
1225 for (i = d->d_ihead; i != NULL; i = i->i_bsame)
1226 if (i->i_unit >= d->d_umax)
1227 d->d_umax = i->i_unit + 1;
1228 }
1229
1230 void
1231 deldeva(const char *at)
1232 {
1233 int unit;
1234 const char *cp;
1235 struct devbase *d, *ad;
1236 struct devi *i, *j;
1237 struct attr *a;
1238 struct pspec *p;
1239 struct nvlist *nv, *stack = NULL;
1240
1241 if (at == NULL) {
1242 TAILQ_FOREACH(i, &alldevi, i_next)
1243 if (i->i_at == NULL)
1244 stack = newnv(NULL, NULL, i, 0, stack);
1245 } else {
1246 int l;
1247
1248 l = strlen(at) - 1;
1249 if (at[l] == '?' || isdigit((unsigned char)at[l])) {
1250 char base[NAMESIZE];
1251
1252 if (split(at, l+1, base, sizeof base, &unit)) {
1253 error("invalid attachment name `%s'", at);
1254 return;
1255 }
1256 cp = intern(base);
1257 } else {
1258 cp = intern(at);
1259 unit = STAR;
1260 }
1261
1262 ad = ht_lookup(devbasetab, cp);
1263 a = ht_lookup(attrtab, cp);
1264 if (a == NULL) {
1265 error("unknown attachment attribute or device `%s'",
1266 cp);
1267 return;
1268 }
1269 if (!a->a_iattr) {
1270 error("plain attribute `%s' cannot have children",
1271 a->a_name);
1272 return;
1273 }
1274
1275 /*
1276 * remove_devi() makes changes to the devbase's list and the
1277 * alias list, * so the actual deletion of the instances must
1278 * be delayed.
1279 */
1280 for (nv = a->a_devs; nv != NULL; nv = nv->nv_next) {
1281 d = nv->nv_ptr;
1282 for (i = d->d_ihead; i != NULL; i = i->i_bsame)
1283 for (j = i; j != NULL; j = j->i_alias) {
1284 /* Ignore devices at root */
1285 if (j->i_at == NULL)
1286 continue;
1287 p = j->i_pspec;
1288 /*
1289 * There are three cases:
1290 *
1291 * 1. unit is not STAR. Consider 'at'
1292 * to be explicit, even if it
1293 * references an interface
1294 * attribute.
1295 *
1296 * 2. unit is STAR and 'at' references
1297 * a real device. Look for pspec
1298 * that have a matching p_atdev
1299 * field.
1300 *
1301 * 3. unit is STAR and 'at' references
1302 * an interface attribute. Look
1303 * for pspec that have a matching
1304 * p_iattr field.
1305 */
1306 if ((unit != STAR && /* Case */
1307 !strcmp(j->i_at, at)) || /* 1 */
1308 (unit == STAR &&
1309 ((ad != NULL && /* Case */
1310 p->p_atdev == ad) || /* 2 */
1311 (ad == NULL && /* Case */
1312 p->p_iattr == a)))) /* 3 */
1313 stack = newnv(NULL, NULL, j, 0,
1314 stack);
1315 }
1316 }
1317 }
1318
1319 for (nv = stack; nv != NULL; nv = nv->nv_next)
1320 remove_devi(nv->nv_ptr);
1321 }
1322
1323 void
1324 deldev(const char *name)
1325 {
1326 int l;
1327 struct devi *firsti, *i;
1328 struct nvlist *nv, *stack = NULL;
1329
1330 l = strlen(name) - 1;
1331 if (name[l] == '*' || isdigit((unsigned char)name[l])) {
1332 /* `no mydev0' or `no mydev*' */
1333 firsti = ht_lookup(devitab, name);
1334 if (firsti == NULL) {
1335 error("unknown instance %s", name);
1336 return;
1337 }
1338 for (i = firsti; i != NULL; i = i->i_alias)
1339 stack = newnv(NULL, NULL, i, 0, stack);
1340 } else {
1341 struct devbase *d = ht_lookup(devbasetab, name);
1342
1343 if (d == NULL) {
1344 error("unknown device %s", name);
1345 return;
1346 }
1347
1348 for (firsti = d->d_ihead; firsti != NULL;
1349 firsti = firsti->i_bsame)
1350 for (i = firsti; i != NULL; i = i->i_alias)
1351 stack = newnv(NULL, NULL, i, 0, stack);
1352 }
1353
1354 for (nv = stack; nv != NULL; nv = nv->nv_next)
1355 remove_devi(nv->nv_ptr);
1356 }
1357
1358 void
1359 addpseudo(const char *name, int number)
1360 {
1361 struct devbase *d;
1362 struct devi *i;
1363
1364 d = ht_lookup(devbasetab, name);
1365 if (d == NULL) {
1366 error("undefined pseudo-device %s", name);
1367 return;
1368 }
1369 if (!d->d_ispseudo) {
1370 error("%s is a real device, not a pseudo-device", name);
1371 return;
1372 }
1373 if (ht_lookup(devitab, name) != NULL) {
1374 error("`%s' already defined", name);
1375 return;
1376 }
1377 i = newdevi(name, number - 1, d); /* foo 16 => "foo0..foo15" */
1378 if (ht_insert(devitab, name, i))
1379 panic("addpseudo(%s)", name);
1380 /* Useful to retrieve the instance from the devbase */
1381 d->d_ihead = i;
1382 i->i_active = DEVI_ACTIVE;
1383 TAILQ_INSERT_TAIL(&allpseudo, i, i_next);
1384 }
1385
1386 void
1387 delpseudo(const char *name)
1388 {
1389 struct devbase *d;
1390 struct devi *i;
1391
1392 d = ht_lookup(devbasetab, name);
1393 if (d == NULL) {
1394 error("undefined pseudo-device %s", name);
1395 return;
1396 }
1397 if (!d->d_ispseudo) {
1398 error("%s is a real device, not a pseudo-device", name);
1399 return;
1400 }
1401 if ((i = ht_lookup(devitab, name)) == NULL) {
1402 error("`%s' not defined", name);
1403 return;
1404 }
1405 d->d_umax = 0; /* clear neads-count entries */
1406 d->d_ihead = NULL; /* make sure it won't be considered active */
1407 TAILQ_REMOVE(&allpseudo, i, i_next);
1408 if (ht_remove(devitab, name))
1409 panic("delpseudo(%s) - can't remove from devitab", name);
1410 if (ht_insert(deaddevitab, name, i))
1411 panic("delpseudo(%s) - can't add to deaddevitab", name);
1412 }
1413
1414 void
1415 adddevm(const char *name, int cmajor, int bmajor, struct nvlist *options)
1416 {
1417 struct devm *dm;
1418
1419 if (cmajor < -1 || cmajor >= 4096) {
1420 error("character major %d is invalid", cmajor);
1421 nvfreel(options);
1422 return;
1423 }
1424
1425 if (bmajor < -1 || bmajor >= 4096) {
1426 error("block major %d is invalid", bmajor);
1427 nvfreel(options);
1428 return;
1429 }
1430 if (cmajor == -1 && bmajor == -1) {
1431 error("both character/block majors are not specified");
1432 nvfreel(options);
1433 return;
1434 }
1435
1436 dm = ecalloc(1, sizeof(*dm));
1437 dm->dm_srcfile = yyfile;
1438 dm->dm_srcline = currentline();
1439 dm->dm_name = name;
1440 dm->dm_cmajor = cmajor;
1441 dm->dm_bmajor = bmajor;
1442 dm->dm_opts = options;
1443
1444 TAILQ_INSERT_TAIL(&alldevms, dm, dm_next);
1445
1446 maxcdevm = MAX(maxcdevm, dm->dm_cmajor);
1447 maxbdevm = MAX(maxbdevm, dm->dm_bmajor);
1448 }
1449
1450 int
1451 fixdevis(void)
1452 {
1453 struct devi *i;
1454 int error = 0;
1455
1456 TAILQ_FOREACH(i, &alldevi, i_next)
1457 if (i->i_active == DEVI_ACTIVE)
1458 selectbase(i->i_base, i->i_atdeva);
1459 else if (i->i_active == DEVI_ORPHAN) {
1460 /*
1461 * At this point, we can't have instances for which
1462 * i_at or i_pspec are NULL.
1463 */
1464 ++error;
1465 xerror(i->i_srcfile, i->i_lineno,
1466 "`%s at %s' is orphaned (%s `%s' found)",
1467 i->i_name, i->i_at, i->i_pspec->p_atunit == WILD ?
1468 "nothing matching" : "no", i->i_at);
1469 } else if (vflag && i->i_active == DEVI_IGNORED)
1470 xwarn(i->i_srcfile, i->i_lineno, "ignoring explicitely"
1471 " orphaned instance `%s at %s'", i->i_name,
1472 i->i_at);
1473
1474 if (error)
1475 return error;
1476
1477 TAILQ_FOREACH(i, &allpseudo, i_next)
1478 if (i->i_active == DEVI_ACTIVE)
1479 selectbase(i->i_base, NULL);
1480 return 0;
1481 }
1482
1483 /*
1484 * Look up a parent spec, creating a new one if it does not exist.
1485 */
1486 static struct pspec *
1487 getpspec(struct attr *attr, struct devbase *ab, int atunit)
1488 {
1489 struct pspec *p;
1490
1491 TAILQ_FOREACH(p, &allpspecs, p_list) {
1492 if (p->p_iattr == attr &&
1493 p->p_atdev == ab &&
1494 p->p_atunit == atunit)
1495 return (p);
1496 }
1497
1498 p = ecalloc(1, sizeof(*p));
1499
1500 p->p_iattr = attr;
1501 p->p_atdev = ab;
1502 p->p_atunit = atunit;
1503 p->p_inst = npspecs++;
1504 p->p_active = 0;
1505
1506 TAILQ_INSERT_TAIL(&allpspecs, p, p_list);
1507
1508 return (p);
1509 }
1510
1511 /*
1512 * Define a new instance of a specific device.
1513 */
1514 static struct devi *
1515 getdevi(const char *name)
1516 {
1517 struct devi *i, *firsti;
1518 struct devbase *d;
1519 int unit;
1520 char base[NAMESIZE];
1521
1522 if (split(name, strlen(name), base, sizeof base, &unit)) {
1523 error("invalid device name `%s'", name);
1524 return (NULL);
1525 }
1526 d = ht_lookup(devbasetab, intern(base));
1527 if (d == NULL) {
1528 error("%s: unknown device `%s'", name, base);
1529 return (NULL);
1530 }
1531 if (d->d_ispseudo) {
1532 error("%s: %s is a pseudo-device", name, base);
1533 return (NULL);
1534 }
1535 firsti = ht_lookup(devitab, name);
1536 i = newdevi(name, unit, d);
1537 if (firsti == NULL) {
1538 if (ht_insert(devitab, name, i))
1539 panic("getdevi(%s)", name);
1540 *d->d_ipp = i;
1541 d->d_ipp = &i->i_bsame;
1542 } else {
1543 while (firsti->i_alias)
1544 firsti = firsti->i_alias;
1545 firsti->i_alias = i;
1546 }
1547 TAILQ_INSERT_TAIL(&alldevi, i, i_next);
1548 ndevi++;
1549 return (i);
1550 }
1551
1552 static const char *
1553 concat(const char *name, int c)
1554 {
1555 int len;
1556 char buf[NAMESIZE];
1557
1558 len = strlen(name);
1559 if (len + 2 > sizeof(buf)) {
1560 error("device name `%s%c' too long", name, c);
1561 len = sizeof(buf) - 2;
1562 }
1563 memmove(buf, name, len);
1564 buf[len] = c;
1565 buf[len + 1] = 0;
1566 return (intern(buf));
1567 }
1568
1569 const char *
1570 starref(const char *name)
1571 {
1572
1573 return (concat(name, '*'));
1574 }
1575
1576 const char *
1577 wildref(const char *name)
1578 {
1579
1580 return (concat(name, '?'));
1581 }
1582
1583 /*
1584 * Split a name like "foo0" into base name (foo) and unit number (0).
1585 * Return 0 on success. To make this useful for names like "foo0a",
1586 * the length of the "foo0" part is one of the arguments.
1587 */
1588 static int
1589 split(const char *name, size_t nlen, char *base, size_t bsize, int *aunit)
1590 {
1591 const char *cp;
1592 int c, l;
1593
1594 l = nlen;
1595 if (l < 2 || l >= bsize || isdigit((unsigned char)*name))
1596 return (1);
1597 c = (u_char)name[--l];
1598 if (!isdigit(c)) {
1599 if (c == '*')
1600 *aunit = STAR;
1601 else if (c == '?')
1602 *aunit = WILD;
1603 else
1604 return (1);
1605 } else {
1606 cp = &name[l];
1607 while (isdigit((unsigned char)cp[-1]))
1608 l--, cp--;
1609 *aunit = atoi(cp);
1610 }
1611 memmove(base, name, l);
1612 base[l] = 0;
1613 return (0);
1614 }
1615
1616 void
1617 selectattr(struct attr *a)
1618 {
1619
1620 (void)ht_insert(selecttab, a->a_name, (char *)a->a_name);
1621 }
1622
1623 /*
1624 * We have an instance of the base foo, so select it and all its
1625 * attributes for "optional foo".
1626 */
1627 static void
1628 selectbase(struct devbase *d, struct deva *da)
1629 {
1630 struct attr *a;
1631 struct nvlist *nv;
1632
1633 (void)ht_insert(selecttab, d->d_name, (char *)d->d_name);
1634 for (nv = d->d_attrs; nv != NULL; nv = nv->nv_next) {
1635 a = nv->nv_ptr;
1636 expandattr(a, selectattr);
1637 }
1638 if (da != NULL) {
1639 (void)ht_insert(selecttab, da->d_name, (char *)da->d_name);
1640 for (nv = da->d_attrs; nv != NULL; nv = nv->nv_next) {
1641 a = nv->nv_ptr;
1642 expandattr(a, selectattr);
1643 }
1644 }
1645 }
1646
1647 /*
1648 * Is the given pointer on the given list of pointers?
1649 */
1650 static int
1651 onlist(struct nvlist *nv, void *ptr)
1652 {
1653 for (; nv != NULL; nv = nv->nv_next)
1654 if (nv->nv_ptr == ptr)
1655 return (1);
1656 return (0);
1657 }
1658
1659 static char *
1660 extend(char *p, const char *name)
1661 {
1662 int l;
1663
1664 l = strlen(name);
1665 memmove(p, name, l);
1666 p += l;
1667 *p++ = ',';
1668 *p++ = ' ';
1669 return (p);
1670 }
1671
1672 /*
1673 * Check that we got all required locators, and default any that are
1674 * given as "?" and have defaults. Return 0 on success.
1675 */
1676 static const char **
1677 fixloc(const char *name, struct attr *attr, struct nvlist *got)
1678 {
1679 struct nvlist *m, *n;
1680 int ord;
1681 const char **lp;
1682 int nmissing, nextra, nnodefault;
1683 char *mp, *ep, *ndp;
1684 char missing[1000], extra[1000], nodefault[1000];
1685 static const char *nullvec[1];
1686
1687 /*
1688 * Look for all required locators, and number the given ones
1689 * according to the required order. While we are numbering,
1690 * set default values for defaulted locators.
1691 */
1692 if (attr->a_loclen == 0) /* e.g., "at root" */
1693 lp = nullvec;
1694 else
1695 lp = emalloc((attr->a_loclen + 1) * sizeof(const char *));
1696 for (n = got; n != NULL; n = n->nv_next)
1697 n->nv_int = -1;
1698 nmissing = 0;
1699 mp = missing;
1700 /* yes, this is O(mn), but m and n should be small */
1701 for (ord = 0, m = attr->a_locs; m != NULL; m = m->nv_next, ord++) {
1702 for (n = got; n != NULL; n = n->nv_next) {
1703 if (n->nv_name == m->nv_name) {
1704 n->nv_int = ord;
1705 break;
1706 }
1707 }
1708 if (n == NULL && m->nv_int == 0) {
1709 nmissing++;
1710 mp = extend(mp, m->nv_name);
1711 }
1712 lp[ord] = m->nv_str;
1713 }
1714 if (ord != attr->a_loclen)
1715 panic("fixloc");
1716 lp[ord] = NULL;
1717 nextra = 0;
1718 ep = extra;
1719 nnodefault = 0;
1720 ndp = nodefault;
1721 for (n = got; n != NULL; n = n->nv_next) {
1722 if (n->nv_int >= 0) {
1723 if (n->nv_str != NULL)
1724 lp[n->nv_int] = n->nv_str;
1725 else if (lp[n->nv_int] == NULL) {
1726 nnodefault++;
1727 ndp = extend(ndp, n->nv_name);
1728 }
1729 } else {
1730 nextra++;
1731 ep = extend(ep, n->nv_name);
1732 }
1733 }
1734 if (nextra) {
1735 ep[-2] = 0; /* kill ", " */
1736 error("%s: extraneous locator%s: %s",
1737 name, nextra > 1 ? "s" : "", extra);
1738 }
1739 if (nmissing) {
1740 mp[-2] = 0;
1741 error("%s: must specify %s", name, missing);
1742 }
1743 if (nnodefault) {
1744 ndp[-2] = 0;
1745 error("%s: cannot wildcard %s", name, nodefault);
1746 }
1747 if (nmissing || nnodefault) {
1748 free(lp);
1749 lp = NULL;
1750 }
1751 return (lp);
1752 }
1753
1754 void
1755 setversion(int newver)
1756 {
1757 if (newver > CONFIG_VERSION)
1758 error("your sources require a newer version of config(1) "
1759 "-- please rebuild it.");
1760 else if (newver < CONFIG_MINVERSION)
1761 error("your sources are out of date -- please update.");
1762 else
1763 version = newver;
1764 }
1765