Nathan Binkert | 4f0f217 | 2007-05-26 18:15:22 -0700 | [diff] [blame] | 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 | |
| 28 | #include "libelf.h" |
| 29 | |
| 30 | #include "_libelf.h" |
| 31 | |
| 32 | char * |
| 33 | elf_rawfile(Elf *e, size_t *sz) |
| 34 | { |
| 35 | char *ptr; |
| 36 | size_t size; |
| 37 | |
| 38 | size = e ? e->e_rawsize : 0; |
| 39 | ptr = NULL; |
| 40 | |
| 41 | if (e == NULL) |
| 42 | LIBELF_SET_ERROR(ARGUMENT, 0); |
| 43 | else if ((ptr = e->e_rawfile) == NULL && e->e_cmd == ELF_C_WRITE) |
| 44 | LIBELF_SET_ERROR(SEQUENCE, 0); |
| 45 | |
| 46 | if (sz) |
| 47 | *sz = size; |
| 48 | |
| 49 | return (ptr); |
| 50 | } |