1 /* $NetBSD: autoconf.h,v 1.12 2001/10/05 15:27:56 pooka Exp $ */ 2 3 /*- 4 * Copyright (c) 1997, 1998 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Paul Kranenburg. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the NetBSD 21 * Foundation, Inc. and its contributors. 22 * 4. Neither the name of The NetBSD Foundation nor the names of its 23 * contributors may be used to endorse or promote products derived 24 * from this software without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 27 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 28 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 29 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 30 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 31 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 32 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 33 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 34 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 35 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 36 * POSSIBILITY OF SUCH DAMAGE. 37 */ 38 39 /* 40 * Copyright (c) 1992, 1993 41 * The Regents of the University of California. All rights reserved. 42 * 43 * This software was developed by the Computer Systems Engineering group 44 * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and 45 * contributed to Berkeley. 46 * 47 * All advertising materials mentioning features or use of this software 48 * must display the following acknowledgement: 49 * This product includes software developed by the University of 50 * California, Lawrence Berkeley Laboratory. 51 * 52 * Redistribution and use in source and binary forms, with or without 53 * modification, are permitted provided that the following conditions 54 * are met: 55 * 1. Redistributions of source code must retain the above copyright 56 * notice, this list of conditions and the following disclaimer. 57 * 2. Redistributions in binary form must reproduce the above copyright 58 * notice, this list of conditions and the following disclaimer in the 59 * documentation and/or other materials provided with the distribution. 60 * 3. All advertising materials mentioning features or use of this software 61 * must display the following acknowledgement: 62 * This product includes software developed by the University of 63 * California, Berkeley and its contributors. 64 * 4. Neither the name of the University nor the names of its contributors 65 * may be used to endorse or promote products derived from this software 66 * without specific prior written permission. 67 * 68 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 69 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 70 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 71 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 72 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 73 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 74 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 75 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 76 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 77 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 78 * SUCH DAMAGE. 79 * 80 * @(#)autoconf.h 8.2 (Berkeley) 9/30/93 81 */ 82 83 /* 84 * Autoconfiguration information. 85 */ 86 87 #include <machine/bus.h> 88 #include <sparc64/dev/upavar.h> 89 #include <dev/sbus/sbusvar.h> 90 91 /* This is used to map device classes to IPLs */ 92 struct intrmap { 93 char *in_class; 94 int in_lev; 95 }; 96 extern struct intrmap intrmap[]; 97 98 /* The "mainbus" on ultra desktops is actually the UPA bus. We need to 99 * separate this from peripheral buses like SBUS and PCI because each bus may 100 * have different ways of encoding properties, such as "reg" and "interrupts". 101 * 102 * Eventually I'll create a real UPA bus module to allow servers with multiple 103 * peripheral buses and things like FHC bus systems. 104 */ 105 106 /* 107 * Attach arguments presented by mainbus_attach() 108 * 109 * Large fields first followed by smaller ones to minimize stack space used. 110 */ 111 struct mainbus_attach_args { 112 bus_space_tag_t ma_bustag; /* parent bus tag */ 113 bus_dma_tag_t ma_dmatag; 114 char *ma_name; /* PROM node name */ 115 struct upa_reg *ma_reg; /* "reg" properties */ 116 u_int *ma_address; /* "address" properties -- 32 bits */ 117 u_int *ma_interrupts; /* "interrupts" properties */ 118 int ma_upaid; /* UPA bus ID */ 119 int ma_node; /* PROM handle */ 120 int ma_nreg; /* Counts for those properties */ 121 int ma_naddress; 122 int ma_ninterrupts; 123 int ma_pri; /* priority (IPL) */ 124 }; 125 126 /* 127 * length; the others convert or make some other guarantee. 128 */ 129 long PROM_getproplen __P((int node, char *name)); 130 int PROM_getprop __P((int, char *, size_t, int *, void **)); 131 char *PROM_getpropstring __P((int node, char *name)); 132 int PROM_getpropint __P((int node, char *name, int deflt)); 133 134 /* Frequently used options node */ 135 extern int optionsnode; 136 137 /* new interfaces: */ 138 char *PROM_getpropstringA __P((int, char *, char *)); 139 140 /* 141 * The matchbyname function is useful in drivers that are matched 142 * by romaux name, i.e., all `mainbus attached' devices. It expects 143 * its aux pointer to point to a pointer to the name (the address of 144 * a romaux structure suffices, for instance). (OBSOLETE) 145 */ 146 struct device; 147 struct cfdata; 148 int matchbyname __P((struct device *, struct cfdata *cf, void *aux)); 149 150 /* 151 * `clockfreq' produces a printable representation of a clock frequency 152 * (this is just a frill). 153 */ 154 char *clockfreq __P((long freq)); 155 156 /* Openprom V2 style boot path */ 157 struct bootpath { 158 char name[16]; /* name of this node */ 159 int val[3]; /* up to three optional values */ 160 struct device *dev; /* device that recognised this component */ 161 }; 162 struct bootpath *bootpath_store __P((int, struct bootpath *)); 163 int sd_crazymap __P((int)); 164 165 /* Parse a disk string into a dev_t, return device struct pointer */ 166 struct device *parsedisk __P((char *, int, int, dev_t *)); 167 168 /* Establish a mountroot_hook, for benefit of floppy drive, mostly. */ 169 void mountroot_hook_establish __P((void (*) __P((struct device *)), 170 struct device *)); 171 172 void bootstrap __P((int)); 173 int firstchild __P((int)); 174 int nextsibling __P((int)); 175 void callrom __P((void)); 176 struct device *getdevunit __P((char *, int)); 177 void *findzs __P((int)); 178 void rominterpret __P((char *)); 179 int romgetcursoraddr __P((int **, int **)); 180 int findroot __P((void)); 181 int findnode __P((int, const char *)); 182 int node_has_property __P((int, const char *)); 183 184