elf_data.c revision 210324
1/*- 2 * Copyright (c) 2006 Joseph Koshy 3 * All rights reserved. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 1. Redistributions of source code must retain the above copyright 9 * notice, this list of conditions and the following disclaimer. 10 * 2. Redistributions in binary form must reproduce the above copyright 11 * notice, this list of conditions and the following disclaimer in the 12 * documentation and/or other materials provided with the distribution. 13 * 14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 24 * SUCH DAMAGE. 25 */ 26 27#include <sys/cdefs.h> 28__FBSDID("$FreeBSD: head/lib/libelf/elf_data.c 210324 2010-07-21 08:54:46Z kaiw $"); 29 30#include <assert.h> 31#include <errno.h> 32#include <libelf.h> 33#include <stdlib.h> 34 35#include "_libelf.h" 36 37 38Elf_Data * 39elf_getdata(Elf_Scn *s, Elf_Data *d) 40{ 41 Elf *e; 42 size_t fsz, msz, count; 43 int elfclass, elftype; 44 unsigned int sh_type; 45 uint64_t sh_align, sh_offset, sh_size; 46 void (*xlate)(char *_d, char *_s, size_t _c, int _swap); 47 48 if (s == NULL || (e = s->s_elf) == NULL || e->e_kind != ELF_K_ELF || 49 (d != NULL && s != d->d_scn)) { 50 LIBELF_SET_ERROR(ARGUMENT, 0); 51 return (NULL); 52 } 53 54 if (d == NULL && (d = STAILQ_FIRST(&s->s_data)) != NULL) 55 return (d); 56 57 if (d != NULL) 58 return (STAILQ_NEXT(d, d_next)); 59 60 if (e->e_rawfile == NULL) { 61 LIBELF_SET_ERROR(SEQUENCE, 0); 62 return (NULL); 63 } 64 65 elfclass = e->e_class; 66 67 assert(elfclass == ELFCLASS32 || elfclass == ELFCLASS64); 68 69 if (elfclass == ELFCLASS32) { 70 sh_type = s->s_shdr.s_shdr32.sh_type; 71 sh_offset = (uint64_t) s->s_shdr.s_shdr32.sh_offset; 72 sh_size = (uint64_t) s->s_shdr.s_shdr32.sh_size; 73 sh_align = (uint64_t) s->s_shdr.s_shdr32.sh_addralign; 74 } else { 75 sh_type = s->s_shdr.s_shdr64.sh_type; 76 sh_offset = s->s_shdr.s_shdr64.sh_offset; 77 sh_size = s->s_shdr.s_shdr64.sh_size; 78 sh_align = s->s_shdr.s_shdr64.sh_addralign; 79 } 80 81 if (sh_type == SHT_NULL) 82 return (NULL); 83 84 if ((elftype = _libelf_xlate_shtype(sh_type)) < ELF_T_FIRST || 85 elftype > ELF_T_LAST || (sh_type != SHT_NOBITS && 86 sh_offset + sh_size > (uint64_t) e->e_rawsize)) { 87 LIBELF_SET_ERROR(SECTION, 0); 88 return (NULL); 89 } 90 91 if ((fsz = (elfclass == ELFCLASS32 ? elf32_fsize : elf64_fsize) 92 (elftype, (size_t) 1, e->e_version)) == 0) { 93 LIBELF_SET_ERROR(UNIMPL, 0); 94 return (NULL); 95 } 96 97 if (sh_size % fsz) { 98 LIBELF_SET_ERROR(SECTION, 0); 99 return (NULL); 100 } 101 102 count = sh_size / fsz; 103 104 msz = _libelf_msize(elftype, elfclass, e->e_version); 105 106 assert(msz > 0); 107 108 if ((d = _libelf_allocate_data(s)) == NULL) 109 return (NULL); 110 111 d->d_buf = NULL; 112 d->d_off = 0; 113 d->d_align = sh_align; 114 d->d_size = msz * count; 115 d->d_type = elftype; 116 d->d_version = e->e_version; 117 118 if (sh_type == SHT_NOBITS) 119 return (d); 120 121 if ((d->d_buf = malloc(msz*count)) == NULL) { 122 (void) _libelf_release_data(d); 123 LIBELF_SET_ERROR(RESOURCE, 0); 124 return (NULL); 125 } 126 127 d->d_flags |= LIBELF_F_MALLOCED; 128 STAILQ_INSERT_TAIL(&s->s_data, d, d_next); 129 130 xlate = _libelf_get_translator(elftype, ELF_TOMEMORY, elfclass); 131 (*xlate)(d->d_buf, e->e_rawfile + sh_offset, count, e->e_byteorder != 132 LIBELF_PRIVATE(byteorder)); 133 134 return (d); 135} 136 137Elf_Data * 138elf_newdata(Elf_Scn *s) 139{ 140 Elf *e; 141 Elf_Data *d; 142 143 if (s == NULL || (e = s->s_elf) == NULL || 144 e->e_kind != ELF_K_ELF) { 145 LIBELF_SET_ERROR(ARGUMENT, 0); 146 return (NULL); 147 } 148 149 /* 150 * elf_newdata() has to append a data descriptor, so 151 * bring in existing section data if not already present. 152 */ 153 if (e->e_rawfile && s->s_size > 0 && STAILQ_EMPTY(&s->s_data)) 154 if (elf_getdata(s, NULL) == NULL) 155 return (NULL); 156 157 if ((d = _libelf_allocate_data(s)) == NULL) 158 return (NULL); 159 160 STAILQ_INSERT_TAIL(&s->s_data, d, d_next); 161 162 d->d_align = 1; 163 d->d_buf = NULL; 164 d->d_off = (uint64_t) ~0; 165 d->d_size = 0; 166 d->d_type = ELF_T_BYTE; 167 d->d_version = LIBELF_PRIVATE(version); 168 169 (void) elf_flagscn(s, ELF_C_SET, ELF_F_DIRTY); 170 171 return (d); 172} 173 174/* 175 * Retrieve a data descriptor for raw (untranslated) data for section 176 * `s'. 177 */ 178 179Elf_Data * 180elf_rawdata(Elf_Scn *s, Elf_Data *d) 181{ 182 Elf *e; 183 int elf_class; 184 uint32_t sh_type; 185 uint64_t sh_align, sh_offset, sh_size; 186 187 if (s == NULL || (e = s->s_elf) == NULL || 188 e->e_kind != ELF_K_ELF || e->e_rawfile == NULL) { 189 LIBELF_SET_ERROR(ARGUMENT, 0); 190 return (NULL); 191 } 192 193 if (d == NULL && (d = STAILQ_FIRST(&s->s_rawdata)) != NULL) 194 return (d); 195 196 if (d != NULL) 197 return (STAILQ_NEXT(d, d_next)); 198 199 elf_class = e->e_class; 200 201 assert(elf_class == ELFCLASS32 || elf_class == ELFCLASS64); 202 203 if (elf_class == ELFCLASS32) { 204 sh_type = s->s_shdr.s_shdr32.sh_type; 205 sh_offset = (uint64_t) s->s_shdr.s_shdr32.sh_offset; 206 sh_size = (uint64_t) s->s_shdr.s_shdr32.sh_size; 207 sh_align = (uint64_t) s->s_shdr.s_shdr32.sh_addralign; 208 } else { 209 sh_type = s->s_shdr.s_shdr64.sh_type; 210 sh_offset = s->s_shdr.s_shdr64.sh_offset; 211 sh_size = s->s_shdr.s_shdr64.sh_size; 212 sh_align = s->s_shdr.s_shdr64.sh_addralign; 213 } 214 215 if (sh_type == SHT_NULL) 216 return (NULL); 217 218 if ((d = _libelf_allocate_data(s)) == NULL) 219 return (NULL); 220 221 d->d_buf = sh_type == SHT_NOBITS ? NULL : e->e_rawfile + sh_offset; 222 d->d_off = 0; 223 d->d_align = sh_align; 224 d->d_size = sh_size; 225 d->d_type = ELF_T_BYTE; 226 d->d_version = e->e_version; 227 228 STAILQ_INSERT_TAIL(&s->s_rawdata, d, d_next); 229 230 return (d); 231} 232