loadfile_ecoff.c revision 1.2
1 /* $NetBSD: loadfile_ecoff.c,v 1.2 2001/10/31 01:51:43 thorpej Exp $ */ 2 3 /*- 4 * Copyright (c) 1997 The NetBSD Foundation, Inc. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to The NetBSD Foundation 8 * by Jason R. Thorpe of the Numerical Aerospace Simulation Facility, 9 * NASA Ames Research Center and by Christos Zoulas. 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. All advertising materials mentioning features or use of this software 20 * must display the following acknowledgement: 21 * This product includes software developed by the NetBSD 22 * Foundation, Inc. and its contributors. 23 * 4. Neither the name of The NetBSD Foundation nor the names of its 24 * contributors may be used to endorse or promote products derived 25 * from this software without specific prior written permission. 26 * 27 * THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS 28 * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED 29 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 30 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS 31 * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR 32 * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF 33 * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS 34 * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN 35 * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) 36 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE 37 * POSSIBILITY OF SUCH DAMAGE. 38 */ 39 40 /* 41 * Copyright (c) 1992, 1993 42 * The Regents of the University of California. All rights reserved. 43 * 44 * This code is derived from software contributed to Berkeley by 45 * Ralph Campbell. 46 * 47 * Redistribution and use in source and binary forms, with or without 48 * modification, are permitted provided that the following conditions 49 * are met: 50 * 1. Redistributions of source code must retain the above copyright 51 * notice, this list of conditions and the following disclaimer. 52 * 2. Redistributions in binary form must reproduce the above copyright 53 * notice, this list of conditions and the following disclaimer in the 54 * documentation and/or other materials provided with the distribution. 55 * 3. All advertising materials mentioning features or use of this software 56 * must display the following acknowledgement: 57 * This product includes software developed by the University of 58 * California, Berkeley and its contributors. 59 * 4. Neither the name of the University nor the names of its contributors 60 * may be used to endorse or promote products derived from this software 61 * without specific prior written permission. 62 * 63 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 64 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 65 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 66 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 67 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 68 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 69 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 70 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 71 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 72 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 73 * SUCH DAMAGE. 74 * 75 * @(#)boot.c 8.1 (Berkeley) 6/10/93 76 */ 77 78 #ifdef _STANDALONE 79 #include <lib/libsa/stand.h> 80 #include <lib/libkern/libkern.h> 81 #else 82 #include <stdio.h> 83 #include <string.h> 84 #include <errno.h> 85 #include <stdlib.h> 86 #include <unistd.h> 87 #include <fcntl.h> 88 #include <err.h> 89 #endif 90 91 #include <sys/param.h> 92 #include <sys/exec.h> 93 94 #include "loadfile.h" 95 96 #ifdef BOOT_ECOFF 97 98 int 99 loadfile_coff(fd, coff, marks, flags) 100 int fd; 101 struct ecoff_exechdr *coff; 102 u_long *marks; 103 int flags; 104 { 105 paddr_t offset = marks[MARK_START]; 106 paddr_t minp = ~0, maxp = 0, pos; 107 108 /* Read in text. */ 109 if (lseek(fd, ECOFF_TXTOFF(coff), SEEK_SET) == -1) { 110 WARN(("lseek text")); 111 return 1; 112 } 113 114 if (coff->a.tsize != 0) { 115 if (flags & LOAD_TEXT) { 116 PROGRESS(("%lu", coff->a.tsize)); 117 if (READ(fd, coff->a.text_start, coff->a.tsize) != 118 coff->a.tsize) { 119 return 1; 120 } 121 } 122 else { 123 if (lseek(fd, coff->a.tsize, SEEK_CUR) == -1) { 124 WARN(("read text")); 125 return 1; 126 } 127 } 128 if (flags & (COUNT_TEXT|LOAD_TEXT)) { 129 pos = coff->a.text_start; 130 if (minp > pos) 131 minp = pos; 132 pos += coff->a.tsize; 133 if (maxp < pos) 134 maxp = pos; 135 } 136 } 137 138 /* Read in data. */ 139 if (coff->a.dsize != 0) { 140 if (flags & LOAD_DATA) { 141 PROGRESS(("+%lu", coff->a.dsize)); 142 if (READ(fd, coff->a.data_start, coff->a.dsize) != 143 coff->a.dsize) { 144 WARN(("read data")); 145 return 1; 146 } 147 } 148 if (flags & (COUNT_DATA|LOAD_DATA)) { 149 pos = coff->a.data_start; 150 if (minp > pos) 151 minp = pos; 152 pos += coff->a.dsize; 153 if (maxp < pos) 154 maxp = pos; 155 } 156 } 157 158 /* Zero out bss. */ 159 if (coff->a.bsize != 0) { 160 if (flags & LOAD_BSS) { 161 PROGRESS(("+%lu", coff->a.bsize)); 162 BZERO(coff->a.bss_start, coff->a.bsize); 163 } 164 if (flags & (COUNT_BSS|LOAD_BSS)) { 165 pos = coff->a.bss_start; 166 if (minp > pos) 167 minp = pos; 168 pos = coff->a.bsize; 169 if (maxp < pos) 170 maxp = pos; 171 } 172 } 173 174 marks[MARK_START] = LOADADDR(minp); 175 marks[MARK_ENTRY] = LOADADDR(coff->a.entry); 176 marks[MARK_NSYM] = 1; /* XXX: Kernel needs >= 0 */ 177 marks[MARK_SYM] = LOADADDR(maxp); 178 marks[MARK_END] = LOADADDR(maxp); 179 return 0; 180 } 181 182 #endif /* BOOT_ECOFF */ 183
Indexes created Tue Sep 30 11:09:46 GMT 2025