Loading...
1/*
2 * This program is free software; you can redistribute it and/or modify
3 * it under the terms of the GNU General Public License as published by
4 * the Free Software Foundation; either version 2 of the License, or
5 * (at your option) any later version.
6 *
7 * This program is distributed in the hope that it will be useful,
8 * but WITHOUT ANY WARRANTY; without even the implied warranty of
9 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
10 * GNU General Public License for more details.
11 *
12 * You should have received a copy of the GNU General Public License
13 * along with this program; if not, write to the Free Software
14 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
15 *
16 * Copyright (C) 2001 Rusty Russell.
17 * Copyright (C) 2003, 2004 Ralf Baechle (ralf@linux-mips.org)
18 * Copyright (C) 2005 Thiemo Seufer
19 */
20
21#undef DEBUG
22
23#include <linux/extable.h>
24#include <linux/moduleloader.h>
25#include <linux/elf.h>
26#include <linux/mm.h>
27#include <linux/numa.h>
28#include <linux/vmalloc.h>
29#include <linux/slab.h>
30#include <linux/fs.h>
31#include <linux/string.h>
32#include <linux/kernel.h>
33#include <linux/spinlock.h>
34#include <linux/jump_label.h>
35
36#include <asm/pgtable.h> /* MODULE_START */
37
38struct mips_hi16 {
39 struct mips_hi16 *next;
40 Elf_Addr *addr;
41 Elf_Addr value;
42};
43
44static LIST_HEAD(dbe_list);
45static DEFINE_SPINLOCK(dbe_lock);
46
47#ifdef MODULE_START
48void *module_alloc(unsigned long size)
49{
50 return __vmalloc_node_range(size, 1, MODULE_START, MODULE_END,
51 GFP_KERNEL, PAGE_KERNEL, 0, NUMA_NO_NODE,
52 __builtin_return_address(0));
53}
54#endif
55
56int apply_r_mips_none(struct module *me, u32 *location, Elf_Addr v)
57{
58 return 0;
59}
60
61static int apply_r_mips_32_rel(struct module *me, u32 *location, Elf_Addr v)
62{
63 *location += v;
64
65 return 0;
66}
67
68static int apply_r_mips_26_rel(struct module *me, u32 *location, Elf_Addr v)
69{
70 if (v % 4) {
71 pr_err("module %s: dangerous R_MIPS_26 REL relocation\n",
72 me->name);
73 return -ENOEXEC;
74 }
75
76 if ((v & 0xf0000000) != (((unsigned long)location + 4) & 0xf0000000)) {
77 pr_err("module %s: relocation overflow\n",
78 me->name);
79 return -ENOEXEC;
80 }
81
82 *location = (*location & ~0x03ffffff) |
83 ((*location + (v >> 2)) & 0x03ffffff);
84
85 return 0;
86}
87
88static int apply_r_mips_hi16_rel(struct module *me, u32 *location, Elf_Addr v)
89{
90 struct mips_hi16 *n;
91
92 /*
93 * We cannot relocate this one now because we don't know the value of
94 * the carry we need to add. Save the information, and let LO16 do the
95 * actual relocation.
96 */
97 n = kmalloc(sizeof *n, GFP_KERNEL);
98 if (!n)
99 return -ENOMEM;
100
101 n->addr = (Elf_Addr *)location;
102 n->value = v;
103 n->next = me->arch.r_mips_hi16_list;
104 me->arch.r_mips_hi16_list = n;
105
106 return 0;
107}
108
109static void free_relocation_chain(struct mips_hi16 *l)
110{
111 struct mips_hi16 *next;
112
113 while (l) {
114 next = l->next;
115 kfree(l);
116 l = next;
117 }
118}
119
120static int apply_r_mips_lo16_rel(struct module *me, u32 *location, Elf_Addr v)
121{
122 unsigned long insnlo = *location;
123 struct mips_hi16 *l;
124 Elf_Addr val, vallo;
125
126 /* Sign extend the addend we extract from the lo insn. */
127 vallo = ((insnlo & 0xffff) ^ 0x8000) - 0x8000;
128
129 if (me->arch.r_mips_hi16_list != NULL) {
130 l = me->arch.r_mips_hi16_list;
131 while (l != NULL) {
132 struct mips_hi16 *next;
133 unsigned long insn;
134
135 /*
136 * The value for the HI16 had best be the same.
137 */
138 if (v != l->value)
139 goto out_danger;
140
141 /*
142 * Do the HI16 relocation. Note that we actually don't
143 * need to know anything about the LO16 itself, except
144 * where to find the low 16 bits of the addend needed
145 * by the LO16.
146 */
147 insn = *l->addr;
148 val = ((insn & 0xffff) << 16) + vallo;
149 val += v;
150
151 /*
152 * Account for the sign extension that will happen in
153 * the low bits.
154 */
155 val = ((val >> 16) + ((val & 0x8000) != 0)) & 0xffff;
156
157 insn = (insn & ~0xffff) | val;
158 *l->addr = insn;
159
160 next = l->next;
161 kfree(l);
162 l = next;
163 }
164
165 me->arch.r_mips_hi16_list = NULL;
166 }
167
168 /*
169 * Ok, we're done with the HI16 relocs. Now deal with the LO16.
170 */
171 val = v + vallo;
172 insnlo = (insnlo & ~0xffff) | (val & 0xffff);
173 *location = insnlo;
174
175 return 0;
176
177out_danger:
178 free_relocation_chain(l);
179 me->arch.r_mips_hi16_list = NULL;
180
181 pr_err("module %s: dangerous R_MIPS_LO16 REL relocation\n", me->name);
182
183 return -ENOEXEC;
184}
185
186static int apply_r_mips_pc_rel(struct module *me, u32 *location, Elf_Addr v,
187 unsigned bits)
188{
189 unsigned long mask = GENMASK(bits - 1, 0);
190 unsigned long se_bits;
191 long offset;
192
193 if (v % 4) {
194 pr_err("module %s: dangerous R_MIPS_PC%u REL relocation\n",
195 me->name, bits);
196 return -ENOEXEC;
197 }
198
199 /* retrieve & sign extend implicit addend */
200 offset = *location & mask;
201 offset |= (offset & BIT(bits - 1)) ? ~mask : 0;
202
203 offset += ((long)v - (long)location) >> 2;
204
205 /* check the sign bit onwards are identical - ie. we didn't overflow */
206 se_bits = (offset & BIT(bits - 1)) ? ~0ul : 0;
207 if ((offset & ~mask) != (se_bits & ~mask)) {
208 pr_err("module %s: relocation overflow\n", me->name);
209 return -ENOEXEC;
210 }
211
212 *location = (*location & ~mask) | (offset & mask);
213
214 return 0;
215}
216
217static int apply_r_mips_pc16_rel(struct module *me, u32 *location, Elf_Addr v)
218{
219 return apply_r_mips_pc_rel(me, location, v, 16);
220}
221
222static int apply_r_mips_pc21_rel(struct module *me, u32 *location, Elf_Addr v)
223{
224 return apply_r_mips_pc_rel(me, location, v, 21);
225}
226
227static int apply_r_mips_pc26_rel(struct module *me, u32 *location, Elf_Addr v)
228{
229 return apply_r_mips_pc_rel(me, location, v, 26);
230}
231
232static int (*reloc_handlers_rel[]) (struct module *me, u32 *location,
233 Elf_Addr v) = {
234 [R_MIPS_NONE] = apply_r_mips_none,
235 [R_MIPS_32] = apply_r_mips_32_rel,
236 [R_MIPS_26] = apply_r_mips_26_rel,
237 [R_MIPS_HI16] = apply_r_mips_hi16_rel,
238 [R_MIPS_LO16] = apply_r_mips_lo16_rel,
239 [R_MIPS_PC16] = apply_r_mips_pc16_rel,
240 [R_MIPS_PC21_S2] = apply_r_mips_pc21_rel,
241 [R_MIPS_PC26_S2] = apply_r_mips_pc26_rel,
242};
243
244int apply_relocate(Elf_Shdr *sechdrs, const char *strtab,
245 unsigned int symindex, unsigned int relsec,
246 struct module *me)
247{
248 Elf_Mips_Rel *rel = (void *) sechdrs[relsec].sh_addr;
249 int (*handler)(struct module *me, u32 *location, Elf_Addr v);
250 Elf_Sym *sym;
251 u32 *location;
252 unsigned int i, type;
253 Elf_Addr v;
254 int res;
255
256 pr_debug("Applying relocate section %u to %u\n", relsec,
257 sechdrs[relsec].sh_info);
258
259 me->arch.r_mips_hi16_list = NULL;
260 for (i = 0; i < sechdrs[relsec].sh_size / sizeof(*rel); i++) {
261 /* This is where to make the change */
262 location = (void *)sechdrs[sechdrs[relsec].sh_info].sh_addr
263 + rel[i].r_offset;
264 /* This is the symbol it is referring to */
265 sym = (Elf_Sym *)sechdrs[symindex].sh_addr
266 + ELF_MIPS_R_SYM(rel[i]);
267 if (sym->st_value >= -MAX_ERRNO) {
268 /* Ignore unresolved weak symbol */
269 if (ELF_ST_BIND(sym->st_info) == STB_WEAK)
270 continue;
271 pr_warn("%s: Unknown symbol %s\n",
272 me->name, strtab + sym->st_name);
273 return -ENOENT;
274 }
275
276 type = ELF_MIPS_R_TYPE(rel[i]);
277
278 if (type < ARRAY_SIZE(reloc_handlers_rel))
279 handler = reloc_handlers_rel[type];
280 else
281 handler = NULL;
282
283 if (!handler) {
284 pr_err("%s: Unknown relocation type %u\n",
285 me->name, type);
286 return -EINVAL;
287 }
288
289 v = sym->st_value;
290 res = handler(me, location, v);
291 if (res)
292 return res;
293 }
294
295 /*
296 * Normally the hi16 list should be deallocated at this point. A
297 * malformed binary however could contain a series of R_MIPS_HI16
298 * relocations not followed by a R_MIPS_LO16 relocation. In that
299 * case, free up the list and return an error.
300 */
301 if (me->arch.r_mips_hi16_list) {
302 free_relocation_chain(me->arch.r_mips_hi16_list);
303 me->arch.r_mips_hi16_list = NULL;
304
305 return -ENOEXEC;
306 }
307
308 return 0;
309}
310
311/* Given an address, look for it in the module exception tables. */
312const struct exception_table_entry *search_module_dbetables(unsigned long addr)
313{
314 unsigned long flags;
315 const struct exception_table_entry *e = NULL;
316 struct mod_arch_specific *dbe;
317
318 spin_lock_irqsave(&dbe_lock, flags);
319 list_for_each_entry(dbe, &dbe_list, dbe_list) {
320 e = search_extable(dbe->dbe_start, dbe->dbe_end - 1, addr);
321 if (e)
322 break;
323 }
324 spin_unlock_irqrestore(&dbe_lock, flags);
325
326 /* Now, if we found one, we are running inside it now, hence
327 we cannot unload the module, hence no refcnt needed. */
328 return e;
329}
330
331/* Put in dbe list if necessary. */
332int module_finalize(const Elf_Ehdr *hdr,
333 const Elf_Shdr *sechdrs,
334 struct module *me)
335{
336 const Elf_Shdr *s;
337 char *secstrings = (void *)hdr + sechdrs[hdr->e_shstrndx].sh_offset;
338
339 /* Make jump label nops. */
340 jump_label_apply_nops(me);
341
342 INIT_LIST_HEAD(&me->arch.dbe_list);
343 for (s = sechdrs; s < sechdrs + hdr->e_shnum; s++) {
344 if (strcmp("__dbe_table", secstrings + s->sh_name) != 0)
345 continue;
346 me->arch.dbe_start = (void *)s->sh_addr;
347 me->arch.dbe_end = (void *)s->sh_addr + s->sh_size;
348 spin_lock_irq(&dbe_lock);
349 list_add(&me->arch.dbe_list, &dbe_list);
350 spin_unlock_irq(&dbe_lock);
351 }
352 return 0;
353}
354
355void module_arch_cleanup(struct module *mod)
356{
357 spin_lock_irq(&dbe_lock);
358 list_del(&mod->arch.dbe_list);
359 spin_unlock_irq(&dbe_lock);
360}
1// SPDX-License-Identifier: GPL-2.0-or-later
2/*
3 *
4 * Copyright (C) 2001 Rusty Russell.
5 * Copyright (C) 2003, 2004 Ralf Baechle (ralf@linux-mips.org)
6 * Copyright (C) 2005 Thiemo Seufer
7 */
8
9#undef DEBUG
10
11#include <linux/extable.h>
12#include <linux/moduleloader.h>
13#include <linux/elf.h>
14#include <linux/mm.h>
15#include <linux/numa.h>
16#include <linux/slab.h>
17#include <linux/fs.h>
18#include <linux/string.h>
19#include <linux/kernel.h>
20#include <linux/spinlock.h>
21#include <linux/jump_label.h>
22#include <asm/jump_label.h>
23
24struct mips_hi16 {
25 struct mips_hi16 *next;
26 Elf_Addr *addr;
27 Elf_Addr value;
28};
29
30static LIST_HEAD(dbe_list);
31static DEFINE_SPINLOCK(dbe_lock);
32
33static void apply_r_mips_32(u32 *location, u32 base, Elf_Addr v)
34{
35 *location = base + v;
36}
37
38static int apply_r_mips_26(struct module *me, u32 *location, u32 base,
39 Elf_Addr v)
40{
41 if (v % 4) {
42 pr_err("module %s: dangerous R_MIPS_26 relocation\n",
43 me->name);
44 return -ENOEXEC;
45 }
46
47 if ((v & 0xf0000000) != (((unsigned long)location + 4) & 0xf0000000)) {
48 pr_err("module %s: relocation overflow\n",
49 me->name);
50 return -ENOEXEC;
51 }
52
53 *location = (*location & ~0x03ffffff) |
54 ((base + (v >> 2)) & 0x03ffffff);
55
56 return 0;
57}
58
59static int apply_r_mips_hi16(struct module *me, u32 *location, Elf_Addr v,
60 bool rela)
61{
62 struct mips_hi16 *n;
63
64 if (rela) {
65 *location = (*location & 0xffff0000) |
66 ((((long long) v + 0x8000LL) >> 16) & 0xffff);
67 return 0;
68 }
69
70 /*
71 * We cannot relocate this one now because we don't know the value of
72 * the carry we need to add. Save the information, and let LO16 do the
73 * actual relocation.
74 */
75 n = kmalloc(sizeof *n, GFP_KERNEL);
76 if (!n)
77 return -ENOMEM;
78
79 n->addr = (Elf_Addr *)location;
80 n->value = v;
81 n->next = me->arch.r_mips_hi16_list;
82 me->arch.r_mips_hi16_list = n;
83
84 return 0;
85}
86
87static void free_relocation_chain(struct mips_hi16 *l)
88{
89 struct mips_hi16 *next;
90
91 while (l) {
92 next = l->next;
93 kfree(l);
94 l = next;
95 }
96}
97
98static int apply_r_mips_lo16(struct module *me, u32 *location,
99 u32 base, Elf_Addr v, bool rela)
100{
101 unsigned long insnlo = base;
102 struct mips_hi16 *l;
103 Elf_Addr val, vallo;
104
105 if (rela) {
106 *location = (*location & 0xffff0000) | (v & 0xffff);
107 return 0;
108 }
109
110 /* Sign extend the addend we extract from the lo insn. */
111 vallo = ((insnlo & 0xffff) ^ 0x8000) - 0x8000;
112
113 if (me->arch.r_mips_hi16_list != NULL) {
114 l = me->arch.r_mips_hi16_list;
115 while (l != NULL) {
116 struct mips_hi16 *next;
117 unsigned long insn;
118
119 /*
120 * The value for the HI16 had best be the same.
121 */
122 if (v != l->value)
123 goto out_danger;
124
125 /*
126 * Do the HI16 relocation. Note that we actually don't
127 * need to know anything about the LO16 itself, except
128 * where to find the low 16 bits of the addend needed
129 * by the LO16.
130 */
131 insn = *l->addr;
132 val = ((insn & 0xffff) << 16) + vallo;
133 val += v;
134
135 /*
136 * Account for the sign extension that will happen in
137 * the low bits.
138 */
139 val = ((val >> 16) + ((val & 0x8000) != 0)) & 0xffff;
140
141 insn = (insn & ~0xffff) | val;
142 *l->addr = insn;
143
144 next = l->next;
145 kfree(l);
146 l = next;
147 }
148
149 me->arch.r_mips_hi16_list = NULL;
150 }
151
152 /*
153 * Ok, we're done with the HI16 relocs. Now deal with the LO16.
154 */
155 val = v + vallo;
156 insnlo = (insnlo & ~0xffff) | (val & 0xffff);
157 *location = insnlo;
158
159 return 0;
160
161out_danger:
162 free_relocation_chain(l);
163 me->arch.r_mips_hi16_list = NULL;
164
165 pr_err("module %s: dangerous R_MIPS_LO16 relocation\n", me->name);
166
167 return -ENOEXEC;
168}
169
170static int apply_r_mips_pc(struct module *me, u32 *location, u32 base,
171 Elf_Addr v, unsigned int bits)
172{
173 unsigned long mask = GENMASK(bits - 1, 0);
174 unsigned long se_bits;
175 long offset;
176
177 if (v % 4) {
178 pr_err("module %s: dangerous R_MIPS_PC%u relocation\n",
179 me->name, bits);
180 return -ENOEXEC;
181 }
182
183 /* retrieve & sign extend implicit addend if any */
184 offset = base & mask;
185 offset |= (offset & BIT(bits - 1)) ? ~mask : 0;
186
187 offset += ((long)v - (long)location) >> 2;
188
189 /* check the sign bit onwards are identical - ie. we didn't overflow */
190 se_bits = (offset & BIT(bits - 1)) ? ~0ul : 0;
191 if ((offset & ~mask) != (se_bits & ~mask)) {
192 pr_err("module %s: relocation overflow\n", me->name);
193 return -ENOEXEC;
194 }
195
196 *location = (*location & ~mask) | (offset & mask);
197
198 return 0;
199}
200
201static int apply_r_mips_pc16(struct module *me, u32 *location, u32 base,
202 Elf_Addr v)
203{
204 return apply_r_mips_pc(me, location, base, v, 16);
205}
206
207static int apply_r_mips_pc21(struct module *me, u32 *location, u32 base,
208 Elf_Addr v)
209{
210 return apply_r_mips_pc(me, location, base, v, 21);
211}
212
213static int apply_r_mips_pc26(struct module *me, u32 *location, u32 base,
214 Elf_Addr v)
215{
216 return apply_r_mips_pc(me, location, base, v, 26);
217}
218
219static int apply_r_mips_64(u32 *location, Elf_Addr v, bool rela)
220{
221 if (WARN_ON(!rela))
222 return -EINVAL;
223
224 *(Elf_Addr *)location = v;
225
226 return 0;
227}
228
229static int apply_r_mips_higher(u32 *location, Elf_Addr v, bool rela)
230{
231 if (WARN_ON(!rela))
232 return -EINVAL;
233
234 *location = (*location & 0xffff0000) |
235 ((((long long)v + 0x80008000LL) >> 32) & 0xffff);
236
237 return 0;
238}
239
240static int apply_r_mips_highest(u32 *location, Elf_Addr v, bool rela)
241{
242 if (WARN_ON(!rela))
243 return -EINVAL;
244
245 *location = (*location & 0xffff0000) |
246 ((((long long)v + 0x800080008000LL) >> 48) & 0xffff);
247
248 return 0;
249}
250
251/**
252 * reloc_handler() - Apply a particular relocation to a module
253 * @type: type of the relocation to apply
254 * @me: the module to apply the reloc to
255 * @location: the address at which the reloc is to be applied
256 * @base: the existing value at location for REL-style; 0 for RELA-style
257 * @v: the value of the reloc, with addend for RELA-style
258 * @rela: indication of is this a RELA (true) or REL (false) relocation
259 *
260 * Each implemented relocation function applies a particular type of
261 * relocation to the module @me. Relocs that may be found in either REL or RELA
262 * variants can be handled by making use of the @base & @v parameters which are
263 * set to values which abstract the difference away from the particular reloc
264 * implementations.
265 *
266 * Return: 0 upon success, else -ERRNO
267 */
268static int reloc_handler(u32 type, struct module *me, u32 *location, u32 base,
269 Elf_Addr v, bool rela)
270{
271 switch (type) {
272 case R_MIPS_NONE:
273 break;
274 case R_MIPS_32:
275 apply_r_mips_32(location, base, v);
276 break;
277 case R_MIPS_26:
278 return apply_r_mips_26(me, location, base, v);
279 case R_MIPS_HI16:
280 return apply_r_mips_hi16(me, location, v, rela);
281 case R_MIPS_LO16:
282 return apply_r_mips_lo16(me, location, base, v, rela);
283 case R_MIPS_PC16:
284 return apply_r_mips_pc16(me, location, base, v);
285 case R_MIPS_PC21_S2:
286 return apply_r_mips_pc21(me, location, base, v);
287 case R_MIPS_PC26_S2:
288 return apply_r_mips_pc26(me, location, base, v);
289 case R_MIPS_64:
290 return apply_r_mips_64(location, v, rela);
291 case R_MIPS_HIGHER:
292 return apply_r_mips_higher(location, v, rela);
293 case R_MIPS_HIGHEST:
294 return apply_r_mips_highest(location, v, rela);
295 default:
296 pr_err("%s: Unknown relocation type %u\n", me->name, type);
297 return -EINVAL;
298 }
299
300 return 0;
301}
302
303static int __apply_relocate(Elf_Shdr *sechdrs, const char *strtab,
304 unsigned int symindex, unsigned int relsec,
305 struct module *me, bool rela)
306{
307 union {
308 Elf_Mips_Rel *rel;
309 Elf_Mips_Rela *rela;
310 } r;
311 Elf_Sym *sym;
312 u32 *location, base;
313 unsigned int i, type;
314 Elf_Addr v;
315 int err = 0;
316 size_t reloc_sz;
317
318 pr_debug("Applying relocate section %u to %u\n", relsec,
319 sechdrs[relsec].sh_info);
320
321 r.rel = (void *)sechdrs[relsec].sh_addr;
322 reloc_sz = rela ? sizeof(*r.rela) : sizeof(*r.rel);
323 me->arch.r_mips_hi16_list = NULL;
324 for (i = 0; i < sechdrs[relsec].sh_size / reloc_sz; i++) {
325 /* This is where to make the change */
326 location = (void *)sechdrs[sechdrs[relsec].sh_info].sh_addr
327 + r.rel->r_offset;
328 /* This is the symbol it is referring to */
329 sym = (Elf_Sym *)sechdrs[symindex].sh_addr
330 + ELF_MIPS_R_SYM(*r.rel);
331 if (sym->st_value >= -MAX_ERRNO) {
332 /* Ignore unresolved weak symbol */
333 if (ELF_ST_BIND(sym->st_info) == STB_WEAK)
334 continue;
335 pr_warn("%s: Unknown symbol %s\n",
336 me->name, strtab + sym->st_name);
337 err = -ENOENT;
338 goto out;
339 }
340
341 type = ELF_MIPS_R_TYPE(*r.rel);
342
343 if (rela) {
344 v = sym->st_value + r.rela->r_addend;
345 base = 0;
346 r.rela = &r.rela[1];
347 } else {
348 v = sym->st_value;
349 base = *location;
350 r.rel = &r.rel[1];
351 }
352
353 err = reloc_handler(type, me, location, base, v, rela);
354 if (err)
355 goto out;
356 }
357
358out:
359 /*
360 * Normally the hi16 list should be deallocated at this point. A
361 * malformed binary however could contain a series of R_MIPS_HI16
362 * relocations not followed by a R_MIPS_LO16 relocation, or if we hit
363 * an error processing a reloc we might have gotten here before
364 * reaching the R_MIPS_LO16. In either case, free up the list and
365 * return an error.
366 */
367 if (me->arch.r_mips_hi16_list) {
368 free_relocation_chain(me->arch.r_mips_hi16_list);
369 me->arch.r_mips_hi16_list = NULL;
370 err = err ?: -ENOEXEC;
371 }
372
373 return err;
374}
375
376int apply_relocate(Elf_Shdr *sechdrs, const char *strtab,
377 unsigned int symindex, unsigned int relsec,
378 struct module *me)
379{
380 return __apply_relocate(sechdrs, strtab, symindex, relsec, me, false);
381}
382
383#ifdef CONFIG_MODULES_USE_ELF_RELA
384int apply_relocate_add(Elf_Shdr *sechdrs, const char *strtab,
385 unsigned int symindex, unsigned int relsec,
386 struct module *me)
387{
388 return __apply_relocate(sechdrs, strtab, symindex, relsec, me, true);
389}
390#endif /* CONFIG_MODULES_USE_ELF_RELA */
391
392/* Given an address, look for it in the module exception tables. */
393const struct exception_table_entry *search_module_dbetables(unsigned long addr)
394{
395 unsigned long flags;
396 const struct exception_table_entry *e = NULL;
397 struct mod_arch_specific *dbe;
398
399 spin_lock_irqsave(&dbe_lock, flags);
400 list_for_each_entry(dbe, &dbe_list, dbe_list) {
401 e = search_extable(dbe->dbe_start,
402 dbe->dbe_end - dbe->dbe_start, addr);
403 if (e)
404 break;
405 }
406 spin_unlock_irqrestore(&dbe_lock, flags);
407
408 /* Now, if we found one, we are running inside it now, hence
409 we cannot unload the module, hence no refcnt needed. */
410 return e;
411}
412
413/* Put in dbe list if necessary. */
414int module_finalize(const Elf_Ehdr *hdr,
415 const Elf_Shdr *sechdrs,
416 struct module *me)
417{
418 const Elf_Shdr *s;
419 char *secstrings = (void *)hdr + sechdrs[hdr->e_shstrndx].sh_offset;
420
421 if (IS_ENABLED(CONFIG_JUMP_LABEL))
422 jump_label_apply_nops(me);
423
424 INIT_LIST_HEAD(&me->arch.dbe_list);
425 for (s = sechdrs; s < sechdrs + hdr->e_shnum; s++) {
426 if (strcmp("__dbe_table", secstrings + s->sh_name) != 0)
427 continue;
428 me->arch.dbe_start = (void *)s->sh_addr;
429 me->arch.dbe_end = (void *)s->sh_addr + s->sh_size;
430 spin_lock_irq(&dbe_lock);
431 list_add(&me->arch.dbe_list, &dbe_list);
432 spin_unlock_irq(&dbe_lock);
433 }
434 return 0;
435}
436
437void module_arch_cleanup(struct module *mod)
438{
439 spin_lock_irq(&dbe_lock);
440 list_del(&mod->arch.dbe_list);
441 spin_unlock_irq(&dbe_lock);
442}