1 // SPDX-License-Identifier: GPL-2.0-only
3 * Copyright (C) 2014-2017 Linaro Ltd. <ard.biesheuvel@linaro.org>
7 #include <linux/kernel.h>
8 #include <linux/module.h>
9 #include <linux/sort.h>
11 #include <asm/cache.h>
12 #include <asm/opcodes.h>
14 #define PLT_ENT_STRIDE L1_CACHE_BYTES
15 #define PLT_ENT_COUNT (PLT_ENT_STRIDE / sizeof(u32))
16 #define PLT_ENT_SIZE (sizeof(struct plt_entries) / PLT_ENT_COUNT)
18 #ifdef CONFIG_THUMB2_KERNEL
19 #define PLT_ENT_LDR __opcode_to_mem_thumb32(0xf8dff000 | \
22 #define PLT_ENT_LDR __opcode_to_mem_arm(0xe59ff000 | \
27 u32 ldr
[PLT_ENT_COUNT
];
28 u32 lit
[PLT_ENT_COUNT
];
31 static bool in_init(const struct module
*mod
, unsigned long loc
)
33 return loc
- (u32
)mod
->init_layout
.base
< mod
->init_layout
.size
;
36 u32
get_module_plt(struct module
*mod
, unsigned long loc
, Elf32_Addr val
)
38 struct mod_plt_sec
*pltsec
= !in_init(mod
, loc
) ? &mod
->arch
.core
:
41 struct plt_entries
*plt
= (struct plt_entries
*)pltsec
->plt
->sh_addr
;
45 * Look for an existing entry pointing to 'val'. Given that the
46 * relocations are sorted, this will be the last entry we allocated.
49 if (pltsec
->plt_count
> 0) {
50 plt
+= (pltsec
->plt_count
- 1) / PLT_ENT_COUNT
;
51 idx
= (pltsec
->plt_count
- 1) % PLT_ENT_COUNT
;
53 if (plt
->lit
[idx
] == val
)
54 return (u32
)&plt
->ldr
[idx
];
56 idx
= (idx
+ 1) % PLT_ENT_COUNT
;
62 BUG_ON(pltsec
->plt_count
* PLT_ENT_SIZE
> pltsec
->plt
->sh_size
);
65 /* Populate a new set of entries */
66 *plt
= (struct plt_entries
){
67 { [0 ... PLT_ENT_COUNT
- 1] = PLT_ENT_LDR
, },
73 return (u32
)&plt
->ldr
[idx
];
76 #define cmp_3way(a,b) ((a) < (b) ? -1 : (a) > (b))
78 static int cmp_rel(const void *a
, const void *b
)
80 const Elf32_Rel
*x
= a
, *y
= b
;
83 /* sort by type and symbol index */
84 i
= cmp_3way(ELF32_R_TYPE(x
->r_info
), ELF32_R_TYPE(y
->r_info
));
86 i
= cmp_3way(ELF32_R_SYM(x
->r_info
), ELF32_R_SYM(y
->r_info
));
90 static bool is_zero_addend_relocation(Elf32_Addr base
, const Elf32_Rel
*rel
)
92 u32
*tval
= (u32
*)(base
+ rel
->r_offset
);
95 * Do a bitwise compare on the raw addend rather than fully decoding
96 * the offset and doing an arithmetic comparison.
97 * Note that a zero-addend jump/call relocation is encoded taking the
98 * PC bias into account, i.e., -8 for ARM and -4 for Thumb2.
100 switch (ELF32_R_TYPE(rel
->r_info
)) {
104 case R_ARM_THM_JUMP24
:
105 upper
= __mem_to_opcode_thumb16(((u16
*)tval
)[0]);
106 lower
= __mem_to_opcode_thumb16(((u16
*)tval
)[1]);
108 return (upper
& 0x7ff) == 0x7ff && (lower
& 0x2fff) == 0x2ffe;
113 return (__mem_to_opcode_arm(*tval
) & 0xffffff) == 0xfffffe;
118 static bool duplicate_rel(Elf32_Addr base
, const Elf32_Rel
*rel
, int num
)
120 const Elf32_Rel
*prev
;
123 * Entries are sorted by type and symbol index. That means that,
124 * if a duplicate entry exists, it must be in the preceding
130 prev
= rel
+ num
- 1;
131 return cmp_rel(rel
+ num
, prev
) == 0 &&
132 is_zero_addend_relocation(base
, prev
);
135 /* Count how many PLT entries we may need */
136 static unsigned int count_plts(const Elf32_Sym
*syms
, Elf32_Addr base
,
137 const Elf32_Rel
*rel
, int num
, Elf32_Word dstidx
)
139 unsigned int ret
= 0;
143 for (i
= 0; i
< num
; i
++) {
144 switch (ELF32_R_TYPE(rel
[i
].r_info
)) {
149 case R_ARM_THM_JUMP24
:
151 * We only have to consider branch targets that resolve
152 * to symbols that are defined in a different section.
153 * This is not simply a heuristic, it is a fundamental
154 * limitation, since there is no guaranteed way to emit
155 * PLT entries sufficiently close to the branch if the
156 * section size exceeds the range of a branch
157 * instruction. So ignore relocations against defined
158 * symbols if they live in the same section as the
161 s
= syms
+ ELF32_R_SYM(rel
[i
].r_info
);
162 if (s
->st_shndx
== dstidx
)
166 * Jump relocations with non-zero addends against
167 * undefined symbols are supported by the ELF spec, but
168 * do not occur in practice (e.g., 'jump n bytes past
169 * the entry point of undefined function symbol f').
170 * So we need to support them, but there is no need to
171 * take them into consideration when trying to optimize
172 * this code. So let's only check for duplicates when
173 * the addend is zero. (Note that calls into the core
174 * module via init PLT entries could involve section
175 * relative symbol references with non-zero addends, for
176 * which we may end up emitting duplicates, but the init
177 * PLT is released along with the rest of the .init
178 * region as soon as module loading completes.)
180 if (!is_zero_addend_relocation(base
, rel
+ i
) ||
181 !duplicate_rel(base
, rel
, i
))
188 int module_frob_arch_sections(Elf_Ehdr
*ehdr
, Elf_Shdr
*sechdrs
,
189 char *secstrings
, struct module
*mod
)
191 unsigned long core_plts
= 0;
192 unsigned long init_plts
= 0;
193 Elf32_Shdr
*s
, *sechdrs_end
= sechdrs
+ ehdr
->e_shnum
;
194 Elf32_Sym
*syms
= NULL
;
197 * To store the PLTs, we expand the .text section for core module code
198 * and for initialization code.
200 for (s
= sechdrs
; s
< sechdrs_end
; ++s
) {
201 if (strcmp(".plt", secstrings
+ s
->sh_name
) == 0)
202 mod
->arch
.core
.plt
= s
;
203 else if (strcmp(".init.plt", secstrings
+ s
->sh_name
) == 0)
204 mod
->arch
.init
.plt
= s
;
205 else if (s
->sh_type
== SHT_SYMTAB
)
206 syms
= (Elf32_Sym
*)s
->sh_addr
;
209 if (!mod
->arch
.core
.plt
|| !mod
->arch
.init
.plt
) {
210 pr_err("%s: module PLT section(s) missing\n", mod
->name
);
214 pr_err("%s: module symtab section missing\n", mod
->name
);
218 for (s
= sechdrs
+ 1; s
< sechdrs_end
; ++s
) {
219 Elf32_Rel
*rels
= (void *)ehdr
+ s
->sh_offset
;
220 int numrels
= s
->sh_size
/ sizeof(Elf32_Rel
);
221 Elf32_Shdr
*dstsec
= sechdrs
+ s
->sh_info
;
223 if (s
->sh_type
!= SHT_REL
)
226 /* ignore relocations that operate on non-exec sections */
227 if (!(dstsec
->sh_flags
& SHF_EXECINSTR
))
230 /* sort by type and symbol index */
231 sort(rels
, numrels
, sizeof(Elf32_Rel
), cmp_rel
, NULL
);
233 if (strncmp(secstrings
+ dstsec
->sh_name
, ".init", 5) != 0)
234 core_plts
+= count_plts(syms
, dstsec
->sh_addr
, rels
,
235 numrels
, s
->sh_info
);
237 init_plts
+= count_plts(syms
, dstsec
->sh_addr
, rels
,
238 numrels
, s
->sh_info
);
241 mod
->arch
.core
.plt
->sh_type
= SHT_NOBITS
;
242 mod
->arch
.core
.plt
->sh_flags
= SHF_EXECINSTR
| SHF_ALLOC
;
243 mod
->arch
.core
.plt
->sh_addralign
= L1_CACHE_BYTES
;
244 mod
->arch
.core
.plt
->sh_size
= round_up(core_plts
* PLT_ENT_SIZE
,
245 sizeof(struct plt_entries
));
246 mod
->arch
.core
.plt_count
= 0;
248 mod
->arch
.init
.plt
->sh_type
= SHT_NOBITS
;
249 mod
->arch
.init
.plt
->sh_flags
= SHF_EXECINSTR
| SHF_ALLOC
;
250 mod
->arch
.init
.plt
->sh_addralign
= L1_CACHE_BYTES
;
251 mod
->arch
.init
.plt
->sh_size
= round_up(init_plts
* PLT_ENT_SIZE
,
252 sizeof(struct plt_entries
));
253 mod
->arch
.init
.plt_count
= 0;
255 pr_debug("%s: plt=%x, init.plt=%x\n", __func__
,
256 mod
->arch
.core
.plt
->sh_size
, mod
->arch
.init
.plt
->sh_size
);