loadfile_aout.c revision 1.12
1 /* $NetBSD: loadfile_aout.c,v 1.12 2007/12/29 17:54:42 tsutsui 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. Neither the name of the University nor the names of its contributors 56 * may be used to endorse or promote products derived from this software 57 * without specific prior written permission. 58 * 59 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 60 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 61 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 62 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 63 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 64 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 65 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 66 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 67 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 68 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 69 * SUCH DAMAGE. 70 * 71 * @(#)boot.c 8.1 (Berkeley) 6/10/93 72 */ 73 74 #ifdef _STANDALONE 75 #include <lib/libsa/stand.h> 76 #include <lib/libkern/libkern.h> 77 #else 78 #include <stdio.h> 79 #include <string.h> 80 #include <errno.h> 81 #include <stdlib.h> 82 #include <unistd.h> 83 #include <fcntl.h> 84 #include <err.h> 85 #endif 86 87 #include <sys/param.h> 88 #include <sys/exec.h> 89 90 #include "loadfile.h" 91 92 #ifdef BOOT_AOUT 93 94 int 95 loadfile_aout(int fd, struct exec *x, u_long *marks, int flags) 96 { 97 u_long entry = x->a_entry; 98 paddr_t aoutp = 0; 99 paddr_t minp, maxp; 100 int cc; 101 paddr_t offset = marks[MARK_START]; 102 u_long magic = N_GETMAGIC(*x); 103 int sub; 104 ssize_t nr; 105 106 /* some ports dont use the offset */ 107 offset = offset; 108 109 /* In OMAGIC and NMAGIC, exec header isn't part of text segment */ 110 if (magic == OMAGIC || magic == NMAGIC) 111 sub = 0; 112 else 113 sub = sizeof(*x); 114 115 minp = maxp = ALIGNENTRY(entry); 116 117 if (lseek(fd, sizeof(*x), SEEK_SET) == -1) { 118 WARN(("lseek text")); 119 return 1; 120 } 121 122 /* 123 * Leave a copy of the exec header before the text. 124 * The kernel may use this to verify that the 125 * symbols were loaded by this boot program. 126 */ 127 if (magic == OMAGIC || magic == NMAGIC) { 128 if (flags & LOAD_HDR && maxp >= sizeof(*x)) 129 BCOPY(x, maxp - sizeof(*x), sizeof(*x)); 130 } 131 else { 132 if (flags & LOAD_HDR) 133 BCOPY(x, maxp, sizeof(*x)); 134 if (flags & (LOAD_HDR|COUNT_HDR)) 135 maxp += sizeof(*x); 136 } 137 138 /* 139 * Read in the text segment. 140 */ 141 if (flags & LOAD_TEXT) { 142 PROGRESS(("%ld", x->a_text)); 143 144 nr = READ(fd, maxp, x->a_text - sub); 145 if (nr == -1) { 146 WARN(("read text")); 147 return 1; 148 } 149 if (nr != (ssize_t)(x->a_text - sub)) { 150 errno = EIO; 151 WARN(("read text")); 152 return 1; 153 } 154 } else { 155 if (lseek(fd, x->a_text - sub, SEEK_CUR) == -1) { 156 WARN(("seek text")); 157 return 1; 158 } 159 } 160 if (flags & (LOAD_TEXT|COUNT_TEXT)) 161 maxp += x->a_text - sub; 162 163 /* 164 * Provide alignment if required 165 */ 166 if (magic == ZMAGIC || magic == NMAGIC) { 167 int size = -(unsigned int)maxp & (AOUT_LDPGSZ - 1); 168 169 if (flags & LOAD_TEXTA) { 170 PROGRESS(("/%d", size)); 171 BZERO(maxp, size); 172 } 173 174 if (flags & (LOAD_TEXTA|COUNT_TEXTA)) 175 maxp += size; 176 } 177 178 /* 179 * Read in the data segment. 180 */ 181 if (flags & LOAD_DATA) { 182 PROGRESS(("+%ld", x->a_data)); 183 184 marks[MARK_DATA] = LOADADDR(maxp); 185 nr = READ(fd, maxp, x->a_data); 186 if (nr == -1) { 187 WARN(("read data")); 188 return 1; 189 } 190 if (nr != (ssize_t)x->a_data) { 191 errno = EIO; 192 WARN(("read data")); 193 return 1; 194 } 195 } 196 else { 197 if (lseek(fd, x->a_data, SEEK_CUR) == -1) { 198 WARN(("seek data")); 199 return 1; 200 } 201 } 202 if (flags & (LOAD_DATA|COUNT_DATA)) 203 maxp += x->a_data; 204 205 /* 206 * Zero out the BSS section. 207 * (Kernel doesn't care, but do it anyway.) 208 */ 209 if (flags & LOAD_BSS) { 210 PROGRESS(("+%ld", x->a_bss)); 211 212 BZERO(maxp, x->a_bss); 213 } 214 215 if (flags & (LOAD_BSS|COUNT_BSS)) 216 maxp += x->a_bss; 217 218 /* 219 * Read in the symbol table and strings. 220 * (Always set the symtab size word.) 221 */ 222 if (flags & LOAD_SYM) 223 BCOPY(&x->a_syms, maxp, sizeof(x->a_syms)); 224 225 if (flags & (LOAD_SYM|COUNT_SYM)) { 226 maxp += sizeof(x->a_syms); 227 aoutp = maxp; 228 } 229 230 if (x->a_syms > 0) { 231 /* Symbol table and string table length word. */ 232 233 if (flags & LOAD_SYM) { 234 PROGRESS(("+[%ld", x->a_syms)); 235 236 nr = READ(fd, maxp, x->a_syms); 237 if (nr == -1) { 238 WARN(("read symbols")); 239 return 1; 240 } 241 if (nr != (ssize_t)x->a_syms) { 242 errno = EIO; 243 WARN(("read symbols")); 244 return 1; 245 } 246 } else { 247 if (lseek(fd, x->a_syms, SEEK_CUR) == -1) { 248 WARN(("seek symbols")); 249 return 1; 250 } 251 } 252 if (flags & (LOAD_SYM|COUNT_SYM)) 253 maxp += x->a_syms; 254 255 nr = read(fd, &cc, sizeof(cc)); 256 if (nr == -1) { 257 WARN(("read string table")); 258 return 1; 259 } 260 if (nr != sizeof(cc)) { 261 errno = EIO; 262 WARN(("read string table")); 263 return 1; 264 } 265 266 if (flags & LOAD_SYM) { 267 BCOPY(&cc, maxp, sizeof(cc)); 268 269 /* String table. Length word includes itself. */ 270 271 PROGRESS(("+%d]", cc)); 272 } 273 if (flags & (LOAD_SYM|COUNT_SYM)) 274 maxp += sizeof(cc); 275 276 cc -= sizeof(int); 277 if (cc <= 0) { 278 WARN(("symbol table too short")); 279 return 1; 280 } 281 282 if (flags & LOAD_SYM) { 283 nr = READ(fd, maxp, cc); 284 if (nr == -1) { 285 WARN(("read strings")); 286 return 1; 287 } 288 if (nr != cc) { 289 errno = EIO; 290 WARN(("read strings")); 291 return 1; 292 } 293 } else { 294 if (lseek(fd, cc, SEEK_CUR) == -1) { 295 WARN(("seek strings")); 296 return 1; 297 } 298 } 299 if (flags & (LOAD_SYM|COUNT_SYM)) 300 maxp += cc; 301 } 302 303 marks[MARK_START] = LOADADDR(minp); 304 marks[MARK_ENTRY] = LOADADDR(entry); 305 marks[MARK_NSYM] = x->a_syms; 306 marks[MARK_SYM] = LOADADDR(aoutp); 307 marks[MARK_END] = LOADADDR(maxp); 308 return 0; 309 } 310 311 #endif /* BOOT_AOUT */ 312
Indexes created Wed Oct 01 13:09:50 GMT 2025