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