1 // SPDX-License-Identifier: GPL-2.0-or-later
4 * Copyright (C) 2001 Rusty Russell.
5 * Copyright (C) 2003, 2004 Ralf Baechle (ralf@linux-mips.org)
6 * Copyright (C) 2005 Thiemo Seufer
11 #include <linux/extable.h>
12 #include <linux/moduleloader.h>
13 #include <linux/elf.h>
15 #include <linux/numa.h>
16 #include <linux/vmalloc.h>
17 #include <linux/slab.h>
19 #include <linux/string.h>
20 #include <linux/kernel.h>
21 #include <linux/spinlock.h>
22 #include <linux/jump_label.h>
24 extern void jump_label_apply_nops(struct module *mod);
27 struct mips_hi16 *next;
32 static LIST_HEAD(dbe_list);
33 static DEFINE_SPINLOCK(dbe_lock);
36 void *module_alloc(unsigned long size)
38 return __vmalloc_node_range(size, 1, MODULE_START, MODULE_END,
39 GFP_KERNEL, PAGE_KERNEL, 0, NUMA_NO_NODE,
40 __builtin_return_address(0));
44 static void apply_r_mips_32(u32 *location, u32 base, Elf_Addr v)
49 static int apply_r_mips_26(struct module *me, u32 *location, u32 base,
53 pr_err("module %s: dangerous R_MIPS_26 relocation\n",
58 if ((v & 0xf0000000) != (((unsigned long)location + 4) & 0xf0000000)) {
59 pr_err("module %s: relocation overflow\n",
64 *location = (*location & ~0x03ffffff) |
65 ((base + (v >> 2)) & 0x03ffffff);
70 static int apply_r_mips_hi16(struct module *me, u32 *location, Elf_Addr v,
76 *location = (*location & 0xffff0000) |
77 ((((long long) v + 0x8000LL) >> 16) & 0xffff);
82 * We cannot relocate this one now because we don't know the value of
83 * the carry we need to add. Save the information, and let LO16 do the
86 n = kmalloc(sizeof *n, GFP_KERNEL);
90 n->addr = (Elf_Addr *)location;
92 n->next = me->arch.r_mips_hi16_list;
93 me->arch.r_mips_hi16_list = n;
98 static void free_relocation_chain(struct mips_hi16 *l)
100 struct mips_hi16 *next;
109 static int apply_r_mips_lo16(struct module *me, u32 *location,
110 u32 base, Elf_Addr v, bool rela)
112 unsigned long insnlo = base;
117 *location = (*location & 0xffff0000) | (v & 0xffff);
121 /* Sign extend the addend we extract from the lo insn. */
122 vallo = ((insnlo & 0xffff) ^ 0x8000) - 0x8000;
124 if (me->arch.r_mips_hi16_list != NULL) {
125 l = me->arch.r_mips_hi16_list;
127 struct mips_hi16 *next;
131 * The value for the HI16 had best be the same.
137 * Do the HI16 relocation. Note that we actually don't
138 * need to know anything about the LO16 itself, except
139 * where to find the low 16 bits of the addend needed
143 val = ((insn & 0xffff) << 16) + vallo;
147 * Account for the sign extension that will happen in
150 val = ((val >> 16) + ((val & 0x8000) != 0)) & 0xffff;
152 insn = (insn & ~0xffff) | val;
160 me->arch.r_mips_hi16_list = NULL;
164 * Ok, we're done with the HI16 relocs. Now deal with the LO16.
167 insnlo = (insnlo & ~0xffff) | (val & 0xffff);
173 free_relocation_chain(l);
174 me->arch.r_mips_hi16_list = NULL;
176 pr_err("module %s: dangerous R_MIPS_LO16 relocation\n", me->name);
181 static int apply_r_mips_pc(struct module *me, u32 *location, u32 base,
182 Elf_Addr v, unsigned int bits)
184 unsigned long mask = GENMASK(bits - 1, 0);
185 unsigned long se_bits;
189 pr_err("module %s: dangerous R_MIPS_PC%u relocation\n",
194 /* retrieve & sign extend implicit addend if any */
195 offset = base & mask;
196 offset |= (offset & BIT(bits - 1)) ? ~mask : 0;
198 offset += ((long)v - (long)location) >> 2;
200 /* check the sign bit onwards are identical - ie. we didn't overflow */
201 se_bits = (offset & BIT(bits - 1)) ? ~0ul : 0;
202 if ((offset & ~mask) != (se_bits & ~mask)) {
203 pr_err("module %s: relocation overflow\n", me->name);
207 *location = (*location & ~mask) | (offset & mask);
212 static int apply_r_mips_pc16(struct module *me, u32 *location, u32 base,
215 return apply_r_mips_pc(me, location, base, v, 16);
218 static int apply_r_mips_pc21(struct module *me, u32 *location, u32 base,
221 return apply_r_mips_pc(me, location, base, v, 21);
224 static int apply_r_mips_pc26(struct module *me, u32 *location, u32 base,
227 return apply_r_mips_pc(me, location, base, v, 26);
230 static int apply_r_mips_64(u32 *location, Elf_Addr v, bool rela)
235 *(Elf_Addr *)location = v;
240 static int apply_r_mips_higher(u32 *location, Elf_Addr v, bool rela)
245 *location = (*location & 0xffff0000) |
246 ((((long long)v + 0x80008000LL) >> 32) & 0xffff);
251 static int apply_r_mips_highest(u32 *location, Elf_Addr v, bool rela)
256 *location = (*location & 0xffff0000) |
257 ((((long long)v + 0x800080008000LL) >> 48) & 0xffff);
263 * reloc_handler() - Apply a particular relocation to a module
264 * @type: type of the relocation to apply
265 * @me: the module to apply the reloc to
266 * @location: the address at which the reloc is to be applied
267 * @base: the existing value at location for REL-style; 0 for RELA-style
268 * @v: the value of the reloc, with addend for RELA-style
269 * @rela: indication of is this a RELA (true) or REL (false) relocation
271 * Each implemented relocation function applies a particular type of
272 * relocation to the module @me. Relocs that may be found in either REL or RELA
273 * variants can be handled by making use of the @base & @v parameters which are
274 * set to values which abstract the difference away from the particular reloc
277 * Return: 0 upon success, else -ERRNO
279 static int reloc_handler(u32 type, struct module *me, u32 *location, u32 base,
280 Elf_Addr v, bool rela)
286 apply_r_mips_32(location, base, v);
289 return apply_r_mips_26(me, location, base, v);
291 return apply_r_mips_hi16(me, location, v, rela);
293 return apply_r_mips_lo16(me, location, base, v, rela);
295 return apply_r_mips_pc16(me, location, base, v);
297 return apply_r_mips_pc21(me, location, base, v);
299 return apply_r_mips_pc26(me, location, base, v);
301 return apply_r_mips_64(location, v, rela);
303 return apply_r_mips_higher(location, v, rela);
305 return apply_r_mips_highest(location, v, rela);
307 pr_err("%s: Unknown relocation type %u\n", me->name, type);
314 static int __apply_relocate(Elf_Shdr *sechdrs, const char *strtab,
315 unsigned int symindex, unsigned int relsec,
316 struct module *me, bool rela)
324 unsigned int i, type;
329 pr_debug("Applying relocate section %u to %u\n", relsec,
330 sechdrs[relsec].sh_info);
332 r.rel = (void *)sechdrs[relsec].sh_addr;
333 reloc_sz = rela ? sizeof(*r.rela) : sizeof(*r.rel);
334 me->arch.r_mips_hi16_list = NULL;
335 for (i = 0; i < sechdrs[relsec].sh_size / reloc_sz; i++) {
336 /* This is where to make the change */
337 location = (void *)sechdrs[sechdrs[relsec].sh_info].sh_addr
339 /* This is the symbol it is referring to */
340 sym = (Elf_Sym *)sechdrs[symindex].sh_addr
341 + ELF_MIPS_R_SYM(*r.rel);
342 if (sym->st_value >= -MAX_ERRNO) {
343 /* Ignore unresolved weak symbol */
344 if (ELF_ST_BIND(sym->st_info) == STB_WEAK)
346 pr_warn("%s: Unknown symbol %s\n",
347 me->name, strtab + sym->st_name);
352 type = ELF_MIPS_R_TYPE(*r.rel);
355 v = sym->st_value + r.rela->r_addend;
364 err = reloc_handler(type, me, location, base, v, rela);
371 * Normally the hi16 list should be deallocated at this point. A
372 * malformed binary however could contain a series of R_MIPS_HI16
373 * relocations not followed by a R_MIPS_LO16 relocation, or if we hit
374 * an error processing a reloc we might have gotten here before
375 * reaching the R_MIPS_LO16. In either case, free up the list and
378 if (me->arch.r_mips_hi16_list) {
379 free_relocation_chain(me->arch.r_mips_hi16_list);
380 me->arch.r_mips_hi16_list = NULL;
381 err = err ?: -ENOEXEC;
387 int apply_relocate(Elf_Shdr *sechdrs, const char *strtab,
388 unsigned int symindex, unsigned int relsec,
391 return __apply_relocate(sechdrs, strtab, symindex, relsec, me, false);
394 #ifdef CONFIG_MODULES_USE_ELF_RELA
395 int apply_relocate_add(Elf_Shdr *sechdrs, const char *strtab,
396 unsigned int symindex, unsigned int relsec,
399 return __apply_relocate(sechdrs, strtab, symindex, relsec, me, true);
401 #endif /* CONFIG_MODULES_USE_ELF_RELA */
403 /* Given an address, look for it in the module exception tables. */
404 const struct exception_table_entry *search_module_dbetables(unsigned long addr)
407 const struct exception_table_entry *e = NULL;
408 struct mod_arch_specific *dbe;
410 spin_lock_irqsave(&dbe_lock, flags);
411 list_for_each_entry(dbe, &dbe_list, dbe_list) {
412 e = search_extable(dbe->dbe_start,
413 dbe->dbe_end - dbe->dbe_start, addr);
417 spin_unlock_irqrestore(&dbe_lock, flags);
419 /* Now, if we found one, we are running inside it now, hence
420 we cannot unload the module, hence no refcnt needed. */
424 /* Put in dbe list if necessary. */
425 int module_finalize(const Elf_Ehdr *hdr,
426 const Elf_Shdr *sechdrs,
430 char *secstrings = (void *)hdr + sechdrs[hdr->e_shstrndx].sh_offset;
432 if (IS_ENABLED(CONFIG_JUMP_LABEL))
433 jump_label_apply_nops(me);
435 INIT_LIST_HEAD(&me->arch.dbe_list);
436 for (s = sechdrs; s < sechdrs + hdr->e_shnum; s++) {
437 if (strcmp("__dbe_table", secstrings + s->sh_name) != 0)
439 me->arch.dbe_start = (void *)s->sh_addr;
440 me->arch.dbe_end = (void *)s->sh_addr + s->sh_size;
441 spin_lock_irq(&dbe_lock);
442 list_add(&me->arch.dbe_list, &dbe_list);
443 spin_unlock_irq(&dbe_lock);
448 void module_arch_cleanup(struct module *mod)
450 spin_lock_irq(&dbe_lock);
451 list_del(&mod->arch.dbe_list);
452 spin_unlock_irq(&dbe_lock);