c5ac25e0d7
The prolugue unwinder rely on symbol info. When PC is not in kernel text address, it cannot find relative symbol info and it will be broken. The guess unwinder will be used in this case. And the guess unwinder code in prolugue unwinder is redundant. Strip it out and set the unwinder type in unwind_state. Make guess_unwinder::unwind_next_frame() as default way when other unwinders cannot unwind in some extreme case. Signed-off-by: Jinyang He <hejinyang@loongson.cn> Signed-off-by: Huacai Chen <chenhuacai@loongson.cn>
189 lines
4.4 KiB
C
189 lines
4.4 KiB
C
// SPDX-License-Identifier: GPL-2.0
|
|
/*
|
|
* Copyright (C) 2022 Loongson Technology Corporation Limited
|
|
*/
|
|
#include <linux/ftrace.h>
|
|
#include <linux/kallsyms.h>
|
|
|
|
#include <asm/inst.h>
|
|
#include <asm/ptrace.h>
|
|
#include <asm/unwind.h>
|
|
|
|
static inline void unwind_state_fixup(struct unwind_state *state)
|
|
{
|
|
#ifdef CONFIG_DYNAMIC_FTRACE
|
|
static unsigned long ftrace = (unsigned long)ftrace_call + 4;
|
|
|
|
if (state->pc == ftrace)
|
|
state->is_ftrace = true;
|
|
#endif
|
|
}
|
|
|
|
/*
|
|
* LoongArch function prologue is like follows,
|
|
* [instructions not use stack var]
|
|
* addi.d sp, sp, -imm
|
|
* st.d xx, sp, offset <- save callee saved regs and
|
|
* st.d yy, sp, offset save ra if function is nest.
|
|
* [others instructions]
|
|
*/
|
|
static bool unwind_by_prologue(struct unwind_state *state)
|
|
{
|
|
long frame_ra = -1;
|
|
unsigned long frame_size = 0;
|
|
unsigned long size, offset, pc;
|
|
struct pt_regs *regs;
|
|
struct stack_info *info = &state->stack_info;
|
|
union loongarch_instruction *ip, *ip_end;
|
|
|
|
if (state->sp >= info->end || state->sp < info->begin)
|
|
return false;
|
|
|
|
if (state->is_ftrace) {
|
|
/*
|
|
* As we meet ftrace_regs_entry, reset first flag like first doing
|
|
* tracing. Prologue analysis will stop soon because PC is at entry.
|
|
*/
|
|
regs = (struct pt_regs *)state->sp;
|
|
state->first = true;
|
|
state->is_ftrace = false;
|
|
state->pc = regs->csr_era;
|
|
state->ra = regs->regs[1];
|
|
state->sp = regs->regs[3];
|
|
return true;
|
|
}
|
|
|
|
/*
|
|
* When first is not set, the PC is a return address in the previous frame.
|
|
* We need to adjust its value in case overflow to the next symbol.
|
|
*/
|
|
pc = state->pc - (state->first ? 0 : LOONGARCH_INSN_SIZE);
|
|
if (!kallsyms_lookup_size_offset(pc, &size, &offset))
|
|
return false;
|
|
|
|
ip = (union loongarch_instruction *)(pc - offset);
|
|
ip_end = (union loongarch_instruction *)pc;
|
|
|
|
while (ip < ip_end) {
|
|
if (is_stack_alloc_ins(ip)) {
|
|
frame_size = (1 << 12) - ip->reg2i12_format.immediate;
|
|
ip++;
|
|
break;
|
|
}
|
|
ip++;
|
|
}
|
|
|
|
/*
|
|
* Can't find stack alloc action, PC may be in a leaf function. Only the
|
|
* first being true is reasonable, otherwise indicate analysis is broken.
|
|
*/
|
|
if (!frame_size) {
|
|
if (state->first)
|
|
goto first;
|
|
|
|
return false;
|
|
}
|
|
|
|
while (ip < ip_end) {
|
|
if (is_ra_save_ins(ip)) {
|
|
frame_ra = ip->reg2i12_format.immediate;
|
|
break;
|
|
}
|
|
if (is_branch_ins(ip))
|
|
break;
|
|
ip++;
|
|
}
|
|
|
|
/* Can't find save $ra action, PC may be in a leaf function, too. */
|
|
if (frame_ra < 0) {
|
|
if (state->first) {
|
|
state->sp = state->sp + frame_size;
|
|
goto first;
|
|
}
|
|
return false;
|
|
}
|
|
|
|
state->pc = *(unsigned long *)(state->sp + frame_ra);
|
|
state->sp = state->sp + frame_size;
|
|
goto out;
|
|
|
|
first:
|
|
state->pc = state->ra;
|
|
|
|
out:
|
|
state->first = false;
|
|
unwind_state_fixup(state);
|
|
return !!__kernel_text_address(state->pc);
|
|
}
|
|
|
|
static bool next_frame(struct unwind_state *state)
|
|
{
|
|
unsigned long pc;
|
|
struct pt_regs *regs;
|
|
struct stack_info *info = &state->stack_info;
|
|
|
|
if (unwind_done(state))
|
|
return false;
|
|
|
|
do {
|
|
if (unwind_by_prologue(state)) {
|
|
state->pc = unwind_graph_addr(state, state->pc, state->sp);
|
|
return true;
|
|
}
|
|
|
|
if (info->type == STACK_TYPE_IRQ && info->end == state->sp) {
|
|
regs = (struct pt_regs *)info->next_sp;
|
|
pc = regs->csr_era;
|
|
|
|
if (user_mode(regs) || !__kernel_text_address(pc))
|
|
return false;
|
|
|
|
state->first = true;
|
|
state->pc = pc;
|
|
state->ra = regs->regs[1];
|
|
state->sp = regs->regs[3];
|
|
get_stack_info(state->sp, state->task, info);
|
|
|
|
return true;
|
|
}
|
|
|
|
state->sp = info->next_sp;
|
|
|
|
} while (!get_stack_info(state->sp, state->task, info));
|
|
|
|
return false;
|
|
}
|
|
|
|
unsigned long unwind_get_return_address(struct unwind_state *state)
|
|
{
|
|
return __unwind_get_return_address(state);
|
|
}
|
|
EXPORT_SYMBOL_GPL(unwind_get_return_address);
|
|
|
|
void unwind_start(struct unwind_state *state, struct task_struct *task,
|
|
struct pt_regs *regs)
|
|
{
|
|
__unwind_start(state, task, regs);
|
|
state->type = UNWINDER_PROLOGUE;
|
|
state->first = true;
|
|
|
|
/*
|
|
* The current PC is not kernel text address, we cannot find its
|
|
* relative symbol. Thus, prologue analysis will be broken. Luckily,
|
|
* we can use the default_next_frame().
|
|
*/
|
|
if (!__kernel_text_address(state->pc)) {
|
|
state->type = UNWINDER_GUESS;
|
|
if (!unwind_done(state))
|
|
unwind_next_frame(state);
|
|
}
|
|
}
|
|
EXPORT_SYMBOL_GPL(unwind_start);
|
|
|
|
bool unwind_next_frame(struct unwind_state *state)
|
|
{
|
|
return state->type == UNWINDER_PROLOGUE ?
|
|
next_frame(state) : default_next_frame(state);
|
|
}
|
|
EXPORT_SYMBOL_GPL(unwind_next_frame);
|