/src/elfutils/libelf/gelf_update_rela.c
Line | Count | Source (jump to first uncovered line) |
1 | | /* Update RELA relocation information at given index. |
2 | | Copyright (C) 2000, 2001, 2002, 2005, 2009, 2014 Red Hat, Inc. |
3 | | This file is part of elfutils. |
4 | | Written by Ulrich Drepper <drepper@redhat.com>, 2000. |
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 <gelf.h> |
35 | | #include <stdlib.h> |
36 | | |
37 | | #include "libelfP.h" |
38 | | |
39 | | |
40 | | int |
41 | | gelf_update_rela (Elf_Data *dst, int ndx, GElf_Rela *src) |
42 | 0 | { |
43 | 0 | Elf_Data_Scn *data_scn = (Elf_Data_Scn *) dst; |
44 | 0 | Elf_Scn *scn; |
45 | 0 | int result = 0; |
46 | |
|
47 | 0 | if (dst == NULL) |
48 | 0 | return 0; |
49 | | |
50 | 0 | if (unlikely (data_scn->d.d_type != ELF_T_RELA)) |
51 | 0 | { |
52 | | /* The type of the data better should match. */ |
53 | 0 | __libelf_seterrno (ELF_E_DATA_MISMATCH); |
54 | 0 | return 0; |
55 | 0 | } |
56 | | |
57 | 0 | scn = data_scn->s; |
58 | 0 | rwlock_wrlock (scn->elf->lock); |
59 | |
|
60 | 0 | if (scn->elf->class == ELFCLASS32) |
61 | 0 | { |
62 | 0 | Elf32_Rela *rel; |
63 | | |
64 | | /* There is the possibility that the values in the input are |
65 | | too large. */ |
66 | 0 | if (unlikely (src->r_offset > 0xffffffffull) |
67 | 0 | || unlikely (GELF_R_SYM (src->r_info) > 0xffffff) |
68 | 0 | || unlikely (GELF_R_TYPE (src->r_info) > 0xff) |
69 | 0 | || unlikely (src->r_addend < -0x80000000ll) |
70 | 0 | || unlikely (src->r_addend > 0x7fffffffll)) |
71 | 0 | { |
72 | 0 | __libelf_seterrno (ELF_E_INVALID_DATA); |
73 | 0 | goto out; |
74 | 0 | } |
75 | | |
76 | | /* Check whether we have to resize the data buffer. */ |
77 | 0 | if (INVALID_NDX (ndx, Elf32_Rela, &data_scn->d)) |
78 | 0 | { |
79 | 0 | __libelf_seterrno (ELF_E_INVALID_INDEX); |
80 | 0 | goto out; |
81 | 0 | } |
82 | | |
83 | 0 | rel = &((Elf32_Rela *) data_scn->d.d_buf)[ndx]; |
84 | |
|
85 | 0 | rel->r_offset = src->r_offset; |
86 | 0 | rel->r_info = ELF32_R_INFO (GELF_R_SYM (src->r_info), |
87 | 0 | GELF_R_TYPE (src->r_info)); |
88 | 0 | rel->r_addend = src->r_addend; |
89 | 0 | } |
90 | 0 | else |
91 | 0 | { |
92 | | /* Check whether we have to resize the data buffer. */ |
93 | 0 | if (INVALID_NDX (ndx, Elf64_Rela, &data_scn->d)) |
94 | 0 | { |
95 | 0 | __libelf_seterrno (ELF_E_INVALID_INDEX); |
96 | 0 | goto out; |
97 | 0 | } |
98 | | |
99 | 0 | ((Elf64_Rela *) data_scn->d.d_buf)[ndx] = *src; |
100 | 0 | } |
101 | | |
102 | 0 | result = 1; |
103 | | |
104 | | /* Mark the section as modified. */ |
105 | 0 | scn->flags |= ELF_F_DIRTY; |
106 | |
|
107 | 0 | out: |
108 | 0 | rwlock_unlock (scn->elf->lock); |
109 | |
|
110 | 0 | return result; |
111 | 0 | } |