1 /* Create new ELF program header table. 2 Copyright (C) 1999-2010 Red Hat, Inc. 3 This file is part of Red Hat elfutils. 4 Written by Ulrich Drepper <drepper (at) redhat.com>, 1998. 5 6 Red Hat elfutils is free software; you can redistribute it and/or modify 7 it under the terms of the GNU General Public License as published by the 8 Free Software Foundation; version 2 of the License. 9 10 Red Hat elfutils is distributed in the hope that it will be useful, but 11 WITHOUT ANY WARRANTY; without even the implied warranty of 12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 13 General Public License for more details. 14 15 You should have received a copy of the GNU General Public License along 16 with Red Hat elfutils; if not, write to the Free Software Foundation, 17 Inc., 51 Franklin Street, Fifth Floor, Boston MA 02110-1301 USA. 18 19 In addition, as a special exception, Red Hat, Inc. gives You the 20 additional right to link the code of Red Hat elfutils with code licensed 21 under any Open Source Initiative certified open source license 22 (http://www.opensource.org/licenses/index.php) which requires the 23 distribution of source code with any binary distribution and to 24 distribute linked combinations of the two. Non-GPL Code permitted under 25 this exception must only link to the code of Red Hat elfutils through 26 those well defined interfaces identified in the file named EXCEPTION 27 found in the source code files (the "Approved Interfaces"). The files 28 of Non-GPL Code may instantiate templates or use macros or inline 29 functions from the Approved Interfaces without causing the resulting 30 work to be covered by the GNU General Public License. Only Red Hat, 31 Inc. may make changes or additions to the list of Approved Interfaces. 32 Red Hat's grant of this exception is conditioned upon your not adding 33 any new exceptions. If you wish to add a new Approved Interface or 34 exception, please contact Red Hat. You must obey the GNU General Public 35 License in all respects for all of the Red Hat elfutils code and other 36 code used in conjunction with Red Hat elfutils except the Non-GPL Code 37 covered by this exception. If you modify this file, you may extend this 38 exception to your version of the file, but you are not obligated to do 39 so. If you do not wish to provide this exception without modification, 40 you must delete this exception statement from your version and license 41 this file solely under the GPL without exception. 42 43 Red Hat elfutils is an included package of the Open Invention Network. 44 An included package of the Open Invention Network is a package for which 45 Open Invention Network licensees cross-license their patents. No patent 46 license is granted, either expressly or impliedly, by designation as an 47 included package. Should you wish to participate in the Open Invention 48 Network licensing program, please visit www.openinventionnetwork.com 49 <http://www.openinventionnetwork.com>. */ 50 51 #ifdef HAVE_CONFIG_H 52 # include <config.h> 53 #endif 54 55 #include <assert.h> 56 #include <stdlib.h> 57 #include <string.h> 58 59 #include "libelfP.h" 60 61 #ifndef LIBELFBITS 62 # define LIBELFBITS 32 63 #endif 64 65 66 ElfW2(LIBELFBITS,Phdr) * 67 elfw2(LIBELFBITS,newphdr) (elf, count) 68 Elf *elf; 69 size_t count; 70 { 71 ElfW2(LIBELFBITS,Phdr) *result; 72 73 if (elf == NULL) 74 return NULL; 75 76 if (unlikely (elf->kind != ELF_K_ELF)) 77 { 78 __libelf_seterrno (ELF_E_INVALID_HANDLE); 79 return NULL; 80 } 81 82 if (unlikely ((ElfW2(LIBELFBITS,Word)) count != count)) 83 { 84 __libelf_seterrno (ELF_E_INVALID_OPERAND); 85 return NULL; 86 } 87 88 rwlock_wrlock (elf->lock); 89 90 if (elf->class == 0) 91 elf->class = ELFW(ELFCLASS,LIBELFBITS); 92 else if (unlikely (elf->class != ELFW(ELFCLASS,LIBELFBITS))) 93 { 94 __libelf_seterrno (ELF_E_INVALID_CLASS); 95 result = NULL; 96 goto out; 97 } 98 99 if (unlikely (elf->state.ELFW(elf,LIBELFBITS).ehdr == NULL)) 100 { 101 __libelf_seterrno (ELF_E_WRONG_ORDER_EHDR); 102 result = NULL; 103 goto out; 104 } 105 106 /* A COUNT of zero means remove existing table. */ 107 if (count == 0) 108 { 109 /* Free the old program header. */ 110 if (elf->state.ELFW(elf,LIBELFBITS).phdr != NULL) 111 { 112 if (elf->state.ELFW(elf,LIBELFBITS).phdr_flags & ELF_F_MALLOCED) 113 free (elf->state.ELFW(elf,LIBELFBITS).phdr); 114 115 /* Set the pointer to NULL. */ 116 elf->state.ELFW(elf,LIBELFBITS).phdr = NULL; 117 /* Set the `e_phnum' member to the new value. */ 118 elf->state.ELFW(elf,LIBELFBITS).ehdr->e_phnum = 0; 119 /* Also clear any old PN_XNUM extended value. */ 120 if (elf->state.ELFW(elf,LIBELFBITS).scns.cnt > 0) 121 elf->state.ELFW(elf,LIBELFBITS).scns.data[0] 122 .shdr.ELFW(e,LIBELFBITS)->sh_info = 0; 123 /* Also set the size. */ 124 elf->state.ELFW(elf,LIBELFBITS).ehdr->e_phentsize = 125 sizeof (ElfW2(LIBELFBITS,Phdr)); 126 127 elf->state.ELFW(elf,LIBELFBITS).phdr_flags |= ELF_F_DIRTY; 128 elf->flags |= ELF_F_DIRTY; 129 __libelf_seterrno (ELF_E_NOERROR); 130 } 131 132 result = NULL; 133 } 134 else if (elf->state.ELFW(elf,LIBELFBITS).ehdr->e_phnum != count 135 || count == PN_XNUM 136 || elf->state.ELFW(elf,LIBELFBITS).phdr == NULL) 137 { 138 /* Allocate a new program header with the appropriate number of 139 elements. */ 140 result = (ElfW2(LIBELFBITS,Phdr) *) 141 realloc (elf->state.ELFW(elf,LIBELFBITS).phdr, 142 count * sizeof (ElfW2(LIBELFBITS,Phdr))); 143 if (result == NULL) 144 __libelf_seterrno (ELF_E_NOMEM); 145 else 146 { 147 /* Now set the result. */ 148 elf->state.ELFW(elf,LIBELFBITS).phdr = result; 149 if (count >= PN_XNUM) 150 { 151 /* We have to write COUNT into the zeroth section's sh_info. */ 152 Elf_Scn *scn0 = &elf->state.ELFW(elf,LIBELFBITS).scns.data[0]; 153 if (elf->state.ELFW(elf,LIBELFBITS).scns.cnt == 0) 154 { 155 assert (elf->state.ELFW(elf,LIBELFBITS).scns.max > 0); 156 elf->state.ELFW(elf,LIBELFBITS).scns.cnt = 1; 157 } 158 scn0->shdr.ELFW(e,LIBELFBITS)->sh_info = count; 159 scn0->shdr_flags |= ELF_F_DIRTY; 160 elf->state.ELFW(elf,LIBELFBITS).ehdr->e_phnum = PN_XNUM; 161 } 162 else 163 /* Set the `e_phnum' member to the new value. */ 164 elf->state.ELFW(elf,LIBELFBITS).ehdr->e_phnum = count; 165 /* Clear the whole memory. */ 166 memset (result, '\0', count * sizeof (ElfW2(LIBELFBITS,Phdr))); 167 /* Also set the size. */ 168 elf->state.ELFW(elf,LIBELFBITS).ehdr->e_phentsize = 169 elf_typesize (LIBELFBITS, ELF_T_PHDR, 1); 170 /* Remember we allocated the array and mark the structure is 171 modified. */ 172 elf->state.ELFW(elf,LIBELFBITS).phdr_flags |= 173 ELF_F_DIRTY | ELF_F_MALLOCED; 174 /* We have to rewrite the entire file if the size of the 175 program header is changed. */ 176 elf->flags |= ELF_F_DIRTY; 177 } 178 } 179 else 180 { 181 /* We have the same number of entries. Just clear the array. */ 182 assert (elf->state.ELFW(elf,LIBELFBITS).ehdr->e_phentsize 183 == elf_typesize (LIBELFBITS, ELF_T_PHDR, 1)); 184 185 /* Mark the structure as modified. */ 186 elf->state.ELFW(elf,LIBELFBITS).phdr_flags |= ELF_F_DIRTY; 187 188 result = elf->state.ELFW(elf,LIBELFBITS).phdr; 189 memset (result, '\0', count * sizeof (ElfW2(LIBELFBITS,Phdr))); 190 } 191 192 out: 193 rwlock_unlock (elf->lock); 194 195 return result; 196 } 197 INTDEF(elfw2(LIBELFBITS,newphdr)) 198
