irq_work-record-irq_work_queue-call-stack.patch removed from -mm tree
The patch titled
Subject: irq_work: record irq_work_queue() call stack
has been removed from the -mm tree. Its filename was
irq_work-record-irq_work_queue-call-stack.patch
This patch was dropped because it was merged into mainline or a subsystem tree
------------------------------------------------------
From: Zqiang <[email protected]>
Subject: irq_work: record irq_work_queue() call stack
Add the irq_work_queue() call stack into the KASAN auxiliary stack in order to improve KASAN reports. this will let us know where the irq work be queued.
Signed-off-by Zqiang <[email protected]>
Reviewed-by Dmitry Vyukov <[email protected]>
Acked-by Andrey Konovalov <[email protected]>
Cc Andrey Ryabinin <[email protected]>
Cc Alexander Potapenko <[email protected]>
Cc Matthias Brugger <[email protected]>
Cc Oleg Nesterov <[email protected]>
Cc Walter Wu <[email protected]>
Cc Frederic Weisbecker <[email protected]>
Signed-off-by Andrew Morton <[email protected]>
---
kernel/irq_work.c | 7 ++++++- 1 file changed, 6 insertions(+), 1 deletion(-)
kernel/irq_work.c renamed from kernel/irq_work.c~irq_work-record-irq_work_queue-call-stack +6 -1
@@ -19,7 +19,7 @@#include <linux/notifier.h> #include <linux/smp.h> #include <asm/processor.h> - +#include <linux/kasan.h> static DEFINE_PER_CPU(struct llist_head, raised_list); static DEFINE_PER_CPU(struct llist_head, lazy_list);
@@ -70,6 +70,9 @@ bool irq_work_queue(struct irq_work *worif (!irq_work_claim (work))return false; +/*record irq_work call stack in order to print it in KASAN reports*/ +kasan_record_aux_stack (work); +/* Queue the entry and raise the IPI if needed. */ preempt_disable ();__irq_work_queue_local (work);
@@ -98,6 +101,8 @@ bool irq_work_queue_on(struct irq_work *if (!irq_work_claim (work))return false; +kasan_record_aux_stack (work); +preempt_disable ();if (cpu !=smp_processor_id ()) {/* Arch remote IPI send/receive backend aren't NMI safe */
_
Patches currently in -mm which might be from [email protected] are