Commit | Line | Data |
---|---|---|
867e359b CM |
1 | /* |
2 | * Copyright 2010 Tilera Corporation. All Rights Reserved. | |
3 | * | |
4 | * This program is free software; you can redistribute it and/or | |
5 | * modify it under the terms of the GNU General Public License | |
6 | * as published by the Free Software Foundation, version 2. | |
7 | * | |
8 | * This program is distributed in the hope that it will be useful, but | |
9 | * WITHOUT ANY WARRANTY; without even the implied warranty of | |
10 | * MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE, GOOD TITLE or | |
11 | * NON INFRINGEMENT. See the GNU General Public License for | |
12 | * more details. | |
13 | */ | |
14 | ||
15 | #include <linux/sched.h> | |
16 | #include <linux/kernel.h> | |
17 | #include <linux/kprobes.h> | |
18 | #include <linux/module.h> | |
19 | #include <linux/pfn.h> | |
20 | #include <linux/kallsyms.h> | |
21 | #include <linux/stacktrace.h> | |
22 | #include <linux/uaccess.h> | |
23 | #include <linux/mmzone.h> | |
5f639fdc CM |
24 | #include <linux/dcache.h> |
25 | #include <linux/fs.h> | |
0cc96a74 | 26 | #include <linux/string.h> |
867e359b CM |
27 | #include <asm/backtrace.h> |
28 | #include <asm/page.h> | |
867e359b | 29 | #include <asm/ucontext.h> |
34f2c0ac | 30 | #include <asm/switch_to.h> |
867e359b CM |
31 | #include <asm/sigframe.h> |
32 | #include <asm/stack.h> | |
4a556f4f | 33 | #include <asm/vdso.h> |
867e359b CM |
34 | #include <arch/abi.h> |
35 | #include <arch/interrupts.h> | |
36 | ||
dabe98c9 CM |
37 | #define KBT_ONGOING 0 /* Backtrace still ongoing */ |
38 | #define KBT_DONE 1 /* Backtrace cleanly completed */ | |
39 | #define KBT_RUNNING 2 /* Can't run backtrace on a running task */ | |
40 | #define KBT_LOOP 3 /* Backtrace entered a loop */ | |
867e359b CM |
41 | |
42 | /* Is address on the specified kernel stack? */ | |
93013a0f | 43 | static int in_kernel_stack(struct KBacktraceIterator *kbt, unsigned long sp) |
867e359b CM |
44 | { |
45 | ulong kstack_base = (ulong) kbt->task->stack; | |
46 | if (kstack_base == 0) /* corrupt task pointer; just follow stack... */ | |
47 | return sp >= PAGE_OFFSET && sp < (unsigned long)high_memory; | |
48 | return sp >= kstack_base && sp < kstack_base + THREAD_SIZE; | |
49 | } | |
50 | ||
867e359b | 51 | /* Callback for backtracer; basically a glorified memcpy */ |
93013a0f | 52 | static bool read_memory_func(void *result, unsigned long address, |
867e359b CM |
53 | unsigned int size, void *vkbt) |
54 | { | |
55 | int retval; | |
56 | struct KBacktraceIterator *kbt = (struct KBacktraceIterator *)vkbt; | |
5f639fdc CM |
57 | |
58 | if (address == 0) | |
59 | return 0; | |
3cebbafd | 60 | if (__kernel_text_address(address)) { |
867e359b CM |
61 | /* OK to read kernel code. */ |
62 | } else if (address >= PAGE_OFFSET) { | |
63 | /* We only tolerate kernel-space reads of this task's stack */ | |
64 | if (!in_kernel_stack(kbt, address)) | |
65 | return 0; | |
5f639fdc CM |
66 | } else if (!kbt->is_current) { |
67 | return 0; /* can't read from other user address spaces */ | |
867e359b CM |
68 | } |
69 | pagefault_disable(); | |
0707ad30 CM |
70 | retval = __copy_from_user_inatomic(result, |
71 | (void __user __force *)address, | |
867e359b CM |
72 | size); |
73 | pagefault_enable(); | |
74 | return (retval == 0); | |
75 | } | |
76 | ||
77 | /* Return a pt_regs pointer for a valid fault handler frame */ | |
78 | static struct pt_regs *valid_fault_handler(struct KBacktraceIterator* kbt) | |
79 | { | |
867e359b CM |
80 | const char *fault = NULL; /* happy compiler */ |
81 | char fault_buf[64]; | |
93013a0f | 82 | unsigned long sp = kbt->it.sp; |
867e359b CM |
83 | struct pt_regs *p; |
84 | ||
5f639fdc CM |
85 | if (sp % sizeof(long) != 0) |
86 | return NULL; | |
867e359b CM |
87 | if (!in_kernel_stack(kbt, sp)) |
88 | return NULL; | |
89 | if (!in_kernel_stack(kbt, sp + C_ABI_SAVE_AREA_SIZE + PTREGS_SIZE-1)) | |
90 | return NULL; | |
91 | p = (struct pt_regs *)(sp + C_ABI_SAVE_AREA_SIZE); | |
92 | if (p->faultnum == INT_SWINT_1 || p->faultnum == INT_SWINT_1_SIGRETURN) | |
93 | fault = "syscall"; | |
94 | else { | |
95 | if (kbt->verbose) { /* else we aren't going to use it */ | |
96 | snprintf(fault_buf, sizeof(fault_buf), | |
97 | "interrupt %ld", p->faultnum); | |
98 | fault = fault_buf; | |
99 | } | |
100 | } | |
101 | if (EX1_PL(p->ex1) == KERNEL_PL && | |
3cebbafd | 102 | __kernel_text_address(p->pc) && |
867e359b CM |
103 | in_kernel_stack(kbt, p->sp) && |
104 | p->sp >= sp) { | |
105 | if (kbt->verbose) | |
0707ad30 | 106 | pr_err(" <%s while in kernel mode>\n", fault); |
051168df | 107 | } else if (user_mode(p) && |
3ef23111 | 108 | p->sp < PAGE_OFFSET && p->sp != 0) { |
867e359b | 109 | if (kbt->verbose) |
0707ad30 | 110 | pr_err(" <%s while in user mode>\n", fault); |
867e359b | 111 | } else if (kbt->verbose) { |
0707ad30 | 112 | pr_err(" (odd fault: pc %#lx, sp %#lx, ex1 %#lx?)\n", |
867e359b CM |
113 | p->pc, p->sp, p->ex1); |
114 | p = NULL; | |
115 | } | |
7f04f081 | 116 | if (!kbt->profile || ((1ULL << p->faultnum) & QUEUED_INTERRUPTS) == 0) |
867e359b | 117 | return p; |
867e359b CM |
118 | return NULL; |
119 | } | |
120 | ||
121 | /* Is the pc pointing to a sigreturn trampoline? */ | |
93013a0f | 122 | static int is_sigreturn(unsigned long pc) |
867e359b | 123 | { |
4a556f4f | 124 | return current->mm && (pc == VDSO_SYM(&__vdso_rt_sigreturn)); |
867e359b CM |
125 | } |
126 | ||
127 | /* Return a pt_regs pointer for a valid signal handler frame */ | |
5f639fdc CM |
128 | static struct pt_regs *valid_sigframe(struct KBacktraceIterator* kbt, |
129 | struct rt_sigframe* kframe) | |
867e359b CM |
130 | { |
131 | BacktraceIterator *b = &kbt->it; | |
132 | ||
4a556f4f | 133 | if (is_sigreturn(b->pc) && b->sp < PAGE_OFFSET && |
5f639fdc CM |
134 | b->sp % sizeof(long) == 0) { |
135 | int retval; | |
136 | pagefault_disable(); | |
137 | retval = __copy_from_user_inatomic( | |
138 | kframe, (void __user __force *)b->sp, | |
139 | sizeof(*kframe)); | |
140 | pagefault_enable(); | |
141 | if (retval != 0 || | |
142 | (unsigned int)(kframe->info.si_signo) >= _NSIG) | |
867e359b | 143 | return NULL; |
867e359b | 144 | if (kbt->verbose) { |
0707ad30 | 145 | pr_err(" <received signal %d>\n", |
5f639fdc | 146 | kframe->info.si_signo); |
867e359b | 147 | } |
5f639fdc | 148 | return (struct pt_regs *)&kframe->uc.uc_mcontext; |
867e359b CM |
149 | } |
150 | return NULL; | |
151 | } | |
152 | ||
0707ad30 | 153 | static int KBacktraceIterator_is_sigreturn(struct KBacktraceIterator *kbt) |
867e359b CM |
154 | { |
155 | return is_sigreturn(kbt->it.pc); | |
156 | } | |
157 | ||
158 | static int KBacktraceIterator_restart(struct KBacktraceIterator *kbt) | |
159 | { | |
160 | struct pt_regs *p; | |
5f639fdc | 161 | struct rt_sigframe kframe; |
867e359b CM |
162 | |
163 | p = valid_fault_handler(kbt); | |
164 | if (p == NULL) | |
5f639fdc | 165 | p = valid_sigframe(kbt, &kframe); |
867e359b CM |
166 | if (p == NULL) |
167 | return 0; | |
168 | backtrace_init(&kbt->it, read_memory_func, kbt, | |
169 | p->pc, p->lr, p->sp, p->regs[52]); | |
170 | kbt->new_context = 1; | |
171 | return 1; | |
172 | } | |
173 | ||
174 | /* Find a frame that isn't a sigreturn, if there is one. */ | |
175 | static int KBacktraceIterator_next_item_inclusive( | |
176 | struct KBacktraceIterator *kbt) | |
177 | { | |
178 | for (;;) { | |
179 | do { | |
180 | if (!KBacktraceIterator_is_sigreturn(kbt)) | |
dabe98c9 | 181 | return KBT_ONGOING; |
867e359b CM |
182 | } while (backtrace_next(&kbt->it)); |
183 | ||
184 | if (!KBacktraceIterator_restart(kbt)) | |
dabe98c9 | 185 | return KBT_DONE; |
867e359b CM |
186 | } |
187 | } | |
188 | ||
189 | /* | |
190 | * If the current sp is on a page different than what we recorded | |
191 | * as the top-of-kernel-stack last time we context switched, we have | |
192 | * probably blown the stack, and nothing is going to work out well. | |
193 | * If we can at least get out a warning, that may help the debug, | |
194 | * though we probably won't be able to backtrace into the code that | |
195 | * actually did the recursive damage. | |
196 | */ | |
197 | static void validate_stack(struct pt_regs *regs) | |
198 | { | |
bc1a298f | 199 | int cpu = raw_smp_processor_id(); |
867e359b | 200 | unsigned long ksp0 = get_current_ksp0(); |
35f05976 | 201 | unsigned long ksp0_base = ksp0 & -THREAD_SIZE; |
867e359b CM |
202 | unsigned long sp = stack_pointer; |
203 | ||
204 | if (EX1_PL(regs->ex1) == KERNEL_PL && regs->sp >= ksp0) { | |
35f05976 | 205 | pr_err("WARNING: cpu %d: kernel stack %#lx..%#lx underrun!\n" |
867e359b | 206 | " sp %#lx (%#lx in caller), caller pc %#lx, lr %#lx\n", |
35f05976 | 207 | cpu, ksp0_base, ksp0, sp, regs->sp, regs->pc, regs->lr); |
867e359b CM |
208 | } |
209 | ||
210 | else if (sp < ksp0_base + sizeof(struct thread_info)) { | |
35f05976 | 211 | pr_err("WARNING: cpu %d: kernel stack %#lx..%#lx overrun!\n" |
867e359b | 212 | " sp %#lx (%#lx in caller), caller pc %#lx, lr %#lx\n", |
35f05976 | 213 | cpu, ksp0_base, ksp0, sp, regs->sp, regs->pc, regs->lr); |
867e359b CM |
214 | } |
215 | } | |
216 | ||
217 | void KBacktraceIterator_init(struct KBacktraceIterator *kbt, | |
218 | struct task_struct *t, struct pt_regs *regs) | |
219 | { | |
93013a0f | 220 | unsigned long pc, lr, sp, r52; |
867e359b CM |
221 | int is_current; |
222 | ||
223 | /* | |
224 | * Set up callback information. We grab the kernel stack base | |
5f639fdc | 225 | * so we will allow reads of that address range. |
867e359b | 226 | */ |
5f639fdc | 227 | is_current = (t == NULL || t == current); |
867e359b CM |
228 | kbt->is_current = is_current; |
229 | if (is_current) | |
230 | t = validate_current(); | |
231 | kbt->task = t; | |
867e359b CM |
232 | kbt->verbose = 0; /* override in caller if desired */ |
233 | kbt->profile = 0; /* override in caller if desired */ | |
dabe98c9 | 234 | kbt->end = KBT_ONGOING; |
5f639fdc CM |
235 | kbt->new_context = 1; |
236 | if (is_current) | |
867e359b | 237 | validate_stack(regs); |
867e359b CM |
238 | |
239 | if (regs == NULL) { | |
867e359b CM |
240 | if (is_current || t->state == TASK_RUNNING) { |
241 | /* Can't do this; we need registers */ | |
dabe98c9 | 242 | kbt->end = KBT_RUNNING; |
867e359b CM |
243 | return; |
244 | } | |
0707ad30 | 245 | pc = get_switch_to_pc(); |
867e359b CM |
246 | lr = t->thread.pc; |
247 | sp = t->thread.ksp; | |
248 | r52 = 0; | |
249 | } else { | |
250 | pc = regs->pc; | |
251 | lr = regs->lr; | |
252 | sp = regs->sp; | |
253 | r52 = regs->regs[52]; | |
254 | } | |
255 | ||
256 | backtrace_init(&kbt->it, read_memory_func, kbt, pc, lr, sp, r52); | |
dabe98c9 | 257 | kbt->end = KBacktraceIterator_next_item_inclusive(kbt); |
867e359b CM |
258 | } |
259 | EXPORT_SYMBOL(KBacktraceIterator_init); | |
260 | ||
261 | int KBacktraceIterator_end(struct KBacktraceIterator *kbt) | |
262 | { | |
dabe98c9 | 263 | return kbt->end != KBT_ONGOING; |
867e359b CM |
264 | } |
265 | EXPORT_SYMBOL(KBacktraceIterator_end); | |
266 | ||
267 | void KBacktraceIterator_next(struct KBacktraceIterator *kbt) | |
268 | { | |
93013a0f | 269 | unsigned long old_pc = kbt->it.pc, old_sp = kbt->it.sp; |
867e359b | 270 | kbt->new_context = 0; |
dabe98c9 CM |
271 | if (!backtrace_next(&kbt->it) && !KBacktraceIterator_restart(kbt)) { |
272 | kbt->end = KBT_DONE; | |
273 | return; | |
274 | } | |
275 | kbt->end = KBacktraceIterator_next_item_inclusive(kbt); | |
276 | if (old_pc == kbt->it.pc && old_sp == kbt->it.sp) { | |
277 | /* Trapped in a loop; give up. */ | |
278 | kbt->end = KBT_LOOP; | |
279 | } | |
867e359b CM |
280 | } |
281 | EXPORT_SYMBOL(KBacktraceIterator_next); | |
282 | ||
5f639fdc CM |
283 | static void describe_addr(struct KBacktraceIterator *kbt, |
284 | unsigned long address, | |
285 | int have_mmap_sem, char *buf, size_t bufsize) | |
286 | { | |
287 | struct vm_area_struct *vma; | |
288 | size_t namelen, remaining; | |
289 | unsigned long size, offset, adjust; | |
290 | char *p, *modname; | |
291 | const char *name; | |
292 | int rc; | |
293 | ||
294 | /* | |
295 | * Look one byte back for every caller frame (i.e. those that | |
296 | * aren't a new context) so we look up symbol data for the | |
297 | * call itself, not the following instruction, which may be on | |
298 | * a different line (or in a different function). | |
299 | */ | |
300 | adjust = !kbt->new_context; | |
301 | address -= adjust; | |
302 | ||
303 | if (address >= PAGE_OFFSET) { | |
304 | /* Handle kernel symbols. */ | |
305 | BUG_ON(bufsize < KSYM_NAME_LEN); | |
306 | name = kallsyms_lookup(address, &size, &offset, | |
307 | &modname, buf); | |
308 | if (name == NULL) { | |
309 | buf[0] = '\0'; | |
310 | return; | |
311 | } | |
312 | namelen = strlen(buf); | |
313 | remaining = (bufsize - 1) - namelen; | |
314 | p = buf + namelen; | |
315 | rc = snprintf(p, remaining, "+%#lx/%#lx ", | |
316 | offset + adjust, size); | |
317 | if (modname && rc < remaining) | |
318 | snprintf(p + rc, remaining - rc, "[%s] ", modname); | |
319 | buf[bufsize-1] = '\0'; | |
320 | return; | |
321 | } | |
322 | ||
323 | /* If we don't have the mmap_sem, we can't show any more info. */ | |
324 | buf[0] = '\0'; | |
325 | if (!have_mmap_sem) | |
326 | return; | |
327 | ||
328 | /* Find vma info. */ | |
329 | vma = find_vma(kbt->task->mm, address); | |
330 | if (vma == NULL || address < vma->vm_start) { | |
331 | snprintf(buf, bufsize, "[unmapped address] "); | |
332 | return; | |
333 | } | |
334 | ||
335 | if (vma->vm_file) { | |
5f639fdc CM |
336 | p = d_path(&vma->vm_file->f_path, buf, bufsize); |
337 | if (IS_ERR(p)) | |
338 | p = "?"; | |
0cc96a74 | 339 | name = kbasename(p); |
5f639fdc | 340 | } else { |
0cc96a74 | 341 | name = "anon"; |
5f639fdc CM |
342 | } |
343 | ||
344 | /* Generate a string description of the vma info. */ | |
0cc96a74 | 345 | namelen = strlen(name); |
5f639fdc | 346 | remaining = (bufsize - 1) - namelen; |
0cc96a74 | 347 | memmove(buf, name, namelen); |
5f639fdc CM |
348 | snprintf(buf + namelen, remaining, "[%lx+%lx] ", |
349 | vma->vm_start, vma->vm_end - vma->vm_start); | |
350 | } | |
351 | ||
3ef23111 CM |
352 | /* |
353 | * Avoid possible crash recursion during backtrace. If it happens, it | |
354 | * makes it easy to lose the actual root cause of the failure, so we | |
355 | * put a simple guard on all the backtrace loops. | |
356 | */ | |
357 | static bool start_backtrace(void) | |
358 | { | |
359 | if (current->thread.in_backtrace) { | |
360 | pr_err("Backtrace requested while in backtrace!\n"); | |
361 | return false; | |
362 | } | |
363 | current->thread.in_backtrace = true; | |
364 | return true; | |
365 | } | |
366 | ||
367 | static void end_backtrace(void) | |
368 | { | |
369 | current->thread.in_backtrace = false; | |
370 | } | |
371 | ||
867e359b CM |
372 | /* |
373 | * This method wraps the backtracer's more generic support. | |
374 | * It is only invoked from the architecture-specific code; show_stack() | |
375 | * and dump_stack() (in entry.S) are architecture-independent entry points. | |
376 | */ | |
377 | void tile_show_stack(struct KBacktraceIterator *kbt, int headers) | |
378 | { | |
379 | int i; | |
5f639fdc | 380 | int have_mmap_sem = 0; |
867e359b | 381 | |
3ef23111 CM |
382 | if (!start_backtrace()) |
383 | return; | |
867e359b CM |
384 | if (headers) { |
385 | /* | |
386 | * Add a blank line since if we are called from panic(), | |
387 | * then bust_spinlocks() spit out a space in front of us | |
388 | * and it will mess up our KERN_ERR. | |
389 | */ | |
f4743673 | 390 | pr_err("Starting stack dump of tid %d, pid %d (%s) on cpu %d at cycle %lld\n", |
867e359b | 391 | kbt->task->pid, kbt->task->tgid, kbt->task->comm, |
bc1a298f | 392 | raw_smp_processor_id(), get_cycles()); |
867e359b | 393 | } |
867e359b CM |
394 | kbt->verbose = 1; |
395 | i = 0; | |
396 | for (; !KBacktraceIterator_end(kbt); KBacktraceIterator_next(kbt)) { | |
867e359b | 397 | char namebuf[KSYM_NAME_LEN+100]; |
5f639fdc | 398 | unsigned long address = kbt->it.pc; |
867e359b | 399 | |
5f639fdc CM |
400 | /* Try to acquire the mmap_sem as we pass into userspace. */ |
401 | if (address < PAGE_OFFSET && !have_mmap_sem && kbt->task->mm) | |
402 | have_mmap_sem = | |
403 | down_read_trylock(&kbt->task->mm->mmap_sem); | |
404 | ||
405 | describe_addr(kbt, address, have_mmap_sem, | |
406 | namebuf, sizeof(namebuf)); | |
867e359b | 407 | |
0707ad30 | 408 | pr_err(" frame %d: 0x%lx %s(sp 0x%lx)\n", |
867e359b CM |
409 | i++, address, namebuf, (unsigned long)(kbt->it.sp)); |
410 | ||
411 | if (i >= 100) { | |
f4743673 | 412 | pr_err("Stack dump truncated (%d frames)\n", i); |
867e359b CM |
413 | break; |
414 | } | |
415 | } | |
dabe98c9 CM |
416 | if (kbt->end == KBT_LOOP) |
417 | pr_err("Stack dump stopped; next frame identical to this one\n"); | |
867e359b | 418 | if (headers) |
0707ad30 | 419 | pr_err("Stack dump complete\n"); |
5f639fdc CM |
420 | if (have_mmap_sem) |
421 | up_read(&kbt->task->mm->mmap_sem); | |
3ef23111 | 422 | end_backtrace(); |
867e359b CM |
423 | } |
424 | EXPORT_SYMBOL(tile_show_stack); | |
425 | ||
426 | ||
427 | /* This is called from show_regs() and _dump_stack() */ | |
428 | void dump_stack_regs(struct pt_regs *regs) | |
429 | { | |
430 | struct KBacktraceIterator kbt; | |
431 | KBacktraceIterator_init(&kbt, NULL, regs); | |
432 | tile_show_stack(&kbt, 1); | |
433 | } | |
434 | EXPORT_SYMBOL(dump_stack_regs); | |
435 | ||
436 | static struct pt_regs *regs_to_pt_regs(struct pt_regs *regs, | |
437 | ulong pc, ulong lr, ulong sp, ulong r52) | |
438 | { | |
439 | memset(regs, 0, sizeof(struct pt_regs)); | |
440 | regs->pc = pc; | |
441 | regs->lr = lr; | |
442 | regs->sp = sp; | |
443 | regs->regs[52] = r52; | |
444 | return regs; | |
445 | } | |
446 | ||
447 | /* This is called from dump_stack() and just converts to pt_regs */ | |
448 | void _dump_stack(int dummy, ulong pc, ulong lr, ulong sp, ulong r52) | |
449 | { | |
450 | struct pt_regs regs; | |
451 | dump_stack_regs(regs_to_pt_regs(®s, pc, lr, sp, r52)); | |
452 | } | |
453 | ||
454 | /* This is called from KBacktraceIterator_init_current() */ | |
455 | void _KBacktraceIterator_init_current(struct KBacktraceIterator *kbt, ulong pc, | |
456 | ulong lr, ulong sp, ulong r52) | |
457 | { | |
458 | struct pt_regs regs; | |
459 | KBacktraceIterator_init(kbt, NULL, | |
460 | regs_to_pt_regs(®s, pc, lr, sp, r52)); | |
461 | } | |
462 | ||
0a0fca9d | 463 | /* This is called only from kernel/sched/core.c, with esp == NULL */ |
867e359b CM |
464 | void show_stack(struct task_struct *task, unsigned long *esp) |
465 | { | |
466 | struct KBacktraceIterator kbt; | |
467 | if (task == NULL || task == current) | |
468 | KBacktraceIterator_init_current(&kbt); | |
469 | else | |
470 | KBacktraceIterator_init(&kbt, task, NULL); | |
471 | tile_show_stack(&kbt, 0); | |
472 | } | |
473 | ||
474 | #ifdef CONFIG_STACKTRACE | |
475 | ||
476 | /* Support generic Linux stack API too */ | |
477 | ||
478 | void save_stack_trace_tsk(struct task_struct *task, struct stack_trace *trace) | |
479 | { | |
480 | struct KBacktraceIterator kbt; | |
481 | int skip = trace->skip; | |
482 | int i = 0; | |
483 | ||
3ef23111 CM |
484 | if (!start_backtrace()) |
485 | goto done; | |
867e359b CM |
486 | if (task == NULL || task == current) |
487 | KBacktraceIterator_init_current(&kbt); | |
488 | else | |
489 | KBacktraceIterator_init(&kbt, task, NULL); | |
490 | for (; !KBacktraceIterator_end(&kbt); KBacktraceIterator_next(&kbt)) { | |
491 | if (skip) { | |
492 | --skip; | |
493 | continue; | |
494 | } | |
495 | if (i >= trace->max_entries || kbt.it.pc < PAGE_OFFSET) | |
496 | break; | |
497 | trace->entries[i++] = kbt.it.pc; | |
498 | } | |
3ef23111 CM |
499 | end_backtrace(); |
500 | done: | |
867e359b CM |
501 | trace->nr_entries = i; |
502 | } | |
503 | EXPORT_SYMBOL(save_stack_trace_tsk); | |
504 | ||
505 | void save_stack_trace(struct stack_trace *trace) | |
506 | { | |
507 | save_stack_trace_tsk(NULL, trace); | |
508 | } | |
7c63e1ee | 509 | EXPORT_SYMBOL_GPL(save_stack_trace); |
867e359b CM |
510 | |
511 | #endif | |
512 | ||
513 | /* In entry.S */ | |
514 | EXPORT_SYMBOL(KBacktraceIterator_init_current); |