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