mirror of
https://github.com/brain-hackers/linux-brain.git
synced 2024-06-09 23:36:23 +09:00
d2912cb15b
Based on 2 normalized pattern(s): this program is free software you can redistribute it and or modify it under the terms of the gnu general public license version 2 as published by the free software foundation this program is free software you can redistribute it and or modify it under the terms of the gnu general public license version 2 as published by the free software foundation # extracted by the scancode license scanner the SPDX license identifier GPL-2.0-only has been chosen to replace the boilerplate/reference in 4122 file(s). Signed-off-by: Thomas Gleixner <tglx@linutronix.de> Reviewed-by: Enrico Weigelt <info@metux.net> Reviewed-by: Kate Stewart <kstewart@linuxfoundation.org> Reviewed-by: Allison Randal <allison@lohutok.net> Cc: linux-spdx@vger.kernel.org Link: https://lkml.kernel.org/r/20190604081206.933168790@linutronix.de Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
76 lines
1.8 KiB
C
76 lines
1.8 KiB
C
// SPDX-License-Identifier: GPL-2.0-only
|
|
/*
|
|
* Copyright (C) 2001 - 2007 Jeff Dike (jdike@{addtoit,linux.intel}.com)
|
|
* Copyright (C) 2013 Richard Weinberger <richard@nod.at>
|
|
* Copyright (C) 2014 Google Inc., Author: Daniel Walter <dwalter@google.com>
|
|
*/
|
|
|
|
#include <linux/kallsyms.h>
|
|
#include <linux/kernel.h>
|
|
#include <linux/sched.h>
|
|
#include <linux/stacktrace.h>
|
|
#include <linux/module.h>
|
|
#include <linux/uaccess.h>
|
|
#include <asm/stacktrace.h>
|
|
|
|
void dump_trace(struct task_struct *tsk,
|
|
const struct stacktrace_ops *ops,
|
|
void *data)
|
|
{
|
|
int reliable = 0;
|
|
unsigned long *sp, bp, addr;
|
|
struct pt_regs *segv_regs = tsk->thread.segv_regs;
|
|
struct stack_frame *frame;
|
|
|
|
bp = get_frame_pointer(tsk, segv_regs);
|
|
sp = get_stack_pointer(tsk, segv_regs);
|
|
|
|
frame = (struct stack_frame *)bp;
|
|
while (((long) sp & (THREAD_SIZE-1)) != 0) {
|
|
addr = *sp;
|
|
if (__kernel_text_address(addr)) {
|
|
reliable = 0;
|
|
if ((unsigned long) sp == bp + sizeof(long)) {
|
|
frame = frame ? frame->next_frame : NULL;
|
|
bp = (unsigned long)frame;
|
|
reliable = 1;
|
|
}
|
|
ops->address(data, addr, reliable);
|
|
}
|
|
sp++;
|
|
}
|
|
}
|
|
|
|
static void save_addr(void *data, unsigned long address, int reliable)
|
|
{
|
|
struct stack_trace *trace = data;
|
|
|
|
if (!reliable)
|
|
return;
|
|
if (trace->nr_entries >= trace->max_entries)
|
|
return;
|
|
|
|
trace->entries[trace->nr_entries++] = address;
|
|
}
|
|
|
|
static const struct stacktrace_ops dump_ops = {
|
|
.address = save_addr
|
|
};
|
|
|
|
static void __save_stack_trace(struct task_struct *tsk, struct stack_trace *trace)
|
|
{
|
|
dump_trace(tsk, &dump_ops, trace);
|
|
}
|
|
|
|
void save_stack_trace(struct stack_trace *trace)
|
|
{
|
|
__save_stack_trace(current, trace);
|
|
}
|
|
EXPORT_SYMBOL_GPL(save_stack_trace);
|
|
|
|
void save_stack_trace_tsk(struct task_struct *tsk, struct stack_trace *trace)
|
|
{
|
|
__save_stack_trace(tsk, trace);
|
|
}
|
|
EXPORT_SYMBOL_GPL(save_stack_trace_tsk);
|