]> git.ipfire.org Git - thirdparty/binutils-gdb.git/blob - ld/pe-dll.c
a95b85c60dd21fa893af491f247f4d86b794de2c
[thirdparty/binutils-gdb.git] / ld / pe-dll.c
1 /* Routines to help build PEI-format DLLs (Win32 etc)
2 Copyright (C) 1998-2023 Free Software Foundation, Inc.
3 Written by DJ Delorie <dj@cygnus.com>
4
5 This file is part of the GNU Binutils.
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 #include "sysdep.h"
23 #include "bfd.h"
24 #include "bfdlink.h"
25 #include "libiberty.h"
26 #include "filenames.h"
27 #include "safe-ctype.h"
28 #include "ctf-api.h"
29
30 #include <time.h>
31
32 #include "ld.h"
33 #include "ldexp.h"
34 #include "ldlang.h"
35 #include "ldwrite.h"
36 #include "ldmisc.h"
37 #include <ldgram.h>
38 #include "ldmain.h"
39 #include "ldfile.h"
40 #include "ldemul.h"
41 #include "coff/internal.h"
42 #include "../bfd/libcoff.h"
43 #include "deffile.h"
44
45 #ifdef pe_use_plus
46
47 #define PE_IDATA4_SIZE 8
48 #define PE_IDATA5_SIZE 8
49 #include "pep-dll.h"
50 #undef AOUTSZ
51 #define AOUTSZ PEPAOUTSZ
52 #define PEAOUTHDR PEPAOUTHDR
53
54 #else
55
56 #include "pe-dll.h"
57
58 #endif
59
60 #ifndef PE_IDATA4_SIZE
61 #define PE_IDATA4_SIZE 4
62 #endif
63
64 #ifndef PE_IDATA5_SIZE
65 #define PE_IDATA5_SIZE 4
66 #endif
67
68 /* This file turns a regular Windows PE image into a DLL. Because of
69 the complexity of this operation, it has been broken down into a
70 number of separate modules which are all called by the main function
71 at the end of this file. This function is not re-entrant and is
72 normally only called once, so static variables are used to reduce
73 the number of parameters and return values required.
74
75 See also: ld/emultempl/pe.em and ld/emultempl/pep.em. */
76
77 /* Auto-import feature by Paul Sokolovsky
78
79 Quick facts:
80
81 1. With this feature on, DLL clients can import variables from DLL
82 without any concern from their side (for example, without any source
83 code modifications).
84
85 2. This is done completely in bounds of the PE specification (to be fair,
86 there's a place where it pokes nose out of, but in practice it works).
87 So, resulting module can be used with any other PE compiler/linker.
88
89 3. Auto-import is fully compatible with standard import method and they
90 can be mixed together.
91
92 4. Overheads: space: 8 bytes per imported symbol, plus 20 for each
93 reference to it; load time: negligible; virtual/physical memory: should be
94 less than effect of DLL relocation, and I sincerely hope it doesn't affect
95 DLL sharability (too much).
96
97 Idea
98
99 The obvious and only way to get rid of dllimport insanity is to make client
100 access variable directly in the DLL, bypassing extra dereference. I.e.,
101 whenever client contains something like
102
103 mov dll_var,%eax,
104
105 address of dll_var in the command should be relocated to point into loaded
106 DLL. The aim is to make OS loader do so, and than make ld help with that.
107 Import section of PE made following way: there's a vector of structures
108 each describing imports from particular DLL. Each such structure points
109 to two other parallel vectors: one holding imported names, and one which
110 will hold address of corresponding imported name. So, the solution is
111 de-vectorize these structures, making import locations be sparse and
112 pointing directly into code. Before continuing, it is worth a note that,
113 while authors strives to make PE act ELF-like, there're some other people
114 make ELF act PE-like: elfvector, ;-) .
115
116 Implementation
117
118 For each reference of data symbol to be imported from DLL (to set of which
119 belong symbols with name <sym>, if __imp_<sym> is found in implib), the
120 import fixup entry is generated. That entry is of type
121 IMAGE_IMPORT_DESCRIPTOR and stored in .idata$2 subsection. Each
122 fixup entry contains pointer to symbol's address within .text section
123 (marked with __fuN_<sym> symbol, where N is integer), pointer to DLL name
124 (so, DLL name is referenced by multiple entries), and pointer to symbol
125 name thunk. Symbol name thunk is singleton vector (__nm_th_<symbol>)
126 pointing to IMAGE_IMPORT_BY_NAME structure (__nm_<symbol>) directly
127 containing imported name. Here comes that "on the edge" problem mentioned
128 above: PE specification rambles that name vector (OriginalFirstThunk)
129 should run in parallel with addresses vector (FirstThunk), i.e. that they
130 should have same number of elements and terminated with zero. We violate
131 this, since FirstThunk points directly into machine code. But in practice,
132 OS loader implemented the sane way: it goes through OriginalFirstThunk and
133 puts addresses to FirstThunk, not something else. It once again should be
134 noted that dll and symbol name structures are reused across fixup entries
135 and should be there anyway to support standard import stuff, so sustained
136 overhead is 20 bytes per reference. Other question is whether having several
137 IMAGE_IMPORT_DESCRIPTORS for the same DLL is possible. Answer is yes, it is
138 done even by native compiler/linker (libth32's functions are in fact reside
139 in windows9x kernel32.dll, so if you use it, you have two
140 IMAGE_IMPORT_DESCRIPTORS for kernel32.dll). Yet other question is whether
141 referencing the same PE structures several times is valid. The answer is why
142 not, prohibiting that (detecting violation) would require more work on
143 behalf of loader than not doing it.
144
145 See also: ld/emultempl/pe.em and ld/emultempl/pep.em. */
146
147 static void add_bfd_to_link (bfd *, const char *, struct bfd_link_info *);
148
149 /* For emultempl/pe.em. */
150
151 def_file * pe_def_file = 0;
152 int pe_dll_export_everything = 0;
153 int pe_dll_exclude_all_symbols = 0;
154 int pe_dll_do_default_excludes = 1;
155 int pe_dll_kill_ats = 0;
156 int pe_dll_stdcall_aliases = 0;
157 int pe_dll_warn_dup_exports = 0;
158 int pe_dll_compat_implib = 0;
159 int pe_dll_extra_pe_debug = 0;
160 int pe_use_nul_prefixed_import_tables = 0;
161 int pe_use_coff_long_section_names = -1;
162 int pe_leading_underscore = -1;
163 int pe_dll_enable_reloc_section = 1;
164
165 /* Static variables and types. */
166
167 static bfd_vma image_base;
168 static bfd *filler_bfd;
169 static struct bfd_section *edata_s, *reloc_s;
170 static unsigned char *edata_d, *reloc_d;
171 static unsigned char *reloc_d = NULL;
172 static size_t edata_sz, reloc_sz = 0;
173 static int runtime_pseudo_relocs_created = 0;
174 static bool runtime_pseudp_reloc_v2_init = false;
175
176 typedef struct
177 {
178 const char *name;
179 int len;
180 }
181 autofilter_entry_type;
182
183 typedef struct
184 {
185 const char *target_name;
186 const char *object_target;
187 unsigned int imagebase_reloc;
188 int pe_arch;
189 int bfd_arch;
190 bool underscored;
191 const autofilter_entry_type* autofilter_symbollist;
192 }
193 pe_details_type;
194
195 static const autofilter_entry_type autofilter_symbollist_generic[] =
196 {
197 { STRING_COMMA_LEN ("_NULL_IMPORT_DESCRIPTOR") },
198 /* Entry point symbols. */
199 { STRING_COMMA_LEN ("DllMain") },
200 { STRING_COMMA_LEN ("DllMainCRTStartup") },
201 { STRING_COMMA_LEN ("_DllMainCRTStartup") },
202 /* Runtime pseudo-reloc. */
203 { STRING_COMMA_LEN ("_pei386_runtime_relocator") },
204 { STRING_COMMA_LEN ("do_pseudo_reloc") },
205 { NULL, 0 }
206 };
207
208 static const autofilter_entry_type autofilter_symbollist_i386[] =
209 {
210 { STRING_COMMA_LEN ("_NULL_IMPORT_DESCRIPTOR") },
211 /* Entry point symbols, and entry hooks. */
212 { STRING_COMMA_LEN ("cygwin_crt0") },
213 #ifdef pe_use_plus
214 { STRING_COMMA_LEN ("DllMain") },
215 { STRING_COMMA_LEN ("DllEntryPoint") },
216 { STRING_COMMA_LEN ("DllMainCRTStartup") },
217 { STRING_COMMA_LEN ("_cygwin_dll_entry") },
218 { STRING_COMMA_LEN ("_cygwin_crt0_common") },
219 { STRING_COMMA_LEN ("_cygwin_noncygwin_dll_entry") },
220 #else
221 { STRING_COMMA_LEN ("DllMain@12") },
222 { STRING_COMMA_LEN ("DllEntryPoint@0") },
223 { STRING_COMMA_LEN ("DllMainCRTStartup@12") },
224 { STRING_COMMA_LEN ("_cygwin_dll_entry@12") },
225 { STRING_COMMA_LEN ("_cygwin_crt0_common@8") },
226 { STRING_COMMA_LEN ("_cygwin_noncygwin_dll_entry@12") },
227 { STRING_COMMA_LEN ("cygwin_attach_dll") },
228 #endif
229 { STRING_COMMA_LEN ("cygwin_premain0") },
230 { STRING_COMMA_LEN ("cygwin_premain1") },
231 { STRING_COMMA_LEN ("cygwin_premain2") },
232 { STRING_COMMA_LEN ("cygwin_premain3") },
233 /* Runtime pseudo-reloc. */
234 { STRING_COMMA_LEN ("_pei386_runtime_relocator") },
235 { STRING_COMMA_LEN ("do_pseudo_reloc") },
236 /* Global vars that should not be exported. */
237 { STRING_COMMA_LEN ("impure_ptr") },
238 { STRING_COMMA_LEN ("_impure_ptr") },
239 { STRING_COMMA_LEN ("_fmode") },
240 { STRING_COMMA_LEN ("environ") },
241 { STRING_COMMA_LEN ("__dso_handle") },
242 { NULL, 0 }
243 };
244
245 #define PE_ARCH_i386 1
246 #define PE_ARCH_sh 2
247 #define PE_ARCH_mips 3
248 #define PE_ARCH_arm 4
249 #define PE_ARCH_arm_wince 5
250 #define PE_ARCH_aarch64 6
251
252 /* Don't make it constant as underscore mode gets possibly overriden
253 by target or -(no-)leading-underscore option. */
254 static pe_details_type pe_detail_list[] =
255 {
256 {
257 #ifdef pe_use_plus
258 "pei-x86-64",
259 "pe-x86-64",
260 3 /* R_IMAGEBASE */,
261 #else
262 "pei-i386",
263 "pe-i386",
264 7 /* R_IMAGEBASE */,
265 #endif
266 PE_ARCH_i386,
267 bfd_arch_i386,
268 #ifdef pe_use_plus
269 false,
270 #else
271 true,
272 #endif
273 autofilter_symbollist_i386
274 },
275 #ifdef pe_use_plus
276 {
277 "pei-x86-64",
278 "pe-bigobj-x86-64",
279 3 /* R_IMAGEBASE */,
280 PE_ARCH_i386,
281 bfd_arch_i386,
282 false,
283 autofilter_symbollist_i386
284 },
285 #else
286 {
287 "pei-i386",
288 "pe-bigobj-i386",
289 7 /* R_IMAGEBASE */,
290 PE_ARCH_i386,
291 bfd_arch_i386,
292 true,
293 autofilter_symbollist_i386
294 },
295 #endif
296 {
297 "pei-shl",
298 "pe-shl",
299 16 /* R_SH_IMAGEBASE */,
300 PE_ARCH_sh,
301 bfd_arch_sh,
302 true,
303 autofilter_symbollist_generic
304 },
305 {
306 "pei-mips",
307 "pe-mips",
308 34 /* MIPS_R_RVA */,
309 PE_ARCH_mips,
310 bfd_arch_mips,
311 false,
312 autofilter_symbollist_generic
313 },
314 {
315 "pei-arm-little",
316 "pe-arm-little",
317 11 /* ARM_RVA32 */,
318 PE_ARCH_arm,
319 bfd_arch_arm,
320 true,
321 autofilter_symbollist_generic
322 },
323 {
324 "pei-arm-wince-little",
325 "pe-arm-wince-little",
326 2, /* ARM_RVA32 on Windows CE, see bfd/coff-arm.c. */
327 PE_ARCH_arm_wince,
328 bfd_arch_arm,
329 false,
330 autofilter_symbollist_generic
331 },
332 {
333 "pei-aarch64-little",
334 "pe-aarch64-little",
335 2, /* ARM64_RVA32 */
336 PE_ARCH_aarch64,
337 bfd_arch_aarch64,
338 false,
339 autofilter_symbollist_generic
340 },
341 { NULL, NULL, 0, 0, 0, false, NULL }
342 };
343
344 static const pe_details_type *pe_details;
345
346 /* Do not specify library suffix explicitly, to allow for dllized versions. */
347 static const autofilter_entry_type autofilter_liblist[] =
348 {
349 { STRING_COMMA_LEN ("libcegcc") },
350 { STRING_COMMA_LEN ("libcygwin") },
351 { STRING_COMMA_LEN ("libgcc") },
352 { STRING_COMMA_LEN ("libgcc_s") },
353 { STRING_COMMA_LEN ("libstdc++") },
354 { STRING_COMMA_LEN ("libmingw32") },
355 { STRING_COMMA_LEN ("libmingwex") },
356 { STRING_COMMA_LEN ("libg2c") },
357 { STRING_COMMA_LEN ("libsupc++") },
358 { STRING_COMMA_LEN ("libobjc") },
359 { STRING_COMMA_LEN ("libgcj") },
360 { STRING_COMMA_LEN ("libmsvcrt") },
361 { STRING_COMMA_LEN ("libmsvcrt-os") },
362 { STRING_COMMA_LEN ("libucrt") },
363 { STRING_COMMA_LEN ("libucrtbase") },
364 { NULL, 0 }
365 };
366
367 /* Regardless of the suffix issue mentioned above, we must ensure that
368 we do not falsely match on a leading substring, such as when libtool
369 builds libstdc++ as a DLL using libsupc++convenience.a as an intermediate.
370 This routine ensures that the leading part of the name matches and that
371 it is followed by only an optional version suffix and a file extension,
372 returning zero if so or -1 if not. */
373 static int libnamencmp (const char *libname, const autofilter_entry_type *afptr)
374 {
375 if (filename_ncmp (libname, afptr->name, afptr->len))
376 return -1;
377
378 libname += afptr->len;
379
380 /* Be liberal in interpreting what counts as a version suffix; we
381 accept anything that has a dash to separate it from the name and
382 begins with a digit. */
383 if (libname[0] == '-')
384 {
385 if (!ISDIGIT (*++libname))
386 return -1;
387 /* Ensure the filename has an extension. */
388 while (*++libname != '.')
389 if (!*libname)
390 return -1;
391 }
392 else if (libname[0] != '.')
393 return -1;
394
395 return 0;
396 }
397
398 static const autofilter_entry_type autofilter_objlist[] =
399 {
400 { STRING_COMMA_LEN ("crt0.o") },
401 { STRING_COMMA_LEN ("crt1.o") },
402 { STRING_COMMA_LEN ("crt2.o") },
403 { STRING_COMMA_LEN ("dllcrt1.o") },
404 { STRING_COMMA_LEN ("dllcrt2.o") },
405 { STRING_COMMA_LEN ("gcrt0.o") },
406 { STRING_COMMA_LEN ("gcrt1.o") },
407 { STRING_COMMA_LEN ("gcrt2.o") },
408 { STRING_COMMA_LEN ("crtbegin.o") },
409 { STRING_COMMA_LEN ("crtend.o") },
410 { NULL, 0 }
411 };
412
413 static const autofilter_entry_type autofilter_symbolprefixlist[] =
414 {
415 /* _imp_ is treated specially, as it is always underscored. */
416 /* { STRING_COMMA_LEN ("_imp_") }, */
417 /* Don't export some c++ symbols. */
418 { STRING_COMMA_LEN ("__rtti_") },
419 { STRING_COMMA_LEN ("__builtin_") },
420 /* Don't re-export auto-imported symbols. */
421 { STRING_COMMA_LEN ("__nm_") },
422 /* Don't export symbols specifying internal DLL layout. */
423 { STRING_COMMA_LEN ("_head_") },
424 { STRING_COMMA_LEN ("_IMPORT_DESCRIPTOR_") },
425 /* Don't export section labels or artificial symbols
426 (eg ".weak.foo". */
427 { STRING_COMMA_LEN (".") },
428 { NULL, 0 }
429 };
430
431 static const autofilter_entry_type autofilter_symbolsuffixlist[] =
432 {
433 { STRING_COMMA_LEN ("_iname") },
434 { STRING_COMMA_LEN ("_NULL_THUNK_DATA") },
435 { NULL, 0 }
436 };
437
438 #define U(str) (pe_details->underscored ? "_" str : str)
439
440 void
441 pe_dll_id_target (const char *target)
442 {
443 int i;
444
445 for (i = 0; pe_detail_list[i].target_name; i++)
446 if (strcmp (pe_detail_list[i].target_name, target) == 0
447 || strcmp (pe_detail_list[i].object_target, target) == 0)
448 {
449 int u = pe_leading_underscore; /* Underscoring mode. -1 for use default. */
450 if (u == -1)
451 bfd_get_target_info (target, NULL, NULL, &u, NULL);
452 if (u == -1)
453 abort ();
454 pe_detail_list[i].underscored = u != 0;
455 pe_details = pe_detail_list + i;
456 pe_leading_underscore = (u != 0 ? 1 : 0);
457 return;
458 }
459 einfo (_("%X%P: unsupported PEI architecture: %s\n"), target);
460 exit (1);
461 }
462
463 /* Helper functions for qsort. Relocs must be sorted so that we can write
464 them out by pages. */
465
466 typedef struct
467 {
468 bfd_vma vma;
469 char type;
470 short extra;
471 int idx;
472 }
473 reloc_data_type;
474
475 static int
476 reloc_sort (const void *va, const void *vb)
477 {
478 const reloc_data_type *a = (const reloc_data_type *) va;
479 const reloc_data_type *b = (const reloc_data_type *) vb;
480
481 if (a->vma > b->vma)
482 return 1;
483 if (a->vma < b->vma)
484 return -1;
485 if (a->idx > b->idx)
486 return 1;
487 if (a->idx < b->idx)
488 return -1;
489 return 0;
490 }
491
492 static int
493 pe_export_sort (const void *va, const void *vb)
494 {
495 const def_file_export *a = va;
496 const def_file_export *b = vb;
497 char *an = a->name;
498 char *bn = b->name;
499 if (a->its_name)
500 an = a->its_name;
501 if (b->its_name)
502 bn = b->its_name;
503
504 return strcmp (an, bn);
505 }
506
507 /* Read and process the .DEF file. */
508
509 /* These correspond to the entries in pe_def_file->exports[]. I use
510 exported_symbol_sections[i] to tag whether or not the symbol was
511 defined, since we can't export symbols we don't have. */
512
513 static bfd_vma *exported_symbol_offsets;
514 static struct bfd_section **exported_symbol_sections;
515 static int export_table_size;
516 static int count_exported;
517 static int count_exported_byname;
518 static int count_with_ordinals;
519 static const char *dll_filename;
520 static int min_ordinal, max_ordinal;
521 static int *exported_symbols;
522
523 typedef struct exclude_list_struct
524 {
525 char *string;
526 struct exclude_list_struct *next;
527 exclude_type type;
528 }
529 exclude_list_struct;
530
531 static struct exclude_list_struct *excludes = 0;
532
533 void
534 pe_dll_add_excludes (const char *new_excludes, const exclude_type type)
535 {
536 char *local_copy;
537 char *exclude_string;
538
539 local_copy = xstrdup (new_excludes);
540
541 exclude_string = strtok (local_copy, ",:");
542 for (; exclude_string; exclude_string = strtok (NULL, ",:"))
543 {
544 struct exclude_list_struct *new_exclude;
545
546 new_exclude = xmalloc (sizeof (struct exclude_list_struct));
547 new_exclude->string = xmalloc (strlen (exclude_string) + 1);
548 strcpy (new_exclude->string, exclude_string);
549 new_exclude->type = type;
550 new_exclude->next = excludes;
551 excludes = new_exclude;
552 }
553
554 free (local_copy);
555 }
556
557 static bool
558 is_import (const char* n)
559 {
560 return (startswith (n, "__imp_"));
561 }
562
563 /* abfd is a bfd containing n (or NULL)
564 It can be used for contextual checks. */
565
566 static int
567 auto_export (bfd *abfd, def_file *d, const char *n)
568 {
569 def_file_export key;
570 struct exclude_list_struct *ex;
571 const autofilter_entry_type *afptr;
572 const char * libname = NULL;
573
574 if (abfd && abfd->my_archive)
575 libname = lbasename (bfd_get_filename (abfd->my_archive));
576
577 key.name = key.its_name = (char *) n;
578
579 /* Return false if n is in the d->exports table. */
580 if (d->num_exports != 0
581 && bsearch (&key, d->exports, d->num_exports,
582 sizeof (pe_def_file->exports[0]), pe_export_sort))
583 return 0;
584
585 if (pe_dll_do_default_excludes)
586 {
587 const char * p;
588 int len;
589
590 if (pe_dll_extra_pe_debug)
591 printf ("considering exporting: %s, abfd=%p, abfd->my_arc=%p\n",
592 n, abfd, abfd->my_archive);
593
594 /* First of all, make context checks:
595 Don't export anything from standard libs. */
596 if (libname)
597 {
598 afptr = autofilter_liblist;
599
600 while (afptr->name)
601 {
602 if (libnamencmp (libname, afptr) == 0 )
603 return 0;
604 afptr++;
605 }
606 }
607
608 /* Next, exclude symbols from certain startup objects. */
609
610 if (abfd && (p = lbasename (bfd_get_filename (abfd))))
611 {
612 afptr = autofilter_objlist;
613 while (afptr->name)
614 {
615 if (strcmp (p, afptr->name) == 0)
616 return 0;
617 afptr++;
618 }
619 }
620
621 /* Don't try to blindly exclude all symbols
622 that begin with '__'; this was tried and
623 it is too restrictive. Instead we have
624 a target specific list to use: */
625 afptr = pe_details->autofilter_symbollist;
626
627 while (afptr->name)
628 {
629 if (strcmp (n, afptr->name) == 0)
630 return 0;
631
632 afptr++;
633 }
634
635 /* Next, exclude symbols starting with ... */
636 afptr = autofilter_symbolprefixlist;
637 while (afptr->name)
638 {
639 if (strncmp (n, afptr->name, afptr->len) == 0)
640 return 0;
641
642 afptr++;
643 }
644
645 /* Finally, exclude symbols ending with ... */
646 len = strlen (n);
647 afptr = autofilter_symbolsuffixlist;
648 while (afptr->name)
649 {
650 if ((len >= afptr->len)
651 /* Add 1 to insure match with trailing '\0'. */
652 && strncmp (n + len - afptr->len, afptr->name,
653 afptr->len + 1) == 0)
654 return 0;
655
656 afptr++;
657 }
658 }
659
660 for (ex = excludes; ex; ex = ex->next)
661 {
662 if (ex->type == EXCLUDELIBS)
663 {
664 if (libname
665 && ((filename_cmp (libname, ex->string) == 0)
666 || (strcasecmp ("ALL", ex->string) == 0)))
667 return 0;
668 }
669 else if (ex->type == EXCLUDEFORIMPLIB)
670 {
671 if (filename_cmp (bfd_get_filename (abfd), ex->string) == 0)
672 return 0;
673 }
674 else if (strcmp (n, ex->string) == 0)
675 return 0;
676 }
677
678 return 1;
679 }
680
681 static void
682 process_def_file_and_drectve (bfd *abfd ATTRIBUTE_UNUSED, struct bfd_link_info *info)
683 {
684 int i, j;
685 unsigned int ui;
686 struct bfd_link_hash_entry *blhe;
687 bfd *b;
688 struct bfd_section *s;
689 def_file_export *e = 0;
690 bool resort_needed;
691
692 if (!pe_def_file)
693 pe_def_file = def_file_empty ();
694
695 /* First, run around to all the objects looking for the .drectve
696 sections, and push those into the def file too. */
697 for (b = info->input_bfds; b; b = b->link.next)
698 {
699 s = bfd_get_section_by_name (b, ".drectve");
700 if (s)
701 {
702 long size = s->size;
703 char *buf = xmalloc (size);
704
705 bfd_get_section_contents (b, s, buf, 0, size);
706 def_file_add_directive (pe_def_file, buf, size);
707 free (buf);
708 }
709 }
710
711 /* Process aligned common symbol information from the
712 .drectve sections now; common symbol allocation is
713 done before final link, so it will be too late to
714 process them in process_embedded_commands() called
715 from _bfd_coff_link_input_bfd(). */
716 if (pe_def_file->aligncomms)
717 {
718 def_file_aligncomm *ac = pe_def_file->aligncomms;
719 while (ac)
720 {
721 struct coff_link_hash_entry *sym_hash;
722 sym_hash = coff_link_hash_lookup (coff_hash_table (info),
723 ac->symbol_name, false, false, false);
724 if (sym_hash && sym_hash->root.type == bfd_link_hash_common
725 && sym_hash->root.u.c.p->alignment_power < (unsigned) ac->alignment)
726 {
727 sym_hash->root.u.c.p->alignment_power = (unsigned) ac->alignment;
728 }
729 ac = ac->next;
730 }
731 }
732
733 if (pe_def_file->exclude_symbols)
734 {
735 for (ui = 0; ui < pe_def_file->num_exclude_symbols; ui++)
736 {
737 pe_dll_add_excludes (pe_def_file->exclude_symbols[ui].symbol_name,
738 EXCLUDESYMS);
739 }
740 }
741
742 /* If we are building an executable and there is nothing
743 to export, we do not build an export table at all. */
744 if (bfd_link_executable (info) && pe_def_file->num_exports == 0
745 && (!pe_dll_export_everything || pe_dll_exclude_all_symbols))
746 return;
747
748 /* Now, maybe export everything else the default way. */
749 if ((pe_dll_export_everything || pe_def_file->num_exports == 0)
750 && !pe_dll_exclude_all_symbols)
751 {
752 for (b = info->input_bfds; b; b = b->link.next)
753 {
754 asymbol **symbols;
755 int nsyms;
756
757 if (!bfd_generic_link_read_symbols (b))
758 {
759 einfo (_("%F%P: %pB: could not read symbols: %E\n"), b);
760 return;
761 }
762
763 symbols = bfd_get_outsymbols (b);
764 nsyms = bfd_get_symcount (b);
765
766 for (j = 0; j < nsyms; j++)
767 {
768 /* We should export symbols which are either global or not
769 anything at all. (.bss data is the latter)
770 We should not export undefined symbols. */
771 bool would_export
772 = (symbols[j]->section != bfd_und_section_ptr
773 && ((symbols[j]->flags & BSF_GLOBAL)
774 || (symbols[j]->flags == 0)));
775 if (link_info.version_info && would_export)
776 would_export
777 = !bfd_hide_sym_by_version (link_info.version_info,
778 symbols[j]->name);
779 if (would_export)
780 {
781 const char *sn = symbols[j]->name;
782
783 /* We should not re-export imported stuff. */
784 {
785 char *name;
786 if (is_import (sn))
787 continue;
788
789 name = xmalloc (strlen ("__imp_") + strlen (sn) + 1);
790 sprintf (name, "%s%s", "__imp_", sn);
791
792 blhe = bfd_link_hash_lookup (info->hash, name,
793 false, false, false);
794 free (name);
795
796 if (blhe && blhe->type == bfd_link_hash_defined)
797 continue;
798 }
799
800 if (pe_details->underscored && *sn == '_')
801 sn++;
802
803 if (auto_export (b, pe_def_file, sn))
804 {
805 bool is_dup = false;
806 def_file_export *p;
807
808 p = def_file_add_export (pe_def_file, sn, 0, -1,
809 NULL, &is_dup);
810 /* Fill data flag properly, from dlltool.c. */
811 if (!is_dup)
812 p->flag_data = !(symbols[j]->flags & BSF_FUNCTION);
813 }
814 }
815 }
816 }
817 }
818
819 #undef NE
820 #define NE pe_def_file->num_exports
821
822 /* Don't create an empty export table. */
823 if (NE == 0)
824 return;
825
826 resort_needed = false;
827
828 /* Canonicalize the export list. */
829 if (pe_dll_kill_ats)
830 {
831 for (i = 0; i < NE; i++)
832 {
833 /* Check for fastcall/stdcall-decoration, but ignore
834 C++ mangled names. */
835 if (pe_def_file->exports[i].name[0] != '?'
836 && strchr (pe_def_file->exports[i].name, '@'))
837 {
838 /* This will preserve internal_name, which may have been
839 pointing to the same memory as name, or might not
840 have. */
841 int lead_at = (*pe_def_file->exports[i].name == '@');
842 char *tmp = xstrdup (pe_def_file->exports[i].name + lead_at);
843 char *tmp_at = strrchr (tmp, '@');
844
845 if (tmp_at)
846 *tmp_at = 0;
847 else
848 einfo (_("%X%P: cannot export %s: invalid export name\n"),
849 pe_def_file->exports[i].name);
850 pe_def_file->exports[i].name = tmp;
851 resort_needed = true;
852 }
853 }
854 }
855
856 /* Re-sort the exports table as we have possibly changed the order
857 by removing leading @. */
858 if (resort_needed)
859 qsort (pe_def_file->exports, NE, sizeof (pe_def_file->exports[0]),
860 pe_export_sort);
861
862 if (pe_dll_stdcall_aliases)
863 {
864 for (i = 0; i < NE; i++)
865 {
866 if (is_import (pe_def_file->exports[i].name))
867 continue;
868
869 if (strchr (pe_def_file->exports[i].name, '@'))
870 {
871 bool is_dup = true;
872 int lead_at = (*pe_def_file->exports[i].name == '@');
873 char *tmp = xstrdup (pe_def_file->exports[i].name + lead_at);
874
875 *(strchr (tmp, '@')) = 0;
876 if (auto_export (NULL, pe_def_file, tmp))
877 def_file_add_export (pe_def_file, tmp,
878 pe_def_file->exports[i].internal_name,
879 -1, NULL, &is_dup);
880 if (is_dup)
881 free (tmp);
882 }
883 }
884 }
885
886 /* Convenience, but watch out for it changing. */
887 e = pe_def_file->exports;
888
889 for (i = 0, j = 0; i < NE; i++)
890 {
891 if (i > 0 && strcmp (e[i].name, e[i - 1].name) == 0)
892 {
893 /* This is a duplicate. */
894 if (e[j - 1].ordinal != -1
895 && e[i].ordinal != -1
896 && e[j - 1].ordinal != e[i].ordinal)
897 {
898 if (pe_dll_warn_dup_exports)
899 /* xgettext:c-format */
900 einfo (_("%X%P: error, duplicate EXPORT with ordinals: %s (%d vs %d)\n"),
901 e[j - 1].name, e[j - 1].ordinal, e[i].ordinal);
902 }
903 else
904 {
905 if (pe_dll_warn_dup_exports)
906 /* xgettext:c-format */
907 einfo (_("%P: warning, duplicate EXPORT: %s\n"),
908 e[j - 1].name);
909 }
910
911 if (e[i].ordinal != -1)
912 e[j - 1].ordinal = e[i].ordinal;
913 e[j - 1].flag_private |= e[i].flag_private;
914 e[j - 1].flag_constant |= e[i].flag_constant;
915 e[j - 1].flag_noname |= e[i].flag_noname;
916 e[j - 1].flag_data |= e[i].flag_data;
917 free (e[i].name);
918 free (e[i].internal_name);
919 free (e[i].its_name);
920 }
921 else
922 {
923 if (i != j)
924 e[j] = e[i];
925 j++;
926 }
927 }
928 pe_def_file->num_exports = j; /* == NE */
929
930 exported_symbol_offsets = xmalloc (NE * sizeof (bfd_vma));
931 exported_symbol_sections = xmalloc (NE * sizeof (struct bfd_section *));
932
933 memset (exported_symbol_sections, 0, NE * sizeof (struct bfd_section *));
934 max_ordinal = 0;
935 min_ordinal = 65536;
936 count_exported = 0;
937 count_exported_byname = 0;
938 count_with_ordinals = 0;
939
940 for (i = 0; i < NE; i++)
941 {
942 char *int_name = pe_def_file->exports[i].internal_name;
943 char *name;
944
945 /* PR 19803: Make sure that any exported symbol does not get garbage collected. */
946 lang_add_gc_name (int_name);
947
948 name = xmalloc (strlen (int_name) + 2);
949 if (pe_details->underscored && int_name[0] != '@')
950 {
951 *name = '_';
952 strcpy (name + 1, int_name);
953
954 /* PR 19803: The alias must be preserved as well. */
955 lang_add_gc_name (xstrdup (name));
956 }
957 else
958 strcpy (name, int_name);
959
960 blhe = bfd_link_hash_lookup (info->hash,
961 name,
962 false, false, true);
963
964 if (blhe
965 && (blhe->type == bfd_link_hash_defined
966 || (blhe->type == bfd_link_hash_common)))
967 {
968 count_exported++;
969 if (!pe_def_file->exports[i].flag_noname)
970 count_exported_byname++;
971
972 /* Only fill in the sections. The actual offsets are computed
973 in fill_exported_offsets() after common symbols are laid
974 out. */
975 if (blhe->type == bfd_link_hash_defined)
976 exported_symbol_sections[i] = blhe->u.def.section;
977 else
978 exported_symbol_sections[i] = blhe->u.c.p->section;
979
980 if (pe_def_file->exports[i].ordinal != -1)
981 {
982 if (max_ordinal < pe_def_file->exports[i].ordinal)
983 max_ordinal = pe_def_file->exports[i].ordinal;
984 if (min_ordinal > pe_def_file->exports[i].ordinal)
985 min_ordinal = pe_def_file->exports[i].ordinal;
986 count_with_ordinals++;
987 }
988 }
989 /* Check for forward exports. These are indicated in DEF files by an
990 export directive of the form NAME1 = MODULE-NAME.EXTERNAL-NAME
991 but we must take care not to be fooled when the user wants to export
992 a symbol that actually really has a dot in it, so we only check
993 for them here, after real defined symbols have already been matched. */
994 else if (strchr (int_name, '.'))
995 {
996 count_exported++;
997 if (!pe_def_file->exports[i].flag_noname)
998 count_exported_byname++;
999
1000 pe_def_file->exports[i].flag_forward = 1;
1001
1002 if (pe_def_file->exports[i].ordinal != -1)
1003 {
1004 if (max_ordinal < pe_def_file->exports[i].ordinal)
1005 max_ordinal = pe_def_file->exports[i].ordinal;
1006 if (min_ordinal > pe_def_file->exports[i].ordinal)
1007 min_ordinal = pe_def_file->exports[i].ordinal;
1008 count_with_ordinals++;
1009 }
1010 }
1011 else if (blhe && blhe->type == bfd_link_hash_undefined)
1012 {
1013 /* xgettext:c-format */
1014 einfo (_("%X%P: cannot export %s: symbol not defined\n"),
1015 int_name);
1016 }
1017 else if (blhe)
1018 {
1019 /* xgettext:c-format */
1020 einfo (_("%X%P: cannot export %s: symbol wrong type (%d vs %d)\n"),
1021 int_name,
1022 blhe->type, bfd_link_hash_defined);
1023 }
1024 else
1025 {
1026 /* xgettext:c-format */
1027 einfo (_("%X%P: cannot export %s: symbol not found\n"),
1028 int_name);
1029 }
1030 free (name);
1031 }
1032 }
1033
1034 /* Build the bfd that will contain .edata and .reloc sections. */
1035
1036 static void
1037 build_filler_bfd (bool include_edata)
1038 {
1039 lang_input_statement_type *filler_file;
1040
1041 filler_file = lang_add_input_file ("dll stuff",
1042 lang_input_file_is_fake_enum,
1043 NULL);
1044 filler_file->the_bfd = filler_bfd = bfd_create ("dll stuff",
1045 link_info.output_bfd);
1046 if (filler_bfd == NULL
1047 || !bfd_set_arch_mach (filler_bfd,
1048 bfd_get_arch (link_info.output_bfd),
1049 bfd_get_mach (link_info.output_bfd)))
1050 {
1051 einfo (_("%F%P: can not create BFD: %E\n"));
1052 return;
1053 }
1054
1055 if (include_edata)
1056 {
1057 edata_s = bfd_make_section_old_way (filler_bfd, ".edata");
1058 if (edata_s == NULL
1059 || !bfd_set_section_flags (edata_s, (SEC_HAS_CONTENTS
1060 | SEC_ALLOC
1061 | SEC_LOAD
1062 | SEC_KEEP
1063 | SEC_IN_MEMORY)))
1064 {
1065 einfo (_("%X%P: can not create .edata section: %E\n"));
1066 return;
1067 }
1068 bfd_set_section_size (edata_s, edata_sz);
1069 }
1070
1071 reloc_s = bfd_make_section_old_way (filler_bfd, ".reloc");
1072 if (reloc_s == NULL
1073 || !bfd_set_section_flags (reloc_s, (SEC_HAS_CONTENTS
1074 | SEC_ALLOC
1075 | SEC_LOAD
1076 | SEC_KEEP
1077 | SEC_IN_MEMORY)))
1078 {
1079 einfo (_("%X%P: can not create .reloc section: %E\n"));
1080 return;
1081 }
1082
1083 bfd_set_section_size (reloc_s, 0);
1084
1085 ldlang_add_file (filler_file);
1086 }
1087
1088 /* Gather all the exported symbols and build the .edata section. */
1089
1090 static void
1091 generate_edata (void)
1092 {
1093 int i, next_ordinal;
1094 int name_table_size = 0;
1095
1096 /* First, we need to know how many exported symbols there are,
1097 and what the range of ordinals is. */
1098 if (count_with_ordinals && max_ordinal > count_exported)
1099 {
1100 if (min_ordinal > max_ordinal - count_exported + 1)
1101 min_ordinal = max_ordinal - count_exported + 1;
1102 }
1103 else
1104 {
1105 min_ordinal = 1;
1106 max_ordinal = count_exported;
1107 }
1108
1109 export_table_size = max_ordinal - min_ordinal + 1;
1110 exported_symbols = xmalloc (export_table_size * sizeof (int));
1111 for (i = 0; i < export_table_size; i++)
1112 exported_symbols[i] = -1;
1113
1114 /* Now we need to assign ordinals to those that don't have them. */
1115 for (i = 0; i < NE; i++)
1116 {
1117 if (exported_symbol_sections[i]
1118 || pe_def_file->exports[i].flag_forward)
1119 {
1120 if (pe_def_file->exports[i].ordinal != -1)
1121 {
1122 int ei = pe_def_file->exports[i].ordinal - min_ordinal;
1123 int pi = exported_symbols[ei];
1124
1125 if (pi != -1)
1126 {
1127 /* xgettext:c-format */
1128 einfo (_("%X%P: error: ordinal used twice: %d (%s vs %s)\n"),
1129 pe_def_file->exports[i].ordinal,
1130 pe_def_file->exports[i].name,
1131 pe_def_file->exports[pi].name);
1132 }
1133 exported_symbols[ei] = i;
1134 }
1135 if (pe_def_file->exports[i].its_name)
1136 name_table_size += strlen (pe_def_file->exports[i].its_name) + 1;
1137 else
1138 name_table_size += strlen (pe_def_file->exports[i].name) + 1;
1139 }
1140
1141 /* Reserve space for the forward name. */
1142 if (pe_def_file->exports[i].flag_forward)
1143 {
1144 name_table_size += strlen (pe_def_file->exports[i].internal_name) + 1;
1145 }
1146 }
1147
1148 next_ordinal = min_ordinal;
1149 for (i = 0; i < NE; i++)
1150 if ((exported_symbol_sections[i]
1151 || pe_def_file->exports[i].flag_forward)
1152 && pe_def_file->exports[i].ordinal == -1)
1153 {
1154 while (exported_symbols[next_ordinal - min_ordinal] != -1)
1155 next_ordinal++;
1156
1157 exported_symbols[next_ordinal - min_ordinal] = i;
1158 pe_def_file->exports[i].ordinal = next_ordinal;
1159 }
1160
1161 /* PR 12969: Check for more than 1^16 ordinals. */
1162 if (max_ordinal > 65535 || next_ordinal > 65535)
1163 /* xgettext:c-format */
1164 einfo(_("%X%P: error: export ordinal too large: %d\n"),
1165 max_ordinal > next_ordinal ? max_ordinal : next_ordinal);
1166
1167 /* OK, now we can allocate some memory. */
1168 edata_sz = (40 /* directory */
1169 + 4 * export_table_size /* addresses */
1170 + 4 * count_exported_byname /* name ptrs */
1171 + 2 * count_exported_byname /* ordinals */
1172 + name_table_size + strlen (dll_filename) + 1);
1173 }
1174
1175 /* Fill the exported symbol offsets. The preliminary work has already
1176 been done in process_def_file_and_drectve(). */
1177
1178 static void
1179 fill_exported_offsets (bfd *abfd ATTRIBUTE_UNUSED, struct bfd_link_info *info)
1180 {
1181 int i;
1182 struct bfd_link_hash_entry *blhe;
1183
1184 for (i = 0; i < pe_def_file->num_exports; i++)
1185 {
1186 char *name;
1187
1188 name = xmalloc (strlen (pe_def_file->exports[i].internal_name) + 2);
1189 if (pe_details->underscored
1190 && *pe_def_file->exports[i].internal_name != '@')
1191 {
1192 *name = '_';
1193 strcpy (name + 1, pe_def_file->exports[i].internal_name);
1194 }
1195 else
1196 strcpy (name, pe_def_file->exports[i].internal_name);
1197
1198 blhe = bfd_link_hash_lookup (info->hash,
1199 name,
1200 false, false, true);
1201
1202 if (blhe && blhe->type == bfd_link_hash_defined)
1203 exported_symbol_offsets[i] = blhe->u.def.value;
1204
1205 free (name);
1206 }
1207 }
1208
1209 static void
1210 fill_edata (bfd *abfd, struct bfd_link_info *info ATTRIBUTE_UNUSED)
1211 {
1212 int s, hint;
1213 unsigned char *edirectory;
1214 unsigned char *eaddresses;
1215 unsigned char *enameptrs;
1216 unsigned char *eordinals;
1217 char *enamestr;
1218
1219 edata_d = xmalloc (edata_sz);
1220
1221 /* Note use of array pointer math here. */
1222 edirectory = edata_d;
1223 eaddresses = edirectory + 40;
1224 enameptrs = eaddresses + 4 * export_table_size;
1225 eordinals = enameptrs + 4 * count_exported_byname;
1226 enamestr = (char *) eordinals + 2 * count_exported_byname;
1227
1228 #define ERVA(ptr) (((unsigned char *)(ptr) - edata_d) \
1229 + edata_s->output_section->vma - image_base)
1230
1231 memset (edata_d, 0, edata_sz);
1232
1233 if (pe_data (abfd)->timestamp == -1)
1234 {
1235 time_t now;
1236 char *source_date_epoch;
1237
1238 source_date_epoch = getenv ("SOURCE_DATE_EPOCH");
1239 if (source_date_epoch)
1240 now = (time_t) strtoll (source_date_epoch, NULL, 10);
1241 else
1242 now = time (NULL);
1243
1244 H_PUT_32 (abfd, now, edata_d + 4);
1245 }
1246 else
1247 H_PUT_32 (abfd, pe_data (abfd)->timestamp, edata_d + 4);
1248
1249 if (pe_def_file->version_major != -1)
1250 {
1251 bfd_put_16 (abfd, pe_def_file->version_major, edata_d + 8);
1252 bfd_put_16 (abfd, pe_def_file->version_minor, edata_d + 10);
1253 }
1254
1255 bfd_put_32 (abfd, ERVA (enamestr), edata_d + 12);
1256 strcpy (enamestr, dll_filename);
1257 enamestr += strlen (enamestr) + 1;
1258 bfd_put_32 (abfd, min_ordinal, edata_d + 16);
1259 bfd_put_32 (abfd, export_table_size, edata_d + 20);
1260 bfd_put_32 (abfd, count_exported_byname, edata_d + 24);
1261 bfd_put_32 (abfd, ERVA (eaddresses), edata_d + 28);
1262 bfd_put_32 (abfd, ERVA (enameptrs), edata_d + 32);
1263 bfd_put_32 (abfd, ERVA (eordinals), edata_d + 36);
1264
1265 fill_exported_offsets (abfd, info);
1266
1267 /* Ok, now for the filling in part.
1268 Scan alphabetically - ie the ordering in the exports[] table,
1269 rather than by ordinal - the ordering in the exported_symbol[]
1270 table. See dlltool.c and:
1271 http://sources.redhat.com/ml/binutils/2003-04/msg00379.html
1272 for more information. */
1273 hint = 0;
1274 for (s = 0; s < NE; s++)
1275 {
1276 struct bfd_section *ssec = exported_symbol_sections[s];
1277 if (pe_def_file->exports[s].ordinal != -1
1278 && (pe_def_file->exports[s].flag_forward || ssec != NULL))
1279 {
1280 int ord = pe_def_file->exports[s].ordinal;
1281
1282 if (pe_def_file->exports[s].flag_forward)
1283 {
1284 bfd_put_32 (abfd, ERVA (enamestr),
1285 eaddresses + 4 * (ord - min_ordinal));
1286
1287 strcpy (enamestr, pe_def_file->exports[s].internal_name);
1288 enamestr += strlen (pe_def_file->exports[s].internal_name) + 1;
1289 }
1290 else
1291 {
1292 bfd_vma srva = (exported_symbol_offsets[s]
1293 + ssec->output_section->vma
1294 + ssec->output_offset);
1295
1296 bfd_put_32 (abfd, srva - image_base,
1297 eaddresses + 4 * (ord - min_ordinal));
1298 }
1299
1300 if (!pe_def_file->exports[s].flag_noname)
1301 {
1302 char *ename = pe_def_file->exports[s].name;
1303 if (pe_def_file->exports[s].its_name)
1304 ename = pe_def_file->exports[s].its_name;
1305
1306 bfd_put_32 (abfd, ERVA (enamestr), enameptrs);
1307 enameptrs += 4;
1308 strcpy (enamestr, ename);
1309 enamestr += strlen (enamestr) + 1;
1310 bfd_put_16 (abfd, ord - min_ordinal, eordinals);
1311 eordinals += 2;
1312 pe_def_file->exports[s].hint = hint++;
1313 }
1314 }
1315 }
1316 }
1317
1318
1319 static struct bfd_section *current_sec;
1320
1321 static void
1322 pe_walk_relocs (struct bfd_link_info *info,
1323 char *name,
1324 const char *symname,
1325 struct bfd_hash_table *import_hash,
1326 void (*cb) (arelent *, asection *, char *, const char *))
1327 {
1328 bfd *b;
1329 asection *s;
1330
1331 for (b = info->input_bfds; b; b = b->link.next)
1332 {
1333 asymbol **symbols;
1334
1335 if (!bfd_generic_link_read_symbols (b))
1336 {
1337 einfo (_("%F%P: %pB: could not read symbols: %E\n"), b);
1338 return;
1339 }
1340
1341 symbols = bfd_get_outsymbols (b);
1342
1343 for (s = b->sections; s; s = s->next)
1344 {
1345 arelent **relocs;
1346 int relsize, nrelocs, i;
1347 int flags = bfd_section_flags (s);
1348
1349 /* Skip discarded linkonce sections. */
1350 if (flags & SEC_LINK_ONCE
1351 && s->output_section == bfd_abs_section_ptr)
1352 continue;
1353
1354 current_sec = s;
1355
1356 relsize = bfd_get_reloc_upper_bound (b, s);
1357 relocs = xmalloc (relsize);
1358 nrelocs = bfd_canonicalize_reloc (b, s, relocs, symbols);
1359
1360 for (i = 0; i < nrelocs; i++)
1361 {
1362 struct bfd_symbol *sym = *relocs[i]->sym_ptr_ptr;
1363
1364 /* Warning: the callback needs to be passed NAME directly. */
1365 if (import_hash)
1366 {
1367 if (bfd_hash_lookup (import_hash, sym->name, false, false))
1368 {
1369 strcpy (name, sym->name);
1370 cb (relocs[i], s, name, symname);
1371 }
1372 }
1373 else
1374 {
1375 if (strcmp (name, sym->name) == 0)
1376 cb (relocs[i], s, name, symname);
1377 }
1378 }
1379
1380 free (relocs);
1381
1382 /* Warning: the allocated symbols are remembered in BFD and reused
1383 later, so don't free them! */
1384 /* free (symbols); */
1385 }
1386 }
1387 }
1388
1389 void
1390 pe_find_data_imports (const char *symhead,
1391 void (*cb) (arelent *, asection *, char *, const char *))
1392 {
1393 struct bfd_link_hash_entry *undef;
1394 const size_t headlen = strlen (symhead);
1395 size_t namelen = 0;
1396 char *buf, *name;
1397 struct bfd_hash_table *import_hash;
1398
1399 for (undef = link_info.hash->undefs; undef; undef = undef->u.undef.next)
1400 if (undef->type == bfd_link_hash_undefined)
1401 {
1402 size_t len = strlen (undef->root.string);
1403 if (namelen < len)
1404 namelen = len;
1405 }
1406 if (namelen == 0)
1407 return;
1408
1409 /* For the pseudo-relocation support version 2, we can collect the symbols
1410 that are subject to auto-import and adjust the relocations en masse. */
1411 if (link_info.pei386_runtime_pseudo_reloc == 2)
1412 {
1413 import_hash
1414 = (struct bfd_hash_table *) xmalloc (sizeof (struct bfd_hash_table));
1415 if (!bfd_hash_table_init (import_hash,
1416 bfd_hash_newfunc,
1417 sizeof (struct bfd_hash_entry)))
1418 einfo (_("%F%P: bfd_hash_table_init failed: %E\n"));
1419 }
1420 else
1421 import_hash = NULL;
1422
1423 /* We are being a bit cunning here. The buffer will have space for
1424 prefixes at the beginning. The prefix is modified here and in a
1425 number of functions called from this function. */
1426 #define PREFIX_LEN 32
1427 buf = xmalloc (PREFIX_LEN + namelen + 1);
1428 name = buf + PREFIX_LEN;
1429
1430 for (undef = link_info.hash->undefs; undef; undef = undef->u.undef.next)
1431 if (undef->type == bfd_link_hash_undefined)
1432 {
1433 struct bfd_link_hash_entry *sym;
1434 char *impname;
1435
1436 if (pe_dll_extra_pe_debug)
1437 printf ("%s:%s\n", __func__, undef->root.string);
1438
1439 strcpy (name, undef->root.string);
1440 impname = name - (sizeof "__imp_" - 1);
1441 memcpy (impname, "__imp_", sizeof "__imp_" - 1);
1442
1443 sym = bfd_link_hash_lookup (link_info.hash, impname, 0, 0, 1);
1444
1445 if (sym && sym->type == bfd_link_hash_defined)
1446 {
1447 if (import_hash)
1448 bfd_hash_lookup (import_hash, undef->root.string, true, false);
1449 else
1450 {
1451 bfd *b = sym->u.def.section->owner;
1452 const char *symname = NULL;
1453 asymbol **symbols;
1454 int nsyms, i;
1455
1456 if (!bfd_generic_link_read_symbols (b))
1457 {
1458 einfo (_("%F%P: %pB: could not read symbols: %E\n"), b);
1459 return;
1460 }
1461
1462 symbols = bfd_get_outsymbols (b);
1463 nsyms = bfd_get_symcount (b);
1464
1465 for (i = 0; i < nsyms; i++)
1466 if (strncmp (symbols[i]->name, symhead, headlen) == 0)
1467 {
1468 if (pe_dll_extra_pe_debug)
1469 printf ("->%s\n", symbols[i]->name);
1470
1471 symname = symbols[i]->name + headlen;
1472 break;
1473 }
1474
1475 /* If the symobl isn't part of an import table, there is no
1476 point in building a fixup, this would give rise to link
1477 errors for mangled symbols instead of the original one. */
1478 if (symname)
1479 pe_walk_relocs (&link_info, name, symname, NULL, cb);
1480 else
1481 continue;
1482 }
1483
1484 /* Let's differentiate it somehow from defined. */
1485 undef->type = bfd_link_hash_defweak;
1486 undef->u.def.value = sym->u.def.value;
1487 undef->u.def.section = sym->u.def.section;
1488
1489 /* We replace the original name with the __imp_ prefixed one, this
1490 1) may trash memory 2) leads to duplicate symbols. But this is
1491 better than having a misleading name that can confuse GDB. */
1492 undef->root.string = sym->root.string;
1493
1494 if (link_info.pei386_auto_import == -1)
1495 {
1496 static bool warned = false;
1497
1498 info_msg (_("Info: resolving %s by linking to %s "
1499 "(auto-import)\n"), name, impname);
1500
1501 /* PR linker/4844. */
1502 if (!warned)
1503 {
1504 einfo (_("%P: warning: auto-importing has been activated "
1505 "without --enable-auto-import specified on the "
1506 "command line; this should work unless it "
1507 "involves constant data structures referencing "
1508 "symbols from auto-imported DLLs\n"));
1509 warned = true;
1510 }
1511 }
1512 }
1513 }
1514
1515 /* If we have the import hash table, walk the relocations only once. */
1516 if (import_hash)
1517 {
1518 pe_walk_relocs (&link_info, name, NULL, import_hash, cb);
1519 bfd_hash_table_free (import_hash);
1520 free (import_hash);
1521 }
1522
1523 free (buf);
1524 }
1525
1526 /* Gather all the relocations and build the .reloc section. */
1527
1528 static void
1529 generate_reloc (bfd *abfd, struct bfd_link_info *info)
1530 {
1531 /* For .reloc stuff. */
1532 reloc_data_type *reloc_data;
1533 int total_relocs = 0;
1534 int i;
1535 bfd_vma sec_page = (bfd_vma) -1;
1536 bfd_vma page_ptr;
1537 bfd *b;
1538 struct bfd_section *s;
1539
1540 if (reloc_s == NULL || reloc_s->output_section == bfd_abs_section_ptr)
1541 return;
1542
1543 /* Set an upper bound for the total number of relocations we will have to generate. */
1544 total_relocs = 0;
1545 for (b = info->input_bfds; b; b = b->link.next)
1546 for (s = b->sections; s; s = s->next)
1547 total_relocs += s->reloc_count;
1548
1549 reloc_data = xmalloc (total_relocs * sizeof (reloc_data_type));
1550
1551 total_relocs = 0;
1552 for (b = info->input_bfds; b; b = b->link.next)
1553 {
1554 arelent **relocs;
1555 int relsize, nrelocs;
1556 asymbol **symbols;
1557
1558 if (!bfd_generic_link_read_symbols (b))
1559 {
1560 einfo (_("%F%P: %pB: could not read symbols: %E\n"), b);
1561 return;
1562 }
1563
1564 symbols = bfd_get_outsymbols (b);
1565
1566 for (s = b->sections; s; s = s->next)
1567 {
1568 bfd_vma sec_vma;
1569
1570 /* If the section is not going to be output, then ignore it. */
1571 if (s->output_section == NULL)
1572 {
1573 /* FIXME: This should not happen. Convert to the correct
1574 form here, but really, this should be investigated. */
1575 s->output_section = bfd_abs_section_ptr;
1576 continue;
1577 }
1578
1579 /* I don't know why there would be a reloc for these, but I've
1580 seen it happen - DJ */
1581 if (s->output_section == bfd_abs_section_ptr)
1582 continue;
1583
1584 /* If it's not loaded, we don't need to relocate it this way. */
1585 if (!(s->output_section->flags & SEC_LOAD))
1586 continue;
1587
1588 /* This happens when linking with --just-symbols=<file>
1589 so do not generate an error. */
1590 if (s->output_section->vma == 0)
1591 continue;
1592
1593 sec_vma = s->output_section->vma + s->output_offset;
1594
1595 relsize = bfd_get_reloc_upper_bound (b, s);
1596 relocs = xmalloc (relsize);
1597 nrelocs = bfd_canonicalize_reloc (b, s, relocs, symbols);
1598
1599 for (i = 0; i < nrelocs; i++)
1600 {
1601 if (pe_dll_extra_pe_debug)
1602 {
1603 struct bfd_symbol *sym = *relocs[i]->sym_ptr_ptr;
1604 printf ("rel: %s\n", sym->name);
1605 }
1606 if (!relocs[i]->howto->pc_relative
1607 && relocs[i]->howto->type != pe_details->imagebase_reloc)
1608 {
1609 struct bfd_symbol *sym = *relocs[i]->sym_ptr_ptr;
1610 const struct bfd_link_hash_entry *blhe
1611 = bfd_wrapped_link_hash_lookup (abfd, info, sym->name,
1612 false, false, false);
1613
1614 /* Don't create relocs for undefined weak symbols. */
1615 if (sym->flags == BSF_WEAK)
1616 {
1617 if (blhe && blhe->type == bfd_link_hash_undefweak)
1618 {
1619 /* Check aux sym and see if it is defined or not. */
1620 struct coff_link_hash_entry *h, *h2;
1621 h = (struct coff_link_hash_entry *)blhe;
1622 if (h->symbol_class != C_NT_WEAK || h->numaux != 1)
1623 continue;
1624 h2 = h->auxbfd->tdata.coff_obj_data->sym_hashes
1625 [h->aux->x_sym.x_tagndx.u32];
1626 /* We don't want a base reloc if the aux sym is not
1627 found, undefined, or if it is the constant ABS
1628 zero default value. (We broaden that slightly by
1629 not testing the value, just the section; there's
1630 no reason we'd want a reference to any absolute
1631 address to get relocated during rebasing). */
1632 if (!h2 || h2->root.type == bfd_link_hash_undefined
1633 || h2->root.u.def.section == bfd_abs_section_ptr)
1634 continue;
1635 }
1636 else if (!blhe || blhe->type != bfd_link_hash_defined)
1637 continue;
1638 }
1639 /* Nor for Dwarf FDE references to discarded sections. */
1640 else if (bfd_is_abs_section (sym->section->output_section))
1641 {
1642 /* We only ignore relocs from .eh_frame sections, as
1643 they are discarded by the final link rather than
1644 resolved against the kept section. */
1645 if (!strcmp (s->name, ".eh_frame"))
1646 continue;
1647 }
1648 /* Nor for absolute symbols. */
1649 else if (blhe && ldexp_is_final_sym_absolute (blhe)
1650 && (!blhe->linker_def
1651 || (strcmp (sym->name, "__image_base__")
1652 && strcmp (sym->name, U ("__ImageBase")))))
1653 continue;
1654
1655 reloc_data[total_relocs].vma = sec_vma + relocs[i]->address;
1656 reloc_data[total_relocs].idx = total_relocs;
1657
1658 /* Since we're only about to determine .reloc's size,
1659 subsequent output section VMA calculations will shift up
1660 sections at this or higher addresses. Relocations for
1661 such sections would hence end up not being correct. */
1662 if (reloc_data[total_relocs].vma
1663 >= reloc_s->output_section->vma)
1664 einfo (_("%P: base relocation for section `%s' above "
1665 ".reloc section\n"), s->output_section->name);
1666
1667 #define BITS_AND_SHIFT(bits, shift) (bits * 1000 | shift)
1668
1669 switch BITS_AND_SHIFT (relocs[i]->howto->bitsize,
1670 relocs[i]->howto->rightshift)
1671 {
1672 #ifdef pe_use_plus
1673 case BITS_AND_SHIFT (64, 0):
1674 reloc_data[total_relocs].type = IMAGE_REL_BASED_DIR64;
1675 total_relocs++;
1676 break;
1677 #endif
1678 case BITS_AND_SHIFT (32, 0):
1679 reloc_data[total_relocs].type = IMAGE_REL_BASED_HIGHLOW;
1680 total_relocs++;
1681 break;
1682 case BITS_AND_SHIFT (16, 0):
1683 reloc_data[total_relocs].type = IMAGE_REL_BASED_LOW;
1684 total_relocs++;
1685 break;
1686 case BITS_AND_SHIFT (16, 16):
1687 reloc_data[total_relocs].type = IMAGE_REL_BASED_HIGHADJ;
1688 /* FIXME: we can't know the symbol's right value
1689 yet, but we probably can safely assume that
1690 CE will relocate us in 64k blocks, so leaving
1691 it zero is safe. */
1692 reloc_data[total_relocs].extra = 0;
1693 total_relocs++;
1694 break;
1695 case BITS_AND_SHIFT (26, 2):
1696 reloc_data[total_relocs].type =
1697 IMAGE_REL_BASED_ARM_MOV32;
1698 total_relocs++;
1699 break;
1700 case BITS_AND_SHIFT (24, 2):
1701 /* FIXME: 0 is ARM_26D, it is defined in bfd/coff-arm.c
1702 Those ARM_xxx definitions should go in proper
1703 header someday. */
1704 if (relocs[i]->howto->type == 0
1705 /* Older GNU linkers used 5 instead of 0 for this reloc. */
1706 || relocs[i]->howto->type == 5)
1707 /* This is an ARM_26D reloc, which is an ARM_26 reloc
1708 that has already been fully processed during a
1709 previous link stage, so ignore it here. */
1710 break;
1711 /* Fall through. */
1712 default:
1713 /* xgettext:c-format */
1714 einfo (_("%X%P: error: %d-bit reloc in dll\n"),
1715 relocs[i]->howto->bitsize);
1716 break;
1717 }
1718 }
1719 }
1720
1721 free (relocs);
1722 /* Warning: the allocated symbols are remembered in BFD and
1723 reused later, so don't free them! */
1724 }
1725 }
1726
1727 /* This can happen for example when LTO has eliminated all code. */
1728 if (total_relocs == 0)
1729 return;
1730
1731 /* At this point, we have total_relocs relocation addresses in
1732 reloc_addresses, which are all suitable for the .reloc section.
1733 We must now create the new sections. */
1734 qsort (reloc_data, total_relocs, sizeof (*reloc_data), reloc_sort);
1735
1736 for (i = 0; i < total_relocs; i++)
1737 {
1738 bfd_vma this_page = (reloc_data[i].vma >> 12);
1739
1740 if (this_page != sec_page)
1741 {
1742 reloc_sz = (reloc_sz + 3) & ~3; /* 4-byte align. */
1743 reloc_sz += 8;
1744 sec_page = this_page;
1745 }
1746
1747 reloc_sz += 2;
1748
1749 if (reloc_data[i].type == IMAGE_REL_BASED_HIGHADJ)
1750 reloc_sz += 2;
1751 }
1752
1753 reloc_sz = (reloc_sz + 3) & ~3; /* 4-byte align. */
1754 reloc_d = xmalloc (reloc_sz);
1755
1756 page_ptr = sec_page = (bfd_vma) -1;
1757 reloc_sz = 0;
1758
1759 for (i = 0; i < total_relocs; i++)
1760 {
1761 bfd_vma rva = reloc_data[i].vma - image_base;
1762 bfd_vma this_page = (rva & ~0xfff);
1763
1764 if (this_page != sec_page)
1765 {
1766 while (reloc_sz & 3)
1767 reloc_d[reloc_sz++] = 0;
1768
1769 if (page_ptr != (bfd_vma) -1)
1770 bfd_put_32 (abfd, reloc_sz - page_ptr, reloc_d + page_ptr + 4);
1771
1772 bfd_put_32 (abfd, this_page, reloc_d + reloc_sz);
1773 page_ptr = reloc_sz;
1774 reloc_sz += 8;
1775 sec_page = this_page;
1776 }
1777
1778 bfd_put_16 (abfd, (rva & 0xfff) + (reloc_data[i].type << 12),
1779 reloc_d + reloc_sz);
1780 reloc_sz += 2;
1781
1782 if (reloc_data[i].type == IMAGE_REL_BASED_HIGHADJ)
1783 {
1784 bfd_put_16 (abfd, reloc_data[i].extra, reloc_d + reloc_sz);
1785 reloc_sz += 2;
1786 }
1787 }
1788
1789 while (reloc_sz & 3)
1790 reloc_d[reloc_sz++] = 0;
1791
1792 if (page_ptr != (bfd_vma) -1)
1793 bfd_put_32 (abfd, reloc_sz - page_ptr, reloc_d + page_ptr + 4);
1794 }
1795
1796 /* Given the exiting def_file structure, print out a .DEF file that
1797 corresponds to it. */
1798
1799 static void
1800 quoteput (char *s, FILE *f, int needs_quotes)
1801 {
1802 char *cp;
1803
1804 for (cp = s; *cp; cp++)
1805 if (*cp == '\''
1806 || *cp == '"'
1807 || *cp == '\\'
1808 || ISSPACE (*cp)
1809 || *cp == ','
1810 || *cp == ';')
1811 needs_quotes = 1;
1812
1813 if (needs_quotes)
1814 {
1815 putc ('"', f);
1816
1817 while (*s)
1818 {
1819 if (*s == '"' || *s == '\\')
1820 putc ('\\', f);
1821
1822 putc (*s, f);
1823 s++;
1824 }
1825
1826 putc ('"', f);
1827 }
1828 else
1829 fputs (s, f);
1830 }
1831
1832 void
1833 pe_dll_generate_def_file (const char *pe_out_def_filename)
1834 {
1835 int i;
1836 FILE *out = fopen (pe_out_def_filename, "w");
1837
1838 if (out == NULL)
1839 /* xgettext:c-format */
1840 einfo (_("%P: can't open output def file %s\n"),
1841 pe_out_def_filename);
1842
1843 if (pe_def_file)
1844 {
1845 if (pe_def_file->name)
1846 {
1847 if (pe_def_file->is_dll)
1848 fprintf (out, "LIBRARY ");
1849 else
1850 fprintf (out, "NAME ");
1851
1852 quoteput (pe_def_file->name, out, 1);
1853
1854 if (pe_data (link_info.output_bfd)->pe_opthdr.ImageBase)
1855 fprintf (out, " BASE=0x%" PRIx64,
1856 (uint64_t) pe_data (link_info.output_bfd)->pe_opthdr.ImageBase);
1857 fprintf (out, "\n");
1858 }
1859
1860 if (pe_def_file->description)
1861 {
1862 fprintf (out, "DESCRIPTION ");
1863 quoteput (pe_def_file->description, out, 1);
1864 fprintf (out, "\n");
1865 }
1866
1867 if (pe_def_file->version_minor != -1)
1868 fprintf (out, "VERSION %d.%d\n", pe_def_file->version_major,
1869 pe_def_file->version_minor);
1870 else if (pe_def_file->version_major != -1)
1871 fprintf (out, "VERSION %d\n", pe_def_file->version_major);
1872
1873 if (pe_def_file->stack_reserve != -1 || pe_def_file->heap_reserve != -1)
1874 fprintf (out, "\n");
1875
1876 if (pe_def_file->stack_commit != -1)
1877 fprintf (out, "STACKSIZE 0x%x,0x%x\n",
1878 pe_def_file->stack_reserve, pe_def_file->stack_commit);
1879 else if (pe_def_file->stack_reserve != -1)
1880 fprintf (out, "STACKSIZE 0x%x\n", pe_def_file->stack_reserve);
1881
1882 if (pe_def_file->heap_commit != -1)
1883 fprintf (out, "HEAPSIZE 0x%x,0x%x\n",
1884 pe_def_file->heap_reserve, pe_def_file->heap_commit);
1885 else if (pe_def_file->heap_reserve != -1)
1886 fprintf (out, "HEAPSIZE 0x%x\n", pe_def_file->heap_reserve);
1887
1888 if (pe_def_file->num_section_defs > 0)
1889 {
1890 fprintf (out, "\nSECTIONS\n\n");
1891
1892 for (i = 0; i < pe_def_file->num_section_defs; i++)
1893 {
1894 fprintf (out, " ");
1895 quoteput (pe_def_file->section_defs[i].name, out, 0);
1896
1897 if (pe_def_file->section_defs[i].class)
1898 {
1899 fprintf (out, " CLASS ");
1900 quoteput (pe_def_file->section_defs[i].class, out, 0);
1901 }
1902
1903 if (pe_def_file->section_defs[i].flag_read)
1904 fprintf (out, " READ");
1905
1906 if (pe_def_file->section_defs[i].flag_write)
1907 fprintf (out, " WRITE");
1908
1909 if (pe_def_file->section_defs[i].flag_execute)
1910 fprintf (out, " EXECUTE");
1911
1912 if (pe_def_file->section_defs[i].flag_shared)
1913 fprintf (out, " SHARED");
1914
1915 fprintf (out, "\n");
1916 }
1917 }
1918
1919 if (pe_def_file->num_exports > 0)
1920 {
1921 fprintf (out, "EXPORTS\n");
1922
1923 for (i = 0; i < pe_def_file->num_exports; i++)
1924 {
1925 def_file_export *e = pe_def_file->exports + i;
1926 fprintf (out, " ");
1927 quoteput (e->name, out, 0);
1928
1929 if (e->internal_name && strcmp (e->internal_name, e->name))
1930 {
1931 fprintf (out, " = ");
1932 quoteput (e->internal_name, out, 0);
1933 }
1934
1935 if (e->ordinal != -1)
1936 fprintf (out, " @%d", e->ordinal);
1937
1938 if (e->flag_private)
1939 fprintf (out, " PRIVATE");
1940
1941 if (e->flag_constant)
1942 fprintf (out, " CONSTANT");
1943
1944 if (e->flag_noname)
1945 fprintf (out, " NONAME");
1946
1947 if (e->flag_data)
1948 fprintf (out, " DATA");
1949
1950 fprintf (out, "\n");
1951 }
1952 }
1953
1954 if (pe_def_file->num_imports > 0)
1955 {
1956 fprintf (out, "\nIMPORTS\n\n");
1957
1958 for (i = 0; i < pe_def_file->num_imports; i++)
1959 {
1960 def_file_import *im = pe_def_file->imports + i;
1961 fprintf (out, " ");
1962
1963 if (im->internal_name
1964 && (!im->name || strcmp (im->internal_name, im->name)))
1965 {
1966 quoteput (im->internal_name, out, 0);
1967 fprintf (out, " = ");
1968 }
1969
1970 quoteput (im->module->name, out, 0);
1971 fprintf (out, ".");
1972
1973 if (im->name)
1974 quoteput (im->name, out, 0);
1975 else
1976 fprintf (out, "%d", im->ordinal);
1977
1978 if (im->its_name)
1979 {
1980 fprintf (out, " == ");
1981 quoteput (im->its_name, out, 0);
1982 }
1983
1984 fprintf (out, "\n");
1985 }
1986 }
1987 }
1988 else
1989 fprintf (out, _("; no contents available\n"));
1990
1991 if (fclose (out) == EOF)
1992 /* xgettext:c-format */
1993 einfo (_("%P: error closing file `%s'\n"), pe_out_def_filename);
1994 }
1995
1996 /* Generate the import library. */
1997
1998 static asymbol **symtab;
1999 static int symptr;
2000 static int tmp_seq;
2001 static char *dll_symname;
2002
2003 #define UNDSEC bfd_und_section_ptr
2004
2005 static asection *
2006 quick_section (bfd *abfd, const char *name, int flags, int align)
2007 {
2008 asection *sec;
2009 asymbol *sym;
2010
2011 sec = bfd_make_section_old_way (abfd, name);
2012 bfd_set_section_flags (sec, flags | SEC_ALLOC | SEC_LOAD | SEC_KEEP);
2013 bfd_set_section_alignment (sec, align);
2014 /* Remember to undo this before trying to link internally! */
2015 sec->output_section = sec;
2016
2017 sym = bfd_make_empty_symbol (abfd);
2018 symtab[symptr++] = sym;
2019 sym->name = sec->name;
2020 sym->section = sec;
2021 sym->flags = BSF_LOCAL;
2022 sym->value = 0;
2023
2024 return sec;
2025 }
2026
2027 static void
2028 quick_symbol (bfd *abfd,
2029 const char *n1,
2030 const char *n2,
2031 const char *n3,
2032 asection *sec,
2033 int flags,
2034 int addr)
2035 {
2036 asymbol *sym;
2037 char *name = xmalloc (strlen (n1) + strlen (n2) + strlen (n3) + 1);
2038
2039 strcpy (name, n1);
2040 strcat (name, n2);
2041 strcat (name, n3);
2042 sym = bfd_make_empty_symbol (abfd);
2043 sym->name = name;
2044 sym->section = sec;
2045 sym->flags = flags;
2046 sym->value = addr;
2047 symtab[symptr++] = sym;
2048 }
2049
2050 static arelent *reltab = 0;
2051 static int relcount = 0, relsize = 0;
2052
2053 static void
2054 quick_reloc (bfd *abfd, bfd_size_type address, int which_howto, int symidx)
2055 {
2056 if (relcount >= relsize - 1)
2057 {
2058 relsize += 10;
2059 if (reltab)
2060 reltab = xrealloc (reltab, relsize * sizeof (arelent));
2061 else
2062 reltab = xmalloc (relsize * sizeof (arelent));
2063 }
2064 reltab[relcount].address = address;
2065 reltab[relcount].addend = 0;
2066 reltab[relcount].howto = bfd_reloc_type_lookup (abfd, which_howto);
2067 reltab[relcount].sym_ptr_ptr = symtab + symidx;
2068 relcount++;
2069 }
2070
2071 static void
2072 save_relocs (asection *sec)
2073 {
2074 int i;
2075
2076 sec->relocation = reltab;
2077 sec->reloc_count = relcount;
2078 sec->orelocation = xmalloc ((relcount + 1) * sizeof (arelent *));
2079 for (i = 0; i < relcount; i++)
2080 sec->orelocation[i] = sec->relocation + i;
2081 sec->orelocation[relcount] = 0;
2082 sec->flags |= SEC_RELOC;
2083 reltab = 0;
2084 relcount = relsize = 0;
2085 }
2086
2087 /* .section .idata$2
2088 .global __head_my_dll
2089 __head_my_dll:
2090 .rva hname
2091 .long 0
2092 .long 0
2093 .rva __my_dll_iname
2094 .rva fthunk
2095
2096 .section .idata$5
2097 .long 0
2098 fthunk:
2099
2100 .section .idata$4
2101 .long 0
2102 hname: */
2103
2104 static bfd *
2105 make_head (bfd *parent)
2106 {
2107 asection *id2, *id5, *id4;
2108 unsigned char *d2, *d5, *d4;
2109 char *oname;
2110 bfd *abfd;
2111
2112 if (asprintf (&oname, "%s_d%06d.o", dll_symname, tmp_seq) < 4)
2113 /* In theory we should return NULL here at let our caller decide what to
2114 do. But currently the return value is not checked, just used, and
2115 besides, this condition only happens when the system has run out of
2116 memory. So just give up. */
2117 exit (EXIT_FAILURE);
2118 tmp_seq++;
2119
2120 abfd = bfd_create (oname, parent);
2121 free (oname);
2122 bfd_find_target (pe_details->object_target, abfd);
2123 bfd_make_writable (abfd);
2124
2125 bfd_set_format (abfd, bfd_object);
2126 bfd_set_arch_mach (abfd, pe_details->bfd_arch, 0);
2127
2128 symptr = 0;
2129 symtab = xmalloc (6 * sizeof (asymbol *));
2130 id2 = quick_section (abfd, ".idata$2", SEC_HAS_CONTENTS, 2);
2131 id5 = quick_section (abfd, ".idata$5", SEC_HAS_CONTENTS, 2);
2132 id4 = quick_section (abfd, ".idata$4", SEC_HAS_CONTENTS, 2);
2133 quick_symbol (abfd, U ("_head_"), dll_symname, "", id2, BSF_GLOBAL, 0);
2134 quick_symbol (abfd, U (""), dll_symname, "_iname", UNDSEC, BSF_GLOBAL, 0);
2135
2136 /* OK, pay attention here. I got confused myself looking back at
2137 it. We create a four-byte section to mark the beginning of the
2138 list, and we include an offset of 4 in the section, so that the
2139 pointer to the list points to the *end* of this section, which is
2140 the start of the list of sections from other objects. */
2141
2142 bfd_set_section_size (id2, 20);
2143 d2 = xmalloc (20);
2144 id2->contents = d2;
2145 memset (d2, 0, 20);
2146 if (pe_use_nul_prefixed_import_tables)
2147 d2[0] = d2[16] = PE_IDATA5_SIZE; /* Reloc addend. */
2148 quick_reloc (abfd, 0, BFD_RELOC_RVA, 2);
2149 quick_reloc (abfd, 12, BFD_RELOC_RVA, 4);
2150 quick_reloc (abfd, 16, BFD_RELOC_RVA, 1);
2151 save_relocs (id2);
2152
2153 if (pe_use_nul_prefixed_import_tables)
2154 bfd_set_section_size (id5, PE_IDATA5_SIZE);
2155 else
2156 bfd_set_section_size (id5, 0);
2157 d5 = xmalloc (PE_IDATA5_SIZE);
2158 id5->contents = d5;
2159 memset (d5, 0, PE_IDATA5_SIZE);
2160 if (pe_use_nul_prefixed_import_tables)
2161 bfd_set_section_size (id4, PE_IDATA4_SIZE);
2162 else
2163 bfd_set_section_size (id4, 0);
2164 d4 = xmalloc (PE_IDATA4_SIZE);
2165 id4->contents = d4;
2166 memset (d4, 0, PE_IDATA4_SIZE);
2167
2168 bfd_set_symtab (abfd, symtab, symptr);
2169
2170 bfd_set_section_contents (abfd, id2, d2, 0, 20);
2171 if (pe_use_nul_prefixed_import_tables)
2172 {
2173 bfd_set_section_contents (abfd, id5, d5, 0, PE_IDATA5_SIZE);
2174 bfd_set_section_contents (abfd, id4, d4, 0, PE_IDATA4_SIZE);
2175 }
2176 else
2177 {
2178 bfd_set_section_contents (abfd, id5, d5, 0, 0);
2179 bfd_set_section_contents (abfd, id4, d4, 0, 0);
2180 }
2181
2182 bfd_make_readable (abfd);
2183 return abfd;
2184 }
2185
2186 /* .section .idata$4
2187 .long 0
2188 [.long 0] for PE+
2189 .section .idata$5
2190 .long 0
2191 [.long 0] for PE+
2192 .section idata$7
2193 .global __my_dll_iname
2194 __my_dll_iname:
2195 .asciz "my.dll" */
2196
2197 static bfd *
2198 make_tail (bfd *parent)
2199 {
2200 asection *id4, *id5, *id7;
2201 unsigned char *d4, *d5, *d7;
2202 int len;
2203 char *oname;
2204 bfd *abfd;
2205
2206 if (asprintf (&oname, "%s_d%06d.o", dll_symname, tmp_seq) < 4)
2207 /* In theory we should return NULL here at let our caller decide what to
2208 do. But currently the return value is not checked, just used, and
2209 besides, this condition only happens when the system has run out of
2210 memory. So just give up. */
2211 exit (EXIT_FAILURE);
2212 tmp_seq++;
2213
2214 abfd = bfd_create (oname, parent);
2215 free (oname);
2216 bfd_find_target (pe_details->object_target, abfd);
2217 bfd_make_writable (abfd);
2218
2219 bfd_set_format (abfd, bfd_object);
2220 bfd_set_arch_mach (abfd, pe_details->bfd_arch, 0);
2221
2222 symptr = 0;
2223 symtab = xmalloc (5 * sizeof (asymbol *));
2224 id4 = quick_section (abfd, ".idata$4", SEC_HAS_CONTENTS, 2);
2225 id5 = quick_section (abfd, ".idata$5", SEC_HAS_CONTENTS, 2);
2226 id7 = quick_section (abfd, ".idata$7", SEC_HAS_CONTENTS, 2);
2227 quick_symbol (abfd, U (""), dll_symname, "_iname", id7, BSF_GLOBAL, 0);
2228
2229 bfd_set_section_size (id4, PE_IDATA4_SIZE);
2230 d4 = xmalloc (PE_IDATA4_SIZE);
2231 id4->contents = d4;
2232 memset (d4, 0, PE_IDATA4_SIZE);
2233
2234 bfd_set_section_size (id5, PE_IDATA5_SIZE);
2235 d5 = xmalloc (PE_IDATA5_SIZE);
2236 id5->contents = d5;
2237 memset (d5, 0, PE_IDATA5_SIZE);
2238
2239 len = strlen (dll_filename) + 1;
2240 if (len & 1)
2241 len++;
2242 bfd_set_section_size (id7, len);
2243 d7 = xmalloc (len);
2244 id7->contents = d7;
2245 strcpy ((char *) d7, dll_filename);
2246 /* If len was odd, the above
2247 strcpy leaves behind an undefined byte. That is harmless,
2248 but we set it to 0 just so the binary dumps are pretty. */
2249 d7[len - 1] = 0;
2250
2251 bfd_set_symtab (abfd, symtab, symptr);
2252
2253 bfd_set_section_contents (abfd, id4, d4, 0, PE_IDATA4_SIZE);
2254 bfd_set_section_contents (abfd, id5, d5, 0, PE_IDATA5_SIZE);
2255 bfd_set_section_contents (abfd, id7, d7, 0, len);
2256
2257 bfd_make_readable (abfd);
2258 return abfd;
2259 }
2260
2261 /* .text
2262 .global _function
2263 .global ___imp_function
2264 .global __imp__function
2265 _function:
2266 jmp *__imp__function:
2267
2268 .section idata$7
2269 .long __head_my_dll
2270
2271 .section .idata$5
2272 ___imp_function:
2273 __imp__function:
2274 iat?
2275 .section .idata$4
2276 iat?
2277 .section .idata$6
2278 ID<ordinal>:
2279 .short <hint>
2280 .asciz "function" xlate? (add underscore, kill at) */
2281
2282 static const unsigned char jmp_ix86_bytes[] =
2283 {
2284 0xff, 0x25, 0x00, 0x00, 0x00, 0x00, 0x90, 0x90
2285 };
2286
2287 static const unsigned char jmp_aarch64_bytes[] =
2288 {
2289 0x10, 0x00, 0x00, 0x90, /* adrp x16, 0 */
2290 0x10, 0x02, 0x00, 0x91, /* add x16, x16, #0x0 */
2291 0x10, 0x02, 0x40, 0xf9, /* ldr x16, [x16] */
2292 0x00, 0x02, 0x1f, 0xd6 /* br x16 */
2293 };
2294
2295 /* _function:
2296 mov.l ip+8,r0
2297 mov.l @r0,r0
2298 jmp @r0
2299 nop
2300 .dw __imp_function */
2301
2302 static const unsigned char jmp_sh_bytes[] =
2303 {
2304 0x01, 0xd0, 0x02, 0x60, 0x2b, 0x40, 0x09, 0x00, 0x00, 0x00, 0x00, 0x00
2305 };
2306
2307 /* _function:
2308 lui $t0,<high:__imp_function>
2309 lw $t0,<low:__imp_function>
2310 jr $t0
2311 nop */
2312
2313 static const unsigned char jmp_mips_bytes[] =
2314 {
2315 0x00, 0x00, 0x08, 0x3c, 0x00, 0x00, 0x08, 0x8d,
2316 0x08, 0x00, 0x00, 0x01, 0x00, 0x00, 0x00, 0x00
2317 };
2318
2319 static const unsigned char jmp_arm_bytes[] =
2320 {
2321 0x00, 0xc0, 0x9f, 0xe5, /* ldr ip, [pc] */
2322 0x00, 0xf0, 0x9c, 0xe5, /* ldr pc, [ip] */
2323 0, 0, 0, 0
2324 };
2325
2326
2327 static bfd *
2328 make_one (def_file_export *exp, bfd *parent, bool include_jmp_stub)
2329 {
2330 asection *tx, *id7, *id5, *id4, *id6;
2331 unsigned char *td = NULL, *d7, *d5, *d4, *d6 = NULL;
2332 int len;
2333 char *oname;
2334 bfd *abfd;
2335 const unsigned char *jmp_bytes = NULL;
2336 int jmp_byte_count = 0;
2337 const char *internal_name = exp->internal_name;
2338
2339 if (!exp->flag_noname)
2340 {
2341 /* Check for a decorated symbol name */
2342 struct decoration_hash_entry *entry;
2343
2344 entry = (struct decoration_hash_entry *)
2345 bfd_hash_lookup (&(coff_hash_table (&link_info)->decoration_hash),
2346 internal_name, false, false);
2347 if (entry)
2348 {
2349 if (entry->decorated_link)
2350 {
2351 internal_name = entry->decorated_link->root.string;
2352
2353 if (pe_details->underscored && internal_name[0] == '_')
2354 internal_name++;
2355 }
2356 else
2357 {
2358 einfo (_("%P: error: NULL decorated name for %s\n"), internal_name);
2359 }
2360 }
2361 }
2362
2363 /* Include the jump stub section only if it is needed. A jump
2364 stub is needed if the symbol being imported <sym> is a function
2365 symbol and there is at least one undefined reference to that
2366 symbol. In other words, if all the import references to <sym> are
2367 explicitly through _declspec(dllimport) then the jump stub is not
2368 needed. */
2369 if (include_jmp_stub)
2370 {
2371 switch (pe_details->pe_arch)
2372 {
2373 case PE_ARCH_i386:
2374 jmp_bytes = jmp_ix86_bytes;
2375 jmp_byte_count = sizeof (jmp_ix86_bytes);
2376 break;
2377 case PE_ARCH_sh:
2378 jmp_bytes = jmp_sh_bytes;
2379 jmp_byte_count = sizeof (jmp_sh_bytes);
2380 break;
2381 case PE_ARCH_mips:
2382 jmp_bytes = jmp_mips_bytes;
2383 jmp_byte_count = sizeof (jmp_mips_bytes);
2384 break;
2385 case PE_ARCH_arm:
2386 case PE_ARCH_arm_wince:
2387 jmp_bytes = jmp_arm_bytes;
2388 jmp_byte_count = sizeof (jmp_arm_bytes);
2389 break;
2390 case PE_ARCH_aarch64:
2391 jmp_bytes = jmp_aarch64_bytes;
2392 jmp_byte_count = sizeof (jmp_aarch64_bytes);
2393 break;
2394 default:
2395 abort ();
2396 }
2397 }
2398
2399 if (asprintf (&oname, "%s_d%06d.o", dll_symname, tmp_seq) < 4)
2400 /* In theory we should return NULL here at let our caller decide what to
2401 do. But currently the return value is not checked, just used, and
2402 besides, this condition only happens when the system has run out of
2403 memory. So just give up. */
2404 exit (EXIT_FAILURE);
2405 tmp_seq++;
2406
2407 abfd = bfd_create (oname, parent);
2408 free (oname);
2409 bfd_find_target (pe_details->object_target, abfd);
2410 bfd_make_writable (abfd);
2411
2412 bfd_set_format (abfd, bfd_object);
2413 bfd_set_arch_mach (abfd, pe_details->bfd_arch, 0);
2414
2415 symptr = 0;
2416 symtab = xmalloc (12 * sizeof (asymbol *));
2417
2418 tx = quick_section (abfd, ".text", SEC_CODE | SEC_HAS_CONTENTS | SEC_READONLY, 2);
2419 id7 = quick_section (abfd, ".idata$7", SEC_HAS_CONTENTS, 2);
2420 id5 = quick_section (abfd, ".idata$5", SEC_HAS_CONTENTS, 2);
2421 id4 = quick_section (abfd, ".idata$4", SEC_HAS_CONTENTS, 2);
2422 id6 = quick_section (abfd, ".idata$6", SEC_HAS_CONTENTS, 2);
2423
2424 if (*internal_name == '@')
2425 {
2426 quick_symbol (abfd, U ("_head_"), dll_symname, "", UNDSEC,
2427 BSF_GLOBAL, 0);
2428 if (include_jmp_stub)
2429 quick_symbol (abfd, "", internal_name, "", tx, BSF_GLOBAL, 0);
2430 quick_symbol (abfd, "__imp_", internal_name, "", id5,
2431 BSF_GLOBAL, 0);
2432 /* Fastcall applies only to functions,
2433 so no need for auto-import symbol. */
2434 }
2435 else
2436 {
2437 quick_symbol (abfd, U ("_head_"), dll_symname, "", UNDSEC,
2438 BSF_GLOBAL, 0);
2439 if (include_jmp_stub)
2440 quick_symbol (abfd, U (""), internal_name, "", tx,
2441 BSF_GLOBAL, 0);
2442 quick_symbol (abfd, "__imp_", U (""), internal_name, id5,
2443 BSF_GLOBAL, 0);
2444 /* Symbol to reference ord/name of imported
2445 data symbol, used to implement auto-import. */
2446 if (exp->flag_data)
2447 quick_symbol (abfd, "__nm_", U (""), internal_name, id6,
2448 BSF_GLOBAL,0);
2449 }
2450 if (pe_dll_compat_implib)
2451 quick_symbol (abfd, "___imp_", internal_name, "", id5,
2452 BSF_GLOBAL, 0);
2453
2454 if (include_jmp_stub)
2455 {
2456 bfd_set_section_size (tx, jmp_byte_count);
2457 td = xmalloc (jmp_byte_count);
2458 tx->contents = td;
2459 memcpy (td, jmp_bytes, jmp_byte_count);
2460
2461 switch (pe_details->pe_arch)
2462 {
2463 case PE_ARCH_i386:
2464 #ifdef pe_use_plus
2465 quick_reloc (abfd, 2, BFD_RELOC_32_PCREL, 2);
2466 #else
2467 /* Mark this object as SAFESEH compatible. */
2468 quick_symbol (abfd, "", "@feat.00", "", bfd_abs_section_ptr,
2469 BSF_LOCAL, 1);
2470 quick_reloc (abfd, 2, BFD_RELOC_32, 2);
2471 #endif
2472 break;
2473 case PE_ARCH_sh:
2474 quick_reloc (abfd, 8, BFD_RELOC_32, 2);
2475 break;
2476 case PE_ARCH_mips:
2477 quick_reloc (abfd, 0, BFD_RELOC_HI16_S, 2);
2478 quick_reloc (abfd, 0, BFD_RELOC_LO16, 0); /* MIPS_R_PAIR */
2479 quick_reloc (abfd, 4, BFD_RELOC_LO16, 2);
2480 break;
2481 case PE_ARCH_arm:
2482 case PE_ARCH_arm_wince:
2483 quick_reloc (abfd, 8, BFD_RELOC_32, 2);
2484 break;
2485 case PE_ARCH_aarch64:
2486 quick_reloc (abfd, 0, BFD_RELOC_AARCH64_ADR_HI21_NC_PCREL, 2);
2487 quick_reloc (abfd, 4, BFD_RELOC_AARCH64_ADD_LO12, 2);
2488 break;
2489 default:
2490 abort ();
2491 }
2492 save_relocs (tx);
2493 }
2494 else
2495 bfd_set_section_size (tx, 0);
2496
2497 bfd_set_section_size (id7, 4);
2498 d7 = xmalloc (4);
2499 id7->contents = d7;
2500 memset (d7, 0, 4);
2501 quick_reloc (abfd, 0, BFD_RELOC_RVA, 5);
2502 save_relocs (id7);
2503
2504 bfd_set_section_size (id5, PE_IDATA5_SIZE);
2505 d5 = xmalloc (PE_IDATA5_SIZE);
2506 id5->contents = d5;
2507 memset (d5, 0, PE_IDATA5_SIZE);
2508
2509 if (exp->flag_noname)
2510 {
2511 d5[0] = exp->ordinal;
2512 d5[1] = exp->ordinal >> 8;
2513 d5[PE_IDATA5_SIZE - 1] = 0x80;
2514 }
2515 else
2516 {
2517 quick_reloc (abfd, 0, BFD_RELOC_RVA, 4);
2518 save_relocs (id5);
2519 }
2520
2521 bfd_set_section_size (id4, PE_IDATA4_SIZE);
2522 d4 = xmalloc (PE_IDATA4_SIZE);
2523 id4->contents = d4;
2524 memset (d4, 0, PE_IDATA4_SIZE);
2525
2526 if (exp->flag_noname)
2527 {
2528 d4[0] = exp->ordinal;
2529 d4[1] = exp->ordinal >> 8;
2530 d4[PE_IDATA4_SIZE - 1] = 0x80;
2531 }
2532 else
2533 {
2534 quick_reloc (abfd, 0, BFD_RELOC_RVA, 4);
2535 save_relocs (id4);
2536 }
2537
2538 if (exp->flag_noname)
2539 {
2540 len = 0;
2541 bfd_set_section_size (id6, 0);
2542 }
2543 else
2544 {
2545 int ord;
2546
2547 /* { short, asciz } */
2548 if (exp->its_name)
2549 len = 2 + strlen (exp->its_name) + 1;
2550 else
2551 len = 2 + strlen (exp->name) + 1;
2552 if (len & 1)
2553 len++;
2554 bfd_set_section_size (id6, len);
2555 d6 = xmalloc (len);
2556 id6->contents = d6;
2557 memset (d6, 0, len);
2558
2559 /* PR 20880: Use exp->hint as a backup, just in case exp->ordinal
2560 contains an invalid value (-1). */
2561 ord = (exp->ordinal >= 0) ? exp->ordinal : exp->hint;
2562 d6[0] = ord;
2563 d6[1] = ord >> 8;
2564
2565 if (exp->its_name)
2566 strcpy ((char*) d6 + 2, exp->its_name);
2567 else
2568 strcpy ((char *) d6 + 2, exp->name);
2569 }
2570
2571 bfd_set_symtab (abfd, symtab, symptr);
2572
2573 if (include_jmp_stub)
2574 bfd_set_section_contents (abfd, tx, td, 0, jmp_byte_count);
2575 bfd_set_section_contents (abfd, id7, d7, 0, 4);
2576 bfd_set_section_contents (abfd, id5, d5, 0, PE_IDATA5_SIZE);
2577 bfd_set_section_contents (abfd, id4, d4, 0, PE_IDATA4_SIZE);
2578 if (!exp->flag_noname)
2579 bfd_set_section_contents (abfd, id6, d6, 0, len);
2580
2581 bfd_make_readable (abfd);
2582 return abfd;
2583 }
2584
2585 static bfd *
2586 make_singleton_name_thunk (const char *import, bfd *parent)
2587 {
2588 /* Name thunks go to idata$4. */
2589 asection *id4;
2590 unsigned char *d4;
2591 char *oname;
2592 bfd *abfd;
2593
2594 if (asprintf (&oname, "%s_nmth%06d.o", dll_symname, tmp_seq) < 4)
2595 /* In theory we should return NULL here at let our caller decide what to
2596 do. But currently the return value is not checked, just used, and
2597 besides, this condition only happens when the system has run out of
2598 memory. So just give up. */
2599 exit (EXIT_FAILURE);
2600 tmp_seq++;
2601
2602 abfd = bfd_create (oname, parent);
2603 free (oname);
2604 bfd_find_target (pe_details->object_target, abfd);
2605 bfd_make_writable (abfd);
2606
2607 bfd_set_format (abfd, bfd_object);
2608 bfd_set_arch_mach (abfd, pe_details->bfd_arch, 0);
2609
2610 symptr = 0;
2611 symtab = xmalloc (3 * sizeof (asymbol *));
2612 id4 = quick_section (abfd, ".idata$4", SEC_HAS_CONTENTS, 2);
2613 quick_symbol (abfd, "__nm_thnk_", import, "", id4, BSF_GLOBAL, 0);
2614 quick_symbol (abfd, "__nm_", import, "", UNDSEC, BSF_GLOBAL, 0);
2615
2616 /* We need space for the real thunk and for the null terminator. */
2617 bfd_set_section_size (id4, PE_IDATA4_SIZE * 2);
2618 d4 = xmalloc (PE_IDATA4_SIZE * 2);
2619 id4->contents = d4;
2620 memset (d4, 0, PE_IDATA4_SIZE * 2);
2621 quick_reloc (abfd, 0, BFD_RELOC_RVA, 2);
2622 save_relocs (id4);
2623
2624 bfd_set_symtab (abfd, symtab, symptr);
2625
2626 bfd_set_section_contents (abfd, id4, d4, 0, PE_IDATA4_SIZE * 2);
2627
2628 bfd_make_readable (abfd);
2629 return abfd;
2630 }
2631
2632 static const char *
2633 make_import_fixup_mark (arelent *rel, char *name)
2634 {
2635 /* We convert reloc to symbol, for later reference. */
2636 static unsigned int counter;
2637 struct bfd_symbol *sym = *rel->sym_ptr_ptr;
2638 bfd *abfd = bfd_asymbol_bfd (sym);
2639 struct bfd_link_hash_entry *bh;
2640 char *fixup_name, buf[256];
2641 size_t prefix_len;
2642
2643 /* "name" buffer has space before the symbol name for prefixes. */
2644 sprintf (buf, "__fu%d_", counter++);
2645 prefix_len = strlen (buf);
2646 fixup_name = name - prefix_len;
2647 memcpy (fixup_name, buf, prefix_len);
2648
2649 bh = NULL;
2650 bfd_coff_link_add_one_symbol (&link_info, abfd, fixup_name, BSF_GLOBAL,
2651 current_sec, /* sym->section, */
2652 rel->address, NULL, true, false, &bh);
2653
2654 return bh->root.string;
2655 }
2656
2657 /* .section .idata$2
2658 .rva __nm_thnk_SYM (singleton thunk with name of func)
2659 .long 0
2660 .long 0
2661 .rva __my_dll_iname (name of dll)
2662 .rva __fuNN_SYM (pointer to reference (address) in text) */
2663
2664 static bfd *
2665 make_import_fixup_entry (const char *name,
2666 const char *fixup_name,
2667 const char *symname,
2668 bfd *parent)
2669 {
2670 asection *id2;
2671 unsigned char *d2;
2672 char *oname;
2673 bfd *abfd;
2674
2675 if (asprintf (&oname, "%s_fu%06d.o", dll_symname, tmp_seq) < 4)
2676 /* In theory we should return NULL here at let our caller decide what to
2677 do. But currently the return value is not checked, just used, and
2678 besides, this condition only happens when the system has run out of
2679 memory. So just give up. */
2680 exit (EXIT_FAILURE);
2681 tmp_seq++;
2682
2683 abfd = bfd_create (oname, parent);
2684 free (oname);
2685 bfd_find_target (pe_details->object_target, abfd);
2686 bfd_make_writable (abfd);
2687
2688 bfd_set_format (abfd, bfd_object);
2689 bfd_set_arch_mach (abfd, pe_details->bfd_arch, 0);
2690
2691 symptr = 0;
2692 symtab = xmalloc (6 * sizeof (asymbol *));
2693 id2 = quick_section (abfd, ".idata$2", SEC_HAS_CONTENTS, 2);
2694
2695 quick_symbol (abfd, "__nm_thnk_", name, "", UNDSEC, BSF_GLOBAL, 0);
2696 quick_symbol (abfd, U (""), symname, "_iname", UNDSEC, BSF_GLOBAL, 0);
2697 quick_symbol (abfd, "", fixup_name, "", UNDSEC, BSF_GLOBAL, 0);
2698
2699 bfd_set_section_size (id2, 20);
2700 d2 = xmalloc (20);
2701 id2->contents = d2;
2702 memset (d2, 0, 20);
2703
2704 quick_reloc (abfd, 0, BFD_RELOC_RVA, 1);
2705 quick_reloc (abfd, 12, BFD_RELOC_RVA, 2);
2706 quick_reloc (abfd, 16, BFD_RELOC_RVA, 3);
2707 save_relocs (id2);
2708
2709 bfd_set_symtab (abfd, symtab, symptr);
2710
2711 bfd_set_section_contents (abfd, id2, d2, 0, 20);
2712
2713 bfd_make_readable (abfd);
2714 return abfd;
2715 }
2716
2717 /* .section .rdata_runtime_pseudo_reloc
2718 .long addend
2719 .rva __fuNN_SYM (pointer to reference (address) in text) */
2720
2721 static bfd *
2722 make_runtime_pseudo_reloc (const char *name ATTRIBUTE_UNUSED,
2723 const char *fixup_name,
2724 bfd_vma addend ATTRIBUTE_UNUSED,
2725 bfd_vma bitsize,
2726 bfd *parent)
2727 {
2728 asection *rt_rel;
2729 unsigned char *rt_rel_d;
2730 char *oname;
2731 bfd *abfd;
2732 bfd_size_type size;
2733
2734 if (asprintf (&oname, "%s_rtr%06d.o", dll_symname, tmp_seq) < 4)
2735 /* In theory we should return NULL here at let our caller decide what to
2736 do. But currently the return value is not checked, just used, and
2737 besides, this condition only happens when the system has run out of
2738 memory. So just give up. */
2739 exit (EXIT_FAILURE);
2740 tmp_seq++;
2741
2742 abfd = bfd_create (oname, parent);
2743 free (oname);
2744 bfd_find_target (pe_details->object_target, abfd);
2745 bfd_make_writable (abfd);
2746
2747 bfd_set_format (abfd, bfd_object);
2748 bfd_set_arch_mach (abfd, pe_details->bfd_arch, 0);
2749
2750 if (link_info.pei386_runtime_pseudo_reloc == 2)
2751 {
2752 if (runtime_pseudp_reloc_v2_init)
2753 size = 3 * sizeof (asymbol *);
2754 else
2755 size = 6 * sizeof (asymbol *);
2756 }
2757 else
2758 size = 2 * sizeof (asymbol *);
2759
2760 symptr = 0;
2761 symtab = xmalloc (size);
2762
2763 rt_rel
2764 = quick_section (abfd, ".rdata_runtime_pseudo_reloc", SEC_HAS_CONTENTS, 2);
2765 bfd_coff_set_long_section_names (abfd, true);
2766
2767 quick_symbol (abfd, "", fixup_name, "", UNDSEC, BSF_GLOBAL, 0);
2768
2769 if (link_info.pei386_runtime_pseudo_reloc == 2)
2770 {
2771 size = 12;
2772 if (!runtime_pseudp_reloc_v2_init)
2773 {
2774 size += 12;
2775 runtime_pseudp_reloc_v2_init = true;
2776 }
2777
2778 quick_symbol (abfd, "__imp_", name, "", UNDSEC, BSF_GLOBAL, 0);
2779
2780 bfd_set_section_size (rt_rel, size);
2781 rt_rel_d = xmalloc (size);
2782 rt_rel->contents = rt_rel_d;
2783 memset (rt_rel_d, 0, size);
2784 quick_reloc (abfd, size - 8, BFD_RELOC_RVA, 1);
2785 quick_reloc (abfd, size - 12, BFD_RELOC_RVA, 2);
2786 bfd_put_32 (abfd, bitsize, rt_rel_d + (size - 4));
2787 if (size != 12)
2788 bfd_put_32 (abfd, 1, rt_rel_d + 8);
2789 save_relocs (rt_rel);
2790
2791 bfd_set_symtab (abfd, symtab, symptr);
2792
2793 bfd_set_section_contents (abfd, rt_rel, rt_rel_d, 0, size);
2794 }
2795 else
2796 {
2797 bfd_set_section_size (rt_rel, 8);
2798 rt_rel_d = xmalloc (8);
2799 rt_rel->contents = rt_rel_d;
2800 memset (rt_rel_d, 0, 8);
2801
2802 bfd_put_32 (abfd, addend, rt_rel_d);
2803 quick_reloc (abfd, 4, BFD_RELOC_RVA, 1);
2804
2805 save_relocs (rt_rel);
2806
2807 bfd_set_symtab (abfd, symtab, symptr);
2808
2809 bfd_set_section_contents (abfd, rt_rel, rt_rel_d, 0, 8);
2810 }
2811
2812 bfd_make_readable (abfd);
2813 return abfd;
2814 }
2815
2816 /* .section .rdata
2817 .rva __pei386_runtime_relocator */
2818
2819 static bfd *
2820 pe_create_runtime_relocator_reference (bfd *parent)
2821 {
2822 asection *extern_rt_rel;
2823 unsigned char *extern_rt_rel_d;
2824 char *oname;
2825 bfd *abfd;
2826
2827 if (asprintf (&oname, "%s_ertr%06d.o", dll_symname, tmp_seq) < 4)
2828 /* In theory we should return NULL here at let our caller decide what to
2829 do. But currently the return value is not checked, just used, and
2830 besides, this condition only happens when the system has run out of
2831 memory. So just give up. */
2832 exit (EXIT_FAILURE);
2833 tmp_seq++;
2834
2835 abfd = bfd_create (oname, parent);
2836 free (oname);
2837 bfd_find_target (pe_details->object_target, abfd);
2838 bfd_make_writable (abfd);
2839
2840 bfd_set_format (abfd, bfd_object);
2841 bfd_set_arch_mach (abfd, pe_details->bfd_arch, 0);
2842
2843 symptr = 0;
2844 symtab = xmalloc (2 * sizeof (asymbol *));
2845 extern_rt_rel = quick_section (abfd, ".rdata", SEC_HAS_CONTENTS, 2);
2846
2847 quick_symbol (abfd, "", U ("_pei386_runtime_relocator"), "", UNDSEC,
2848 BSF_NO_FLAGS, 0);
2849
2850 bfd_set_section_size (extern_rt_rel, PE_IDATA5_SIZE);
2851 extern_rt_rel_d = xcalloc (1, PE_IDATA5_SIZE);
2852 extern_rt_rel->contents = extern_rt_rel_d;
2853
2854 quick_reloc (abfd, 0, BFD_RELOC_RVA, 1);
2855 save_relocs (extern_rt_rel);
2856
2857 bfd_set_symtab (abfd, symtab, symptr);
2858
2859 bfd_set_section_contents (abfd, extern_rt_rel, extern_rt_rel_d, 0, PE_IDATA5_SIZE);
2860
2861 bfd_make_readable (abfd);
2862 return abfd;
2863 }
2864
2865 void
2866 pe_create_import_fixup (arelent *rel, asection *s, bfd_vma addend, char *name,
2867 const char *symname)
2868 {
2869 const char *fixup_name = make_import_fixup_mark (rel, name);
2870 bfd *b;
2871
2872 /* This is the original implementation of the auto-import feature, which
2873 primarily relied on the OS loader to patch things up with some help
2874 from the pseudo-relocator to overcome the main limitation. See the
2875 comment at the beginning of the file for an overview of the feature. */
2876 if (link_info.pei386_runtime_pseudo_reloc != 2)
2877 {
2878 struct bfd_link_hash_entry *name_thunk_sym;
2879 /* name buffer is allocated with space at beginning for prefixes. */
2880 char *thname = name - (sizeof "__nm_thnk_" - 1);
2881 memcpy (thname, "__nm_thnk_", sizeof "__nm_thnk_" - 1);
2882 name_thunk_sym = bfd_link_hash_lookup (link_info.hash, thname, 0, 0, 1);
2883
2884 if (!(name_thunk_sym && name_thunk_sym->type == bfd_link_hash_defined))
2885 {
2886 b = make_singleton_name_thunk (name, link_info.output_bfd);
2887 add_bfd_to_link (b, bfd_get_filename (b), &link_info);
2888
2889 /* If we ever use autoimport, we have to cast text section writable. */
2890 config.text_read_only = false;
2891 link_info.output_bfd->flags &= ~WP_TEXT;
2892 }
2893
2894 if (addend == 0 || link_info.pei386_runtime_pseudo_reloc == 1)
2895 {
2896 b = make_import_fixup_entry (name, fixup_name, symname,
2897 link_info.output_bfd);
2898 add_bfd_to_link (b, bfd_get_filename (b), &link_info);
2899 }
2900 }
2901
2902 /* In the original implementation, the pseudo-relocator was only used when
2903 the addend was not null. In the new implementation, the OS loader is
2904 completely bypassed and the pseudo-relocator does the entire work. */
2905 if ((addend != 0 && link_info.pei386_runtime_pseudo_reloc == 1)
2906 || link_info.pei386_runtime_pseudo_reloc == 2)
2907 {
2908 if (pe_dll_extra_pe_debug)
2909 printf ("creating runtime pseudo-reloc entry for %s (addend=%d)\n",
2910 fixup_name, (int) addend);
2911
2912 b = make_runtime_pseudo_reloc (name, fixup_name, addend,
2913 rel->howto->bitsize,
2914 link_info.output_bfd);
2915 add_bfd_to_link (b, bfd_get_filename (b), &link_info);
2916
2917 if (runtime_pseudo_relocs_created++ == 0)
2918 {
2919 b = pe_create_runtime_relocator_reference (link_info.output_bfd);
2920 add_bfd_to_link (b, bfd_get_filename (b), &link_info);
2921 }
2922 }
2923
2924 else if (addend != 0)
2925 einfo (_("%X%P: %H: variable '%pT' can't be auto-imported; please read the documentation for ld's --enable-auto-import for details\n"),
2926 s->owner, s, rel->address, (*rel->sym_ptr_ptr)->name);
2927 }
2928
2929 void
2930 pe_dll_generate_implib (def_file *def, const char *impfilename, struct bfd_link_info *info)
2931 {
2932 int i;
2933 bfd *ar_head;
2934 bfd *ar_tail;
2935 bfd *outarch;
2936 bfd *ibfd;
2937 bfd *head = 0;
2938
2939 unlink_if_ordinary (impfilename);
2940
2941 outarch = bfd_openw (impfilename, 0);
2942
2943 if (!outarch)
2944 {
2945 /* xgettext:c-format */
2946 einfo (_("%X%P: can't open .lib file: %s\n"), impfilename);
2947 return;
2948 }
2949
2950 if (verbose)
2951 /* xgettext:c-format */
2952 info_msg (_("Creating library file: %s\n"), impfilename);
2953
2954 bfd_set_format (outarch, bfd_archive);
2955 outarch->has_armap = 1;
2956
2957 /* Work out a reasonable size of things to put onto one line. */
2958 ar_head = make_head (outarch);
2959
2960 /* Iterate the input BFDs, looking for exclude-modules-for-implib. */
2961 for (ibfd = info->input_bfds; ibfd; ibfd = ibfd->link.next)
2962 {
2963 /* Iterate the exclude list. */
2964 struct exclude_list_struct *ex;
2965 char found;
2966 for (ex = excludes, found = 0; ex && !found; ex = ex->next)
2967 {
2968 if (ex->type != EXCLUDEFORIMPLIB)
2969 continue;
2970 found = (filename_cmp (ex->string, bfd_get_filename (ibfd)) == 0);
2971 }
2972 /* If it matched, we must open a fresh BFD for it (the original
2973 input BFD is still needed for the DLL's final link) and add
2974 it into the archive member chain. */
2975 if (found)
2976 {
2977 bfd *newbfd = bfd_openr (ibfd->my_archive
2978 ? bfd_get_filename (ibfd->my_archive)
2979 : bfd_get_filename (ibfd), NULL);
2980 if (!newbfd)
2981 {
2982 einfo (_("%X%P: bfd_openr %s: %E\n"), bfd_get_filename (ibfd));
2983 return;
2984 }
2985 if (ibfd->my_archive)
2986 {
2987 /* Must now iterate through archive until we find the
2988 required member. A minor shame that we'll open the
2989 archive once per member that we require from it, and
2990 leak those archive bfds rather than reuse them. */
2991 bfd *arbfd = newbfd;
2992 if (!bfd_check_format_matches (arbfd, bfd_archive, NULL))
2993 {
2994 einfo (_("%X%P: %s(%s): can't find member in non-archive file"),
2995 bfd_get_filename (ibfd->my_archive),
2996 bfd_get_filename (ibfd));
2997 return;
2998 }
2999 newbfd = NULL;
3000 while ((newbfd = bfd_openr_next_archived_file (arbfd, newbfd)) != 0)
3001 {
3002 if (filename_cmp (bfd_get_filename (newbfd),
3003 bfd_get_filename (ibfd)) == 0)
3004 break;
3005 }
3006 if (!newbfd)
3007 {
3008 einfo (_("%X%P: %s(%s): can't find member in archive"),
3009 bfd_get_filename (ibfd->my_archive),
3010 bfd_get_filename (ibfd));
3011 return;
3012 }
3013 }
3014 newbfd->archive_next = head;
3015 head = newbfd;
3016 }
3017 }
3018
3019 for (i = 0; i < def->num_exports; i++)
3020 {
3021 /* The import library doesn't know about the internal name. */
3022 char *internal = def->exports[i].internal_name;
3023 bfd *n;
3024
3025 /* Don't add PRIVATE entries to import lib. */
3026 if (pe_def_file->exports[i].flag_private)
3027 continue;
3028
3029 def->exports[i].internal_name = def->exports[i].name;
3030
3031 /* PR 19803: If a symbol has been discard due to garbage
3032 collection then do not create any exports for it. */
3033 {
3034 struct coff_link_hash_entry *h;
3035
3036 h = coff_link_hash_lookup (coff_hash_table (info), internal,
3037 false, false, false);
3038 if (h != NULL
3039 /* If the symbol is hidden and undefined then it
3040 has been swept up by garbage collection. */
3041 && h->symbol_class == C_HIDDEN
3042 && h->root.u.def.section == bfd_und_section_ptr)
3043 continue;
3044
3045 /* If necessary, check with an underscore prefix as well. */
3046 if (pe_details->underscored && internal[0] != '@')
3047 {
3048 char *name;
3049
3050 name = xmalloc (strlen (internal) + 2);
3051 sprintf (name, "_%s", internal);
3052
3053 h = coff_link_hash_lookup (coff_hash_table (info), name,
3054 false, false, false);
3055 free (name);
3056
3057 if (h != NULL
3058 /* If the symbol is hidden and undefined then it
3059 has been swept up by garbage collection. */
3060 && h->symbol_class == C_HIDDEN
3061 && h->root.u.def.section == bfd_und_section_ptr)
3062 continue;
3063 }
3064 }
3065
3066 n = make_one (def->exports + i, outarch, !(def->exports + i)->flag_data);
3067 n->archive_next = head;
3068 head = n;
3069 def->exports[i].internal_name = internal;
3070 }
3071
3072 ar_tail = make_tail (outarch);
3073
3074 if (ar_head == NULL || ar_tail == NULL)
3075 return;
3076
3077 /* Now stick them all into the archive. */
3078 ar_head->archive_next = head;
3079 ar_tail->archive_next = ar_head;
3080 head = ar_tail;
3081
3082 if (! bfd_set_archive_head (outarch, head))
3083 einfo ("%X%P: bfd_set_archive_head: %E\n");
3084
3085 if (! bfd_close (outarch))
3086 einfo ("%X%P: bfd_close %s: %E\n", impfilename);
3087
3088 while (head != NULL)
3089 {
3090 bfd *n = head->archive_next;
3091 bfd_close (head);
3092 head = n;
3093 }
3094 }
3095
3096 static int undef_count = 0;
3097
3098 struct key_value
3099 {
3100 char *key;
3101 const char *oname;
3102 };
3103
3104 static struct key_value *udef_table;
3105
3106 static int undef_sort_cmp (const void *l1, const void *r1)
3107 {
3108 const struct key_value *l = l1;
3109 const struct key_value *r = r1;
3110
3111 return strcmp (l->key, r->key);
3112 }
3113
3114 static struct bfd_link_hash_entry *
3115 pe_find_cdecl_alias_match (struct bfd_link_info *linfo, char *name)
3116 {
3117 struct bfd_link_hash_entry *h = NULL;
3118 struct key_value *kv;
3119 struct key_value key;
3120 char *at, *lname = xmalloc (strlen (name) + 3);
3121
3122 strcpy (lname, name);
3123
3124 at = strchr (lname + (lname[0] == '@'), '@');
3125 if (at)
3126 at[1] = 0;
3127
3128 key.key = lname;
3129 kv = bsearch (&key, udef_table, undef_count, sizeof (struct key_value),
3130 undef_sort_cmp);
3131
3132 if (kv)
3133 {
3134 h = bfd_link_hash_lookup (linfo->hash, kv->oname, false, false, false);
3135 if (h->type == bfd_link_hash_undefined)
3136 goto return_h;
3137 }
3138
3139 if (lname[0] == '?')
3140 goto return_NULL;
3141
3142 if (at || lname[0] == '@')
3143 {
3144 if (lname[0] == '@')
3145 {
3146 if (pe_details->underscored)
3147 lname[0] = '_';
3148 else
3149 /* Use memmove rather than strcpy as that
3150 can handle overlapping buffers. */
3151 memmove (lname, lname + 1, strlen (lname));
3152 key.key = lname;
3153 kv = bsearch (&key, udef_table, undef_count,
3154 sizeof (struct key_value), undef_sort_cmp);
3155 if (kv)
3156 {
3157 h = bfd_link_hash_lookup (linfo->hash, kv->oname, false, false, false);
3158 if (h->type == bfd_link_hash_undefined)
3159 goto return_h;
3160 }
3161 }
3162 if (at)
3163 *strchr (lname, '@') = 0;
3164 key.key = lname;
3165 kv = bsearch (&key, udef_table, undef_count,
3166 sizeof (struct key_value), undef_sort_cmp);
3167 if (kv)
3168 {
3169 h = bfd_link_hash_lookup (linfo->hash, kv->oname, false, false, false);
3170 if (h->type == bfd_link_hash_undefined)
3171 goto return_h;
3172 }
3173 goto return_NULL;
3174 }
3175
3176 strcat (lname, "@");
3177 key.key = lname;
3178 kv = bsearch (&key, udef_table, undef_count,
3179 sizeof (struct key_value), undef_sort_cmp);
3180
3181 if (kv)
3182 {
3183 h = bfd_link_hash_lookup (linfo->hash, kv->oname, false, false, false);
3184 if (h->type == bfd_link_hash_undefined)
3185 goto return_h;
3186 }
3187
3188 if (lname[0] == '_' && pe_details->underscored)
3189 lname[0] = '@';
3190 else
3191 {
3192 memmove (lname + 1, lname, strlen (lname) + 1);
3193 lname[0] = '@';
3194 }
3195 key.key = lname;
3196
3197 kv = bsearch (&key, udef_table, undef_count,
3198 sizeof (struct key_value), undef_sort_cmp);
3199
3200 if (kv)
3201 {
3202 h = bfd_link_hash_lookup (linfo->hash, kv->oname, false, false, false);
3203 if (h->type == bfd_link_hash_undefined)
3204 goto return_h;
3205 }
3206
3207 return_NULL:
3208 h = NULL;
3209 return_h:
3210 free (lname);
3211 return h;
3212 }
3213
3214 static bool
3215 pe_undef_count (struct bfd_link_hash_entry *h ATTRIBUTE_UNUSED,
3216 void *inf ATTRIBUTE_UNUSED)
3217 {
3218 if (h->type == bfd_link_hash_undefined)
3219 undef_count++;
3220 return true;
3221 }
3222
3223 static bool
3224 pe_undef_fill (struct bfd_link_hash_entry *h, void *inf ATTRIBUTE_UNUSED)
3225 {
3226 if (h->type == bfd_link_hash_undefined)
3227 {
3228 char *at;
3229
3230 udef_table[undef_count].key = xstrdup (h->root.string);
3231 at = strchr (udef_table[undef_count].key
3232 + (udef_table[undef_count].key[0] == '@'), '@');
3233 if (at)
3234 at[1] = 0;
3235 udef_table[undef_count].oname = h->root.string;
3236 undef_count++;
3237 }
3238 return true;
3239 }
3240
3241 static void
3242 pe_create_undef_table (void)
3243 {
3244 undef_count = 0;
3245
3246 /* count undefined symbols */
3247
3248 bfd_link_hash_traverse (link_info.hash, pe_undef_count, "");
3249
3250 /* create and fill the corresponding table */
3251 udef_table = xmalloc (undef_count * sizeof (struct key_value));
3252
3253 undef_count = 0;
3254 bfd_link_hash_traverse (link_info.hash, pe_undef_fill, "");
3255
3256 /* sort items */
3257 qsort (udef_table, undef_count, sizeof (struct key_value), undef_sort_cmp);
3258 }
3259
3260 static void
3261 add_bfd_to_link (bfd *abfd, const char *name, struct bfd_link_info *linfo)
3262 {
3263 lang_input_statement_type *fake_file;
3264
3265 fake_file = lang_add_input_file (name,
3266 lang_input_file_is_fake_enum,
3267 NULL);
3268 fake_file->the_bfd = abfd;
3269 ldlang_add_file (fake_file);
3270
3271 if (!bfd_link_add_symbols (abfd, linfo))
3272 einfo (_("%X%P: add symbols %s: %E\n"), name);
3273 }
3274
3275 void
3276 pe_process_import_defs (bfd *output_bfd, struct bfd_link_info *linfo)
3277 {
3278 pe_dll_id_target (bfd_get_target (output_bfd));
3279
3280 if (pe_def_file)
3281 {
3282 int i, j;
3283 def_file_module *module;
3284 def_file_import *imp;
3285
3286 imp = pe_def_file->imports;
3287
3288 pe_create_undef_table ();
3289
3290 for (module = pe_def_file->modules; module; module = module->next)
3291 {
3292 int do_this_dll = 0;
3293
3294 for (i = 0; i < pe_def_file->num_imports; i++)
3295 if (imp[i].module == module)
3296 break;
3297 if (i >= pe_def_file->num_imports)
3298 continue;
3299
3300 dll_filename = module->name;
3301 dll_symname = xstrdup (module->name);
3302 for (j = 0; dll_symname[j]; j++)
3303 if (!ISALNUM (dll_symname[j]))
3304 dll_symname[j] = '_';
3305
3306 for (; i < pe_def_file->num_imports && imp[i].module == module; i++)
3307 {
3308 def_file_export exp;
3309 struct bfd_link_hash_entry *blhe;
3310 int lead_at = (*imp[i].internal_name == '@');
3311 /* See if we need this import. */
3312 size_t len = strlen (imp[i].internal_name);
3313 char *name = xmalloc (len + 2 + 6);
3314 bool include_jmp_stub = false;
3315 bool is_cdecl = false;
3316 bool is_undef = false;
3317
3318 if (!lead_at && strchr (imp[i].internal_name, '@') == NULL)
3319 is_cdecl = true;
3320
3321 if (lead_at)
3322 sprintf (name, "%s", imp[i].internal_name);
3323 else
3324 sprintf (name, "%s%s",U (""), imp[i].internal_name);
3325
3326 blhe = bfd_link_hash_lookup (linfo->hash, name,
3327 false, false, false);
3328
3329 /* Include the jump stub for <sym> only if the <sym>
3330 is undefined. */
3331 if (!blhe || (blhe && blhe->type != bfd_link_hash_undefined))
3332 {
3333 if (lead_at)
3334 sprintf (name, "%s%s", "__imp_", imp[i].internal_name);
3335 else
3336 sprintf (name, "%s%s%s", "__imp_", U (""),
3337 imp[i].internal_name);
3338
3339 blhe = bfd_link_hash_lookup (linfo->hash, name,
3340 false, false, false);
3341 if (blhe)
3342 is_undef = (blhe->type == bfd_link_hash_undefined);
3343 }
3344 else
3345 {
3346 include_jmp_stub = true;
3347 is_undef = (blhe->type == bfd_link_hash_undefined);
3348 }
3349
3350 if (is_cdecl
3351 && (!blhe || (blhe && blhe->type != bfd_link_hash_undefined)))
3352 {
3353 sprintf (name, "%s%s",U (""), imp[i].internal_name);
3354 blhe = pe_find_cdecl_alias_match (linfo, name);
3355 include_jmp_stub = true;
3356 if (blhe)
3357 is_undef = (blhe->type == bfd_link_hash_undefined);
3358 }
3359
3360 free (name);
3361
3362 if (is_undef)
3363 {
3364 bfd *one;
3365 /* We do. */
3366 if (!do_this_dll)
3367 {
3368 bfd *ar_head = make_head (output_bfd);
3369 add_bfd_to_link (ar_head, bfd_get_filename (ar_head),
3370 linfo);
3371 do_this_dll = 1;
3372 }
3373 exp.internal_name = imp[i].internal_name;
3374 exp.name = imp[i].name;
3375 exp.its_name = imp[i].its_name;
3376 exp.ordinal = imp[i].ordinal;
3377 exp.hint = exp.ordinal >= 0 ? exp.ordinal : 0;
3378 exp.flag_private = 0;
3379 exp.flag_constant = 0;
3380 exp.flag_data = imp[i].data;
3381 exp.flag_noname = exp.name ? 0 : 1;
3382 one = make_one (&exp, output_bfd,
3383 !exp.flag_data && include_jmp_stub);
3384 add_bfd_to_link (one, bfd_get_filename (one), linfo);
3385 }
3386 }
3387 if (do_this_dll)
3388 {
3389 bfd *ar_tail = make_tail (output_bfd);
3390 add_bfd_to_link (ar_tail, bfd_get_filename (ar_tail), linfo);
3391 }
3392
3393 free (dll_symname);
3394 }
3395
3396 while (undef_count)
3397 {
3398 --undef_count;
3399 free (udef_table[undef_count].key);
3400 }
3401 free (udef_table);
3402 }
3403
3404 if (pe_def_file && pe_def_file->name)
3405 dll_filename = pe_def_file->name;
3406 else
3407 {
3408 dll_filename = bfd_get_filename (output_bfd);
3409 for (const char *p = dll_filename; *p; p++)
3410 if (*p == '\\' || *p == '/' || *p == ':')
3411 dll_filename = p + 1;
3412 }
3413 dll_symname = xstrdup (dll_filename);
3414 for (int i = 0; dll_symname[i]; i++)
3415 if (!ISALNUM (dll_symname[i]))
3416 dll_symname[i] = '_';
3417 }
3418
3419 /* We were handed a *.DLL file. Parse it and turn it into a set of
3420 IMPORTS directives in the def file. Return TRUE if the file was
3421 handled, FALSE if not. */
3422
3423 static unsigned int
3424 pe_get16 (bfd *abfd, int where)
3425 {
3426 unsigned char b[2];
3427
3428 bfd_seek (abfd, (file_ptr) where, SEEK_SET);
3429 bfd_bread (b, (bfd_size_type) 2, abfd);
3430 return b[0] + (b[1] << 8);
3431 }
3432
3433 static unsigned int
3434 pe_get32 (bfd *abfd, int where)
3435 {
3436 unsigned char b[4];
3437
3438 bfd_seek (abfd, (file_ptr) where, SEEK_SET);
3439 bfd_bread (b, (bfd_size_type) 4, abfd);
3440 return b[0] + (b[1] << 8) + (b[2] << 16) + ((unsigned) b[3] << 24);
3441 }
3442
3443 static unsigned int
3444 pe_as32 (void *ptr)
3445 {
3446 unsigned char *b = ptr;
3447
3448 return b[0] + (b[1] << 8) + (b[2] << 16) + ((unsigned) b[3] << 24);
3449 }
3450
3451 bool
3452 pe_implied_import_dll (const char *filename)
3453 {
3454 bfd *dll;
3455 bfd_vma pe_header_offset, opthdr_ofs, num_entries, i;
3456 bfd_vma export_rva, export_size, nsections, secptr, expptr;
3457 bfd_vma exp_funcbase;
3458 unsigned char *expdata;
3459 char *erva;
3460 bfd_vma name_rvas, nexp;
3461 const char *dllname;
3462 /* Initialization with start > end guarantees that is_data
3463 will not be set by mistake, and avoids compiler warning. */
3464 bfd_vma data_start = 1;
3465 bfd_vma data_end = 0;
3466 bfd_vma rdata_start = 1;
3467 bfd_vma rdata_end = 0;
3468 bfd_vma bss_start = 1;
3469 bfd_vma bss_end = 0;
3470 int from;
3471
3472 /* No, I can't use bfd here. kernel32.dll puts its export table in
3473 the middle of the .rdata section. */
3474 dll = bfd_openr (filename, pe_details->target_name);
3475 if (!dll)
3476 {
3477 einfo (_("%X%P: open %s: %E\n"), filename);
3478 return false;
3479 }
3480
3481 track_dependency_files (filename);
3482
3483 /* PEI dlls seem to be bfd_objects. */
3484 if (!bfd_check_format (dll, bfd_object))
3485 {
3486 einfo (_("%X%P: %s: this doesn't appear to be a DLL\n"), filename);
3487 return false;
3488 }
3489
3490 /* Get pe_header, optional header and numbers of directory entries. */
3491 pe_header_offset = pe_get32 (dll, 0x3c);
3492 opthdr_ofs = pe_header_offset + 4 + 20;
3493 #ifdef pe_use_plus
3494 num_entries = pe_get32 (dll, opthdr_ofs + 92 + 4 * 4); /* & NumberOfRvaAndSizes. */
3495 #else
3496 num_entries = pe_get32 (dll, opthdr_ofs + 92);
3497 #endif
3498
3499 /* No import or export directory entry. */
3500 if (num_entries < 1)
3501 return false;
3502
3503 #ifdef pe_use_plus
3504 export_rva = pe_get32 (dll, opthdr_ofs + 96 + 4 * 4);
3505 export_size = pe_get32 (dll, opthdr_ofs + 100 + 4 * 4);
3506 #else
3507 export_rva = pe_get32 (dll, opthdr_ofs + 96);
3508 export_size = pe_get32 (dll, opthdr_ofs + 100);
3509 #endif
3510
3511 /* No export table - nothing to export. */
3512 if (export_size == 0)
3513 return false;
3514
3515 nsections = pe_get16 (dll, pe_header_offset + 4 + 2);
3516 secptr = (pe_header_offset + 4 + 20 +
3517 pe_get16 (dll, pe_header_offset + 4 + 16));
3518 expptr = 0;
3519
3520 /* Get the rva and size of the export section. */
3521 for (i = 0; i < nsections; i++)
3522 {
3523 char sname[8];
3524 bfd_vma secptr1 = secptr + 40 * i;
3525 bfd_vma vaddr = pe_get32 (dll, secptr1 + 12);
3526 bfd_vma vsize = pe_get32 (dll, secptr1 + 16);
3527 bfd_vma fptr = pe_get32 (dll, secptr1 + 20);
3528
3529 bfd_seek (dll, (file_ptr) secptr1, SEEK_SET);
3530 bfd_bread (sname, (bfd_size_type) 8, dll);
3531
3532 if (vaddr <= export_rva && vaddr + vsize > export_rva)
3533 {
3534 expptr = fptr + (export_rva - vaddr);
3535 if (export_rva + export_size > vaddr + vsize)
3536 export_size = vsize - (export_rva - vaddr);
3537 break;
3538 }
3539 }
3540
3541 /* Scan sections and store the base and size of the
3542 data and bss segments in data/base_start/end. */
3543 for (i = 0; i < nsections; i++)
3544 {
3545 bfd_vma secptr1 = secptr + 40 * i;
3546 bfd_vma vsize = pe_get32 (dll, secptr1 + 8);
3547 bfd_vma vaddr = pe_get32 (dll, secptr1 + 12);
3548 bfd_vma flags = pe_get32 (dll, secptr1 + 36);
3549 char sec_name[9];
3550
3551 sec_name[8] = '\0';
3552 bfd_seek (dll, (file_ptr) secptr1 + 0, SEEK_SET);
3553 bfd_bread (sec_name, (bfd_size_type) 8, dll);
3554
3555 if (strcmp(sec_name,".data") == 0)
3556 {
3557 data_start = vaddr;
3558 data_end = vaddr + vsize;
3559
3560 if (pe_dll_extra_pe_debug)
3561 printf ("%s %s: 0x%08lx-0x%08lx (0x%08lx)\n",
3562 __func__, sec_name, (unsigned long) vaddr,
3563 (unsigned long) (vaddr + vsize), (unsigned long) flags);
3564 }
3565 else if (strcmp(sec_name,".rdata") == 0)
3566 {
3567 rdata_start = vaddr;
3568 rdata_end = vaddr + vsize;
3569
3570 if (pe_dll_extra_pe_debug)
3571 printf ("%s %s: 0x%08lx-0x%08lx (0x%08lx)\n",
3572 __func__, sec_name, (unsigned long) vaddr,
3573 (unsigned long) (vaddr + vsize), (unsigned long) flags);
3574 }
3575 else if (strcmp (sec_name,".bss") == 0)
3576 {
3577 bss_start = vaddr;
3578 bss_end = vaddr + vsize;
3579
3580 if (pe_dll_extra_pe_debug)
3581 printf ("%s %s: 0x%08lx-0x%08lx (0x%08lx)\n",
3582 __func__, sec_name, (unsigned long) vaddr,
3583 (unsigned long) (vaddr + vsize), (unsigned long) flags);
3584 }
3585 }
3586
3587 expdata = xmalloc (export_size);
3588 bfd_seek (dll, (file_ptr) expptr, SEEK_SET);
3589 bfd_bread (expdata, (bfd_size_type) export_size, dll);
3590 erva = (char *) expdata - export_rva;
3591
3592 if (pe_def_file == 0)
3593 pe_def_file = def_file_empty ();
3594
3595 nexp = pe_as32 (expdata + 24);
3596 name_rvas = pe_as32 (expdata + 32);
3597 exp_funcbase = pe_as32 (expdata + 28);
3598
3599 /* Use internal dll name instead of filename
3600 to enable symbolic dll linking. */
3601 dllname = erva + pe_as32 (expdata + 12);
3602
3603 /* Check to see if the dll has already been added to
3604 the definition list and if so return without error.
3605 This avoids multiple symbol definitions. */
3606 if (def_get_module (pe_def_file, dllname))
3607 {
3608 if (pe_dll_extra_pe_debug)
3609 printf ("%s is already loaded\n", dllname);
3610 return true;
3611 }
3612
3613 /* This is an optimized version of the insertion loop, which avoids lots of
3614 calls to realloc and memmove from def_file_add_import. */
3615 if ((from = def_file_add_import_from (pe_def_file, nexp,
3616 erva + pe_as32 (erva + name_rvas),
3617 dllname, 0, NULL, NULL)) >= 0)
3618 {
3619 for (i = 0; i < nexp; i++)
3620 {
3621 /* Pointer to the names vector. */
3622 bfd_vma name_rva = pe_as32 (erva + name_rvas + i * 4);
3623 def_file_import *imp;
3624 /* Pointer to the function address vector. */
3625 bfd_vma func_rva = pe_as32 (erva + exp_funcbase + i * 4);
3626 /* is_data is true if the address is in the data, rdata or bss
3627 segment. */
3628 const int is_data =
3629 (func_rva >= data_start && func_rva < data_end)
3630 || (func_rva >= rdata_start && func_rva < rdata_end)
3631 || (func_rva >= bss_start && func_rva < bss_end);
3632
3633 imp = def_file_add_import_at (pe_def_file, from + i, erva + name_rva,
3634 dllname, i, NULL, NULL);
3635 /* Mark symbol type. */
3636 imp->data = is_data;
3637
3638 if (pe_dll_extra_pe_debug)
3639 printf ("%s dll-name: %s sym: %s addr: 0x%lx %s\n",
3640 __func__, dllname, erva + name_rva,
3641 (unsigned long) func_rva, is_data ? "(data)" : "");
3642 }
3643
3644 return true;
3645 }
3646
3647 /* Iterate through the list of symbols. */
3648 for (i = 0; i < nexp; i++)
3649 {
3650 /* Pointer to the names vector. */
3651 bfd_vma name_rva = pe_as32 (erva + name_rvas + i * 4);
3652 def_file_import *imp;
3653 /* Pointer to the function address vector. */
3654 bfd_vma func_rva = pe_as32 (erva + exp_funcbase + i * 4);
3655 int is_data = 0;
3656
3657 /* Skip unwanted symbols, which are
3658 exported in buggy auto-import releases. */
3659 if (! startswith (erva + name_rva, "__nm_"))
3660 {
3661 bool is_dup = false;
3662 /* is_data is true if the address is in the data, rdata or bss
3663 segment. */
3664 is_data =
3665 (func_rva >= data_start && func_rva < data_end)
3666 || (func_rva >= rdata_start && func_rva < rdata_end)
3667 || (func_rva >= bss_start && func_rva < bss_end);
3668
3669 imp = def_file_add_import (pe_def_file, erva + name_rva,
3670 dllname, i, NULL, NULL, &is_dup);
3671 /* Mark symbol type. */
3672 if (!is_dup)
3673 imp->data = is_data;
3674
3675 if (pe_dll_extra_pe_debug)
3676 printf ("%s dll-name: %s sym: %s addr: 0x%lx %s\n",
3677 __func__, dllname, erva + name_rva,
3678 (unsigned long) func_rva, is_data ? "(data)" : "");
3679 }
3680 }
3681
3682 return true;
3683 }
3684
3685 void
3686 pe_output_file_set_long_section_names (bfd *abfd)
3687 {
3688 if (pe_use_coff_long_section_names < 0)
3689 return;
3690 if (!bfd_coff_set_long_section_names (abfd, pe_use_coff_long_section_names))
3691 einfo (_("%X%P: error: can't use long section names on this arch\n"));
3692 }
3693
3694 /* These are the main functions, called from the emulation. The first
3695 is called after the bfds are read, so we can guess at how much space
3696 we need. The second is called after everything is placed, so we
3697 can put the right values in place. */
3698
3699 void
3700 pe_dll_build_sections (bfd *abfd, struct bfd_link_info *info)
3701 {
3702 pe_dll_id_target (bfd_get_target (abfd));
3703 pe_output_file_set_long_section_names (abfd);
3704 process_def_file_and_drectve (abfd, info);
3705
3706 if (pe_def_file->num_exports == 0
3707 && (!bfd_link_pic (info) || pe_dll_exclude_all_symbols))
3708 {
3709 if (pe_dll_enable_reloc_section)
3710 {
3711 build_filler_bfd (false /* edata not needed. */);
3712 pe_output_file_set_long_section_names (filler_bfd);
3713 }
3714 return;
3715 }
3716
3717 generate_edata ();
3718 build_filler_bfd (true /* edata is needed. */);
3719 pe_output_file_set_long_section_names (filler_bfd);
3720 }
3721
3722 void
3723 pe_exe_build_sections (bfd *abfd, struct bfd_link_info *info ATTRIBUTE_UNUSED)
3724 {
3725 pe_dll_id_target (bfd_get_target (abfd));
3726 pe_output_file_set_long_section_names (abfd);
3727 build_filler_bfd (0);
3728 pe_output_file_set_long_section_names (filler_bfd);
3729 }
3730
3731 void
3732 pe_dll_fill_sections (bfd *abfd, struct bfd_link_info *info)
3733 {
3734 pe_exe_fill_sections (abfd, info);
3735
3736 if (edata_s)
3737 {
3738 fill_edata (abfd, info);
3739 edata_s->contents = edata_d;
3740 }
3741
3742 if (bfd_link_dll (info))
3743 pe_data (abfd)->dll = 1;
3744 }
3745
3746 void
3747 pe_exe_fill_sections (bfd *abfd, struct bfd_link_info *info)
3748 {
3749 pe_dll_id_target (bfd_get_target (abfd));
3750 pe_output_file_set_long_section_names (abfd);
3751 image_base = pe_data (abfd)->pe_opthdr.ImageBase;
3752
3753 generate_reloc (abfd, info);
3754
3755 if (reloc_sz > 0)
3756 {
3757 bfd_set_section_size (reloc_s, reloc_sz);
3758
3759 /* Resize the sections. */
3760 lang_reset_memory_regions ();
3761 lang_size_sections (NULL, true);
3762
3763 /* Redo special stuff. */
3764 ldemul_after_allocation ();
3765
3766 /* Do the assignments again. */
3767 lang_do_assignments (lang_final_phase_enum);
3768
3769 reloc_s->contents = reloc_d;
3770 }
3771 else if (reloc_s)
3772 {
3773 /* Do not emit an empty reloc section. */
3774 bfd_set_section_flags (reloc_s, SEC_IN_MEMORY | SEC_EXCLUDE);
3775 reloc_s->output_section = bfd_abs_section_ptr;
3776 }
3777 }
3778
3779 bool
3780 pe_bfd_is_dll (bfd *abfd)
3781 {
3782 return (bfd_get_format (abfd) == bfd_object
3783 && obj_pe (abfd)
3784 && pe_data (abfd)->dll);
3785 }