xref: /netbsd/sys/arch/sparc64/include/autoconf.h (revision c4a72b64)
1 /*	$NetBSD: autoconf.h,v 1.13 2002/10/20 15:53:19 martin 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 <dev/sbus/sbusvar.h>
89 
90 /* This is used to map device classes to IPLs */
91 struct intrmap {
92 	char	*in_class;
93 	int	in_lev;
94 };
95 extern struct intrmap intrmap[];
96 
97 /* The "mainbus" on ultra desktops is actually the UPA bus.  We need to
98  * separate this from peripheral buses like SBUS and PCI because each bus may
99  * have different ways of encoding properties, such as "reg" and "interrupts".
100  *
101  * Eventually I'll create a real UPA bus module to allow servers with multiple
102  * peripheral buses and things like FHC bus systems.
103  */
104 
105 /* Encoding for one "reg" properties item */
106 struct upa_reg {
107 	int64_t	ur_paddr;
108 	int64_t	ur_len;
109 };
110 
111 /*
112  * Attach arguments presented by mainbus_attach()
113  *
114  * Large fields first followed by smaller ones to minimize stack space used.
115  */
116 struct mainbus_attach_args {
117 	bus_space_tag_t	ma_bustag;	/* parent bus tag */
118 	bus_dma_tag_t	ma_dmatag;
119 	char		*ma_name;	/* PROM node name */
120 	struct upa_reg	*ma_reg;	/* "reg" properties */
121 	u_int		*ma_address;	/* "address" properties -- 32 bits */
122 	u_int		*ma_interrupts;	/* "interrupts" properties */
123 	int		ma_upaid;	/* UPA port ID */
124 	int		ma_node;	/* PROM handle */
125 	int		ma_nreg;	/* Counts for those properties */
126 	int		ma_naddress;
127 	int		ma_ninterrupts;
128 	int		ma_pri;		/* priority (IPL) */
129 };
130 
131 /*
132  * length; the others convert or make some other guarantee.
133  */
134 long	PROM_getproplen __P((int node, char *name));
135 int	PROM_getprop __P((int, char *, size_t, int *, void **));
136 char	*PROM_getpropstring __P((int node, char *name));
137 int	PROM_getpropint __P((int node, char *name, int deflt));
138 
139 /* Frequently used options node */
140 extern int optionsnode;
141 
142 	/* new interfaces: */
143 char	*PROM_getpropstringA __P((int, char *, char *));
144 
145 /*
146  * The matchbyname function is useful in drivers that are matched
147  * by romaux name, i.e., all `mainbus attached' devices.  It expects
148  * its aux pointer to point to a pointer to the name (the address of
149  * a romaux structure suffices, for instance). (OBSOLETE)
150  */
151 struct device;
152 struct cfdata;
153 int	matchbyname __P((struct device *, struct cfdata *cf, void *aux));
154 
155 /*
156  * `clockfreq' produces a printable representation of a clock frequency
157  * (this is just a frill).
158  */
159 char	*clockfreq __P((long freq));
160 
161 /* Openprom V2 style boot path */
162 struct bootpath {
163 	char	name[16];	/* name of this node */
164 	int	val[3];		/* up to three optional values */
165 	struct device *dev;	/* device that recognised this component */
166 };
167 struct bootpath	*bootpath_store __P((int, struct bootpath *));
168 int		sd_crazymap __P((int));
169 
170 /* Parse a disk string into a dev_t, return device struct pointer */
171 struct	device *parsedisk __P((char *, int, int, dev_t *));
172 
173 /* Establish a mountroot_hook, for benefit of floppy drive, mostly. */
174 void	mountroot_hook_establish __P((void (*) __P((struct device *)),
175 				      struct device *));
176 
177 void	bootstrap __P((int));
178 int	firstchild __P((int));
179 int	nextsibling __P((int));
180 void	callrom __P((void));
181 struct device *getdevunit __P((char *, int));
182 void	*findzs __P((int));
183 void	rominterpret __P((char *));
184 int	romgetcursoraddr __P((int **, int **));
185 int	findroot __P((void));
186 int	findnode __P((int, const char *));
187 int	node_has_property __P((int, const char *));
188 
189