boot.c revision 1.4 1 1.4 pk /* $NetBSD: boot.c,v 1.4 1999/02/15 18:59:36 pk Exp $ */
2 1.1 mrg
3 1.1 mrg /*-
4 1.1 mrg * Copyright (c) 1982, 1986, 1990, 1993
5 1.1 mrg * The Regents of the University of California. All rights reserved.
6 1.1 mrg *
7 1.1 mrg * Redistribution and use in source and binary forms, with or without
8 1.1 mrg * modification, are permitted provided that the following conditions
9 1.1 mrg * are met:
10 1.1 mrg * 1. Redistributions of source code must retain the above copyright
11 1.1 mrg * notice, this list of conditions and the following disclaimer.
12 1.1 mrg * 2. Redistributions in binary form must reproduce the above copyright
13 1.1 mrg * notice, this list of conditions and the following disclaimer in the
14 1.1 mrg * documentation and/or other materials provided with the distribution.
15 1.1 mrg * 3. All advertising materials mentioning features or use of this software
16 1.1 mrg * must display the following acknowledgement:
17 1.1 mrg * This product includes software developed by the University of
18 1.1 mrg * California, Berkeley and its contributors.
19 1.1 mrg * 4. Neither the name of the University nor the names of its contributors
20 1.1 mrg * may be used to endorse or promote products derived from this software
21 1.1 mrg * without specific prior written permission.
22 1.1 mrg *
23 1.1 mrg * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24 1.1 mrg * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25 1.1 mrg * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26 1.1 mrg * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27 1.1 mrg * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28 1.1 mrg * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29 1.1 mrg * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30 1.1 mrg * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31 1.1 mrg * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32 1.1 mrg * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33 1.1 mrg * SUCH DAMAGE.
34 1.1 mrg *
35 1.1 mrg * @(#)boot.c 8.1 (Berkeley) 6/10/93
36 1.1 mrg */
37 1.1 mrg
38 1.1 mrg #include <sys/param.h>
39 1.1 mrg #include <sys/reboot.h>
40 1.1 mrg #include <a.out.h>
41 1.1 mrg
42 1.1 mrg #include <lib/libsa/stand.h>
43 1.1 mrg
44 1.4 pk #include <machine/promlib.h>
45 1.1 mrg #include <sparc/stand/common/promdev.h>
46 1.1 mrg
47 1.4 pk static int bootoptions __P((char *));
48 1.4 pk void loadfile __P((int, caddr_t));
49 1.4 pk #if 0
50 1.4 pk static void promsyms __P((int, struct exec *));
51 1.4 pk #endif
52 1.4 pk
53 1.1 mrg int debug;
54 1.1 mrg int netif_debug;
55 1.1 mrg
56 1.1 mrg extern char bootprog_name[], bootprog_rev[], bootprog_date[], bootprog_maker[];
57 1.1 mrg unsigned long esym;
58 1.1 mrg char *strtab;
59 1.1 mrg int strtablen;
60 1.1 mrg char fbuf[80], dbuf[128];
61 1.1 mrg
62 1.4 pk int main __P((void));
63 1.1 mrg typedef void (*entry_t)__P((caddr_t, int, int, int, long, long));
64 1.1 mrg
65 1.1 mrg
66 1.3 mrg /*
67 1.3 mrg * Boot device is derived from ROM provided information, or if there is none,
68 1.3 mrg * this list is used in sequence, to find a kernel.
69 1.3 mrg */
70 1.3 mrg char *kernels[] = {
71 1.3 mrg "netbsd",
72 1.3 mrg "netbsd.gz",
73 1.3 mrg "netbsd.old",
74 1.3 mrg "netbsd.old.gz",
75 1.3 mrg "onetbsd",
76 1.3 mrg "onetbsd.gz",
77 1.3 mrg "vmunix",
78 1.3 mrg #ifdef notyet
79 1.3 mrg "netbsd.pl",
80 1.3 mrg "netbsd.pl.gz",
81 1.3 mrg "netbsd.el",
82 1.3 mrg "netbsd.el.gz",
83 1.3 mrg #endif
84 1.3 mrg NULL
85 1.3 mrg };
86 1.3 mrg
87 1.4 pk int
88 1.4 pk bootoptions(ap)
89 1.4 pk char *ap;
90 1.4 pk {
91 1.4 pk int v = 0;
92 1.4 pk if (ap == NULL || *ap++ != '-')
93 1.4 pk return (0);
94 1.4 pk
95 1.4 pk while (*ap != '\0' && *ap != ' ' && *ap != '\t' && *ap != '\n') {
96 1.4 pk switch (*ap) {
97 1.4 pk case 'a':
98 1.4 pk v |= RB_ASKNAME;
99 1.4 pk break;
100 1.4 pk case 's':
101 1.4 pk v |= RB_SINGLE;
102 1.4 pk break;
103 1.4 pk case 'd':
104 1.4 pk v |= RB_KDB;
105 1.4 pk debug = 1;
106 1.4 pk break;
107 1.4 pk }
108 1.4 pk ap++;
109 1.4 pk }
110 1.4 pk
111 1.4 pk return (v);
112 1.4 pk }
113 1.4 pk
114 1.4 pk int
115 1.1 mrg main()
116 1.1 mrg {
117 1.3 mrg int io, i;
118 1.3 mrg char *kernel;
119 1.4 pk int how;
120 1.1 mrg
121 1.1 mrg prom_init();
122 1.1 mrg
123 1.1 mrg printf(">> %s, Revision %s\n", bootprog_name, bootprog_rev);
124 1.1 mrg printf(">> (%s, %s)\n", bootprog_maker, bootprog_date);
125 1.1 mrg
126 1.3 mrg /*
127 1.3 mrg * get default kernel.
128 1.3 mrg */
129 1.4 pk prom_bootdevice = prom_getbootpath();
130 1.4 pk kernel = prom_getbootfile();
131 1.4 pk how = bootoptions(prom_getbootargs());
132 1.4 pk
133 1.4 pk if (kernel != NULL && *kernel != '\0') {
134 1.3 mrg i = -1; /* not using the kernels */
135 1.3 mrg } else {
136 1.3 mrg i = 0;
137 1.3 mrg kernel = kernels[i];
138 1.3 mrg }
139 1.1 mrg
140 1.1 mrg for (;;) {
141 1.3 mrg /*
142 1.3 mrg * ask for a kernel first ..
143 1.3 mrg */
144 1.4 pk if (how & RB_ASKNAME) {
145 1.3 mrg printf("device[%s] (\"halt\" to halt): ",
146 1.4 pk prom_bootdevice);
147 1.1 mrg gets(dbuf);
148 1.3 mrg if (strcmp(dbuf, "halt") == 0)
149 1.3 mrg _rtt();
150 1.1 mrg if (dbuf[0])
151 1.1 mrg prom_bootdevice = dbuf;
152 1.3 mrg printf("boot (press RETURN to try default list): ");
153 1.1 mrg gets(fbuf);
154 1.1 mrg if (fbuf[0])
155 1.3 mrg kernel = fbuf;
156 1.3 mrg else {
157 1.4 pk how &= ~RB_ASKNAME;
158 1.3 mrg i = 0;
159 1.3 mrg kernel = kernels[i];
160 1.3 mrg }
161 1.1 mrg }
162 1.3 mrg
163 1.3 mrg if ((io = open(kernel, 0)) >= 0)
164 1.1 mrg break;
165 1.3 mrg printf("open: %s: %s", kernel, strerror(errno));
166 1.3 mrg
167 1.3 mrg /*
168 1.3 mrg * if we have are not in askname mode, and we aren't using the
169 1.3 mrg * prom bootfile, try the next one (if it exits). otherwise,
170 1.3 mrg * go into askname mode.
171 1.3 mrg */
172 1.4 pk if ((how & RB_ASKNAME) == 0 &&
173 1.3 mrg i != -1 && kernels[++i]) {
174 1.3 mrg kernel = kernels[i];
175 1.3 mrg printf(": trying %s...\n", kernel);
176 1.3 mrg } else {
177 1.3 mrg printf("\n");
178 1.4 pk how |= RB_ASKNAME;
179 1.3 mrg }
180 1.1 mrg }
181 1.1 mrg
182 1.3 mrg /*
183 1.3 mrg * XXX
184 1.3 mrg * make loadfile() return a value, so that if the load of the kernel
185 1.3 mrg * fails, we can jump back and try another kernel in the list.
186 1.3 mrg */
187 1.4 pk printf("Booting %s @ %p\n", kernel, PROM_LOADADDR);
188 1.4 pk loadfile(io, PROM_LOADADDR);
189 1.1 mrg
190 1.1 mrg _rtt();
191 1.1 mrg }
192 1.1 mrg
193 1.1 mrg void
194 1.1 mrg loadfile(io, addr)
195 1.4 pk int io;
196 1.4 pk caddr_t addr;
197 1.1 mrg {
198 1.4 pk entry_t entry = (entry_t)PROM_LOADADDR;
199 1.4 pk void *arg;
200 1.1 mrg struct exec x;
201 1.1 mrg int i;
202 1.1 mrg
203 1.1 mrg i = read(io, (char *)&x, sizeof(x));
204 1.1 mrg if (i != sizeof(x) ||
205 1.1 mrg N_BADMAG(x)) {
206 1.1 mrg printf("Bad format\n");
207 1.1 mrg return;
208 1.1 mrg }
209 1.4 pk printf("%ld", x.a_text);
210 1.1 mrg if (N_GETMAGIC(x) == ZMAGIC) {
211 1.1 mrg entry = (entry_t)(addr+sizeof(struct exec));
212 1.1 mrg addr += sizeof(struct exec);
213 1.1 mrg }
214 1.1 mrg if (read(io, (char *)addr, x.a_text) != x.a_text)
215 1.1 mrg goto shread;
216 1.1 mrg addr += x.a_text;
217 1.1 mrg if (N_GETMAGIC(x) == ZMAGIC || N_GETMAGIC(x) == NMAGIC)
218 1.1 mrg while ((int)addr & __LDPGSZ)
219 1.1 mrg *addr++ = 0;
220 1.4 pk printf("+%ld", x.a_data);
221 1.1 mrg if (read(io, addr, x.a_data) != x.a_data)
222 1.1 mrg goto shread;
223 1.1 mrg addr += x.a_data;
224 1.4 pk printf("+%ld", x.a_bss);
225 1.1 mrg for (i = 0; i < x.a_bss; i++)
226 1.1 mrg *addr++ = 0;
227 1.1 mrg if (x.a_syms != 0) {
228 1.1 mrg bcopy(&x.a_syms, addr, sizeof(x.a_syms));
229 1.1 mrg addr += sizeof(x.a_syms);
230 1.4 pk printf("+[%ld", x.a_syms);
231 1.1 mrg if (read(io, addr, x.a_syms) != x.a_syms)
232 1.1 mrg goto shread;
233 1.1 mrg addr += x.a_syms;
234 1.1 mrg
235 1.1 mrg if (read(io, &strtablen, sizeof(int)) != sizeof(int))
236 1.1 mrg goto shread;
237 1.1 mrg
238 1.1 mrg bcopy(&strtablen, addr, sizeof(int));
239 1.4 pk if ((i = strtablen) != 0) {
240 1.1 mrg i -= sizeof(int);
241 1.1 mrg addr += sizeof(int);
242 1.1 mrg if (read(io, addr, i) != i)
243 1.1 mrg goto shread;
244 1.1 mrg addr += i;
245 1.1 mrg }
246 1.1 mrg printf("+%d]", i);
247 1.4 pk esym = ((u_int)x.a_entry - (u_int)PROM_LOADADDR) +
248 1.1 mrg (((int)addr + sizeof(int) - 1) & ~(sizeof(int) - 1));
249 1.1 mrg #if 0
250 1.1 mrg /*
251 1.1 mrg * The FORTH word `loadsyms' is mentioned in the
252 1.1 mrg * "Openboot command reference" book, but it seems it has
253 1.1 mrg * not been implemented on at least one machine..
254 1.1 mrg */
255 1.1 mrg promsyms(io, &x);
256 1.1 mrg #endif
257 1.1 mrg }
258 1.4 pk printf("=%p\n", addr);
259 1.1 mrg close(io);
260 1.1 mrg
261 1.1 mrg /* Note: args 2-4 not used due to conflicts with SunOS loaders */
262 1.4 pk arg = (prom_version() == PROM_OLDMON) ? PROM_LOADADDR : romp;
263 1.4 pk (*entry)(arg, 0, 0, 0, esym, DDB_MAGIC1);
264 1.1 mrg return;
265 1.1 mrg
266 1.1 mrg shread:
267 1.1 mrg printf("boot: short read\n");
268 1.1 mrg return;
269 1.1 mrg }
270 1.1 mrg
271 1.1 mrg #if 0
272 1.1 mrg struct syms {
273 1.1 mrg u_int32_t value;
274 1.1 mrg u_int32_t index;
275 1.1 mrg };
276 1.1 mrg
277 1.1 mrg static void
278 1.1 mrg sort(syms, n)
279 1.1 mrg struct syms *syms;
280 1.1 mrg int n;
281 1.1 mrg {
282 1.1 mrg register struct syms *sj;
283 1.1 mrg register int i, j, k;
284 1.1 mrg register u_int32_t value, index;
285 1.1 mrg
286 1.1 mrg /* Insertion sort. This is O(n^2), but so what? */
287 1.1 mrg for (i = 1; i < n; i++) {
288 1.1 mrg /* save i'th entry */
289 1.1 mrg value = syms[i].value;
290 1.1 mrg index = syms[i].index;
291 1.1 mrg /* find j such that i'th entry goes before j'th */
292 1.1 mrg for (j = 0, sj = syms; j < i; j++, sj++)
293 1.1 mrg if (value < sj->value)
294 1.1 mrg break;
295 1.1 mrg /* slide up any additional entries */
296 1.1 mrg for (k = 0; k < (i - j); k++) {
297 1.1 mrg sj[k+1].value = sj[k].value;
298 1.1 mrg sj[k+1].index = sj[k].index;
299 1.1 mrg }
300 1.1 mrg sj->value = value;
301 1.1 mrg sj->index = index;
302 1.1 mrg }
303 1.1 mrg }
304 1.1 mrg
305 1.1 mrg void
306 1.1 mrg promsyms(fd, hp)
307 1.1 mrg int fd;
308 1.1 mrg struct exec *hp;
309 1.1 mrg {
310 1.1 mrg int i, n, strtablen;
311 1.1 mrg char *str, *p, *cp, buf[128];
312 1.1 mrg struct syms *syms;
313 1.1 mrg
314 1.1 mrg lseek(fd, sizeof(*hp)+hp->a_text+hp->a_data, SEEK_SET);
315 1.1 mrg n = hp->a_syms/sizeof(struct nlist);
316 1.1 mrg if (n == 0)
317 1.1 mrg return;
318 1.1 mrg syms = (struct syms *)alloc(n * sizeof(struct syms));
319 1.1 mrg
320 1.1 mrg printf("+[%x+", hp->a_syms);
321 1.1 mrg for (i = 0; i < n; i++) {
322 1.1 mrg struct nlist nlist;
323 1.1 mrg
324 1.1 mrg if (read(fd, &nlist, sizeof(nlist)) != sizeof(nlist)) {
325 1.1 mrg printf("promsyms: read failed\n");
326 1.1 mrg return;
327 1.1 mrg }
328 1.1 mrg syms[i].value = nlist.n_value;
329 1.1 mrg syms[i].index = nlist.n_un.n_strx - sizeof(strtablen);
330 1.1 mrg }
331 1.1 mrg
332 1.1 mrg sort(syms, n);
333 1.1 mrg
334 1.1 mrg if (read(fd, &strtablen, sizeof(strtablen)) != sizeof(strtablen)) {
335 1.1 mrg printf("promsym: read failed (strtablen)\n");
336 1.1 mrg return;
337 1.1 mrg }
338 1.1 mrg if (strtablen < sizeof(strtablen)) {
339 1.1 mrg printf("promsym: string table corrupted\n");
340 1.1 mrg return;
341 1.1 mrg }
342 1.1 mrg strtablen -= sizeof(strtablen);
343 1.1 mrg str = (char *)alloc(strtablen);
344 1.1 mrg
345 1.1 mrg printf("%x]", strtablen);
346 1.1 mrg if (read(fd, str, strtablen) != strtablen) {
347 1.1 mrg printf("promsym: read failed (strtab)\n");
348 1.1 mrg return;
349 1.1 mrg }
350 1.1 mrg
351 1.1 mrg sprintf(buf, "%x %d %x loadsyms", syms, n, str);
352 1.4 pk prom_interpret(buf);
353 1.1 mrg }
354 1.1 mrg #endif
355