14484Sbinkertn@umich.edu/*- 24484Sbinkertn@umich.edu * Copyright (c) 2006 Joseph Koshy 34484Sbinkertn@umich.edu * All rights reserved. 44484Sbinkertn@umich.edu * 54484Sbinkertn@umich.edu * Redistribution and use in source and binary forms, with or without 64484Sbinkertn@umich.edu * modification, are permitted provided that the following conditions 74484Sbinkertn@umich.edu * are met: 84484Sbinkertn@umich.edu * 1. Redistributions of source code must retain the above copyright 94484Sbinkertn@umich.edu * notice, this list of conditions and the following disclaimer. 104484Sbinkertn@umich.edu * 2. Redistributions in binary form must reproduce the above copyright 114484Sbinkertn@umich.edu * notice, this list of conditions and the following disclaimer in the 124484Sbinkertn@umich.edu * documentation and/or other materials provided with the distribution. 134484Sbinkertn@umich.edu * 144484Sbinkertn@umich.edu * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND 154484Sbinkertn@umich.edu * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 164484Sbinkertn@umich.edu * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 174484Sbinkertn@umich.edu * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 184484Sbinkertn@umich.edu * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 194484Sbinkertn@umich.edu * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 204484Sbinkertn@umich.edu * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 214484Sbinkertn@umich.edu * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 224484Sbinkertn@umich.edu * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 234484Sbinkertn@umich.edu * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 244484Sbinkertn@umich.edu * SUCH DAMAGE. 254484Sbinkertn@umich.edu */ 264484Sbinkertn@umich.edu 274484Sbinkertn@umich.edu 284484Sbinkertn@umich.edu#include <sys/param.h> 294494Ssaidi@eecs.umich.edu#ifdef __sun 304494Ssaidi@eecs.umich.edu#include <sys/sysmacros.h> 314494Ssaidi@eecs.umich.edu#endif 324484Sbinkertn@umich.edu 334484Sbinkertn@umich.edu#include <assert.h> 344484Sbinkertn@umich.edu#include "gelf.h" 354484Sbinkertn@umich.edu 364484Sbinkertn@umich.edu#include "_libelf.h" 374484Sbinkertn@umich.edu 384484Sbinkertn@umich.edu/* 394484Sbinkertn@umich.edu * Convert an ELF section#,offset pair to a string pointer. 404484Sbinkertn@umich.edu */ 414484Sbinkertn@umich.edu 424484Sbinkertn@umich.educhar * 434484Sbinkertn@umich.eduelf_strptr(Elf *e, size_t scndx, size_t offset) 444484Sbinkertn@umich.edu{ 454484Sbinkertn@umich.edu Elf_Scn *s; 464484Sbinkertn@umich.edu Elf_Data *d; 474484Sbinkertn@umich.edu size_t alignment, count; 484484Sbinkertn@umich.edu GElf_Shdr shdr; 494484Sbinkertn@umich.edu 504484Sbinkertn@umich.edu if (e == NULL || e->e_kind != ELF_K_ELF) { 514484Sbinkertn@umich.edu LIBELF_SET_ERROR(ARGUMENT, 0); 524484Sbinkertn@umich.edu return (NULL); 534484Sbinkertn@umich.edu } 544484Sbinkertn@umich.edu 554484Sbinkertn@umich.edu if ((s = elf_getscn(e, scndx)) == NULL || 564484Sbinkertn@umich.edu gelf_getshdr(s, &shdr) == NULL) 574484Sbinkertn@umich.edu return (NULL); 584484Sbinkertn@umich.edu 594484Sbinkertn@umich.edu if (shdr.sh_type != SHT_STRTAB || 604484Sbinkertn@umich.edu offset >= shdr.sh_size) { 614484Sbinkertn@umich.edu LIBELF_SET_ERROR(ARGUMENT, 0); 624484Sbinkertn@umich.edu return (NULL); 634484Sbinkertn@umich.edu } 644484Sbinkertn@umich.edu 654484Sbinkertn@umich.edu d = NULL; 664484Sbinkertn@umich.edu if (e->e_flags & ELF_F_LAYOUT) { 674484Sbinkertn@umich.edu 684484Sbinkertn@umich.edu /* 694484Sbinkertn@umich.edu * The application is taking responsibility for the 704484Sbinkertn@umich.edu * ELF object's layout, so we can directly translate 714484Sbinkertn@umich.edu * an offset to a `char *' address using the `d_off' 724484Sbinkertn@umich.edu * members of Elf_Data descriptors. 734484Sbinkertn@umich.edu */ 744484Sbinkertn@umich.edu while ((d = elf_getdata(s, d)) != NULL) { 754484Sbinkertn@umich.edu 764484Sbinkertn@umich.edu if (d->d_buf == 0 || d->d_size == 0) 774484Sbinkertn@umich.edu continue; 784484Sbinkertn@umich.edu 794484Sbinkertn@umich.edu if (d->d_type != ELF_T_BYTE) { 804484Sbinkertn@umich.edu LIBELF_SET_ERROR(DATA, 0); 814484Sbinkertn@umich.edu return (NULL); 824484Sbinkertn@umich.edu } 834484Sbinkertn@umich.edu 844484Sbinkertn@umich.edu if (offset >= d->d_off && 854484Sbinkertn@umich.edu offset < d->d_off + d->d_size) 864484Sbinkertn@umich.edu return ((char *) d->d_buf + offset - d->d_off); 874484Sbinkertn@umich.edu } 884484Sbinkertn@umich.edu } else { 894484Sbinkertn@umich.edu /* 904484Sbinkertn@umich.edu * Otherwise, the `d_off' members are not useable and 914484Sbinkertn@umich.edu * we need to compute offsets ourselves, taking into 924484Sbinkertn@umich.edu * account 'holes' in coverage of the section introduced 934484Sbinkertn@umich.edu * by alignment requirements. 944484Sbinkertn@umich.edu */ 954484Sbinkertn@umich.edu count = (size_t) 0; /* cumulative count of bytes seen */ 964484Sbinkertn@umich.edu while ((d = elf_getdata(s, d)) != NULL && count <= offset) { 974484Sbinkertn@umich.edu 984484Sbinkertn@umich.edu if (d->d_buf == NULL || d->d_size == 0) 994484Sbinkertn@umich.edu continue; 1004484Sbinkertn@umich.edu 1014484Sbinkertn@umich.edu if (d->d_type != ELF_T_BYTE) { 1024484Sbinkertn@umich.edu LIBELF_SET_ERROR(DATA, 0); 1034484Sbinkertn@umich.edu return (NULL); 1044484Sbinkertn@umich.edu } 1054484Sbinkertn@umich.edu 1064484Sbinkertn@umich.edu if ((alignment = d->d_align) > 1) { 1074484Sbinkertn@umich.edu if ((alignment & (alignment - 1)) != 0) { 1084484Sbinkertn@umich.edu LIBELF_SET_ERROR(DATA, 0); 1094484Sbinkertn@umich.edu return (NULL); 1104484Sbinkertn@umich.edu } 1114484Sbinkertn@umich.edu count = roundup(count, alignment); 1124484Sbinkertn@umich.edu } 1134484Sbinkertn@umich.edu 1144484Sbinkertn@umich.edu if (offset < count) { 1154484Sbinkertn@umich.edu /* offset starts in the 'hole' */ 1164484Sbinkertn@umich.edu LIBELF_SET_ERROR(ARGUMENT, 0); 1174484Sbinkertn@umich.edu return (NULL); 1184484Sbinkertn@umich.edu } 1194484Sbinkertn@umich.edu 1204484Sbinkertn@umich.edu if (offset < count + d->d_size) { 1214484Sbinkertn@umich.edu if (d->d_buf != NULL) 1224484Sbinkertn@umich.edu return ((char *) d->d_buf + 1234484Sbinkertn@umich.edu offset - count); 1244484Sbinkertn@umich.edu LIBELF_SET_ERROR(DATA, 0); 1254484Sbinkertn@umich.edu return (NULL); 1264484Sbinkertn@umich.edu } 1274484Sbinkertn@umich.edu 1284484Sbinkertn@umich.edu count += d->d_size; 1294484Sbinkertn@umich.edu } 1304484Sbinkertn@umich.edu } 1314484Sbinkertn@umich.edu 1324484Sbinkertn@umich.edu LIBELF_SET_ERROR(ARGUMENT, 0); 1334484Sbinkertn@umich.edu return (NULL); 1344484Sbinkertn@umich.edu} 135