mirror of
https://github.com/AuxXxilium/linux_dsm_epyc7002.git
synced 2024-12-20 20:49:01 +07:00
08dbd0f8ef
Based on 1 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 and only version 2 as published by the free software foundation this program is distributed in the hope that it will be useful but without any warranty without even the implied warranty of merchantability or fitness for a particular purpose see the gnu general public license for more details you should have received a copy of the gnu general public license along with this program if not write to the free software foundation inc 51 franklin street fifth floor boston ma 02110 1301 usa extracted by the scancode license scanner the SPDX license identifier GPL-2.0-only has been chosen to replace the boilerplate/reference in 94 file(s). Signed-off-by: Thomas Gleixner <tglx@linutronix.de> Reviewed-by: Allison Randal <allison@lohutok.net> Reviewed-by: Richard Fontana <rfontana@redhat.com> Reviewed-by: Alexios Zavras <alexios.zavras@intel.com> Cc: linux-spdx@vger.kernel.org Link: https://lkml.kernel.org/r/20190529141334.043630402@linutronix.de Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
55 lines
1.1 KiB
C
55 lines
1.1 KiB
C
// SPDX-License-Identifier: GPL-2.0-only
|
|
/*
|
|
* Stacktrace support for Hexagon
|
|
*
|
|
* Copyright (c) 2010-2011, The Linux Foundation. All rights reserved.
|
|
*/
|
|
|
|
#include <linux/sched.h>
|
|
#include <linux/sched/task_stack.h>
|
|
#include <linux/stacktrace.h>
|
|
#include <linux/thread_info.h>
|
|
#include <linux/module.h>
|
|
|
|
register unsigned long current_frame_pointer asm("r30");
|
|
|
|
struct stackframe {
|
|
unsigned long fp;
|
|
unsigned long rets;
|
|
};
|
|
|
|
/*
|
|
* Save stack-backtrace addresses into a stack_trace buffer.
|
|
*/
|
|
void save_stack_trace(struct stack_trace *trace)
|
|
{
|
|
unsigned long low, high;
|
|
unsigned long fp;
|
|
struct stackframe *frame;
|
|
int skip = trace->skip;
|
|
|
|
low = (unsigned long)task_stack_page(current);
|
|
high = low + THREAD_SIZE;
|
|
fp = current_frame_pointer;
|
|
|
|
while (fp >= low && fp <= (high - sizeof(*frame))) {
|
|
frame = (struct stackframe *)fp;
|
|
|
|
if (skip) {
|
|
skip--;
|
|
} else {
|
|
trace->entries[trace->nr_entries++] = frame->rets;
|
|
if (trace->nr_entries >= trace->max_entries)
|
|
break;
|
|
}
|
|
|
|
/*
|
|
* The next frame must be at a higher address than the
|
|
* current frame.
|
|
*/
|
|
low = fp + sizeof(*frame);
|
|
fp = frame->fp;
|
|
}
|
|
}
|
|
EXPORT_SYMBOL_GPL(save_stack_trace);
|