espressif/binutils-gdb
1
0
Fork 0
mirror of https://github.com/espressif/binutils-gdb.git synced 2025-06-25 21:41:47 +08:00
Code Issues Packages Projects Releases Wiki Activity

* elf.c (_bfd_elf_map_sections_to_segments): Don't load program

Browse Source 
headers if any loaded section wraps the address space.  Simplify
	~(m-1) to -m.  Use lma rather than vma when determining whether
	note sections are adjacent.
This commit is contained in:
Alan Modra
2010-08-25 06:49:55 +00:00
parent dc5ec521f1
commit 8d06853ec6
2 changed files with 25 additions and 7 deletions
Download Patch File Download Diff File Expand all files Collapse all files

7
bfd/ChangeLog
View File

@ -1,3 +1,10 @@
2010-08-25 Alan Modra <amodra@gmail.com>
* elf.c (_bfd_elf_map_sections_to_segments): Don't load program
headers if any loaded section wraps the address space. Simplify
~(m-1) to -m. Use lma rather than vma when determining whether
note sections are adjacent.
2010-08-22 H.J. Lu <hongjiu.lu@intel.com> 2010-08-22 H.J. Lu <hongjiu.lu@intel.com>
PR ld/11933 PR ld/11933

25
bfd/elf.c
View File

@ -3624,6 +3624,7 @@ _bfd_elf_map_sections_to_segments (bfd *abfd, struct bfd_link_info *info)
asection *first_tls = NULL; asection *first_tls = NULL;
asection *dynsec, *eh_frame_hdr; asection *dynsec, *eh_frame_hdr;
bfd_size_type amt; bfd_size_type amt;
bfd_vma addr_mask, wrap_to = 0;
/* Select the allocated sections, and sort them. */ /* Select the allocated sections, and sort them. */
@ -3632,6 +3633,12 @@ _bfd_elf_map_sections_to_segments (bfd *abfd, struct bfd_link_info *info)
if (sections == NULL) if (sections == NULL)
goto error_return; goto error_return;
/* Calculate top address, avoiding undefined behaviour of shift
left operator when shift count is equal to size of type
being shifted. */
addr_mask = ((bfd_vma) 1 << (bfd_arch_bits_per_address (abfd) - 1)) - 1;
addr_mask = (addr_mask << 1) + 1;
i = 0; i = 0;
for (s = abfd->sections; s != NULL; s = s->next) for (s = abfd->sections; s != NULL; s = s->next)
{ {
@ -3639,6 +3646,9 @@ _bfd_elf_map_sections_to_segments (bfd *abfd, struct bfd_link_info *info)
{ {
sections[i] = s; sections[i] = s;
++i; ++i;
/* A wrapping section potentially clashes with header. */
if (((s->lma + s->size) & addr_mask) < (s->lma & addr_mask))
wrap_to = (s->lma + s->size) & addr_mask;
} }
} }
BFD_ASSERT (i <= bfd_count_sections (abfd)); BFD_ASSERT (i <= bfd_count_sections (abfd));
@ -3708,8 +3718,10 @@ _bfd_elf_map_sections_to_segments (bfd *abfd, struct bfd_link_info *info)
if (phdr_size == (bfd_size_type) -1) if (phdr_size == (bfd_size_type) -1)
phdr_size = get_program_header_size (abfd, info); phdr_size = get_program_header_size (abfd, info);
if ((abfd->flags & D_PAGED) == 0 if ((abfd->flags & D_PAGED) == 0
|| sections[0]->lma < phdr_size || (sections[0]->lma & addr_mask) < phdr_size
|| sections[0]->lma % maxpagesize < phdr_size % maxpagesize) || ((sections[0]->lma & addr_mask) % maxpagesize
< phdr_size % maxpagesize)
|| (sections[0]->lma & addr_mask & -maxpagesize) < wrap_to)
phdr_in_segment = FALSE; phdr_in_segment = FALSE;
} }
@ -3774,9 +3786,8 @@ _bfd_elf_map_sections_to_segments (bfd *abfd, struct bfd_link_info *info)
} }
else if (! writable else if (! writable
&& (hdr->flags & SEC_READONLY) == 0 && (hdr->flags & SEC_READONLY) == 0
&& (((last_hdr->lma + last_size - 1) && (((last_hdr->lma + last_size - 1) & -maxpagesize)
& ~(maxpagesize - 1)) != (hdr->lma & -maxpagesize)))
!= (hdr->lma & ~(maxpagesize - 1))))
{ {
/* We don't want to put a writable section in a read only /* We don't want to put a writable section in a read only
segment, unless they are on the same page in memory segment, unless they are on the same page in memory
@ -3883,8 +3894,8 @@ _bfd_elf_map_sections_to_segments (bfd *abfd, struct bfd_link_info *info)
if (s2->next->alignment_power == 2 if (s2->next->alignment_power == 2
&& (s2->next->flags & SEC_LOAD) != 0 && (s2->next->flags & SEC_LOAD) != 0
&& CONST_STRNEQ (s2->next->name, ".note") && CONST_STRNEQ (s2->next->name, ".note")
&& align_power (s2->vma + s2->size, 2) && align_power (s2->lma + s2->size, 2)
== s2->next->vma) == s2->next->lma)
count++; count++;
else else
break; break;