mirror of
https://github.com/openharmony/third_party_elfutils.git
synced 2026-07-01 06:41:51 -04:00
a46200f630
Some years ago, in commit b1d0b0fc "libelf: Use int64_t for offsets in
libelf.h", we changed the public interface to use 64bit offsets/sizes.
This wasn't really a API change, before we relied on loff_t always
being 64bits on all platforms.
We didn't change the implementation to use the int64_t type though.
That was a little confusing, since the function definitions used a
different type, int64_t, from the function implementations, off_t.
Since we always build with _FILE_OFFSET_BITS=64 this should be fine.
But it was a bit sloppy and confusing.
Worse is that we got the translation of offset/sizes wrong in a
couple of places when translating to ELF types. In various places
we would use Elf32_Word or Elf64_Word. But both are 32bit (unsigned)
types! As is GElf_Word. Elf32_Off is 32bits and Elf64_Off is 64bits.
But we were not using those consistently.
This patch introduces comments for the usage of [G]Elf(32|64)Word in
libelf that are correct. And introduces Elf(32|64)_SizeWord in
elf32_updatenull.c where we want to make a difference between sizes
and offsets (the ELF variants are both unsigned, while int64_t/loff_t
is signed).
It also includes a new run-large-elf-file.sh test that creates a
large ELF files (one 64bit, little endian, rel and another big endian,
non-rel) and runs eu-strip, eu-elflint, eu-unstrip and eu-elfcmp.
Before this patch, that test case fails and creates corrupt ELF files.
The test is guarded by some checks that try to make sure there is
enough disk space and memory available on the machine. The test is
skipped otherwise.
Signed-off-by: Mark Wielaard <mark@klomp.org>
194 lines
5.8 KiB
C
194 lines
5.8 KiB
C
/* Create new ELF program header table.
|
|
Copyright (C) 1999-2010, 2014, 2015 Red Hat, Inc.
|
|
This file is part of elfutils.
|
|
Written by Ulrich Drepper <drepper@redhat.com>, 1998.
|
|
|
|
This file is free software; you can redistribute it and/or modify
|
|
it under the terms of either
|
|
|
|
* the GNU Lesser General Public License as published by the Free
|
|
Software Foundation; either version 3 of the License, or (at
|
|
your option) any later version
|
|
|
|
or
|
|
|
|
* the GNU General Public License as published by the Free
|
|
Software Foundation; either version 2 of the License, or (at
|
|
your option) any later version
|
|
|
|
or both in parallel, as here.
|
|
|
|
elfutils is distributed in the hope that it will be useful, but
|
|
WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
General Public License for more details.
|
|
|
|
You should have received copies of the GNU General Public License and
|
|
the GNU Lesser General Public License along with this program. If
|
|
not, see <http://www.gnu.org/licenses/>. */
|
|
|
|
#ifdef HAVE_CONFIG_H
|
|
# include <config.h>
|
|
#endif
|
|
|
|
#include <assert.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#include "libelfP.h"
|
|
|
|
#ifndef LIBELFBITS
|
|
# define LIBELFBITS 32
|
|
#endif
|
|
|
|
|
|
ElfW2(LIBELFBITS,Phdr) *
|
|
elfw2(LIBELFBITS,newphdr) (Elf *elf, size_t count)
|
|
{
|
|
ElfW2(LIBELFBITS,Phdr) *result;
|
|
|
|
if (elf == NULL)
|
|
return NULL;
|
|
|
|
if (unlikely (elf->kind != ELF_K_ELF))
|
|
{
|
|
__libelf_seterrno (ELF_E_INVALID_HANDLE);
|
|
return NULL;
|
|
}
|
|
|
|
/* This check is correct, it is for sh_info, which is either
|
|
Elf32_Word or Elf64_Word, both being 32 bits. But count is size_t
|
|
so might not fit on 32bit ELF files. */
|
|
if (unlikely ((ElfW2(LIBELFBITS,Word)) count != count))
|
|
{
|
|
__libelf_seterrno (ELF_E_INVALID_OPERAND);
|
|
return NULL;
|
|
}
|
|
|
|
rwlock_wrlock (elf->lock);
|
|
|
|
if (elf->class == 0)
|
|
elf->class = ELFW(ELFCLASS,LIBELFBITS);
|
|
else if (unlikely (elf->class != ELFW(ELFCLASS,LIBELFBITS)))
|
|
{
|
|
__libelf_seterrno (ELF_E_INVALID_CLASS);
|
|
result = NULL;
|
|
goto out;
|
|
}
|
|
|
|
if (unlikely (elf->state.ELFW(elf,LIBELFBITS).ehdr == NULL))
|
|
{
|
|
__libelf_seterrno (ELF_E_WRONG_ORDER_EHDR);
|
|
result = NULL;
|
|
goto out;
|
|
}
|
|
|
|
/* A COUNT of zero means remove existing table. */
|
|
if (count == 0)
|
|
{
|
|
/* Free the old program header. */
|
|
if (elf->state.ELFW(elf,LIBELFBITS).phdr != NULL)
|
|
{
|
|
if (elf->state.ELFW(elf,LIBELFBITS).phdr_flags & ELF_F_MALLOCED)
|
|
free (elf->state.ELFW(elf,LIBELFBITS).phdr);
|
|
|
|
/* Set the pointer to NULL. */
|
|
elf->state.ELFW(elf,LIBELFBITS).phdr = NULL;
|
|
/* Set the `e_phnum' member to the new value. */
|
|
elf->state.ELFW(elf,LIBELFBITS).ehdr->e_phnum = 0;
|
|
/* Also clear any old PN_XNUM extended value. */
|
|
if (elf->state.ELFW(elf,LIBELFBITS).scns.cnt > 0)
|
|
elf->state.ELFW(elf,LIBELFBITS).scns.data[0]
|
|
.shdr.ELFW(e,LIBELFBITS)->sh_info = 0;
|
|
/* Also set the size. */
|
|
elf->state.ELFW(elf,LIBELFBITS).ehdr->e_phentsize =
|
|
sizeof (ElfW2(LIBELFBITS,Phdr));
|
|
|
|
elf->state.ELFW(elf,LIBELFBITS).phdr_flags |= ELF_F_DIRTY;
|
|
elf->flags |= ELF_F_DIRTY;
|
|
__libelf_seterrno (ELF_E_NOERROR);
|
|
}
|
|
|
|
result = NULL;
|
|
}
|
|
else if (elf->state.ELFW(elf,LIBELFBITS).ehdr->e_phnum != count
|
|
|| count == PN_XNUM
|
|
|| elf->state.ELFW(elf,LIBELFBITS).phdr == NULL)
|
|
{
|
|
if (unlikely (count > SIZE_MAX / sizeof (ElfW2(LIBELFBITS,Phdr))))
|
|
{
|
|
__libelf_seterrno (ELF_E_INVALID_INDEX);
|
|
result = NULL;
|
|
goto out;
|
|
}
|
|
|
|
Elf_Scn *scn0 = &elf->state.ELFW(elf,LIBELFBITS).scns.data[0];
|
|
if (unlikely (count >= PN_XNUM && scn0->shdr.ELFW(e,LIBELFBITS) == NULL))
|
|
{
|
|
/* Something is wrong with section zero, but we need it to write
|
|
the extended phdr count. */
|
|
__libelf_seterrno (ELF_E_INVALID_SECTION_HEADER);
|
|
result = NULL;
|
|
goto out;
|
|
}
|
|
|
|
/* Allocate a new program header with the appropriate number of
|
|
elements. */
|
|
result = (ElfW2(LIBELFBITS,Phdr) *)
|
|
realloc (elf->state.ELFW(elf,LIBELFBITS).phdr,
|
|
count * sizeof (ElfW2(LIBELFBITS,Phdr)));
|
|
if (result == NULL)
|
|
__libelf_seterrno (ELF_E_NOMEM);
|
|
else
|
|
{
|
|
/* Now set the result. */
|
|
elf->state.ELFW(elf,LIBELFBITS).phdr = result;
|
|
if (count >= PN_XNUM)
|
|
{
|
|
/* We have to write COUNT into the zeroth section's sh_info. */
|
|
if (elf->state.ELFW(elf,LIBELFBITS).scns.cnt == 0)
|
|
{
|
|
assert (elf->state.ELFW(elf,LIBELFBITS).scns.max > 0);
|
|
elf->state.ELFW(elf,LIBELFBITS).scns.cnt = 1;
|
|
}
|
|
scn0->shdr.ELFW(e,LIBELFBITS)->sh_info = count;
|
|
scn0->shdr_flags |= ELF_F_DIRTY;
|
|
elf->state.ELFW(elf,LIBELFBITS).ehdr->e_phnum = PN_XNUM;
|
|
}
|
|
else
|
|
/* Set the `e_phnum' member to the new value. */
|
|
elf->state.ELFW(elf,LIBELFBITS).ehdr->e_phnum = count;
|
|
/* Clear the whole memory. */
|
|
memset (result, '\0', count * sizeof (ElfW2(LIBELFBITS,Phdr)));
|
|
/* Also set the size. */
|
|
elf->state.ELFW(elf,LIBELFBITS).ehdr->e_phentsize =
|
|
elf_typesize (LIBELFBITS, ELF_T_PHDR, 1);
|
|
/* Remember we allocated the array and mark the structure is
|
|
modified. */
|
|
elf->state.ELFW(elf,LIBELFBITS).phdr_flags |=
|
|
ELF_F_DIRTY | ELF_F_MALLOCED;
|
|
/* We have to rewrite the entire file if the size of the
|
|
program header is changed. */
|
|
elf->flags |= ELF_F_DIRTY;
|
|
}
|
|
}
|
|
else
|
|
{
|
|
/* We have the same number of entries. Just clear the array. */
|
|
assert (elf->state.ELFW(elf,LIBELFBITS).ehdr->e_phentsize
|
|
== elf_typesize (LIBELFBITS, ELF_T_PHDR, 1));
|
|
|
|
/* Mark the structure as modified. */
|
|
elf->state.ELFW(elf,LIBELFBITS).phdr_flags |= ELF_F_DIRTY;
|
|
|
|
result = elf->state.ELFW(elf,LIBELFBITS).phdr;
|
|
memset (result, '\0', count * sizeof (ElfW2(LIBELFBITS,Phdr)));
|
|
}
|
|
|
|
out:
|
|
rwlock_unlock (elf->lock);
|
|
|
|
return result;
|
|
}
|
|
INTDEF(elfw2(LIBELFBITS,newphdr))
|