Linux Audio

Check our new training course

In-person Linux kernel drivers training

Jun 16-20, 2025
Register
Loading...
v4.17
  1// SPDX-License-Identifier: GPL-2.0
  2/*
  3 *  Copyright (C) 1991, 1992  Linus Torvalds
  4 *  Copyright (C) 2000, 2001, 2002 Andi Kleen, SuSE Labs
  5 */
  6#include <linux/sched/debug.h>
  7#include <linux/kallsyms.h>
  8#include <linux/kprobes.h>
  9#include <linux/uaccess.h>
 10#include <linux/hardirq.h>
 11#include <linux/kdebug.h>
 12#include <linux/export.h>
 13#include <linux/ptrace.h>
 14#include <linux/kexec.h>
 15#include <linux/sysfs.h>
 16#include <linux/bug.h>
 17#include <linux/nmi.h>
 18
 19#include <asm/stacktrace.h>
 20
 21static 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
 28static unsigned long exception_stack_sizes[N_EXCEPTION_STACKS] = {
 29	[0 ... N_EXCEPTION_STACKS - 1]		= EXCEPTION_STKSZ,
 30	[DEBUG_STACK - 1]			= DEBUG_STKSZ
 31};
 32
 33const char *stack_type_name(enum stack_type type)
 34{
 35	BUILD_BUG_ON(N_EXCEPTION_STACKS != 4);
 36
 37	if (type == STACK_TYPE_IRQ)
 38		return "IRQ";
 39
 40	if (type == STACK_TYPE_ENTRY) {
 41		/*
 42		 * On 64-bit, we have a generic entry stack that we
 43		 * use for all the kernel entry points, including
 44		 * SYSENTER.
 45		 */
 46		return "ENTRY_TRAMPOLINE";
 47	}
 48
 49	if (type >= STACK_TYPE_EXCEPTION && type <= STACK_TYPE_EXCEPTION_LAST)
 50		return exception_stack_names[type - STACK_TYPE_EXCEPTION];
 51
 52	return NULL;
 53}
 54
 55static bool in_exception_stack(unsigned long *stack, struct stack_info *info)
 56{
 57	unsigned long *begin, *end;
 58	struct pt_regs *regs;
 59	unsigned k;
 60
 61	BUILD_BUG_ON(N_EXCEPTION_STACKS != 4);
 62
 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;
 67
 68		if (stack <= begin || stack >= end)
 69			continue;
 70
 71		info->type	= STACK_TYPE_EXCEPTION + k;
 72		info->begin	= begin;
 73		info->end	= end;
 74		info->next_sp	= (unsigned long *)regs->sp;
 75
 76		return true;
 77	}
 78
 79	return false;
 80}
 81
 82static bool in_irq_stack(unsigned long *stack, struct stack_info *info)
 83{
 84	unsigned long *end   = (unsigned long *)this_cpu_read(irq_stack_ptr);
 85	unsigned long *begin = end - (IRQ_STACK_SIZE / sizeof(long));
 86
 87	/*
 88	 * This is a software stack, so 'end' can be a valid stack pointer.
 89	 * It just means the stack is empty.
 90	 */
 91	if (stack <= begin || stack > end)
 92		return false;
 93
 94	info->type	= STACK_TYPE_IRQ;
 95	info->begin	= begin;
 96	info->end	= end;
 97
 98	/*
 99	 * The next stack pointer is the first thing pushed by the entry code
100	 * after switching to the irq stack.
101	 */
102	info->next_sp = (unsigned long *)*(end - 1);
103
104	return true;
105}
106
107int get_stack_info(unsigned long *stack, struct task_struct *task,
108		   struct stack_info *info, unsigned long *visit_mask)
109{
110	if (!stack)
111		goto unknown;
112
113	task = task ? : current;
114
115	if (in_task_stack(stack, task, info))
116		goto recursion_check;
117
118	if (task != current)
119		goto unknown;
120
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
132recursion_check:
133	/*
134	 * Make sure we don't iterate through any given stack more than once.
135	 * If it comes up a second time then there's something wrong going on:
136	 * just break out and report an unknown stack type.
137	 */
138	if (visit_mask) {
139		if (*visit_mask & (1UL << info->type)) {
140			printk_deferred_once(KERN_WARNING "WARNING: stack recursion on stack type %d\n", info->type);
141			goto unknown;
142		}
143		*visit_mask |= 1UL << info->type;
144	}
145
146	return 0;
147
148unknown:
149	info->type = STACK_TYPE_UNKNOWN;
150	return -EINVAL;
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
151}
v4.10.11
 
  1/*
  2 *  Copyright (C) 1991, 1992  Linus Torvalds
  3 *  Copyright (C) 2000, 2001, 2002 Andi Kleen, SuSE Labs
  4 */
 
  5#include <linux/kallsyms.h>
  6#include <linux/kprobes.h>
  7#include <linux/uaccess.h>
  8#include <linux/hardirq.h>
  9#include <linux/kdebug.h>
 10#include <linux/export.h>
 11#include <linux/ptrace.h>
 12#include <linux/kexec.h>
 13#include <linux/sysfs.h>
 14#include <linux/bug.h>
 15#include <linux/nmi.h>
 16
 17#include <asm/stacktrace.h>
 18
 19static char *exception_stack_names[N_EXCEPTION_STACKS] = {
 20		[ DOUBLEFAULT_STACK-1	]	= "#DF",
 21		[ NMI_STACK-1		]	= "NMI",
 22		[ DEBUG_STACK-1		]	= "#DB",
 23		[ MCE_STACK-1		]	= "#MC",
 24};
 25
 26static unsigned long exception_stack_sizes[N_EXCEPTION_STACKS] = {
 27	[0 ... N_EXCEPTION_STACKS - 1]		= EXCEPTION_STKSZ,
 28	[DEBUG_STACK - 1]			= DEBUG_STKSZ
 29};
 30
 31const char *stack_type_name(enum stack_type type)
 32{
 33	BUILD_BUG_ON(N_EXCEPTION_STACKS != 4);
 34
 35	if (type == STACK_TYPE_IRQ)
 36		return "IRQ";
 37
 
 
 
 
 
 
 
 
 
 38	if (type >= STACK_TYPE_EXCEPTION && type <= STACK_TYPE_EXCEPTION_LAST)
 39		return exception_stack_names[type - STACK_TYPE_EXCEPTION];
 40
 41	return NULL;
 42}
 43
 44static bool in_exception_stack(unsigned long *stack, struct stack_info *info)
 45{
 46	unsigned long *begin, *end;
 47	struct pt_regs *regs;
 48	unsigned k;
 49
 50	BUILD_BUG_ON(N_EXCEPTION_STACKS != 4);
 51
 52	for (k = 0; k < N_EXCEPTION_STACKS; k++) {
 53		end   = (unsigned long *)raw_cpu_ptr(&orig_ist)->ist[k];
 54		begin = end - (exception_stack_sizes[k] / sizeof(long));
 55		regs  = (struct pt_regs *)end - 1;
 56
 57		if (stack < begin || stack >= end)
 58			continue;
 59
 60		info->type	= STACK_TYPE_EXCEPTION + k;
 61		info->begin	= begin;
 62		info->end	= end;
 63		info->next_sp	= (unsigned long *)regs->sp;
 64
 65		return true;
 66	}
 67
 68	return false;
 69}
 70
 71static bool in_irq_stack(unsigned long *stack, struct stack_info *info)
 72{
 73	unsigned long *end   = (unsigned long *)this_cpu_read(irq_stack_ptr);
 74	unsigned long *begin = end - (IRQ_STACK_SIZE / sizeof(long));
 75
 76	/*
 77	 * This is a software stack, so 'end' can be a valid stack pointer.
 78	 * It just means the stack is empty.
 79	 */
 80	if (stack < begin || stack > end)
 81		return false;
 82
 83	info->type	= STACK_TYPE_IRQ;
 84	info->begin	= begin;
 85	info->end	= end;
 86
 87	/*
 88	 * The next stack pointer is the first thing pushed by the entry code
 89	 * after switching to the irq stack.
 90	 */
 91	info->next_sp = (unsigned long *)*(end - 1);
 92
 93	return true;
 94}
 95
 96int get_stack_info(unsigned long *stack, struct task_struct *task,
 97		   struct stack_info *info, unsigned long *visit_mask)
 98{
 99	if (!stack)
100		goto unknown;
101
102	task = task ? : current;
103
104	if (in_task_stack(stack, task, info))
105		goto recursion_check;
106
107	if (task != current)
108		goto unknown;
109
110	if (in_exception_stack(stack, info))
111		goto recursion_check;
112
113	if (in_irq_stack(stack, info))
114		goto recursion_check;
115
 
 
 
116	goto unknown;
117
118recursion_check:
119	/*
120	 * Make sure we don't iterate through any given stack more than once.
121	 * If it comes up a second time then there's something wrong going on:
122	 * just break out and report an unknown stack type.
123	 */
124	if (visit_mask) {
125		if (*visit_mask & (1UL << info->type)) {
126			printk_deferred_once(KERN_WARNING "WARNING: stack recursion on stack type %d\n", info->type);
127			goto unknown;
128		}
129		*visit_mask |= 1UL << info->type;
130	}
131
132	return 0;
133
134unknown:
135	info->type = STACK_TYPE_UNKNOWN;
136	return -EINVAL;
137}
138
139void show_regs(struct pt_regs *regs)
140{
141	int i;
142
143	show_regs_print_info(KERN_DEFAULT);
144	__show_regs(regs, 1);
145
146	/*
147	 * When in-kernel, we also print out the stack and code at the
148	 * time of the fault..
149	 */
150	if (!user_mode(regs)) {
151		unsigned int code_prologue = code_bytes * 43 / 64;
152		unsigned int code_len = code_bytes;
153		unsigned char c;
154		u8 *ip;
155
156		show_trace_log_lvl(current, regs, NULL, KERN_DEFAULT);
157
158		printk(KERN_DEFAULT "Code: ");
159
160		ip = (u8 *)regs->ip - code_prologue;
161		if (ip < (u8 *)PAGE_OFFSET || probe_kernel_address(ip, c)) {
162			/* try starting at IP */
163			ip = (u8 *)regs->ip;
164			code_len = code_len - code_prologue + 1;
165		}
166		for (i = 0; i < code_len; i++, ip++) {
167			if (ip < (u8 *)PAGE_OFFSET ||
168					probe_kernel_address(ip, c)) {
169				pr_cont(" Bad RIP value.");
170				break;
171			}
172			if (ip == (u8 *)regs->ip)
173				pr_cont("<%02x> ", c);
174			else
175				pr_cont("%02x ", c);
176		}
177	}
178	pr_cont("\n");
179}
180
181int is_valid_bugaddr(unsigned long ip)
182{
183	unsigned short ud2;
184
185	if (__copy_from_user(&ud2, (const void __user *) ip, sizeof(ud2)))
186		return 0;
187
188	return ud2 == 0x0b0f;
189}