| File: | src/lib/libelf/elf_end.c |
| Warning: | line 71, column 6 Value stored to 'scn' is never read |
Press '?' to see keyboard shortcuts
Keyboard shortcuts:
| 1 | /*- |
| 2 | * Copyright (c) 2006,2008-2009,2011 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 <assert.h> |
| 28 | #include <libelf.h> |
| 29 | #include <stdlib.h> |
| 30 | |
| 31 | #include "_libelf.h" |
| 32 | |
| 33 | #if ELFTC_HAVE_MMAP1 |
| 34 | #include <sys/mman.h> |
| 35 | #endif |
| 36 | |
| 37 | ELFTC_VCSID("$Id: elf_end.c,v 1.3 2020/05/18 06:46:23 jsg Exp $"); |
| 38 | |
| 39 | int |
| 40 | elf_end(Elf *e) |
| 41 | { |
| 42 | Elf *sv; |
| 43 | Elf_Scn *scn, *tscn; |
| 44 | |
| 45 | if (e == NULL((void *)0) || e->e_activations == 0) |
| 46 | return (0); |
| 47 | |
| 48 | if (--e->e_activations > 0) |
| 49 | return (e->e_activations); |
| 50 | |
| 51 | assert(e->e_activations == 0)((e->e_activations == 0) ? (void)0 : __assert2("/usr/src/lib/libelf/elf_end.c" , 51, __func__, "e->e_activations == 0")); |
| 52 | |
| 53 | while (e && e->e_activations == 0) { |
| 54 | switch (e->e_kind) { |
| 55 | case ELF_K_AR: |
| 56 | /* |
| 57 | * If we still have open child descriptors, we |
| 58 | * need to defer reclaiming resources till all |
| 59 | * the child descriptors for the archive are |
| 60 | * closed. |
| 61 | */ |
| 62 | if (e->e_u.e_ar.e_nchildren > 0) |
| 63 | return (0); |
| 64 | break; |
| 65 | case ELF_K_ELF: |
| 66 | /* |
| 67 | * Reclaim all section descriptors. |
| 68 | */ |
| 69 | STAILQ_FOREACH_SAFE(scn, &e->e_u.e_elf.e_scn, s_next,for ((scn) = ((&e->e_u.e_elf.e_scn)->stqh_first); ( scn) && ((tscn) = ((scn)->s_next.stqe_next), 1); ( scn) = (tscn)) |
| 70 | tscn)for ((scn) = ((&e->e_u.e_elf.e_scn)->stqh_first); ( scn) && ((tscn) = ((scn)->s_next.stqe_next), 1); ( scn) = (tscn)) |
| 71 | scn = _libelf_release_scn(scn); |
Value stored to 'scn' is never read | |
| 72 | break; |
| 73 | case ELF_K_NUM: |
| 74 | assert(0)((0) ? (void)0 : __assert2("/usr/src/lib/libelf/elf_end.c", 74 , __func__, "0")); |
| 75 | default: |
| 76 | break; |
| 77 | } |
| 78 | |
| 79 | if (e->e_rawfile) { |
| 80 | if (e->e_flags & LIBELF_F_RAWFILE_MALLOC0x080000U) |
| 81 | free(e->e_rawfile); |
| 82 | #if ELFTC_HAVE_MMAP1 |
| 83 | else if (e->e_flags & LIBELF_F_RAWFILE_MMAP0x100000U) |
| 84 | (void) munmap(e->e_rawfile, (size_t) e->e_rawsize); |
| 85 | #endif |
| 86 | } |
| 87 | |
| 88 | sv = e; |
| 89 | if ((e = e->e_parent) != NULL((void *)0)) |
| 90 | e->e_u.e_ar.e_nchildren--; |
| 91 | _libelf_release_elf(sv); |
| 92 | } |
| 93 | |
| 94 | return (0); |
| 95 | } |