blob: 241b4064187333f04998fa3aaa1d3352608cdabd [file] [log] [blame]
Greg Kroah-Hartmanb2441312017-11-01 15:07:57 +01001// SPDX-License-Identifier: GPL-2.0
Linus Torvalds1da177e2005-04-16 15:20:36 -07002/*
3 * linux/arch/sparc/mm/extable.c
4 */
5
Linus Torvalds1da177e2005-04-16 15:20:36 -07006#include <linux/module.h>
Paul Gortmaker54373442017-01-10 10:12:55 -05007#include <linux/extable.h>
Linus Torvalds7c0f6ba2016-12-24 11:46:01 -08008#include <linux/uaccess.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -07009
10void sort_extable(struct exception_table_entry *start,
11 struct exception_table_entry *finish)
12{
13}
14
15/* Caller knows they are in a range if ret->fixup == 0 */
16const struct exception_table_entry *
Thomas Meyera94c33d2017-07-10 15:51:58 -070017search_extable(const struct exception_table_entry *base,
18 const size_t num,
Linus Torvalds1da177e2005-04-16 15:20:36 -070019 unsigned long value)
20{
Thomas Meyera94c33d2017-07-10 15:51:58 -070021 int i;
Linus Torvalds1da177e2005-04-16 15:20:36 -070022
23 /* Single insn entries are encoded as:
24 * word 1: insn address
25 * word 2: fixup code address
26 *
27 * Range entries are encoded as:
28 * word 1: first insn address
29 * word 2: 0
30 * word 3: last insn address + 4 bytes
31 * word 4: fixup code address
32 *
Rusty Russellad6561d2009-06-12 21:47:03 -060033 * Deleted entries are encoded as:
34 * word 1: unused
35 * word 2: -1
36 *
Linus Torvalds1da177e2005-04-16 15:20:36 -070037 * See asm/uaccess.h for more details.
38 */
39
40 /* 1. Try to find an exact match. */
Thomas Meyera94c33d2017-07-10 15:51:58 -070041 for (i = 0; i < num; i++) {
42 if (base[i].fixup == 0) {
Linus Torvalds1da177e2005-04-16 15:20:36 -070043 /* A range entry, skip both parts. */
Thomas Meyera94c33d2017-07-10 15:51:58 -070044 i++;
Linus Torvalds1da177e2005-04-16 15:20:36 -070045 continue;
46 }
47
Rusty Russellad6561d2009-06-12 21:47:03 -060048 /* A deleted entry; see trim_init_extable */
Thomas Meyera94c33d2017-07-10 15:51:58 -070049 if (base[i].fixup == -1)
Rusty Russellad6561d2009-06-12 21:47:03 -060050 continue;
51
Thomas Meyera94c33d2017-07-10 15:51:58 -070052 if (base[i].insn == value)
53 return &base[i];
Linus Torvalds1da177e2005-04-16 15:20:36 -070054 }
55
56 /* 2. Try to find a range match. */
Thomas Meyera94c33d2017-07-10 15:51:58 -070057 for (i = 0; i < (num - 1); i++) {
58 if (base[i].fixup)
Linus Torvalds1da177e2005-04-16 15:20:36 -070059 continue;
60
Thomas Meyera94c33d2017-07-10 15:51:58 -070061 if (base[i].insn <= value && base[i + 1].insn > value)
62 return &base[i];
Linus Torvalds1da177e2005-04-16 15:20:36 -070063
Thomas Meyera94c33d2017-07-10 15:51:58 -070064 i++;
Linus Torvalds1da177e2005-04-16 15:20:36 -070065 }
66
67 return NULL;
68}
69
Rusty Russellad6561d2009-06-12 21:47:03 -060070#ifdef CONFIG_MODULES
71/* We could memmove them around; easier to mark the trimmed ones. */
72void trim_init_extable(struct module *m)
73{
74 unsigned int i;
75 bool range;
76
77 for (i = 0; i < m->num_exentries; i += range ? 2 : 1) {
78 range = m->extable[i].fixup == 0;
79
80 if (within_module_init(m->extable[i].insn, m)) {
81 m->extable[i].fixup = -1;
82 if (range)
83 m->extable[i+1].fixup = -1;
84 }
85 if (range)
86 i++;
87 }
88}
89#endif /* CONFIG_MODULES */
90
Linus Torvalds1da177e2005-04-16 15:20:36 -070091/* Special extable search, which handles ranges. Returns fixup */
92unsigned long search_extables_range(unsigned long addr, unsigned long *g2)
93{
94 const struct exception_table_entry *entry;
95
96 entry = search_exception_tables(addr);
97 if (!entry)
98 return 0;
99
100 /* Inside range? Fix g2 and return correct fixup */
101 if (!entry->fixup) {
102 *g2 = (addr - entry->insn) / 4;
103 return (entry + 1)->fixup;
104 }
105
106 return entry->fixup;
107}