Book a Demo!
CoCalc Logo Icon
StoreFeaturesDocsShareSupportNewsAboutPoliciesSign UpSign In
torvalds
GitHub Repository: torvalds/linux
Path: blob/master/arch/loongarch/kernel/module-sections.c
26424 views
1
// SPDX-License-Identifier: GPL-2.0
2
/*
3
* Copyright (C) 2020-2022 Loongson Technology Corporation Limited
4
*/
5
6
#include <linux/elf.h>
7
#include <linux/kernel.h>
8
#include <linux/module.h>
9
#include <linux/moduleloader.h>
10
#include <linux/ftrace.h>
11
#include <linux/sort.h>
12
13
Elf_Addr module_emit_got_entry(struct module *mod, Elf_Shdr *sechdrs, Elf_Addr val)
14
{
15
struct mod_section *got_sec = &mod->arch.got;
16
int i = got_sec->num_entries;
17
struct got_entry *got = get_got_entry(val, sechdrs, got_sec);
18
19
if (got)
20
return (Elf_Addr)got;
21
22
/* There is no GOT entry for val yet, create a new one. */
23
got = (struct got_entry *)sechdrs[got_sec->shndx].sh_addr;
24
got[i] = emit_got_entry(val);
25
26
got_sec->num_entries++;
27
if (got_sec->num_entries > got_sec->max_entries) {
28
/*
29
* This may happen when the module contains a GOT_HI20 without
30
* a paired GOT_LO12. Such a module is broken, reject it.
31
*/
32
pr_err("%s: module contains bad GOT relocation\n", mod->name);
33
return 0;
34
}
35
36
return (Elf_Addr)&got[i];
37
}
38
39
Elf_Addr module_emit_plt_entry(struct module *mod, Elf_Shdr *sechdrs, Elf_Addr val)
40
{
41
int nr;
42
struct mod_section *plt_sec = &mod->arch.plt;
43
struct mod_section *plt_idx_sec = &mod->arch.plt_idx;
44
struct plt_entry *plt = get_plt_entry(val, sechdrs, plt_sec, plt_idx_sec);
45
struct plt_idx_entry *plt_idx;
46
47
if (plt)
48
return (Elf_Addr)plt;
49
50
nr = plt_sec->num_entries;
51
52
/* There is no duplicate entry, create a new one */
53
plt = (struct plt_entry *)sechdrs[plt_sec->shndx].sh_addr;
54
plt[nr] = emit_plt_entry(val);
55
plt_idx = (struct plt_idx_entry *)sechdrs[plt_idx_sec->shndx].sh_addr;
56
plt_idx[nr] = emit_plt_idx_entry(val);
57
58
plt_sec->num_entries++;
59
plt_idx_sec->num_entries++;
60
BUG_ON(plt_sec->num_entries > plt_sec->max_entries);
61
62
return (Elf_Addr)&plt[nr];
63
}
64
65
#define cmp_3way(a, b) ((a) < (b) ? -1 : (a) > (b))
66
67
static int compare_rela(const void *x, const void *y)
68
{
69
int ret;
70
const Elf_Rela *rela_x = x, *rela_y = y;
71
72
ret = cmp_3way(rela_x->r_info, rela_y->r_info);
73
if (ret == 0)
74
ret = cmp_3way(rela_x->r_addend, rela_y->r_addend);
75
76
return ret;
77
}
78
79
static void count_max_entries(Elf_Rela *relas, int num,
80
unsigned int *plts, unsigned int *gots)
81
{
82
unsigned int i;
83
84
sort(relas, num, sizeof(Elf_Rela), compare_rela, NULL);
85
86
for (i = 0; i < num; i++) {
87
if (i && !compare_rela(&relas[i-1], &relas[i]))
88
continue;
89
90
switch (ELF_R_TYPE(relas[i].r_info)) {
91
case R_LARCH_SOP_PUSH_PLT_PCREL:
92
case R_LARCH_B26:
93
(*plts)++;
94
break;
95
case R_LARCH_GOT_PC_HI20:
96
(*gots)++;
97
break;
98
default:
99
break; /* Do nothing. */
100
}
101
}
102
}
103
104
int module_frob_arch_sections(Elf_Ehdr *ehdr, Elf_Shdr *sechdrs,
105
char *secstrings, struct module *mod)
106
{
107
unsigned int i, num_plts = 0, num_gots = 0;
108
Elf_Shdr *got_sec, *plt_sec, *plt_idx_sec, *tramp = NULL;
109
110
/*
111
* Find the empty .plt sections.
112
*/
113
for (i = 0; i < ehdr->e_shnum; i++) {
114
if (!strcmp(secstrings + sechdrs[i].sh_name, ".got"))
115
mod->arch.got.shndx = i;
116
else if (!strcmp(secstrings + sechdrs[i].sh_name, ".plt"))
117
mod->arch.plt.shndx = i;
118
else if (!strcmp(secstrings + sechdrs[i].sh_name, ".plt.idx"))
119
mod->arch.plt_idx.shndx = i;
120
else if (!strcmp(secstrings + sechdrs[i].sh_name, ".ftrace_trampoline"))
121
tramp = sechdrs + i;
122
}
123
124
if (!mod->arch.got.shndx) {
125
pr_err("%s: module GOT section(s) missing\n", mod->name);
126
return -ENOEXEC;
127
}
128
if (!mod->arch.plt.shndx) {
129
pr_err("%s: module PLT section(s) missing\n", mod->name);
130
return -ENOEXEC;
131
}
132
if (!mod->arch.plt_idx.shndx) {
133
pr_err("%s: module PLT.IDX section(s) missing\n", mod->name);
134
return -ENOEXEC;
135
}
136
137
/* Calculate the maxinum number of entries */
138
for (i = 0; i < ehdr->e_shnum; i++) {
139
int num_rela = sechdrs[i].sh_size / sizeof(Elf_Rela);
140
Elf_Rela *relas = (void *)ehdr + sechdrs[i].sh_offset;
141
Elf_Shdr *dst_sec = sechdrs + sechdrs[i].sh_info;
142
143
if (sechdrs[i].sh_type != SHT_RELA)
144
continue;
145
146
/* ignore relocations that operate on non-exec sections */
147
if (!(dst_sec->sh_flags & SHF_EXECINSTR))
148
continue;
149
150
count_max_entries(relas, num_rela, &num_plts, &num_gots);
151
}
152
153
got_sec = sechdrs + mod->arch.got.shndx;
154
got_sec->sh_type = SHT_NOBITS;
155
got_sec->sh_flags = SHF_ALLOC;
156
got_sec->sh_addralign = L1_CACHE_BYTES;
157
got_sec->sh_size = (num_gots + 1) * sizeof(struct got_entry);
158
mod->arch.got.num_entries = 0;
159
mod->arch.got.max_entries = num_gots;
160
161
plt_sec = sechdrs + mod->arch.plt.shndx;
162
plt_sec->sh_type = SHT_NOBITS;
163
plt_sec->sh_flags = SHF_EXECINSTR | SHF_ALLOC;
164
plt_sec->sh_addralign = L1_CACHE_BYTES;
165
plt_sec->sh_size = (num_plts + 1) * sizeof(struct plt_entry);
166
mod->arch.plt.num_entries = 0;
167
mod->arch.plt.max_entries = num_plts;
168
169
plt_idx_sec = sechdrs + mod->arch.plt_idx.shndx;
170
plt_idx_sec->sh_type = SHT_NOBITS;
171
plt_idx_sec->sh_flags = SHF_ALLOC;
172
plt_idx_sec->sh_addralign = L1_CACHE_BYTES;
173
plt_idx_sec->sh_size = (num_plts + 1) * sizeof(struct plt_idx_entry);
174
mod->arch.plt_idx.num_entries = 0;
175
mod->arch.plt_idx.max_entries = num_plts;
176
177
if (tramp) {
178
tramp->sh_type = SHT_NOBITS;
179
tramp->sh_flags = SHF_EXECINSTR | SHF_ALLOC;
180
tramp->sh_addralign = __alignof__(struct plt_entry);
181
tramp->sh_size = NR_FTRACE_PLTS * sizeof(struct plt_entry);
182
}
183
184
return 0;
185
}
186
187