|
0
|
1 /*
|
|
|
2 * Copyright (c) 1995 by Sun Microsystems, Inc.
|
|
|
3 * All rights reserved.
|
|
|
4 *
|
|
|
5 * This source code is a product of Sun Microsystems, Inc. and is provided
|
|
|
6 * for unrestricted use provided that this legend is included on all tape
|
|
|
7 * media and as a part of the software program in whole or part. Users
|
|
|
8 * may copy or modify this source code without charge, but are not authorized
|
|
|
9 * to license or distribute it to anyone else except as part of a product or
|
|
|
10 * program developed by the user.
|
|
|
11 *
|
|
|
12 * THIS PROGRAM CONTAINS SOURCE CODE COPYRIGHTED BY SUN MICROSYSTEMS, INC.
|
|
|
13 * SUN MICROSYSTEMS, INC., MAKES NO REPRESENTATIONS ABOUT THE SUITABLITY
|
|
|
14 * OF SUCH SOURCE CODE FOR ANY PURPOSE. IT IS PROVIDED "AS IS" WITHOUT
|
|
|
15 * EXPRESS OR IMPLIED WARRANTY OF ANY KIND. SUN MICROSYSTEMS, INC. DISCLAIMS
|
|
|
16 * ALL WARRANTIES WITH REGARD TO SUCH SOURCE CODE, INCLUDING ALL IMPLIED
|
|
|
17 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. IN
|
|
|
18 * NO EVENT SHALL SUN MICROSYSTEMS, INC. BE LIABLE FOR ANY SPECIAL, INDIRECT,
|
|
|
19 * INCIDENTAL, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING
|
|
|
20 * FROM USE OF SUCH SOURCE CODE, REGARDLESS OF THE THEORY OF LIABILITY.
|
|
|
21 *
|
|
|
22 * This source code is provided with no support and without any obligation on
|
|
|
23 * the part of Sun Microsystems, Inc. to assist in its use, correction,
|
|
|
24 * modification or enhancement.
|
|
|
25 *
|
|
|
26 * SUN MICROSYSTEMS, INC. SHALL HAVE NO LIABILITY WITH RESPECT TO THE
|
|
|
27 * INFRINGEMENT OF COPYRIGHTS, TRADE SECRETS OR ANY PATENTS BY THIS
|
|
|
28 * SOURCE CODE OR ANY PART THEREOF.
|
|
|
29 *
|
|
|
30 * Sun Microsystems, Inc.
|
|
|
31 * 2550 Garcia Avenue
|
|
|
32 * Mountain View, California 94043
|
|
|
33 */
|
|
|
34
|
|
|
35 /*
|
|
|
36 * dynodump(3x) dumps a running executable into a specified ELF file. The new
|
|
|
37 * file consists of the memory contents of the original file together with any
|
|
|
38 * heap. This heap is assigned to a new `.heap' section within the new file.
|
|
|
39 *
|
|
|
40 * The new file may be re-executed, and will contain any data modifications
|
|
|
41 * made to the original image up until the time dynodump(3x) was called.
|
|
|
42 *
|
|
|
43 * The original image may have undergone relocations (performed by ld.so.1)
|
|
|
44 * prior to control being transferred to the image. These relocations will
|
|
|
45 * reside as the data copied from the image. To prevent subsequent executions
|
|
|
46 * of the new image from undergoing the same relocations, any relocation entries
|
|
|
47 * (besides copy or jump slot relocations) are nulled out. Note that copy
|
|
|
48 * relocations such as required for __iob must be reinitialized each time the
|
|
|
49 * process starts, so it is not sufficient to simply null out the .dynamic
|
|
|
50 * sections relocation information. The effect of this is that if the new
|
|
|
51 * image was bound to definitions in any shared object dependencies, then these
|
|
|
52 * dependencies *must* reside in the same location as when dynodump(3x) was
|
|
|
53 * called. Any changes to the shared object dependencies of the new image, or
|
|
|
54 * uses of such things as LD_PRELOAD, may result in the bindings encoded in the
|
|
|
55 * image becoming invalid.
|
|
|
56 *
|
|
|
57 * The following flags modify the data of the image created:
|
|
|
58 *
|
|
|
59 * RTLD_SAVREL save the original relocation data. Under this option any
|
|
|
60 * relocation offset is reset to contain the same data as was
|
|
|
61 * found in the images original file.
|
|
|
62 *
|
|
|
63 * This option allows relocation information to be retained in the
|
|
|
64 * new image so that it may be re-executed when the new image is
|
|
|
65 * run. This allows far greater flexibility as the new image can
|
|
|
66 * now take advantage of new shared objects.
|
|
|
67 *
|
|
|
68 * Note. under this mechanism, any data item that undergoes
|
|
|
69 * relocation and is then further modified during the execution of
|
|
|
70 * the image before dynodump(3x) is called will lose the
|
|
|
71 * modification that occured during the applications execution.
|
|
|
72 *
|
|
|
73 * N.B. The above commentary is not quite correct in the flags have been hardwired
|
|
|
74 * to RTLD_SAVREL.
|
|
|
75 */
|
|
74
|
76 #pragma ident "@(#) $Id: dynodump.c,v 1.1.1.2 1996/12/21 20:44:43 steve Exp $ - SMI"
|
|
0
|
77
|
|
74
|
78 #define __EXTENSIONS__
|
|
0
|
79 #include <sys/param.h>
|
|
|
80 #include <sys/procfs.h>
|
|
|
81 #include <fcntl.h>
|
|
|
82 #include <stdio.h>
|
|
|
83 #include <libelf.h>
|
|
|
84 #include <link.h>
|
|
|
85 #include <stdlib.h>
|
|
|
86 #include <string.h>
|
|
|
87 #include <unistd.h>
|
|
|
88 #include <errno.h>
|
|
|
89 #include <malloc.h>
|
|
|
90 #include "machdep.h"
|
|
|
91 #include "_dynodump.h"
|
|
|
92
|
|
|
93 /*
|
|
|
94 * Generic elf error message generator
|
|
|
95 */
|
|
|
96 static int
|
|
|
97 elferr(const char * str)
|
|
|
98 {
|
|
|
99 fprintf(stderr, "%s: %s\n", str, elf_errmsg(elf_errno()));
|
|
|
100 return (1);
|
|
|
101 }
|
|
|
102
|
|
2
|
103 int dynodump (const char * file);
|
|
0
|
104 int
|
|
|
105 dynodump(const char * file)
|
|
|
106 {
|
|
|
107 Elf *ielf, *oelf;
|
|
|
108 Ehdr *iehdr, *oehdr;
|
|
|
109 Phdr *iphdr, *ophdr, *data_phdr = 0;
|
|
|
110 Cache *icache, *ocache, *_icache, *_ocache;
|
|
|
111 Cache *data_cache = 0, *shstr_cache = 0;
|
|
|
112 Cache *heap_cache = 0;
|
|
|
113 Word heap_sz = 0;
|
|
|
114 Elf_Scn *scn;
|
|
|
115 Shdr *shdr;
|
|
|
116 Elf_Data *data, rundata;
|
|
|
117 Half ndx, _ndx;
|
|
|
118 int fd, _fd;
|
|
|
119 Addr edata, _addr;
|
|
|
120 char *istrs, *ostrs, *_ostrs, proc[16];
|
|
|
121 const char heap[] = ".heap";
|
|
|
122 prstatus_t pstat;
|
|
|
123
|
|
|
124 /* make a call to the processor specific un-init stuff */
|
|
|
125 dynodump_uninit();
|
|
|
126
|
|
|
127 /*
|
|
|
128 * Obtain a file descriptor for this process,
|
|
|
129 * for the executable and get a prstatus_t
|
|
|
130 * structure.
|
|
|
131 */
|
|
|
132 sprintf(proc, "/proc/%ld", getpid());
|
|
|
133 if (((_fd = open(proc, O_RDONLY, 0)) == -1) ||
|
|
|
134 ((fd = ioctl(_fd, PIOCOPENM, (void *)0)) == -1) ||
|
|
|
135 (ioctl(_fd, PIOCSTATUS, &pstat) == -1)) {
|
|
|
136 fprintf(stderr, "/proc: initialization error: %s\n",
|
|
|
137 strerror(errno));
|
|
|
138 close(_fd);
|
|
|
139 return (1);
|
|
|
140 }
|
|
|
141 close(_fd);
|
|
|
142
|
|
|
143 /*
|
|
|
144 * Initialize with the ELF library and make sure this is an executable
|
|
|
145 * ELF file we're dealing with.
|
|
|
146 */
|
|
|
147 elf_version(EV_CURRENT);
|
|
|
148 if ((ielf = elf_begin(fd, ELF_C_READ, NULL)) == NULL) {
|
|
|
149 close(fd);
|
|
|
150 return (elferr("elf_begin"));
|
|
|
151 }
|
|
|
152 close(fd);
|
|
|
153
|
|
|
154 if ((elf_kind(ielf) != ELF_K_ELF) ||
|
|
|
155 ((iehdr = elf_getehdr(ielf)) == NULL) ||
|
|
|
156 (iehdr->e_type != ET_EXEC)) {
|
|
|
157 fprintf(stderr, "image is not an ELF executable\n");
|
|
|
158 elf_end(ielf);
|
|
|
159 return (1);
|
|
|
160 }
|
|
|
161 /*
|
|
|
162 * Elf_elf_header(iehdr);
|
|
|
163 */
|
|
|
164
|
|
|
165 /*
|
|
|
166 * Create the new output file.
|
|
|
167 */
|
|
|
168 if ((fd = open(file, O_RDWR | O_CREAT | O_TRUNC, 0777)) == -1) {
|
|
|
169 fprintf(stderr, "%s: open failed: %s\n", file,
|
|
|
170 strerror(errno));
|
|
|
171 elf_end(ielf);
|
|
|
172 return (1);
|
|
|
173 }
|
|
|
174 if ((oelf = elf_begin(fd, ELF_C_WRITE, NULL)) == NULL) {
|
|
|
175 elf_end(ielf);
|
|
|
176 close(fd);
|
|
|
177 return (elferr("elf_begin"));
|
|
|
178 }
|
|
|
179
|
|
|
180 /*
|
|
|
181 * Obtain the input program headers. Remember the data segments
|
|
|
182 * program header entry as this will be updated later to reflect the
|
|
|
183 * new .heap sections size.
|
|
|
184 */
|
|
|
185 if ((iphdr = elf_getphdr(ielf)) == NULL)
|
|
|
186 return (elferr("elf_getphdr"));
|
|
|
187
|
|
|
188 for (ndx = 0, ophdr = iphdr; ndx != iehdr->e_phnum; ndx++, ophdr++) {
|
|
|
189 /*
|
|
|
190 * Save the program header that contains the NOBITS section, or
|
|
|
191 * the last loadable program header if no NOBITS exists.
|
|
|
192 * A NOBITS section translates to a memory size requirement that
|
|
|
193 * is greater than the file data it is mapped from.
|
|
|
194 */
|
|
|
195 if (ophdr->p_type == PT_LOAD) {
|
|
|
196 if (ophdr->p_filesz != ophdr->p_memsz)
|
|
|
197 data_phdr = ophdr;
|
|
|
198 else if (data_phdr) {
|
|
|
199 if (data_phdr->p_vaddr < ophdr->p_vaddr)
|
|
|
200 data_phdr = ophdr;
|
|
|
201 } else
|
|
|
202 data_phdr = ophdr;
|
|
|
203 }
|
|
|
204 }
|
|
|
205 if (data_phdr == 0) {
|
|
|
206 fprintf(stderr, "no data segment found!\n");
|
|
|
207 return (0);
|
|
|
208 }
|
|
|
209
|
|
|
210 /*
|
|
|
211 * Obtain the input files section header string table.
|
|
|
212 */
|
|
|
213 if ((scn = elf_getscn(ielf, iehdr->e_shstrndx)) == NULL)
|
|
|
214 return (elferr("elf_getscn"));
|
|
|
215 if ((data = elf_getdata(scn, NULL)) == NULL)
|
|
|
216 return (elferr("elf_getdata"));
|
|
|
217 istrs = data->d_buf;
|
|
|
218
|
|
|
219 /*
|
|
|
220 * Construct a cache to maintain the input files section information.
|
|
|
221 */
|
|
|
222 if ((icache = (Cache *) malloc(iehdr->e_shnum * sizeof (Cache))) == 0) {
|
|
|
223 fprintf(stderr, "malloc failed: %s\n", strerror(errno));
|
|
|
224 return (1);
|
|
|
225 }
|
|
|
226 _icache = icache;
|
|
|
227 _icache++;
|
|
|
228
|
|
|
229 /*
|
|
|
230 * Traverse each section from the input file.
|
|
|
231 */
|
|
|
232 for (ndx = 1, scn = 0;
|
|
2
|
233 (_icache->c_scn = elf_nextscn(ielf, scn));
|
|
0
|
234 ndx++, scn = _icache->c_scn, _icache++) {
|
|
|
235
|
|
|
236 if ((_icache->c_shdr = shdr = elf_getshdr(_icache->c_scn)) == NULL)
|
|
|
237 return (elferr("elf_getshdr"));
|
|
|
238
|
|
|
239 if ((_icache->c_data = elf_getdata(_icache->c_scn, NULL)) == NULL)
|
|
|
240 return (elferr("elf_getdata"));
|
|
|
241
|
|
|
242 _icache->c_name = istrs + (size_t)(shdr->sh_name);
|
|
|
243
|
|
|
244 /*
|
|
|
245 * For each section that has a virtual address reestablish the
|
|
|
246 * data buffer to point to the memory image.
|
|
|
247 *
|
|
|
248 * if (shdr->sh_addr)
|
|
|
249 * _icache->c_data->d_buf = (void *)shdr->sh_addr;
|
|
|
250 */
|
|
|
251
|
|
|
252 /*
|
|
|
253 * Remember the last section of the data segment, the new .heap
|
|
|
254 * section will be added after this section.
|
|
|
255 * If we already have one, then set data_cache to the previous
|
|
|
256 * section and set heap_cache to this one.
|
|
|
257 */
|
|
|
258 if ((shdr->sh_addr + shdr->sh_size)
|
|
|
259 == (data_phdr->p_vaddr + data_phdr->p_memsz)) {
|
|
|
260 if (strcmp(_icache->c_name, heap) == 0) {
|
|
|
261 #ifdef DEBUG
|
|
|
262 printf("Found a previous .heap section\n");
|
|
|
263 #endif
|
|
|
264 data_cache = _icache - 1;
|
|
|
265 heap_cache = _icache;
|
|
|
266 heap_sz = shdr->sh_size;
|
|
|
267 } else {
|
|
|
268 data_cache = _icache;
|
|
|
269 }
|
|
|
270 }
|
|
|
271
|
|
|
272 /*
|
|
|
273 * Remember the section header string table as this will be
|
|
|
274 * rewritten with the new .heap name.
|
|
|
275 */
|
|
|
276 if ((shdr->sh_type == SHT_STRTAB) &&
|
|
|
277 ((strcmp(_icache->c_name, ".shstrtab")) == 0))
|
|
|
278 shstr_cache = _icache;
|
|
|
279 }
|
|
|
280 if (data_cache == 0) {
|
|
|
281 fprintf(stderr, "final data section not found!\n");
|
|
|
282 return (0);
|
|
|
283 }
|
|
|
284
|
|
|
285 /*
|
|
|
286 * Determine the new .heap section to create.
|
|
|
287 */
|
|
|
288 rundata.d_buf = (void *)(data_cache->c_shdr->sh_addr +
|
|
|
289 data_cache->c_shdr->sh_size);
|
|
|
290 rundata.d_size = (int)sbrk(0) - (int)rundata.d_buf;
|
|
|
291 rundata.d_type = ELF_T_BYTE;
|
|
|
292 rundata.d_off = 0;
|
|
|
293 rundata.d_align = 1;
|
|
|
294 rundata.d_version = EV_CURRENT;
|
|
|
295
|
|
|
296 /*
|
|
|
297 * From the new data buffer determine the new value for _end and _edata.
|
|
|
298 * This will also be used to update the data segment program header.
|
|
|
299 *
|
|
|
300 * If we had a .heap section, then its size is part of the program
|
|
|
301 * headers notion of data size. Because we're only going to output one
|
|
|
302 * heap section (ignoring the one in the running binary) we need to
|
|
|
303 * subract the size of that which we're ignoring.
|
|
|
304 */
|
|
|
305 if (heap_cache) {
|
|
|
306 edata = S_ROUND((data_phdr->p_vaddr
|
|
|
307 + data_phdr->p_memsz
|
|
|
308 - heap_sz), rundata.d_align) + rundata.d_size;
|
|
|
309 } else {
|
|
|
310 edata = S_ROUND((data_phdr->p_vaddr + data_phdr->p_memsz),
|
|
|
311 rundata.d_align) + rundata.d_size;
|
|
|
312 }
|
|
|
313
|
|
|
314 /*
|
|
|
315 * We're now ready to construct the new elf image.
|
|
|
316 *
|
|
|
317 * Obtain a new elf header and initialize it with any basic information
|
|
|
318 * that isn't calculated as part of elf_update(). Bump the section
|
|
|
319 * header string table index to account for the .heap section we'll be
|
|
|
320 * adding.
|
|
|
321 */
|
|
|
322 if ((oehdr = elf_newehdr(oelf)) == NULL)
|
|
|
323 return (elferr("elf_newehdr"));
|
|
|
324
|
|
|
325 oehdr->e_entry = iehdr->e_entry;
|
|
|
326 oehdr->e_machine = iehdr->e_machine;
|
|
|
327 oehdr->e_type = iehdr->e_type;
|
|
|
328 oehdr->e_flags = iehdr->e_flags;
|
|
|
329 /*
|
|
|
330 * If we already have a heap section, we don't need any adjustment
|
|
|
331 */
|
|
|
332 if (heap_cache)
|
|
|
333 oehdr->e_shstrndx = iehdr->e_shstrndx;
|
|
|
334 else
|
|
|
335 oehdr->e_shstrndx = iehdr->e_shstrndx + 1;
|
|
|
336
|
|
|
337 #ifdef DEBUG
|
|
|
338 printf("iehdr->e_flags = %x\n", iehdr->e_flags);
|
|
|
339 printf("iehdr->e_entry = %x\n", iehdr->e_entry);
|
|
|
340 printf("iehdr->e_shstrndx= %d\n", iehdr->e_shstrndx);
|
|
|
341 printf("iehdr->e_machine = %d\n", iehdr->e_machine);
|
|
|
342 printf("iehdr->e_type = 0x%x\n", iehdr->e_type);
|
|
|
343 printf("oehdr->e_machine = %d\n", oehdr->e_machine);
|
|
|
344 printf("oehdr->e_type = 0x%x\n", oehdr->e_type);
|
|
|
345 #endif
|
|
|
346
|
|
|
347 /*
|
|
|
348 * Obtain a new set of program headers. Initialize these with the same
|
|
|
349 * information as the input program headers and update the data segment
|
|
|
350 * to reflect the new .heap section.
|
|
|
351 */
|
|
|
352 if ((ophdr = elf_newphdr(oelf, iehdr->e_phnum)) == NULL)
|
|
|
353 return (elferr("elf_newphdr"));
|
|
|
354
|
|
|
355 for (ndx = 0; ndx != iehdr->e_phnum; ndx++, iphdr++, ophdr++) {
|
|
|
356 *ophdr = *iphdr;
|
|
|
357 if (data_phdr == iphdr)
|
|
|
358 ophdr->p_filesz = ophdr->p_memsz = edata - ophdr->p_vaddr;
|
|
|
359 }
|
|
|
360
|
|
|
361 /*
|
|
|
362 * Obtain a new set of sections.
|
|
|
363 */
|
|
|
364 _icache = icache;
|
|
|
365 _icache++;
|
|
|
366 for (ndx = 1; ndx != iehdr->e_shnum; ndx++, _icache++) {
|
|
|
367 /*
|
|
|
368 * Skip the heap section of the running executable
|
|
|
369 */
|
|
|
370 if (_icache == heap_cache)
|
|
|
371 continue;
|
|
|
372 /*
|
|
|
373 * Create a matching section header in the output file.
|
|
|
374 */
|
|
|
375 if ((scn = elf_newscn(oelf)) == NULL)
|
|
|
376 return (elferr("elf_newscn"));
|
|
|
377 if ((shdr = elf_getshdr(scn)) == NULL)
|
|
|
378 return (elferr("elf_getshdr"));
|
|
|
379 *shdr = *_icache->c_shdr;
|
|
|
380
|
|
|
381 /*
|
|
|
382 * Create a matching data buffer for this section.
|
|
|
383 */
|
|
|
384 if ((data = elf_newdata(scn)) == NULL)
|
|
|
385 return (elferr("elf_newdata"));
|
|
|
386 *data = *_icache->c_data;
|
|
|
387
|
|
|
388 /*
|
|
|
389 * For each section that has a virtual address reestablish the
|
|
|
390 * data buffer to point to the memory image. Note, we skip
|
|
|
391 * the plt section.
|
|
|
392 */
|
|
|
393 if ((shdr->sh_addr) && (!((shdr->sh_type == SHT_PROGBITS)
|
|
|
394 && (strcmp(_icache->c_name, ".plt") == 0))))
|
|
|
395 data->d_buf = (void *)shdr->sh_addr;
|
|
|
396
|
|
|
397 /*
|
|
|
398 * Update any NOBITS section to indicate that it now contains
|
|
|
399 * data.
|
|
|
400 */
|
|
|
401 if (shdr->sh_type == SHT_NOBITS)
|
|
|
402 shdr->sh_type = SHT_PROGBITS;
|
|
|
403
|
|
|
404 /*
|
|
|
405 * Add the new .heap section after the last section of the
|
|
|
406 * present data segment. If we had a heap section, then
|
|
|
407 * this is the section preceding it.
|
|
|
408 */
|
|
|
409 if (data_cache == _icache) {
|
|
|
410 if ((scn = elf_newscn(oelf)) == NULL)
|
|
|
411 return (elferr("elf_newscn"));
|
|
|
412 if ((shdr = elf_getshdr(scn)) == NULL)
|
|
|
413 return (elferr("elf_getshdr"));
|
|
|
414 shdr->sh_type = SHT_PROGBITS;
|
|
|
415 shdr->sh_flags = SHF_ALLOC | SHF_WRITE;
|
|
|
416
|
|
|
417 if ((data = elf_newdata(scn)) == NULL)
|
|
|
418 return (elferr("elf_newdata"));
|
|
|
419 *data = rundata;
|
|
|
420 }
|
|
|
421
|
|
|
422 /*
|
|
|
423 * Update the section header string table size to reflect the
|
|
|
424 * new section name (only if we didn't already have a heap).
|
|
|
425 */
|
|
|
426 if (!heap_cache) {
|
|
|
427 if (shstr_cache && (shstr_cache == _icache)) {
|
|
|
428 data->d_size += sizeof (heap);
|
|
|
429 }
|
|
|
430 }
|
|
|
431 }
|
|
|
432
|
|
|
433 /*
|
|
|
434 * Write out the new image, and obtain a new elf descriptor that will
|
|
|
435 * allow us to write to the new image.
|
|
|
436 */
|
|
|
437 if (elf_update(oelf, ELF_C_WRITE) == -1)
|
|
|
438 return (elferr("elf_update"));
|
|
|
439 elf_end(oelf);
|
|
|
440 if ((oelf = elf_begin(fd, ELF_C_RDWR, NULL)) == NULL)
|
|
|
441 return (elferr("elf_begin"));
|
|
|
442 if ((oehdr = elf_getehdr(oelf)) == NULL)
|
|
|
443 return (elferr("elf_getehdr"));
|
|
|
444
|
|
|
445 /*
|
|
|
446 * Obtain the output files section header string table.
|
|
|
447 */
|
|
|
448 if ((scn = elf_getscn(oelf, oehdr->e_shstrndx)) == NULL)
|
|
|
449 return (elferr("elf_getscn"));
|
|
|
450 if ((data = elf_getdata(scn, NULL)) == NULL)
|
|
|
451 return (elferr("elf_getdata"));
|
|
|
452 ostrs = _ostrs = data->d_buf;
|
|
|
453 *_ostrs++ = '\0';
|
|
|
454
|
|
|
455 /*
|
|
|
456 * Construct a cache to maintain the output files section information.
|
|
|
457 */
|
|
|
458 if ((ocache = (Cache *)malloc(oehdr->e_shnum * sizeof (Cache))) == 0) {
|
|
|
459 fprintf(stderr, "malloc failed: %s\n", strerror(errno));
|
|
|
460 return (1);
|
|
|
461 }
|
|
|
462 _ocache = ocache;
|
|
|
463 _ocache++;
|
|
|
464 _icache = icache;
|
|
|
465 _icache++;
|
|
|
466
|
|
|
467 /*
|
|
|
468 * Traverse each section from the input file rebuilding the section
|
|
|
469 * header string table as we go.
|
|
|
470 */
|
|
|
471 _ndx = _addr = 0;
|
|
|
472 for (ndx = 1, scn = 0;
|
|
2
|
473 (_ocache->c_scn = elf_nextscn(oelf, scn));
|
|
0
|
474 ndx++, scn = _ocache->c_scn, _ocache++, _icache++) {
|
|
|
475
|
|
|
476 const char *strs;
|
|
|
477
|
|
|
478 if (_icache == heap_cache) {
|
|
|
479 #ifdef DEBUG
|
|
|
480 printf("ignoring .heap section in input\n");
|
|
|
481 #endif
|
|
|
482 _icache++;
|
|
|
483 }
|
|
|
484
|
|
|
485 if ((_ocache->c_shdr = shdr =
|
|
|
486 elf_getshdr(_ocache->c_scn)) == NULL)
|
|
|
487 return (elferr("elf_getshdr"));
|
|
|
488 if ((_ocache->c_data =
|
|
|
489 elf_getdata(_ocache->c_scn, NULL)) == NULL)
|
|
|
490 return (elferr("elf_getdata"));
|
|
|
491
|
|
|
492 /*
|
|
|
493 * If were inserting the new .heap section, insert the new
|
|
|
494 * section name and initialize it's virtual address.
|
|
|
495 */
|
|
|
496 if (_addr) {
|
|
|
497 strs = heap;
|
|
|
498 shdr->sh_addr = S_ROUND(_addr, shdr->sh_addralign);
|
|
|
499 _addr = 0;
|
|
|
500 } else {
|
|
|
501 strs = istrs + (size_t)(_icache->c_shdr->sh_name);
|
|
|
502 }
|
|
|
503
|
|
|
504 strcpy(_ostrs, strs);
|
|
|
505 shdr->sh_name = _ostrs - ostrs;
|
|
|
506 _ocache->c_name = _ostrs;
|
|
|
507 _ostrs += strlen(strs) + 1;
|
|
|
508
|
|
|
509 /*
|
|
|
510 * If we've inserted a new section any later section may need
|
|
|
511 * their sh_link fields updated.
|
|
|
512 * If we already had a heap section, then this is not required.
|
|
|
513 */
|
|
|
514 if (!heap_cache) {
|
|
|
515 if (_ndx) {
|
|
|
516 if (_ocache->c_shdr->sh_link >= _ndx)
|
|
|
517 _ocache->c_shdr->sh_link++;
|
|
|
518 }
|
|
|
519 }
|
|
|
520
|
|
|
521 /*
|
|
|
522 * If this is the last section of the original data segment
|
|
|
523 * determine sufficient information to initialize the new .heap
|
|
|
524 * section which will be obtained next.
|
|
|
525 */
|
|
|
526 if (data_cache == _icache) {
|
|
|
527 _ndx = ndx + 1;
|
|
|
528 _addr = shdr->sh_addr + shdr->sh_size;
|
|
|
529 _icache--;
|
|
|
530 data_cache = 0;
|
|
|
531 }
|
|
|
532 }
|
|
|
533
|
|
|
534 /*
|
|
|
535 * Now that we have a complete description of the new image update any
|
|
|
536 * sections that are required.
|
|
|
537 *
|
|
|
538 * o update the value of _edata and _end.
|
|
|
539 *
|
|
|
540 * o reset any relocation entries if necessary.
|
|
|
541 */
|
|
|
542 _ocache = &ocache[1];
|
|
|
543 _icache = &icache[1];
|
|
|
544 for (ndx = 1; ndx < oehdr->e_shnum; ndx++, _ocache++, _icache++) {
|
|
|
545 if ((_ocache->c_shdr->sh_type == SHT_SYMTAB) ||
|
|
|
546 (_ocache->c_shdr->sh_type == SHT_DYNSYM))
|
|
|
547 update_sym(ocache, _ocache, edata);
|
|
|
548
|
|
|
549 if (_ocache->c_shdr->sh_type == M_REL_SHT_TYPE)
|
|
|
550 update_reloc(ocache, _ocache, icache, _icache, oehdr->e_shnum);
|
|
|
551 }
|
|
|
552
|
|
|
553 if (elf_update(oelf, ELF_C_WRITE) == -1)
|
|
|
554 return (elferr("elf_update"));
|
|
|
555
|
|
|
556 elf_end(oelf);
|
|
|
557 elf_end(ielf);
|
|
|
558 return (0);
|
|
|
559 }
|
