Automatic date update in version.in
[deliverable/binutils-gdb.git] / bfd / peXXigen.c
1 /* Support for the generic parts of PE/PEI; the common executable parts.
2 Copyright (C) 1995-2018 Free Software Foundation, Inc.
3 Written by Cygnus Solutions.
4
5 This file is part of BFD, the Binary File Descriptor library.
6
7 This program is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 3 of the License, or
10 (at your option) any later version.
11
12 This program is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
16
17 You should have received a copy of the GNU General Public License
18 along with this program; if not, write to the Free Software
19 Foundation, Inc., 51 Franklin Street - Fifth Floor, Boston,
20 MA 02110-1301, USA. */
21
22
23 /* Most of this hacked by Steve Chamberlain <sac@cygnus.com>.
24
25 PE/PEI rearrangement (and code added): Donn Terry
26 Softway Systems, Inc. */
27
28 /* Hey look, some documentation [and in a place you expect to find it]!
29
30 The main reference for the pei format is "Microsoft Portable Executable
31 and Common Object File Format Specification 4.1". Get it if you need to
32 do some serious hacking on this code.
33
34 Another reference:
35 "Peering Inside the PE: A Tour of the Win32 Portable Executable
36 File Format", MSJ 1994, Volume 9.
37
38 The *sole* difference between the pe format and the pei format is that the
39 latter has an MSDOS 2.0 .exe header on the front that prints the message
40 "This app must be run under Windows." (or some such).
41 (FIXME: Whether that statement is *really* true or not is unknown.
42 Are there more subtle differences between pe and pei formats?
43 For now assume there aren't. If you find one, then for God sakes
44 document it here!)
45
46 The Microsoft docs use the word "image" instead of "executable" because
47 the former can also refer to a DLL (shared library). Confusion can arise
48 because the `i' in `pei' also refers to "image". The `pe' format can
49 also create images (i.e. executables), it's just that to run on a win32
50 system you need to use the pei format.
51
52 FIXME: Please add more docs here so the next poor fool that has to hack
53 on this code has a chance of getting something accomplished without
54 wasting too much time. */
55
56 /* This expands into COFF_WITH_pe, COFF_WITH_pep, or COFF_WITH_pex64
57 depending on whether we're compiling for straight PE or PE+. */
58 #define COFF_WITH_XX
59
60 #include "sysdep.h"
61 #include "bfd.h"
62 #include "libbfd.h"
63 #include "coff/internal.h"
64 #include "bfdver.h"
65 #include "libiberty.h"
66 #ifdef HAVE_WCHAR_H
67 #include <wchar.h>
68 #endif
69 #ifdef HAVE_WCTYPE_H
70 #include <wctype.h>
71 #endif
72
73 /* NOTE: it's strange to be including an architecture specific header
74 in what's supposed to be general (to PE/PEI) code. However, that's
75 where the definitions are, and they don't vary per architecture
76 within PE/PEI, so we get them from there. FIXME: The lack of
77 variance is an assumption which may prove to be incorrect if new
78 PE/PEI targets are created. */
79 #if defined COFF_WITH_pex64
80 # include "coff/x86_64.h"
81 #elif defined COFF_WITH_pep
82 # include "coff/ia64.h"
83 #else
84 # include "coff/i386.h"
85 #endif
86
87 #include "coff/pe.h"
88 #include "libcoff.h"
89 #include "libpei.h"
90 #include "safe-ctype.h"
91
92 #if defined COFF_WITH_pep || defined COFF_WITH_pex64
93 # undef AOUTSZ
94 # define AOUTSZ PEPAOUTSZ
95 # define PEAOUTHDR PEPAOUTHDR
96 #endif
97
98 #define HighBitSet(val) ((val) & 0x80000000)
99 #define SetHighBit(val) ((val) | 0x80000000)
100 #define WithoutHighBit(val) ((val) & 0x7fffffff)
101
102 /* FIXME: This file has various tests of POWERPC_LE_PE. Those tests
103 worked when the code was in peicode.h, but no longer work now that
104 the code is in peigen.c. PowerPC NT is said to be dead. If
105 anybody wants to revive the code, you will have to figure out how
106 to handle those issues. */
107 \f
108 void
109 _bfd_XXi_swap_sym_in (bfd * abfd, void * ext1, void * in1)
110 {
111 SYMENT *ext = (SYMENT *) ext1;
112 struct internal_syment *in = (struct internal_syment *) in1;
113
114 if (ext->e.e_name[0] == 0)
115 {
116 in->_n._n_n._n_zeroes = 0;
117 in->_n._n_n._n_offset = H_GET_32 (abfd, ext->e.e.e_offset);
118 }
119 else
120 memcpy (in->_n._n_name, ext->e.e_name, SYMNMLEN);
121
122 in->n_value = H_GET_32 (abfd, ext->e_value);
123 in->n_scnum = (short) H_GET_16 (abfd, ext->e_scnum);
124
125 if (sizeof (ext->e_type) == 2)
126 in->n_type = H_GET_16 (abfd, ext->e_type);
127 else
128 in->n_type = H_GET_32 (abfd, ext->e_type);
129
130 in->n_sclass = H_GET_8 (abfd, ext->e_sclass);
131 in->n_numaux = H_GET_8 (abfd, ext->e_numaux);
132
133 #ifndef STRICT_PE_FORMAT
134 /* This is for Gnu-created DLLs. */
135
136 /* The section symbols for the .idata$ sections have class 0x68
137 (C_SECTION), which MS documentation indicates is a section
138 symbol. Unfortunately, the value field in the symbol is simply a
139 copy of the .idata section's flags rather than something useful.
140 When these symbols are encountered, change the value to 0 so that
141 they will be handled somewhat correctly in the bfd code. */
142 if (in->n_sclass == C_SECTION)
143 {
144 char namebuf[SYMNMLEN + 1];
145 const char *name = NULL;
146
147 in->n_value = 0x0;
148
149 /* Create synthetic empty sections as needed. DJ */
150 if (in->n_scnum == 0)
151 {
152 asection *sec;
153
154 name = _bfd_coff_internal_syment_name (abfd, in, namebuf);
155 if (name == NULL)
156 {
157 _bfd_error_handler (_("%pB: unable to find name for empty section"),
158 abfd);
159 bfd_set_error (bfd_error_invalid_target);
160 return;
161 }
162
163 sec = bfd_get_section_by_name (abfd, name);
164 if (sec != NULL)
165 in->n_scnum = sec->target_index;
166 }
167
168 if (in->n_scnum == 0)
169 {
170 int unused_section_number = 0;
171 asection *sec;
172 flagword flags;
173
174 for (sec = abfd->sections; sec; sec = sec->next)
175 if (unused_section_number <= sec->target_index)
176 unused_section_number = sec->target_index + 1;
177
178 if (name == namebuf)
179 {
180 name = (const char *) bfd_alloc (abfd, strlen (namebuf) + 1);
181 if (name == NULL)
182 {
183 _bfd_error_handler (_("%pB: out of memory creating name for empty section"),
184 abfd);
185 return;
186 }
187 strcpy ((char *) name, namebuf);
188 }
189
190 flags = SEC_HAS_CONTENTS | SEC_ALLOC | SEC_DATA | SEC_LOAD;
191 sec = bfd_make_section_anyway_with_flags (abfd, name, flags);
192 if (sec == NULL)
193 {
194 _bfd_error_handler (_("%pB: unable to create fake empty section"),
195 abfd);
196 return;
197 }
198
199 sec->vma = 0;
200 sec->lma = 0;
201 sec->size = 0;
202 sec->filepos = 0;
203 sec->rel_filepos = 0;
204 sec->reloc_count = 0;
205 sec->line_filepos = 0;
206 sec->lineno_count = 0;
207 sec->userdata = NULL;
208 sec->next = NULL;
209 sec->alignment_power = 2;
210
211 sec->target_index = unused_section_number;
212
213 in->n_scnum = unused_section_number;
214 }
215 in->n_sclass = C_STAT;
216 }
217 #endif
218
219 #ifdef coff_swap_sym_in_hook
220 /* This won't work in peigen.c, but since it's for PPC PE, it's not
221 worth fixing. */
222 coff_swap_sym_in_hook (abfd, ext1, in1);
223 #endif
224 }
225
226 static bfd_boolean
227 abs_finder (bfd * abfd ATTRIBUTE_UNUSED, asection * sec, void * data)
228 {
229 bfd_vma abs_val = * (bfd_vma *) data;
230
231 return (sec->vma <= abs_val) && ((sec->vma + (1ULL << 32)) > abs_val);
232 }
233
234 unsigned int
235 _bfd_XXi_swap_sym_out (bfd * abfd, void * inp, void * extp)
236 {
237 struct internal_syment *in = (struct internal_syment *) inp;
238 SYMENT *ext = (SYMENT *) extp;
239
240 if (in->_n._n_name[0] == 0)
241 {
242 H_PUT_32 (abfd, 0, ext->e.e.e_zeroes);
243 H_PUT_32 (abfd, in->_n._n_n._n_offset, ext->e.e.e_offset);
244 }
245 else
246 memcpy (ext->e.e_name, in->_n._n_name, SYMNMLEN);
247
248 /* The PE32 and PE32+ formats only use 4 bytes to hold the value of a
249 symbol. This is a problem on 64-bit targets where we can generate
250 absolute symbols with values >= 1^32. We try to work around this
251 problem by finding a section whose base address is sufficient to
252 reduce the absolute value to < 1^32, and then transforming the
253 symbol into a section relative symbol. This of course is a hack. */
254 if (sizeof (in->n_value) > 4
255 /* The strange computation of the shift amount is here in order to
256 avoid a compile time warning about the comparison always being
257 false. It does not matter if this test fails to work as expected
258 as the worst that can happen is that some absolute symbols are
259 needlessly converted into section relative symbols. */
260 && in->n_value > ((1ULL << (sizeof (in->n_value) > 4 ? 32 : 31)) - 1)
261 && in->n_scnum == N_ABS)
262 {
263 asection * sec;
264
265 sec = bfd_sections_find_if (abfd, abs_finder, & in->n_value);
266 if (sec)
267 {
268 in->n_value -= sec->vma;
269 in->n_scnum = sec->target_index;
270 }
271 /* else: FIXME: The value is outside the range of any section. This
272 happens for __image_base__ and __ImageBase and maybe some other
273 symbols as well. We should find a way to handle these values. */
274 }
275
276 H_PUT_32 (abfd, in->n_value, ext->e_value);
277 H_PUT_16 (abfd, in->n_scnum, ext->e_scnum);
278
279 if (sizeof (ext->e_type) == 2)
280 H_PUT_16 (abfd, in->n_type, ext->e_type);
281 else
282 H_PUT_32 (abfd, in->n_type, ext->e_type);
283
284 H_PUT_8 (abfd, in->n_sclass, ext->e_sclass);
285 H_PUT_8 (abfd, in->n_numaux, ext->e_numaux);
286
287 return SYMESZ;
288 }
289
290 void
291 _bfd_XXi_swap_aux_in (bfd * abfd,
292 void * ext1,
293 int type,
294 int in_class,
295 int indx ATTRIBUTE_UNUSED,
296 int numaux ATTRIBUTE_UNUSED,
297 void * in1)
298 {
299 AUXENT *ext = (AUXENT *) ext1;
300 union internal_auxent *in = (union internal_auxent *) in1;
301
302 /* PR 17521: Make sure that all fields in the aux structure
303 are initialised. */
304 memset (in, 0, sizeof * in);
305 switch (in_class)
306 {
307 case C_FILE:
308 if (ext->x_file.x_fname[0] == 0)
309 {
310 in->x_file.x_n.x_zeroes = 0;
311 in->x_file.x_n.x_offset = H_GET_32 (abfd, ext->x_file.x_n.x_offset);
312 }
313 else
314 memcpy (in->x_file.x_fname, ext->x_file.x_fname, FILNMLEN);
315 return;
316
317 case C_STAT:
318 case C_LEAFSTAT:
319 case C_HIDDEN:
320 if (type == T_NULL)
321 {
322 in->x_scn.x_scnlen = GET_SCN_SCNLEN (abfd, ext);
323 in->x_scn.x_nreloc = GET_SCN_NRELOC (abfd, ext);
324 in->x_scn.x_nlinno = GET_SCN_NLINNO (abfd, ext);
325 in->x_scn.x_checksum = H_GET_32 (abfd, ext->x_scn.x_checksum);
326 in->x_scn.x_associated = H_GET_16 (abfd, ext->x_scn.x_associated);
327 in->x_scn.x_comdat = H_GET_8 (abfd, ext->x_scn.x_comdat);
328 return;
329 }
330 break;
331 }
332
333 in->x_sym.x_tagndx.l = H_GET_32 (abfd, ext->x_sym.x_tagndx);
334 in->x_sym.x_tvndx = H_GET_16 (abfd, ext->x_sym.x_tvndx);
335
336 if (in_class == C_BLOCK || in_class == C_FCN || ISFCN (type)
337 || ISTAG (in_class))
338 {
339 in->x_sym.x_fcnary.x_fcn.x_lnnoptr = GET_FCN_LNNOPTR (abfd, ext);
340 in->x_sym.x_fcnary.x_fcn.x_endndx.l = GET_FCN_ENDNDX (abfd, ext);
341 }
342 else
343 {
344 in->x_sym.x_fcnary.x_ary.x_dimen[0] =
345 H_GET_16 (abfd, ext->x_sym.x_fcnary.x_ary.x_dimen[0]);
346 in->x_sym.x_fcnary.x_ary.x_dimen[1] =
347 H_GET_16 (abfd, ext->x_sym.x_fcnary.x_ary.x_dimen[1]);
348 in->x_sym.x_fcnary.x_ary.x_dimen[2] =
349 H_GET_16 (abfd, ext->x_sym.x_fcnary.x_ary.x_dimen[2]);
350 in->x_sym.x_fcnary.x_ary.x_dimen[3] =
351 H_GET_16 (abfd, ext->x_sym.x_fcnary.x_ary.x_dimen[3]);
352 }
353
354 if (ISFCN (type))
355 {
356 in->x_sym.x_misc.x_fsize = H_GET_32 (abfd, ext->x_sym.x_misc.x_fsize);
357 }
358 else
359 {
360 in->x_sym.x_misc.x_lnsz.x_lnno = GET_LNSZ_LNNO (abfd, ext);
361 in->x_sym.x_misc.x_lnsz.x_size = GET_LNSZ_SIZE (abfd, ext);
362 }
363 }
364
365 unsigned int
366 _bfd_XXi_swap_aux_out (bfd * abfd,
367 void * inp,
368 int type,
369 int in_class,
370 int indx ATTRIBUTE_UNUSED,
371 int numaux ATTRIBUTE_UNUSED,
372 void * extp)
373 {
374 union internal_auxent *in = (union internal_auxent *) inp;
375 AUXENT *ext = (AUXENT *) extp;
376
377 memset (ext, 0, AUXESZ);
378
379 switch (in_class)
380 {
381 case C_FILE:
382 if (in->x_file.x_fname[0] == 0)
383 {
384 H_PUT_32 (abfd, 0, ext->x_file.x_n.x_zeroes);
385 H_PUT_32 (abfd, in->x_file.x_n.x_offset, ext->x_file.x_n.x_offset);
386 }
387 else
388 memcpy (ext->x_file.x_fname, in->x_file.x_fname, FILNMLEN);
389
390 return AUXESZ;
391
392 case C_STAT:
393 case C_LEAFSTAT:
394 case C_HIDDEN:
395 if (type == T_NULL)
396 {
397 PUT_SCN_SCNLEN (abfd, in->x_scn.x_scnlen, ext);
398 PUT_SCN_NRELOC (abfd, in->x_scn.x_nreloc, ext);
399 PUT_SCN_NLINNO (abfd, in->x_scn.x_nlinno, ext);
400 H_PUT_32 (abfd, in->x_scn.x_checksum, ext->x_scn.x_checksum);
401 H_PUT_16 (abfd, in->x_scn.x_associated, ext->x_scn.x_associated);
402 H_PUT_8 (abfd, in->x_scn.x_comdat, ext->x_scn.x_comdat);
403 return AUXESZ;
404 }
405 break;
406 }
407
408 H_PUT_32 (abfd, in->x_sym.x_tagndx.l, ext->x_sym.x_tagndx);
409 H_PUT_16 (abfd, in->x_sym.x_tvndx, ext->x_sym.x_tvndx);
410
411 if (in_class == C_BLOCK || in_class == C_FCN || ISFCN (type)
412 || ISTAG (in_class))
413 {
414 PUT_FCN_LNNOPTR (abfd, in->x_sym.x_fcnary.x_fcn.x_lnnoptr, ext);
415 PUT_FCN_ENDNDX (abfd, in->x_sym.x_fcnary.x_fcn.x_endndx.l, ext);
416 }
417 else
418 {
419 H_PUT_16 (abfd, in->x_sym.x_fcnary.x_ary.x_dimen[0],
420 ext->x_sym.x_fcnary.x_ary.x_dimen[0]);
421 H_PUT_16 (abfd, in->x_sym.x_fcnary.x_ary.x_dimen[1],
422 ext->x_sym.x_fcnary.x_ary.x_dimen[1]);
423 H_PUT_16 (abfd, in->x_sym.x_fcnary.x_ary.x_dimen[2],
424 ext->x_sym.x_fcnary.x_ary.x_dimen[2]);
425 H_PUT_16 (abfd, in->x_sym.x_fcnary.x_ary.x_dimen[3],
426 ext->x_sym.x_fcnary.x_ary.x_dimen[3]);
427 }
428
429 if (ISFCN (type))
430 H_PUT_32 (abfd, in->x_sym.x_misc.x_fsize, ext->x_sym.x_misc.x_fsize);
431 else
432 {
433 PUT_LNSZ_LNNO (abfd, in->x_sym.x_misc.x_lnsz.x_lnno, ext);
434 PUT_LNSZ_SIZE (abfd, in->x_sym.x_misc.x_lnsz.x_size, ext);
435 }
436
437 return AUXESZ;
438 }
439
440 void
441 _bfd_XXi_swap_lineno_in (bfd * abfd, void * ext1, void * in1)
442 {
443 LINENO *ext = (LINENO *) ext1;
444 struct internal_lineno *in = (struct internal_lineno *) in1;
445
446 in->l_addr.l_symndx = H_GET_32 (abfd, ext->l_addr.l_symndx);
447 in->l_lnno = GET_LINENO_LNNO (abfd, ext);
448 }
449
450 unsigned int
451 _bfd_XXi_swap_lineno_out (bfd * abfd, void * inp, void * outp)
452 {
453 struct internal_lineno *in = (struct internal_lineno *) inp;
454 struct external_lineno *ext = (struct external_lineno *) outp;
455 H_PUT_32 (abfd, in->l_addr.l_symndx, ext->l_addr.l_symndx);
456
457 PUT_LINENO_LNNO (abfd, in->l_lnno, ext);
458 return LINESZ;
459 }
460
461 void
462 _bfd_XXi_swap_aouthdr_in (bfd * abfd,
463 void * aouthdr_ext1,
464 void * aouthdr_int1)
465 {
466 PEAOUTHDR * src = (PEAOUTHDR *) aouthdr_ext1;
467 AOUTHDR * aouthdr_ext = (AOUTHDR *) aouthdr_ext1;
468 struct internal_aouthdr *aouthdr_int
469 = (struct internal_aouthdr *) aouthdr_int1;
470 struct internal_extra_pe_aouthdr *a = &aouthdr_int->pe;
471
472 aouthdr_int->magic = H_GET_16 (abfd, aouthdr_ext->magic);
473 aouthdr_int->vstamp = H_GET_16 (abfd, aouthdr_ext->vstamp);
474 aouthdr_int->tsize = GET_AOUTHDR_TSIZE (abfd, aouthdr_ext->tsize);
475 aouthdr_int->dsize = GET_AOUTHDR_DSIZE (abfd, aouthdr_ext->dsize);
476 aouthdr_int->bsize = GET_AOUTHDR_BSIZE (abfd, aouthdr_ext->bsize);
477 aouthdr_int->entry = GET_AOUTHDR_ENTRY (abfd, aouthdr_ext->entry);
478 aouthdr_int->text_start =
479 GET_AOUTHDR_TEXT_START (abfd, aouthdr_ext->text_start);
480
481 #if !defined(COFF_WITH_pep) && !defined(COFF_WITH_pex64)
482 /* PE32+ does not have data_start member! */
483 aouthdr_int->data_start =
484 GET_AOUTHDR_DATA_START (abfd, aouthdr_ext->data_start);
485 a->BaseOfData = aouthdr_int->data_start;
486 #endif
487
488 a->Magic = aouthdr_int->magic;
489 a->MajorLinkerVersion = H_GET_8 (abfd, aouthdr_ext->vstamp);
490 a->MinorLinkerVersion = H_GET_8 (abfd, aouthdr_ext->vstamp + 1);
491 a->SizeOfCode = aouthdr_int->tsize ;
492 a->SizeOfInitializedData = aouthdr_int->dsize ;
493 a->SizeOfUninitializedData = aouthdr_int->bsize ;
494 a->AddressOfEntryPoint = aouthdr_int->entry;
495 a->BaseOfCode = aouthdr_int->text_start;
496 a->ImageBase = GET_OPTHDR_IMAGE_BASE (abfd, src->ImageBase);
497 a->SectionAlignment = H_GET_32 (abfd, src->SectionAlignment);
498 a->FileAlignment = H_GET_32 (abfd, src->FileAlignment);
499 a->MajorOperatingSystemVersion =
500 H_GET_16 (abfd, src->MajorOperatingSystemVersion);
501 a->MinorOperatingSystemVersion =
502 H_GET_16 (abfd, src->MinorOperatingSystemVersion);
503 a->MajorImageVersion = H_GET_16 (abfd, src->MajorImageVersion);
504 a->MinorImageVersion = H_GET_16 (abfd, src->MinorImageVersion);
505 a->MajorSubsystemVersion = H_GET_16 (abfd, src->MajorSubsystemVersion);
506 a->MinorSubsystemVersion = H_GET_16 (abfd, src->MinorSubsystemVersion);
507 a->Reserved1 = H_GET_32 (abfd, src->Reserved1);
508 a->SizeOfImage = H_GET_32 (abfd, src->SizeOfImage);
509 a->SizeOfHeaders = H_GET_32 (abfd, src->SizeOfHeaders);
510 a->CheckSum = H_GET_32 (abfd, src->CheckSum);
511 a->Subsystem = H_GET_16 (abfd, src->Subsystem);
512 a->DllCharacteristics = H_GET_16 (abfd, src->DllCharacteristics);
513 a->SizeOfStackReserve =
514 GET_OPTHDR_SIZE_OF_STACK_RESERVE (abfd, src->SizeOfStackReserve);
515 a->SizeOfStackCommit =
516 GET_OPTHDR_SIZE_OF_STACK_COMMIT (abfd, src->SizeOfStackCommit);
517 a->SizeOfHeapReserve =
518 GET_OPTHDR_SIZE_OF_HEAP_RESERVE (abfd, src->SizeOfHeapReserve);
519 a->SizeOfHeapCommit =
520 GET_OPTHDR_SIZE_OF_HEAP_COMMIT (abfd, src->SizeOfHeapCommit);
521 a->LoaderFlags = H_GET_32 (abfd, src->LoaderFlags);
522 a->NumberOfRvaAndSizes = H_GET_32 (abfd, src->NumberOfRvaAndSizes);
523
524 {
525 int idx;
526
527 /* PR 17512: Corrupt PE binaries can cause seg-faults. */
528 if (a->NumberOfRvaAndSizes > IMAGE_NUMBEROF_DIRECTORY_ENTRIES)
529 {
530 /* xgettext:c-format */
531 _bfd_error_handler
532 (_("%pB: aout header specifies an invalid number of data-directory entries: %ld"),
533 abfd, a->NumberOfRvaAndSizes);
534 bfd_set_error (bfd_error_bad_value);
535
536 /* Paranoia: If the number is corrupt, then assume that the
537 actual entries themselves might be corrupt as well. */
538 a->NumberOfRvaAndSizes = 0;
539 }
540
541 for (idx = 0; idx < a->NumberOfRvaAndSizes; idx++)
542 {
543 /* If data directory is empty, rva also should be 0. */
544 int size =
545 H_GET_32 (abfd, src->DataDirectory[idx][1]);
546
547 a->DataDirectory[idx].Size = size;
548
549 if (size)
550 a->DataDirectory[idx].VirtualAddress =
551 H_GET_32 (abfd, src->DataDirectory[idx][0]);
552 else
553 a->DataDirectory[idx].VirtualAddress = 0;
554 }
555
556 while (idx < IMAGE_NUMBEROF_DIRECTORY_ENTRIES)
557 {
558 a->DataDirectory[idx].Size = 0;
559 a->DataDirectory[idx].VirtualAddress = 0;
560 idx ++;
561 }
562 }
563
564 if (aouthdr_int->entry)
565 {
566 aouthdr_int->entry += a->ImageBase;
567 #if !defined(COFF_WITH_pep) && !defined(COFF_WITH_pex64)
568 aouthdr_int->entry &= 0xffffffff;
569 #endif
570 }
571
572 if (aouthdr_int->tsize)
573 {
574 aouthdr_int->text_start += a->ImageBase;
575 #if !defined(COFF_WITH_pep) && !defined(COFF_WITH_pex64)
576 aouthdr_int->text_start &= 0xffffffff;
577 #endif
578 }
579
580 #if !defined(COFF_WITH_pep) && !defined(COFF_WITH_pex64)
581 /* PE32+ does not have data_start member! */
582 if (aouthdr_int->dsize)
583 {
584 aouthdr_int->data_start += a->ImageBase;
585 aouthdr_int->data_start &= 0xffffffff;
586 }
587 #endif
588
589 #ifdef POWERPC_LE_PE
590 /* These three fields are normally set up by ppc_relocate_section.
591 In the case of reading a file in, we can pick them up from the
592 DataDirectory. */
593 first_thunk_address = a->DataDirectory[PE_IMPORT_ADDRESS_TABLE].VirtualAddress;
594 thunk_size = a->DataDirectory[PE_IMPORT_ADDRESS_TABLE].Size;
595 import_table_size = a->DataDirectory[PE_IMPORT_TABLE].Size;
596 #endif
597 }
598
599 /* A support function for below. */
600
601 static void
602 add_data_entry (bfd * abfd,
603 struct internal_extra_pe_aouthdr *aout,
604 int idx,
605 char *name,
606 bfd_vma base)
607 {
608 asection *sec = bfd_get_section_by_name (abfd, name);
609
610 /* Add import directory information if it exists. */
611 if ((sec != NULL)
612 && (coff_section_data (abfd, sec) != NULL)
613 && (pei_section_data (abfd, sec) != NULL))
614 {
615 /* If data directory is empty, rva also should be 0. */
616 int size = pei_section_data (abfd, sec)->virt_size;
617 aout->DataDirectory[idx].Size = size;
618
619 if (size)
620 {
621 aout->DataDirectory[idx].VirtualAddress =
622 (sec->vma - base) & 0xffffffff;
623 sec->flags |= SEC_DATA;
624 }
625 }
626 }
627
628 unsigned int
629 _bfd_XXi_swap_aouthdr_out (bfd * abfd, void * in, void * out)
630 {
631 struct internal_aouthdr *aouthdr_in = (struct internal_aouthdr *) in;
632 pe_data_type *pe = pe_data (abfd);
633 struct internal_extra_pe_aouthdr *extra = &pe->pe_opthdr;
634 PEAOUTHDR *aouthdr_out = (PEAOUTHDR *) out;
635 bfd_vma sa, fa, ib;
636 IMAGE_DATA_DIRECTORY idata2, idata5, tls;
637
638 sa = extra->SectionAlignment;
639 fa = extra->FileAlignment;
640 ib = extra->ImageBase;
641
642 idata2 = pe->pe_opthdr.DataDirectory[PE_IMPORT_TABLE];
643 idata5 = pe->pe_opthdr.DataDirectory[PE_IMPORT_ADDRESS_TABLE];
644 tls = pe->pe_opthdr.DataDirectory[PE_TLS_TABLE];
645
646 if (aouthdr_in->tsize)
647 {
648 aouthdr_in->text_start -= ib;
649 #if !defined(COFF_WITH_pep) && !defined(COFF_WITH_pex64)
650 aouthdr_in->text_start &= 0xffffffff;
651 #endif
652 }
653
654 if (aouthdr_in->dsize)
655 {
656 aouthdr_in->data_start -= ib;
657 #if !defined(COFF_WITH_pep) && !defined(COFF_WITH_pex64)
658 aouthdr_in->data_start &= 0xffffffff;
659 #endif
660 }
661
662 if (aouthdr_in->entry)
663 {
664 aouthdr_in->entry -= ib;
665 #if !defined(COFF_WITH_pep) && !defined(COFF_WITH_pex64)
666 aouthdr_in->entry &= 0xffffffff;
667 #endif
668 }
669
670 #define FA(x) (((x) + fa -1 ) & (- fa))
671 #define SA(x) (((x) + sa -1 ) & (- sa))
672
673 /* We like to have the sizes aligned. */
674 aouthdr_in->bsize = FA (aouthdr_in->bsize);
675
676 extra->NumberOfRvaAndSizes = IMAGE_NUMBEROF_DIRECTORY_ENTRIES;
677
678 add_data_entry (abfd, extra, PE_EXPORT_TABLE, ".edata", ib);
679 add_data_entry (abfd, extra, PE_RESOURCE_TABLE, ".rsrc", ib);
680 add_data_entry (abfd, extra, PE_EXCEPTION_TABLE, ".pdata", ib);
681
682 /* In theory we do not need to call add_data_entry for .idata$2 or
683 .idata$5. It will be done in bfd_coff_final_link where all the
684 required information is available. If however, we are not going
685 to perform a final link, eg because we have been invoked by objcopy
686 or strip, then we need to make sure that these Data Directory
687 entries are initialised properly.
688
689 So - we copy the input values into the output values, and then, if
690 a final link is going to be performed, it can overwrite them. */
691 extra->DataDirectory[PE_IMPORT_TABLE] = idata2;
692 extra->DataDirectory[PE_IMPORT_ADDRESS_TABLE] = idata5;
693 extra->DataDirectory[PE_TLS_TABLE] = tls;
694
695 if (extra->DataDirectory[PE_IMPORT_TABLE].VirtualAddress == 0)
696 /* Until other .idata fixes are made (pending patch), the entry for
697 .idata is needed for backwards compatibility. FIXME. */
698 add_data_entry (abfd, extra, PE_IMPORT_TABLE, ".idata", ib);
699
700 /* For some reason, the virtual size (which is what's set by
701 add_data_entry) for .reloc is not the same as the size recorded
702 in this slot by MSVC; it doesn't seem to cause problems (so far),
703 but since it's the best we've got, use it. It does do the right
704 thing for .pdata. */
705 if (pe->has_reloc_section)
706 add_data_entry (abfd, extra, PE_BASE_RELOCATION_TABLE, ".reloc", ib);
707
708 {
709 asection *sec;
710 bfd_vma hsize = 0;
711 bfd_vma dsize = 0;
712 bfd_vma isize = 0;
713 bfd_vma tsize = 0;
714
715 for (sec = abfd->sections; sec; sec = sec->next)
716 {
717 int rounded = FA (sec->size);
718
719 /* The first non-zero section filepos is the header size.
720 Sections without contents will have a filepos of 0. */
721 if (hsize == 0)
722 hsize = sec->filepos;
723 if (sec->flags & SEC_DATA)
724 dsize += rounded;
725 if (sec->flags & SEC_CODE)
726 tsize += rounded;
727 /* The image size is the total VIRTUAL size (which is what is
728 in the virt_size field). Files have been seen (from MSVC
729 5.0 link.exe) where the file size of the .data segment is
730 quite small compared to the virtual size. Without this
731 fix, strip munges the file.
732
733 FIXME: We need to handle holes between sections, which may
734 happpen when we covert from another format. We just use
735 the virtual address and virtual size of the last section
736 for the image size. */
737 if (coff_section_data (abfd, sec) != NULL
738 && pei_section_data (abfd, sec) != NULL)
739 isize = (sec->vma - extra->ImageBase
740 + SA (FA (pei_section_data (abfd, sec)->virt_size)));
741 }
742
743 aouthdr_in->dsize = dsize;
744 aouthdr_in->tsize = tsize;
745 extra->SizeOfHeaders = hsize;
746 extra->SizeOfImage = isize;
747 }
748
749 H_PUT_16 (abfd, aouthdr_in->magic, aouthdr_out->standard.magic);
750
751 /* e.g. 219510000 is linker version 2.19 */
752 #define LINKER_VERSION ((short) (BFD_VERSION / 1000000))
753
754 /* This piece of magic sets the "linker version" field to
755 LINKER_VERSION. */
756 H_PUT_16 (abfd, (LINKER_VERSION / 100 + (LINKER_VERSION % 100) * 256),
757 aouthdr_out->standard.vstamp);
758
759 PUT_AOUTHDR_TSIZE (abfd, aouthdr_in->tsize, aouthdr_out->standard.tsize);
760 PUT_AOUTHDR_DSIZE (abfd, aouthdr_in->dsize, aouthdr_out->standard.dsize);
761 PUT_AOUTHDR_BSIZE (abfd, aouthdr_in->bsize, aouthdr_out->standard.bsize);
762 PUT_AOUTHDR_ENTRY (abfd, aouthdr_in->entry, aouthdr_out->standard.entry);
763 PUT_AOUTHDR_TEXT_START (abfd, aouthdr_in->text_start,
764 aouthdr_out->standard.text_start);
765
766 #if !defined(COFF_WITH_pep) && !defined(COFF_WITH_pex64)
767 /* PE32+ does not have data_start member! */
768 PUT_AOUTHDR_DATA_START (abfd, aouthdr_in->data_start,
769 aouthdr_out->standard.data_start);
770 #endif
771
772 PUT_OPTHDR_IMAGE_BASE (abfd, extra->ImageBase, aouthdr_out->ImageBase);
773 H_PUT_32 (abfd, extra->SectionAlignment, aouthdr_out->SectionAlignment);
774 H_PUT_32 (abfd, extra->FileAlignment, aouthdr_out->FileAlignment);
775 H_PUT_16 (abfd, extra->MajorOperatingSystemVersion,
776 aouthdr_out->MajorOperatingSystemVersion);
777 H_PUT_16 (abfd, extra->MinorOperatingSystemVersion,
778 aouthdr_out->MinorOperatingSystemVersion);
779 H_PUT_16 (abfd, extra->MajorImageVersion, aouthdr_out->MajorImageVersion);
780 H_PUT_16 (abfd, extra->MinorImageVersion, aouthdr_out->MinorImageVersion);
781 H_PUT_16 (abfd, extra->MajorSubsystemVersion,
782 aouthdr_out->MajorSubsystemVersion);
783 H_PUT_16 (abfd, extra->MinorSubsystemVersion,
784 aouthdr_out->MinorSubsystemVersion);
785 H_PUT_32 (abfd, extra->Reserved1, aouthdr_out->Reserved1);
786 H_PUT_32 (abfd, extra->SizeOfImage, aouthdr_out->SizeOfImage);
787 H_PUT_32 (abfd, extra->SizeOfHeaders, aouthdr_out->SizeOfHeaders);
788 H_PUT_32 (abfd, extra->CheckSum, aouthdr_out->CheckSum);
789 H_PUT_16 (abfd, extra->Subsystem, aouthdr_out->Subsystem);
790 H_PUT_16 (abfd, extra->DllCharacteristics, aouthdr_out->DllCharacteristics);
791 PUT_OPTHDR_SIZE_OF_STACK_RESERVE (abfd, extra->SizeOfStackReserve,
792 aouthdr_out->SizeOfStackReserve);
793 PUT_OPTHDR_SIZE_OF_STACK_COMMIT (abfd, extra->SizeOfStackCommit,
794 aouthdr_out->SizeOfStackCommit);
795 PUT_OPTHDR_SIZE_OF_HEAP_RESERVE (abfd, extra->SizeOfHeapReserve,
796 aouthdr_out->SizeOfHeapReserve);
797 PUT_OPTHDR_SIZE_OF_HEAP_COMMIT (abfd, extra->SizeOfHeapCommit,
798 aouthdr_out->SizeOfHeapCommit);
799 H_PUT_32 (abfd, extra->LoaderFlags, aouthdr_out->LoaderFlags);
800 H_PUT_32 (abfd, extra->NumberOfRvaAndSizes,
801 aouthdr_out->NumberOfRvaAndSizes);
802 {
803 int idx;
804
805 for (idx = 0; idx < IMAGE_NUMBEROF_DIRECTORY_ENTRIES; idx++)
806 {
807 H_PUT_32 (abfd, extra->DataDirectory[idx].VirtualAddress,
808 aouthdr_out->DataDirectory[idx][0]);
809 H_PUT_32 (abfd, extra->DataDirectory[idx].Size,
810 aouthdr_out->DataDirectory[idx][1]);
811 }
812 }
813
814 return AOUTSZ;
815 }
816
817 unsigned int
818 _bfd_XXi_only_swap_filehdr_out (bfd * abfd, void * in, void * out)
819 {
820 int idx;
821 struct internal_filehdr *filehdr_in = (struct internal_filehdr *) in;
822 struct external_PEI_filehdr *filehdr_out = (struct external_PEI_filehdr *) out;
823
824 if (pe_data (abfd)->has_reloc_section
825 || pe_data (abfd)->dont_strip_reloc)
826 filehdr_in->f_flags &= ~F_RELFLG;
827
828 if (pe_data (abfd)->dll)
829 filehdr_in->f_flags |= F_DLL;
830
831 filehdr_in->pe.e_magic = IMAGE_DOS_SIGNATURE;
832 filehdr_in->pe.e_cblp = 0x90;
833 filehdr_in->pe.e_cp = 0x3;
834 filehdr_in->pe.e_crlc = 0x0;
835 filehdr_in->pe.e_cparhdr = 0x4;
836 filehdr_in->pe.e_minalloc = 0x0;
837 filehdr_in->pe.e_maxalloc = 0xffff;
838 filehdr_in->pe.e_ss = 0x0;
839 filehdr_in->pe.e_sp = 0xb8;
840 filehdr_in->pe.e_csum = 0x0;
841 filehdr_in->pe.e_ip = 0x0;
842 filehdr_in->pe.e_cs = 0x0;
843 filehdr_in->pe.e_lfarlc = 0x40;
844 filehdr_in->pe.e_ovno = 0x0;
845
846 for (idx = 0; idx < 4; idx++)
847 filehdr_in->pe.e_res[idx] = 0x0;
848
849 filehdr_in->pe.e_oemid = 0x0;
850 filehdr_in->pe.e_oeminfo = 0x0;
851
852 for (idx = 0; idx < 10; idx++)
853 filehdr_in->pe.e_res2[idx] = 0x0;
854
855 filehdr_in->pe.e_lfanew = 0x80;
856
857 /* This next collection of data are mostly just characters. It
858 appears to be constant within the headers put on NT exes. */
859 filehdr_in->pe.dos_message[0] = 0x0eba1f0e;
860 filehdr_in->pe.dos_message[1] = 0xcd09b400;
861 filehdr_in->pe.dos_message[2] = 0x4c01b821;
862 filehdr_in->pe.dos_message[3] = 0x685421cd;
863 filehdr_in->pe.dos_message[4] = 0x70207369;
864 filehdr_in->pe.dos_message[5] = 0x72676f72;
865 filehdr_in->pe.dos_message[6] = 0x63206d61;
866 filehdr_in->pe.dos_message[7] = 0x6f6e6e61;
867 filehdr_in->pe.dos_message[8] = 0x65622074;
868 filehdr_in->pe.dos_message[9] = 0x6e757220;
869 filehdr_in->pe.dos_message[10] = 0x206e6920;
870 filehdr_in->pe.dos_message[11] = 0x20534f44;
871 filehdr_in->pe.dos_message[12] = 0x65646f6d;
872 filehdr_in->pe.dos_message[13] = 0x0a0d0d2e;
873 filehdr_in->pe.dos_message[14] = 0x24;
874 filehdr_in->pe.dos_message[15] = 0x0;
875 filehdr_in->pe.nt_signature = IMAGE_NT_SIGNATURE;
876
877 H_PUT_16 (abfd, filehdr_in->f_magic, filehdr_out->f_magic);
878 H_PUT_16 (abfd, filehdr_in->f_nscns, filehdr_out->f_nscns);
879
880 /* Only use a real timestamp if the option was chosen. */
881 if ((pe_data (abfd)->insert_timestamp))
882 H_PUT_32 (abfd, time (0), filehdr_out->f_timdat);
883 else
884 H_PUT_32 (abfd, 0, filehdr_out->f_timdat);
885
886 PUT_FILEHDR_SYMPTR (abfd, filehdr_in->f_symptr,
887 filehdr_out->f_symptr);
888 H_PUT_32 (abfd, filehdr_in->f_nsyms, filehdr_out->f_nsyms);
889 H_PUT_16 (abfd, filehdr_in->f_opthdr, filehdr_out->f_opthdr);
890 H_PUT_16 (abfd, filehdr_in->f_flags, filehdr_out->f_flags);
891
892 /* Put in extra dos header stuff. This data remains essentially
893 constant, it just has to be tacked on to the beginning of all exes
894 for NT. */
895 H_PUT_16 (abfd, filehdr_in->pe.e_magic, filehdr_out->e_magic);
896 H_PUT_16 (abfd, filehdr_in->pe.e_cblp, filehdr_out->e_cblp);
897 H_PUT_16 (abfd, filehdr_in->pe.e_cp, filehdr_out->e_cp);
898 H_PUT_16 (abfd, filehdr_in->pe.e_crlc, filehdr_out->e_crlc);
899 H_PUT_16 (abfd, filehdr_in->pe.e_cparhdr, filehdr_out->e_cparhdr);
900 H_PUT_16 (abfd, filehdr_in->pe.e_minalloc, filehdr_out->e_minalloc);
901 H_PUT_16 (abfd, filehdr_in->pe.e_maxalloc, filehdr_out->e_maxalloc);
902 H_PUT_16 (abfd, filehdr_in->pe.e_ss, filehdr_out->e_ss);
903 H_PUT_16 (abfd, filehdr_in->pe.e_sp, filehdr_out->e_sp);
904 H_PUT_16 (abfd, filehdr_in->pe.e_csum, filehdr_out->e_csum);
905 H_PUT_16 (abfd, filehdr_in->pe.e_ip, filehdr_out->e_ip);
906 H_PUT_16 (abfd, filehdr_in->pe.e_cs, filehdr_out->e_cs);
907 H_PUT_16 (abfd, filehdr_in->pe.e_lfarlc, filehdr_out->e_lfarlc);
908 H_PUT_16 (abfd, filehdr_in->pe.e_ovno, filehdr_out->e_ovno);
909
910 for (idx = 0; idx < 4; idx++)
911 H_PUT_16 (abfd, filehdr_in->pe.e_res[idx], filehdr_out->e_res[idx]);
912
913 H_PUT_16 (abfd, filehdr_in->pe.e_oemid, filehdr_out->e_oemid);
914 H_PUT_16 (abfd, filehdr_in->pe.e_oeminfo, filehdr_out->e_oeminfo);
915
916 for (idx = 0; idx < 10; idx++)
917 H_PUT_16 (abfd, filehdr_in->pe.e_res2[idx], filehdr_out->e_res2[idx]);
918
919 H_PUT_32 (abfd, filehdr_in->pe.e_lfanew, filehdr_out->e_lfanew);
920
921 for (idx = 0; idx < 16; idx++)
922 H_PUT_32 (abfd, filehdr_in->pe.dos_message[idx],
923 filehdr_out->dos_message[idx]);
924
925 /* Also put in the NT signature. */
926 H_PUT_32 (abfd, filehdr_in->pe.nt_signature, filehdr_out->nt_signature);
927
928 return FILHSZ;
929 }
930
931 unsigned int
932 _bfd_XX_only_swap_filehdr_out (bfd * abfd, void * in, void * out)
933 {
934 struct internal_filehdr *filehdr_in = (struct internal_filehdr *) in;
935 FILHDR *filehdr_out = (FILHDR *) out;
936
937 H_PUT_16 (abfd, filehdr_in->f_magic, filehdr_out->f_magic);
938 H_PUT_16 (abfd, filehdr_in->f_nscns, filehdr_out->f_nscns);
939 H_PUT_32 (abfd, filehdr_in->f_timdat, filehdr_out->f_timdat);
940 PUT_FILEHDR_SYMPTR (abfd, filehdr_in->f_symptr, filehdr_out->f_symptr);
941 H_PUT_32 (abfd, filehdr_in->f_nsyms, filehdr_out->f_nsyms);
942 H_PUT_16 (abfd, filehdr_in->f_opthdr, filehdr_out->f_opthdr);
943 H_PUT_16 (abfd, filehdr_in->f_flags, filehdr_out->f_flags);
944
945 return FILHSZ;
946 }
947
948 unsigned int
949 _bfd_XXi_swap_scnhdr_out (bfd * abfd, void * in, void * out)
950 {
951 struct internal_scnhdr *scnhdr_int = (struct internal_scnhdr *) in;
952 SCNHDR *scnhdr_ext = (SCNHDR *) out;
953 unsigned int ret = SCNHSZ;
954 bfd_vma ps;
955 bfd_vma ss;
956
957 memcpy (scnhdr_ext->s_name, scnhdr_int->s_name, sizeof (scnhdr_int->s_name));
958
959 PUT_SCNHDR_VADDR (abfd,
960 ((scnhdr_int->s_vaddr
961 - pe_data (abfd)->pe_opthdr.ImageBase)
962 & 0xffffffff),
963 scnhdr_ext->s_vaddr);
964
965 /* NT wants the size data to be rounded up to the next
966 NT_FILE_ALIGNMENT, but zero if it has no content (as in .bss,
967 sometimes). */
968 if ((scnhdr_int->s_flags & IMAGE_SCN_CNT_UNINITIALIZED_DATA) != 0)
969 {
970 if (bfd_pei_p (abfd))
971 {
972 ps = scnhdr_int->s_size;
973 ss = 0;
974 }
975 else
976 {
977 ps = 0;
978 ss = scnhdr_int->s_size;
979 }
980 }
981 else
982 {
983 if (bfd_pei_p (abfd))
984 ps = scnhdr_int->s_paddr;
985 else
986 ps = 0;
987
988 ss = scnhdr_int->s_size;
989 }
990
991 PUT_SCNHDR_SIZE (abfd, ss,
992 scnhdr_ext->s_size);
993
994 /* s_paddr in PE is really the virtual size. */
995 PUT_SCNHDR_PADDR (abfd, ps, scnhdr_ext->s_paddr);
996
997 PUT_SCNHDR_SCNPTR (abfd, scnhdr_int->s_scnptr,
998 scnhdr_ext->s_scnptr);
999 PUT_SCNHDR_RELPTR (abfd, scnhdr_int->s_relptr,
1000 scnhdr_ext->s_relptr);
1001 PUT_SCNHDR_LNNOPTR (abfd, scnhdr_int->s_lnnoptr,
1002 scnhdr_ext->s_lnnoptr);
1003
1004 {
1005 /* Extra flags must be set when dealing with PE. All sections should also
1006 have the IMAGE_SCN_MEM_READ (0x40000000) flag set. In addition, the
1007 .text section must have IMAGE_SCN_MEM_EXECUTE (0x20000000) and the data
1008 sections (.idata, .data, .bss, .CRT) must have IMAGE_SCN_MEM_WRITE set
1009 (this is especially important when dealing with the .idata section since
1010 the addresses for routines from .dlls must be overwritten). If .reloc
1011 section data is ever generated, we must add IMAGE_SCN_MEM_DISCARDABLE
1012 (0x02000000). Also, the resource data should also be read and
1013 writable. */
1014
1015 /* FIXME: Alignment is also encoded in this field, at least on PPC and
1016 ARM-WINCE. Although - how do we get the original alignment field
1017 back ? */
1018
1019 typedef struct
1020 {
1021 const char * section_name;
1022 unsigned long must_have;
1023 }
1024 pe_required_section_flags;
1025
1026 pe_required_section_flags known_sections [] =
1027 {
1028 { ".arch", IMAGE_SCN_MEM_READ | IMAGE_SCN_CNT_INITIALIZED_DATA | IMAGE_SCN_MEM_DISCARDABLE | IMAGE_SCN_ALIGN_8BYTES },
1029 { ".bss", IMAGE_SCN_MEM_READ | IMAGE_SCN_CNT_UNINITIALIZED_DATA | IMAGE_SCN_MEM_WRITE },
1030 { ".data", IMAGE_SCN_MEM_READ | IMAGE_SCN_CNT_INITIALIZED_DATA | IMAGE_SCN_MEM_WRITE },
1031 { ".edata", IMAGE_SCN_MEM_READ | IMAGE_SCN_CNT_INITIALIZED_DATA },
1032 { ".idata", IMAGE_SCN_MEM_READ | IMAGE_SCN_CNT_INITIALIZED_DATA | IMAGE_SCN_MEM_WRITE },
1033 { ".pdata", IMAGE_SCN_MEM_READ | IMAGE_SCN_CNT_INITIALIZED_DATA },
1034 { ".rdata", IMAGE_SCN_MEM_READ | IMAGE_SCN_CNT_INITIALIZED_DATA },
1035 { ".reloc", IMAGE_SCN_MEM_READ | IMAGE_SCN_CNT_INITIALIZED_DATA | IMAGE_SCN_MEM_DISCARDABLE },
1036 { ".rsrc", IMAGE_SCN_MEM_READ | IMAGE_SCN_CNT_INITIALIZED_DATA | IMAGE_SCN_MEM_WRITE },
1037 { ".text" , IMAGE_SCN_MEM_READ | IMAGE_SCN_CNT_CODE | IMAGE_SCN_MEM_EXECUTE },
1038 { ".tls", IMAGE_SCN_MEM_READ | IMAGE_SCN_CNT_INITIALIZED_DATA | IMAGE_SCN_MEM_WRITE },
1039 { ".xdata", IMAGE_SCN_MEM_READ | IMAGE_SCN_CNT_INITIALIZED_DATA },
1040 { NULL, 0}
1041 };
1042
1043 pe_required_section_flags * p;
1044
1045 /* We have defaulted to adding the IMAGE_SCN_MEM_WRITE flag, but now
1046 we know exactly what this specific section wants so we remove it
1047 and then allow the must_have field to add it back in if necessary.
1048 However, we don't remove IMAGE_SCN_MEM_WRITE flag from .text if the
1049 default WP_TEXT file flag has been cleared. WP_TEXT may be cleared
1050 by ld --enable-auto-import (if auto-import is actually needed),
1051 by ld --omagic, or by obcopy --writable-text. */
1052
1053 for (p = known_sections; p->section_name; p++)
1054 if (strcmp (scnhdr_int->s_name, p->section_name) == 0)
1055 {
1056 if (strcmp (scnhdr_int->s_name, ".text")
1057 || (bfd_get_file_flags (abfd) & WP_TEXT))
1058 scnhdr_int->s_flags &= ~IMAGE_SCN_MEM_WRITE;
1059 scnhdr_int->s_flags |= p->must_have;
1060 break;
1061 }
1062
1063 H_PUT_32 (abfd, scnhdr_int->s_flags, scnhdr_ext->s_flags);
1064 }
1065
1066 if (coff_data (abfd)->link_info
1067 && ! bfd_link_relocatable (coff_data (abfd)->link_info)
1068 && ! bfd_link_pic (coff_data (abfd)->link_info)
1069 && strcmp (scnhdr_int->s_name, ".text") == 0)
1070 {
1071 /* By inference from looking at MS output, the 32 bit field
1072 which is the combination of the number_of_relocs and
1073 number_of_linenos is used for the line number count in
1074 executables. A 16-bit field won't do for cc1. The MS
1075 document says that the number of relocs is zero for
1076 executables, but the 17-th bit has been observed to be there.
1077 Overflow is not an issue: a 4G-line program will overflow a
1078 bunch of other fields long before this! */
1079 H_PUT_16 (abfd, (scnhdr_int->s_nlnno & 0xffff), scnhdr_ext->s_nlnno);
1080 H_PUT_16 (abfd, (scnhdr_int->s_nlnno >> 16), scnhdr_ext->s_nreloc);
1081 }
1082 else
1083 {
1084 if (scnhdr_int->s_nlnno <= 0xffff)
1085 H_PUT_16 (abfd, scnhdr_int->s_nlnno, scnhdr_ext->s_nlnno);
1086 else
1087 {
1088 /* xgettext:c-format */
1089 _bfd_error_handler (_("%pB: line number overflow: 0x%lx > 0xffff"),
1090 abfd, scnhdr_int->s_nlnno);
1091 bfd_set_error (bfd_error_file_truncated);
1092 H_PUT_16 (abfd, 0xffff, scnhdr_ext->s_nlnno);
1093 ret = 0;
1094 }
1095
1096 /* Although we could encode 0xffff relocs here, we do not, to be
1097 consistent with other parts of bfd. Also it lets us warn, as
1098 we should never see 0xffff here w/o having the overflow flag
1099 set. */
1100 if (scnhdr_int->s_nreloc < 0xffff)
1101 H_PUT_16 (abfd, scnhdr_int->s_nreloc, scnhdr_ext->s_nreloc);
1102 else
1103 {
1104 /* PE can deal with large #s of relocs, but not here. */
1105 H_PUT_16 (abfd, 0xffff, scnhdr_ext->s_nreloc);
1106 scnhdr_int->s_flags |= IMAGE_SCN_LNK_NRELOC_OVFL;
1107 H_PUT_32 (abfd, scnhdr_int->s_flags, scnhdr_ext->s_flags);
1108 }
1109 }
1110 return ret;
1111 }
1112
1113 void
1114 _bfd_XXi_swap_debugdir_in (bfd * abfd, void * ext1, void * in1)
1115 {
1116 struct external_IMAGE_DEBUG_DIRECTORY *ext = (struct external_IMAGE_DEBUG_DIRECTORY *) ext1;
1117 struct internal_IMAGE_DEBUG_DIRECTORY *in = (struct internal_IMAGE_DEBUG_DIRECTORY *) in1;
1118
1119 in->Characteristics = H_GET_32(abfd, ext->Characteristics);
1120 in->TimeDateStamp = H_GET_32(abfd, ext->TimeDateStamp);
1121 in->MajorVersion = H_GET_16(abfd, ext->MajorVersion);
1122 in->MinorVersion = H_GET_16(abfd, ext->MinorVersion);
1123 in->Type = H_GET_32(abfd, ext->Type);
1124 in->SizeOfData = H_GET_32(abfd, ext->SizeOfData);
1125 in->AddressOfRawData = H_GET_32(abfd, ext->AddressOfRawData);
1126 in->PointerToRawData = H_GET_32(abfd, ext->PointerToRawData);
1127 }
1128
1129 unsigned int
1130 _bfd_XXi_swap_debugdir_out (bfd * abfd, void * inp, void * extp)
1131 {
1132 struct external_IMAGE_DEBUG_DIRECTORY *ext = (struct external_IMAGE_DEBUG_DIRECTORY *) extp;
1133 struct internal_IMAGE_DEBUG_DIRECTORY *in = (struct internal_IMAGE_DEBUG_DIRECTORY *) inp;
1134
1135 H_PUT_32(abfd, in->Characteristics, ext->Characteristics);
1136 H_PUT_32(abfd, in->TimeDateStamp, ext->TimeDateStamp);
1137 H_PUT_16(abfd, in->MajorVersion, ext->MajorVersion);
1138 H_PUT_16(abfd, in->MinorVersion, ext->MinorVersion);
1139 H_PUT_32(abfd, in->Type, ext->Type);
1140 H_PUT_32(abfd, in->SizeOfData, ext->SizeOfData);
1141 H_PUT_32(abfd, in->AddressOfRawData, ext->AddressOfRawData);
1142 H_PUT_32(abfd, in->PointerToRawData, ext->PointerToRawData);
1143
1144 return sizeof (struct external_IMAGE_DEBUG_DIRECTORY);
1145 }
1146
1147 CODEVIEW_INFO *
1148 _bfd_XXi_slurp_codeview_record (bfd * abfd, file_ptr where, unsigned long length, CODEVIEW_INFO *cvinfo)
1149 {
1150 char buffer[256+1];
1151
1152 if (bfd_seek (abfd, where, SEEK_SET) != 0)
1153 return NULL;
1154
1155 if (bfd_bread (buffer, 256, abfd) < 4)
1156 return NULL;
1157
1158 /* Ensure null termination of filename. */
1159 buffer[256] = '\0';
1160
1161 cvinfo->CVSignature = H_GET_32 (abfd, buffer);
1162 cvinfo->Age = 0;
1163
1164 if ((cvinfo->CVSignature == CVINFO_PDB70_CVSIGNATURE)
1165 && (length > sizeof (CV_INFO_PDB70)))
1166 {
1167 CV_INFO_PDB70 *cvinfo70 = (CV_INFO_PDB70 *)(buffer);
1168
1169 cvinfo->Age = H_GET_32(abfd, cvinfo70->Age);
1170
1171 /* A GUID consists of 4,2,2 byte values in little-endian order, followed
1172 by 8 single bytes. Byte swap them so we can conveniently treat the GUID
1173 as 16 bytes in big-endian order. */
1174 bfd_putb32 (bfd_getl32 (cvinfo70->Signature), cvinfo->Signature);
1175 bfd_putb16 (bfd_getl16 (&(cvinfo70->Signature[4])), &(cvinfo->Signature[4]));
1176 bfd_putb16 (bfd_getl16 (&(cvinfo70->Signature[6])), &(cvinfo->Signature[6]));
1177 memcpy (&(cvinfo->Signature[8]), &(cvinfo70->Signature[8]), 8);
1178
1179 cvinfo->SignatureLength = CV_INFO_SIGNATURE_LENGTH;
1180 // cvinfo->PdbFileName = cvinfo70->PdbFileName;
1181
1182 return cvinfo;
1183 }
1184 else if ((cvinfo->CVSignature == CVINFO_PDB20_CVSIGNATURE)
1185 && (length > sizeof (CV_INFO_PDB20)))
1186 {
1187 CV_INFO_PDB20 *cvinfo20 = (CV_INFO_PDB20 *)(buffer);
1188 cvinfo->Age = H_GET_32(abfd, cvinfo20->Age);
1189 memcpy (cvinfo->Signature, cvinfo20->Signature, 4);
1190 cvinfo->SignatureLength = 4;
1191 // cvinfo->PdbFileName = cvinfo20->PdbFileName;
1192
1193 return cvinfo;
1194 }
1195
1196 return NULL;
1197 }
1198
1199 unsigned int
1200 _bfd_XXi_write_codeview_record (bfd * abfd, file_ptr where, CODEVIEW_INFO *cvinfo)
1201 {
1202 const bfd_size_type size = sizeof (CV_INFO_PDB70) + 1;
1203 bfd_size_type written;
1204 CV_INFO_PDB70 *cvinfo70;
1205 char * buffer;
1206
1207 if (bfd_seek (abfd, where, SEEK_SET) != 0)
1208 return 0;
1209
1210 buffer = xmalloc (size);
1211 cvinfo70 = (CV_INFO_PDB70 *) buffer;
1212 H_PUT_32 (abfd, CVINFO_PDB70_CVSIGNATURE, cvinfo70->CvSignature);
1213
1214 /* Byte swap the GUID from 16 bytes in big-endian order to 4,2,2 byte values
1215 in little-endian order, followed by 8 single bytes. */
1216 bfd_putl32 (bfd_getb32 (cvinfo->Signature), cvinfo70->Signature);
1217 bfd_putl16 (bfd_getb16 (&(cvinfo->Signature[4])), &(cvinfo70->Signature[4]));
1218 bfd_putl16 (bfd_getb16 (&(cvinfo->Signature[6])), &(cvinfo70->Signature[6]));
1219 memcpy (&(cvinfo70->Signature[8]), &(cvinfo->Signature[8]), 8);
1220
1221 H_PUT_32 (abfd, cvinfo->Age, cvinfo70->Age);
1222 cvinfo70->PdbFileName[0] = '\0';
1223
1224 written = bfd_bwrite (buffer, size, abfd);
1225
1226 free (buffer);
1227
1228 return written == size ? size : 0;
1229 }
1230
1231 static char * dir_names[IMAGE_NUMBEROF_DIRECTORY_ENTRIES] =
1232 {
1233 N_("Export Directory [.edata (or where ever we found it)]"),
1234 N_("Import Directory [parts of .idata]"),
1235 N_("Resource Directory [.rsrc]"),
1236 N_("Exception Directory [.pdata]"),
1237 N_("Security Directory"),
1238 N_("Base Relocation Directory [.reloc]"),
1239 N_("Debug Directory"),
1240 N_("Description Directory"),
1241 N_("Special Directory"),
1242 N_("Thread Storage Directory [.tls]"),
1243 N_("Load Configuration Directory"),
1244 N_("Bound Import Directory"),
1245 N_("Import Address Table Directory"),
1246 N_("Delay Import Directory"),
1247 N_("CLR Runtime Header"),
1248 N_("Reserved")
1249 };
1250
1251 #ifdef POWERPC_LE_PE
1252 /* The code for the PPC really falls in the "architecture dependent"
1253 category. However, it's not clear that anyone will ever care, so
1254 we're ignoring the issue for now; if/when PPC matters, some of this
1255 may need to go into peicode.h, or arguments passed to enable the
1256 PPC- specific code. */
1257 #endif
1258
1259 static bfd_boolean
1260 pe_print_idata (bfd * abfd, void * vfile)
1261 {
1262 FILE *file = (FILE *) vfile;
1263 bfd_byte *data;
1264 asection *section;
1265 bfd_signed_vma adj;
1266
1267 #ifdef POWERPC_LE_PE
1268 asection *rel_section = bfd_get_section_by_name (abfd, ".reldata");
1269 #endif
1270
1271 bfd_size_type datasize = 0;
1272 bfd_size_type dataoff;
1273 bfd_size_type i;
1274 int onaline = 20;
1275
1276 pe_data_type *pe = pe_data (abfd);
1277 struct internal_extra_pe_aouthdr *extra = &pe->pe_opthdr;
1278
1279 bfd_vma addr;
1280
1281 addr = extra->DataDirectory[PE_IMPORT_TABLE].VirtualAddress;
1282
1283 if (addr == 0 && extra->DataDirectory[PE_IMPORT_TABLE].Size == 0)
1284 {
1285 /* Maybe the extra header isn't there. Look for the section. */
1286 section = bfd_get_section_by_name (abfd, ".idata");
1287 if (section == NULL)
1288 return TRUE;
1289
1290 addr = section->vma;
1291 datasize = section->size;
1292 if (datasize == 0)
1293 return TRUE;
1294 }
1295 else
1296 {
1297 addr += extra->ImageBase;
1298 for (section = abfd->sections; section != NULL; section = section->next)
1299 {
1300 datasize = section->size;
1301 if (addr >= section->vma && addr < section->vma + datasize)
1302 break;
1303 }
1304
1305 if (section == NULL)
1306 {
1307 fprintf (file,
1308 _("\nThere is an import table, but the section containing it could not be found\n"));
1309 return TRUE;
1310 }
1311 else if (!(section->flags & SEC_HAS_CONTENTS))
1312 {
1313 fprintf (file,
1314 _("\nThere is an import table in %s, but that section has no contents\n"),
1315 section->name);
1316 return TRUE;
1317 }
1318 }
1319
1320 /* xgettext:c-format */
1321 fprintf (file, _("\nThere is an import table in %s at 0x%lx\n"),
1322 section->name, (unsigned long) addr);
1323
1324 dataoff = addr - section->vma;
1325
1326 #ifdef POWERPC_LE_PE
1327 if (rel_section != 0 && rel_section->size != 0)
1328 {
1329 /* The toc address can be found by taking the starting address,
1330 which on the PPC locates a function descriptor. The
1331 descriptor consists of the function code starting address
1332 followed by the address of the toc. The starting address we
1333 get from the bfd, and the descriptor is supposed to be in the
1334 .reldata section. */
1335
1336 bfd_vma loadable_toc_address;
1337 bfd_vma toc_address;
1338 bfd_vma start_address;
1339 bfd_byte *data;
1340 bfd_vma offset;
1341
1342 if (!bfd_malloc_and_get_section (abfd, rel_section, &data))
1343 {
1344 if (data != NULL)
1345 free (data);
1346 return FALSE;
1347 }
1348
1349 offset = abfd->start_address - rel_section->vma;
1350
1351 if (offset >= rel_section->size || offset + 8 > rel_section->size)
1352 {
1353 if (data != NULL)
1354 free (data);
1355 return FALSE;
1356 }
1357
1358 start_address = bfd_get_32 (abfd, data + offset);
1359 loadable_toc_address = bfd_get_32 (abfd, data + offset + 4);
1360 toc_address = loadable_toc_address - 32768;
1361
1362 fprintf (file,
1363 _("\nFunction descriptor located at the start address: %04lx\n"),
1364 (unsigned long int) (abfd->start_address));
1365 fprintf (file,
1366 /* xgettext:c-format */
1367 _("\tcode-base %08lx toc (loadable/actual) %08lx/%08lx\n"),
1368 start_address, loadable_toc_address, toc_address);
1369 if (data != NULL)
1370 free (data);
1371 }
1372 else
1373 {
1374 fprintf (file,
1375 _("\nNo reldata section! Function descriptor not decoded.\n"));
1376 }
1377 #endif
1378
1379 fprintf (file,
1380 _("\nThe Import Tables (interpreted %s section contents)\n"),
1381 section->name);
1382 fprintf (file,
1383 _("\
1384 vma: Hint Time Forward DLL First\n\
1385 Table Stamp Chain Name Thunk\n"));
1386
1387 /* Read the whole section. Some of the fields might be before dataoff. */
1388 if (!bfd_malloc_and_get_section (abfd, section, &data))
1389 {
1390 if (data != NULL)
1391 free (data);
1392 return FALSE;
1393 }
1394
1395 adj = section->vma - extra->ImageBase;
1396
1397 /* Print all image import descriptors. */
1398 for (i = dataoff; i + onaline <= datasize; i += onaline)
1399 {
1400 bfd_vma hint_addr;
1401 bfd_vma time_stamp;
1402 bfd_vma forward_chain;
1403 bfd_vma dll_name;
1404 bfd_vma first_thunk;
1405 int idx = 0;
1406 bfd_size_type j;
1407 char *dll;
1408
1409 /* Print (i + extra->DataDirectory[PE_IMPORT_TABLE].VirtualAddress). */
1410 fprintf (file, " %08lx\t", (unsigned long) (i + adj));
1411 hint_addr = bfd_get_32 (abfd, data + i);
1412 time_stamp = bfd_get_32 (abfd, data + i + 4);
1413 forward_chain = bfd_get_32 (abfd, data + i + 8);
1414 dll_name = bfd_get_32 (abfd, data + i + 12);
1415 first_thunk = bfd_get_32 (abfd, data + i + 16);
1416
1417 fprintf (file, "%08lx %08lx %08lx %08lx %08lx\n",
1418 (unsigned long) hint_addr,
1419 (unsigned long) time_stamp,
1420 (unsigned long) forward_chain,
1421 (unsigned long) dll_name,
1422 (unsigned long) first_thunk);
1423
1424 if (hint_addr == 0 && first_thunk == 0)
1425 break;
1426
1427 if (dll_name - adj >= section->size)
1428 break;
1429
1430 dll = (char *) data + dll_name - adj;
1431 /* PR 17512 file: 078-12277-0.004. */
1432 bfd_size_type maxlen = (char *)(data + datasize) - dll - 1;
1433 fprintf (file, _("\n\tDLL Name: %.*s\n"), (int) maxlen, dll);
1434
1435 /* PR 21546: When the Hint Address is zero,
1436 we try the First Thunk instead. */
1437 if (hint_addr == 0)
1438 hint_addr = first_thunk;
1439
1440 if (hint_addr != 0)
1441 {
1442 bfd_byte *ft_data;
1443 asection *ft_section;
1444 bfd_vma ft_addr;
1445 bfd_size_type ft_datasize;
1446 int ft_idx;
1447 int ft_allocated;
1448
1449 fprintf (file, _("\tvma: Hint/Ord Member-Name Bound-To\n"));
1450
1451 idx = hint_addr - adj;
1452
1453 ft_addr = first_thunk + extra->ImageBase;
1454 ft_idx = first_thunk - adj;
1455 ft_data = data + ft_idx;
1456 ft_datasize = datasize - ft_idx;
1457 ft_allocated = 0;
1458
1459 if (first_thunk != hint_addr)
1460 {
1461 /* Find the section which contains the first thunk. */
1462 for (ft_section = abfd->sections;
1463 ft_section != NULL;
1464 ft_section = ft_section->next)
1465 {
1466 if (ft_addr >= ft_section->vma
1467 && ft_addr < ft_section->vma + ft_section->size)
1468 break;
1469 }
1470
1471 if (ft_section == NULL)
1472 {
1473 fprintf (file,
1474 _("\nThere is a first thunk, but the section containing it could not be found\n"));
1475 continue;
1476 }
1477
1478 /* Now check to see if this section is the same as our current
1479 section. If it is not then we will have to load its data in. */
1480 if (ft_section != section)
1481 {
1482 ft_idx = first_thunk - (ft_section->vma - extra->ImageBase);
1483 ft_datasize = ft_section->size - ft_idx;
1484 ft_data = (bfd_byte *) bfd_malloc (ft_datasize);
1485 if (ft_data == NULL)
1486 continue;
1487
1488 /* Read ft_datasize bytes starting at offset ft_idx. */
1489 if (!bfd_get_section_contents (abfd, ft_section, ft_data,
1490 (bfd_vma) ft_idx, ft_datasize))
1491 {
1492 free (ft_data);
1493 continue;
1494 }
1495 ft_allocated = 1;
1496 }
1497 }
1498
1499 /* Print HintName vector entries. */
1500 #ifdef COFF_WITH_pex64
1501 for (j = 0; idx + j + 8 <= datasize; j += 8)
1502 {
1503 bfd_size_type amt;
1504 unsigned long member = bfd_get_32 (abfd, data + idx + j);
1505 unsigned long member_high = bfd_get_32 (abfd, data + idx + j + 4);
1506
1507 if (!member && !member_high)
1508 break;
1509
1510 amt = member - adj;
1511
1512 if (HighBitSet (member_high))
1513 fprintf (file, "\t%lx%08lx\t %4lx%08lx <none>",
1514 member_high, member,
1515 WithoutHighBit (member_high), member);
1516 /* PR binutils/17512: Handle corrupt PE data. */
1517 else if (amt >= datasize || amt + 2 >= datasize)
1518 fprintf (file, _("\t<corrupt: 0x%04lx>"), member);
1519 else
1520 {
1521 int ordinal;
1522 char *member_name;
1523
1524 ordinal = bfd_get_16 (abfd, data + amt);
1525 member_name = (char *) data + amt + 2;
1526 fprintf (file, "\t%04lx\t %4d %.*s",member, ordinal,
1527 (int) (datasize - (amt + 2)), member_name);
1528 }
1529
1530 /* If the time stamp is not zero, the import address
1531 table holds actual addresses. */
1532 if (time_stamp != 0
1533 && first_thunk != 0
1534 && first_thunk != hint_addr
1535 && j + 4 <= ft_datasize)
1536 fprintf (file, "\t%04lx",
1537 (unsigned long) bfd_get_32 (abfd, ft_data + j));
1538 fprintf (file, "\n");
1539 }
1540 #else
1541 for (j = 0; idx + j + 4 <= datasize; j += 4)
1542 {
1543 bfd_size_type amt;
1544 unsigned long member = bfd_get_32 (abfd, data + idx + j);
1545
1546 /* Print single IMAGE_IMPORT_BY_NAME vector. */
1547 if (member == 0)
1548 break;
1549
1550 amt = member - adj;
1551
1552 if (HighBitSet (member))
1553 fprintf (file, "\t%04lx\t %4lu <none>",
1554 member, WithoutHighBit (member));
1555 /* PR binutils/17512: Handle corrupt PE data. */
1556 else if (amt >= datasize || amt + 2 >= datasize)
1557 fprintf (file, _("\t<corrupt: 0x%04lx>"), member);
1558 else
1559 {
1560 int ordinal;
1561 char *member_name;
1562
1563 ordinal = bfd_get_16 (abfd, data + amt);
1564 member_name = (char *) data + amt + 2;
1565 fprintf (file, "\t%04lx\t %4d %.*s",
1566 member, ordinal,
1567 (int) (datasize - (amt + 2)), member_name);
1568 }
1569
1570 /* If the time stamp is not zero, the import address
1571 table holds actual addresses. */
1572 if (time_stamp != 0
1573 && first_thunk != 0
1574 && first_thunk != hint_addr
1575 && j + 4 <= ft_datasize)
1576 fprintf (file, "\t%04lx",
1577 (unsigned long) bfd_get_32 (abfd, ft_data + j));
1578
1579 fprintf (file, "\n");
1580 }
1581 #endif
1582 if (ft_allocated)
1583 free (ft_data);
1584 }
1585
1586 fprintf (file, "\n");
1587 }
1588
1589 free (data);
1590
1591 return TRUE;
1592 }
1593
1594 static bfd_boolean
1595 pe_print_edata (bfd * abfd, void * vfile)
1596 {
1597 FILE *file = (FILE *) vfile;
1598 bfd_byte *data;
1599 asection *section;
1600 bfd_size_type datasize = 0;
1601 bfd_size_type dataoff;
1602 bfd_size_type i;
1603 bfd_vma adj;
1604 struct EDT_type
1605 {
1606 long export_flags; /* Reserved - should be zero. */
1607 long time_stamp;
1608 short major_ver;
1609 short minor_ver;
1610 bfd_vma name; /* RVA - relative to image base. */
1611 long base; /* Ordinal base. */
1612 unsigned long num_functions;/* Number in the export address table. */
1613 unsigned long num_names; /* Number in the name pointer table. */
1614 bfd_vma eat_addr; /* RVA to the export address table. */
1615 bfd_vma npt_addr; /* RVA to the Export Name Pointer Table. */
1616 bfd_vma ot_addr; /* RVA to the Ordinal Table. */
1617 } edt;
1618
1619 pe_data_type *pe = pe_data (abfd);
1620 struct internal_extra_pe_aouthdr *extra = &pe->pe_opthdr;
1621
1622 bfd_vma addr;
1623
1624 addr = extra->DataDirectory[PE_EXPORT_TABLE].VirtualAddress;
1625
1626 if (addr == 0 && extra->DataDirectory[PE_EXPORT_TABLE].Size == 0)
1627 {
1628 /* Maybe the extra header isn't there. Look for the section. */
1629 section = bfd_get_section_by_name (abfd, ".edata");
1630 if (section == NULL)
1631 return TRUE;
1632
1633 addr = section->vma;
1634 dataoff = 0;
1635 datasize = section->size;
1636 if (datasize == 0)
1637 return TRUE;
1638 }
1639 else
1640 {
1641 addr += extra->ImageBase;
1642
1643 for (section = abfd->sections; section != NULL; section = section->next)
1644 if (addr >= section->vma && addr < section->vma + section->size)
1645 break;
1646
1647 if (section == NULL)
1648 {
1649 fprintf (file,
1650 _("\nThere is an export table, but the section containing it could not be found\n"));
1651 return TRUE;
1652 }
1653 else if (!(section->flags & SEC_HAS_CONTENTS))
1654 {
1655 fprintf (file,
1656 _("\nThere is an export table in %s, but that section has no contents\n"),
1657 section->name);
1658 return TRUE;
1659 }
1660
1661 dataoff = addr - section->vma;
1662 datasize = extra->DataDirectory[PE_EXPORT_TABLE].Size;
1663 if (datasize > section->size - dataoff)
1664 {
1665 fprintf (file,
1666 _("\nThere is an export table in %s, but it does not fit into that section\n"),
1667 section->name);
1668 return TRUE;
1669 }
1670 }
1671
1672 /* PR 17512: Handle corrupt PE binaries. */
1673 if (datasize < 36)
1674 {
1675 fprintf (file,
1676 /* xgettext:c-format */
1677 _("\nThere is an export table in %s, but it is too small (%d)\n"),
1678 section->name, (int) datasize);
1679 return TRUE;
1680 }
1681
1682 /* xgettext:c-format */
1683 fprintf (file, _("\nThere is an export table in %s at 0x%lx\n"),
1684 section->name, (unsigned long) addr);
1685
1686 data = (bfd_byte *) bfd_malloc (datasize);
1687 if (data == NULL)
1688 return FALSE;
1689
1690 if (! bfd_get_section_contents (abfd, section, data,
1691 (file_ptr) dataoff, datasize))
1692 return FALSE;
1693
1694 /* Go get Export Directory Table. */
1695 edt.export_flags = bfd_get_32 (abfd, data + 0);
1696 edt.time_stamp = bfd_get_32 (abfd, data + 4);
1697 edt.major_ver = bfd_get_16 (abfd, data + 8);
1698 edt.minor_ver = bfd_get_16 (abfd, data + 10);
1699 edt.name = bfd_get_32 (abfd, data + 12);
1700 edt.base = bfd_get_32 (abfd, data + 16);
1701 edt.num_functions = bfd_get_32 (abfd, data + 20);
1702 edt.num_names = bfd_get_32 (abfd, data + 24);
1703 edt.eat_addr = bfd_get_32 (abfd, data + 28);
1704 edt.npt_addr = bfd_get_32 (abfd, data + 32);
1705 edt.ot_addr = bfd_get_32 (abfd, data + 36);
1706
1707 adj = section->vma - extra->ImageBase + dataoff;
1708
1709 /* Dump the EDT first. */
1710 fprintf (file,
1711 _("\nThe Export Tables (interpreted %s section contents)\n\n"),
1712 section->name);
1713
1714 fprintf (file,
1715 _("Export Flags \t\t\t%lx\n"), (unsigned long) edt.export_flags);
1716
1717 fprintf (file,
1718 _("Time/Date stamp \t\t%lx\n"), (unsigned long) edt.time_stamp);
1719
1720 fprintf (file,
1721 /* xgettext:c-format */
1722 _("Major/Minor \t\t\t%d/%d\n"), edt.major_ver, edt.minor_ver);
1723
1724 fprintf (file,
1725 _("Name \t\t\t\t"));
1726 bfd_fprintf_vma (abfd, file, edt.name);
1727
1728 if ((edt.name >= adj) && (edt.name < adj + datasize))
1729 fprintf (file, " %.*s\n",
1730 (int) (datasize - (edt.name - adj)),
1731 data + edt.name - adj);
1732 else
1733 fprintf (file, "(outside .edata section)\n");
1734
1735 fprintf (file,
1736 _("Ordinal Base \t\t\t%ld\n"), edt.base);
1737
1738 fprintf (file,
1739 _("Number in:\n"));
1740
1741 fprintf (file,
1742 _("\tExport Address Table \t\t%08lx\n"),
1743 edt.num_functions);
1744
1745 fprintf (file,
1746 _("\t[Name Pointer/Ordinal] Table\t%08lx\n"), edt.num_names);
1747
1748 fprintf (file,
1749 _("Table Addresses\n"));
1750
1751 fprintf (file,
1752 _("\tExport Address Table \t\t"));
1753 bfd_fprintf_vma (abfd, file, edt.eat_addr);
1754 fprintf (file, "\n");
1755
1756 fprintf (file,
1757 _("\tName Pointer Table \t\t"));
1758 bfd_fprintf_vma (abfd, file, edt.npt_addr);
1759 fprintf (file, "\n");
1760
1761 fprintf (file,
1762 _("\tOrdinal Table \t\t\t"));
1763 bfd_fprintf_vma (abfd, file, edt.ot_addr);
1764 fprintf (file, "\n");
1765
1766 /* The next table to find is the Export Address Table. It's basically
1767 a list of pointers that either locate a function in this dll, or
1768 forward the call to another dll. Something like:
1769 typedef union
1770 {
1771 long export_rva;
1772 long forwarder_rva;
1773 } export_address_table_entry; */
1774
1775 fprintf (file,
1776 _("\nExport Address Table -- Ordinal Base %ld\n"),
1777 edt.base);
1778
1779 /* PR 17512: Handle corrupt PE binaries. */
1780 if (edt.eat_addr + (edt.num_functions * 4) - adj >= datasize
1781 /* PR 17512: file: 092b1829 */
1782 || (edt.num_functions * 4) < edt.num_functions
1783 /* PR 17512 file: 140-165018-0.004. */
1784 || data + edt.eat_addr - adj < data)
1785 fprintf (file, _("\tInvalid Export Address Table rva (0x%lx) or entry count (0x%lx)\n"),
1786 (long) edt.eat_addr,
1787 (long) edt.num_functions);
1788 else for (i = 0; i < edt.num_functions; ++i)
1789 {
1790 bfd_vma eat_member = bfd_get_32 (abfd,
1791 data + edt.eat_addr + (i * 4) - adj);
1792 if (eat_member == 0)
1793 continue;
1794
1795 if (eat_member - adj <= datasize)
1796 {
1797 /* This rva is to a name (forwarding function) in our section. */
1798 /* Should locate a function descriptor. */
1799 fprintf (file,
1800 "\t[%4ld] +base[%4ld] %04lx %s -- %.*s\n",
1801 (long) i,
1802 (long) (i + edt.base),
1803 (unsigned long) eat_member,
1804 _("Forwarder RVA"),
1805 (int)(datasize - (eat_member - adj)),
1806 data + eat_member - adj);
1807 }
1808 else
1809 {
1810 /* Should locate a function descriptor in the reldata section. */
1811 fprintf (file,
1812 "\t[%4ld] +base[%4ld] %04lx %s\n",
1813 (long) i,
1814 (long) (i + edt.base),
1815 (unsigned long) eat_member,
1816 _("Export RVA"));
1817 }
1818 }
1819
1820 /* The Export Name Pointer Table is paired with the Export Ordinal Table. */
1821 /* Dump them in parallel for clarity. */
1822 fprintf (file,
1823 _("\n[Ordinal/Name Pointer] Table\n"));
1824
1825 /* PR 17512: Handle corrupt PE binaries. */
1826 if (edt.npt_addr + (edt.num_names * 4) - adj >= datasize
1827 /* PR 17512: file: bb68816e. */
1828 || edt.num_names * 4 < edt.num_names
1829 || (data + edt.npt_addr - adj) < data)
1830 /* xgettext:c-format */
1831 fprintf (file, _("\tInvalid Name Pointer Table rva (0x%lx) or entry count (0x%lx)\n"),
1832 (long) edt.npt_addr,
1833 (long) edt.num_names);
1834 /* PR 17512: file: 140-147171-0.004. */
1835 else if (edt.ot_addr + (edt.num_names * 2) - adj >= datasize
1836 || data + edt.ot_addr - adj < data)
1837 /* xgettext:c-format */
1838 fprintf (file, _("\tInvalid Ordinal Table rva (0x%lx) or entry count (0x%lx)\n"),
1839 (long) edt.ot_addr,
1840 (long) edt.num_names);
1841 else for (i = 0; i < edt.num_names; ++i)
1842 {
1843 bfd_vma name_ptr;
1844 bfd_vma ord;
1845
1846 ord = bfd_get_16 (abfd, data + edt.ot_addr + (i * 2) - adj);
1847 name_ptr = bfd_get_32 (abfd, data + edt.npt_addr + (i * 4) - adj);
1848
1849 if ((name_ptr - adj) >= datasize)
1850 {
1851 /* xgettext:c-format */
1852 fprintf (file, _("\t[%4ld] <corrupt offset: %lx>\n"),
1853 (long) ord, (long) name_ptr);
1854 }
1855 else
1856 {
1857 char * name = (char *) data + name_ptr - adj;
1858
1859 fprintf (file, "\t[%4ld] %.*s\n", (long) ord,
1860 (int)((char *)(data + datasize) - name), name);
1861 }
1862 }
1863
1864 free (data);
1865
1866 return TRUE;
1867 }
1868
1869 /* This really is architecture dependent. On IA-64, a .pdata entry
1870 consists of three dwords containing relative virtual addresses that
1871 specify the start and end address of the code range the entry
1872 covers and the address of the corresponding unwind info data.
1873
1874 On ARM and SH-4, a compressed PDATA structure is used :
1875 _IMAGE_CE_RUNTIME_FUNCTION_ENTRY, whereas MIPS is documented to use
1876 _IMAGE_ALPHA_RUNTIME_FUNCTION_ENTRY.
1877 See http://msdn2.microsoft.com/en-us/library/ms253988(VS.80).aspx .
1878
1879 This is the version for uncompressed data. */
1880
1881 static bfd_boolean
1882 pe_print_pdata (bfd * abfd, void * vfile)
1883 {
1884 #if defined(COFF_WITH_pep) && !defined(COFF_WITH_pex64)
1885 # define PDATA_ROW_SIZE (3 * 8)
1886 #else
1887 # define PDATA_ROW_SIZE (5 * 4)
1888 #endif
1889 FILE *file = (FILE *) vfile;
1890 bfd_byte *data = 0;
1891 asection *section = bfd_get_section_by_name (abfd, ".pdata");
1892 bfd_size_type datasize = 0;
1893 bfd_size_type i;
1894 bfd_size_type start, stop;
1895 int onaline = PDATA_ROW_SIZE;
1896
1897 if (section == NULL
1898 || coff_section_data (abfd, section) == NULL
1899 || pei_section_data (abfd, section) == NULL)
1900 return TRUE;
1901
1902 stop = pei_section_data (abfd, section)->virt_size;
1903 if ((stop % onaline) != 0)
1904 fprintf (file,
1905 /* xgettext:c-format */
1906 _("warning, .pdata section size (%ld) is not a multiple of %d\n"),
1907 (long) stop, onaline);
1908
1909 fprintf (file,
1910 _("\nThe Function Table (interpreted .pdata section contents)\n"));
1911 #if defined(COFF_WITH_pep) && !defined(COFF_WITH_pex64)
1912 fprintf (file,
1913 _(" vma:\t\t\tBegin Address End Address Unwind Info\n"));
1914 #else
1915 fprintf (file, _("\
1916 vma:\t\tBegin End EH EH PrologEnd Exception\n\
1917 \t\tAddress Address Handler Data Address Mask\n"));
1918 #endif
1919
1920 datasize = section->size;
1921 if (datasize == 0)
1922 return TRUE;
1923
1924 /* PR 17512: file: 002-193900-0.004. */
1925 if (datasize < stop)
1926 {
1927 /* xgettext:c-format */
1928 fprintf (file, _("Virtual size of .pdata section (%ld) larger than real size (%ld)\n"),
1929 (long) stop, (long) datasize);
1930 return FALSE;
1931 }
1932
1933 if (! bfd_malloc_and_get_section (abfd, section, &data))
1934 {
1935 if (data != NULL)
1936 free (data);
1937 return FALSE;
1938 }
1939
1940 start = 0;
1941
1942 for (i = start; i < stop; i += onaline)
1943 {
1944 bfd_vma begin_addr;
1945 bfd_vma end_addr;
1946 bfd_vma eh_handler;
1947 bfd_vma eh_data;
1948 bfd_vma prolog_end_addr;
1949 #if !defined(COFF_WITH_pep) || defined(COFF_WITH_pex64)
1950 int em_data;
1951 #endif
1952
1953 if (i + PDATA_ROW_SIZE > stop)
1954 break;
1955
1956 begin_addr = GET_PDATA_ENTRY (abfd, data + i );
1957 end_addr = GET_PDATA_ENTRY (abfd, data + i + 4);
1958 eh_handler = GET_PDATA_ENTRY (abfd, data + i + 8);
1959 eh_data = GET_PDATA_ENTRY (abfd, data + i + 12);
1960 prolog_end_addr = GET_PDATA_ENTRY (abfd, data + i + 16);
1961
1962 if (begin_addr == 0 && end_addr == 0 && eh_handler == 0
1963 && eh_data == 0 && prolog_end_addr == 0)
1964 /* We are probably into the padding of the section now. */
1965 break;
1966
1967 #if !defined(COFF_WITH_pep) || defined(COFF_WITH_pex64)
1968 em_data = ((eh_handler & 0x1) << 2) | (prolog_end_addr & 0x3);
1969 #endif
1970 eh_handler &= ~(bfd_vma) 0x3;
1971 prolog_end_addr &= ~(bfd_vma) 0x3;
1972
1973 fputc (' ', file);
1974 bfd_fprintf_vma (abfd, file, i + section->vma); fputc ('\t', file);
1975 bfd_fprintf_vma (abfd, file, begin_addr); fputc (' ', file);
1976 bfd_fprintf_vma (abfd, file, end_addr); fputc (' ', file);
1977 bfd_fprintf_vma (abfd, file, eh_handler);
1978 #if !defined(COFF_WITH_pep) || defined(COFF_WITH_pex64)
1979 fputc (' ', file);
1980 bfd_fprintf_vma (abfd, file, eh_data); fputc (' ', file);
1981 bfd_fprintf_vma (abfd, file, prolog_end_addr);
1982 fprintf (file, " %x", em_data);
1983 #endif
1984
1985 #ifdef POWERPC_LE_PE
1986 if (eh_handler == 0 && eh_data != 0)
1987 {
1988 /* Special bits here, although the meaning may be a little
1989 mysterious. The only one I know for sure is 0x03
1990 Code Significance
1991 0x00 None
1992 0x01 Register Save Millicode
1993 0x02 Register Restore Millicode
1994 0x03 Glue Code Sequence. */
1995 switch (eh_data)
1996 {
1997 case 0x01:
1998 fprintf (file, _(" Register save millicode"));
1999 break;
2000 case 0x02:
2001 fprintf (file, _(" Register restore millicode"));
2002 break;
2003 case 0x03:
2004 fprintf (file, _(" Glue code sequence"));
2005 break;
2006 default:
2007 break;
2008 }
2009 }
2010 #endif
2011 fprintf (file, "\n");
2012 }
2013
2014 free (data);
2015
2016 return TRUE;
2017 #undef PDATA_ROW_SIZE
2018 }
2019
2020 typedef struct sym_cache
2021 {
2022 int symcount;
2023 asymbol ** syms;
2024 } sym_cache;
2025
2026 static asymbol **
2027 slurp_symtab (bfd *abfd, sym_cache *psc)
2028 {
2029 asymbol ** sy = NULL;
2030 long storage;
2031
2032 if (!(bfd_get_file_flags (abfd) & HAS_SYMS))
2033 {
2034 psc->symcount = 0;
2035 return NULL;
2036 }
2037
2038 storage = bfd_get_symtab_upper_bound (abfd);
2039 if (storage < 0)
2040 return NULL;
2041 if (storage)
2042 {
2043 sy = (asymbol **) bfd_malloc (storage);
2044 if (sy == NULL)
2045 return NULL;
2046 }
2047
2048 psc->symcount = bfd_canonicalize_symtab (abfd, sy);
2049 if (psc->symcount < 0)
2050 return NULL;
2051 return sy;
2052 }
2053
2054 static const char *
2055 my_symbol_for_address (bfd *abfd, bfd_vma func, sym_cache *psc)
2056 {
2057 int i;
2058
2059 if (psc->syms == 0)
2060 psc->syms = slurp_symtab (abfd, psc);
2061
2062 for (i = 0; i < psc->symcount; i++)
2063 {
2064 if (psc->syms[i]->section->vma + psc->syms[i]->value == func)
2065 return psc->syms[i]->name;
2066 }
2067
2068 return NULL;
2069 }
2070
2071 static void
2072 cleanup_syms (sym_cache *psc)
2073 {
2074 psc->symcount = 0;
2075 free (psc->syms);
2076 psc->syms = NULL;
2077 }
2078
2079 /* This is the version for "compressed" pdata. */
2080
2081 bfd_boolean
2082 _bfd_XX_print_ce_compressed_pdata (bfd * abfd, void * vfile)
2083 {
2084 # define PDATA_ROW_SIZE (2 * 4)
2085 FILE *file = (FILE *) vfile;
2086 bfd_byte *data = NULL;
2087 asection *section = bfd_get_section_by_name (abfd, ".pdata");
2088 bfd_size_type datasize = 0;
2089 bfd_size_type i;
2090 bfd_size_type start, stop;
2091 int onaline = PDATA_ROW_SIZE;
2092 struct sym_cache cache = {0, 0} ;
2093
2094 if (section == NULL
2095 || coff_section_data (abfd, section) == NULL
2096 || pei_section_data (abfd, section) == NULL)
2097 return TRUE;
2098
2099 stop = pei_section_data (abfd, section)->virt_size;
2100 if ((stop % onaline) != 0)
2101 fprintf (file,
2102 /* xgettext:c-format */
2103 _("warning, .pdata section size (%ld) is not a multiple of %d\n"),
2104 (long) stop, onaline);
2105
2106 fprintf (file,
2107 _("\nThe Function Table (interpreted .pdata section contents)\n"));
2108
2109 fprintf (file, _("\
2110 vma:\t\tBegin Prolog Function Flags Exception EH\n\
2111 \t\tAddress Length Length 32b exc Handler Data\n"));
2112
2113 datasize = section->size;
2114 if (datasize == 0)
2115 return TRUE;
2116
2117 if (! bfd_malloc_and_get_section (abfd, section, &data))
2118 {
2119 if (data != NULL)
2120 free (data);
2121 return FALSE;
2122 }
2123
2124 start = 0;
2125
2126 for (i = start; i < stop; i += onaline)
2127 {
2128 bfd_vma begin_addr;
2129 bfd_vma other_data;
2130 bfd_vma prolog_length, function_length;
2131 int flag32bit, exception_flag;
2132 asection *tsection;
2133
2134 if (i + PDATA_ROW_SIZE > stop)
2135 break;
2136
2137 begin_addr = GET_PDATA_ENTRY (abfd, data + i );
2138 other_data = GET_PDATA_ENTRY (abfd, data + i + 4);
2139
2140 if (begin_addr == 0 && other_data == 0)
2141 /* We are probably into the padding of the section now. */
2142 break;
2143
2144 prolog_length = (other_data & 0x000000FF);
2145 function_length = (other_data & 0x3FFFFF00) >> 8;
2146 flag32bit = (int)((other_data & 0x40000000) >> 30);
2147 exception_flag = (int)((other_data & 0x80000000) >> 31);
2148
2149 fputc (' ', file);
2150 bfd_fprintf_vma (abfd, file, i + section->vma); fputc ('\t', file);
2151 bfd_fprintf_vma (abfd, file, begin_addr); fputc (' ', file);
2152 bfd_fprintf_vma (abfd, file, prolog_length); fputc (' ', file);
2153 bfd_fprintf_vma (abfd, file, function_length); fputc (' ', file);
2154 fprintf (file, "%2d %2d ", flag32bit, exception_flag);
2155
2156 /* Get the exception handler's address and the data passed from the
2157 .text section. This is really the data that belongs with the .pdata
2158 but got "compressed" out for the ARM and SH4 architectures. */
2159 tsection = bfd_get_section_by_name (abfd, ".text");
2160 if (tsection && coff_section_data (abfd, tsection)
2161 && pei_section_data (abfd, tsection))
2162 {
2163 bfd_vma eh_off = (begin_addr - 8) - tsection->vma;
2164 bfd_byte *tdata;
2165
2166 tdata = (bfd_byte *) bfd_malloc (8);
2167 if (tdata)
2168 {
2169 if (bfd_get_section_contents (abfd, tsection, tdata, eh_off, 8))
2170 {
2171 bfd_vma eh, eh_data;
2172
2173 eh = bfd_get_32 (abfd, tdata);
2174 eh_data = bfd_get_32 (abfd, tdata + 4);
2175 fprintf (file, "%08x ", (unsigned int) eh);
2176 fprintf (file, "%08x", (unsigned int) eh_data);
2177 if (eh != 0)
2178 {
2179 const char *s = my_symbol_for_address (abfd, eh, &cache);
2180
2181 if (s)
2182 fprintf (file, " (%s) ", s);
2183 }
2184 }
2185 free (tdata);
2186 }
2187 }
2188
2189 fprintf (file, "\n");
2190 }
2191
2192 free (data);
2193
2194 cleanup_syms (& cache);
2195
2196 return TRUE;
2197 #undef PDATA_ROW_SIZE
2198 }
2199
2200 \f
2201 #define IMAGE_REL_BASED_HIGHADJ 4
2202 static const char * const tbl[] =
2203 {
2204 "ABSOLUTE",
2205 "HIGH",
2206 "LOW",
2207 "HIGHLOW",
2208 "HIGHADJ",
2209 "MIPS_JMPADDR",
2210 "SECTION",
2211 "REL32",
2212 "RESERVED1",
2213 "MIPS_JMPADDR16",
2214 "DIR64",
2215 "HIGH3ADJ",
2216 "UNKNOWN", /* MUST be last. */
2217 };
2218
2219 static bfd_boolean
2220 pe_print_reloc (bfd * abfd, void * vfile)
2221 {
2222 FILE *file = (FILE *) vfile;
2223 bfd_byte *data = 0;
2224 asection *section = bfd_get_section_by_name (abfd, ".reloc");
2225 bfd_byte *p, *end;
2226
2227 if (section == NULL || section->size == 0 || !(section->flags & SEC_HAS_CONTENTS))
2228 return TRUE;
2229
2230 fprintf (file,
2231 _("\n\nPE File Base Relocations (interpreted .reloc section contents)\n"));
2232
2233 if (! bfd_malloc_and_get_section (abfd, section, &data))
2234 {
2235 if (data != NULL)
2236 free (data);
2237 return FALSE;
2238 }
2239
2240 p = data;
2241 end = data + section->size;
2242 while (p + 8 <= end)
2243 {
2244 int j;
2245 bfd_vma virtual_address;
2246 unsigned long number, size;
2247 bfd_byte *chunk_end;
2248
2249 /* The .reloc section is a sequence of blocks, with a header consisting
2250 of two 32 bit quantities, followed by a number of 16 bit entries. */
2251 virtual_address = bfd_get_32 (abfd, p);
2252 size = bfd_get_32 (abfd, p + 4);
2253 p += 8;
2254 number = (size - 8) / 2;
2255
2256 if (size == 0)
2257 break;
2258
2259 fprintf (file,
2260 /* xgettext:c-format */
2261 _("\nVirtual Address: %08lx Chunk size %ld (0x%lx) Number of fixups %ld\n"),
2262 (unsigned long) virtual_address, size, size, number);
2263
2264 chunk_end = p - 8 + size;
2265 if (chunk_end > end)
2266 chunk_end = end;
2267 j = 0;
2268 while (p + 2 <= chunk_end)
2269 {
2270 unsigned short e = bfd_get_16 (abfd, p);
2271 unsigned int t = (e & 0xF000) >> 12;
2272 int off = e & 0x0FFF;
2273
2274 if (t >= sizeof (tbl) / sizeof (tbl[0]))
2275 t = (sizeof (tbl) / sizeof (tbl[0])) - 1;
2276
2277 fprintf (file,
2278 /* xgettext:c-format */
2279 _("\treloc %4d offset %4x [%4lx] %s"),
2280 j, off, (unsigned long) (off + virtual_address), tbl[t]);
2281
2282 p += 2;
2283 j++;
2284
2285 /* HIGHADJ takes an argument, - the next record *is* the
2286 low 16 bits of addend. */
2287 if (t == IMAGE_REL_BASED_HIGHADJ && p + 2 <= chunk_end)
2288 {
2289 fprintf (file, " (%4x)", (unsigned int) bfd_get_16 (abfd, p));
2290 p += 2;
2291 j++;
2292 }
2293
2294 fprintf (file, "\n");
2295 }
2296 }
2297
2298 free (data);
2299
2300 return TRUE;
2301 }
2302 \f
2303 /* A data structure describing the regions of a .rsrc section.
2304 Some fields are filled in as the section is parsed. */
2305
2306 typedef struct rsrc_regions
2307 {
2308 bfd_byte * section_start;
2309 bfd_byte * section_end;
2310 bfd_byte * strings_start;
2311 bfd_byte * resource_start;
2312 } rsrc_regions;
2313
2314 static bfd_byte *
2315 rsrc_print_resource_directory (FILE * , bfd *, unsigned int, bfd_byte *,
2316 rsrc_regions *, bfd_vma);
2317
2318 /* Print the resource entry at DATA, with the text indented by INDENT.
2319 Recusively calls rsrc_print_resource_directory to print the contents
2320 of directory entries.
2321 Returns the address of the end of the data associated with the entry
2322 or section_end + 1 upon failure. */
2323
2324 static bfd_byte *
2325 rsrc_print_resource_entries (FILE * file,
2326 bfd * abfd,
2327 unsigned int indent,
2328 bfd_boolean is_name,
2329 bfd_byte * data,
2330 rsrc_regions * regions,
2331 bfd_vma rva_bias)
2332 {
2333 unsigned long entry, addr, size;
2334 bfd_byte * leaf;
2335
2336 if (data + 8 >= regions->section_end)
2337 return regions->section_end + 1;
2338
2339 /* xgettext:c-format */
2340 fprintf (file, _("%03x %*.s Entry: "), (int)(data - regions->section_start), indent, " ");
2341
2342 entry = (unsigned long) bfd_get_32 (abfd, data);
2343 if (is_name)
2344 {
2345 bfd_byte * name;
2346
2347 /* Note - the documentation says that this field is an RVA value
2348 but windres appears to produce a section relative offset with
2349 the top bit set. Support both styles for now. */
2350 if (HighBitSet (entry))
2351 name = regions->section_start + WithoutHighBit (entry);
2352 else
2353 name = regions->section_start + entry - rva_bias;
2354
2355 if (name + 2 < regions->section_end && name > regions->section_start)
2356 {
2357 unsigned int len;
2358
2359 if (regions->strings_start == NULL)
2360 regions->strings_start = name;
2361
2362 len = bfd_get_16 (abfd, name);
2363
2364 fprintf (file, _("name: [val: %08lx len %d]: "), entry, len);
2365
2366 if (name + 2 + len * 2 < regions->section_end)
2367 {
2368 /* This strange loop is to cope with multibyte characters. */
2369 while (len --)
2370 {
2371 char c;
2372
2373 name += 2;
2374 c = * name;
2375 /* Avoid printing control characters. */
2376 if (c > 0 && c < 32)
2377 fprintf (file, "^%c", c + 64);
2378 else
2379 fprintf (file, "%.1s", name);
2380 }
2381 }
2382 else
2383 {
2384 fprintf (file, _("<corrupt string length: %#x>\n"), len);
2385 /* PR binutils/17512: Do not try to continue decoding a
2386 corrupted resource section. It is likely to end up with
2387 reams of extraneous output. FIXME: We could probably
2388 continue if we disable the printing of strings... */
2389 return regions->section_end + 1;
2390 }
2391 }
2392 else
2393 {
2394 fprintf (file, _("<corrupt string offset: %#lx>\n"), entry);
2395 return regions->section_end + 1;
2396 }
2397 }
2398 else
2399 fprintf (file, _("ID: %#08lx"), entry);
2400
2401 entry = (long) bfd_get_32 (abfd, data + 4);
2402 fprintf (file, _(", Value: %#08lx\n"), entry);
2403
2404 if (HighBitSet (entry))
2405 {
2406 data = regions->section_start + WithoutHighBit (entry);
2407 if (data <= regions->section_start || data > regions->section_end)
2408 return regions->section_end + 1;
2409
2410 /* FIXME: PR binutils/17512: A corrupt file could contain a loop
2411 in the resource table. We need some way to detect this. */
2412 return rsrc_print_resource_directory (file, abfd, indent + 1, data,
2413 regions, rva_bias);
2414 }
2415
2416 leaf = regions->section_start + entry;
2417
2418 if (leaf + 16 >= regions->section_end
2419 /* PR 17512: file: 055dff7e. */
2420 || leaf < regions->section_start)
2421 return regions->section_end + 1;
2422
2423 /* xgettext:c-format */
2424 fprintf (file, _("%03x %*.s Leaf: Addr: %#08lx, Size: %#08lx, Codepage: %d\n"),
2425 (int) (entry), indent, " ",
2426 addr = (long) bfd_get_32 (abfd, leaf),
2427 size = (long) bfd_get_32 (abfd, leaf + 4),
2428 (int) bfd_get_32 (abfd, leaf + 8));
2429
2430 /* Check that the reserved entry is 0. */
2431 if (bfd_get_32 (abfd, leaf + 12) != 0
2432 /* And that the data address/size is valid too. */
2433 || (regions->section_start + (addr - rva_bias) + size > regions->section_end))
2434 return regions->section_end + 1;
2435
2436 if (regions->resource_start == NULL)
2437 regions->resource_start = regions->section_start + (addr - rva_bias);
2438
2439 return regions->section_start + (addr - rva_bias) + size;
2440 }
2441
2442 #define max(a,b) ((a) > (b) ? (a) : (b))
2443 #define min(a,b) ((a) < (b) ? (a) : (b))
2444
2445 static bfd_byte *
2446 rsrc_print_resource_directory (FILE * file,
2447 bfd * abfd,
2448 unsigned int indent,
2449 bfd_byte * data,
2450 rsrc_regions * regions,
2451 bfd_vma rva_bias)
2452 {
2453 unsigned int num_names, num_ids;
2454 bfd_byte * highest_data = data;
2455
2456 if (data + 16 >= regions->section_end)
2457 return regions->section_end + 1;
2458
2459 fprintf (file, "%03x %*.s ", (int)(data - regions->section_start), indent, " ");
2460 switch (indent)
2461 {
2462 case 0: fprintf (file, "Type"); break;
2463 case 2: fprintf (file, "Name"); break;
2464 case 4: fprintf (file, "Language"); break;
2465 default:
2466 fprintf (file, _("<unknown directory type: %d>\n"), indent);
2467 /* FIXME: For now we end the printing here. If in the
2468 future more directory types are added to the RSRC spec
2469 then we will need to change this. */
2470 return regions->section_end + 1;
2471 }
2472
2473 /* xgettext:c-format */
2474 fprintf (file, _(" Table: Char: %d, Time: %08lx, Ver: %d/%d, Num Names: %d, IDs: %d\n"),
2475 (int) bfd_get_32 (abfd, data),
2476 (long) bfd_get_32 (abfd, data + 4),
2477 (int) bfd_get_16 (abfd, data + 8),
2478 (int) bfd_get_16 (abfd, data + 10),
2479 num_names = (int) bfd_get_16 (abfd, data + 12),
2480 num_ids = (int) bfd_get_16 (abfd, data + 14));
2481 data += 16;
2482
2483 while (num_names --)
2484 {
2485 bfd_byte * entry_end;
2486
2487 entry_end = rsrc_print_resource_entries (file, abfd, indent + 1, TRUE,
2488 data, regions, rva_bias);
2489 data += 8;
2490 highest_data = max (highest_data, entry_end);
2491 if (entry_end >= regions->section_end)
2492 return entry_end;
2493 }
2494
2495 while (num_ids --)
2496 {
2497 bfd_byte * entry_end;
2498
2499 entry_end = rsrc_print_resource_entries (file, abfd, indent + 1, FALSE,
2500 data, regions, rva_bias);
2501 data += 8;
2502 highest_data = max (highest_data, entry_end);
2503 if (entry_end >= regions->section_end)
2504 return entry_end;
2505 }
2506
2507 return max (highest_data, data);
2508 }
2509
2510 /* Display the contents of a .rsrc section. We do not try to
2511 reproduce the resources, windres does that. Instead we dump
2512 the tables in a human readable format. */
2513
2514 static bfd_boolean
2515 rsrc_print_section (bfd * abfd, void * vfile)
2516 {
2517 bfd_vma rva_bias;
2518 pe_data_type * pe;
2519 FILE * file = (FILE *) vfile;
2520 bfd_size_type datasize;
2521 asection * section;
2522 bfd_byte * data;
2523 rsrc_regions regions;
2524
2525 pe = pe_data (abfd);
2526 if (pe == NULL)
2527 return TRUE;
2528
2529 section = bfd_get_section_by_name (abfd, ".rsrc");
2530 if (section == NULL)
2531 return TRUE;
2532 if (!(section->flags & SEC_HAS_CONTENTS))
2533 return TRUE;
2534
2535 datasize = section->size;
2536 if (datasize == 0)
2537 return TRUE;
2538
2539 rva_bias = section->vma - pe->pe_opthdr.ImageBase;
2540
2541 if (! bfd_malloc_and_get_section (abfd, section, & data))
2542 {
2543 if (data != NULL)
2544 free (data);
2545 return FALSE;
2546 }
2547
2548 regions.section_start = data;
2549 regions.section_end = data + datasize;
2550 regions.strings_start = NULL;
2551 regions.resource_start = NULL;
2552
2553 fflush (file);
2554 fprintf (file, "\nThe .rsrc Resource Directory section:\n");
2555
2556 while (data < regions.section_end)
2557 {
2558 bfd_byte * p = data;
2559
2560 data = rsrc_print_resource_directory (file, abfd, 0, data, & regions, rva_bias);
2561
2562 if (data == regions.section_end + 1)
2563 fprintf (file, _("Corrupt .rsrc section detected!\n"));
2564 else
2565 {
2566 /* Align data before continuing. */
2567 int align = (1 << section->alignment_power) - 1;
2568
2569 data = (bfd_byte *) (((ptrdiff_t) (data + align)) & ~ align);
2570 rva_bias += data - p;
2571
2572 /* For reasons that are unclear .rsrc sections are sometimes created
2573 aligned to a 1^3 boundary even when their alignment is set at
2574 1^2. Catch that case here before we issue a spurious warning
2575 message. */
2576 if (data == (regions.section_end - 4))
2577 data = regions.section_end;
2578 else if (data < regions.section_end)
2579 {
2580 /* If the extra data is all zeros then do not complain.
2581 This is just padding so that the section meets the
2582 page size requirements. */
2583 while (++ data < regions.section_end)
2584 if (*data != 0)
2585 break;
2586 if (data < regions.section_end)
2587 fprintf (file, _("\nWARNING: Extra data in .rsrc section - it will be ignored by Windows:\n"));
2588 }
2589 }
2590 }
2591
2592 if (regions.strings_start != NULL)
2593 fprintf (file, _(" String table starts at offset: %#03x\n"),
2594 (int) (regions.strings_start - regions.section_start));
2595 if (regions.resource_start != NULL)
2596 fprintf (file, _(" Resources start at offset: %#03x\n"),
2597 (int) (regions.resource_start - regions.section_start));
2598
2599 free (regions.section_start);
2600 return TRUE;
2601 }
2602
2603 #define IMAGE_NUMBEROF_DEBUG_TYPES 12
2604
2605 static char * debug_type_names[IMAGE_NUMBEROF_DEBUG_TYPES] =
2606 {
2607 "Unknown",
2608 "COFF",
2609 "CodeView",
2610 "FPO",
2611 "Misc",
2612 "Exception",
2613 "Fixup",
2614 "OMAP-to-SRC",
2615 "OMAP-from-SRC",
2616 "Borland",
2617 "Reserved",
2618 "CLSID",
2619 };
2620
2621 static bfd_boolean
2622 pe_print_debugdata (bfd * abfd, void * vfile)
2623 {
2624 FILE *file = (FILE *) vfile;
2625 pe_data_type *pe = pe_data (abfd);
2626 struct internal_extra_pe_aouthdr *extra = &pe->pe_opthdr;
2627 asection *section;
2628 bfd_byte *data = 0;
2629 bfd_size_type dataoff;
2630 unsigned int i;
2631
2632 bfd_vma addr = extra->DataDirectory[PE_DEBUG_DATA].VirtualAddress;
2633 bfd_size_type size = extra->DataDirectory[PE_DEBUG_DATA].Size;
2634
2635 if (size == 0)
2636 return TRUE;
2637
2638 addr += extra->ImageBase;
2639 for (section = abfd->sections; section != NULL; section = section->next)
2640 {
2641 if ((addr >= section->vma) && (addr < (section->vma + section->size)))
2642 break;
2643 }
2644
2645 if (section == NULL)
2646 {
2647 fprintf (file,
2648 _("\nThere is a debug directory, but the section containing it could not be found\n"));
2649 return TRUE;
2650 }
2651 else if (!(section->flags & SEC_HAS_CONTENTS))
2652 {
2653 fprintf (file,
2654 _("\nThere is a debug directory in %s, but that section has no contents\n"),
2655 section->name);
2656 return TRUE;
2657 }
2658 else if (section->size < size)
2659 {
2660 fprintf (file,
2661 _("\nError: section %s contains the debug data starting address but it is too small\n"),
2662 section->name);
2663 return FALSE;
2664 }
2665
2666 fprintf (file, _("\nThere is a debug directory in %s at 0x%lx\n\n"),
2667 section->name, (unsigned long) addr);
2668
2669 dataoff = addr - section->vma;
2670
2671 if (size > (section->size - dataoff))
2672 {
2673 fprintf (file, _("The debug data size field in the data directory is too big for the section"));
2674 return FALSE;
2675 }
2676
2677 fprintf (file,
2678 _("Type Size Rva Offset\n"));
2679
2680 /* Read the whole section. */
2681 if (!bfd_malloc_and_get_section (abfd, section, &data))
2682 {
2683 if (data != NULL)
2684 free (data);
2685 return FALSE;
2686 }
2687
2688 for (i = 0; i < size / sizeof (struct external_IMAGE_DEBUG_DIRECTORY); i++)
2689 {
2690 const char *type_name;
2691 struct external_IMAGE_DEBUG_DIRECTORY *ext
2692 = &((struct external_IMAGE_DEBUG_DIRECTORY *)(data + dataoff))[i];
2693 struct internal_IMAGE_DEBUG_DIRECTORY idd;
2694
2695 _bfd_XXi_swap_debugdir_in (abfd, ext, &idd);
2696
2697 if ((idd.Type) >= IMAGE_NUMBEROF_DEBUG_TYPES)
2698 type_name = debug_type_names[0];
2699 else
2700 type_name = debug_type_names[idd.Type];
2701
2702 fprintf (file, " %2ld %14s %08lx %08lx %08lx\n",
2703 idd.Type, type_name, idd.SizeOfData,
2704 idd.AddressOfRawData, idd.PointerToRawData);
2705
2706 if (idd.Type == PE_IMAGE_DEBUG_TYPE_CODEVIEW)
2707 {
2708 char signature[CV_INFO_SIGNATURE_LENGTH * 2 + 1];
2709 /* PR 17512: file: 065-29434-0.001:0.1
2710 We need to use a 32-bit aligned buffer
2711 to safely read in a codeview record. */
2712 char buffer[256 + 1] ATTRIBUTE_ALIGNED_ALIGNOF (CODEVIEW_INFO);
2713
2714 CODEVIEW_INFO *cvinfo = (CODEVIEW_INFO *) buffer;
2715
2716 /* The debug entry doesn't have to have to be in a section,
2717 in which case AddressOfRawData is 0, so always use PointerToRawData. */
2718 if (!_bfd_XXi_slurp_codeview_record (abfd, (file_ptr) idd.PointerToRawData,
2719 idd.SizeOfData, cvinfo))
2720 continue;
2721
2722 for (i = 0; i < cvinfo->SignatureLength; i++)
2723 sprintf (&signature[i*2], "%02x", cvinfo->Signature[i] & 0xff);
2724
2725 /* xgettext:c-format */
2726 fprintf (file, _("(format %c%c%c%c signature %s age %ld)\n"),
2727 buffer[0], buffer[1], buffer[2], buffer[3],
2728 signature, cvinfo->Age);
2729 }
2730 }
2731
2732 if (size % sizeof (struct external_IMAGE_DEBUG_DIRECTORY) != 0)
2733 fprintf (file,
2734 _("The debug directory size is not a multiple of the debug directory entry size\n"));
2735
2736 return TRUE;
2737 }
2738
2739 /* Print out the program headers. */
2740
2741 bfd_boolean
2742 _bfd_XX_print_private_bfd_data_common (bfd * abfd, void * vfile)
2743 {
2744 FILE *file = (FILE *) vfile;
2745 int j;
2746 pe_data_type *pe = pe_data (abfd);
2747 struct internal_extra_pe_aouthdr *i = &pe->pe_opthdr;
2748 const char *subsystem_name = NULL;
2749 const char *name;
2750
2751 /* The MS dumpbin program reportedly ands with 0xff0f before
2752 printing the characteristics field. Not sure why. No reason to
2753 emulate it here. */
2754 fprintf (file, _("\nCharacteristics 0x%x\n"), pe->real_flags);
2755 #undef PF
2756 #define PF(x, y) if (pe->real_flags & x) { fprintf (file, "\t%s\n", y); }
2757 PF (IMAGE_FILE_RELOCS_STRIPPED, "relocations stripped");
2758 PF (IMAGE_FILE_EXECUTABLE_IMAGE, "executable");
2759 PF (IMAGE_FILE_LINE_NUMS_STRIPPED, "line numbers stripped");
2760 PF (IMAGE_FILE_LOCAL_SYMS_STRIPPED, "symbols stripped");
2761 PF (IMAGE_FILE_LARGE_ADDRESS_AWARE, "large address aware");
2762 PF (IMAGE_FILE_BYTES_REVERSED_LO, "little endian");
2763 PF (IMAGE_FILE_32BIT_MACHINE, "32 bit words");
2764 PF (IMAGE_FILE_DEBUG_STRIPPED, "debugging information removed");
2765 PF (IMAGE_FILE_SYSTEM, "system file");
2766 PF (IMAGE_FILE_DLL, "DLL");
2767 PF (IMAGE_FILE_BYTES_REVERSED_HI, "big endian");
2768 #undef PF
2769
2770 /* ctime implies '\n'. */
2771 {
2772 time_t t = pe->coff.timestamp;
2773 fprintf (file, "\nTime/Date\t\t%s", ctime (&t));
2774 }
2775
2776 #ifndef IMAGE_NT_OPTIONAL_HDR_MAGIC
2777 # define IMAGE_NT_OPTIONAL_HDR_MAGIC 0x10b
2778 #endif
2779 #ifndef IMAGE_NT_OPTIONAL_HDR64_MAGIC
2780 # define IMAGE_NT_OPTIONAL_HDR64_MAGIC 0x20b
2781 #endif
2782 #ifndef IMAGE_NT_OPTIONAL_HDRROM_MAGIC
2783 # define IMAGE_NT_OPTIONAL_HDRROM_MAGIC 0x107
2784 #endif
2785
2786 switch (i->Magic)
2787 {
2788 case IMAGE_NT_OPTIONAL_HDR_MAGIC:
2789 name = "PE32";
2790 break;
2791 case IMAGE_NT_OPTIONAL_HDR64_MAGIC:
2792 name = "PE32+";
2793 break;
2794 case IMAGE_NT_OPTIONAL_HDRROM_MAGIC:
2795 name = "ROM";
2796 break;
2797 default:
2798 name = NULL;
2799 break;
2800 }
2801 fprintf (file, "Magic\t\t\t%04x", i->Magic);
2802 if (name)
2803 fprintf (file, "\t(%s)",name);
2804 fprintf (file, "\nMajorLinkerVersion\t%d\n", i->MajorLinkerVersion);
2805 fprintf (file, "MinorLinkerVersion\t%d\n", i->MinorLinkerVersion);
2806 fprintf (file, "SizeOfCode\t\t%08lx\n", (unsigned long) i->SizeOfCode);
2807 fprintf (file, "SizeOfInitializedData\t%08lx\n",
2808 (unsigned long) i->SizeOfInitializedData);
2809 fprintf (file, "SizeOfUninitializedData\t%08lx\n",
2810 (unsigned long) i->SizeOfUninitializedData);
2811 fprintf (file, "AddressOfEntryPoint\t");
2812 bfd_fprintf_vma (abfd, file, i->AddressOfEntryPoint);
2813 fprintf (file, "\nBaseOfCode\t\t");
2814 bfd_fprintf_vma (abfd, file, i->BaseOfCode);
2815 #if !defined(COFF_WITH_pep) && !defined(COFF_WITH_pex64)
2816 /* PE32+ does not have BaseOfData member! */
2817 fprintf (file, "\nBaseOfData\t\t");
2818 bfd_fprintf_vma (abfd, file, i->BaseOfData);
2819 #endif
2820
2821 fprintf (file, "\nImageBase\t\t");
2822 bfd_fprintf_vma (abfd, file, i->ImageBase);
2823 fprintf (file, "\nSectionAlignment\t");
2824 bfd_fprintf_vma (abfd, file, i->SectionAlignment);
2825 fprintf (file, "\nFileAlignment\t\t");
2826 bfd_fprintf_vma (abfd, file, i->FileAlignment);
2827 fprintf (file, "\nMajorOSystemVersion\t%d\n", i->MajorOperatingSystemVersion);
2828 fprintf (file, "MinorOSystemVersion\t%d\n", i->MinorOperatingSystemVersion);
2829 fprintf (file, "MajorImageVersion\t%d\n", i->MajorImageVersion);
2830 fprintf (file, "MinorImageVersion\t%d\n", i->MinorImageVersion);
2831 fprintf (file, "MajorSubsystemVersion\t%d\n", i->MajorSubsystemVersion);
2832 fprintf (file, "MinorSubsystemVersion\t%d\n", i->MinorSubsystemVersion);
2833 fprintf (file, "Win32Version\t\t%08lx\n", (unsigned long) i->Reserved1);
2834 fprintf (file, "SizeOfImage\t\t%08lx\n", (unsigned long) i->SizeOfImage);
2835 fprintf (file, "SizeOfHeaders\t\t%08lx\n", (unsigned long) i->SizeOfHeaders);
2836 fprintf (file, "CheckSum\t\t%08lx\n", (unsigned long) i->CheckSum);
2837
2838 switch (i->Subsystem)
2839 {
2840 case IMAGE_SUBSYSTEM_UNKNOWN:
2841 subsystem_name = "unspecified";
2842 break;
2843 case IMAGE_SUBSYSTEM_NATIVE:
2844 subsystem_name = "NT native";
2845 break;
2846 case IMAGE_SUBSYSTEM_WINDOWS_GUI:
2847 subsystem_name = "Windows GUI";
2848 break;
2849 case IMAGE_SUBSYSTEM_WINDOWS_CUI:
2850 subsystem_name = "Windows CUI";
2851 break;
2852 case IMAGE_SUBSYSTEM_POSIX_CUI:
2853 subsystem_name = "POSIX CUI";
2854 break;
2855 case IMAGE_SUBSYSTEM_WINDOWS_CE_GUI:
2856 subsystem_name = "Wince CUI";
2857 break;
2858 // These are from UEFI Platform Initialization Specification 1.1.
2859 case IMAGE_SUBSYSTEM_EFI_APPLICATION:
2860 subsystem_name = "EFI application";
2861 break;
2862 case IMAGE_SUBSYSTEM_EFI_BOOT_SERVICE_DRIVER:
2863 subsystem_name = "EFI boot service driver";
2864 break;
2865 case IMAGE_SUBSYSTEM_EFI_RUNTIME_DRIVER:
2866 subsystem_name = "EFI runtime driver";
2867 break;
2868 case IMAGE_SUBSYSTEM_SAL_RUNTIME_DRIVER:
2869 subsystem_name = "SAL runtime driver";
2870 break;
2871 // This is from revision 8.0 of the MS PE/COFF spec
2872 case IMAGE_SUBSYSTEM_XBOX:
2873 subsystem_name = "XBOX";
2874 break;
2875 // Added default case for clarity - subsystem_name is NULL anyway.
2876 default:
2877 subsystem_name = NULL;
2878 }
2879
2880 fprintf (file, "Subsystem\t\t%08x", i->Subsystem);
2881 if (subsystem_name)
2882 fprintf (file, "\t(%s)", subsystem_name);
2883 fprintf (file, "\nDllCharacteristics\t%08x\n", i->DllCharacteristics);
2884 fprintf (file, "SizeOfStackReserve\t");
2885 bfd_fprintf_vma (abfd, file, i->SizeOfStackReserve);
2886 fprintf (file, "\nSizeOfStackCommit\t");
2887 bfd_fprintf_vma (abfd, file, i->SizeOfStackCommit);
2888 fprintf (file, "\nSizeOfHeapReserve\t");
2889 bfd_fprintf_vma (abfd, file, i->SizeOfHeapReserve);
2890 fprintf (file, "\nSizeOfHeapCommit\t");
2891 bfd_fprintf_vma (abfd, file, i->SizeOfHeapCommit);
2892 fprintf (file, "\nLoaderFlags\t\t%08lx\n", (unsigned long) i->LoaderFlags);
2893 fprintf (file, "NumberOfRvaAndSizes\t%08lx\n",
2894 (unsigned long) i->NumberOfRvaAndSizes);
2895
2896 fprintf (file, "\nThe Data Directory\n");
2897 for (j = 0; j < IMAGE_NUMBEROF_DIRECTORY_ENTRIES; j++)
2898 {
2899 fprintf (file, "Entry %1x ", j);
2900 bfd_fprintf_vma (abfd, file, i->DataDirectory[j].VirtualAddress);
2901 fprintf (file, " %08lx ", (unsigned long) i->DataDirectory[j].Size);
2902 fprintf (file, "%s\n", dir_names[j]);
2903 }
2904
2905 pe_print_idata (abfd, vfile);
2906 pe_print_edata (abfd, vfile);
2907 if (bfd_coff_have_print_pdata (abfd))
2908 bfd_coff_print_pdata (abfd, vfile);
2909 else
2910 pe_print_pdata (abfd, vfile);
2911 pe_print_reloc (abfd, vfile);
2912 pe_print_debugdata (abfd, file);
2913
2914 rsrc_print_section (abfd, vfile);
2915
2916 return TRUE;
2917 }
2918
2919 static bfd_boolean
2920 is_vma_in_section (bfd *abfd ATTRIBUTE_UNUSED, asection *sect, void *obj)
2921 {
2922 bfd_vma addr = * (bfd_vma *) obj;
2923 return (addr >= sect->vma) && (addr < (sect->vma + sect->size));
2924 }
2925
2926 static asection *
2927 find_section_by_vma (bfd *abfd, bfd_vma addr)
2928 {
2929 return bfd_sections_find_if (abfd, is_vma_in_section, (void *) & addr);
2930 }
2931
2932 /* Copy any private info we understand from the input bfd
2933 to the output bfd. */
2934
2935 bfd_boolean
2936 _bfd_XX_bfd_copy_private_bfd_data_common (bfd * ibfd, bfd * obfd)
2937 {
2938 pe_data_type *ipe, *ope;
2939
2940 /* One day we may try to grok other private data. */
2941 if (ibfd->xvec->flavour != bfd_target_coff_flavour
2942 || obfd->xvec->flavour != bfd_target_coff_flavour)
2943 return TRUE;
2944
2945 ipe = pe_data (ibfd);
2946 ope = pe_data (obfd);
2947
2948 /* pe_opthdr is copied in copy_object. */
2949 ope->dll = ipe->dll;
2950
2951 /* Don't copy input subsystem if output is different from input. */
2952 if (obfd->xvec != ibfd->xvec)
2953 ope->pe_opthdr.Subsystem = IMAGE_SUBSYSTEM_UNKNOWN;
2954
2955 /* For strip: if we removed .reloc, we'll make a real mess of things
2956 if we don't remove this entry as well. */
2957 if (! pe_data (obfd)->has_reloc_section)
2958 {
2959 pe_data (obfd)->pe_opthdr.DataDirectory[PE_BASE_RELOCATION_TABLE].VirtualAddress = 0;
2960 pe_data (obfd)->pe_opthdr.DataDirectory[PE_BASE_RELOCATION_TABLE].Size = 0;
2961 }
2962
2963 /* For PIE, if there is .reloc, we won't add IMAGE_FILE_RELOCS_STRIPPED.
2964 But there is no .reloc, we make sure that IMAGE_FILE_RELOCS_STRIPPED
2965 won't be added. */
2966 if (! pe_data (ibfd)->has_reloc_section
2967 && ! (pe_data (ibfd)->real_flags & IMAGE_FILE_RELOCS_STRIPPED))
2968 pe_data (obfd)->dont_strip_reloc = 1;
2969
2970 /* The file offsets contained in the debug directory need rewriting. */
2971 if (ope->pe_opthdr.DataDirectory[PE_DEBUG_DATA].Size != 0)
2972 {
2973 bfd_vma addr = ope->pe_opthdr.DataDirectory[PE_DEBUG_DATA].VirtualAddress
2974 + ope->pe_opthdr.ImageBase;
2975 asection *section = find_section_by_vma (obfd, addr);
2976 bfd_byte *data;
2977
2978 if (section && bfd_malloc_and_get_section (obfd, section, &data))
2979 {
2980 unsigned int i;
2981 struct external_IMAGE_DEBUG_DIRECTORY *dd =
2982 (struct external_IMAGE_DEBUG_DIRECTORY *)(data + (addr - section->vma));
2983
2984 /* PR 17512: file: 0f15796a. */
2985 if (ope->pe_opthdr.DataDirectory[PE_DEBUG_DATA].Size + (addr - section->vma)
2986 > bfd_get_section_size (section))
2987 {
2988 /* xgettext:c-format */
2989 _bfd_error_handler
2990 (_("%pB: Data Directory size (%lx) "
2991 "exceeds space left in section (%" PRIx64 ")"),
2992 obfd, ope->pe_opthdr.DataDirectory[PE_DEBUG_DATA].Size,
2993 (uint64_t) (section->size - (addr - section->vma)));
2994 return FALSE;
2995 }
2996
2997 for (i = 0; i < ope->pe_opthdr.DataDirectory[PE_DEBUG_DATA].Size
2998 / sizeof (struct external_IMAGE_DEBUG_DIRECTORY); i++)
2999 {
3000 asection *ddsection;
3001 struct external_IMAGE_DEBUG_DIRECTORY *edd = &(dd[i]);
3002 struct internal_IMAGE_DEBUG_DIRECTORY idd;
3003
3004 _bfd_XXi_swap_debugdir_in (obfd, edd, &idd);
3005
3006 if (idd.AddressOfRawData == 0)
3007 continue; /* RVA 0 means only offset is valid, not handled yet. */
3008
3009 ddsection = find_section_by_vma (obfd, idd.AddressOfRawData + ope->pe_opthdr.ImageBase);
3010 if (!ddsection)
3011 continue; /* Not in a section! */
3012
3013 idd.PointerToRawData = ddsection->filepos + (idd.AddressOfRawData
3014 + ope->pe_opthdr.ImageBase) - ddsection->vma;
3015
3016 _bfd_XXi_swap_debugdir_out (obfd, &idd, edd);
3017 }
3018
3019 if (!bfd_set_section_contents (obfd, section, data, 0, section->size))
3020 {
3021 _bfd_error_handler (_("failed to update file offsets in debug directory"));
3022 return FALSE;
3023 }
3024 }
3025 else if (section)
3026 {
3027 _bfd_error_handler (_("%pB: failed to read debug data section"), obfd);
3028 return FALSE;
3029 }
3030 }
3031
3032 return TRUE;
3033 }
3034
3035 /* Copy private section data. */
3036
3037 bfd_boolean
3038 _bfd_XX_bfd_copy_private_section_data (bfd *ibfd,
3039 asection *isec,
3040 bfd *obfd,
3041 asection *osec)
3042 {
3043 if (bfd_get_flavour (ibfd) != bfd_target_coff_flavour
3044 || bfd_get_flavour (obfd) != bfd_target_coff_flavour)
3045 return TRUE;
3046
3047 if (coff_section_data (ibfd, isec) != NULL
3048 && pei_section_data (ibfd, isec) != NULL)
3049 {
3050 if (coff_section_data (obfd, osec) == NULL)
3051 {
3052 bfd_size_type amt = sizeof (struct coff_section_tdata);
3053 osec->used_by_bfd = bfd_zalloc (obfd, amt);
3054 if (osec->used_by_bfd == NULL)
3055 return FALSE;
3056 }
3057
3058 if (pei_section_data (obfd, osec) == NULL)
3059 {
3060 bfd_size_type amt = sizeof (struct pei_section_tdata);
3061 coff_section_data (obfd, osec)->tdata = bfd_zalloc (obfd, amt);
3062 if (coff_section_data (obfd, osec)->tdata == NULL)
3063 return FALSE;
3064 }
3065
3066 pei_section_data (obfd, osec)->virt_size =
3067 pei_section_data (ibfd, isec)->virt_size;
3068 pei_section_data (obfd, osec)->pe_flags =
3069 pei_section_data (ibfd, isec)->pe_flags;
3070 }
3071
3072 return TRUE;
3073 }
3074
3075 void
3076 _bfd_XX_get_symbol_info (bfd * abfd, asymbol *symbol, symbol_info *ret)
3077 {
3078 coff_get_symbol_info (abfd, symbol, ret);
3079 }
3080
3081 #if !defined(COFF_WITH_pep) && defined(COFF_WITH_pex64)
3082 static int
3083 sort_x64_pdata (const void *l, const void *r)
3084 {
3085 const char *lp = (const char *) l;
3086 const char *rp = (const char *) r;
3087 bfd_vma vl, vr;
3088 vl = bfd_getl32 (lp); vr = bfd_getl32 (rp);
3089 if (vl != vr)
3090 return (vl < vr ? -1 : 1);
3091 /* We compare just begin address. */
3092 return 0;
3093 }
3094 #endif
3095 \f
3096 /* Functions to process a .rsrc section. */
3097
3098 static unsigned int sizeof_leaves;
3099 static unsigned int sizeof_strings;
3100 static unsigned int sizeof_tables_and_entries;
3101
3102 static bfd_byte *
3103 rsrc_count_directory (bfd *, bfd_byte *, bfd_byte *, bfd_byte *, bfd_vma);
3104
3105 static bfd_byte *
3106 rsrc_count_entries (bfd * abfd,
3107 bfd_boolean is_name,
3108 bfd_byte * datastart,
3109 bfd_byte * data,
3110 bfd_byte * dataend,
3111 bfd_vma rva_bias)
3112 {
3113 unsigned long entry, addr, size;
3114
3115 if (data + 8 >= dataend)
3116 return dataend + 1;
3117
3118 if (is_name)
3119 {
3120 bfd_byte * name;
3121
3122 entry = (long) bfd_get_32 (abfd, data);
3123
3124 if (HighBitSet (entry))
3125 name = datastart + WithoutHighBit (entry);
3126 else
3127 name = datastart + entry - rva_bias;
3128
3129 if (name + 2 >= dataend || name < datastart)
3130 return dataend + 1;
3131
3132 unsigned int len = bfd_get_16 (abfd, name);
3133 if (len == 0 || len > 256)
3134 return dataend + 1;
3135 }
3136
3137 entry = (long) bfd_get_32 (abfd, data + 4);
3138
3139 if (HighBitSet (entry))
3140 {
3141 data = datastart + WithoutHighBit (entry);
3142
3143 if (data <= datastart || data >= dataend)
3144 return dataend + 1;
3145
3146 return rsrc_count_directory (abfd, datastart, data, dataend, rva_bias);
3147 }
3148
3149 if (datastart + entry + 16 >= dataend)
3150 return dataend + 1;
3151
3152 addr = (long) bfd_get_32 (abfd, datastart + entry);
3153 size = (long) bfd_get_32 (abfd, datastart + entry + 4);
3154
3155 return datastart + addr - rva_bias + size;
3156 }
3157
3158 static bfd_byte *
3159 rsrc_count_directory (bfd * abfd,
3160 bfd_byte * datastart,
3161 bfd_byte * data,
3162 bfd_byte * dataend,
3163 bfd_vma rva_bias)
3164 {
3165 unsigned int num_entries, num_ids;
3166 bfd_byte * highest_data = data;
3167
3168 if (data + 16 >= dataend)
3169 return dataend + 1;
3170
3171 num_entries = (int) bfd_get_16 (abfd, data + 12);
3172 num_ids = (int) bfd_get_16 (abfd, data + 14);
3173
3174 num_entries += num_ids;
3175
3176 data += 16;
3177
3178 while (num_entries --)
3179 {
3180 bfd_byte * entry_end;
3181
3182 entry_end = rsrc_count_entries (abfd, num_entries >= num_ids,
3183 datastart, data, dataend, rva_bias);
3184 data += 8;
3185 highest_data = max (highest_data, entry_end);
3186 if (entry_end >= dataend)
3187 break;
3188 }
3189
3190 return max (highest_data, data);
3191 }
3192
3193 typedef struct rsrc_dir_chain
3194 {
3195 unsigned int num_entries;
3196 struct rsrc_entry * first_entry;
3197 struct rsrc_entry * last_entry;
3198 } rsrc_dir_chain;
3199
3200 typedef struct rsrc_directory
3201 {
3202 unsigned int characteristics;
3203 unsigned int time;
3204 unsigned int major;
3205 unsigned int minor;
3206
3207 rsrc_dir_chain names;
3208 rsrc_dir_chain ids;
3209
3210 struct rsrc_entry * entry;
3211 } rsrc_directory;
3212
3213 typedef struct rsrc_string
3214 {
3215 unsigned int len;
3216 bfd_byte * string;
3217 } rsrc_string;
3218
3219 typedef struct rsrc_leaf
3220 {
3221 unsigned int size;
3222 unsigned int codepage;
3223 bfd_byte * data;
3224 } rsrc_leaf;
3225
3226 typedef struct rsrc_entry
3227 {
3228 bfd_boolean is_name;
3229 union
3230 {
3231 unsigned int id;
3232 struct rsrc_string name;
3233 } name_id;
3234
3235 bfd_boolean is_dir;
3236 union
3237 {
3238 struct rsrc_directory * directory;
3239 struct rsrc_leaf * leaf;
3240 } value;
3241
3242 struct rsrc_entry * next_entry;
3243 struct rsrc_directory * parent;
3244 } rsrc_entry;
3245
3246 static bfd_byte *
3247 rsrc_parse_directory (bfd *, rsrc_directory *, bfd_byte *,
3248 bfd_byte *, bfd_byte *, bfd_vma, rsrc_entry *);
3249
3250 static bfd_byte *
3251 rsrc_parse_entry (bfd * abfd,
3252 bfd_boolean is_name,
3253 rsrc_entry * entry,
3254 bfd_byte * datastart,
3255 bfd_byte * data,
3256 bfd_byte * dataend,
3257 bfd_vma rva_bias,
3258 rsrc_directory * parent)
3259 {
3260 unsigned long val, addr, size;
3261
3262 val = bfd_get_32 (abfd, data);
3263
3264 entry->parent = parent;
3265 entry->is_name = is_name;
3266
3267 if (is_name)
3268 {
3269 bfd_byte * address;
3270
3271 if (HighBitSet (val))
3272 {
3273 val = WithoutHighBit (val);
3274
3275 address = datastart + val;
3276 }
3277 else
3278 {
3279 address = datastart + val - rva_bias;
3280 }
3281
3282 if (address + 3 > dataend)
3283 return dataend;
3284
3285 entry->name_id.name.len = bfd_get_16 (abfd, address);
3286 entry->name_id.name.string = address + 2;
3287 }
3288 else
3289 entry->name_id.id = val;
3290
3291 val = bfd_get_32 (abfd, data + 4);
3292
3293 if (HighBitSet (val))
3294 {
3295 entry->is_dir = TRUE;
3296 entry->value.directory = bfd_malloc (sizeof * entry->value.directory);
3297 if (entry->value.directory == NULL)
3298 return dataend;
3299
3300 return rsrc_parse_directory (abfd, entry->value.directory,
3301 datastart,
3302 datastart + WithoutHighBit (val),
3303 dataend, rva_bias, entry);
3304 }
3305
3306 entry->is_dir = FALSE;
3307 entry->value.leaf = bfd_malloc (sizeof * entry->value.leaf);
3308 if (entry->value.leaf == NULL)
3309 return dataend;
3310
3311 data = datastart + val;
3312 if (data < datastart || data >= dataend)
3313 return dataend;
3314
3315 addr = bfd_get_32 (abfd, data);
3316 size = entry->value.leaf->size = bfd_get_32 (abfd, data + 4);
3317 entry->value.leaf->codepage = bfd_get_32 (abfd, data + 8);
3318 /* FIXME: We assume that the reserved field (data + 12) is OK. */
3319
3320 entry->value.leaf->data = bfd_malloc (size);
3321 if (entry->value.leaf->data == NULL)
3322 return dataend;
3323
3324 memcpy (entry->value.leaf->data, datastart + addr - rva_bias, size);
3325 return datastart + (addr - rva_bias) + size;
3326 }
3327
3328 static bfd_byte *
3329 rsrc_parse_entries (bfd * abfd,
3330 rsrc_dir_chain * chain,
3331 bfd_boolean is_name,
3332 bfd_byte * highest_data,
3333 bfd_byte * datastart,
3334 bfd_byte * data,
3335 bfd_byte * dataend,
3336 bfd_vma rva_bias,
3337 rsrc_directory * parent)
3338 {
3339 unsigned int i;
3340 rsrc_entry * entry;
3341
3342 if (chain->num_entries == 0)
3343 {
3344 chain->first_entry = chain->last_entry = NULL;
3345 return highest_data;
3346 }
3347
3348 entry = bfd_malloc (sizeof * entry);
3349 if (entry == NULL)
3350 return dataend;
3351
3352 chain->first_entry = entry;
3353
3354 for (i = chain->num_entries; i--;)
3355 {
3356 bfd_byte * entry_end;
3357
3358 entry_end = rsrc_parse_entry (abfd, is_name, entry, datastart,
3359 data, dataend, rva_bias, parent);
3360 data += 8;
3361 highest_data = max (entry_end, highest_data);
3362 if (entry_end > dataend)
3363 return dataend;
3364
3365 if (i)
3366 {
3367 entry->next_entry = bfd_malloc (sizeof * entry);
3368 entry = entry->next_entry;
3369 if (entry == NULL)
3370 return dataend;
3371 }
3372 else
3373 entry->next_entry = NULL;
3374 }
3375
3376 chain->last_entry = entry;
3377
3378 return highest_data;
3379 }
3380
3381 static bfd_byte *
3382 rsrc_parse_directory (bfd * abfd,
3383 rsrc_directory * table,
3384 bfd_byte * datastart,
3385 bfd_byte * data,
3386 bfd_byte * dataend,
3387 bfd_vma rva_bias,
3388 rsrc_entry * entry)
3389 {
3390 bfd_byte * highest_data = data;
3391
3392 if (table == NULL)
3393 return dataend;
3394
3395 table->characteristics = bfd_get_32 (abfd, data);
3396 table->time = bfd_get_32 (abfd, data + 4);
3397 table->major = bfd_get_16 (abfd, data + 8);
3398 table->minor = bfd_get_16 (abfd, data + 10);
3399 table->names.num_entries = bfd_get_16 (abfd, data + 12);
3400 table->ids.num_entries = bfd_get_16 (abfd, data + 14);
3401 table->entry = entry;
3402
3403 data += 16;
3404
3405 highest_data = rsrc_parse_entries (abfd, & table->names, TRUE, data,
3406 datastart, data, dataend, rva_bias, table);
3407 data += table->names.num_entries * 8;
3408
3409 highest_data = rsrc_parse_entries (abfd, & table->ids, FALSE, highest_data,
3410 datastart, data, dataend, rva_bias, table);
3411 data += table->ids.num_entries * 8;
3412
3413 return max (highest_data, data);
3414 }
3415
3416 typedef struct rsrc_write_data
3417 {
3418 bfd * abfd;
3419 bfd_byte * datastart;
3420 bfd_byte * next_table;
3421 bfd_byte * next_leaf;
3422 bfd_byte * next_string;
3423 bfd_byte * next_data;
3424 bfd_vma rva_bias;
3425 } rsrc_write_data;
3426
3427 static void
3428 rsrc_write_string (rsrc_write_data * data,
3429 rsrc_string * string)
3430 {
3431 bfd_put_16 (data->abfd, string->len, data->next_string);
3432 memcpy (data->next_string + 2, string->string, string->len * 2);
3433 data->next_string += (string->len + 1) * 2;
3434 }
3435
3436 static inline unsigned int
3437 rsrc_compute_rva (rsrc_write_data * data,
3438 bfd_byte * addr)
3439 {
3440 return (addr - data->datastart) + data->rva_bias;
3441 }
3442
3443 static void
3444 rsrc_write_leaf (rsrc_write_data * data,
3445 rsrc_leaf * leaf)
3446 {
3447 bfd_put_32 (data->abfd, rsrc_compute_rva (data, data->next_data),
3448 data->next_leaf);
3449 bfd_put_32 (data->abfd, leaf->size, data->next_leaf + 4);
3450 bfd_put_32 (data->abfd, leaf->codepage, data->next_leaf + 8);
3451 bfd_put_32 (data->abfd, 0 /*reserved*/, data->next_leaf + 12);
3452 data->next_leaf += 16;
3453
3454 memcpy (data->next_data, leaf->data, leaf->size);
3455 /* An undocumented feature of Windows resources is that each unit
3456 of raw data is 8-byte aligned... */
3457 data->next_data += ((leaf->size + 7) & ~7);
3458 }
3459
3460 static void rsrc_write_directory (rsrc_write_data *, rsrc_directory *);
3461
3462 static void
3463 rsrc_write_entry (rsrc_write_data * data,
3464 bfd_byte * where,
3465 rsrc_entry * entry)
3466 {
3467 if (entry->is_name)
3468 {
3469 bfd_put_32 (data->abfd,
3470 SetHighBit (data->next_string - data->datastart),
3471 where);
3472 rsrc_write_string (data, & entry->name_id.name);
3473 }
3474 else
3475 bfd_put_32 (data->abfd, entry->name_id.id, where);
3476
3477 if (entry->is_dir)
3478 {
3479 bfd_put_32 (data->abfd,
3480 SetHighBit (data->next_table - data->datastart),
3481 where + 4);
3482 rsrc_write_directory (data, entry->value.directory);
3483 }
3484 else
3485 {
3486 bfd_put_32 (data->abfd, data->next_leaf - data->datastart, where + 4);
3487 rsrc_write_leaf (data, entry->value.leaf);
3488 }
3489 }
3490
3491 static void
3492 rsrc_compute_region_sizes (rsrc_directory * dir)
3493 {
3494 struct rsrc_entry * entry;
3495
3496 if (dir == NULL)
3497 return;
3498
3499 sizeof_tables_and_entries += 16;
3500
3501 for (entry = dir->names.first_entry; entry != NULL; entry = entry->next_entry)
3502 {
3503 sizeof_tables_and_entries += 8;
3504
3505 sizeof_strings += (entry->name_id.name.len + 1) * 2;
3506
3507 if (entry->is_dir)
3508 rsrc_compute_region_sizes (entry->value.directory);
3509 else
3510 sizeof_leaves += 16;
3511 }
3512
3513 for (entry = dir->ids.first_entry; entry != NULL; entry = entry->next_entry)
3514 {
3515 sizeof_tables_and_entries += 8;
3516
3517 if (entry->is_dir)
3518 rsrc_compute_region_sizes (entry->value.directory);
3519 else
3520 sizeof_leaves += 16;
3521 }
3522 }
3523
3524 static void
3525 rsrc_write_directory (rsrc_write_data * data,
3526 rsrc_directory * dir)
3527 {
3528 rsrc_entry * entry;
3529 unsigned int i;
3530 bfd_byte * next_entry;
3531 bfd_byte * nt;
3532
3533 bfd_put_32 (data->abfd, dir->characteristics, data->next_table);
3534 bfd_put_32 (data->abfd, 0 /*dir->time*/, data->next_table + 4);
3535 bfd_put_16 (data->abfd, dir->major, data->next_table + 8);
3536 bfd_put_16 (data->abfd, dir->minor, data->next_table + 10);
3537 bfd_put_16 (data->abfd, dir->names.num_entries, data->next_table + 12);
3538 bfd_put_16 (data->abfd, dir->ids.num_entries, data->next_table + 14);
3539
3540 /* Compute where the entries and the next table will be placed. */
3541 next_entry = data->next_table + 16;
3542 data->next_table = next_entry + (dir->names.num_entries * 8)
3543 + (dir->ids.num_entries * 8);
3544 nt = data->next_table;
3545
3546 /* Write the entries. */
3547 for (i = dir->names.num_entries, entry = dir->names.first_entry;
3548 i > 0 && entry != NULL;
3549 i--, entry = entry->next_entry)
3550 {
3551 BFD_ASSERT (entry->is_name);
3552 rsrc_write_entry (data, next_entry, entry);
3553 next_entry += 8;
3554 }
3555 BFD_ASSERT (i == 0);
3556 BFD_ASSERT (entry == NULL);
3557
3558 for (i = dir->ids.num_entries, entry = dir->ids.first_entry;
3559 i > 0 && entry != NULL;
3560 i--, entry = entry->next_entry)
3561 {
3562 BFD_ASSERT (! entry->is_name);
3563 rsrc_write_entry (data, next_entry, entry);
3564 next_entry += 8;
3565 }
3566 BFD_ASSERT (i == 0);
3567 BFD_ASSERT (entry == NULL);
3568 BFD_ASSERT (nt == next_entry);
3569 }
3570
3571 #if defined HAVE_WCHAR_H && ! defined __CYGWIN__ && ! defined __MINGW32__
3572 /* Return the length (number of units) of the first character in S,
3573 putting its 'ucs4_t' representation in *PUC. */
3574
3575 static unsigned int
3576 #if defined HAVE_WCTYPE_H
3577 u16_mbtouc (wint_t * puc, const unsigned short * s, unsigned int n)
3578 #else
3579 u16_mbtouc (wchar_t * puc, const unsigned short * s, unsigned int n)
3580 #endif
3581 {
3582 unsigned short c = * s;
3583
3584 if (c < 0xd800 || c >= 0xe000)
3585 {
3586 *puc = c;
3587 return 1;
3588 }
3589
3590 if (c < 0xdc00)
3591 {
3592 if (n >= 2)
3593 {
3594 if (s[1] >= 0xdc00 && s[1] < 0xe000)
3595 {
3596 *puc = 0x10000 + ((c - 0xd800) << 10) + (s[1] - 0xdc00);
3597 return 2;
3598 }
3599 }
3600 else
3601 {
3602 /* Incomplete multibyte character. */
3603 *puc = 0xfffd;
3604 return n;
3605 }
3606 }
3607
3608 /* Invalid multibyte character. */
3609 *puc = 0xfffd;
3610 return 1;
3611 }
3612 #endif /* HAVE_WCHAR_H and not Cygwin/Mingw */
3613
3614 /* Perform a comparison of two entries. */
3615 static signed int
3616 rsrc_cmp (bfd_boolean is_name, rsrc_entry * a, rsrc_entry * b)
3617 {
3618 signed int res;
3619 bfd_byte * astring;
3620 unsigned int alen;
3621 bfd_byte * bstring;
3622 unsigned int blen;
3623
3624 if (! is_name)
3625 return a->name_id.id - b->name_id.id;
3626
3627 /* We have to perform a case insenstive, unicode string comparison... */
3628 astring = a->name_id.name.string;
3629 alen = a->name_id.name.len;
3630 bstring = b->name_id.name.string;
3631 blen = b->name_id.name.len;
3632
3633 #if defined __CYGWIN__ || defined __MINGW32__
3634 /* Under Windows hosts (both Cygwin and Mingw types),
3635 unicode == UTF-16 == wchar_t. The case insensitive string comparison
3636 function however goes by different names in the two environments... */
3637
3638 #undef rscpcmp
3639 #ifdef __CYGWIN__
3640 #define rscpcmp wcsncasecmp
3641 #endif
3642 #ifdef __MINGW32__
3643 #define rscpcmp wcsnicmp
3644 #endif
3645
3646 res = rscpcmp ((const wchar_t *) astring, (const wchar_t *) bstring,
3647 min (alen, blen));
3648
3649 #elif defined HAVE_WCHAR_H
3650 {
3651 unsigned int i;
3652
3653 res = 0;
3654 for (i = min (alen, blen); i--; astring += 2, bstring += 2)
3655 {
3656 #if defined HAVE_WCTYPE_H
3657 wint_t awc;
3658 wint_t bwc;
3659 #else
3660 wchar_t awc;
3661 wchar_t bwc;
3662 #endif
3663
3664 /* Convert UTF-16 unicode characters into wchar_t characters
3665 so that we can then perform a case insensitive comparison. */
3666 unsigned int Alen = u16_mbtouc (& awc, (const unsigned short *) astring, 2);
3667 unsigned int Blen = u16_mbtouc (& bwc, (const unsigned short *) bstring, 2);
3668
3669 if (Alen != Blen)
3670 return Alen - Blen;
3671
3672 #ifdef HAVE_WCTYPE_H
3673 awc = towlower (awc);
3674 bwc = towlower (bwc);
3675
3676 res = awc - bwc;
3677 #else
3678 res = wcsncasecmp (& awc, & bwc, 1);
3679 #endif
3680 if (res)
3681 break;
3682 }
3683 }
3684 #else
3685 /* Do the best we can - a case sensitive, untranslated comparison. */
3686 res = memcmp (astring, bstring, min (alen, blen) * 2);
3687 #endif
3688
3689 if (res == 0)
3690 res = alen - blen;
3691
3692 return res;
3693 }
3694
3695 static void
3696 rsrc_print_name (char * buffer, rsrc_string string)
3697 {
3698 unsigned int i;
3699 bfd_byte * name = string.string;
3700
3701 for (i = string.len; i--; name += 2)
3702 sprintf (buffer + strlen (buffer), "%.1s", name);
3703 }
3704
3705 static const char *
3706 rsrc_resource_name (rsrc_entry * entry, rsrc_directory * dir)
3707 {
3708 static char buffer [256];
3709 bfd_boolean is_string = FALSE;
3710
3711 buffer[0] = 0;
3712
3713 if (dir != NULL && dir->entry != NULL && dir->entry->parent != NULL
3714 && dir->entry->parent->entry != NULL)
3715 {
3716 strcpy (buffer, "type: ");
3717 if (dir->entry->parent->entry->is_name)
3718 rsrc_print_name (buffer + strlen (buffer),
3719 dir->entry->parent->entry->name_id.name);
3720 else
3721 {
3722 unsigned int id = dir->entry->parent->entry->name_id.id;
3723
3724 sprintf (buffer + strlen (buffer), "%x", id);
3725 switch (id)
3726 {
3727 case 1: strcat (buffer, " (CURSOR)"); break;
3728 case 2: strcat (buffer, " (BITMAP)"); break;
3729 case 3: strcat (buffer, " (ICON)"); break;
3730 case 4: strcat (buffer, " (MENU)"); break;
3731 case 5: strcat (buffer, " (DIALOG)"); break;
3732 case 6: strcat (buffer, " (STRING)"); is_string = TRUE; break;
3733 case 7: strcat (buffer, " (FONTDIR)"); break;
3734 case 8: strcat (buffer, " (FONT)"); break;
3735 case 9: strcat (buffer, " (ACCELERATOR)"); break;
3736 case 10: strcat (buffer, " (RCDATA)"); break;
3737 case 11: strcat (buffer, " (MESSAGETABLE)"); break;
3738 case 12: strcat (buffer, " (GROUP_CURSOR)"); break;
3739 case 14: strcat (buffer, " (GROUP_ICON)"); break;
3740 case 16: strcat (buffer, " (VERSION)"); break;
3741 case 17: strcat (buffer, " (DLGINCLUDE)"); break;
3742 case 19: strcat (buffer, " (PLUGPLAY)"); break;
3743 case 20: strcat (buffer, " (VXD)"); break;
3744 case 21: strcat (buffer, " (ANICURSOR)"); break;
3745 case 22: strcat (buffer, " (ANIICON)"); break;
3746 case 23: strcat (buffer, " (HTML)"); break;
3747 case 24: strcat (buffer, " (MANIFEST)"); break;
3748 case 240: strcat (buffer, " (DLGINIT)"); break;
3749 case 241: strcat (buffer, " (TOOLBAR)"); break;
3750 }
3751 }
3752 }
3753
3754 if (dir != NULL && dir->entry != NULL)
3755 {
3756 strcat (buffer, " name: ");
3757 if (dir->entry->is_name)
3758 rsrc_print_name (buffer + strlen (buffer), dir->entry->name_id.name);
3759 else
3760 {
3761 unsigned int id = dir->entry->name_id.id;
3762
3763 sprintf (buffer + strlen (buffer), "%x", id);
3764
3765 if (is_string)
3766 sprintf (buffer + strlen (buffer), " (resource id range: %d - %d)",
3767 (id - 1) << 4, (id << 4) - 1);
3768 }
3769 }
3770
3771 if (entry != NULL)
3772 {
3773 strcat (buffer, " lang: ");
3774
3775 if (entry->is_name)
3776 rsrc_print_name (buffer + strlen (buffer), entry->name_id.name);
3777 else
3778 sprintf (buffer + strlen (buffer), "%x", entry->name_id.id);
3779 }
3780
3781 return buffer;
3782 }
3783
3784 /* *sigh* Windows resource strings are special. Only the top 28-bits of
3785 their ID is stored in the NAME entry. The bottom four bits are used as
3786 an index into unicode string table that makes up the data of the leaf.
3787 So identical type-name-lang string resources may not actually be
3788 identical at all.
3789
3790 This function is called when we have detected two string resources with
3791 match top-28-bit IDs. We have to scan the string tables inside the leaves
3792 and discover if there are any real collisions. If there are then we report
3793 them and return FALSE. Otherwise we copy any strings from B into A and
3794 then return TRUE. */
3795
3796 static bfd_boolean
3797 rsrc_merge_string_entries (rsrc_entry * a ATTRIBUTE_UNUSED,
3798 rsrc_entry * b ATTRIBUTE_UNUSED)
3799 {
3800 unsigned int copy_needed = 0;
3801 unsigned int i;
3802 bfd_byte * astring;
3803 bfd_byte * bstring;
3804 bfd_byte * new_data;
3805 bfd_byte * nstring;
3806
3807 /* Step one: Find out what we have to do. */
3808 BFD_ASSERT (! a->is_dir);
3809 astring = a->value.leaf->data;
3810
3811 BFD_ASSERT (! b->is_dir);
3812 bstring = b->value.leaf->data;
3813
3814 for (i = 0; i < 16; i++)
3815 {
3816 unsigned int alen = astring[0] + (astring[1] << 8);
3817 unsigned int blen = bstring[0] + (bstring[1] << 8);
3818
3819 if (alen == 0)
3820 {
3821 copy_needed += blen * 2;
3822 }
3823 else if (blen == 0)
3824 ;
3825 else if (alen != blen)
3826 /* FIXME: Should we continue the loop in order to report other duplicates ? */
3827 break;
3828 /* alen == blen != 0. We might have two identical strings. If so we
3829 can ignore the second one. There is no need for wchar_t vs UTF-16
3830 theatrics here - we are only interested in (case sensitive) equality. */
3831 else if (memcmp (astring + 2, bstring + 2, alen * 2) != 0)
3832 break;
3833
3834 astring += (alen + 1) * 2;
3835 bstring += (blen + 1) * 2;
3836 }
3837
3838 if (i != 16)
3839 {
3840 if (a->parent != NULL
3841 && a->parent->entry != NULL
3842 && !a->parent->entry->is_name)
3843 _bfd_error_handler (_(".rsrc merge failure: duplicate string resource: %d"),
3844 ((a->parent->entry->name_id.id - 1) << 4) + i);
3845 return FALSE;
3846 }
3847
3848 if (copy_needed == 0)
3849 return TRUE;
3850
3851 /* If we reach here then A and B must both have non-colliding strings.
3852 (We never get string resources with fully empty string tables).
3853 We need to allocate an extra COPY_NEEDED bytes in A and then bring
3854 in B's strings. */
3855 new_data = bfd_malloc (a->value.leaf->size + copy_needed);
3856 if (new_data == NULL)
3857 return FALSE;
3858
3859 nstring = new_data;
3860 astring = a->value.leaf->data;
3861 bstring = b->value.leaf->data;
3862
3863 for (i = 0; i < 16; i++)
3864 {
3865 unsigned int alen = astring[0] + (astring[1] << 8);
3866 unsigned int blen = bstring[0] + (bstring[1] << 8);
3867
3868 if (alen != 0)
3869 {
3870 memcpy (nstring, astring, (alen + 1) * 2);
3871 nstring += (alen + 1) * 2;
3872 }
3873 else if (blen != 0)
3874 {
3875 memcpy (nstring, bstring, (blen + 1) * 2);
3876 nstring += (blen + 1) * 2;
3877 }
3878 else
3879 {
3880 * nstring++ = 0;
3881 * nstring++ = 0;
3882 }
3883
3884 astring += (alen + 1) * 2;
3885 bstring += (blen + 1) * 2;
3886 }
3887
3888 BFD_ASSERT (nstring - new_data == (signed) (a->value.leaf->size + copy_needed));
3889
3890 free (a->value.leaf->data);
3891 a->value.leaf->data = new_data;
3892 a->value.leaf->size += copy_needed;
3893
3894 return TRUE;
3895 }
3896
3897 static void rsrc_merge (rsrc_entry *, rsrc_entry *);
3898
3899 /* Sort the entries in given part of the directory.
3900 We use an old fashioned bubble sort because we are dealing
3901 with lists and we want to handle matches specially. */
3902
3903 static void
3904 rsrc_sort_entries (rsrc_dir_chain * chain,
3905 bfd_boolean is_name,
3906 rsrc_directory * dir)
3907 {
3908 rsrc_entry * entry;
3909 rsrc_entry * next;
3910 rsrc_entry ** points_to_entry;
3911 bfd_boolean swapped;
3912
3913 if (chain->num_entries < 2)
3914 return;
3915
3916 do
3917 {
3918 swapped = FALSE;
3919 points_to_entry = & chain->first_entry;
3920 entry = * points_to_entry;
3921 next = entry->next_entry;
3922
3923 do
3924 {
3925 signed int cmp = rsrc_cmp (is_name, entry, next);
3926
3927 if (cmp > 0)
3928 {
3929 entry->next_entry = next->next_entry;
3930 next->next_entry = entry;
3931 * points_to_entry = next;
3932 points_to_entry = & next->next_entry;
3933 next = entry->next_entry;
3934 swapped = TRUE;
3935 }
3936 else if (cmp == 0)
3937 {
3938 if (entry->is_dir && next->is_dir)
3939 {
3940 /* When we encounter identical directory entries we have to
3941 merge them together. The exception to this rule is for
3942 resource manifests - there can only be one of these,
3943 even if they differ in language. Zero-language manifests
3944 are assumed to be default manifests (provided by the
3945 Cygwin/MinGW build system) and these can be silently dropped,
3946 unless that would reduce the number of manifests to zero.
3947 There should only ever be one non-zero lang manifest -
3948 if there are more it is an error. A non-zero lang
3949 manifest takes precedence over a default manifest. */
3950 if (!entry->is_name
3951 && entry->name_id.id == 1
3952 && dir != NULL
3953 && dir->entry != NULL
3954 && !dir->entry->is_name
3955 && dir->entry->name_id.id == 0x18)
3956 {
3957 if (next->value.directory->names.num_entries == 0
3958 && next->value.directory->ids.num_entries == 1
3959 && !next->value.directory->ids.first_entry->is_name
3960 && next->value.directory->ids.first_entry->name_id.id == 0)
3961 /* Fall through so that NEXT is dropped. */
3962 ;
3963 else if (entry->value.directory->names.num_entries == 0
3964 && entry->value.directory->ids.num_entries == 1
3965 && !entry->value.directory->ids.first_entry->is_name
3966 && entry->value.directory->ids.first_entry->name_id.id == 0)
3967 {
3968 /* Swap ENTRY and NEXT. Then fall through so that the old ENTRY is dropped. */
3969 entry->next_entry = next->next_entry;
3970 next->next_entry = entry;
3971 * points_to_entry = next;
3972 points_to_entry = & next->next_entry;
3973 next = entry->next_entry;
3974 swapped = TRUE;
3975 }
3976 else
3977 {
3978 _bfd_error_handler (_(".rsrc merge failure: multiple non-default manifests"));
3979 bfd_set_error (bfd_error_file_truncated);
3980 return;
3981 }
3982
3983 /* Unhook NEXT from the chain. */
3984 /* FIXME: memory loss here. */
3985 entry->next_entry = next->next_entry;
3986 chain->num_entries --;
3987 if (chain->num_entries < 2)
3988 return;
3989 next = next->next_entry;
3990 }
3991 else
3992 rsrc_merge (entry, next);
3993 }
3994 else if (entry->is_dir != next->is_dir)
3995 {
3996 _bfd_error_handler (_(".rsrc merge failure: a directory matches a leaf"));
3997 bfd_set_error (bfd_error_file_truncated);
3998 return;
3999 }
4000 else
4001 {
4002 /* Otherwise with identical leaves we issue an error
4003 message - because there should never be duplicates.
4004 The exception is Type 18/Name 1/Lang 0 which is the
4005 defaul manifest - this can just be dropped. */
4006 if (!entry->is_name
4007 && entry->name_id.id == 0
4008 && dir != NULL
4009 && dir->entry != NULL
4010 && !dir->entry->is_name
4011 && dir->entry->name_id.id == 1
4012 && dir->entry->parent != NULL
4013 && dir->entry->parent->entry != NULL
4014 && !dir->entry->parent->entry->is_name
4015 && dir->entry->parent->entry->name_id.id == 0x18 /* RT_MANIFEST */)
4016 ;
4017 else if (dir != NULL
4018 && dir->entry != NULL
4019 && dir->entry->parent != NULL
4020 && dir->entry->parent->entry != NULL
4021 && !dir->entry->parent->entry->is_name
4022 && dir->entry->parent->entry->name_id.id == 0x6 /* RT_STRING */)
4023 {
4024 /* Strings need special handling. */
4025 if (! rsrc_merge_string_entries (entry, next))
4026 {
4027 /* _bfd_error_handler should have been called inside merge_strings. */
4028 bfd_set_error (bfd_error_file_truncated);
4029 return;
4030 }
4031 }
4032 else
4033 {
4034 if (dir == NULL
4035 || dir->entry == NULL
4036 || dir->entry->parent == NULL
4037 || dir->entry->parent->entry == NULL)
4038 _bfd_error_handler (_(".rsrc merge failure: duplicate leaf"));
4039 else
4040 _bfd_error_handler (_(".rsrc merge failure: duplicate leaf: %s"),
4041 rsrc_resource_name (entry, dir));
4042 bfd_set_error (bfd_error_file_truncated);
4043 return;
4044 }
4045 }
4046
4047 /* Unhook NEXT from the chain. */
4048 entry->next_entry = next->next_entry;
4049 chain->num_entries --;
4050 if (chain->num_entries < 2)
4051 return;
4052 next = next->next_entry;
4053 }
4054 else
4055 {
4056 points_to_entry = & entry->next_entry;
4057 entry = next;
4058 next = next->next_entry;
4059 }
4060 }
4061 while (next);
4062
4063 chain->last_entry = entry;
4064 }
4065 while (swapped);
4066 }
4067
4068 /* Attach B's chain onto A. */
4069 static void
4070 rsrc_attach_chain (rsrc_dir_chain * achain, rsrc_dir_chain * bchain)
4071 {
4072 if (bchain->num_entries == 0)
4073 return;
4074
4075 achain->num_entries += bchain->num_entries;
4076
4077 if (achain->first_entry == NULL)
4078 {
4079 achain->first_entry = bchain->first_entry;
4080 achain->last_entry = bchain->last_entry;
4081 }
4082 else
4083 {
4084 achain->last_entry->next_entry = bchain->first_entry;
4085 achain->last_entry = bchain->last_entry;
4086 }
4087
4088 bchain->num_entries = 0;
4089 bchain->first_entry = bchain->last_entry = NULL;
4090 }
4091
4092 static void
4093 rsrc_merge (struct rsrc_entry * a, struct rsrc_entry * b)
4094 {
4095 rsrc_directory * adir;
4096 rsrc_directory * bdir;
4097
4098 BFD_ASSERT (a->is_dir);
4099 BFD_ASSERT (b->is_dir);
4100
4101 adir = a->value.directory;
4102 bdir = b->value.directory;
4103
4104 if (adir->characteristics != bdir->characteristics)
4105 {
4106 _bfd_error_handler (_(".rsrc merge failure: dirs with differing characteristics"));
4107 bfd_set_error (bfd_error_file_truncated);
4108 return;
4109 }
4110
4111 if (adir->major != bdir->major || adir->minor != bdir->minor)
4112 {
4113 _bfd_error_handler (_(".rsrc merge failure: differing directory versions"));
4114 bfd_set_error (bfd_error_file_truncated);
4115 return;
4116 }
4117
4118 /* Attach B's name chain to A. */
4119 rsrc_attach_chain (& adir->names, & bdir->names);
4120
4121 /* Attach B's ID chain to A. */
4122 rsrc_attach_chain (& adir->ids, & bdir->ids);
4123
4124 /* Now sort A's entries. */
4125 rsrc_sort_entries (& adir->names, TRUE, adir);
4126 rsrc_sort_entries (& adir->ids, FALSE, adir);
4127 }
4128
4129 /* Check the .rsrc section. If it contains multiple concatenated
4130 resources then we must merge them properly. Otherwise Windows
4131 will ignore all but the first set. */
4132
4133 static void
4134 rsrc_process_section (bfd * abfd,
4135 struct coff_final_link_info * pfinfo)
4136 {
4137 rsrc_directory new_table;
4138 bfd_size_type size;
4139 asection * sec;
4140 pe_data_type * pe;
4141 bfd_vma rva_bias;
4142 bfd_byte * data;
4143 bfd_byte * datastart;
4144 bfd_byte * dataend;
4145 bfd_byte * new_data;
4146 unsigned int num_resource_sets;
4147 rsrc_directory * type_tables;
4148 rsrc_write_data write_data;
4149 unsigned int indx;
4150 bfd * input;
4151 unsigned int num_input_rsrc = 0;
4152 unsigned int max_num_input_rsrc = 4;
4153 ptrdiff_t * rsrc_sizes = NULL;
4154
4155 new_table.names.num_entries = 0;
4156 new_table.ids.num_entries = 0;
4157
4158 sec = bfd_get_section_by_name (abfd, ".rsrc");
4159 if (sec == NULL || (size = sec->rawsize) == 0)
4160 return;
4161
4162 pe = pe_data (abfd);
4163 if (pe == NULL)
4164 return;
4165
4166 rva_bias = sec->vma - pe->pe_opthdr.ImageBase;
4167
4168 data = bfd_malloc (size);
4169 if (data == NULL)
4170 return;
4171
4172 datastart = data;
4173
4174 if (! bfd_get_section_contents (abfd, sec, data, 0, size))
4175 goto end;
4176
4177 /* Step zero: Scan the input bfds looking for .rsrc sections and record
4178 their lengths. Note - we rely upon the fact that the linker script
4179 does *not* sort the input .rsrc sections, so that the order in the
4180 linkinfo list matches the order in the output .rsrc section.
4181
4182 We need to know the lengths because each input .rsrc section has padding
4183 at the end of a variable amount. (It does not appear to be based upon
4184 the section alignment or the file alignment). We need to skip any
4185 padding bytes when parsing the input .rsrc sections. */
4186 rsrc_sizes = bfd_malloc (max_num_input_rsrc * sizeof * rsrc_sizes);
4187 if (rsrc_sizes == NULL)
4188 goto end;
4189
4190 for (input = pfinfo->info->input_bfds;
4191 input != NULL;
4192 input = input->link.next)
4193 {
4194 asection * rsrc_sec = bfd_get_section_by_name (input, ".rsrc");
4195
4196 /* PR 18372 - skip discarded .rsrc sections. */
4197 if (rsrc_sec != NULL && !discarded_section (rsrc_sec))
4198 {
4199 if (num_input_rsrc == max_num_input_rsrc)
4200 {
4201 max_num_input_rsrc += 10;
4202 rsrc_sizes = bfd_realloc (rsrc_sizes, max_num_input_rsrc
4203 * sizeof * rsrc_sizes);
4204 if (rsrc_sizes == NULL)
4205 goto end;
4206 }
4207
4208 BFD_ASSERT (rsrc_sec->size > 0);
4209 rsrc_sizes [num_input_rsrc ++] = rsrc_sec->size;
4210 }
4211 }
4212
4213 if (num_input_rsrc < 2)
4214 goto end;
4215
4216 /* Step one: Walk the section, computing the size of the tables,
4217 leaves and data and decide if we need to do anything. */
4218 dataend = data + size;
4219 num_resource_sets = 0;
4220
4221 while (data < dataend)
4222 {
4223 bfd_byte * p = data;
4224
4225 data = rsrc_count_directory (abfd, data, data, dataend, rva_bias);
4226
4227 if (data > dataend)
4228 {
4229 /* Corrupted .rsrc section - cannot merge. */
4230 _bfd_error_handler (_("%pB: .rsrc merge failure: corrupt .rsrc section"),
4231 abfd);
4232 bfd_set_error (bfd_error_file_truncated);
4233 goto end;
4234 }
4235
4236 if ((data - p) > rsrc_sizes [num_resource_sets])
4237 {
4238 _bfd_error_handler (_("%pB: .rsrc merge failure: unexpected .rsrc size"),
4239 abfd);
4240 bfd_set_error (bfd_error_file_truncated);
4241 goto end;
4242 }
4243 /* FIXME: Should we add a check for "data - p" being much smaller
4244 than rsrc_sizes[num_resource_sets] ? */
4245
4246 data = p + rsrc_sizes[num_resource_sets];
4247 rva_bias += data - p;
4248 ++ num_resource_sets;
4249 }
4250 BFD_ASSERT (num_resource_sets == num_input_rsrc);
4251
4252 /* Step two: Walk the data again, building trees of the resources. */
4253 data = datastart;
4254 rva_bias = sec->vma - pe->pe_opthdr.ImageBase;
4255
4256 type_tables = bfd_malloc (num_resource_sets * sizeof * type_tables);
4257 if (type_tables == NULL)
4258 goto end;
4259
4260 indx = 0;
4261 while (data < dataend)
4262 {
4263 bfd_byte * p = data;
4264
4265 (void) rsrc_parse_directory (abfd, type_tables + indx, data, data,
4266 dataend, rva_bias, NULL);
4267 data = p + rsrc_sizes[indx];
4268 rva_bias += data - p;
4269 ++ indx;
4270 }
4271 BFD_ASSERT (indx == num_resource_sets);
4272
4273 /* Step three: Merge the top level tables (there can be only one).
4274
4275 We must ensure that the merged entries are in ascending order.
4276
4277 We also thread the top level table entries from the old tree onto
4278 the new table, so that they can be pulled off later. */
4279
4280 /* FIXME: Should we verify that all type tables are the same ? */
4281 new_table.characteristics = type_tables[0].characteristics;
4282 new_table.time = type_tables[0].time;
4283 new_table.major = type_tables[0].major;
4284 new_table.minor = type_tables[0].minor;
4285
4286 /* Chain the NAME entries onto the table. */
4287 new_table.names.first_entry = NULL;
4288 new_table.names.last_entry = NULL;
4289
4290 for (indx = 0; indx < num_resource_sets; indx++)
4291 rsrc_attach_chain (& new_table.names, & type_tables[indx].names);
4292
4293 rsrc_sort_entries (& new_table.names, TRUE, & new_table);
4294
4295 /* Chain the ID entries onto the table. */
4296 new_table.ids.first_entry = NULL;
4297 new_table.ids.last_entry = NULL;
4298
4299 for (indx = 0; indx < num_resource_sets; indx++)
4300 rsrc_attach_chain (& new_table.ids, & type_tables[indx].ids);
4301
4302 rsrc_sort_entries (& new_table.ids, FALSE, & new_table);
4303
4304 /* Step four: Create new contents for the .rsrc section. */
4305 /* Step four point one: Compute the size of each region of the .rsrc section.
4306 We do this now, rather than earlier, as the merging above may have dropped
4307 some entries. */
4308 sizeof_leaves = sizeof_strings = sizeof_tables_and_entries = 0;
4309 rsrc_compute_region_sizes (& new_table);
4310 /* We increment sizeof_strings to make sure that resource data
4311 starts on an 8-byte boundary. FIXME: Is this correct ? */
4312 sizeof_strings = (sizeof_strings + 7) & ~ 7;
4313
4314 new_data = bfd_zalloc (abfd, size);
4315 if (new_data == NULL)
4316 goto end;
4317
4318 write_data.abfd = abfd;
4319 write_data.datastart = new_data;
4320 write_data.next_table = new_data;
4321 write_data.next_leaf = new_data + sizeof_tables_and_entries;
4322 write_data.next_string = write_data.next_leaf + sizeof_leaves;
4323 write_data.next_data = write_data.next_string + sizeof_strings;
4324 write_data.rva_bias = sec->vma - pe->pe_opthdr.ImageBase;
4325
4326 rsrc_write_directory (& write_data, & new_table);
4327
4328 /* Step five: Replace the old contents with the new.
4329 We don't recompute the size as it's too late here to shrink section.
4330 See PR ld/20193 for more details. */
4331 bfd_set_section_contents (pfinfo->output_bfd, sec, new_data, 0, size);
4332 sec->size = sec->rawsize = size;
4333
4334 end:
4335 /* Step six: Free all the memory that we have used. */
4336 /* FIXME: Free the resource tree, if we have one. */
4337 free (datastart);
4338 free (rsrc_sizes);
4339 }
4340
4341 /* Handle the .idata section and other things that need symbol table
4342 access. */
4343
4344 bfd_boolean
4345 _bfd_XXi_final_link_postscript (bfd * abfd, struct coff_final_link_info *pfinfo)
4346 {
4347 struct coff_link_hash_entry *h1;
4348 struct bfd_link_info *info = pfinfo->info;
4349 bfd_boolean result = TRUE;
4350
4351 /* There are a few fields that need to be filled in now while we
4352 have symbol table access.
4353
4354 The .idata subsections aren't directly available as sections, but
4355 they are in the symbol table, so get them from there. */
4356
4357 /* The import directory. This is the address of .idata$2, with size
4358 of .idata$2 + .idata$3. */
4359 h1 = coff_link_hash_lookup (coff_hash_table (info),
4360 ".idata$2", FALSE, FALSE, TRUE);
4361 if (h1 != NULL)
4362 {
4363 /* PR ld/2729: We cannot rely upon all the output sections having been
4364 created properly, so check before referencing them. Issue a warning
4365 message for any sections tht could not be found. */
4366 if ((h1->root.type == bfd_link_hash_defined
4367 || h1->root.type == bfd_link_hash_defweak)
4368 && h1->root.u.def.section != NULL
4369 && h1->root.u.def.section->output_section != NULL)
4370 pe_data (abfd)->pe_opthdr.DataDirectory[PE_IMPORT_TABLE].VirtualAddress =
4371 (h1->root.u.def.value
4372 + h1->root.u.def.section->output_section->vma
4373 + h1->root.u.def.section->output_offset);
4374 else
4375 {
4376 _bfd_error_handler
4377 (_("%pB: unable to fill in DataDictionary[1] because .idata$2 is missing"),
4378 abfd);
4379 result = FALSE;
4380 }
4381
4382 h1 = coff_link_hash_lookup (coff_hash_table (info),
4383 ".idata$4", FALSE, FALSE, TRUE);
4384 if (h1 != NULL
4385 && (h1->root.type == bfd_link_hash_defined
4386 || h1->root.type == bfd_link_hash_defweak)
4387 && h1->root.u.def.section != NULL
4388 && h1->root.u.def.section->output_section != NULL)
4389 pe_data (abfd)->pe_opthdr.DataDirectory[PE_IMPORT_TABLE].Size =
4390 ((h1->root.u.def.value
4391 + h1->root.u.def.section->output_section->vma
4392 + h1->root.u.def.section->output_offset)
4393 - pe_data (abfd)->pe_opthdr.DataDirectory[PE_IMPORT_TABLE].VirtualAddress);
4394 else
4395 {
4396 _bfd_error_handler
4397 (_("%pB: unable to fill in DataDictionary[1] because .idata$4 is missing"),
4398 abfd);
4399 result = FALSE;
4400 }
4401
4402 /* The import address table. This is the size/address of
4403 .idata$5. */
4404 h1 = coff_link_hash_lookup (coff_hash_table (info),
4405 ".idata$5", FALSE, FALSE, TRUE);
4406 if (h1 != NULL
4407 && (h1->root.type == bfd_link_hash_defined
4408 || h1->root.type == bfd_link_hash_defweak)
4409 && h1->root.u.def.section != NULL
4410 && h1->root.u.def.section->output_section != NULL)
4411 pe_data (abfd)->pe_opthdr.DataDirectory[PE_IMPORT_ADDRESS_TABLE].VirtualAddress =
4412 (h1->root.u.def.value
4413 + h1->root.u.def.section->output_section->vma
4414 + h1->root.u.def.section->output_offset);
4415 else
4416 {
4417 _bfd_error_handler
4418 (_("%pB: unable to fill in DataDictionary[12] because .idata$5 is missing"),
4419 abfd);
4420 result = FALSE;
4421 }
4422
4423 h1 = coff_link_hash_lookup (coff_hash_table (info),
4424 ".idata$6", FALSE, FALSE, TRUE);
4425 if (h1 != NULL
4426 && (h1->root.type == bfd_link_hash_defined
4427 || h1->root.type == bfd_link_hash_defweak)
4428 && h1->root.u.def.section != NULL
4429 && h1->root.u.def.section->output_section != NULL)
4430 pe_data (abfd)->pe_opthdr.DataDirectory[PE_IMPORT_ADDRESS_TABLE].Size =
4431 ((h1->root.u.def.value
4432 + h1->root.u.def.section->output_section->vma
4433 + h1->root.u.def.section->output_offset)
4434 - pe_data (abfd)->pe_opthdr.DataDirectory[PE_IMPORT_ADDRESS_TABLE].VirtualAddress);
4435 else
4436 {
4437 _bfd_error_handler
4438 (_("%pB: unable to fill in DataDictionary[PE_IMPORT_ADDRESS_TABLE (12)] because .idata$6 is missing"),
4439 abfd);
4440 result = FALSE;
4441 }
4442 }
4443 else
4444 {
4445 h1 = coff_link_hash_lookup (coff_hash_table (info),
4446 "__IAT_start__", FALSE, FALSE, TRUE);
4447 if (h1 != NULL
4448 && (h1->root.type == bfd_link_hash_defined
4449 || h1->root.type == bfd_link_hash_defweak)
4450 && h1->root.u.def.section != NULL
4451 && h1->root.u.def.section->output_section != NULL)
4452 {
4453 bfd_vma iat_va;
4454
4455 iat_va =
4456 (h1->root.u.def.value
4457 + h1->root.u.def.section->output_section->vma
4458 + h1->root.u.def.section->output_offset);
4459
4460 h1 = coff_link_hash_lookup (coff_hash_table (info),
4461 "__IAT_end__", FALSE, FALSE, TRUE);
4462 if (h1 != NULL
4463 && (h1->root.type == bfd_link_hash_defined
4464 || h1->root.type == bfd_link_hash_defweak)
4465 && h1->root.u.def.section != NULL
4466 && h1->root.u.def.section->output_section != NULL)
4467 {
4468 pe_data (abfd)->pe_opthdr.DataDirectory[PE_IMPORT_ADDRESS_TABLE].Size =
4469 ((h1->root.u.def.value
4470 + h1->root.u.def.section->output_section->vma
4471 + h1->root.u.def.section->output_offset)
4472 - iat_va);
4473 if (pe_data (abfd)->pe_opthdr.DataDirectory[PE_IMPORT_ADDRESS_TABLE].Size != 0)
4474 pe_data (abfd)->pe_opthdr.DataDirectory[PE_IMPORT_ADDRESS_TABLE].VirtualAddress =
4475 iat_va - pe_data (abfd)->pe_opthdr.ImageBase;
4476 }
4477 else
4478 {
4479 _bfd_error_handler
4480 (_("%pB: unable to fill in DataDictionary[PE_IMPORT_ADDRESS_TABLE(12)]"
4481 " because .idata$6 is missing"), abfd);
4482 result = FALSE;
4483 }
4484 }
4485 }
4486
4487 h1 = coff_link_hash_lookup (coff_hash_table (info),
4488 (bfd_get_symbol_leading_char (abfd) != 0
4489 ? "__tls_used" : "_tls_used"),
4490 FALSE, FALSE, TRUE);
4491 if (h1 != NULL)
4492 {
4493 if ((h1->root.type == bfd_link_hash_defined
4494 || h1->root.type == bfd_link_hash_defweak)
4495 && h1->root.u.def.section != NULL
4496 && h1->root.u.def.section->output_section != NULL)
4497 pe_data (abfd)->pe_opthdr.DataDirectory[PE_TLS_TABLE].VirtualAddress =
4498 (h1->root.u.def.value
4499 + h1->root.u.def.section->output_section->vma
4500 + h1->root.u.def.section->output_offset
4501 - pe_data (abfd)->pe_opthdr.ImageBase);
4502 else
4503 {
4504 _bfd_error_handler
4505 (_("%pB: unable to fill in DataDictionary[9] because __tls_used is missing"),
4506 abfd);
4507 result = FALSE;
4508 }
4509 /* According to PECOFF sepcifications by Microsoft version 8.2
4510 the TLS data directory consists of 4 pointers, followed
4511 by two 4-byte integer. This implies that the total size
4512 is different for 32-bit and 64-bit executables. */
4513 #if !defined(COFF_WITH_pep) && !defined(COFF_WITH_pex64)
4514 pe_data (abfd)->pe_opthdr.DataDirectory[PE_TLS_TABLE].Size = 0x18;
4515 #else
4516 pe_data (abfd)->pe_opthdr.DataDirectory[PE_TLS_TABLE].Size = 0x28;
4517 #endif
4518 }
4519
4520 /* If there is a .pdata section and we have linked pdata finally, we
4521 need to sort the entries ascending. */
4522 #if !defined(COFF_WITH_pep) && defined(COFF_WITH_pex64)
4523 {
4524 asection *sec = bfd_get_section_by_name (abfd, ".pdata");
4525
4526 if (sec)
4527 {
4528 bfd_size_type x = sec->rawsize;
4529 bfd_byte *tmp_data = NULL;
4530
4531 if (x)
4532 tmp_data = bfd_malloc (x);
4533
4534 if (tmp_data != NULL)
4535 {
4536 if (bfd_get_section_contents (abfd, sec, tmp_data, 0, x))
4537 {
4538 qsort (tmp_data,
4539 (size_t) (x / 12),
4540 12, sort_x64_pdata);
4541 bfd_set_section_contents (pfinfo->output_bfd, sec,
4542 tmp_data, 0, x);
4543 }
4544 free (tmp_data);
4545 }
4546 else
4547 result = FALSE;
4548 }
4549 }
4550 #endif
4551
4552 rsrc_process_section (abfd, pfinfo);
4553
4554 /* If we couldn't find idata$2, we either have an excessively
4555 trivial program or are in DEEP trouble; we have to assume trivial
4556 program.... */
4557 return result;
4558 }
This page took 0.127301 seconds and 4 git commands to generate.