/src/elfutils/libelf/elf_nextscn.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* Get next section. |
2 | | Copyright (C) 1998, 1999, 2000, 2001, 2002, 2015 Red Hat, Inc. |
3 | | This file is part of elfutils. |
4 | | Contributed by Ulrich Drepper <drepper@redhat.com>, 1998. |
5 | | |
6 | | This file is free software; you can redistribute it and/or modify |
7 | | it under the terms of either |
8 | | |
9 | | * the GNU Lesser General Public License as published by the Free |
10 | | Software Foundation; either version 3 of the License, or (at |
11 | | your option) any later version |
12 | | |
13 | | or |
14 | | |
15 | | * the GNU General Public License as published by the Free |
16 | | Software Foundation; either version 2 of the License, or (at |
17 | | your option) any later version |
18 | | |
19 | | or both in parallel, as here. |
20 | | |
21 | | elfutils is distributed in the hope that it will be useful, but |
22 | | WITHOUT ANY WARRANTY; without even the implied warranty of |
23 | | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU |
24 | | General Public License for more details. |
25 | | |
26 | | You should have received copies of the GNU General Public License and |
27 | | the GNU Lesser General Public License along with this program. If |
28 | | not, see <http://www.gnu.org/licenses/>. */ |
29 | | |
30 | | #ifdef HAVE_CONFIG_H |
31 | | # include <config.h> |
32 | | #endif |
33 | | |
34 | | #include <assert.h> |
35 | | #include <libelf.h> |
36 | | #include <stddef.h> |
37 | | |
38 | | #include "libelfP.h" |
39 | | |
40 | | |
41 | | Elf_Scn * |
42 | | elf_nextscn (Elf *elf, Elf_Scn *scn) |
43 | 5.18k | { |
44 | 5.18k | Elf_ScnList *list; |
45 | 5.18k | Elf_Scn *result = NULL; |
46 | | |
47 | 5.18k | if (elf == NULL) |
48 | 0 | return NULL; |
49 | | |
50 | 5.18k | rwlock_rdlock (elf->lock); |
51 | | |
52 | 5.18k | if (scn == NULL) |
53 | 78 | { |
54 | | /* If no section handle is given return the first (not 0th) section. |
55 | | Set scn to the 0th section and perform nextscn. */ |
56 | 78 | if (elf->class == ELFCLASS32 |
57 | 78 | || (offsetof (Elf, state.elf32.scns) |
58 | 48 | == offsetof (Elf, state.elf64.scns))) |
59 | 78 | list = &elf->state.elf32.scns; |
60 | 0 | else |
61 | 0 | list = &elf->state.elf64.scns; |
62 | | |
63 | 78 | scn = &list->data[0]; |
64 | 78 | } |
65 | 5.10k | else |
66 | 5.10k | list = scn->list; |
67 | | |
68 | 5.18k | if (scn + 1 < &list->data[list->cnt]) |
69 | 5.15k | result = scn + 1; |
70 | 33 | else if (scn + 1 == &list->data[list->max] |
71 | 33 | && (list = list->next) != NULL) |
72 | 0 | { |
73 | | /* If there is another element in the section list it must |
74 | | have at least one entry. */ |
75 | 0 | assert (list->cnt > 0); |
76 | 0 | result = &list->data[0]; |
77 | 0 | } |
78 | | |
79 | 5.18k | rwlock_unlock (elf->lock); |
80 | | |
81 | 5.18k | return result; |
82 | 5.18k | } |
83 | | INTDEF(elf_nextscn) |