1 /* Native Client support for ELF
2 Copyright (C) 2012-2016 Free Software Foundation, Inc.
4 This file is part of BFD, the Binary File Descriptor library.
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 3 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program. If not, see <http://www.gnu.org/licenses/>. */
24 #include "elf/common.h"
25 #include "elf/internal.h"
28 segment_executable (struct elf_segment_map
*seg
)
30 if (seg
->p_flags_valid
)
31 return (seg
->p_flags
& PF_X
) != 0;
34 /* The p_flags value has not been computed yet,
35 so we have to look through the sections. */
37 for (i
= 0; i
< seg
->count
; ++i
)
38 if (seg
->sections
[i
]->flags
& SEC_CODE
)
44 /* Determine if this segment is eligible to receive the file and program
45 headers. It must be read-only and non-executable.
46 Its first section must start far enough past the page boundary to
47 allow space for the headers. */
49 segment_eligible_for_headers (struct elf_segment_map
*seg
,
50 bfd_vma minpagesize
, bfd_vma sizeof_headers
)
53 if (seg
->count
== 0 || seg
->sections
[0]->lma
% minpagesize
< sizeof_headers
)
55 for (i
= 0; i
< seg
->count
; ++i
)
57 if ((seg
->sections
[i
]->flags
& (SEC_CODE
|SEC_READONLY
)) != SEC_READONLY
)
64 /* We permute the segment_map to get BFD to do the file layout we want:
65 The first non-executable PT_LOAD segment appears first in the file
66 and contains the ELF file header and phdrs. */
68 nacl_modify_segment_map (bfd
*abfd
, struct bfd_link_info
*info
)
70 const struct elf_backend_data
*const bed
= get_elf_backend_data (abfd
);
71 struct elf_segment_map
**m
= &elf_seg_map (abfd
);
72 struct elf_segment_map
**first_load
= NULL
;
73 struct elf_segment_map
**last_load
= NULL
;
74 bfd_boolean moved_headers
= FALSE
;
77 if (info
!= NULL
&& info
->user_phdrs
)
78 /* The linker script used PHDRS explicitly, so don't change what the
83 /* We're doing linking, so evalute SIZEOF_HEADERS as in a linker script. */
84 sizeof_headers
= bfd_sizeof_headers (abfd
, info
);
87 /* We're not doing linking, so this is objcopy or suchlike.
88 We just need to collect the size of the existing headers. */
89 struct elf_segment_map
*seg
;
90 sizeof_headers
= bed
->s
->sizeof_ehdr
;
91 for (seg
= *m
; seg
!= NULL
; seg
= seg
->next
)
92 sizeof_headers
+= bed
->s
->sizeof_phdr
;
97 struct elf_segment_map
*seg
= *m
;
99 if (seg
->p_type
== PT_LOAD
)
101 bfd_boolean executable
= segment_executable (seg
);
105 && seg
->sections
[0]->vma
% bed
->minpagesize
== 0)
107 asection
*lastsec
= seg
->sections
[seg
->count
- 1];
108 bfd_vma end
= lastsec
->vma
+ lastsec
->size
;
109 if (end
% bed
->minpagesize
!= 0)
111 /* This is an executable segment that starts on a page
112 boundary but does not end on a page boundary. Fill
113 it out to a whole page with code fill (the tail of
114 the segment will not be within any section). Thus
115 the entire code segment can be mapped from the file
116 as whole pages and that mapping will contain only
119 To accomplish this, we must fake out the code in
120 assign_file_positions_for_load_sections (elf.c) so
121 that it advances past the rest of the final page,
122 rather than trying to put the next (unaligned, or
123 unallocated) section. We do this by appending a
124 dummy section record to this element in the segment
125 map. No such output section ever actually exists,
126 but this gets the layout logic to advance the file
127 positions past this partial page. Since we are
128 lying to BFD like this, nothing will ever know to
129 write the section contents. So we do that by hand
130 after the fact, in nacl_final_write_processing, below. */
132 struct elf_segment_map
*newseg
;
134 struct bfd_elf_section_data
*secdata
;
136 BFD_ASSERT (!seg
->p_size_valid
);
138 secdata
= bfd_zalloc (abfd
, sizeof *secdata
);
142 sec
= bfd_zalloc (abfd
, sizeof *sec
);
146 /* Fill in only the fields that actually affect the logic
147 in assign_file_positions_for_load_sections. */
149 sec
->lma
= lastsec
->lma
+ lastsec
->size
;
150 sec
->size
= bed
->minpagesize
- (end
% bed
->minpagesize
);
151 sec
->flags
= (SEC_ALLOC
| SEC_LOAD
152 | SEC_READONLY
| SEC_CODE
| SEC_LINKER_CREATED
);
153 sec
->used_by_bfd
= secdata
;
155 secdata
->this_hdr
.sh_type
= SHT_PROGBITS
;
156 secdata
->this_hdr
.sh_flags
= SHF_ALLOC
| SHF_EXECINSTR
;
157 secdata
->this_hdr
.sh_addr
= sec
->vma
;
158 secdata
->this_hdr
.sh_size
= sec
->size
;
160 newseg
= bfd_alloc (abfd
,
161 sizeof *newseg
+ ((seg
->count
+ 1)
162 * sizeof (asection
*)));
166 sizeof *newseg
+ (seg
->count
* sizeof (asection
*)));
167 newseg
->sections
[newseg
->count
++] = sec
;
172 /* First, we're just finding the earliest PT_LOAD.
173 By the normal rules, this will be the lowest-addressed one.
174 We only have anything interesting to do if it's executable. */
176 if (first_load
== NULL
)
182 /* Now that we've noted the first PT_LOAD, we're looking for
183 the first non-executable PT_LOAD with a nonempty p_filesz. */
184 else if (!moved_headers
185 && segment_eligible_for_headers (seg
, bed
->minpagesize
,
188 /* This is the one we were looking for!
190 First, clear the flags on previous segments that
191 say they include the file header and phdrs. */
192 struct elf_segment_map
*prevseg
;
193 for (prevseg
= *first_load
;
195 prevseg
= prevseg
->next
)
196 if (prevseg
->p_type
== PT_LOAD
)
198 prevseg
->includes_filehdr
= 0;
199 prevseg
->includes_phdrs
= 0;
202 /* This segment will include those headers instead. */
203 seg
->includes_filehdr
= 1;
204 seg
->includes_phdrs
= 1;
206 moved_headers
= TRUE
;
214 if (first_load
!= last_load
&& moved_headers
)
216 /* Now swap the first and last PT_LOAD segments'
217 positions in segment_map. */
218 struct elf_segment_map
*first
= *first_load
;
219 struct elf_segment_map
*last
= *last_load
;
220 *first_load
= first
->next
;
221 first
->next
= last
->next
;
228 /* After nacl_modify_segment_map has done its work, the file layout has
229 been done as we wanted. But the PT_LOAD phdrs are no longer in the
230 proper order for the ELF rule that they must appear in ascending address
231 order. So find the two segments we swapped before, and swap them back. */
233 nacl_modify_program_headers (bfd
*abfd
, struct bfd_link_info
*info
)
235 struct elf_segment_map
**m
= &elf_seg_map (abfd
);
236 Elf_Internal_Phdr
*phdr
= elf_tdata (abfd
)->phdr
;
237 Elf_Internal_Phdr
*p
= phdr
;
239 if (info
!= NULL
&& info
->user_phdrs
)
240 /* The linker script used PHDRS explicitly, so don't change what the
244 /* Find the PT_LOAD that contains the headers (should be the first). */
247 if ((*m
)->p_type
== PT_LOAD
&& (*m
)->includes_filehdr
)
256 struct elf_segment_map
**first_load_seg
= m
;
257 Elf_Internal_Phdr
*first_load_phdr
= p
;
258 struct elf_segment_map
**next_load_seg
= NULL
;
259 Elf_Internal_Phdr
*next_load_phdr
= NULL
;
261 /* Now move past that first one and find the PT_LOAD that should be
262 before it by address order. */
269 if (p
->p_type
== PT_LOAD
&& p
->p_vaddr
< first_load_phdr
->p_vaddr
)
280 /* Swap their positions in the segment_map back to how they used to be.
281 The phdrs have already been set up by now, so we have to slide up
282 the earlier ones to insert the one that should be first. */
283 if (next_load_seg
!= NULL
)
285 Elf_Internal_Phdr move_phdr
;
286 struct elf_segment_map
*first_seg
= *first_load_seg
;
287 struct elf_segment_map
*next_seg
= *next_load_seg
;
288 struct elf_segment_map
*first_next
= first_seg
->next
;
289 struct elf_segment_map
*next_next
= next_seg
->next
;
291 if (next_load_seg
== &first_seg
->next
)
293 *first_load_seg
= next_seg
;
294 next_seg
->next
= first_seg
;
295 first_seg
->next
= next_next
;
299 *first_load_seg
= first_next
;
300 *next_load_seg
= next_next
;
302 first_seg
->next
= *next_load_seg
;
303 *next_load_seg
= first_seg
;
305 next_seg
->next
= *first_load_seg
;
306 *first_load_seg
= next_seg
;
309 move_phdr
= *next_load_phdr
;
310 memmove (first_load_phdr
+ 1, first_load_phdr
,
311 (next_load_phdr
- first_load_phdr
) * sizeof move_phdr
);
312 *first_load_phdr
= move_phdr
;
320 nacl_final_write_processing (bfd
*abfd
, bfd_boolean linker ATTRIBUTE_UNUSED
)
322 struct elf_segment_map
*seg
;
323 for (seg
= elf_seg_map (abfd
); seg
!= NULL
; seg
= seg
->next
)
324 if (seg
->p_type
== PT_LOAD
326 && seg
->sections
[seg
->count
- 1]->owner
== NULL
)
328 /* This is a fake section added in nacl_modify_segment_map, above.
329 It's not a real BFD section, so nothing wrote its contents.
330 Now write out its contents. */
332 asection
*sec
= seg
->sections
[seg
->count
- 1];
335 BFD_ASSERT (sec
->flags
& SEC_LINKER_CREATED
);
336 BFD_ASSERT (sec
->flags
& SEC_CODE
);
337 BFD_ASSERT (sec
->size
> 0);
339 fill
= abfd
->arch_info
->fill (sec
->size
, bfd_big_endian (abfd
), TRUE
);
342 || bfd_seek (abfd
, sec
->filepos
, SEEK_SET
) != 0
343 || bfd_bwrite (fill
, sec
->size
, abfd
) != sec
->size
)
345 /* We don't have a proper way to report an error here. So
346 instead fudge things so that elf_write_shdrs_and_ehdr will
348 elf_elfheader (abfd
)->e_shoff
= (file_ptr
) -1;