.. | .. |
---|
16 | 16 | #include <linux/bug.h> |
---|
17 | 17 | #include <linux/nmi.h> |
---|
18 | 18 | |
---|
| 19 | +#include <asm/cpu_entry_area.h> |
---|
19 | 20 | #include <asm/stacktrace.h> |
---|
20 | 21 | |
---|
21 | | -static char *exception_stack_names[N_EXCEPTION_STACKS] = { |
---|
22 | | - [ DOUBLEFAULT_STACK-1 ] = "#DF", |
---|
23 | | - [ NMI_STACK-1 ] = "NMI", |
---|
24 | | - [ DEBUG_STACK-1 ] = "#DB", |
---|
25 | | - [ MCE_STACK-1 ] = "#MC", |
---|
26 | | -}; |
---|
27 | | - |
---|
28 | | -static unsigned long exception_stack_sizes[N_EXCEPTION_STACKS] = { |
---|
29 | | - [0 ... N_EXCEPTION_STACKS - 1] = EXCEPTION_STKSZ, |
---|
30 | | - [DEBUG_STACK - 1] = DEBUG_STKSZ |
---|
| 22 | +static const char * const exception_stack_names[] = { |
---|
| 23 | + [ ESTACK_DF ] = "#DF", |
---|
| 24 | + [ ESTACK_NMI ] = "NMI", |
---|
| 25 | + [ ESTACK_DB ] = "#DB", |
---|
| 26 | + [ ESTACK_MCE ] = "#MC", |
---|
| 27 | + [ ESTACK_VC ] = "#VC", |
---|
| 28 | + [ ESTACK_VC2 ] = "#VC2", |
---|
31 | 29 | }; |
---|
32 | 30 | |
---|
33 | 31 | const char *stack_type_name(enum stack_type type) |
---|
34 | 32 | { |
---|
35 | | - BUILD_BUG_ON(N_EXCEPTION_STACKS != 4); |
---|
| 33 | + BUILD_BUG_ON(N_EXCEPTION_STACKS != 6); |
---|
36 | 34 | |
---|
37 | 35 | if (type == STACK_TYPE_IRQ) |
---|
38 | 36 | return "IRQ"; |
---|
.. | .. |
---|
52 | 50 | return NULL; |
---|
53 | 51 | } |
---|
54 | 52 | |
---|
55 | | -static bool in_exception_stack(unsigned long *stack, struct stack_info *info) |
---|
| 53 | +/** |
---|
| 54 | + * struct estack_pages - Page descriptor for exception stacks |
---|
| 55 | + * @offs: Offset from the start of the exception stack area |
---|
| 56 | + * @size: Size of the exception stack |
---|
| 57 | + * @type: Type to store in the stack_info struct |
---|
| 58 | + */ |
---|
| 59 | +struct estack_pages { |
---|
| 60 | + u32 offs; |
---|
| 61 | + u16 size; |
---|
| 62 | + u16 type; |
---|
| 63 | +}; |
---|
| 64 | + |
---|
| 65 | +#define EPAGERANGE(st) \ |
---|
| 66 | + [PFN_DOWN(CEA_ESTACK_OFFS(st)) ... \ |
---|
| 67 | + PFN_DOWN(CEA_ESTACK_OFFS(st) + CEA_ESTACK_SIZE(st) - 1)] = { \ |
---|
| 68 | + .offs = CEA_ESTACK_OFFS(st), \ |
---|
| 69 | + .size = CEA_ESTACK_SIZE(st), \ |
---|
| 70 | + .type = STACK_TYPE_EXCEPTION + ESTACK_ ##st, } |
---|
| 71 | + |
---|
| 72 | +/* |
---|
| 73 | + * Array of exception stack page descriptors. If the stack is larger than |
---|
| 74 | + * PAGE_SIZE, all pages covering a particular stack will have the same |
---|
| 75 | + * info. The guard pages including the not mapped DB2 stack are zeroed |
---|
| 76 | + * out. |
---|
| 77 | + */ |
---|
| 78 | +static const |
---|
| 79 | +struct estack_pages estack_pages[CEA_ESTACK_PAGES] ____cacheline_aligned = { |
---|
| 80 | + EPAGERANGE(DF), |
---|
| 81 | + EPAGERANGE(NMI), |
---|
| 82 | + EPAGERANGE(DB), |
---|
| 83 | + EPAGERANGE(MCE), |
---|
| 84 | + EPAGERANGE(VC), |
---|
| 85 | + EPAGERANGE(VC2), |
---|
| 86 | +}; |
---|
| 87 | + |
---|
| 88 | +static __always_inline bool in_exception_stack(unsigned long *stack, struct stack_info *info) |
---|
56 | 89 | { |
---|
57 | | - unsigned long *begin, *end; |
---|
| 90 | + unsigned long begin, end, stk = (unsigned long)stack; |
---|
| 91 | + const struct estack_pages *ep; |
---|
58 | 92 | struct pt_regs *regs; |
---|
59 | | - unsigned k; |
---|
| 93 | + unsigned int k; |
---|
60 | 94 | |
---|
61 | | - BUILD_BUG_ON(N_EXCEPTION_STACKS != 4); |
---|
| 95 | + BUILD_BUG_ON(N_EXCEPTION_STACKS != 6); |
---|
62 | 96 | |
---|
63 | | - for (k = 0; k < N_EXCEPTION_STACKS; k++) { |
---|
64 | | - end = (unsigned long *)raw_cpu_ptr(&orig_ist)->ist[k]; |
---|
65 | | - begin = end - (exception_stack_sizes[k] / sizeof(long)); |
---|
66 | | - regs = (struct pt_regs *)end - 1; |
---|
| 97 | + begin = (unsigned long)__this_cpu_read(cea_exception_stacks); |
---|
| 98 | + /* |
---|
| 99 | + * Handle the case where stack trace is collected _before_ |
---|
| 100 | + * cea_exception_stacks had been initialized. |
---|
| 101 | + */ |
---|
| 102 | + if (!begin) |
---|
| 103 | + return false; |
---|
67 | 104 | |
---|
68 | | - if (stack <= begin || stack >= end) |
---|
69 | | - continue; |
---|
| 105 | + end = begin + sizeof(struct cea_exception_stacks); |
---|
| 106 | + /* Bail if @stack is outside the exception stack area. */ |
---|
| 107 | + if (stk < begin || stk >= end) |
---|
| 108 | + return false; |
---|
70 | 109 | |
---|
71 | | - info->type = STACK_TYPE_EXCEPTION + k; |
---|
72 | | - info->begin = begin; |
---|
73 | | - info->end = end; |
---|
74 | | - info->next_sp = (unsigned long *)regs->sp; |
---|
| 110 | + /* Calc page offset from start of exception stacks */ |
---|
| 111 | + k = (stk - begin) >> PAGE_SHIFT; |
---|
| 112 | + /* Lookup the page descriptor */ |
---|
| 113 | + ep = &estack_pages[k]; |
---|
| 114 | + /* Guard page? */ |
---|
| 115 | + if (!ep->size) |
---|
| 116 | + return false; |
---|
75 | 117 | |
---|
76 | | - return true; |
---|
77 | | - } |
---|
| 118 | + begin += (unsigned long)ep->offs; |
---|
| 119 | + end = begin + (unsigned long)ep->size; |
---|
| 120 | + regs = (struct pt_regs *)end - 1; |
---|
78 | 121 | |
---|
79 | | - return false; |
---|
| 122 | + info->type = ep->type; |
---|
| 123 | + info->begin = (unsigned long *)begin; |
---|
| 124 | + info->end = (unsigned long *)end; |
---|
| 125 | + info->next_sp = (unsigned long *)regs->sp; |
---|
| 126 | + return true; |
---|
80 | 127 | } |
---|
81 | 128 | |
---|
82 | | -static bool in_irq_stack(unsigned long *stack, struct stack_info *info) |
---|
| 129 | +static __always_inline bool in_irq_stack(unsigned long *stack, struct stack_info *info) |
---|
83 | 130 | { |
---|
84 | | - unsigned long *end = (unsigned long *)this_cpu_read(irq_stack_ptr); |
---|
| 131 | + unsigned long *end = (unsigned long *)this_cpu_read(hardirq_stack_ptr); |
---|
85 | 132 | unsigned long *begin = end - (IRQ_STACK_SIZE / sizeof(long)); |
---|
86 | 133 | |
---|
87 | 134 | /* |
---|
88 | 135 | * This is a software stack, so 'end' can be a valid stack pointer. |
---|
89 | 136 | * It just means the stack is empty. |
---|
90 | 137 | */ |
---|
91 | | - if (stack <= begin || stack > end) |
---|
| 138 | + if (stack < begin || stack >= end) |
---|
92 | 139 | return false; |
---|
93 | 140 | |
---|
94 | 141 | info->type = STACK_TYPE_IRQ; |
---|
.. | .. |
---|
104 | 151 | return true; |
---|
105 | 152 | } |
---|
106 | 153 | |
---|
| 154 | +bool noinstr get_stack_info_noinstr(unsigned long *stack, struct task_struct *task, |
---|
| 155 | + struct stack_info *info) |
---|
| 156 | +{ |
---|
| 157 | + if (in_task_stack(stack, task, info)) |
---|
| 158 | + return true; |
---|
| 159 | + |
---|
| 160 | + if (task != current) |
---|
| 161 | + return false; |
---|
| 162 | + |
---|
| 163 | + if (in_exception_stack(stack, info)) |
---|
| 164 | + return true; |
---|
| 165 | + |
---|
| 166 | + if (in_irq_stack(stack, info)) |
---|
| 167 | + return true; |
---|
| 168 | + |
---|
| 169 | + if (in_entry_stack(stack, info)) |
---|
| 170 | + return true; |
---|
| 171 | + |
---|
| 172 | + return false; |
---|
| 173 | +} |
---|
| 174 | + |
---|
107 | 175 | int get_stack_info(unsigned long *stack, struct task_struct *task, |
---|
108 | 176 | struct stack_info *info, unsigned long *visit_mask) |
---|
109 | 177 | { |
---|
| 178 | + task = task ? : current; |
---|
| 179 | + |
---|
110 | 180 | if (!stack) |
---|
111 | 181 | goto unknown; |
---|
112 | 182 | |
---|
113 | | - task = task ? : current; |
---|
114 | | - |
---|
115 | | - if (in_task_stack(stack, task, info)) |
---|
116 | | - goto recursion_check; |
---|
117 | | - |
---|
118 | | - if (task != current) |
---|
| 183 | + if (!get_stack_info_noinstr(stack, task, info)) |
---|
119 | 184 | goto unknown; |
---|
120 | 185 | |
---|
121 | | - if (in_exception_stack(stack, info)) |
---|
122 | | - goto recursion_check; |
---|
123 | | - |
---|
124 | | - if (in_irq_stack(stack, info)) |
---|
125 | | - goto recursion_check; |
---|
126 | | - |
---|
127 | | - if (in_entry_stack(stack, info)) |
---|
128 | | - goto recursion_check; |
---|
129 | | - |
---|
130 | | - goto unknown; |
---|
131 | | - |
---|
132 | | -recursion_check: |
---|
133 | 186 | /* |
---|
134 | 187 | * Make sure we don't iterate through any given stack more than once. |
---|
135 | 188 | * If it comes up a second time then there's something wrong going on: |
---|
.. | .. |
---|
137 | 190 | */ |
---|
138 | 191 | if (visit_mask) { |
---|
139 | 192 | if (*visit_mask & (1UL << info->type)) { |
---|
140 | | - printk_deferred_once(KERN_WARNING "WARNING: stack recursion on stack type %d\n", info->type); |
---|
| 193 | + if (task == current) |
---|
| 194 | + printk_deferred_once(KERN_WARNING "WARNING: stack recursion on stack type %d\n", info->type); |
---|
141 | 195 | goto unknown; |
---|
142 | 196 | } |
---|
143 | 197 | *visit_mask |= 1UL << info->type; |
---|