2019-05-27 06:55:05 +00:00
|
|
|
// SPDX-License-Identifier: GPL-2.0-or-later
|
2005-04-16 22:20:36 +00:00
|
|
|
/*
|
|
|
|
* Kernel Probes (KProbes)
|
|
|
|
*
|
|
|
|
* Copyright (C) IBM Corporation, 2002, 2004
|
|
|
|
*
|
|
|
|
* 2002-Oct Created by Vamsi Krishna S <vamsi_krishna@in.ibm.com> Kernel
|
|
|
|
* Probes initial implementation (includes suggestions from
|
|
|
|
* Rusty Russell).
|
|
|
|
* 2004-Aug Updated by Prasanna S Panchamukhi <prasanna@in.ibm.com> with
|
|
|
|
* hlists and exceptions notifier as suggested by Andi Kleen.
|
|
|
|
* 2004-July Suparna Bhattacharya <suparna@in.ibm.com> added jumper probes
|
|
|
|
* interface to access function arguments.
|
|
|
|
* 2004-Sep Prasanna S Panchamukhi <prasanna@in.ibm.com> Changed Kprobes
|
|
|
|
* exceptions notifier to be first on the priority list.
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
* 2005-May Hien Nguyen <hien@us.ibm.com>, Jim Keniston
|
|
|
|
* <jkenisto@us.ibm.com> and Prasanna S Panchamukhi
|
|
|
|
* <prasanna@in.ibm.com> added function-return probes.
|
2005-04-16 22:20:36 +00:00
|
|
|
*/
|
2021-09-14 14:39:25 +00:00
|
|
|
|
|
|
|
#define pr_fmt(fmt) "kprobes: " fmt
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <linux/kprobes.h>
|
|
|
|
#include <linux/hash.h>
|
|
|
|
#include <linux/init.h>
|
2005-10-30 23:03:48 +00:00
|
|
|
#include <linux/slab.h>
|
2007-05-08 07:27:01 +00:00
|
|
|
#include <linux/stddef.h>
|
2011-05-23 18:51:41 +00:00
|
|
|
#include <linux/export.h>
|
2006-10-02 09:17:30 +00:00
|
|
|
#include <linux/kallsyms.h>
|
2006-12-07 04:38:11 +00:00
|
|
|
#include <linux/freezer.h>
|
2007-02-20 21:57:54 +00:00
|
|
|
#include <linux/seq_file.h>
|
|
|
|
#include <linux/debugfs.h>
|
2010-02-25 13:34:15 +00:00
|
|
|
#include <linux/sysctl.h>
|
2007-05-08 07:27:03 +00:00
|
|
|
#include <linux/kdebug.h>
|
2009-03-06 15:36:38 +00:00
|
|
|
#include <linux/memory.h>
|
2010-02-02 21:49:18 +00:00
|
|
|
#include <linux/ftrace.h>
|
2010-02-25 13:34:07 +00:00
|
|
|
#include <linux/cpu.h>
|
2010-09-17 15:09:00 +00:00
|
|
|
#include <linux/jump_label.h>
|
2021-06-28 11:24:12 +00:00
|
|
|
#include <linux/static_call.h>
|
2020-05-12 12:19:11 +00:00
|
|
|
#include <linux/perf_event.h>
|
2024-05-05 16:06:18 +00:00
|
|
|
#include <linux/execmem.h>
|
2007-05-08 07:34:16 +00:00
|
|
|
|
2016-10-11 20:52:22 +00:00
|
|
|
#include <asm/sections.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
#include <asm/cacheflush.h>
|
|
|
|
#include <asm/errno.h>
|
2016-12-24 19:46:01 +00:00
|
|
|
#include <linux/uaccess.h>
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
#define KPROBE_HASH_BITS 6
|
|
|
|
#define KPROBE_TABLE_SIZE (1 << KPROBE_HASH_BITS)
|
|
|
|
|
2022-01-22 06:13:41 +00:00
|
|
|
#if !defined(CONFIG_OPTPROBES) || !defined(CONFIG_SYSCTL)
|
|
|
|
#define kprobe_sysctls_init() do { } while (0)
|
|
|
|
#endif
|
2006-10-02 09:17:30 +00:00
|
|
|
|
2008-07-25 08:46:04 +00:00
|
|
|
static int kprobes_initialized;
|
2020-05-12 08:02:44 +00:00
|
|
|
/* kprobe_table can be accessed by
|
2021-09-14 14:39:34 +00:00
|
|
|
* - Normal hlist traversal and RCU add/del under 'kprobe_mutex' is held.
|
2020-05-12 08:02:44 +00:00
|
|
|
* Or
|
|
|
|
* - RCU hlist traversal under disabling preempt (breakpoint handlers)
|
|
|
|
*/
|
2005-04-16 22:20:36 +00:00
|
|
|
static struct hlist_head kprobe_table[KPROBE_TABLE_SIZE];
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* NOTE: change this value only with 'kprobe_mutex' held */
|
2009-04-07 02:01:01 +00:00
|
|
|
static bool kprobes_all_disarmed;
|
2007-05-08 07:34:16 +00:00
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* This protects 'kprobe_table' and 'optimizing_list' */
|
2010-10-25 13:18:01 +00:00
|
|
|
static DEFINE_MUTEX(kprobe_mutex);
|
2021-09-14 14:39:34 +00:00
|
|
|
static DEFINE_PER_CPU(struct kprobe *, kprobe_instance);
|
2008-07-25 08:46:04 +00:00
|
|
|
|
2017-04-19 12:51:01 +00:00
|
|
|
kprobe_opcode_t * __weak kprobe_lookup_name(const char *name,
|
|
|
|
unsigned int __unused)
|
2017-04-19 12:51:00 +00:00
|
|
|
{
|
|
|
|
return ((kprobe_opcode_t *)(kallsyms_lookup_name(name)));
|
|
|
|
}
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/*
|
|
|
|
* Blacklist -- list of 'struct kprobe_blacklist_entry' to store info where
|
|
|
|
* kprobes can not probe.
|
|
|
|
*/
|
2014-04-17 08:17:05 +00:00
|
|
|
static LIST_HEAD(kprobe_blacklist);
|
2008-04-28 09:14:26 +00:00
|
|
|
|
2006-01-10 04:52:41 +00:00
|
|
|
#ifdef __ARCH_WANT_KPROBES_INSN_SLOT
|
2005-06-27 22:17:01 +00:00
|
|
|
/*
|
2021-09-14 14:39:34 +00:00
|
|
|
* 'kprobe::ainsn.insn' points to the copy of the instruction to be
|
2005-06-27 22:17:01 +00:00
|
|
|
* single-stepped. x86_64, POWER4 and above have no-exec support and
|
|
|
|
* stepping on the instruction on a vmalloced/kmalloced/data page
|
|
|
|
* is a recipe for disaster
|
|
|
|
*/
|
|
|
|
struct kprobe_insn_page {
|
2009-06-30 21:08:14 +00:00
|
|
|
struct list_head list;
|
2005-06-27 22:17:01 +00:00
|
|
|
kprobe_opcode_t *insns; /* Page of instruction slots */
|
2013-09-11 21:24:13 +00:00
|
|
|
struct kprobe_insn_cache *cache;
|
2005-06-27 22:17:01 +00:00
|
|
|
int nused;
|
2006-12-07 04:38:11 +00:00
|
|
|
int ngarbage;
|
2010-02-25 13:33:59 +00:00
|
|
|
char slot_used[];
|
2005-06-27 22:17:01 +00:00
|
|
|
};
|
|
|
|
|
2010-02-25 13:33:59 +00:00
|
|
|
#define KPROBE_INSN_PAGE_SIZE(slots) \
|
|
|
|
(offsetof(struct kprobe_insn_page, slot_used) + \
|
|
|
|
(sizeof(char) * (slots)))
|
|
|
|
|
|
|
|
static int slots_per_page(struct kprobe_insn_cache *c)
|
|
|
|
{
|
|
|
|
return PAGE_SIZE/(c->insn_size * sizeof(kprobe_opcode_t));
|
|
|
|
}
|
|
|
|
|
2007-01-30 22:36:06 +00:00
|
|
|
enum kprobe_slot_state {
|
|
|
|
SLOT_CLEAN = 0,
|
|
|
|
SLOT_DIRTY = 1,
|
|
|
|
SLOT_USED = 2,
|
|
|
|
};
|
|
|
|
|
2017-08-18 08:24:00 +00:00
|
|
|
void __weak *alloc_insn_page(void)
|
2013-09-11 21:24:13 +00:00
|
|
|
{
|
2021-09-14 14:39:34 +00:00
|
|
|
/*
|
2024-05-05 16:06:18 +00:00
|
|
|
* Use execmem_alloc() so this page is within +/- 2GB of where the
|
2021-09-14 14:39:34 +00:00
|
|
|
* kernel image and loaded module images reside. This is required
|
|
|
|
* for most of the architectures.
|
|
|
|
* (e.g. x86-64 needs this to handle the %rip-relative fixups.)
|
|
|
|
*/
|
2024-05-05 16:06:18 +00:00
|
|
|
return execmem_alloc(EXECMEM_KPROBES, PAGE_SIZE);
|
2013-09-11 21:24:13 +00:00
|
|
|
}
|
|
|
|
|
2021-07-01 01:56:31 +00:00
|
|
|
static void free_insn_page(void *page)
|
2013-09-11 21:24:13 +00:00
|
|
|
{
|
2024-05-05 16:06:18 +00:00
|
|
|
execmem_free(page);
|
2013-09-11 21:24:13 +00:00
|
|
|
}
|
|
|
|
|
2013-09-11 21:24:11 +00:00
|
|
|
struct kprobe_insn_cache kprobe_insn_slots = {
|
|
|
|
.mutex = __MUTEX_INITIALIZER(kprobe_insn_slots.mutex),
|
2013-09-11 21:24:13 +00:00
|
|
|
.alloc = alloc_insn_page,
|
|
|
|
.free = free_insn_page,
|
2020-05-28 08:00:58 +00:00
|
|
|
.sym = KPROBE_INSN_PAGE_SYM,
|
2010-02-25 13:33:59 +00:00
|
|
|
.pages = LIST_HEAD_INIT(kprobe_insn_slots.pages),
|
|
|
|
.insn_size = MAX_INSN_SIZE,
|
|
|
|
.nr_garbage = 0,
|
|
|
|
};
|
2014-04-17 08:17:54 +00:00
|
|
|
static int collect_garbage_slots(struct kprobe_insn_cache *c);
|
2006-12-07 04:38:11 +00:00
|
|
|
|
2005-06-27 22:17:01 +00:00
|
|
|
/**
|
2009-01-06 22:41:50 +00:00
|
|
|
* __get_insn_slot() - Find a slot on an executable page for an instruction.
|
2005-06-27 22:17:01 +00:00
|
|
|
* We allocate an executable page if there's no room on existing ones.
|
|
|
|
*/
|
2014-04-17 08:17:54 +00:00
|
|
|
kprobe_opcode_t *__get_insn_slot(struct kprobe_insn_cache *c)
|
2005-06-27 22:17:01 +00:00
|
|
|
{
|
|
|
|
struct kprobe_insn_page *kip;
|
2013-09-11 21:24:11 +00:00
|
|
|
kprobe_opcode_t *slot = NULL;
|
2005-06-27 22:17:01 +00:00
|
|
|
|
2017-01-08 14:58:09 +00:00
|
|
|
/* Since the slot array is not protected by rcu, we need a mutex */
|
2013-09-11 21:24:11 +00:00
|
|
|
mutex_lock(&c->mutex);
|
2007-05-08 07:34:13 +00:00
|
|
|
retry:
|
2017-01-08 14:58:09 +00:00
|
|
|
rcu_read_lock();
|
|
|
|
list_for_each_entry_rcu(kip, &c->pages, list) {
|
2010-02-25 13:33:59 +00:00
|
|
|
if (kip->nused < slots_per_page(c)) {
|
2005-06-27 22:17:01 +00:00
|
|
|
int i;
|
2021-09-14 14:39:34 +00:00
|
|
|
|
2010-02-25 13:33:59 +00:00
|
|
|
for (i = 0; i < slots_per_page(c); i++) {
|
2007-01-30 22:36:06 +00:00
|
|
|
if (kip->slot_used[i] == SLOT_CLEAN) {
|
|
|
|
kip->slot_used[i] = SLOT_USED;
|
2005-06-27 22:17:01 +00:00
|
|
|
kip->nused++;
|
2013-09-11 21:24:11 +00:00
|
|
|
slot = kip->insns + (i * c->insn_size);
|
2017-01-08 14:58:09 +00:00
|
|
|
rcu_read_unlock();
|
2013-09-11 21:24:11 +00:00
|
|
|
goto out;
|
2005-06-27 22:17:01 +00:00
|
|
|
}
|
|
|
|
}
|
2010-02-25 13:33:59 +00:00
|
|
|
/* kip->nused is broken. Fix it. */
|
|
|
|
kip->nused = slots_per_page(c);
|
|
|
|
WARN_ON(1);
|
2005-06-27 22:17:01 +00:00
|
|
|
}
|
|
|
|
}
|
2017-01-08 14:58:09 +00:00
|
|
|
rcu_read_unlock();
|
2005-06-27 22:17:01 +00:00
|
|
|
|
2006-12-07 04:38:11 +00:00
|
|
|
/* If there are any garbage slots, collect it and try again. */
|
2010-02-25 13:33:59 +00:00
|
|
|
if (c->nr_garbage && collect_garbage_slots(c) == 0)
|
2006-12-07 04:38:11 +00:00
|
|
|
goto retry;
|
2010-02-25 13:33:59 +00:00
|
|
|
|
|
|
|
/* All out of space. Need to allocate a new page. */
|
|
|
|
kip = kmalloc(KPROBE_INSN_PAGE_SIZE(slots_per_page(c)), GFP_KERNEL);
|
2007-05-08 07:34:13 +00:00
|
|
|
if (!kip)
|
2013-09-11 21:24:11 +00:00
|
|
|
goto out;
|
2005-06-27 22:17:01 +00:00
|
|
|
|
2013-09-11 21:24:13 +00:00
|
|
|
kip->insns = c->alloc();
|
2005-06-27 22:17:01 +00:00
|
|
|
if (!kip->insns) {
|
|
|
|
kfree(kip);
|
2013-09-11 21:24:11 +00:00
|
|
|
goto out;
|
2005-06-27 22:17:01 +00:00
|
|
|
}
|
2009-06-30 21:08:14 +00:00
|
|
|
INIT_LIST_HEAD(&kip->list);
|
2010-02-25 13:33:59 +00:00
|
|
|
memset(kip->slot_used, SLOT_CLEAN, slots_per_page(c));
|
2007-01-30 22:36:06 +00:00
|
|
|
kip->slot_used[0] = SLOT_USED;
|
2005-06-27 22:17:01 +00:00
|
|
|
kip->nused = 1;
|
2006-12-07 04:38:11 +00:00
|
|
|
kip->ngarbage = 0;
|
2013-09-11 21:24:13 +00:00
|
|
|
kip->cache = c;
|
2017-01-08 14:58:09 +00:00
|
|
|
list_add_rcu(&kip->list, &c->pages);
|
2013-09-11 21:24:11 +00:00
|
|
|
slot = kip->insns;
|
2020-05-12 12:19:11 +00:00
|
|
|
|
|
|
|
/* Record the perf ksymbol register event after adding the page */
|
|
|
|
perf_event_ksymbol(PERF_RECORD_KSYMBOL_TYPE_OOL, (unsigned long)kip->insns,
|
|
|
|
PAGE_SIZE, false, c->sym);
|
2013-09-11 21:24:11 +00:00
|
|
|
out:
|
|
|
|
mutex_unlock(&c->mutex);
|
|
|
|
return slot;
|
2009-01-06 22:41:50 +00:00
|
|
|
}
|
|
|
|
|
2021-09-14 14:40:16 +00:00
|
|
|
/* Return true if all garbages are collected, otherwise false. */
|
|
|
|
static bool collect_one_slot(struct kprobe_insn_page *kip, int idx)
|
2006-12-07 04:38:11 +00:00
|
|
|
{
|
2007-01-30 22:36:06 +00:00
|
|
|
kip->slot_used[idx] = SLOT_CLEAN;
|
2006-12-07 04:38:11 +00:00
|
|
|
kip->nused--;
|
2024-08-13 11:53:34 +00:00
|
|
|
if (kip->nused != 0)
|
|
|
|
return false;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Page is no longer in use. Free it unless
|
|
|
|
* it's the last one. We keep the last one
|
|
|
|
* so as not to have to set it up again the
|
|
|
|
* next time somebody inserts a probe.
|
|
|
|
*/
|
|
|
|
if (!list_is_singular(&kip->list)) {
|
2006-12-07 04:38:11 +00:00
|
|
|
/*
|
2024-08-13 11:53:34 +00:00
|
|
|
* Record perf ksymbol unregister event before removing
|
|
|
|
* the page.
|
2006-12-07 04:38:11 +00:00
|
|
|
*/
|
2024-08-13 11:53:34 +00:00
|
|
|
perf_event_ksymbol(PERF_RECORD_KSYMBOL_TYPE_OOL,
|
|
|
|
(unsigned long)kip->insns, PAGE_SIZE, true,
|
|
|
|
kip->cache->sym);
|
|
|
|
list_del_rcu(&kip->list);
|
|
|
|
synchronize_rcu();
|
|
|
|
kip->cache->free(kip->insns);
|
|
|
|
kfree(kip);
|
2006-12-07 04:38:11 +00:00
|
|
|
}
|
2024-08-13 11:53:34 +00:00
|
|
|
return true;
|
2006-12-07 04:38:11 +00:00
|
|
|
}
|
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
static int collect_garbage_slots(struct kprobe_insn_cache *c)
|
2006-12-07 04:38:11 +00:00
|
|
|
{
|
2009-06-30 21:08:14 +00:00
|
|
|
struct kprobe_insn_page *kip, *next;
|
2006-12-07 04:38:11 +00:00
|
|
|
|
2010-02-02 21:49:04 +00:00
|
|
|
/* Ensure no-one is interrupted on the garbages */
|
2018-11-07 03:04:39 +00:00
|
|
|
synchronize_rcu();
|
2006-12-07 04:38:11 +00:00
|
|
|
|
2010-02-25 13:33:59 +00:00
|
|
|
list_for_each_entry_safe(kip, next, &c->pages, list) {
|
2006-12-07 04:38:11 +00:00
|
|
|
int i;
|
2021-09-14 14:39:34 +00:00
|
|
|
|
2006-12-07 04:38:11 +00:00
|
|
|
if (kip->ngarbage == 0)
|
|
|
|
continue;
|
|
|
|
kip->ngarbage = 0; /* we will collect all garbages */
|
2010-02-25 13:33:59 +00:00
|
|
|
for (i = 0; i < slots_per_page(c); i++) {
|
2017-01-08 14:58:09 +00:00
|
|
|
if (kip->slot_used[i] == SLOT_DIRTY && collect_one_slot(kip, i))
|
2006-12-07 04:38:11 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
2010-02-25 13:33:59 +00:00
|
|
|
c->nr_garbage = 0;
|
2006-12-07 04:38:11 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
void __free_insn_slot(struct kprobe_insn_cache *c,
|
|
|
|
kprobe_opcode_t *slot, int dirty)
|
2005-06-27 22:17:01 +00:00
|
|
|
{
|
|
|
|
struct kprobe_insn_page *kip;
|
2017-01-08 14:58:09 +00:00
|
|
|
long idx;
|
2005-06-27 22:17:01 +00:00
|
|
|
|
2013-09-11 21:24:11 +00:00
|
|
|
mutex_lock(&c->mutex);
|
2017-01-08 14:58:09 +00:00
|
|
|
rcu_read_lock();
|
|
|
|
list_for_each_entry_rcu(kip, &c->pages, list) {
|
|
|
|
idx = ((long)slot - (long)kip->insns) /
|
|
|
|
(c->insn_size * sizeof(kprobe_opcode_t));
|
|
|
|
if (idx >= 0 && idx < slots_per_page(c))
|
2013-09-11 21:24:11 +00:00
|
|
|
goto out;
|
2005-06-27 22:17:01 +00:00
|
|
|
}
|
2017-01-08 14:58:09 +00:00
|
|
|
/* Could not find this slot. */
|
2010-02-25 13:33:59 +00:00
|
|
|
WARN_ON(1);
|
2017-01-08 14:58:09 +00:00
|
|
|
kip = NULL;
|
2013-09-11 21:24:11 +00:00
|
|
|
out:
|
2017-01-08 14:58:09 +00:00
|
|
|
rcu_read_unlock();
|
|
|
|
/* Mark and sweep: this may sleep */
|
|
|
|
if (kip) {
|
|
|
|
/* Check double free */
|
|
|
|
WARN_ON(kip->slot_used[idx] != SLOT_USED);
|
|
|
|
if (dirty) {
|
|
|
|
kip->slot_used[idx] = SLOT_DIRTY;
|
|
|
|
kip->ngarbage++;
|
|
|
|
if (++c->nr_garbage > slots_per_page(c))
|
|
|
|
collect_garbage_slots(c);
|
|
|
|
} else {
|
|
|
|
collect_one_slot(kip, idx);
|
|
|
|
}
|
|
|
|
}
|
2013-09-11 21:24:11 +00:00
|
|
|
mutex_unlock(&c->mutex);
|
2010-02-25 13:33:59 +00:00
|
|
|
}
|
2007-05-08 07:34:13 +00:00
|
|
|
|
2017-01-08 14:58:09 +00:00
|
|
|
/*
|
|
|
|
* Check given address is on the page of kprobe instruction slots.
|
|
|
|
* This will be used for checking whether the address on a stack
|
|
|
|
* is on a text area or not.
|
|
|
|
*/
|
|
|
|
bool __is_insn_slot_addr(struct kprobe_insn_cache *c, unsigned long addr)
|
|
|
|
{
|
|
|
|
struct kprobe_insn_page *kip;
|
|
|
|
bool ret = false;
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
list_for_each_entry_rcu(kip, &c->pages, list) {
|
|
|
|
if (addr >= (unsigned long)kip->insns &&
|
|
|
|
addr < (unsigned long)kip->insns + PAGE_SIZE) {
|
|
|
|
ret = true;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2020-05-28 08:00:58 +00:00
|
|
|
int kprobe_cache_get_kallsym(struct kprobe_insn_cache *c, unsigned int *symnum,
|
|
|
|
unsigned long *value, char *type, char *sym)
|
|
|
|
{
|
|
|
|
struct kprobe_insn_page *kip;
|
|
|
|
int ret = -ERANGE;
|
|
|
|
|
|
|
|
rcu_read_lock();
|
|
|
|
list_for_each_entry_rcu(kip, &c->pages, list) {
|
|
|
|
if ((*symnum)--)
|
|
|
|
continue;
|
2021-09-14 14:39:34 +00:00
|
|
|
strscpy(sym, c->sym, KSYM_NAME_LEN);
|
2020-05-28 08:00:58 +00:00
|
|
|
*type = 't';
|
|
|
|
*value = (unsigned long)kip->insns;
|
|
|
|
ret = 0;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
rcu_read_unlock();
|
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2010-02-25 13:34:07 +00:00
|
|
|
#ifdef CONFIG_OPTPROBES
|
2021-05-13 09:07:51 +00:00
|
|
|
void __weak *alloc_optinsn_page(void)
|
|
|
|
{
|
|
|
|
return alloc_insn_page();
|
|
|
|
}
|
|
|
|
|
|
|
|
void __weak free_optinsn_page(void *page)
|
|
|
|
{
|
|
|
|
free_insn_page(page);
|
|
|
|
}
|
|
|
|
|
2010-02-25 13:34:07 +00:00
|
|
|
/* For optimized_kprobe buffer */
|
2013-09-11 21:24:11 +00:00
|
|
|
struct kprobe_insn_cache kprobe_optinsn_slots = {
|
|
|
|
.mutex = __MUTEX_INITIALIZER(kprobe_optinsn_slots.mutex),
|
2021-05-13 09:07:51 +00:00
|
|
|
.alloc = alloc_optinsn_page,
|
|
|
|
.free = free_optinsn_page,
|
2020-05-28 08:00:58 +00:00
|
|
|
.sym = KPROBE_OPTINSN_PAGE_SYM,
|
2010-02-25 13:34:07 +00:00
|
|
|
.pages = LIST_HEAD_INIT(kprobe_optinsn_slots.pages),
|
|
|
|
/* .insn_size is initialized later */
|
|
|
|
.nr_garbage = 0,
|
|
|
|
};
|
2024-08-13 11:53:33 +00:00
|
|
|
#endif /* CONFIG_OPTPROBES */
|
|
|
|
#endif /* __ARCH_WANT_KPROBES_INSN_SLOT */
|
2005-06-27 22:17:01 +00:00
|
|
|
|
2005-11-07 09:00:07 +00:00
|
|
|
/* We have preemption disabled.. so it is safe to use __ versions */
|
|
|
|
static inline void set_kprobe_instance(struct kprobe *kp)
|
|
|
|
{
|
2010-12-06 17:16:25 +00:00
|
|
|
__this_cpu_write(kprobe_instance, kp);
|
2005-11-07 09:00:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline void reset_kprobe_instance(void)
|
|
|
|
{
|
2010-12-06 17:16:25 +00:00
|
|
|
__this_cpu_write(kprobe_instance, NULL);
|
2005-11-07 09:00:07 +00:00
|
|
|
}
|
|
|
|
|
2005-11-07 09:00:13 +00:00
|
|
|
/*
|
|
|
|
* This routine is called either:
|
2021-09-14 14:39:34 +00:00
|
|
|
* - under the 'kprobe_mutex' - during kprobe_[un]register().
|
|
|
|
* OR
|
|
|
|
* - with preemption disabled - from architecture specific code.
|
2005-11-07 09:00:13 +00:00
|
|
|
*/
|
2014-04-17 08:18:21 +00:00
|
|
|
struct kprobe *get_kprobe(void *addr)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
|
|
|
struct hlist_head *head;
|
2005-11-07 09:00:13 +00:00
|
|
|
struct kprobe *p;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
head = &kprobe_table[hash_ptr(addr, KPROBE_HASH_BITS)];
|
2020-05-12 08:02:33 +00:00
|
|
|
hlist_for_each_entry_rcu(p, head, hlist,
|
|
|
|
lockdep_is_held(&kprobe_mutex)) {
|
2005-04-16 22:20:36 +00:00
|
|
|
if (p->addr == addr)
|
|
|
|
return p;
|
|
|
|
}
|
2010-02-25 13:34:07 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
2014-04-17 08:18:21 +00:00
|
|
|
NOKPROBE_SYMBOL(get_kprobe);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2014-04-17 08:18:21 +00:00
|
|
|
static int aggr_pre_handler(struct kprobe *p, struct pt_regs *regs);
|
2010-02-25 13:34:07 +00:00
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Return true if 'p' is an aggregator */
|
2021-09-14 14:40:16 +00:00
|
|
|
static inline bool kprobe_aggrprobe(struct kprobe *p)
|
2010-02-25 13:34:07 +00:00
|
|
|
{
|
|
|
|
return p->pre_handler == aggr_pre_handler;
|
|
|
|
}
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Return true if 'p' is unused */
|
2021-09-14 14:40:16 +00:00
|
|
|
static inline bool kprobe_unused(struct kprobe *p)
|
2010-12-03 09:54:09 +00:00
|
|
|
{
|
|
|
|
return kprobe_aggrprobe(p) && kprobe_disabled(p) &&
|
|
|
|
list_empty(&p->list);
|
|
|
|
}
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Keep all fields in the kprobe consistent. */
|
2010-12-03 09:53:50 +00:00
|
|
|
static inline void copy_kprobe(struct kprobe *ap, struct kprobe *p)
|
2010-02-25 13:34:07 +00:00
|
|
|
{
|
2010-12-03 09:53:50 +00:00
|
|
|
memcpy(&p->opcode, &ap->opcode, sizeof(kprobe_opcode_t));
|
|
|
|
memcpy(&p->ainsn, &ap->ainsn, sizeof(struct arch_specific_insn));
|
2010-02-25 13:34:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#ifdef CONFIG_OPTPROBES
|
2021-09-14 14:39:34 +00:00
|
|
|
/* NOTE: This is protected by 'kprobe_mutex'. */
|
2010-02-25 13:34:15 +00:00
|
|
|
static bool kprobes_allow_optimization;
|
|
|
|
|
2010-02-25 13:34:07 +00:00
|
|
|
/*
|
2021-09-14 14:39:34 +00:00
|
|
|
* Call all 'kprobe::pre_handler' on the list, but ignores its return value.
|
2010-02-25 13:34:07 +00:00
|
|
|
* This must be called from arch-dep optimized caller.
|
|
|
|
*/
|
2014-04-17 08:18:21 +00:00
|
|
|
void opt_pre_handler(struct kprobe *p, struct pt_regs *regs)
|
2010-02-25 13:34:07 +00:00
|
|
|
{
|
|
|
|
struct kprobe *kp;
|
|
|
|
|
|
|
|
list_for_each_entry_rcu(kp, &p->list, list) {
|
|
|
|
if (kp->pre_handler && likely(!kprobe_disabled(kp))) {
|
|
|
|
set_kprobe_instance(kp);
|
2017-10-17 08:18:34 +00:00
|
|
|
kp->pre_handler(kp, regs);
|
2010-02-25 13:34:07 +00:00
|
|
|
}
|
|
|
|
reset_kprobe_instance();
|
|
|
|
}
|
|
|
|
}
|
2014-04-17 08:18:21 +00:00
|
|
|
NOKPROBE_SYMBOL(opt_pre_handler);
|
2010-02-25 13:34:07 +00:00
|
|
|
|
2010-12-03 09:54:09 +00:00
|
|
|
/* Free optimized instructions and optimized_kprobe */
|
2014-04-17 08:17:54 +00:00
|
|
|
static void free_aggr_kprobe(struct kprobe *p)
|
2010-12-03 09:54:09 +00:00
|
|
|
{
|
|
|
|
struct optimized_kprobe *op;
|
|
|
|
|
|
|
|
op = container_of(p, struct optimized_kprobe, kp);
|
|
|
|
arch_remove_optimized_kprobe(op);
|
|
|
|
arch_remove_kprobe(p);
|
|
|
|
kfree(op);
|
|
|
|
}
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Return true if the kprobe is ready for optimization. */
|
2010-02-25 13:34:07 +00:00
|
|
|
static inline int kprobe_optready(struct kprobe *p)
|
|
|
|
{
|
|
|
|
struct optimized_kprobe *op;
|
|
|
|
|
|
|
|
if (kprobe_aggrprobe(p)) {
|
|
|
|
op = container_of(p, struct optimized_kprobe, kp);
|
|
|
|
return arch_prepared_optinsn(&op->optinsn);
|
|
|
|
}
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Return true if the kprobe is disarmed. Note: p must be on hash list */
|
x86/kprobes: Fix arch_check_optimized_kprobe check within optimized_kprobe range
When arch_prepare_optimized_kprobe calculating jump destination address,
it copies original instructions from jmp-optimized kprobe (see
__recover_optprobed_insn), and calculated based on length of original
instruction.
arch_check_optimized_kprobe does not check KPROBE_FLAG_OPTIMATED when
checking whether jmp-optimized kprobe exists.
As a result, setup_detour_execution may jump to a range that has been
overwritten by jump destination address, resulting in an inval opcode error.
For example, assume that register two kprobes whose addresses are
<func+9> and <func+11> in "func" function.
The original code of "func" function is as follows:
0xffffffff816cb5e9 <+9>: push %r12
0xffffffff816cb5eb <+11>: xor %r12d,%r12d
0xffffffff816cb5ee <+14>: test %rdi,%rdi
0xffffffff816cb5f1 <+17>: setne %r12b
0xffffffff816cb5f5 <+21>: push %rbp
1.Register the kprobe for <func+11>, assume that is kp1, corresponding optimized_kprobe is op1.
After the optimization, "func" code changes to:
0xffffffff816cc079 <+9>: push %r12
0xffffffff816cc07b <+11>: jmp 0xffffffffa0210000
0xffffffff816cc080 <+16>: incl 0xf(%rcx)
0xffffffff816cc083 <+19>: xchg %eax,%ebp
0xffffffff816cc084 <+20>: (bad)
0xffffffff816cc085 <+21>: push %rbp
Now op1->flags == KPROBE_FLAG_OPTIMATED;
2. Register the kprobe for <func+9>, assume that is kp2, corresponding optimized_kprobe is op2.
register_kprobe(kp2)
register_aggr_kprobe
alloc_aggr_kprobe
__prepare_optimized_kprobe
arch_prepare_optimized_kprobe
__recover_optprobed_insn // copy original bytes from kp1->optinsn.copied_insn,
// jump address = <func+14>
3. disable kp1:
disable_kprobe(kp1)
__disable_kprobe
...
if (p == orig_p || aggr_kprobe_disabled(orig_p)) {
ret = disarm_kprobe(orig_p, true) // add op1 in unoptimizing_list, not unoptimized
orig_p->flags |= KPROBE_FLAG_DISABLED; // op1->flags == KPROBE_FLAG_OPTIMATED | KPROBE_FLAG_DISABLED
...
4. unregister kp2
__unregister_kprobe_top
...
if (!kprobe_disabled(ap) && !kprobes_all_disarmed) {
optimize_kprobe(op)
...
if (arch_check_optimized_kprobe(op) < 0) // because op1 has KPROBE_FLAG_DISABLED, here not return
return;
p->kp.flags |= KPROBE_FLAG_OPTIMIZED; // now op2 has KPROBE_FLAG_OPTIMIZED
}
"func" code now is:
0xffffffff816cc079 <+9>: int3
0xffffffff816cc07a <+10>: push %rsp
0xffffffff816cc07b <+11>: jmp 0xffffffffa0210000
0xffffffff816cc080 <+16>: incl 0xf(%rcx)
0xffffffff816cc083 <+19>: xchg %eax,%ebp
0xffffffff816cc084 <+20>: (bad)
0xffffffff816cc085 <+21>: push %rbp
5. if call "func", int3 handler call setup_detour_execution:
if (p->flags & KPROBE_FLAG_OPTIMIZED) {
...
regs->ip = (unsigned long)op->optinsn.insn + TMPL_END_IDX;
...
}
The code for the destination address is
0xffffffffa021072c: push %r12
0xffffffffa021072e: xor %r12d,%r12d
0xffffffffa0210731: jmp 0xffffffff816cb5ee <func+14>
However, <func+14> is not a valid start instruction address. As a result, an error occurs.
Link: https://lore.kernel.org/all/20230216034247.32348-3-yangjihong1@huawei.com/
Fixes: f66c0447cca1 ("kprobes: Set unoptimized flag after unoptimizing code")
Signed-off-by: Yang Jihong <yangjihong1@huawei.com>
Cc: stable@vger.kernel.org
Acked-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
Signed-off-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
2023-02-20 23:49:16 +00:00
|
|
|
bool kprobe_disarmed(struct kprobe *p)
|
2010-12-03 09:54:09 +00:00
|
|
|
{
|
|
|
|
struct optimized_kprobe *op;
|
|
|
|
|
|
|
|
/* If kprobe is not aggr/opt probe, just return kprobe is disabled */
|
|
|
|
if (!kprobe_aggrprobe(p))
|
|
|
|
return kprobe_disabled(p);
|
|
|
|
|
|
|
|
op = container_of(p, struct optimized_kprobe, kp);
|
|
|
|
|
|
|
|
return kprobe_disabled(p) && list_empty(&op->list);
|
|
|
|
}
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Return true if the probe is queued on (un)optimizing lists */
|
2021-09-14 14:40:16 +00:00
|
|
|
static bool kprobe_queued(struct kprobe *p)
|
2010-12-03 09:54:09 +00:00
|
|
|
{
|
|
|
|
struct optimized_kprobe *op;
|
|
|
|
|
|
|
|
if (kprobe_aggrprobe(p)) {
|
|
|
|
op = container_of(p, struct optimized_kprobe, kp);
|
|
|
|
if (!list_empty(&op->list))
|
2021-09-14 14:40:16 +00:00
|
|
|
return true;
|
2010-12-03 09:54:09 +00:00
|
|
|
}
|
2021-09-14 14:40:16 +00:00
|
|
|
return false;
|
2010-12-03 09:54:09 +00:00
|
|
|
}
|
|
|
|
|
2010-02-25 13:34:07 +00:00
|
|
|
/*
|
|
|
|
* Return an optimized kprobe whose optimizing code replaces
|
2021-09-14 14:39:34 +00:00
|
|
|
* instructions including 'addr' (exclude breakpoint).
|
2010-02-25 13:34:07 +00:00
|
|
|
*/
|
2021-09-14 14:40:07 +00:00
|
|
|
static struct kprobe *get_optimized_kprobe(kprobe_opcode_t *addr)
|
2010-02-25 13:34:07 +00:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
struct kprobe *p = NULL;
|
|
|
|
struct optimized_kprobe *op;
|
|
|
|
|
|
|
|
/* Don't check i == 0, since that is a breakpoint case. */
|
2021-09-14 14:40:07 +00:00
|
|
|
for (i = 1; !p && i < MAX_OPTIMIZED_LENGTH / sizeof(kprobe_opcode_t); i++)
|
|
|
|
p = get_kprobe(addr - i);
|
2010-02-25 13:34:07 +00:00
|
|
|
|
|
|
|
if (p && kprobe_optready(p)) {
|
|
|
|
op = container_of(p, struct optimized_kprobe, kp);
|
|
|
|
if (arch_within_optimized_kprobe(op, addr))
|
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Optimization staging list, protected by 'kprobe_mutex' */
|
2010-02-25 13:34:07 +00:00
|
|
|
static LIST_HEAD(optimizing_list);
|
2010-12-03 09:54:09 +00:00
|
|
|
static LIST_HEAD(unoptimizing_list);
|
2013-05-22 09:34:09 +00:00
|
|
|
static LIST_HEAD(freeing_list);
|
2010-02-25 13:34:07 +00:00
|
|
|
|
|
|
|
static void kprobe_optimizer(struct work_struct *work);
|
|
|
|
static DECLARE_DELAYED_WORK(optimizing_work, kprobe_optimizer);
|
|
|
|
#define OPTIMIZE_DELAY 5
|
|
|
|
|
2010-12-03 09:54:03 +00:00
|
|
|
/*
|
|
|
|
* Optimize (replace a breakpoint with a jump) kprobes listed on
|
2021-09-14 14:39:34 +00:00
|
|
|
* 'optimizing_list'.
|
2010-12-03 09:54:03 +00:00
|
|
|
*/
|
2014-04-17 08:17:54 +00:00
|
|
|
static void do_optimize_kprobes(void)
|
2010-02-25 13:34:07 +00:00
|
|
|
{
|
2019-08-12 18:43:02 +00:00
|
|
|
lockdep_assert_held(&text_mutex);
|
2010-02-25 13:34:07 +00:00
|
|
|
/*
|
2021-09-14 14:39:34 +00:00
|
|
|
* The optimization/unoptimization refers 'online_cpus' via
|
|
|
|
* stop_machine() and cpu-hotplug modifies the 'online_cpus'.
|
|
|
|
* And same time, 'text_mutex' will be held in cpu-hotplug and here.
|
|
|
|
* This combination can cause a deadlock (cpu-hotplug tries to lock
|
|
|
|
* 'text_mutex' but stop_machine() can not be done because
|
|
|
|
* the 'online_cpus' has been changed)
|
|
|
|
* To avoid this deadlock, caller must have locked cpu-hotplug
|
|
|
|
* for preventing cpu-hotplug outside of 'text_mutex' locking.
|
2010-02-25 13:34:07 +00:00
|
|
|
*/
|
2017-05-24 08:15:36 +00:00
|
|
|
lockdep_assert_cpus_held();
|
|
|
|
|
|
|
|
/* Optimization never be done when disarmed */
|
|
|
|
if (kprobes_all_disarmed || !kprobes_allow_optimization ||
|
|
|
|
list_empty(&optimizing_list))
|
|
|
|
return;
|
|
|
|
|
2010-12-03 09:54:28 +00:00
|
|
|
arch_optimize_kprobes(&optimizing_list);
|
2010-12-03 09:54:03 +00:00
|
|
|
}
|
|
|
|
|
2010-12-03 09:54:09 +00:00
|
|
|
/*
|
|
|
|
* Unoptimize (replace a jump with a breakpoint and remove the breakpoint
|
2021-09-14 14:39:34 +00:00
|
|
|
* if need) kprobes listed on 'unoptimizing_list'.
|
2010-12-03 09:54:09 +00:00
|
|
|
*/
|
2014-04-17 08:17:54 +00:00
|
|
|
static void do_unoptimize_kprobes(void)
|
2010-12-03 09:54:09 +00:00
|
|
|
{
|
|
|
|
struct optimized_kprobe *op, *tmp;
|
|
|
|
|
2019-08-12 18:43:02 +00:00
|
|
|
lockdep_assert_held(&text_mutex);
|
2017-05-24 08:15:36 +00:00
|
|
|
/* See comment in do_optimize_kprobes() */
|
|
|
|
lockdep_assert_cpus_held();
|
|
|
|
|
2023-02-20 23:49:16 +00:00
|
|
|
if (!list_empty(&unoptimizing_list))
|
|
|
|
arch_unoptimize_kprobes(&unoptimizing_list, &freeing_list);
|
2010-12-03 09:54:09 +00:00
|
|
|
|
2023-02-20 23:49:16 +00:00
|
|
|
/* Loop on 'freeing_list' for disarming and removing from kprobe hash list */
|
2013-05-22 09:34:09 +00:00
|
|
|
list_for_each_entry_safe(op, tmp, &freeing_list, list) {
|
2019-11-27 05:57:04 +00:00
|
|
|
/* Switching from detour code to origin */
|
|
|
|
op->kp.flags &= ~KPROBE_FLAG_OPTIMIZED;
|
2023-02-20 23:49:16 +00:00
|
|
|
/* Disarm probes if marked disabled and not gone */
|
|
|
|
if (kprobe_disabled(&op->kp) && !kprobe_gone(&op->kp))
|
2010-12-03 09:54:09 +00:00
|
|
|
arch_disarm_kprobe(&op->kp);
|
|
|
|
if (kprobe_unused(&op->kp)) {
|
|
|
|
/*
|
|
|
|
* Remove unused probes from hash list. After waiting
|
|
|
|
* for synchronization, these probes are reclaimed.
|
2021-09-14 14:39:34 +00:00
|
|
|
* (reclaiming is done by do_free_cleaned_kprobes().)
|
2010-12-03 09:54:09 +00:00
|
|
|
*/
|
|
|
|
hlist_del_rcu(&op->kp.hlist);
|
|
|
|
} else
|
|
|
|
list_del_init(&op->list);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Reclaim all kprobes on the 'freeing_list' */
|
2014-04-17 08:17:54 +00:00
|
|
|
static void do_free_cleaned_kprobes(void)
|
2010-12-03 09:54:09 +00:00
|
|
|
{
|
|
|
|
struct optimized_kprobe *op, *tmp;
|
|
|
|
|
2013-05-22 09:34:09 +00:00
|
|
|
list_for_each_entry_safe(op, tmp, &freeing_list, list) {
|
2010-12-03 09:54:09 +00:00
|
|
|
list_del_init(&op->list);
|
2018-09-11 10:21:09 +00:00
|
|
|
if (WARN_ON_ONCE(!kprobe_unused(&op->kp))) {
|
|
|
|
/*
|
|
|
|
* This must not happen, but if there is a kprobe
|
|
|
|
* still in use, keep it on kprobes hash list.
|
|
|
|
*/
|
|
|
|
continue;
|
|
|
|
}
|
2010-12-03 09:54:09 +00:00
|
|
|
free_aggr_kprobe(&op->kp);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Start optimizer after OPTIMIZE_DELAY passed */
|
2014-04-17 08:17:54 +00:00
|
|
|
static void kick_kprobe_optimizer(void)
|
2010-12-03 09:54:09 +00:00
|
|
|
{
|
2012-12-22 01:57:00 +00:00
|
|
|
schedule_delayed_work(&optimizing_work, OPTIMIZE_DELAY);
|
2010-12-03 09:54:09 +00:00
|
|
|
}
|
|
|
|
|
2010-12-03 09:54:03 +00:00
|
|
|
/* Kprobe jump optimizer */
|
2014-04-17 08:17:54 +00:00
|
|
|
static void kprobe_optimizer(struct work_struct *work)
|
2010-12-03 09:54:03 +00:00
|
|
|
{
|
2012-06-05 10:28:14 +00:00
|
|
|
mutex_lock(&kprobe_mutex);
|
2017-05-24 08:15:36 +00:00
|
|
|
cpus_read_lock();
|
2019-08-12 18:43:02 +00:00
|
|
|
mutex_lock(&text_mutex);
|
2010-12-03 09:54:03 +00:00
|
|
|
|
|
|
|
/*
|
2010-12-03 09:54:09 +00:00
|
|
|
* Step 1: Unoptimize kprobes and collect cleaned (unused and disarmed)
|
|
|
|
* kprobes before waiting for quiesence period.
|
|
|
|
*/
|
2013-05-22 09:34:09 +00:00
|
|
|
do_unoptimize_kprobes();
|
2010-12-03 09:54:09 +00:00
|
|
|
|
|
|
|
/*
|
2017-10-19 23:43:39 +00:00
|
|
|
* Step 2: Wait for quiesence period to ensure all potentially
|
|
|
|
* preempted tasks to have normally scheduled. Because optprobe
|
|
|
|
* may modify multiple instructions, there is a chance that Nth
|
|
|
|
* instruction is preempted. In that case, such tasks can return
|
|
|
|
* to 2nd-Nth byte of jump instruction. This wait is for avoiding it.
|
|
|
|
* Note that on non-preemptive kernel, this is transparently converted
|
|
|
|
* to synchronoze_sched() to wait for all interrupts to have completed.
|
2010-12-03 09:54:03 +00:00
|
|
|
*/
|
2017-10-19 23:43:39 +00:00
|
|
|
synchronize_rcu_tasks();
|
2010-12-03 09:54:03 +00:00
|
|
|
|
2010-12-03 09:54:09 +00:00
|
|
|
/* Step 3: Optimize kprobes after quiesence period */
|
2010-12-03 09:54:03 +00:00
|
|
|
do_optimize_kprobes();
|
2010-12-03 09:54:09 +00:00
|
|
|
|
|
|
|
/* Step 4: Free cleaned kprobes after quiesence period */
|
2013-05-22 09:34:09 +00:00
|
|
|
do_free_cleaned_kprobes();
|
2010-12-03 09:54:09 +00:00
|
|
|
|
2019-08-12 18:43:02 +00:00
|
|
|
mutex_unlock(&text_mutex);
|
2017-05-24 08:15:36 +00:00
|
|
|
cpus_read_unlock();
|
2010-12-03 09:54:09 +00:00
|
|
|
|
2010-12-03 09:54:28 +00:00
|
|
|
/* Step 5: Kick optimizer again if needed */
|
2010-12-03 09:54:34 +00:00
|
|
|
if (!list_empty(&optimizing_list) || !list_empty(&unoptimizing_list))
|
2010-12-03 09:54:28 +00:00
|
|
|
kick_kprobe_optimizer();
|
2020-05-12 08:02:56 +00:00
|
|
|
|
|
|
|
mutex_unlock(&kprobe_mutex);
|
2010-12-03 09:54:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Wait for completing optimization and unoptimization */
|
2017-05-17 08:19:49 +00:00
|
|
|
void wait_for_kprobe_optimizer(void)
|
2010-12-03 09:54:09 +00:00
|
|
|
{
|
2012-12-22 01:57:00 +00:00
|
|
|
mutex_lock(&kprobe_mutex);
|
|
|
|
|
|
|
|
while (!list_empty(&optimizing_list) || !list_empty(&unoptimizing_list)) {
|
|
|
|
mutex_unlock(&kprobe_mutex);
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* This will also make 'optimizing_work' execute immmediately */
|
2012-12-22 01:57:00 +00:00
|
|
|
flush_delayed_work(&optimizing_work);
|
2021-09-14 14:39:34 +00:00
|
|
|
/* 'optimizing_work' might not have been queued yet, relax */
|
2012-12-22 01:57:00 +00:00
|
|
|
cpu_relax();
|
|
|
|
|
|
|
|
mutex_lock(&kprobe_mutex);
|
|
|
|
}
|
|
|
|
|
|
|
|
mutex_unlock(&kprobe_mutex);
|
2010-02-25 13:34:07 +00:00
|
|
|
}
|
|
|
|
|
2023-02-20 23:49:16 +00:00
|
|
|
bool optprobe_queued_unopt(struct optimized_kprobe *op)
|
2020-01-07 14:42:24 +00:00
|
|
|
{
|
|
|
|
struct optimized_kprobe *_op;
|
|
|
|
|
|
|
|
list_for_each_entry(_op, &unoptimizing_list, list) {
|
|
|
|
if (op == _op)
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
2010-02-25 13:34:07 +00:00
|
|
|
/* Optimize kprobe if p is ready to be optimized */
|
2014-04-17 08:17:54 +00:00
|
|
|
static void optimize_kprobe(struct kprobe *p)
|
2010-02-25 13:34:07 +00:00
|
|
|
{
|
|
|
|
struct optimized_kprobe *op;
|
|
|
|
|
|
|
|
/* Check if the kprobe is disabled or not ready for optimization. */
|
2010-02-25 13:34:15 +00:00
|
|
|
if (!kprobe_optready(p) || !kprobes_allow_optimization ||
|
2010-02-25 13:34:07 +00:00
|
|
|
(kprobe_disabled(p) || kprobes_all_disarmed))
|
|
|
|
return;
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* kprobes with 'post_handler' can not be optimized */
|
2018-06-19 16:10:27 +00:00
|
|
|
if (p->post_handler)
|
2010-02-25 13:34:07 +00:00
|
|
|
return;
|
|
|
|
|
|
|
|
op = container_of(p, struct optimized_kprobe, kp);
|
|
|
|
|
|
|
|
/* Check there is no other kprobes at the optimized instructions */
|
|
|
|
if (arch_check_optimized_kprobe(op) < 0)
|
|
|
|
return;
|
|
|
|
|
|
|
|
/* Check if it is already optimized. */
|
2020-01-07 14:42:24 +00:00
|
|
|
if (op->kp.flags & KPROBE_FLAG_OPTIMIZED) {
|
|
|
|
if (optprobe_queued_unopt(op)) {
|
|
|
|
/* This is under unoptimizing. Just dequeue the probe */
|
|
|
|
list_del_init(&op->list);
|
|
|
|
}
|
2010-02-25 13:34:07 +00:00
|
|
|
return;
|
2020-01-07 14:42:24 +00:00
|
|
|
}
|
2010-02-25 13:34:07 +00:00
|
|
|
op->kp.flags |= KPROBE_FLAG_OPTIMIZED;
|
2010-12-03 09:54:09 +00:00
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/*
|
|
|
|
* On the 'unoptimizing_list' and 'optimizing_list',
|
|
|
|
* 'op' must have OPTIMIZED flag
|
|
|
|
*/
|
2020-01-07 14:42:24 +00:00
|
|
|
if (WARN_ON_ONCE(!list_empty(&op->list)))
|
|
|
|
return;
|
|
|
|
|
|
|
|
list_add(&op->list, &optimizing_list);
|
|
|
|
kick_kprobe_optimizer();
|
2010-12-03 09:54:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Short cut to direct unoptimizing */
|
2014-04-17 08:17:54 +00:00
|
|
|
static void force_unoptimize_kprobe(struct optimized_kprobe *op)
|
2010-12-03 09:54:09 +00:00
|
|
|
{
|
2017-05-24 08:15:36 +00:00
|
|
|
lockdep_assert_cpus_held();
|
2010-12-03 09:54:09 +00:00
|
|
|
arch_unoptimize_kprobe(op);
|
2019-11-27 05:57:04 +00:00
|
|
|
op->kp.flags &= ~KPROBE_FLAG_OPTIMIZED;
|
2010-02-25 13:34:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/* Unoptimize a kprobe if p is optimized */
|
2014-04-17 08:17:54 +00:00
|
|
|
static void unoptimize_kprobe(struct kprobe *p, bool force)
|
2010-02-25 13:34:07 +00:00
|
|
|
{
|
|
|
|
struct optimized_kprobe *op;
|
|
|
|
|
2010-12-03 09:54:09 +00:00
|
|
|
if (!kprobe_aggrprobe(p) || kprobe_disarmed(p))
|
|
|
|
return; /* This is not an optprobe nor optimized */
|
|
|
|
|
|
|
|
op = container_of(p, struct optimized_kprobe, kp);
|
2020-01-07 14:42:24 +00:00
|
|
|
if (!kprobe_optimized(p))
|
2010-12-03 09:54:09 +00:00
|
|
|
return;
|
|
|
|
|
|
|
|
if (!list_empty(&op->list)) {
|
2020-01-07 14:42:24 +00:00
|
|
|
if (optprobe_queued_unopt(op)) {
|
|
|
|
/* Queued in unoptimizing queue */
|
|
|
|
if (force) {
|
|
|
|
/*
|
|
|
|
* Forcibly unoptimize the kprobe here, and queue it
|
|
|
|
* in the freeing list for release afterwards.
|
|
|
|
*/
|
|
|
|
force_unoptimize_kprobe(op);
|
|
|
|
list_move(&op->list, &freeing_list);
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
/* Dequeue from the optimizing queue */
|
|
|
|
list_del_init(&op->list);
|
|
|
|
op->kp.flags &= ~KPROBE_FLAG_OPTIMIZED;
|
|
|
|
}
|
2010-12-03 09:54:09 +00:00
|
|
|
return;
|
|
|
|
}
|
2020-01-07 14:42:24 +00:00
|
|
|
|
2010-12-03 09:54:09 +00:00
|
|
|
/* Optimized kprobe case */
|
2020-01-07 14:42:24 +00:00
|
|
|
if (force) {
|
2010-12-03 09:54:09 +00:00
|
|
|
/* Forcibly update the code: this is a special case */
|
|
|
|
force_unoptimize_kprobe(op);
|
2020-01-07 14:42:24 +00:00
|
|
|
} else {
|
2010-12-03 09:54:09 +00:00
|
|
|
list_add(&op->list, &unoptimizing_list);
|
|
|
|
kick_kprobe_optimizer();
|
2010-02-25 13:34:07 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2010-12-03 09:54:16 +00:00
|
|
|
/* Cancel unoptimizing for reusing */
|
2018-09-11 10:20:40 +00:00
|
|
|
static int reuse_unused_kprobe(struct kprobe *ap)
|
2010-12-03 09:54:16 +00:00
|
|
|
{
|
|
|
|
struct optimized_kprobe *op;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Unused kprobe MUST be on the way of delayed unoptimizing (means
|
|
|
|
* there is still a relative jump) and disabled.
|
|
|
|
*/
|
|
|
|
op = container_of(ap, struct optimized_kprobe, kp);
|
2018-04-28 12:36:33 +00:00
|
|
|
WARN_ON_ONCE(list_empty(&op->list));
|
2010-12-03 09:54:16 +00:00
|
|
|
/* Enable the probe again */
|
|
|
|
ap->flags &= ~KPROBE_FLAG_DISABLED;
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Optimize it again. (remove from 'op->list') */
|
kprobes: Fix error check when reusing optimized probes
The following commit introduced a bug in one of our error paths:
819319fc9346 ("kprobes: Return error if we fail to reuse kprobe instead of BUG_ON()")
it missed to handle the return value of kprobe_optready() as
error-value. In reality, the kprobe_optready() returns a bool
result, so "true" case must be passed instead of 0.
This causes some errors on kprobe boot-time selftests on ARM:
[ ] Beginning kprobe tests...
[ ] Probe ARM code
[ ] kprobe
[ ] kretprobe
[ ] ARM instruction simulation
[ ] Check decoding tables
[ ] Run test cases
[ ] FAIL: test_case_handler not run
[ ] FAIL: Test andge r10, r11, r14, asr r7
[ ] FAIL: Scenario 11
...
[ ] FAIL: Scenario 7
[ ] Total instruction simulation tests=1631, pass=1433 fail=198
[ ] kprobe tests failed
This can happen if an optimized probe is unregistered and next
kprobe is registered on same address until the previous probe
is not reclaimed.
If this happens, a hidden aggregated probe may be kept in memory,
and no new kprobe can probe same address. Also, in that case
register_kprobe() will return "1" instead of minus error value,
which can mislead caller logic.
Signed-off-by: Masami Hiramatsu <mhiramat@kernel.org>
Cc: Anil S Keshavamurthy <anil.s.keshavamurthy@intel.com>
Cc: David S . Miller <davem@davemloft.net>
Cc: Linus Torvalds <torvalds@linux-foundation.org>
Cc: Naveen N . Rao <naveen.n.rao@linux.vnet.ibm.com>
Cc: Peter Zijlstra <peterz@infradead.org>
Cc: Thomas Gleixner <tglx@linutronix.de>
Cc: stable@vger.kernel.org # v5.0+
Fixes: 819319fc9346 ("kprobes: Return error if we fail to reuse kprobe instead of BUG_ON()")
Link: http://lkml.kernel.org/r/155530808559.32517.539898325433642204.stgit@devnote2
Signed-off-by: Ingo Molnar <mingo@kernel.org>
2019-04-15 06:01:25 +00:00
|
|
|
if (!kprobe_optready(ap))
|
|
|
|
return -EINVAL;
|
2018-09-11 10:20:40 +00:00
|
|
|
|
2010-12-03 09:54:16 +00:00
|
|
|
optimize_kprobe(ap);
|
2018-09-11 10:20:40 +00:00
|
|
|
return 0;
|
2010-12-03 09:54:16 +00:00
|
|
|
}
|
|
|
|
|
2010-02-25 13:34:07 +00:00
|
|
|
/* Remove optimized instructions */
|
2014-04-17 08:17:54 +00:00
|
|
|
static void kill_optimized_kprobe(struct kprobe *p)
|
2010-02-25 13:34:07 +00:00
|
|
|
{
|
|
|
|
struct optimized_kprobe *op;
|
|
|
|
|
|
|
|
op = container_of(p, struct optimized_kprobe, kp);
|
2010-12-03 09:54:09 +00:00
|
|
|
if (!list_empty(&op->list))
|
|
|
|
/* Dequeue from the (un)optimization queue */
|
2010-02-25 13:34:07 +00:00
|
|
|
list_del_init(&op->list);
|
2010-12-03 09:54:09 +00:00
|
|
|
op->kp.flags &= ~KPROBE_FLAG_OPTIMIZED;
|
2013-05-22 09:34:09 +00:00
|
|
|
|
|
|
|
if (kprobe_unused(p)) {
|
|
|
|
/*
|
2023-02-20 23:49:16 +00:00
|
|
|
* Unused kprobe is on unoptimizing or freeing list. We move it
|
|
|
|
* to freeing_list and let the kprobe_optimizer() remove it from
|
|
|
|
* the kprobe hash list and free it.
|
2013-05-22 09:34:09 +00:00
|
|
|
*/
|
2023-02-20 23:49:16 +00:00
|
|
|
if (optprobe_queued_unopt(op))
|
|
|
|
list_move(&op->list, &freeing_list);
|
2013-05-22 09:34:09 +00:00
|
|
|
}
|
|
|
|
|
2010-12-03 09:54:09 +00:00
|
|
|
/* Don't touch the code, because it is already freed. */
|
2010-02-25 13:34:07 +00:00
|
|
|
arch_remove_optimized_kprobe(op);
|
|
|
|
}
|
|
|
|
|
2017-04-19 12:52:25 +00:00
|
|
|
static inline
|
|
|
|
void __prepare_optimized_kprobe(struct optimized_kprobe *op, struct kprobe *p)
|
|
|
|
{
|
|
|
|
if (!kprobe_ftrace(p))
|
|
|
|
arch_prepare_optimized_kprobe(op, p);
|
|
|
|
}
|
|
|
|
|
2010-02-25 13:34:07 +00:00
|
|
|
/* Try to prepare optimized instructions */
|
2014-04-17 08:17:54 +00:00
|
|
|
static void prepare_optimized_kprobe(struct kprobe *p)
|
2010-02-25 13:34:07 +00:00
|
|
|
{
|
|
|
|
struct optimized_kprobe *op;
|
|
|
|
|
|
|
|
op = container_of(p, struct optimized_kprobe, kp);
|
2017-04-19 12:52:25 +00:00
|
|
|
__prepare_optimized_kprobe(op, p);
|
2010-02-25 13:34:07 +00:00
|
|
|
}
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Allocate new optimized_kprobe and try to prepare optimized instructions. */
|
2014-04-17 08:17:54 +00:00
|
|
|
static struct kprobe *alloc_aggr_kprobe(struct kprobe *p)
|
2010-02-25 13:34:07 +00:00
|
|
|
{
|
|
|
|
struct optimized_kprobe *op;
|
|
|
|
|
|
|
|
op = kzalloc(sizeof(struct optimized_kprobe), GFP_KERNEL);
|
|
|
|
if (!op)
|
|
|
|
return NULL;
|
|
|
|
|
|
|
|
INIT_LIST_HEAD(&op->list);
|
|
|
|
op->kp.addr = p->addr;
|
2017-04-19 12:52:25 +00:00
|
|
|
__prepare_optimized_kprobe(op, p);
|
2010-02-25 13:34:07 +00:00
|
|
|
|
|
|
|
return &op->kp;
|
|
|
|
}
|
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
static void init_aggr_kprobe(struct kprobe *ap, struct kprobe *p);
|
2010-02-25 13:34:07 +00:00
|
|
|
|
|
|
|
/*
|
2021-09-14 14:39:34 +00:00
|
|
|
* Prepare an optimized_kprobe and optimize it.
|
|
|
|
* NOTE: 'p' must be a normal registered kprobe.
|
2010-02-25 13:34:07 +00:00
|
|
|
*/
|
2014-04-17 08:17:54 +00:00
|
|
|
static void try_to_optimize_kprobe(struct kprobe *p)
|
2010-02-25 13:34:07 +00:00
|
|
|
{
|
|
|
|
struct kprobe *ap;
|
|
|
|
struct optimized_kprobe *op;
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Impossible to optimize ftrace-based kprobe. */
|
2012-06-05 10:28:32 +00:00
|
|
|
if (kprobe_ftrace(p))
|
|
|
|
return;
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* For preparing optimization, jump_label_text_reserved() is called. */
|
2017-05-24 08:15:36 +00:00
|
|
|
cpus_read_lock();
|
2012-06-05 10:28:26 +00:00
|
|
|
jump_label_lock();
|
|
|
|
mutex_lock(&text_mutex);
|
|
|
|
|
2010-02-25 13:34:07 +00:00
|
|
|
ap = alloc_aggr_kprobe(p);
|
|
|
|
if (!ap)
|
2012-06-05 10:28:26 +00:00
|
|
|
goto out;
|
2010-02-25 13:34:07 +00:00
|
|
|
|
|
|
|
op = container_of(ap, struct optimized_kprobe, kp);
|
|
|
|
if (!arch_prepared_optinsn(&op->optinsn)) {
|
2021-09-14 14:39:34 +00:00
|
|
|
/* If failed to setup optimizing, fallback to kprobe. */
|
2010-12-03 09:54:09 +00:00
|
|
|
arch_remove_optimized_kprobe(op);
|
|
|
|
kfree(op);
|
2012-06-05 10:28:26 +00:00
|
|
|
goto out;
|
2010-02-25 13:34:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
init_aggr_kprobe(ap, p);
|
2021-09-14 14:39:34 +00:00
|
|
|
optimize_kprobe(ap); /* This just kicks optimizer thread. */
|
2012-06-05 10:28:26 +00:00
|
|
|
|
|
|
|
out:
|
|
|
|
mutex_unlock(&text_mutex);
|
|
|
|
jump_label_unlock();
|
2017-05-24 08:15:36 +00:00
|
|
|
cpus_read_unlock();
|
2010-02-25 13:34:07 +00:00
|
|
|
}
|
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
static void optimize_all_kprobes(void)
|
2010-02-25 13:34:15 +00:00
|
|
|
{
|
|
|
|
struct hlist_head *head;
|
|
|
|
struct kprobe *p;
|
|
|
|
unsigned int i;
|
|
|
|
|
2013-04-18 09:33:18 +00:00
|
|
|
mutex_lock(&kprobe_mutex);
|
2021-09-14 14:39:34 +00:00
|
|
|
/* If optimization is already allowed, just return. */
|
2010-02-25 13:34:15 +00:00
|
|
|
if (kprobes_allow_optimization)
|
2013-04-18 09:33:18 +00:00
|
|
|
goto out;
|
2010-02-25 13:34:15 +00:00
|
|
|
|
2017-05-24 08:15:36 +00:00
|
|
|
cpus_read_lock();
|
2010-02-25 13:34:15 +00:00
|
|
|
kprobes_allow_optimization = true;
|
|
|
|
for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
|
|
|
|
head = &kprobe_table[i];
|
2020-05-12 08:02:44 +00:00
|
|
|
hlist_for_each_entry(p, head, hlist)
|
2010-02-25 13:34:15 +00:00
|
|
|
if (!kprobe_disabled(p))
|
|
|
|
optimize_kprobe(p);
|
|
|
|
}
|
2017-05-24 08:15:36 +00:00
|
|
|
cpus_read_unlock();
|
2021-09-14 14:39:25 +00:00
|
|
|
pr_info("kprobe jump-optimization is enabled. All kprobes are optimized if possible.\n");
|
2013-04-18 09:33:18 +00:00
|
|
|
out:
|
|
|
|
mutex_unlock(&kprobe_mutex);
|
2010-02-25 13:34:15 +00:00
|
|
|
}
|
|
|
|
|
2021-02-18 14:29:23 +00:00
|
|
|
#ifdef CONFIG_SYSCTL
|
2014-04-17 08:17:54 +00:00
|
|
|
static void unoptimize_all_kprobes(void)
|
2010-02-25 13:34:15 +00:00
|
|
|
{
|
|
|
|
struct hlist_head *head;
|
|
|
|
struct kprobe *p;
|
|
|
|
unsigned int i;
|
|
|
|
|
2013-04-18 09:33:18 +00:00
|
|
|
mutex_lock(&kprobe_mutex);
|
2021-09-14 14:39:34 +00:00
|
|
|
/* If optimization is already prohibited, just return. */
|
2013-04-18 09:33:18 +00:00
|
|
|
if (!kprobes_allow_optimization) {
|
|
|
|
mutex_unlock(&kprobe_mutex);
|
2010-02-25 13:34:15 +00:00
|
|
|
return;
|
2013-04-18 09:33:18 +00:00
|
|
|
}
|
2010-02-25 13:34:15 +00:00
|
|
|
|
2017-05-24 08:15:36 +00:00
|
|
|
cpus_read_lock();
|
2010-02-25 13:34:15 +00:00
|
|
|
kprobes_allow_optimization = false;
|
|
|
|
for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
|
|
|
|
head = &kprobe_table[i];
|
2020-05-12 08:02:44 +00:00
|
|
|
hlist_for_each_entry(p, head, hlist) {
|
2010-02-25 13:34:15 +00:00
|
|
|
if (!kprobe_disabled(p))
|
2010-12-03 09:54:09 +00:00
|
|
|
unoptimize_kprobe(p, false);
|
2010-02-25 13:34:15 +00:00
|
|
|
}
|
|
|
|
}
|
2017-05-24 08:15:36 +00:00
|
|
|
cpus_read_unlock();
|
2013-04-18 09:33:18 +00:00
|
|
|
mutex_unlock(&kprobe_mutex);
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Wait for unoptimizing completion. */
|
2010-12-03 09:54:09 +00:00
|
|
|
wait_for_kprobe_optimizer();
|
2021-09-14 14:39:25 +00:00
|
|
|
pr_info("kprobe jump-optimization is disabled. All kprobes are based on software breakpoint.\n");
|
2010-02-25 13:34:15 +00:00
|
|
|
}
|
|
|
|
|
2013-04-18 09:33:18 +00:00
|
|
|
static DEFINE_MUTEX(kprobe_sysctl_mutex);
|
2022-01-22 06:13:41 +00:00
|
|
|
static int sysctl_kprobes_optimization;
|
sysctl: treewide: constify the ctl_table argument of proc_handlers
const qualify the struct ctl_table argument in the proc_handler function
signatures. This is a prerequisite to moving the static ctl_table
structs into .rodata data which will ensure that proc_handler function
pointers cannot be modified.
This patch has been generated by the following coccinelle script:
```
virtual patch
@r1@
identifier ctl, write, buffer, lenp, ppos;
identifier func !~ "appldata_(timer|interval)_handler|sched_(rt|rr)_handler|rds_tcp_skbuf_handler|proc_sctp_do_(hmac_alg|rto_min|rto_max|udp_port|alpha_beta|auth|probe_interval)";
@@
int func(
- struct ctl_table *ctl
+ const struct ctl_table *ctl
,int write, void *buffer, size_t *lenp, loff_t *ppos);
@r2@
identifier func, ctl, write, buffer, lenp, ppos;
@@
int func(
- struct ctl_table *ctl
+ const struct ctl_table *ctl
,int write, void *buffer, size_t *lenp, loff_t *ppos)
{ ... }
@r3@
identifier func;
@@
int func(
- struct ctl_table *
+ const struct ctl_table *
,int , void *, size_t *, loff_t *);
@r4@
identifier func, ctl;
@@
int func(
- struct ctl_table *ctl
+ const struct ctl_table *ctl
,int , void *, size_t *, loff_t *);
@r5@
identifier func, write, buffer, lenp, ppos;
@@
int func(
- struct ctl_table *
+ const struct ctl_table *
,int write, void *buffer, size_t *lenp, loff_t *ppos);
```
* Code formatting was adjusted in xfs_sysctl.c to comply with code
conventions. The xfs_stats_clear_proc_handler,
xfs_panic_mask_proc_handler and xfs_deprecated_dointvec_minmax where
adjusted.
* The ctl_table argument in proc_watchdog_common was const qualified.
This is called from a proc_handler itself and is calling back into
another proc_handler, making it necessary to change it as part of the
proc_handler migration.
Co-developed-by: Thomas Weißschuh <linux@weissschuh.net>
Signed-off-by: Thomas Weißschuh <linux@weissschuh.net>
Co-developed-by: Joel Granados <j.granados@samsung.com>
Signed-off-by: Joel Granados <j.granados@samsung.com>
2024-07-24 18:59:29 +00:00
|
|
|
static int proc_kprobes_optimization_handler(const struct ctl_table *table,
|
2022-01-22 06:13:41 +00:00
|
|
|
int write, void *buffer,
|
|
|
|
size_t *length, loff_t *ppos)
|
2010-02-25 13:34:15 +00:00
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
|
2013-04-18 09:33:18 +00:00
|
|
|
mutex_lock(&kprobe_sysctl_mutex);
|
2010-02-25 13:34:15 +00:00
|
|
|
sysctl_kprobes_optimization = kprobes_allow_optimization ? 1 : 0;
|
|
|
|
ret = proc_dointvec_minmax(table, write, buffer, length, ppos);
|
|
|
|
|
|
|
|
if (sysctl_kprobes_optimization)
|
|
|
|
optimize_all_kprobes();
|
|
|
|
else
|
|
|
|
unoptimize_all_kprobes();
|
2013-04-18 09:33:18 +00:00
|
|
|
mutex_unlock(&kprobe_sysctl_mutex);
|
2010-02-25 13:34:15 +00:00
|
|
|
|
|
|
|
return ret;
|
|
|
|
}
|
2022-01-22 06:13:41 +00:00
|
|
|
|
|
|
|
static struct ctl_table kprobe_sysctls[] = {
|
|
|
|
{
|
|
|
|
.procname = "kprobes-optimization",
|
|
|
|
.data = &sysctl_kprobes_optimization,
|
|
|
|
.maxlen = sizeof(int),
|
|
|
|
.mode = 0644,
|
|
|
|
.proc_handler = proc_kprobes_optimization_handler,
|
|
|
|
.extra1 = SYSCTL_ZERO,
|
|
|
|
.extra2 = SYSCTL_ONE,
|
|
|
|
},
|
|
|
|
};
|
|
|
|
|
|
|
|
static void __init kprobe_sysctls_init(void)
|
|
|
|
{
|
|
|
|
register_sysctl_init("debug", kprobe_sysctls);
|
|
|
|
}
|
2010-02-25 13:34:15 +00:00
|
|
|
#endif /* CONFIG_SYSCTL */
|
|
|
|
|
2021-09-14 14:39:55 +00:00
|
|
|
/* Put a breakpoint for a probe. */
|
2014-04-17 08:17:54 +00:00
|
|
|
static void __arm_kprobe(struct kprobe *p)
|
2010-02-25 13:34:07 +00:00
|
|
|
{
|
2010-12-03 09:53:50 +00:00
|
|
|
struct kprobe *_p;
|
2010-02-25 13:34:07 +00:00
|
|
|
|
2021-09-14 14:39:55 +00:00
|
|
|
lockdep_assert_held(&text_mutex);
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Find the overlapping optimized kprobes. */
|
2021-09-14 14:40:07 +00:00
|
|
|
_p = get_optimized_kprobe(p->addr);
|
2010-12-03 09:53:50 +00:00
|
|
|
if (unlikely(_p))
|
2010-12-03 09:54:09 +00:00
|
|
|
/* Fallback to unoptimized kprobe */
|
|
|
|
unoptimize_kprobe(_p, true);
|
2010-02-25 13:34:07 +00:00
|
|
|
|
|
|
|
arch_arm_kprobe(p);
|
|
|
|
optimize_kprobe(p); /* Try to optimize (add kprobe to a list) */
|
|
|
|
}
|
|
|
|
|
2021-09-14 14:39:55 +00:00
|
|
|
/* Remove the breakpoint of a probe. */
|
2014-04-17 08:17:54 +00:00
|
|
|
static void __disarm_kprobe(struct kprobe *p, bool reopt)
|
2010-02-25 13:34:07 +00:00
|
|
|
{
|
2010-12-03 09:53:50 +00:00
|
|
|
struct kprobe *_p;
|
2010-02-25 13:34:07 +00:00
|
|
|
|
2021-09-14 14:39:55 +00:00
|
|
|
lockdep_assert_held(&text_mutex);
|
|
|
|
|
2015-02-13 22:40:26 +00:00
|
|
|
/* Try to unoptimize */
|
|
|
|
unoptimize_kprobe(p, kprobes_all_disarmed);
|
2010-02-25 13:34:07 +00:00
|
|
|
|
2010-12-03 09:54:09 +00:00
|
|
|
if (!kprobe_queued(p)) {
|
|
|
|
arch_disarm_kprobe(p);
|
2021-09-14 14:39:34 +00:00
|
|
|
/* If another kprobe was blocked, re-optimize it. */
|
2021-09-14 14:40:07 +00:00
|
|
|
_p = get_optimized_kprobe(p->addr);
|
2010-12-03 09:54:09 +00:00
|
|
|
if (unlikely(_p) && reopt)
|
|
|
|
optimize_kprobe(_p);
|
|
|
|
}
|
2021-09-14 14:39:34 +00:00
|
|
|
/*
|
|
|
|
* TODO: Since unoptimization and real disarming will be done by
|
|
|
|
* the worker thread, we can not check whether another probe are
|
|
|
|
* unoptimized because of this probe here. It should be re-optimized
|
|
|
|
* by the worker thread.
|
|
|
|
*/
|
2010-02-25 13:34:07 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#else /* !CONFIG_OPTPROBES */
|
|
|
|
|
|
|
|
#define optimize_kprobe(p) do {} while (0)
|
2010-12-03 09:54:09 +00:00
|
|
|
#define unoptimize_kprobe(p, f) do {} while (0)
|
2010-02-25 13:34:07 +00:00
|
|
|
#define kill_optimized_kprobe(p) do {} while (0)
|
|
|
|
#define prepare_optimized_kprobe(p) do {} while (0)
|
|
|
|
#define try_to_optimize_kprobe(p) do {} while (0)
|
|
|
|
#define __arm_kprobe(p) arch_arm_kprobe(p)
|
2010-12-03 09:54:09 +00:00
|
|
|
#define __disarm_kprobe(p, o) arch_disarm_kprobe(p)
|
|
|
|
#define kprobe_disarmed(p) kprobe_disabled(p)
|
|
|
|
#define wait_for_kprobe_optimizer() do {} while (0)
|
2010-02-25 13:34:07 +00:00
|
|
|
|
2018-09-11 10:20:40 +00:00
|
|
|
static int reuse_unused_kprobe(struct kprobe *ap)
|
2010-12-03 09:54:16 +00:00
|
|
|
{
|
2018-09-11 10:20:40 +00:00
|
|
|
/*
|
|
|
|
* If the optimized kprobe is NOT supported, the aggr kprobe is
|
|
|
|
* released at the same time that the last aggregated kprobe is
|
|
|
|
* unregistered.
|
|
|
|
* Thus there should be no chance to reuse unused kprobe.
|
|
|
|
*/
|
2021-09-14 14:39:25 +00:00
|
|
|
WARN_ON_ONCE(1);
|
2018-09-11 10:20:40 +00:00
|
|
|
return -EINVAL;
|
2010-12-03 09:54:16 +00:00
|
|
|
}
|
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
static void free_aggr_kprobe(struct kprobe *p)
|
2010-02-25 13:34:07 +00:00
|
|
|
{
|
2010-12-03 09:54:09 +00:00
|
|
|
arch_remove_kprobe(p);
|
2010-02-25 13:34:07 +00:00
|
|
|
kfree(p);
|
|
|
|
}
|
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
static struct kprobe *alloc_aggr_kprobe(struct kprobe *p)
|
2010-02-25 13:34:07 +00:00
|
|
|
{
|
|
|
|
return kzalloc(sizeof(struct kprobe), GFP_KERNEL);
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_OPTPROBES */
|
|
|
|
|
2012-09-28 08:15:20 +00:00
|
|
|
#ifdef CONFIG_KPROBES_ON_FTRACE
|
2012-06-05 10:28:32 +00:00
|
|
|
static struct ftrace_ops kprobe_ftrace_ops __read_mostly = {
|
2019-07-25 06:24:37 +00:00
|
|
|
.func = kprobe_ftrace_handler,
|
|
|
|
.flags = FTRACE_OPS_FL_SAVE_REGS,
|
|
|
|
};
|
|
|
|
|
|
|
|
static struct ftrace_ops kprobe_ipmodify_ops __read_mostly = {
|
2012-06-05 10:28:38 +00:00
|
|
|
.func = kprobe_ftrace_handler,
|
2014-11-21 10:25:23 +00:00
|
|
|
.flags = FTRACE_OPS_FL_SAVE_REGS | FTRACE_OPS_FL_IPMODIFY,
|
2012-06-05 10:28:32 +00:00
|
|
|
};
|
2019-07-25 06:24:37 +00:00
|
|
|
|
|
|
|
static int kprobe_ipmodify_enabled;
|
2012-06-05 10:28:32 +00:00
|
|
|
static int kprobe_ftrace_enabled;
|
kprobe/ftrace: bail out if ftrace was killed
If an error happens in ftrace, ftrace_kill() will prevent disarming
kprobes. Eventually, the ftrace_ops associated with the kprobes will be
freed, yet the kprobes will still be active, and when triggered, they
will use the freed memory, likely resulting in a page fault and panic.
This behavior can be reproduced quite easily, by creating a kprobe and
then triggering a ftrace_kill(). For simplicity, we can simulate an
ftrace error with a kernel module like [1]:
[1]: https://github.com/brenns10/kernel_stuff/tree/master/ftrace_killer
sudo perf probe --add commit_creds
sudo perf trace -e probe:commit_creds
# In another terminal
make
sudo insmod ftrace_killer.ko # calls ftrace_kill(), simulating bug
# Back to perf terminal
# ctrl-c
sudo perf probe --del commit_creds
After a short period, a page fault and panic would occur as the kprobe
continues to execute and uses the freed ftrace_ops. While ftrace_kill()
is supposed to be used only in extreme circumstances, it is invoked in
FTRACE_WARN_ON() and so there are many places where an unexpected bug
could be triggered, yet the system may continue operating, possibly
without the administrator noticing. If ftrace_kill() does not panic the
system, then we should do everything we can to continue operating,
rather than leave a ticking time bomb.
Link: https://lore.kernel.org/all/20240501162956.229427-1-stephen.s.brennan@oracle.com/
Signed-off-by: Stephen Brennan <stephen.s.brennan@oracle.com>
Acked-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
Acked-by: Guo Ren <guoren@kernel.org>
Reviewed-by: Steven Rostedt (Google) <rostedt@goodmis.org>
Signed-off-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
2024-05-01 16:29:56 +00:00
|
|
|
bool kprobe_ftrace_disabled;
|
2012-06-05 10:28:32 +00:00
|
|
|
|
2019-07-25 06:24:37 +00:00
|
|
|
static int __arm_kprobe_ftrace(struct kprobe *p, struct ftrace_ops *ops,
|
|
|
|
int *cnt)
|
2012-06-05 10:28:32 +00:00
|
|
|
{
|
2023-07-11 18:53:53 +00:00
|
|
|
int ret;
|
2012-06-05 10:28:32 +00:00
|
|
|
|
2021-09-14 14:39:55 +00:00
|
|
|
lockdep_assert_held(&kprobe_mutex);
|
|
|
|
|
2019-07-25 06:24:37 +00:00
|
|
|
ret = ftrace_set_filter_ip(ops, (unsigned long)p->addr, 0, 0);
|
2021-09-14 14:39:25 +00:00
|
|
|
if (WARN_ONCE(ret < 0, "Failed to arm kprobe-ftrace at %pS (error %d)\n", p->addr, ret))
|
2018-01-09 23:51:23 +00:00
|
|
|
return ret;
|
|
|
|
|
2019-07-25 06:24:37 +00:00
|
|
|
if (*cnt == 0) {
|
|
|
|
ret = register_ftrace_function(ops);
|
2021-09-14 14:39:25 +00:00
|
|
|
if (WARN(ret < 0, "Failed to register kprobe-ftrace (error %d)\n", ret))
|
2018-01-09 23:51:23 +00:00
|
|
|
goto err_ftrace;
|
2012-06-05 10:28:32 +00:00
|
|
|
}
|
2018-01-09 23:51:23 +00:00
|
|
|
|
2019-07-25 06:24:37 +00:00
|
|
|
(*cnt)++;
|
2018-01-09 23:51:23 +00:00
|
|
|
return ret;
|
|
|
|
|
|
|
|
err_ftrace:
|
|
|
|
/*
|
2019-07-25 06:24:37 +00:00
|
|
|
* At this point, sinec ops is not registered, we should be sefe from
|
|
|
|
* registering empty filter.
|
2018-01-09 23:51:23 +00:00
|
|
|
*/
|
2019-07-25 06:24:37 +00:00
|
|
|
ftrace_set_filter_ip(ops, (unsigned long)p->addr, 1, 0);
|
2018-01-09 23:51:23 +00:00
|
|
|
return ret;
|
2012-06-05 10:28:32 +00:00
|
|
|
}
|
|
|
|
|
2019-07-25 06:24:37 +00:00
|
|
|
static int arm_kprobe_ftrace(struct kprobe *p)
|
|
|
|
{
|
|
|
|
bool ipmodify = (p->post_handler != NULL);
|
|
|
|
|
|
|
|
return __arm_kprobe_ftrace(p,
|
|
|
|
ipmodify ? &kprobe_ipmodify_ops : &kprobe_ftrace_ops,
|
|
|
|
ipmodify ? &kprobe_ipmodify_enabled : &kprobe_ftrace_enabled);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int __disarm_kprobe_ftrace(struct kprobe *p, struct ftrace_ops *ops,
|
|
|
|
int *cnt)
|
2012-06-05 10:28:32 +00:00
|
|
|
{
|
2023-07-11 18:53:53 +00:00
|
|
|
int ret;
|
2012-06-05 10:28:32 +00:00
|
|
|
|
2021-09-14 14:39:55 +00:00
|
|
|
lockdep_assert_held(&kprobe_mutex);
|
|
|
|
|
2019-07-25 06:24:37 +00:00
|
|
|
if (*cnt == 1) {
|
|
|
|
ret = unregister_ftrace_function(ops);
|
2021-09-14 14:39:25 +00:00
|
|
|
if (WARN(ret < 0, "Failed to unregister kprobe-ftrace (error %d)\n", ret))
|
2018-01-09 23:51:24 +00:00
|
|
|
return ret;
|
2012-06-05 10:28:32 +00:00
|
|
|
}
|
2018-01-09 23:51:24 +00:00
|
|
|
|
2019-07-25 06:24:37 +00:00
|
|
|
(*cnt)--;
|
2018-01-09 23:51:24 +00:00
|
|
|
|
2019-07-25 06:24:37 +00:00
|
|
|
ret = ftrace_set_filter_ip(ops, (unsigned long)p->addr, 1, 0);
|
2021-09-14 14:39:25 +00:00
|
|
|
WARN_ONCE(ret < 0, "Failed to disarm kprobe-ftrace at %pS (error %d)\n",
|
2018-04-28 12:36:33 +00:00
|
|
|
p->addr, ret);
|
2018-01-09 23:51:24 +00:00
|
|
|
return ret;
|
2012-06-05 10:28:32 +00:00
|
|
|
}
|
2019-07-25 06:24:37 +00:00
|
|
|
|
|
|
|
static int disarm_kprobe_ftrace(struct kprobe *p)
|
|
|
|
{
|
|
|
|
bool ipmodify = (p->post_handler != NULL);
|
|
|
|
|
|
|
|
return __disarm_kprobe_ftrace(p,
|
|
|
|
ipmodify ? &kprobe_ipmodify_ops : &kprobe_ftrace_ops,
|
|
|
|
ipmodify ? &kprobe_ipmodify_enabled : &kprobe_ftrace_enabled);
|
|
|
|
}
|
kprobe/ftrace: bail out if ftrace was killed
If an error happens in ftrace, ftrace_kill() will prevent disarming
kprobes. Eventually, the ftrace_ops associated with the kprobes will be
freed, yet the kprobes will still be active, and when triggered, they
will use the freed memory, likely resulting in a page fault and panic.
This behavior can be reproduced quite easily, by creating a kprobe and
then triggering a ftrace_kill(). For simplicity, we can simulate an
ftrace error with a kernel module like [1]:
[1]: https://github.com/brenns10/kernel_stuff/tree/master/ftrace_killer
sudo perf probe --add commit_creds
sudo perf trace -e probe:commit_creds
# In another terminal
make
sudo insmod ftrace_killer.ko # calls ftrace_kill(), simulating bug
# Back to perf terminal
# ctrl-c
sudo perf probe --del commit_creds
After a short period, a page fault and panic would occur as the kprobe
continues to execute and uses the freed ftrace_ops. While ftrace_kill()
is supposed to be used only in extreme circumstances, it is invoked in
FTRACE_WARN_ON() and so there are many places where an unexpected bug
could be triggered, yet the system may continue operating, possibly
without the administrator noticing. If ftrace_kill() does not panic the
system, then we should do everything we can to continue operating,
rather than leave a ticking time bomb.
Link: https://lore.kernel.org/all/20240501162956.229427-1-stephen.s.brennan@oracle.com/
Signed-off-by: Stephen Brennan <stephen.s.brennan@oracle.com>
Acked-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
Acked-by: Guo Ren <guoren@kernel.org>
Reviewed-by: Steven Rostedt (Google) <rostedt@goodmis.org>
Signed-off-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
2024-05-01 16:29:56 +00:00
|
|
|
|
2024-05-18 02:17:55 +00:00
|
|
|
void kprobe_ftrace_kill(void)
|
kprobe/ftrace: bail out if ftrace was killed
If an error happens in ftrace, ftrace_kill() will prevent disarming
kprobes. Eventually, the ftrace_ops associated with the kprobes will be
freed, yet the kprobes will still be active, and when triggered, they
will use the freed memory, likely resulting in a page fault and panic.
This behavior can be reproduced quite easily, by creating a kprobe and
then triggering a ftrace_kill(). For simplicity, we can simulate an
ftrace error with a kernel module like [1]:
[1]: https://github.com/brenns10/kernel_stuff/tree/master/ftrace_killer
sudo perf probe --add commit_creds
sudo perf trace -e probe:commit_creds
# In another terminal
make
sudo insmod ftrace_killer.ko # calls ftrace_kill(), simulating bug
# Back to perf terminal
# ctrl-c
sudo perf probe --del commit_creds
After a short period, a page fault and panic would occur as the kprobe
continues to execute and uses the freed ftrace_ops. While ftrace_kill()
is supposed to be used only in extreme circumstances, it is invoked in
FTRACE_WARN_ON() and so there are many places where an unexpected bug
could be triggered, yet the system may continue operating, possibly
without the administrator noticing. If ftrace_kill() does not panic the
system, then we should do everything we can to continue operating,
rather than leave a ticking time bomb.
Link: https://lore.kernel.org/all/20240501162956.229427-1-stephen.s.brennan@oracle.com/
Signed-off-by: Stephen Brennan <stephen.s.brennan@oracle.com>
Acked-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
Acked-by: Guo Ren <guoren@kernel.org>
Reviewed-by: Steven Rostedt (Google) <rostedt@goodmis.org>
Signed-off-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
2024-05-01 16:29:56 +00:00
|
|
|
{
|
|
|
|
kprobe_ftrace_disabled = true;
|
|
|
|
}
|
2012-09-28 08:15:20 +00:00
|
|
|
#else /* !CONFIG_KPROBES_ON_FTRACE */
|
2020-08-05 17:20:46 +00:00
|
|
|
static inline int arm_kprobe_ftrace(struct kprobe *p)
|
|
|
|
{
|
|
|
|
return -ENODEV;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline int disarm_kprobe_ftrace(struct kprobe *p)
|
|
|
|
{
|
|
|
|
return -ENODEV;
|
|
|
|
}
|
2012-06-05 10:28:32 +00:00
|
|
|
#endif
|
|
|
|
|
2021-09-14 14:38:57 +00:00
|
|
|
static int prepare_kprobe(struct kprobe *p)
|
|
|
|
{
|
|
|
|
/* Must ensure p->addr is really on ftrace */
|
|
|
|
if (kprobe_ftrace(p))
|
|
|
|
return arch_prepare_kprobe_ftrace(p);
|
|
|
|
|
|
|
|
return arch_prepare_kprobe(p);
|
|
|
|
}
|
|
|
|
|
2018-01-09 23:51:23 +00:00
|
|
|
static int arm_kprobe(struct kprobe *kp)
|
2009-05-07 20:31:26 +00:00
|
|
|
{
|
2018-01-09 23:51:23 +00:00
|
|
|
if (unlikely(kprobe_ftrace(kp)))
|
|
|
|
return arm_kprobe_ftrace(kp);
|
|
|
|
|
2017-05-24 08:15:36 +00:00
|
|
|
cpus_read_lock();
|
2009-05-07 20:31:26 +00:00
|
|
|
mutex_lock(&text_mutex);
|
2010-02-25 13:34:07 +00:00
|
|
|
__arm_kprobe(kp);
|
2009-05-07 20:31:26 +00:00
|
|
|
mutex_unlock(&text_mutex);
|
2017-05-24 08:15:36 +00:00
|
|
|
cpus_read_unlock();
|
2018-01-09 23:51:23 +00:00
|
|
|
|
|
|
|
return 0;
|
2009-05-07 20:31:26 +00:00
|
|
|
}
|
|
|
|
|
2018-01-09 23:51:24 +00:00
|
|
|
static int disarm_kprobe(struct kprobe *kp, bool reopt)
|
2009-05-07 20:31:26 +00:00
|
|
|
{
|
2018-01-09 23:51:24 +00:00
|
|
|
if (unlikely(kprobe_ftrace(kp)))
|
|
|
|
return disarm_kprobe_ftrace(kp);
|
2017-05-24 08:15:36 +00:00
|
|
|
|
|
|
|
cpus_read_lock();
|
2009-05-07 20:31:26 +00:00
|
|
|
mutex_lock(&text_mutex);
|
2012-06-05 10:28:32 +00:00
|
|
|
__disarm_kprobe(kp, reopt);
|
2009-05-07 20:31:26 +00:00
|
|
|
mutex_unlock(&text_mutex);
|
2017-05-24 08:15:36 +00:00
|
|
|
cpus_read_unlock();
|
2018-01-09 23:51:24 +00:00
|
|
|
|
|
|
|
return 0;
|
2009-05-07 20:31:26 +00:00
|
|
|
}
|
|
|
|
|
2005-05-05 23:15:42 +00:00
|
|
|
/*
|
|
|
|
* Aggregate handlers for multiple kprobes support - these handlers
|
|
|
|
* take care of invoking the individual kprobe handlers on p->list
|
|
|
|
*/
|
2014-04-17 08:18:21 +00:00
|
|
|
static int aggr_pre_handler(struct kprobe *p, struct pt_regs *regs)
|
2005-05-05 23:15:42 +00:00
|
|
|
{
|
|
|
|
struct kprobe *kp;
|
|
|
|
|
2005-11-07 09:00:13 +00:00
|
|
|
list_for_each_entry_rcu(kp, &p->list, list) {
|
2009-04-07 02:01:02 +00:00
|
|
|
if (kp->pre_handler && likely(!kprobe_disabled(kp))) {
|
2005-11-07 09:00:07 +00:00
|
|
|
set_kprobe_instance(kp);
|
2005-06-23 07:09:41 +00:00
|
|
|
if (kp->pre_handler(kp, regs))
|
|
|
|
return 1;
|
2005-05-05 23:15:42 +00:00
|
|
|
}
|
2005-11-07 09:00:07 +00:00
|
|
|
reset_kprobe_instance();
|
2005-05-05 23:15:42 +00:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2014-04-17 08:18:21 +00:00
|
|
|
NOKPROBE_SYMBOL(aggr_pre_handler);
|
2005-05-05 23:15:42 +00:00
|
|
|
|
2014-04-17 08:18:21 +00:00
|
|
|
static void aggr_post_handler(struct kprobe *p, struct pt_regs *regs,
|
|
|
|
unsigned long flags)
|
2005-05-05 23:15:42 +00:00
|
|
|
{
|
|
|
|
struct kprobe *kp;
|
|
|
|
|
2005-11-07 09:00:13 +00:00
|
|
|
list_for_each_entry_rcu(kp, &p->list, list) {
|
2009-04-07 02:01:02 +00:00
|
|
|
if (kp->post_handler && likely(!kprobe_disabled(kp))) {
|
2005-11-07 09:00:07 +00:00
|
|
|
set_kprobe_instance(kp);
|
2005-05-05 23:15:42 +00:00
|
|
|
kp->post_handler(kp, regs, flags);
|
2005-11-07 09:00:07 +00:00
|
|
|
reset_kprobe_instance();
|
2005-05-05 23:15:42 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2014-04-17 08:18:21 +00:00
|
|
|
NOKPROBE_SYMBOL(aggr_post_handler);
|
2005-05-05 23:15:42 +00:00
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Walks the list and increments 'nmissed' if 'p' has child probes. */
|
2014-04-17 08:18:21 +00:00
|
|
|
void kprobes_inc_nmissed_count(struct kprobe *p)
|
2005-12-12 08:37:34 +00:00
|
|
|
{
|
|
|
|
struct kprobe *kp;
|
2021-09-14 14:39:34 +00:00
|
|
|
|
2010-02-25 13:34:07 +00:00
|
|
|
if (!kprobe_aggrprobe(p)) {
|
2005-12-12 08:37:34 +00:00
|
|
|
p->nmissed++;
|
|
|
|
} else {
|
|
|
|
list_for_each_entry_rcu(kp, &p->list, list)
|
|
|
|
kp->nmissed++;
|
|
|
|
}
|
|
|
|
}
|
2014-04-17 08:18:21 +00:00
|
|
|
NOKPROBE_SYMBOL(kprobes_inc_nmissed_count);
|
2005-12-12 08:37:34 +00:00
|
|
|
|
2022-03-26 02:27:05 +00:00
|
|
|
static struct kprobe kprobe_busy = {
|
|
|
|
.addr = (void *) get_kprobe,
|
|
|
|
};
|
|
|
|
|
|
|
|
void kprobe_busy_begin(void)
|
|
|
|
{
|
|
|
|
struct kprobe_ctlblk *kcb;
|
|
|
|
|
|
|
|
preempt_disable();
|
|
|
|
__this_cpu_write(current_kprobe, &kprobe_busy);
|
|
|
|
kcb = get_kprobe_ctlblk();
|
|
|
|
kcb->kprobe_status = KPROBE_HIT_ACTIVE;
|
|
|
|
}
|
|
|
|
|
|
|
|
void kprobe_busy_end(void)
|
|
|
|
{
|
|
|
|
__this_cpu_write(current_kprobe, NULL);
|
|
|
|
preempt_enable();
|
|
|
|
}
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Add the new probe to 'ap->list'. */
|
2014-04-17 08:17:54 +00:00
|
|
|
static int add_new_kprobe(struct kprobe *ap, struct kprobe *p)
|
2005-06-23 07:09:41 +00:00
|
|
|
{
|
2018-06-19 16:10:27 +00:00
|
|
|
if (p->post_handler)
|
2010-12-03 09:54:09 +00:00
|
|
|
unoptimize_kprobe(ap, true); /* Fall back to normal kprobe */
|
2010-02-25 13:34:07 +00:00
|
|
|
|
2018-06-19 16:10:27 +00:00
|
|
|
list_add_rcu(&p->list, &ap->list);
|
2009-04-07 02:00:58 +00:00
|
|
|
if (p->post_handler && !ap->post_handler)
|
|
|
|
ap->post_handler = aggr_post_handler;
|
2009-04-07 02:01:02 +00:00
|
|
|
|
2005-06-23 07:09:41 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2005-05-05 23:15:42 +00:00
|
|
|
/*
|
2021-09-14 14:39:34 +00:00
|
|
|
* Fill in the required fields of the aggregator kprobe. Replace the
|
|
|
|
* earlier kprobe in the hlist with the aggregator kprobe.
|
2005-05-05 23:15:42 +00:00
|
|
|
*/
|
2014-04-17 08:17:54 +00:00
|
|
|
static void init_aggr_kprobe(struct kprobe *ap, struct kprobe *p)
|
2005-05-05 23:15:42 +00:00
|
|
|
{
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Copy the insn slot of 'p' to 'ap'. */
|
2005-06-23 07:09:41 +00:00
|
|
|
copy_kprobe(p, ap);
|
2006-07-30 10:03:26 +00:00
|
|
|
flush_insn_slot(ap);
|
2005-05-05 23:15:42 +00:00
|
|
|
ap->addr = p->addr;
|
2010-02-25 13:34:07 +00:00
|
|
|
ap->flags = p->flags & ~KPROBE_FLAG_OPTIMIZED;
|
2005-05-05 23:15:42 +00:00
|
|
|
ap->pre_handler = aggr_pre_handler;
|
2009-01-06 22:41:52 +00:00
|
|
|
/* We don't care the kprobe which has gone. */
|
|
|
|
if (p->post_handler && !kprobe_gone(p))
|
2006-06-26 07:25:22 +00:00
|
|
|
ap->post_handler = aggr_post_handler;
|
2005-05-05 23:15:42 +00:00
|
|
|
|
|
|
|
INIT_LIST_HEAD(&ap->list);
|
2010-02-25 13:34:07 +00:00
|
|
|
INIT_HLIST_NODE(&ap->hlist);
|
2005-05-05 23:15:42 +00:00
|
|
|
|
2010-02-25 13:34:07 +00:00
|
|
|
list_add_rcu(&p->list, &ap->list);
|
2005-12-12 08:37:12 +00:00
|
|
|
hlist_replace_rcu(&p->hlist, &ap->hlist);
|
2005-05-05 23:15:42 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
2021-09-14 14:39:34 +00:00
|
|
|
* This registers the second or subsequent kprobe at the same address.
|
2005-05-05 23:15:42 +00:00
|
|
|
*/
|
2014-04-17 08:17:54 +00:00
|
|
|
static int register_aggr_kprobe(struct kprobe *orig_p, struct kprobe *p)
|
2005-05-05 23:15:42 +00:00
|
|
|
{
|
|
|
|
int ret = 0;
|
2010-12-03 09:53:50 +00:00
|
|
|
struct kprobe *ap = orig_p;
|
2005-05-05 23:15:42 +00:00
|
|
|
|
2017-05-24 08:15:36 +00:00
|
|
|
cpus_read_lock();
|
|
|
|
|
2012-06-05 10:28:26 +00:00
|
|
|
/* For preparing optimization, jump_label_text_reserved() is called */
|
|
|
|
jump_label_lock();
|
|
|
|
mutex_lock(&text_mutex);
|
|
|
|
|
2010-12-03 09:53:50 +00:00
|
|
|
if (!kprobe_aggrprobe(orig_p)) {
|
2021-09-14 14:39:34 +00:00
|
|
|
/* If 'orig_p' is not an 'aggr_kprobe', create new one. */
|
2010-12-03 09:53:50 +00:00
|
|
|
ap = alloc_aggr_kprobe(orig_p);
|
2012-06-05 10:28:26 +00:00
|
|
|
if (!ap) {
|
|
|
|
ret = -ENOMEM;
|
|
|
|
goto out;
|
|
|
|
}
|
2010-12-03 09:53:50 +00:00
|
|
|
init_aggr_kprobe(ap, orig_p);
|
2018-09-11 10:20:40 +00:00
|
|
|
} else if (kprobe_unused(ap)) {
|
2010-12-03 09:54:16 +00:00
|
|
|
/* This probe is going to die. Rescue it */
|
2018-09-11 10:20:40 +00:00
|
|
|
ret = reuse_unused_kprobe(ap);
|
|
|
|
if (ret)
|
|
|
|
goto out;
|
|
|
|
}
|
2009-04-07 02:00:58 +00:00
|
|
|
|
|
|
|
if (kprobe_gone(ap)) {
|
2009-01-06 22:41:52 +00:00
|
|
|
/*
|
|
|
|
* Attempting to insert new probe at the same location that
|
|
|
|
* had a probe in the module vaddr area which already
|
|
|
|
* freed. So, the instruction slot has already been
|
|
|
|
* released. We need a new slot for the new probe.
|
|
|
|
*/
|
2009-04-07 02:00:58 +00:00
|
|
|
ret = arch_prepare_kprobe(ap);
|
2009-01-06 22:41:52 +00:00
|
|
|
if (ret)
|
2009-04-07 02:00:58 +00:00
|
|
|
/*
|
|
|
|
* Even if fail to allocate new slot, don't need to
|
2021-09-14 14:39:34 +00:00
|
|
|
* free the 'ap'. It will be used next time, or
|
|
|
|
* freed by unregister_kprobe().
|
2009-04-07 02:00:58 +00:00
|
|
|
*/
|
2012-06-05 10:28:26 +00:00
|
|
|
goto out;
|
2009-04-07 02:01:02 +00:00
|
|
|
|
2010-02-25 13:34:07 +00:00
|
|
|
/* Prepare optimized instructions if possible. */
|
|
|
|
prepare_optimized_kprobe(ap);
|
|
|
|
|
2009-01-06 22:41:52 +00:00
|
|
|
/*
|
2009-04-07 02:01:02 +00:00
|
|
|
* Clear gone flag to prevent allocating new slot again, and
|
|
|
|
* set disabled flag because it is not armed yet.
|
2009-01-06 22:41:52 +00:00
|
|
|
*/
|
2009-04-07 02:01:02 +00:00
|
|
|
ap->flags = (ap->flags & ~KPROBE_FLAG_GONE)
|
|
|
|
| KPROBE_FLAG_DISABLED;
|
2009-01-06 22:41:52 +00:00
|
|
|
}
|
2009-04-07 02:00:58 +00:00
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Copy the insn slot of 'p' to 'ap'. */
|
2009-04-07 02:00:58 +00:00
|
|
|
copy_kprobe(ap, p);
|
2012-06-05 10:28:26 +00:00
|
|
|
ret = add_new_kprobe(ap, p);
|
|
|
|
|
|
|
|
out:
|
|
|
|
mutex_unlock(&text_mutex);
|
|
|
|
jump_label_unlock();
|
2017-05-24 08:15:36 +00:00
|
|
|
cpus_read_unlock();
|
2012-06-05 10:28:26 +00:00
|
|
|
|
|
|
|
if (ret == 0 && kprobe_disabled(ap) && !kprobe_disabled(p)) {
|
|
|
|
ap->flags &= ~KPROBE_FLAG_DISABLED;
|
2018-01-09 23:51:23 +00:00
|
|
|
if (!kprobes_all_disarmed) {
|
2012-06-05 10:28:26 +00:00
|
|
|
/* Arm the breakpoint again. */
|
2018-01-09 23:51:23 +00:00
|
|
|
ret = arm_kprobe(ap);
|
|
|
|
if (ret) {
|
|
|
|
ap->flags |= KPROBE_FLAG_DISABLED;
|
|
|
|
list_del_rcu(&p->list);
|
2018-11-07 03:04:39 +00:00
|
|
|
synchronize_rcu();
|
2018-01-09 23:51:23 +00:00
|
|
|
}
|
|
|
|
}
|
2012-06-05 10:28:26 +00:00
|
|
|
}
|
|
|
|
return ret;
|
2005-05-05 23:15:42 +00:00
|
|
|
}
|
|
|
|
|
2014-04-17 08:16:58 +00:00
|
|
|
bool __weak arch_within_kprobe_blacklist(unsigned long addr)
|
|
|
|
{
|
2021-09-14 14:39:34 +00:00
|
|
|
/* The '__kprobes' functions and entry code must not be probed. */
|
2014-04-17 08:16:58 +00:00
|
|
|
return addr >= (unsigned long)__kprobes_text_start &&
|
|
|
|
addr < (unsigned long)__kprobes_text_end;
|
|
|
|
}
|
|
|
|
|
2019-02-12 16:13:12 +00:00
|
|
|
static bool __within_kprobe_blacklist(unsigned long addr)
|
2005-09-06 22:19:26 +00:00
|
|
|
{
|
2014-04-17 08:17:05 +00:00
|
|
|
struct kprobe_blacklist_entry *ent;
|
2008-04-28 09:14:26 +00:00
|
|
|
|
2014-04-17 08:16:58 +00:00
|
|
|
if (arch_within_kprobe_blacklist(addr))
|
2014-04-17 08:17:05 +00:00
|
|
|
return true;
|
2008-04-28 09:14:26 +00:00
|
|
|
/*
|
2021-09-14 14:39:34 +00:00
|
|
|
* If 'kprobe_blacklist' is defined, check the address and
|
|
|
|
* reject any probe registration in the prohibited area.
|
2008-04-28 09:14:26 +00:00
|
|
|
*/
|
2014-04-17 08:17:05 +00:00
|
|
|
list_for_each_entry(ent, &kprobe_blacklist, list) {
|
|
|
|
if (addr >= ent->start_addr && addr < ent->end_addr)
|
|
|
|
return true;
|
2008-04-28 09:14:26 +00:00
|
|
|
}
|
2019-02-12 16:13:12 +00:00
|
|
|
return false;
|
|
|
|
}
|
2014-04-17 08:17:05 +00:00
|
|
|
|
2019-02-12 16:13:12 +00:00
|
|
|
bool within_kprobe_blacklist(unsigned long addr)
|
|
|
|
{
|
|
|
|
char symname[KSYM_NAME_LEN], *p;
|
|
|
|
|
|
|
|
if (__within_kprobe_blacklist(addr))
|
|
|
|
return true;
|
|
|
|
|
|
|
|
/* Check if the address is on a suffixed-symbol */
|
|
|
|
if (!lookup_symbol_name(addr, symname)) {
|
|
|
|
p = strchr(symname, '.');
|
|
|
|
if (!p)
|
|
|
|
return false;
|
|
|
|
*p = '\0';
|
|
|
|
addr = (unsigned long)kprobe_lookup_name(symname, 0);
|
|
|
|
if (addr)
|
|
|
|
return __within_kprobe_blacklist(addr);
|
|
|
|
}
|
2014-04-17 08:17:05 +00:00
|
|
|
return false;
|
2005-09-06 22:19:26 +00:00
|
|
|
}
|
|
|
|
|
2022-03-08 15:30:32 +00:00
|
|
|
/*
|
|
|
|
* arch_adjust_kprobe_addr - adjust the address
|
|
|
|
* @addr: symbol base address
|
|
|
|
* @offset: offset within the symbol
|
|
|
|
* @on_func_entry: was this @addr+@offset on the function entry
|
|
|
|
*
|
|
|
|
* Typically returns @addr + @offset, except for special cases where the
|
|
|
|
* function might be prefixed by a CFI landing pad, in that case any offset
|
|
|
|
* inside the landing pad is mapped to the first 'real' instruction of the
|
|
|
|
* symbol.
|
|
|
|
*
|
|
|
|
* Specifically, for things like IBT/BTI, skip the resp. ENDBR/BTI.C
|
|
|
|
* instruction at +0.
|
|
|
|
*/
|
|
|
|
kprobe_opcode_t *__weak arch_adjust_kprobe_addr(unsigned long addr,
|
|
|
|
unsigned long offset,
|
|
|
|
bool *on_func_entry)
|
|
|
|
{
|
|
|
|
*on_func_entry = !offset;
|
|
|
|
return (kprobe_opcode_t *)(addr + offset);
|
|
|
|
}
|
|
|
|
|
2008-03-04 22:29:44 +00:00
|
|
|
/*
|
2021-09-14 14:39:34 +00:00
|
|
|
* If 'symbol_name' is specified, look it up and add the 'offset'
|
2008-03-04 22:29:44 +00:00
|
|
|
* to it. This way, we can specify a relative address to a symbol.
|
2011-06-27 07:26:50 +00:00
|
|
|
* This returns encoded errors if it fails to look up symbol or invalid
|
|
|
|
* combination of parameters.
|
2008-03-04 22:29:44 +00:00
|
|
|
*/
|
2022-03-08 15:30:32 +00:00
|
|
|
static kprobe_opcode_t *
|
|
|
|
_kprobe_addr(kprobe_opcode_t *addr, const char *symbol_name,
|
|
|
|
unsigned long offset, bool *on_func_entry)
|
2008-03-04 22:29:44 +00:00
|
|
|
{
|
2017-03-08 08:26:06 +00:00
|
|
|
if ((symbol_name && addr) || (!symbol_name && !addr))
|
2011-06-27 07:26:50 +00:00
|
|
|
goto invalid;
|
|
|
|
|
2017-03-08 08:26:06 +00:00
|
|
|
if (symbol_name) {
|
2022-03-08 15:30:32 +00:00
|
|
|
/*
|
|
|
|
* Input: @sym + @offset
|
|
|
|
* Output: @addr + @offset
|
|
|
|
*
|
|
|
|
* NOTE: kprobe_lookup_name() does *NOT* fold the offset
|
|
|
|
* argument into it's output!
|
|
|
|
*/
|
powerpc updates for 4.12 part 1.
Highlights include:
- Larger virtual address space on 64-bit server CPUs. By default we use a 128TB
virtual address space, but a process can request access to the full 512TB by
passing a hint to mmap().
- Support for the new Power9 "XIVE" interrupt controller.
- TLB flushing optimisations for the radix MMU on Power9.
- Support for CAPI cards on Power9, using the "Coherent Accelerator Interface
Architecture 2.0".
- The ability to configure the mmap randomisation limits at build and runtime.
- Several small fixes and cleanups to the kprobes code, as well as support for
KPROBES_ON_FTRACE.
- Major improvements to handling of system reset interrupts, correctly treating
them as NMIs, giving them a dedicated stack and using a new hypervisor call
to trigger them, all of which should aid debugging and robustness.
Many fixes and other minor enhancements.
Thanks to:
Alastair D'Silva, Alexey Kardashevskiy, Alistair Popple, Andrew Donnellan,
Aneesh Kumar K.V, Anshuman Khandual, Anton Blanchard, Balbir Singh, Ben
Hutchings, Benjamin Herrenschmidt, Bhupesh Sharma, Chris Packham, Christian
Zigotzky, Christophe Leroy, Christophe Lombard, Daniel Axtens, David Gibson,
Gautham R. Shenoy, Gavin Shan, Geert Uytterhoeven, Guilherme G. Piccoli,
Hamish Martin, Hari Bathini, Kees Cook, Laurent Dufour, Madhavan Srinivasan,
Mahesh J Salgaonkar, Mahesh Salgaonkar, Masami Hiramatsu, Matt Brown, Matthew
R. Ochs, Michael Neuling, Naveen N. Rao, Nicholas Piggin, Oliver O'Halloran,
Pan Xinhui, Paul Mackerras, Rashmica Gupta, Russell Currey, Sukadev
Bhattiprolu, Thadeu Lima de Souza Cascardo, Tobin C. Harding, Tyrel Datwyler,
Uma Krishnan, Vaibhav Jain, Vipin K Parashar, Yang Shi.
-----BEGIN PGP SIGNATURE-----
Version: GnuPG v1
iQIcBAABAgAGBQJZDHUMAAoJEFHr6jzI4aWAT7oQALkE2Nj3gjcn1z0SkFhq/1iO
Py9Elmqm4E+L6NKYtBY5dS8xVAJ088ffzERyqJ1FY1LHkB8tn8bWRcMQmbjAFzTI
V4TAzDNI890BN/F4ptrYRwNFxRBHAvZ4NDunTzagwYnwmTzW9PYHmOi4pvWTo3Tw
KFUQ0joLSEgHzyfXxYB3fyj41u8N0FZvhfazdNSqia2Y5Vwwv/ION5jKplDM+09Y
EtVEXFvaKAS1sjbM/d/Jo5rblHfR0D9/lYV10+jjyIokjzslIpyTbnj3izeYoM5V
I4h99372zfsEjBGPPXyM3khL3zizGMSDYRmJHQSaKxjtecS9SPywPTZ8ufO/aSzV
Ngq6nlND+f1zep29VQ0cxd3Jh40skWOXzxJaFjfDT25xa6FbfsWP2NCtk8PGylZ7
EyqTuCWkMgIP02KlX3oHvEB2LRRPCDmRU2zECecRGNJrIQwYC2xjoiVi7Q8Qe8rY
gr7Ib5Jj/a+uiTcCIy37+5nXq2s14/JBOKqxuYZIxeuZFvKYuRUipbKWO05WDOAz
m/pSzeC3J8AAoYiqR0gcSOuJTOnJpGhs7zrQFqnEISbXIwLW+ICumzOmTAiBqOEY
Rt8uW2gYkPwKLrE05445RfVUoERaAjaE06eRMOWS6slnngHmmnRJbf3PcoALiJkT
ediqGEj0/N1HMB31V5tS
=vSF3
-----END PGP SIGNATURE-----
Merge tag 'powerpc-4.12-1' of git://git.kernel.org/pub/scm/linux/kernel/git/powerpc/linux
Pull powerpc updates from Michael Ellerman:
"Highlights include:
- Larger virtual address space on 64-bit server CPUs. By default we
use a 128TB virtual address space, but a process can request access
to the full 512TB by passing a hint to mmap().
- Support for the new Power9 "XIVE" interrupt controller.
- TLB flushing optimisations for the radix MMU on Power9.
- Support for CAPI cards on Power9, using the "Coherent Accelerator
Interface Architecture 2.0".
- The ability to configure the mmap randomisation limits at build and
runtime.
- Several small fixes and cleanups to the kprobes code, as well as
support for KPROBES_ON_FTRACE.
- Major improvements to handling of system reset interrupts,
correctly treating them as NMIs, giving them a dedicated stack and
using a new hypervisor call to trigger them, all of which should
aid debugging and robustness.
- Many fixes and other minor enhancements.
Thanks to: Alastair D'Silva, Alexey Kardashevskiy, Alistair Popple,
Andrew Donnellan, Aneesh Kumar K.V, Anshuman Khandual, Anton
Blanchard, Balbir Singh, Ben Hutchings, Benjamin Herrenschmidt,
Bhupesh Sharma, Chris Packham, Christian Zigotzky, Christophe Leroy,
Christophe Lombard, Daniel Axtens, David Gibson, Gautham R. Shenoy,
Gavin Shan, Geert Uytterhoeven, Guilherme G. Piccoli, Hamish Martin,
Hari Bathini, Kees Cook, Laurent Dufour, Madhavan Srinivasan, Mahesh J
Salgaonkar, Mahesh Salgaonkar, Masami Hiramatsu, Matt Brown, Matthew
R. Ochs, Michael Neuling, Naveen N. Rao, Nicholas Piggin, Oliver
O'Halloran, Pan Xinhui, Paul Mackerras, Rashmica Gupta, Russell
Currey, Sukadev Bhattiprolu, Thadeu Lima de Souza Cascardo, Tobin C.
Harding, Tyrel Datwyler, Uma Krishnan, Vaibhav Jain, Vipin K Parashar,
Yang Shi"
* tag 'powerpc-4.12-1' of git://git.kernel.org/pub/scm/linux/kernel/git/powerpc/linux: (214 commits)
powerpc/64s: Power9 has no LPCR[VRMASD] field so don't set it
powerpc/powernv: Fix TCE kill on NVLink2
powerpc/mm/radix: Drop support for CPUs without lockless tlbie
powerpc/book3s/mce: Move add_taint() later in virtual mode
powerpc/sysfs: Move #ifdef CONFIG_HOTPLUG_CPU out of the function body
powerpc/smp: Document irq enable/disable after migrating IRQs
powerpc/mpc52xx: Don't select user-visible RTAS_PROC
powerpc/powernv: Document cxl dependency on special case in pnv_eeh_reset()
powerpc/eeh: Clean up and document event handling functions
powerpc/eeh: Avoid use after free in eeh_handle_special_event()
cxl: Mask slice error interrupts after first occurrence
cxl: Route eeh events to all drivers in cxl_pci_error_detected()
cxl: Force context lock during EEH flow
powerpc/64: Allow CONFIG_RELOCATABLE if COMPILE_TEST
powerpc/xmon: Teach xmon oops about radix vectors
powerpc/mm/hash: Fix off-by-one in comment about kernel contexts ids
powerpc/pseries: Enable VFIO
powerpc/powernv: Fix iommu table size calculation hook for small tables
powerpc/powernv: Check kzalloc() return value in pnv_pci_table_alloc
powerpc: Add arch/powerpc/tools directory
...
2017-05-05 18:36:44 +00:00
|
|
|
addr = kprobe_lookup_name(symbol_name, offset);
|
2011-06-27 07:26:50 +00:00
|
|
|
if (!addr)
|
|
|
|
return ERR_PTR(-ENOENT);
|
2008-03-04 22:29:44 +00:00
|
|
|
}
|
|
|
|
|
2022-03-08 15:30:32 +00:00
|
|
|
/*
|
|
|
|
* So here we have @addr + @offset, displace it into a new
|
|
|
|
* @addr' + @offset' where @addr' is the symbol start address.
|
|
|
|
*/
|
|
|
|
addr = (void *)addr + offset;
|
|
|
|
if (!kallsyms_lookup_size_offset((unsigned long)addr, NULL, &offset))
|
|
|
|
return ERR_PTR(-ENOENT);
|
|
|
|
addr = (void *)addr - offset;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Then ask the architecture to re-combine them, taking care of
|
|
|
|
* magical function entry details while telling us if this was indeed
|
|
|
|
* at the start of the function.
|
|
|
|
*/
|
|
|
|
addr = arch_adjust_kprobe_addr((unsigned long)addr, offset, on_func_entry);
|
2011-06-27 07:26:50 +00:00
|
|
|
if (addr)
|
|
|
|
return addr;
|
|
|
|
|
|
|
|
invalid:
|
|
|
|
return ERR_PTR(-EINVAL);
|
2008-03-04 22:29:44 +00:00
|
|
|
}
|
|
|
|
|
2017-03-08 08:26:06 +00:00
|
|
|
static kprobe_opcode_t *kprobe_addr(struct kprobe *p)
|
|
|
|
{
|
2022-03-08 15:30:32 +00:00
|
|
|
bool on_func_entry;
|
|
|
|
return _kprobe_addr(p->addr, p->symbol_name, p->offset, &on_func_entry);
|
2017-03-08 08:26:06 +00:00
|
|
|
}
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/*
|
|
|
|
* Check the 'p' is valid and return the aggregator kprobe
|
|
|
|
* at the same address.
|
|
|
|
*/
|
2014-04-17 08:17:54 +00:00
|
|
|
static struct kprobe *__get_valid_kprobe(struct kprobe *p)
|
2009-09-15 05:13:07 +00:00
|
|
|
{
|
2010-12-03 09:53:50 +00:00
|
|
|
struct kprobe *ap, *list_p;
|
2009-09-15 05:13:07 +00:00
|
|
|
|
2020-05-12 08:02:44 +00:00
|
|
|
lockdep_assert_held(&kprobe_mutex);
|
|
|
|
|
2010-12-03 09:53:50 +00:00
|
|
|
ap = get_kprobe(p->addr);
|
|
|
|
if (unlikely(!ap))
|
2009-09-15 05:13:07 +00:00
|
|
|
return NULL;
|
|
|
|
|
2010-12-03 09:53:50 +00:00
|
|
|
if (p != ap) {
|
2020-05-12 08:02:44 +00:00
|
|
|
list_for_each_entry(list_p, &ap->list, list)
|
2009-09-15 05:13:07 +00:00
|
|
|
if (list_p == p)
|
|
|
|
/* kprobe p is a valid probe */
|
|
|
|
goto valid;
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
valid:
|
2010-12-03 09:53:50 +00:00
|
|
|
return ap;
|
2009-09-15 05:13:07 +00:00
|
|
|
}
|
|
|
|
|
2021-02-03 14:59:27 +00:00
|
|
|
/*
|
|
|
|
* Warn and return error if the kprobe is being re-registered since
|
|
|
|
* there must be a software bug.
|
|
|
|
*/
|
|
|
|
static inline int warn_kprobe_rereg(struct kprobe *p)
|
2009-09-15 05:13:07 +00:00
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
mutex_lock(&kprobe_mutex);
|
2021-02-03 14:59:27 +00:00
|
|
|
if (WARN_ON_ONCE(__get_valid_kprobe(p)))
|
2009-09-15 05:13:07 +00:00
|
|
|
ret = -EINVAL;
|
|
|
|
mutex_unlock(&kprobe_mutex);
|
2010-12-03 09:53:50 +00:00
|
|
|
|
2009-09-15 05:13:07 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2021-09-14 14:39:16 +00:00
|
|
|
static int check_ftrace_location(struct kprobe *p)
|
2005-04-16 22:20:36 +00:00
|
|
|
{
|
2022-03-08 15:30:29 +00:00
|
|
|
unsigned long addr = (unsigned long)p->addr;
|
2012-06-05 10:28:32 +00:00
|
|
|
|
2022-03-08 15:30:29 +00:00
|
|
|
if (ftrace_location(addr) == addr) {
|
2012-09-28 08:15:20 +00:00
|
|
|
#ifdef CONFIG_KPROBES_ON_FTRACE
|
2012-06-05 10:28:32 +00:00
|
|
|
p->flags |= KPROBE_FLAG_FTRACE;
|
2024-08-13 11:53:33 +00:00
|
|
|
#else
|
2012-06-05 10:28:32 +00:00
|
|
|
return -EINVAL;
|
|
|
|
#endif
|
|
|
|
}
|
2014-10-15 10:17:34 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2023-07-11 01:50:47 +00:00
|
|
|
static bool is_cfi_preamble_symbol(unsigned long addr)
|
|
|
|
{
|
|
|
|
char symbuf[KSYM_NAME_LEN];
|
|
|
|
|
|
|
|
if (lookup_symbol_name(addr, symbuf))
|
|
|
|
return false;
|
|
|
|
|
2024-08-02 13:53:15 +00:00
|
|
|
return str_has_prefix(symbuf, "__cfi_") ||
|
|
|
|
str_has_prefix(symbuf, "__pfx_");
|
2023-07-11 01:50:47 +00:00
|
|
|
}
|
|
|
|
|
2014-10-15 10:17:34 +00:00
|
|
|
static int check_kprobe_address_safe(struct kprobe *p,
|
|
|
|
struct module **probed_mod)
|
|
|
|
{
|
|
|
|
int ret;
|
2009-09-15 05:13:07 +00:00
|
|
|
|
2021-09-14 14:39:16 +00:00
|
|
|
ret = check_ftrace_location(p);
|
2014-10-15 10:17:34 +00:00
|
|
|
if (ret)
|
|
|
|
return ret;
|
2010-10-01 21:23:48 +00:00
|
|
|
jump_label_lock();
|
2010-10-18 14:38:58 +00:00
|
|
|
preempt_disable();
|
2012-06-05 10:28:20 +00:00
|
|
|
|
2024-04-10 01:58:02 +00:00
|
|
|
/* Ensure the address is in a text area, and find a module if exists. */
|
|
|
|
*probed_mod = NULL;
|
|
|
|
if (!core_kernel_text((unsigned long) p->addr)) {
|
|
|
|
*probed_mod = __module_text_address((unsigned long) p->addr);
|
|
|
|
if (!(*probed_mod)) {
|
|
|
|
ret = -EINVAL;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
/* Ensure it is not in reserved area. */
|
|
|
|
if (in_gate_area_no_mm((unsigned long) p->addr) ||
|
2014-04-17 08:17:05 +00:00
|
|
|
within_kprobe_blacklist((unsigned long) p->addr) ||
|
2019-09-03 11:08:21 +00:00
|
|
|
jump_label_text_reserved(p->addr, p->addr) ||
|
2021-06-28 11:24:12 +00:00
|
|
|
static_call_text_reserved(p->addr, p->addr) ||
|
2023-07-11 01:50:47 +00:00
|
|
|
find_bug((unsigned long)p->addr) ||
|
|
|
|
is_cfi_preamble_symbol((unsigned long)p->addr)) {
|
2012-03-05 22:59:12 +00:00
|
|
|
ret = -EINVAL;
|
2012-06-05 10:28:20 +00:00
|
|
|
goto out;
|
2012-03-05 22:59:12 +00:00
|
|
|
}
|
2005-12-12 08:37:00 +00:00
|
|
|
|
2024-04-10 01:58:02 +00:00
|
|
|
/* Get module refcount and reject __init functions for loaded modules. */
|
2024-05-05 16:06:27 +00:00
|
|
|
if (IS_ENABLED(CONFIG_MODULES) && *probed_mod) {
|
2007-05-08 07:34:13 +00:00
|
|
|
/*
|
2009-01-06 22:41:52 +00:00
|
|
|
* We must hold a refcount of the probed module while updating
|
|
|
|
* its code to prohibit unexpected unloading.
|
2006-01-11 20:17:41 +00:00
|
|
|
*/
|
2012-06-05 10:28:20 +00:00
|
|
|
if (unlikely(!try_module_get(*probed_mod))) {
|
|
|
|
ret = -ENOENT;
|
|
|
|
goto out;
|
|
|
|
}
|
2010-10-18 14:38:58 +00:00
|
|
|
|
2009-01-06 22:41:55 +00:00
|
|
|
/*
|
2021-09-14 14:39:34 +00:00
|
|
|
* If the module freed '.init.text', we couldn't insert
|
2009-01-06 22:41:55 +00:00
|
|
|
* kprobes in there.
|
|
|
|
*/
|
2012-06-05 10:28:20 +00:00
|
|
|
if (within_module_init((unsigned long)p->addr, *probed_mod) &&
|
2024-05-05 16:06:27 +00:00
|
|
|
!module_is_coming(*probed_mod)) {
|
2012-06-05 10:28:20 +00:00
|
|
|
module_put(*probed_mod);
|
|
|
|
*probed_mod = NULL;
|
|
|
|
ret = -ENOENT;
|
2009-01-06 22:41:55 +00:00
|
|
|
}
|
2006-01-11 20:17:41 +00:00
|
|
|
}
|
2024-05-05 16:06:27 +00:00
|
|
|
|
2012-06-05 10:28:20 +00:00
|
|
|
out:
|
2008-11-12 21:26:51 +00:00
|
|
|
preempt_enable();
|
2010-10-18 14:38:58 +00:00
|
|
|
jump_label_unlock();
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2012-06-05 10:28:20 +00:00
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
int register_kprobe(struct kprobe *p)
|
2012-06-05 10:28:20 +00:00
|
|
|
{
|
|
|
|
int ret;
|
|
|
|
struct kprobe *old_p;
|
|
|
|
struct module *probed_mod;
|
|
|
|
kprobe_opcode_t *addr;
|
2022-09-26 15:33:35 +00:00
|
|
|
bool on_func_entry;
|
2012-06-05 10:28:20 +00:00
|
|
|
|
|
|
|
/* Adjust probe address from symbol */
|
2022-09-26 15:33:35 +00:00
|
|
|
addr = _kprobe_addr(p->addr, p->symbol_name, p->offset, &on_func_entry);
|
2012-06-05 10:28:20 +00:00
|
|
|
if (IS_ERR(addr))
|
|
|
|
return PTR_ERR(addr);
|
|
|
|
p->addr = addr;
|
|
|
|
|
2021-02-03 14:59:27 +00:00
|
|
|
ret = warn_kprobe_rereg(p);
|
2012-06-05 10:28:20 +00:00
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
/* User can pass only KPROBE_FLAG_DISABLED to register_kprobe */
|
|
|
|
p->flags &= KPROBE_FLAG_DISABLED;
|
2005-11-07 09:00:13 +00:00
|
|
|
p->nmissed = 0;
|
2008-04-28 09:14:28 +00:00
|
|
|
INIT_LIST_HEAD(&p->list);
|
2010-02-25 13:34:07 +00:00
|
|
|
|
2012-06-05 10:28:20 +00:00
|
|
|
ret = check_kprobe_address_safe(p, &probed_mod);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
|
|
|
mutex_lock(&kprobe_mutex);
|
2010-02-25 13:34:07 +00:00
|
|
|
|
2022-09-26 15:33:35 +00:00
|
|
|
if (on_func_entry)
|
|
|
|
p->flags |= KPROBE_FLAG_ON_FUNC_ENTRY;
|
|
|
|
|
2005-05-05 23:15:42 +00:00
|
|
|
old_p = get_kprobe(p->addr);
|
|
|
|
if (old_p) {
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Since this may unoptimize 'old_p', locking 'text_mutex'. */
|
2005-05-05 23:15:42 +00:00
|
|
|
ret = register_aggr_kprobe(old_p, p);
|
2005-04-16 22:20:36 +00:00
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
2017-05-24 08:15:36 +00:00
|
|
|
cpus_read_lock();
|
|
|
|
/* Prevent text modification */
|
|
|
|
mutex_lock(&text_mutex);
|
2012-06-05 10:28:32 +00:00
|
|
|
ret = prepare_kprobe(p);
|
2012-06-05 10:28:26 +00:00
|
|
|
mutex_unlock(&text_mutex);
|
2017-05-24 08:15:36 +00:00
|
|
|
cpus_read_unlock();
|
2007-05-08 07:34:13 +00:00
|
|
|
if (ret)
|
2010-02-25 13:34:07 +00:00
|
|
|
goto out;
|
2006-01-10 04:52:43 +00:00
|
|
|
|
2005-05-05 23:15:42 +00:00
|
|
|
INIT_HLIST_NODE(&p->hlist);
|
2005-11-07 09:00:13 +00:00
|
|
|
hlist_add_head_rcu(&p->hlist,
|
2005-04-16 22:20:36 +00:00
|
|
|
&kprobe_table[hash_ptr(p->addr, KPROBE_HASH_BITS)]);
|
|
|
|
|
2018-01-09 23:51:23 +00:00
|
|
|
if (!kprobes_all_disarmed && !kprobe_disabled(p)) {
|
|
|
|
ret = arm_kprobe(p);
|
|
|
|
if (ret) {
|
|
|
|
hlist_del_rcu(&p->hlist);
|
2018-11-07 03:04:39 +00:00
|
|
|
synchronize_rcu();
|
2018-01-09 23:51:23 +00:00
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
}
|
2010-02-25 13:34:07 +00:00
|
|
|
|
|
|
|
/* Try to optimize kprobe */
|
|
|
|
try_to_optimize_kprobe(p);
|
2005-04-16 22:20:36 +00:00
|
|
|
out:
|
2006-03-23 11:00:35 +00:00
|
|
|
mutex_unlock(&kprobe_mutex);
|
2006-01-10 04:52:43 +00:00
|
|
|
|
2009-01-06 22:41:52 +00:00
|
|
|
if (probed_mod)
|
2006-01-11 20:17:41 +00:00
|
|
|
module_put(probed_mod);
|
2009-01-06 22:41:52 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
return ret;
|
|
|
|
}
|
2009-04-07 02:00:59 +00:00
|
|
|
EXPORT_SYMBOL_GPL(register_kprobe);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Check if all probes on the 'ap' are disabled. */
|
2021-09-14 14:40:16 +00:00
|
|
|
static bool aggr_kprobe_disabled(struct kprobe *ap)
|
2010-12-03 09:53:57 +00:00
|
|
|
{
|
|
|
|
struct kprobe *kp;
|
|
|
|
|
2020-05-12 08:02:44 +00:00
|
|
|
lockdep_assert_held(&kprobe_mutex);
|
|
|
|
|
|
|
|
list_for_each_entry(kp, &ap->list, list)
|
2010-12-03 09:53:57 +00:00
|
|
|
if (!kprobe_disabled(kp))
|
|
|
|
/*
|
2021-09-14 14:39:34 +00:00
|
|
|
* Since there is an active probe on the list,
|
|
|
|
* we can't disable this 'ap'.
|
2010-12-03 09:53:57 +00:00
|
|
|
*/
|
2021-09-14 14:40:16 +00:00
|
|
|
return false;
|
2010-12-03 09:53:57 +00:00
|
|
|
|
2021-09-14 14:40:16 +00:00
|
|
|
return true;
|
2010-12-03 09:53:57 +00:00
|
|
|
}
|
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
static struct kprobe *__disable_kprobe(struct kprobe *p)
|
2010-12-03 09:53:57 +00:00
|
|
|
{
|
|
|
|
struct kprobe *orig_p;
|
2018-01-09 23:51:24 +00:00
|
|
|
int ret;
|
2010-12-03 09:53:57 +00:00
|
|
|
|
2021-09-14 14:39:55 +00:00
|
|
|
lockdep_assert_held(&kprobe_mutex);
|
|
|
|
|
2010-12-03 09:53:57 +00:00
|
|
|
/* Get an original kprobe for return */
|
|
|
|
orig_p = __get_valid_kprobe(p);
|
|
|
|
if (unlikely(orig_p == NULL))
|
2018-01-09 23:51:24 +00:00
|
|
|
return ERR_PTR(-EINVAL);
|
2010-12-03 09:53:57 +00:00
|
|
|
|
2024-08-13 11:53:34 +00:00
|
|
|
if (kprobe_disabled(p))
|
|
|
|
return orig_p;
|
2010-12-03 09:53:57 +00:00
|
|
|
|
2024-08-13 11:53:34 +00:00
|
|
|
/* Disable probe if it is a child probe */
|
|
|
|
if (p != orig_p)
|
|
|
|
p->flags |= KPROBE_FLAG_DISABLED;
|
|
|
|
|
|
|
|
/* Try to disarm and disable this/parent probe */
|
|
|
|
if (p == orig_p || aggr_kprobe_disabled(orig_p)) {
|
|
|
|
/*
|
|
|
|
* Don't be lazy here. Even if 'kprobes_all_disarmed'
|
|
|
|
* is false, 'orig_p' might not have been armed yet.
|
|
|
|
* Note arm_all_kprobes() __tries__ to arm all kprobes
|
|
|
|
* on the best effort basis.
|
|
|
|
*/
|
|
|
|
if (!kprobes_all_disarmed && !kprobe_disabled(orig_p)) {
|
|
|
|
ret = disarm_kprobe(orig_p, true);
|
|
|
|
if (ret) {
|
|
|
|
p->flags &= ~KPROBE_FLAG_DISABLED;
|
|
|
|
return ERR_PTR(ret);
|
2018-01-09 23:51:24 +00:00
|
|
|
}
|
2010-12-03 09:53:57 +00:00
|
|
|
}
|
2024-08-13 11:53:34 +00:00
|
|
|
orig_p->flags |= KPROBE_FLAG_DISABLED;
|
2010-12-03 09:53:57 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return orig_p;
|
|
|
|
}
|
|
|
|
|
2009-04-07 02:01:02 +00:00
|
|
|
/*
|
|
|
|
* Unregister a kprobe without a scheduler synchronization.
|
|
|
|
*/
|
2014-04-17 08:17:54 +00:00
|
|
|
static int __unregister_kprobe_top(struct kprobe *p)
|
2009-04-07 02:01:02 +00:00
|
|
|
{
|
2010-12-03 09:53:50 +00:00
|
|
|
struct kprobe *ap, *list_p;
|
2009-04-07 02:01:02 +00:00
|
|
|
|
2010-12-03 09:53:57 +00:00
|
|
|
/* Disable kprobe. This will disarm it if needed. */
|
|
|
|
ap = __disable_kprobe(p);
|
2018-01-09 23:51:24 +00:00
|
|
|
if (IS_ERR(ap))
|
|
|
|
return PTR_ERR(ap);
|
2009-04-07 02:01:02 +00:00
|
|
|
|
2010-12-03 09:53:57 +00:00
|
|
|
if (ap == p)
|
2007-05-08 07:34:16 +00:00
|
|
|
/*
|
2010-12-03 09:53:57 +00:00
|
|
|
* This probe is an independent(and non-optimized) kprobe
|
|
|
|
* (not an aggrprobe). Remove from the hash list.
|
2007-05-08 07:34:16 +00:00
|
|
|
*/
|
2010-12-03 09:53:57 +00:00
|
|
|
goto disarmed;
|
|
|
|
|
|
|
|
/* Following process expects this probe is an aggrprobe */
|
|
|
|
WARN_ON(!kprobe_aggrprobe(ap));
|
|
|
|
|
2010-12-03 09:54:09 +00:00
|
|
|
if (list_is_singular(&ap->list) && kprobe_disarmed(ap))
|
|
|
|
/*
|
|
|
|
* !disarmed could be happen if the probe is under delayed
|
|
|
|
* unoptimizing.
|
|
|
|
*/
|
2010-12-03 09:53:57 +00:00
|
|
|
goto disarmed;
|
|
|
|
else {
|
|
|
|
/* If disabling probe has special handlers, update aggrprobe */
|
2009-01-06 22:41:52 +00:00
|
|
|
if (p->post_handler && !kprobe_gone(p)) {
|
2020-05-12 08:02:44 +00:00
|
|
|
list_for_each_entry(list_p, &ap->list, list) {
|
2008-04-28 09:14:28 +00:00
|
|
|
if ((list_p != p) && (list_p->post_handler))
|
|
|
|
goto noclean;
|
|
|
|
}
|
2022-11-18 01:15:34 +00:00
|
|
|
/*
|
|
|
|
* For the kprobe-on-ftrace case, we keep the
|
|
|
|
* post_handler setting to identify this aggrprobe
|
|
|
|
* armed with kprobe_ipmodify_ops.
|
|
|
|
*/
|
|
|
|
if (!kprobe_ftrace(ap))
|
|
|
|
ap->post_handler = NULL;
|
2008-04-28 09:14:28 +00:00
|
|
|
}
|
|
|
|
noclean:
|
2010-12-03 09:53:57 +00:00
|
|
|
/*
|
|
|
|
* Remove from the aggrprobe: this path will do nothing in
|
|
|
|
* __unregister_kprobe_bottom().
|
|
|
|
*/
|
2006-01-10 04:52:43 +00:00
|
|
|
list_del_rcu(&p->list);
|
2010-12-03 09:53:57 +00:00
|
|
|
if (!kprobe_disabled(ap) && !kprobes_all_disarmed)
|
|
|
|
/*
|
|
|
|
* Try to optimize this probe again, because post
|
|
|
|
* handler may have been changed.
|
|
|
|
*/
|
|
|
|
optimize_kprobe(ap);
|
2006-01-10 04:52:43 +00:00
|
|
|
}
|
2008-04-28 09:14:28 +00:00
|
|
|
return 0;
|
2010-12-03 09:53:57 +00:00
|
|
|
|
|
|
|
disarmed:
|
|
|
|
hlist_del_rcu(&ap->hlist);
|
|
|
|
return 0;
|
2008-04-28 09:14:28 +00:00
|
|
|
}
|
2005-11-07 09:00:13 +00:00
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
static void __unregister_kprobe_bottom(struct kprobe *p)
|
2008-04-28 09:14:28 +00:00
|
|
|
{
|
2010-12-03 09:53:50 +00:00
|
|
|
struct kprobe *ap;
|
2005-12-12 08:37:00 +00:00
|
|
|
|
2009-01-06 22:41:52 +00:00
|
|
|
if (list_empty(&p->list))
|
2010-12-03 09:54:09 +00:00
|
|
|
/* This is an independent kprobe */
|
2006-01-10 04:52:46 +00:00
|
|
|
arch_remove_kprobe(p);
|
2009-01-06 22:41:52 +00:00
|
|
|
else if (list_is_singular(&p->list)) {
|
2010-12-03 09:54:09 +00:00
|
|
|
/* This is the last child of an aggrprobe */
|
2010-12-03 09:53:50 +00:00
|
|
|
ap = list_entry(p->list.next, struct kprobe, list);
|
2009-01-06 22:41:52 +00:00
|
|
|
list_del(&p->list);
|
2010-12-03 09:53:50 +00:00
|
|
|
free_aggr_kprobe(ap);
|
2008-04-28 09:14:28 +00:00
|
|
|
}
|
2010-12-03 09:54:09 +00:00
|
|
|
/* Otherwise, do nothing. */
|
2008-04-28 09:14:28 +00:00
|
|
|
}
|
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
int register_kprobes(struct kprobe **kps, int num)
|
2008-04-28 09:14:28 +00:00
|
|
|
{
|
|
|
|
int i, ret = 0;
|
|
|
|
|
|
|
|
if (num <= 0)
|
|
|
|
return -EINVAL;
|
|
|
|
for (i = 0; i < num; i++) {
|
2009-01-06 22:41:53 +00:00
|
|
|
ret = register_kprobe(kps[i]);
|
2008-06-12 22:21:35 +00:00
|
|
|
if (ret < 0) {
|
|
|
|
if (i > 0)
|
|
|
|
unregister_kprobes(kps, i);
|
2008-04-28 09:14:28 +00:00
|
|
|
break;
|
2006-06-26 07:25:22 +00:00
|
|
|
}
|
2006-01-10 04:52:43 +00:00
|
|
|
}
|
2008-04-28 09:14:28 +00:00
|
|
|
return ret;
|
|
|
|
}
|
2009-04-07 02:00:59 +00:00
|
|
|
EXPORT_SYMBOL_GPL(register_kprobes);
|
2008-04-28 09:14:28 +00:00
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
void unregister_kprobe(struct kprobe *p)
|
2008-04-28 09:14:28 +00:00
|
|
|
{
|
|
|
|
unregister_kprobes(&p, 1);
|
|
|
|
}
|
2009-04-07 02:00:59 +00:00
|
|
|
EXPORT_SYMBOL_GPL(unregister_kprobe);
|
2008-04-28 09:14:28 +00:00
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
void unregister_kprobes(struct kprobe **kps, int num)
|
2008-04-28 09:14:28 +00:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (num <= 0)
|
|
|
|
return;
|
|
|
|
mutex_lock(&kprobe_mutex);
|
|
|
|
for (i = 0; i < num; i++)
|
|
|
|
if (__unregister_kprobe_top(kps[i]) < 0)
|
|
|
|
kps[i]->addr = NULL;
|
|
|
|
mutex_unlock(&kprobe_mutex);
|
|
|
|
|
2018-11-07 03:04:39 +00:00
|
|
|
synchronize_rcu();
|
2008-04-28 09:14:28 +00:00
|
|
|
for (i = 0; i < num; i++)
|
|
|
|
if (kps[i]->addr)
|
|
|
|
__unregister_kprobe_bottom(kps[i]);
|
2005-04-16 22:20:36 +00:00
|
|
|
}
|
2009-04-07 02:00:59 +00:00
|
|
|
EXPORT_SYMBOL_GPL(unregister_kprobes);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2017-03-08 17:04:15 +00:00
|
|
|
int __weak kprobe_exceptions_notify(struct notifier_block *self,
|
|
|
|
unsigned long val, void *data)
|
2017-02-07 19:54:14 +00:00
|
|
|
{
|
|
|
|
return NOTIFY_DONE;
|
|
|
|
}
|
2017-03-08 17:04:15 +00:00
|
|
|
NOKPROBE_SYMBOL(kprobe_exceptions_notify);
|
2017-02-07 19:54:14 +00:00
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
static struct notifier_block kprobe_exceptions_nb = {
|
2006-06-26 07:25:28 +00:00
|
|
|
.notifier_call = kprobe_exceptions_notify,
|
|
|
|
.priority = 0x7fffffff /* we need to be notified first */
|
|
|
|
};
|
|
|
|
|
2008-03-04 22:28:37 +00:00
|
|
|
#ifdef CONFIG_KRETPROBES
|
2020-08-29 13:00:01 +00:00
|
|
|
|
2022-03-26 02:27:05 +00:00
|
|
|
#if !defined(CONFIG_KRETPROBE_ON_RETHOOK)
|
kprobes: kretprobe scalability improvement
kretprobe is using freelist to manage return-instances, but freelist,
as LIFO queue based on singly linked list, scales badly and reduces
the overall throughput of kretprobed routines, especially for high
contention scenarios.
Here's a typical throughput test of sys_prctl (counts in 10 seconds,
measured with perf stat -a -I 10000 -e syscalls:sys_enter_prctl):
OS: Debian 10 X86_64, Linux 6.5rc7 with freelist
HW: XEON 8336C x 2, 64 cores/128 threads, DDR4 3200MT/s
1T 2T 4T 8T 16T 24T
24150045 29317964 15446741 12494489 18287272 17708768
32T 48T 64T 72T 96T 128T
16200682 13737658 11645677 11269858 10470118 9931051
This patch introduces objpool to replace freelist. objpool is a
high performance queue, which can bring near-linear scalability
to kretprobed routines. Tests of kretprobe throughput show the
biggest ratio as 159x of original freelist. Here's the result:
1T 2T 4T 8T 16T
native: 41186213 82336866 164250978 328662645 658810299
freelist: 24150045 29317964 15446741 12494489 18287272
objpool: 23926730 48010314 96125218 191782984 385091769
32T 48T 64T 96T 128T
native: 1330338351 1969957941 2512291791 2615754135 2671040914
freelist: 16200682 13737658 11645677 10470118 9931051
objpool: 764481096 1147149781 1456220214 1502109662 1579015050
Testings on 96-core ARM64 output similarly, but with the biggest
ratio up to 448x:
OS: Debian 10 AARCH64, Linux 6.5rc7
HW: Kunpeng-920 96 cores/2 sockets/4 NUMA nodes, DDR4 2933 MT/s
1T 2T 4T 8T 16T
native: . 30066096 63569843 126194076 257447289 505800181
freelist: 16152090 11064397 11124068 7215768 5663013
objpool: 13997541 28032100 55726624 110099926 221498787
24T 32T 48T 64T 96T
native: 763305277 1015925192 1521075123 2033009392 3021013752
freelist: 5015810 4602893 3766792 3382478 2945292
objpool: 328192025 439439564 668534502 887401381 1319972072
Link: https://lore.kernel.org/all/20231017135654.82270-4-wuqiang.matt@bytedance.com/
Signed-off-by: wuqiang.matt <wuqiang.matt@bytedance.com>
Acked-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
Signed-off-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
2023-10-17 13:56:52 +00:00
|
|
|
|
|
|
|
/* callbacks for objpool of kretprobe instances */
|
|
|
|
static int kretprobe_init_inst(void *nod, void *context)
|
|
|
|
{
|
|
|
|
struct kretprobe_instance *ri = nod;
|
|
|
|
|
|
|
|
ri->rph = context;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
static int kretprobe_fini_pool(struct objpool_head *head, void *context)
|
|
|
|
{
|
|
|
|
kfree(context);
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2022-05-04 03:36:31 +00:00
|
|
|
static void free_rp_inst_rcu(struct rcu_head *head)
|
|
|
|
{
|
|
|
|
struct kretprobe_instance *ri = container_of(head, struct kretprobe_instance, rcu);
|
kprobes: kretprobe scalability improvement
kretprobe is using freelist to manage return-instances, but freelist,
as LIFO queue based on singly linked list, scales badly and reduces
the overall throughput of kretprobed routines, especially for high
contention scenarios.
Here's a typical throughput test of sys_prctl (counts in 10 seconds,
measured with perf stat -a -I 10000 -e syscalls:sys_enter_prctl):
OS: Debian 10 X86_64, Linux 6.5rc7 with freelist
HW: XEON 8336C x 2, 64 cores/128 threads, DDR4 3200MT/s
1T 2T 4T 8T 16T 24T
24150045 29317964 15446741 12494489 18287272 17708768
32T 48T 64T 72T 96T 128T
16200682 13737658 11645677 11269858 10470118 9931051
This patch introduces objpool to replace freelist. objpool is a
high performance queue, which can bring near-linear scalability
to kretprobed routines. Tests of kretprobe throughput show the
biggest ratio as 159x of original freelist. Here's the result:
1T 2T 4T 8T 16T
native: 41186213 82336866 164250978 328662645 658810299
freelist: 24150045 29317964 15446741 12494489 18287272
objpool: 23926730 48010314 96125218 191782984 385091769
32T 48T 64T 96T 128T
native: 1330338351 1969957941 2512291791 2615754135 2671040914
freelist: 16200682 13737658 11645677 10470118 9931051
objpool: 764481096 1147149781 1456220214 1502109662 1579015050
Testings on 96-core ARM64 output similarly, but with the biggest
ratio up to 448x:
OS: Debian 10 AARCH64, Linux 6.5rc7
HW: Kunpeng-920 96 cores/2 sockets/4 NUMA nodes, DDR4 2933 MT/s
1T 2T 4T 8T 16T
native: . 30066096 63569843 126194076 257447289 505800181
freelist: 16152090 11064397 11124068 7215768 5663013
objpool: 13997541 28032100 55726624 110099926 221498787
24T 32T 48T 64T 96T
native: 763305277 1015925192 1521075123 2033009392 3021013752
freelist: 5015810 4602893 3766792 3382478 2945292
objpool: 328192025 439439564 668534502 887401381 1319972072
Link: https://lore.kernel.org/all/20231017135654.82270-4-wuqiang.matt@bytedance.com/
Signed-off-by: wuqiang.matt <wuqiang.matt@bytedance.com>
Acked-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
Signed-off-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
2023-10-17 13:56:52 +00:00
|
|
|
struct kretprobe_holder *rph = ri->rph;
|
2022-05-04 03:36:31 +00:00
|
|
|
|
kprobes: kretprobe scalability improvement
kretprobe is using freelist to manage return-instances, but freelist,
as LIFO queue based on singly linked list, scales badly and reduces
the overall throughput of kretprobed routines, especially for high
contention scenarios.
Here's a typical throughput test of sys_prctl (counts in 10 seconds,
measured with perf stat -a -I 10000 -e syscalls:sys_enter_prctl):
OS: Debian 10 X86_64, Linux 6.5rc7 with freelist
HW: XEON 8336C x 2, 64 cores/128 threads, DDR4 3200MT/s
1T 2T 4T 8T 16T 24T
24150045 29317964 15446741 12494489 18287272 17708768
32T 48T 64T 72T 96T 128T
16200682 13737658 11645677 11269858 10470118 9931051
This patch introduces objpool to replace freelist. objpool is a
high performance queue, which can bring near-linear scalability
to kretprobed routines. Tests of kretprobe throughput show the
biggest ratio as 159x of original freelist. Here's the result:
1T 2T 4T 8T 16T
native: 41186213 82336866 164250978 328662645 658810299
freelist: 24150045 29317964 15446741 12494489 18287272
objpool: 23926730 48010314 96125218 191782984 385091769
32T 48T 64T 96T 128T
native: 1330338351 1969957941 2512291791 2615754135 2671040914
freelist: 16200682 13737658 11645677 10470118 9931051
objpool: 764481096 1147149781 1456220214 1502109662 1579015050
Testings on 96-core ARM64 output similarly, but with the biggest
ratio up to 448x:
OS: Debian 10 AARCH64, Linux 6.5rc7
HW: Kunpeng-920 96 cores/2 sockets/4 NUMA nodes, DDR4 2933 MT/s
1T 2T 4T 8T 16T
native: . 30066096 63569843 126194076 257447289 505800181
freelist: 16152090 11064397 11124068 7215768 5663013
objpool: 13997541 28032100 55726624 110099926 221498787
24T 32T 48T 64T 96T
native: 763305277 1015925192 1521075123 2033009392 3021013752
freelist: 5015810 4602893 3766792 3382478 2945292
objpool: 328192025 439439564 668534502 887401381 1319972072
Link: https://lore.kernel.org/all/20231017135654.82270-4-wuqiang.matt@bytedance.com/
Signed-off-by: wuqiang.matt <wuqiang.matt@bytedance.com>
Acked-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
Signed-off-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
2023-10-17 13:56:52 +00:00
|
|
|
objpool_drop(ri, &rph->pool);
|
2022-05-04 03:36:31 +00:00
|
|
|
}
|
|
|
|
NOKPROBE_SYMBOL(free_rp_inst_rcu);
|
|
|
|
|
|
|
|
static void recycle_rp_inst(struct kretprobe_instance *ri)
|
|
|
|
{
|
|
|
|
struct kretprobe *rp = get_kretprobe(ri);
|
|
|
|
|
|
|
|
if (likely(rp))
|
kprobes: kretprobe scalability improvement
kretprobe is using freelist to manage return-instances, but freelist,
as LIFO queue based on singly linked list, scales badly and reduces
the overall throughput of kretprobed routines, especially for high
contention scenarios.
Here's a typical throughput test of sys_prctl (counts in 10 seconds,
measured with perf stat -a -I 10000 -e syscalls:sys_enter_prctl):
OS: Debian 10 X86_64, Linux 6.5rc7 with freelist
HW: XEON 8336C x 2, 64 cores/128 threads, DDR4 3200MT/s
1T 2T 4T 8T 16T 24T
24150045 29317964 15446741 12494489 18287272 17708768
32T 48T 64T 72T 96T 128T
16200682 13737658 11645677 11269858 10470118 9931051
This patch introduces objpool to replace freelist. objpool is a
high performance queue, which can bring near-linear scalability
to kretprobed routines. Tests of kretprobe throughput show the
biggest ratio as 159x of original freelist. Here's the result:
1T 2T 4T 8T 16T
native: 41186213 82336866 164250978 328662645 658810299
freelist: 24150045 29317964 15446741 12494489 18287272
objpool: 23926730 48010314 96125218 191782984 385091769
32T 48T 64T 96T 128T
native: 1330338351 1969957941 2512291791 2615754135 2671040914
freelist: 16200682 13737658 11645677 10470118 9931051
objpool: 764481096 1147149781 1456220214 1502109662 1579015050
Testings on 96-core ARM64 output similarly, but with the biggest
ratio up to 448x:
OS: Debian 10 AARCH64, Linux 6.5rc7
HW: Kunpeng-920 96 cores/2 sockets/4 NUMA nodes, DDR4 2933 MT/s
1T 2T 4T 8T 16T
native: . 30066096 63569843 126194076 257447289 505800181
freelist: 16152090 11064397 11124068 7215768 5663013
objpool: 13997541 28032100 55726624 110099926 221498787
24T 32T 48T 64T 96T
native: 763305277 1015925192 1521075123 2033009392 3021013752
freelist: 5015810 4602893 3766792 3382478 2945292
objpool: 328192025 439439564 668534502 887401381 1319972072
Link: https://lore.kernel.org/all/20231017135654.82270-4-wuqiang.matt@bytedance.com/
Signed-off-by: wuqiang.matt <wuqiang.matt@bytedance.com>
Acked-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
Signed-off-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
2023-10-17 13:56:52 +00:00
|
|
|
objpool_push(ri, &rp->rph->pool);
|
2022-05-04 03:36:31 +00:00
|
|
|
else
|
|
|
|
call_rcu(&ri->rcu, free_rp_inst_rcu);
|
|
|
|
}
|
|
|
|
NOKPROBE_SYMBOL(recycle_rp_inst);
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This function is called from delayed_put_task_struct() when a task is
|
|
|
|
* dead and cleaned up to recycle any kretprobe instances associated with
|
|
|
|
* this task. These left over instances represent probed functions that
|
|
|
|
* have been called but will never return.
|
|
|
|
*/
|
|
|
|
void kprobe_flush_task(struct task_struct *tk)
|
|
|
|
{
|
|
|
|
struct kretprobe_instance *ri;
|
|
|
|
struct llist_node *node;
|
|
|
|
|
|
|
|
/* Early boot, not yet initialized. */
|
|
|
|
if (unlikely(!kprobes_initialized))
|
|
|
|
return;
|
|
|
|
|
|
|
|
kprobe_busy_begin();
|
|
|
|
|
|
|
|
node = __llist_del_all(&tk->kretprobe_instances);
|
|
|
|
while (node) {
|
|
|
|
ri = container_of(node, struct kretprobe_instance, llist);
|
|
|
|
node = node->next;
|
|
|
|
|
|
|
|
recycle_rp_inst(ri);
|
|
|
|
}
|
|
|
|
|
|
|
|
kprobe_busy_end();
|
|
|
|
}
|
|
|
|
NOKPROBE_SYMBOL(kprobe_flush_task);
|
|
|
|
|
|
|
|
static inline void free_rp_inst(struct kretprobe *rp)
|
|
|
|
{
|
kprobes: kretprobe scalability improvement
kretprobe is using freelist to manage return-instances, but freelist,
as LIFO queue based on singly linked list, scales badly and reduces
the overall throughput of kretprobed routines, especially for high
contention scenarios.
Here's a typical throughput test of sys_prctl (counts in 10 seconds,
measured with perf stat -a -I 10000 -e syscalls:sys_enter_prctl):
OS: Debian 10 X86_64, Linux 6.5rc7 with freelist
HW: XEON 8336C x 2, 64 cores/128 threads, DDR4 3200MT/s
1T 2T 4T 8T 16T 24T
24150045 29317964 15446741 12494489 18287272 17708768
32T 48T 64T 72T 96T 128T
16200682 13737658 11645677 11269858 10470118 9931051
This patch introduces objpool to replace freelist. objpool is a
high performance queue, which can bring near-linear scalability
to kretprobed routines. Tests of kretprobe throughput show the
biggest ratio as 159x of original freelist. Here's the result:
1T 2T 4T 8T 16T
native: 41186213 82336866 164250978 328662645 658810299
freelist: 24150045 29317964 15446741 12494489 18287272
objpool: 23926730 48010314 96125218 191782984 385091769
32T 48T 64T 96T 128T
native: 1330338351 1969957941 2512291791 2615754135 2671040914
freelist: 16200682 13737658 11645677 10470118 9931051
objpool: 764481096 1147149781 1456220214 1502109662 1579015050
Testings on 96-core ARM64 output similarly, but with the biggest
ratio up to 448x:
OS: Debian 10 AARCH64, Linux 6.5rc7
HW: Kunpeng-920 96 cores/2 sockets/4 NUMA nodes, DDR4 2933 MT/s
1T 2T 4T 8T 16T
native: . 30066096 63569843 126194076 257447289 505800181
freelist: 16152090 11064397 11124068 7215768 5663013
objpool: 13997541 28032100 55726624 110099926 221498787
24T 32T 48T 64T 96T
native: 763305277 1015925192 1521075123 2033009392 3021013752
freelist: 5015810 4602893 3766792 3382478 2945292
objpool: 328192025 439439564 668534502 887401381 1319972072
Link: https://lore.kernel.org/all/20231017135654.82270-4-wuqiang.matt@bytedance.com/
Signed-off-by: wuqiang.matt <wuqiang.matt@bytedance.com>
Acked-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
Signed-off-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
2023-10-17 13:56:52 +00:00
|
|
|
struct kretprobe_holder *rph = rp->rph;
|
2022-05-04 03:36:31 +00:00
|
|
|
|
kprobes: kretprobe scalability improvement
kretprobe is using freelist to manage return-instances, but freelist,
as LIFO queue based on singly linked list, scales badly and reduces
the overall throughput of kretprobed routines, especially for high
contention scenarios.
Here's a typical throughput test of sys_prctl (counts in 10 seconds,
measured with perf stat -a -I 10000 -e syscalls:sys_enter_prctl):
OS: Debian 10 X86_64, Linux 6.5rc7 with freelist
HW: XEON 8336C x 2, 64 cores/128 threads, DDR4 3200MT/s
1T 2T 4T 8T 16T 24T
24150045 29317964 15446741 12494489 18287272 17708768
32T 48T 64T 72T 96T 128T
16200682 13737658 11645677 11269858 10470118 9931051
This patch introduces objpool to replace freelist. objpool is a
high performance queue, which can bring near-linear scalability
to kretprobed routines. Tests of kretprobe throughput show the
biggest ratio as 159x of original freelist. Here's the result:
1T 2T 4T 8T 16T
native: 41186213 82336866 164250978 328662645 658810299
freelist: 24150045 29317964 15446741 12494489 18287272
objpool: 23926730 48010314 96125218 191782984 385091769
32T 48T 64T 96T 128T
native: 1330338351 1969957941 2512291791 2615754135 2671040914
freelist: 16200682 13737658 11645677 10470118 9931051
objpool: 764481096 1147149781 1456220214 1502109662 1579015050
Testings on 96-core ARM64 output similarly, but with the biggest
ratio up to 448x:
OS: Debian 10 AARCH64, Linux 6.5rc7
HW: Kunpeng-920 96 cores/2 sockets/4 NUMA nodes, DDR4 2933 MT/s
1T 2T 4T 8T 16T
native: . 30066096 63569843 126194076 257447289 505800181
freelist: 16152090 11064397 11124068 7215768 5663013
objpool: 13997541 28032100 55726624 110099926 221498787
24T 32T 48T 64T 96T
native: 763305277 1015925192 1521075123 2033009392 3021013752
freelist: 5015810 4602893 3766792 3382478 2945292
objpool: 328192025 439439564 668534502 887401381 1319972072
Link: https://lore.kernel.org/all/20231017135654.82270-4-wuqiang.matt@bytedance.com/
Signed-off-by: wuqiang.matt <wuqiang.matt@bytedance.com>
Acked-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
Signed-off-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
2023-10-17 13:56:52 +00:00
|
|
|
if (!rph)
|
|
|
|
return;
|
|
|
|
rp->rph = NULL;
|
|
|
|
objpool_fini(&rph->pool);
|
2022-05-04 03:36:31 +00:00
|
|
|
}
|
|
|
|
|
2021-09-14 14:41:04 +00:00
|
|
|
/* This assumes the 'tsk' is the current task or the is not running. */
|
|
|
|
static kprobe_opcode_t *__kretprobe_find_ret_addr(struct task_struct *tsk,
|
|
|
|
struct llist_node **cur)
|
2007-07-19 08:48:11 +00:00
|
|
|
{
|
2020-08-29 13:03:24 +00:00
|
|
|
struct kretprobe_instance *ri = NULL;
|
2021-09-14 14:41:04 +00:00
|
|
|
struct llist_node *node = *cur;
|
|
|
|
|
|
|
|
if (!node)
|
|
|
|
node = tsk->kretprobe_instances.first;
|
|
|
|
else
|
|
|
|
node = node->next;
|
2020-08-29 13:00:01 +00:00
|
|
|
|
2020-08-29 13:03:24 +00:00
|
|
|
while (node) {
|
|
|
|
ri = container_of(node, struct kretprobe_instance, llist);
|
2021-09-14 14:40:45 +00:00
|
|
|
if (ri->ret_addr != kretprobe_trampoline_addr()) {
|
2021-09-14 14:41:04 +00:00
|
|
|
*cur = node;
|
|
|
|
return ri->ret_addr;
|
2020-08-29 13:03:24 +00:00
|
|
|
}
|
|
|
|
node = node->next;
|
2020-08-29 13:00:01 +00:00
|
|
|
}
|
2021-09-14 14:41:04 +00:00
|
|
|
return NULL;
|
2007-07-19 08:48:11 +00:00
|
|
|
}
|
2021-09-14 14:41:04 +00:00
|
|
|
NOKPROBE_SYMBOL(__kretprobe_find_ret_addr);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2021-09-14 14:41:04 +00:00
|
|
|
/**
|
|
|
|
* kretprobe_find_ret_addr -- Find correct return address modified by kretprobe
|
|
|
|
* @tsk: Target task
|
|
|
|
* @fp: A frame pointer
|
|
|
|
* @cur: a storage of the loop cursor llist_node pointer for next call
|
|
|
|
*
|
|
|
|
* Find the correct return address modified by a kretprobe on @tsk in unsigned
|
|
|
|
* long type. If it finds the return address, this returns that address value,
|
|
|
|
* or this returns 0.
|
|
|
|
* The @tsk must be 'current' or a task which is not running. @fp is a hint
|
|
|
|
* to get the currect return address - which is compared with the
|
|
|
|
* kretprobe_instance::fp field. The @cur is a loop cursor for searching the
|
|
|
|
* kretprobe return addresses on the @tsk. The '*@cur' should be NULL at the
|
|
|
|
* first call, but '@cur' itself must NOT NULL.
|
|
|
|
*/
|
|
|
|
unsigned long kretprobe_find_ret_addr(struct task_struct *tsk, void *fp,
|
|
|
|
struct llist_node **cur)
|
|
|
|
{
|
2023-09-19 01:28:23 +00:00
|
|
|
struct kretprobe_instance *ri;
|
2021-09-14 14:41:04 +00:00
|
|
|
kprobe_opcode_t *ret;
|
|
|
|
|
|
|
|
if (WARN_ON_ONCE(!cur))
|
|
|
|
return 0;
|
2020-08-29 13:00:01 +00:00
|
|
|
|
2021-09-14 14:41:04 +00:00
|
|
|
do {
|
|
|
|
ret = __kretprobe_find_ret_addr(tsk, cur);
|
|
|
|
if (!ret)
|
|
|
|
break;
|
|
|
|
ri = container_of(*cur, struct kretprobe_instance, llist);
|
|
|
|
} while (ri->fp != fp);
|
|
|
|
|
|
|
|
return (unsigned long)ret;
|
|
|
|
}
|
|
|
|
NOKPROBE_SYMBOL(kretprobe_find_ret_addr);
|
|
|
|
|
2021-09-14 14:42:51 +00:00
|
|
|
void __weak arch_kretprobe_fixup_return(struct pt_regs *regs,
|
|
|
|
kprobe_opcode_t *correct_ret_addr)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Do nothing by default. Please fill this to update the fake return
|
|
|
|
* address on the stack with the correct one on each arch if possible.
|
|
|
|
*/
|
|
|
|
}
|
2020-08-29 13:00:01 +00:00
|
|
|
|
|
|
|
unsigned long __kretprobe_trampoline_handler(struct pt_regs *regs,
|
|
|
|
void *frame_pointer)
|
|
|
|
{
|
2020-08-29 13:03:24 +00:00
|
|
|
struct kretprobe_instance *ri = NULL;
|
2021-09-14 14:41:04 +00:00
|
|
|
struct llist_node *first, *node = NULL;
|
2023-07-04 19:43:59 +00:00
|
|
|
kprobe_opcode_t *correct_ret_addr;
|
2020-08-29 13:03:24 +00:00
|
|
|
struct kretprobe *rp;
|
2020-08-29 13:00:01 +00:00
|
|
|
|
2021-09-14 14:41:04 +00:00
|
|
|
/* Find correct address and all nodes for this frame. */
|
|
|
|
correct_ret_addr = __kretprobe_find_ret_addr(current, &node);
|
|
|
|
if (!correct_ret_addr) {
|
|
|
|
pr_err("kretprobe: Return address not found, not execute handler. Maybe there is a bug in the kernel.\n");
|
|
|
|
BUG_ON(1);
|
2020-08-29 13:00:01 +00:00
|
|
|
}
|
|
|
|
|
2021-09-14 14:42:12 +00:00
|
|
|
/*
|
|
|
|
* Set the return address as the instruction pointer, because if the
|
|
|
|
* user handler calls stack_trace_save_regs() with this 'regs',
|
|
|
|
* the stack trace will start from the instruction pointer.
|
|
|
|
*/
|
|
|
|
instruction_pointer_set(regs, (unsigned long)correct_ret_addr);
|
2020-08-29 13:00:01 +00:00
|
|
|
|
2021-09-14 14:41:04 +00:00
|
|
|
/* Run the user handler of the nodes. */
|
|
|
|
first = current->kretprobe_instances.first;
|
2020-08-29 13:03:24 +00:00
|
|
|
while (first) {
|
|
|
|
ri = container_of(first, struct kretprobe_instance, llist);
|
2021-09-14 14:41:04 +00:00
|
|
|
|
|
|
|
if (WARN_ON_ONCE(ri->fp != frame_pointer))
|
|
|
|
break;
|
2020-08-29 13:00:01 +00:00
|
|
|
|
2020-08-29 13:03:24 +00:00
|
|
|
rp = get_kretprobe(ri);
|
|
|
|
if (rp && rp->handler) {
|
2020-08-29 13:00:01 +00:00
|
|
|
struct kprobe *prev = kprobe_running();
|
|
|
|
|
2020-08-29 13:03:24 +00:00
|
|
|
__this_cpu_write(current_kprobe, &rp->kp);
|
2020-08-29 13:00:01 +00:00
|
|
|
ri->ret_addr = correct_ret_addr;
|
2020-08-29 13:03:24 +00:00
|
|
|
rp->handler(ri, regs);
|
2020-08-29 13:00:01 +00:00
|
|
|
__this_cpu_write(current_kprobe, prev);
|
|
|
|
}
|
2021-09-14 14:41:04 +00:00
|
|
|
if (first == node)
|
|
|
|
break;
|
|
|
|
|
|
|
|
first = first->next;
|
|
|
|
}
|
|
|
|
|
2021-09-14 14:42:51 +00:00
|
|
|
arch_kretprobe_fixup_return(regs, correct_ret_addr);
|
|
|
|
|
2021-09-14 14:41:04 +00:00
|
|
|
/* Unlink all nodes for this frame. */
|
|
|
|
first = current->kretprobe_instances.first;
|
|
|
|
current->kretprobe_instances.first = node->next;
|
|
|
|
node->next = NULL;
|
|
|
|
|
|
|
|
/* Recycle free instances. */
|
|
|
|
while (first) {
|
|
|
|
ri = container_of(first, struct kretprobe_instance, llist);
|
|
|
|
first = first->next;
|
2020-08-29 13:00:01 +00:00
|
|
|
|
2020-08-29 13:02:47 +00:00
|
|
|
recycle_rp_inst(ri);
|
2020-08-29 13:00:01 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
return (unsigned long)correct_ret_addr;
|
|
|
|
}
|
|
|
|
NOKPROBE_SYMBOL(__kretprobe_trampoline_handler)
|
|
|
|
|
2006-02-03 11:03:42 +00:00
|
|
|
/*
|
|
|
|
* This kprobe pre_handler is registered with every kretprobe. When probe
|
|
|
|
* hits it will set up the return probe.
|
|
|
|
*/
|
2014-04-17 08:18:21 +00:00
|
|
|
static int pre_handler_kretprobe(struct kprobe *p, struct pt_regs *regs)
|
2006-02-03 11:03:42 +00:00
|
|
|
{
|
|
|
|
struct kretprobe *rp = container_of(p, struct kretprobe, kp);
|
kprobes: kretprobe scalability improvement
kretprobe is using freelist to manage return-instances, but freelist,
as LIFO queue based on singly linked list, scales badly and reduces
the overall throughput of kretprobed routines, especially for high
contention scenarios.
Here's a typical throughput test of sys_prctl (counts in 10 seconds,
measured with perf stat -a -I 10000 -e syscalls:sys_enter_prctl):
OS: Debian 10 X86_64, Linux 6.5rc7 with freelist
HW: XEON 8336C x 2, 64 cores/128 threads, DDR4 3200MT/s
1T 2T 4T 8T 16T 24T
24150045 29317964 15446741 12494489 18287272 17708768
32T 48T 64T 72T 96T 128T
16200682 13737658 11645677 11269858 10470118 9931051
This patch introduces objpool to replace freelist. objpool is a
high performance queue, which can bring near-linear scalability
to kretprobed routines. Tests of kretprobe throughput show the
biggest ratio as 159x of original freelist. Here's the result:
1T 2T 4T 8T 16T
native: 41186213 82336866 164250978 328662645 658810299
freelist: 24150045 29317964 15446741 12494489 18287272
objpool: 23926730 48010314 96125218 191782984 385091769
32T 48T 64T 96T 128T
native: 1330338351 1969957941 2512291791 2615754135 2671040914
freelist: 16200682 13737658 11645677 10470118 9931051
objpool: 764481096 1147149781 1456220214 1502109662 1579015050
Testings on 96-core ARM64 output similarly, but with the biggest
ratio up to 448x:
OS: Debian 10 AARCH64, Linux 6.5rc7
HW: Kunpeng-920 96 cores/2 sockets/4 NUMA nodes, DDR4 2933 MT/s
1T 2T 4T 8T 16T
native: . 30066096 63569843 126194076 257447289 505800181
freelist: 16152090 11064397 11124068 7215768 5663013
objpool: 13997541 28032100 55726624 110099926 221498787
24T 32T 48T 64T 96T
native: 763305277 1015925192 1521075123 2033009392 3021013752
freelist: 5015810 4602893 3766792 3382478 2945292
objpool: 328192025 439439564 668534502 887401381 1319972072
Link: https://lore.kernel.org/all/20231017135654.82270-4-wuqiang.matt@bytedance.com/
Signed-off-by: wuqiang.matt <wuqiang.matt@bytedance.com>
Acked-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
Signed-off-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
2023-10-17 13:56:52 +00:00
|
|
|
struct kretprobe_holder *rph = rp->rph;
|
2008-07-25 08:46:04 +00:00
|
|
|
struct kretprobe_instance *ri;
|
2006-02-03 11:03:42 +00:00
|
|
|
|
kprobes: kretprobe scalability improvement
kretprobe is using freelist to manage return-instances, but freelist,
as LIFO queue based on singly linked list, scales badly and reduces
the overall throughput of kretprobed routines, especially for high
contention scenarios.
Here's a typical throughput test of sys_prctl (counts in 10 seconds,
measured with perf stat -a -I 10000 -e syscalls:sys_enter_prctl):
OS: Debian 10 X86_64, Linux 6.5rc7 with freelist
HW: XEON 8336C x 2, 64 cores/128 threads, DDR4 3200MT/s
1T 2T 4T 8T 16T 24T
24150045 29317964 15446741 12494489 18287272 17708768
32T 48T 64T 72T 96T 128T
16200682 13737658 11645677 11269858 10470118 9931051
This patch introduces objpool to replace freelist. objpool is a
high performance queue, which can bring near-linear scalability
to kretprobed routines. Tests of kretprobe throughput show the
biggest ratio as 159x of original freelist. Here's the result:
1T 2T 4T 8T 16T
native: 41186213 82336866 164250978 328662645 658810299
freelist: 24150045 29317964 15446741 12494489 18287272
objpool: 23926730 48010314 96125218 191782984 385091769
32T 48T 64T 96T 128T
native: 1330338351 1969957941 2512291791 2615754135 2671040914
freelist: 16200682 13737658 11645677 10470118 9931051
objpool: 764481096 1147149781 1456220214 1502109662 1579015050
Testings on 96-core ARM64 output similarly, but with the biggest
ratio up to 448x:
OS: Debian 10 AARCH64, Linux 6.5rc7
HW: Kunpeng-920 96 cores/2 sockets/4 NUMA nodes, DDR4 2933 MT/s
1T 2T 4T 8T 16T
native: . 30066096 63569843 126194076 257447289 505800181
freelist: 16152090 11064397 11124068 7215768 5663013
objpool: 13997541 28032100 55726624 110099926 221498787
24T 32T 48T 64T 96T
native: 763305277 1015925192 1521075123 2033009392 3021013752
freelist: 5015810 4602893 3766792 3382478 2945292
objpool: 328192025 439439564 668534502 887401381 1319972072
Link: https://lore.kernel.org/all/20231017135654.82270-4-wuqiang.matt@bytedance.com/
Signed-off-by: wuqiang.matt <wuqiang.matt@bytedance.com>
Acked-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
Signed-off-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
2023-10-17 13:56:52 +00:00
|
|
|
ri = objpool_pop(&rph->pool);
|
|
|
|
if (!ri) {
|
2020-08-29 13:03:56 +00:00
|
|
|
rp->nmissed++;
|
|
|
|
return 0;
|
|
|
|
}
|
2007-05-08 07:34:14 +00:00
|
|
|
|
2020-08-29 13:03:56 +00:00
|
|
|
if (rp->entry_handler && rp->entry_handler(ri, regs)) {
|
kprobes: kretprobe scalability improvement
kretprobe is using freelist to manage return-instances, but freelist,
as LIFO queue based on singly linked list, scales badly and reduces
the overall throughput of kretprobed routines, especially for high
contention scenarios.
Here's a typical throughput test of sys_prctl (counts in 10 seconds,
measured with perf stat -a -I 10000 -e syscalls:sys_enter_prctl):
OS: Debian 10 X86_64, Linux 6.5rc7 with freelist
HW: XEON 8336C x 2, 64 cores/128 threads, DDR4 3200MT/s
1T 2T 4T 8T 16T 24T
24150045 29317964 15446741 12494489 18287272 17708768
32T 48T 64T 72T 96T 128T
16200682 13737658 11645677 11269858 10470118 9931051
This patch introduces objpool to replace freelist. objpool is a
high performance queue, which can bring near-linear scalability
to kretprobed routines. Tests of kretprobe throughput show the
biggest ratio as 159x of original freelist. Here's the result:
1T 2T 4T 8T 16T
native: 41186213 82336866 164250978 328662645 658810299
freelist: 24150045 29317964 15446741 12494489 18287272
objpool: 23926730 48010314 96125218 191782984 385091769
32T 48T 64T 96T 128T
native: 1330338351 1969957941 2512291791 2615754135 2671040914
freelist: 16200682 13737658 11645677 10470118 9931051
objpool: 764481096 1147149781 1456220214 1502109662 1579015050
Testings on 96-core ARM64 output similarly, but with the biggest
ratio up to 448x:
OS: Debian 10 AARCH64, Linux 6.5rc7
HW: Kunpeng-920 96 cores/2 sockets/4 NUMA nodes, DDR4 2933 MT/s
1T 2T 4T 8T 16T
native: . 30066096 63569843 126194076 257447289 505800181
freelist: 16152090 11064397 11124068 7215768 5663013
objpool: 13997541 28032100 55726624 110099926 221498787
24T 32T 48T 64T 96T
native: 763305277 1015925192 1521075123 2033009392 3021013752
freelist: 5015810 4602893 3766792 3382478 2945292
objpool: 328192025 439439564 668534502 887401381 1319972072
Link: https://lore.kernel.org/all/20231017135654.82270-4-wuqiang.matt@bytedance.com/
Signed-off-by: wuqiang.matt <wuqiang.matt@bytedance.com>
Acked-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
Signed-off-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
2023-10-17 13:56:52 +00:00
|
|
|
objpool_push(ri, &rph->pool);
|
2020-08-29 13:03:56 +00:00
|
|
|
return 0;
|
2008-07-25 08:46:04 +00:00
|
|
|
}
|
2020-08-29 13:03:56 +00:00
|
|
|
|
|
|
|
arch_prepare_kretprobe(ri, regs);
|
|
|
|
|
|
|
|
__llist_add(&ri->llist, ¤t->kretprobe_instances);
|
|
|
|
|
2006-02-03 11:03:42 +00:00
|
|
|
return 0;
|
|
|
|
}
|
2014-04-17 08:18:21 +00:00
|
|
|
NOKPROBE_SYMBOL(pre_handler_kretprobe);
|
2022-03-26 02:27:05 +00:00
|
|
|
#else /* CONFIG_KRETPROBE_ON_RETHOOK */
|
|
|
|
/*
|
|
|
|
* This kprobe pre_handler is registered with every kretprobe. When probe
|
|
|
|
* hits it will set up the return probe.
|
|
|
|
*/
|
|
|
|
static int pre_handler_kretprobe(struct kprobe *p, struct pt_regs *regs)
|
|
|
|
{
|
|
|
|
struct kretprobe *rp = container_of(p, struct kretprobe, kp);
|
|
|
|
struct kretprobe_instance *ri;
|
|
|
|
struct rethook_node *rhn;
|
|
|
|
|
|
|
|
rhn = rethook_try_get(rp->rh);
|
|
|
|
if (!rhn) {
|
|
|
|
rp->nmissed++;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
ri = container_of(rhn, struct kretprobe_instance, node);
|
|
|
|
|
|
|
|
if (rp->entry_handler && rp->entry_handler(ri, regs))
|
|
|
|
rethook_recycle(rhn);
|
|
|
|
else
|
|
|
|
rethook_hook(rhn, regs, kprobe_ftrace(p));
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
NOKPROBE_SYMBOL(pre_handler_kretprobe);
|
|
|
|
|
|
|
|
static void kretprobe_rethook_handler(struct rethook_node *rh, void *data,
|
2023-06-06 12:39:55 +00:00
|
|
|
unsigned long ret_addr,
|
2022-03-26 02:27:05 +00:00
|
|
|
struct pt_regs *regs)
|
|
|
|
{
|
|
|
|
struct kretprobe *rp = (struct kretprobe *)data;
|
|
|
|
struct kretprobe_instance *ri;
|
|
|
|
struct kprobe_ctlblk *kcb;
|
|
|
|
|
|
|
|
/* The data must NOT be null. This means rethook data structure is broken. */
|
2022-04-22 16:40:27 +00:00
|
|
|
if (WARN_ON_ONCE(!data) || !rp->handler)
|
2022-03-26 02:27:05 +00:00
|
|
|
return;
|
|
|
|
|
|
|
|
__this_cpu_write(current_kprobe, &rp->kp);
|
|
|
|
kcb = get_kprobe_ctlblk();
|
|
|
|
kcb->kprobe_status = KPROBE_HIT_ACTIVE;
|
|
|
|
|
|
|
|
ri = container_of(rh, struct kretprobe_instance, node);
|
|
|
|
rp->handler(ri, regs);
|
|
|
|
|
|
|
|
__this_cpu_write(current_kprobe, NULL);
|
|
|
|
}
|
|
|
|
NOKPROBE_SYMBOL(kretprobe_rethook_handler);
|
|
|
|
|
|
|
|
#endif /* !CONFIG_KRETPROBE_ON_RETHOOK */
|
2006-02-03 11:03:42 +00:00
|
|
|
|
2021-01-27 15:37:51 +00:00
|
|
|
/**
|
|
|
|
* kprobe_on_func_entry() -- check whether given address is function entry
|
|
|
|
* @addr: Target address
|
|
|
|
* @sym: Target symbol name
|
|
|
|
* @offset: The offset from the symbol or the address
|
|
|
|
*
|
|
|
|
* This checks whether the given @addr+@offset or @sym+@offset is on the
|
|
|
|
* function entry address or not.
|
|
|
|
* This returns 0 if it is the function entry, or -EINVAL if it is not.
|
|
|
|
* And also it returns -ENOENT if it fails the symbol or address lookup.
|
|
|
|
* Caller must pass @addr or @sym (either one must be NULL), or this
|
|
|
|
* returns -EINVAL.
|
|
|
|
*/
|
|
|
|
int kprobe_on_func_entry(kprobe_opcode_t *addr, const char *sym, unsigned long offset)
|
2017-03-08 08:26:06 +00:00
|
|
|
{
|
2022-03-08 15:30:32 +00:00
|
|
|
bool on_func_entry;
|
|
|
|
kprobe_opcode_t *kp_addr = _kprobe_addr(addr, sym, offset, &on_func_entry);
|
2017-03-08 08:26:06 +00:00
|
|
|
|
|
|
|
if (IS_ERR(kp_addr))
|
2021-01-27 15:37:51 +00:00
|
|
|
return PTR_ERR(kp_addr);
|
2017-03-08 08:26:06 +00:00
|
|
|
|
2022-03-08 15:30:32 +00:00
|
|
|
if (!on_func_entry)
|
2021-01-27 15:37:51 +00:00
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
return 0;
|
2017-03-08 08:26:06 +00:00
|
|
|
}
|
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
int register_kretprobe(struct kretprobe *rp)
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
{
|
2021-01-27 15:37:51 +00:00
|
|
|
int ret;
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
int i;
|
2008-03-04 22:29:44 +00:00
|
|
|
void *addr;
|
2017-02-22 13:53:37 +00:00
|
|
|
|
2021-01-27 15:37:51 +00:00
|
|
|
ret = kprobe_on_func_entry(rp->kp.addr, rp->kp.symbol_name, rp->kp.offset);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
2007-10-16 08:27:49 +00:00
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* If only 'rp->kp.addr' is specified, check reregistering kprobes */
|
2021-02-03 14:59:27 +00:00
|
|
|
if (rp->kp.addr && warn_kprobe_rereg(&rp->kp))
|
2021-01-28 12:44:27 +00:00
|
|
|
return -EINVAL;
|
|
|
|
|
2007-10-16 08:27:49 +00:00
|
|
|
if (kretprobe_blacklist_size) {
|
2008-03-04 22:29:44 +00:00
|
|
|
addr = kprobe_addr(&rp->kp);
|
2011-06-27 07:26:50 +00:00
|
|
|
if (IS_ERR(addr))
|
|
|
|
return PTR_ERR(addr);
|
2007-10-16 08:27:49 +00:00
|
|
|
|
|
|
|
for (i = 0; kretprobe_blacklist[i].name != NULL; i++) {
|
|
|
|
if (kretprobe_blacklist[i].addr == addr)
|
|
|
|
return -EINVAL;
|
|
|
|
}
|
|
|
|
}
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
|
2021-12-01 14:45:50 +00:00
|
|
|
if (rp->data_size > KRETPROBE_MAX_DATA_SIZE)
|
|
|
|
return -E2BIG;
|
|
|
|
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
rp->kp.pre_handler = pre_handler_kretprobe;
|
2006-04-20 09:43:11 +00:00
|
|
|
rp->kp.post_handler = NULL;
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
|
|
|
|
/* Pre-allocate memory for max kretprobe instances */
|
2022-11-10 08:15:02 +00:00
|
|
|
if (rp->maxactive <= 0)
|
2009-12-21 12:02:24 +00:00
|
|
|
rp->maxactive = max_t(unsigned int, 10, 2*num_possible_cpus());
|
2022-11-10 08:15:02 +00:00
|
|
|
|
2022-03-26 02:27:05 +00:00
|
|
|
#ifdef CONFIG_KRETPROBE_ON_RETHOOK
|
kprobes: kretprobe scalability improvement
kretprobe is using freelist to manage return-instances, but freelist,
as LIFO queue based on singly linked list, scales badly and reduces
the overall throughput of kretprobed routines, especially for high
contention scenarios.
Here's a typical throughput test of sys_prctl (counts in 10 seconds,
measured with perf stat -a -I 10000 -e syscalls:sys_enter_prctl):
OS: Debian 10 X86_64, Linux 6.5rc7 with freelist
HW: XEON 8336C x 2, 64 cores/128 threads, DDR4 3200MT/s
1T 2T 4T 8T 16T 24T
24150045 29317964 15446741 12494489 18287272 17708768
32T 48T 64T 72T 96T 128T
16200682 13737658 11645677 11269858 10470118 9931051
This patch introduces objpool to replace freelist. objpool is a
high performance queue, which can bring near-linear scalability
to kretprobed routines. Tests of kretprobe throughput show the
biggest ratio as 159x of original freelist. Here's the result:
1T 2T 4T 8T 16T
native: 41186213 82336866 164250978 328662645 658810299
freelist: 24150045 29317964 15446741 12494489 18287272
objpool: 23926730 48010314 96125218 191782984 385091769
32T 48T 64T 96T 128T
native: 1330338351 1969957941 2512291791 2615754135 2671040914
freelist: 16200682 13737658 11645677 10470118 9931051
objpool: 764481096 1147149781 1456220214 1502109662 1579015050
Testings on 96-core ARM64 output similarly, but with the biggest
ratio up to 448x:
OS: Debian 10 AARCH64, Linux 6.5rc7
HW: Kunpeng-920 96 cores/2 sockets/4 NUMA nodes, DDR4 2933 MT/s
1T 2T 4T 8T 16T
native: . 30066096 63569843 126194076 257447289 505800181
freelist: 16152090 11064397 11124068 7215768 5663013
objpool: 13997541 28032100 55726624 110099926 221498787
24T 32T 48T 64T 96T
native: 763305277 1015925192 1521075123 2033009392 3021013752
freelist: 5015810 4602893 3766792 3382478 2945292
objpool: 328192025 439439564 668534502 887401381 1319972072
Link: https://lore.kernel.org/all/20231017135654.82270-4-wuqiang.matt@bytedance.com/
Signed-off-by: wuqiang.matt <wuqiang.matt@bytedance.com>
Acked-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
Signed-off-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
2023-10-17 13:56:52 +00:00
|
|
|
rp->rh = rethook_alloc((void *)rp, kretprobe_rethook_handler,
|
|
|
|
sizeof(struct kretprobe_instance) +
|
|
|
|
rp->data_size, rp->maxactive);
|
|
|
|
if (IS_ERR(rp->rh))
|
|
|
|
return PTR_ERR(rp->rh);
|
2022-03-26 02:27:05 +00:00
|
|
|
|
|
|
|
rp->nmissed = 0;
|
|
|
|
/* Establish function entry probe point */
|
|
|
|
ret = register_kprobe(&rp->kp);
|
|
|
|
if (ret != 0) {
|
|
|
|
rethook_free(rp->rh);
|
|
|
|
rp->rh = NULL;
|
|
|
|
}
|
|
|
|
#else /* !CONFIG_KRETPROBE_ON_RETHOOK */
|
2020-08-29 13:03:24 +00:00
|
|
|
rp->rph = kzalloc(sizeof(struct kretprobe_holder), GFP_KERNEL);
|
|
|
|
if (!rp->rph)
|
|
|
|
return -ENOMEM;
|
|
|
|
|
kprobes: kretprobe scalability improvement
kretprobe is using freelist to manage return-instances, but freelist,
as LIFO queue based on singly linked list, scales badly and reduces
the overall throughput of kretprobed routines, especially for high
contention scenarios.
Here's a typical throughput test of sys_prctl (counts in 10 seconds,
measured with perf stat -a -I 10000 -e syscalls:sys_enter_prctl):
OS: Debian 10 X86_64, Linux 6.5rc7 with freelist
HW: XEON 8336C x 2, 64 cores/128 threads, DDR4 3200MT/s
1T 2T 4T 8T 16T 24T
24150045 29317964 15446741 12494489 18287272 17708768
32T 48T 64T 72T 96T 128T
16200682 13737658 11645677 11269858 10470118 9931051
This patch introduces objpool to replace freelist. objpool is a
high performance queue, which can bring near-linear scalability
to kretprobed routines. Tests of kretprobe throughput show the
biggest ratio as 159x of original freelist. Here's the result:
1T 2T 4T 8T 16T
native: 41186213 82336866 164250978 328662645 658810299
freelist: 24150045 29317964 15446741 12494489 18287272
objpool: 23926730 48010314 96125218 191782984 385091769
32T 48T 64T 96T 128T
native: 1330338351 1969957941 2512291791 2615754135 2671040914
freelist: 16200682 13737658 11645677 10470118 9931051
objpool: 764481096 1147149781 1456220214 1502109662 1579015050
Testings on 96-core ARM64 output similarly, but with the biggest
ratio up to 448x:
OS: Debian 10 AARCH64, Linux 6.5rc7
HW: Kunpeng-920 96 cores/2 sockets/4 NUMA nodes, DDR4 2933 MT/s
1T 2T 4T 8T 16T
native: . 30066096 63569843 126194076 257447289 505800181
freelist: 16152090 11064397 11124068 7215768 5663013
objpool: 13997541 28032100 55726624 110099926 221498787
24T 32T 48T 64T 96T
native: 763305277 1015925192 1521075123 2033009392 3021013752
freelist: 5015810 4602893 3766792 3382478 2945292
objpool: 328192025 439439564 668534502 887401381 1319972072
Link: https://lore.kernel.org/all/20231017135654.82270-4-wuqiang.matt@bytedance.com/
Signed-off-by: wuqiang.matt <wuqiang.matt@bytedance.com>
Acked-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
Signed-off-by: Masami Hiramatsu (Google) <mhiramat@kernel.org>
2023-10-17 13:56:52 +00:00
|
|
|
if (objpool_init(&rp->rph->pool, rp->maxactive, rp->data_size +
|
|
|
|
sizeof(struct kretprobe_instance), GFP_KERNEL,
|
|
|
|
rp->rph, kretprobe_init_inst, kretprobe_fini_pool)) {
|
|
|
|
kfree(rp->rph);
|
|
|
|
rp->rph = NULL;
|
|
|
|
return -ENOMEM;
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
}
|
2023-12-01 05:53:55 +00:00
|
|
|
rcu_assign_pointer(rp->rph->rp, rp);
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
rp->nmissed = 0;
|
|
|
|
/* Establish function entry probe point */
|
2009-01-06 22:41:53 +00:00
|
|
|
ret = register_kprobe(&rp->kp);
|
2008-04-28 09:14:29 +00:00
|
|
|
if (ret != 0)
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
free_rp_inst(rp);
|
2022-03-26 02:27:05 +00:00
|
|
|
#endif
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
return ret;
|
|
|
|
}
|
2009-04-07 02:00:59 +00:00
|
|
|
EXPORT_SYMBOL_GPL(register_kretprobe);
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
int register_kretprobes(struct kretprobe **rps, int num)
|
2008-04-28 09:14:29 +00:00
|
|
|
{
|
|
|
|
int ret = 0, i;
|
|
|
|
|
|
|
|
if (num <= 0)
|
|
|
|
return -EINVAL;
|
|
|
|
for (i = 0; i < num; i++) {
|
2009-01-06 22:41:53 +00:00
|
|
|
ret = register_kretprobe(rps[i]);
|
2008-06-12 22:21:35 +00:00
|
|
|
if (ret < 0) {
|
|
|
|
if (i > 0)
|
|
|
|
unregister_kretprobes(rps, i);
|
2008-04-28 09:14:29 +00:00
|
|
|
break;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return ret;
|
|
|
|
}
|
2009-04-07 02:00:59 +00:00
|
|
|
EXPORT_SYMBOL_GPL(register_kretprobes);
|
2008-04-28 09:14:29 +00:00
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
void unregister_kretprobe(struct kretprobe *rp)
|
2008-04-28 09:14:29 +00:00
|
|
|
{
|
|
|
|
unregister_kretprobes(&rp, 1);
|
|
|
|
}
|
2009-04-07 02:00:59 +00:00
|
|
|
EXPORT_SYMBOL_GPL(unregister_kretprobe);
|
2008-04-28 09:14:29 +00:00
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
void unregister_kretprobes(struct kretprobe **rps, int num)
|
2008-04-28 09:14:29 +00:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
if (num <= 0)
|
|
|
|
return;
|
|
|
|
mutex_lock(&kprobe_mutex);
|
2020-08-29 13:03:24 +00:00
|
|
|
for (i = 0; i < num; i++) {
|
2008-04-28 09:14:29 +00:00
|
|
|
if (__unregister_kprobe_top(&rps[i]->kp) < 0)
|
|
|
|
rps[i]->kp.addr = NULL;
|
2022-03-26 02:27:05 +00:00
|
|
|
#ifdef CONFIG_KRETPROBE_ON_RETHOOK
|
|
|
|
rethook_free(rps[i]->rh);
|
|
|
|
#else
|
2023-12-01 05:53:55 +00:00
|
|
|
rcu_assign_pointer(rps[i]->rph->rp, NULL);
|
2022-03-26 02:27:05 +00:00
|
|
|
#endif
|
2020-08-29 13:03:24 +00:00
|
|
|
}
|
2008-04-28 09:14:29 +00:00
|
|
|
mutex_unlock(&kprobe_mutex);
|
|
|
|
|
2018-11-07 03:04:39 +00:00
|
|
|
synchronize_rcu();
|
2008-04-28 09:14:29 +00:00
|
|
|
for (i = 0; i < num; i++) {
|
|
|
|
if (rps[i]->kp.addr) {
|
|
|
|
__unregister_kprobe_bottom(&rps[i]->kp);
|
2022-03-26 02:27:05 +00:00
|
|
|
#ifndef CONFIG_KRETPROBE_ON_RETHOOK
|
2020-08-29 13:03:24 +00:00
|
|
|
free_rp_inst(rps[i]);
|
2022-03-26 02:27:05 +00:00
|
|
|
#endif
|
2008-04-28 09:14:29 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2009-04-07 02:00:59 +00:00
|
|
|
EXPORT_SYMBOL_GPL(unregister_kretprobes);
|
2008-04-28 09:14:29 +00:00
|
|
|
|
2008-03-04 22:28:37 +00:00
|
|
|
#else /* CONFIG_KRETPROBES */
|
2014-04-17 08:17:54 +00:00
|
|
|
int register_kretprobe(struct kretprobe *rp)
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
{
|
2021-09-14 14:39:34 +00:00
|
|
|
return -EOPNOTSUPP;
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
}
|
2009-04-07 02:00:59 +00:00
|
|
|
EXPORT_SYMBOL_GPL(register_kretprobe);
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
int register_kretprobes(struct kretprobe **rps, int num)
|
2007-02-20 21:57:54 +00:00
|
|
|
{
|
2021-09-14 14:39:34 +00:00
|
|
|
return -EOPNOTSUPP;
|
2007-02-20 21:57:54 +00:00
|
|
|
}
|
2009-04-07 02:00:59 +00:00
|
|
|
EXPORT_SYMBOL_GPL(register_kretprobes);
|
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
void unregister_kretprobe(struct kretprobe *rp)
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
{
|
2008-04-28 09:14:29 +00:00
|
|
|
}
|
2009-04-07 02:00:59 +00:00
|
|
|
EXPORT_SYMBOL_GPL(unregister_kretprobe);
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
void unregister_kretprobes(struct kretprobe **rps, int num)
|
2008-04-28 09:14:29 +00:00
|
|
|
{
|
|
|
|
}
|
2009-04-07 02:00:59 +00:00
|
|
|
EXPORT_SYMBOL_GPL(unregister_kretprobes);
|
2007-05-08 07:34:14 +00:00
|
|
|
|
2014-04-17 08:18:21 +00:00
|
|
|
static int pre_handler_kretprobe(struct kprobe *p, struct pt_regs *regs)
|
2008-04-28 09:14:29 +00:00
|
|
|
{
|
|
|
|
return 0;
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
}
|
2014-04-17 08:18:21 +00:00
|
|
|
NOKPROBE_SYMBOL(pre_handler_kretprobe);
|
[PATCH] kprobes: function-return probes
This patch adds function-return probes to kprobes for the i386
architecture. This enables you to establish a handler to be run when a
function returns.
1. API
Two new functions are added to kprobes:
int register_kretprobe(struct kretprobe *rp);
void unregister_kretprobe(struct kretprobe *rp);
2. Registration and unregistration
2.1 Register
To register a function-return probe, the user populates the following
fields in a kretprobe object and calls register_kretprobe() with the
kretprobe address as an argument:
kp.addr - the function's address
handler - this function is run after the ret instruction executes, but
before control returns to the return address in the caller.
maxactive - The maximum number of instances of the probed function that
can be active concurrently. For example, if the function is non-
recursive and is called with a spinlock or mutex held, maxactive = 1
should be enough. If the function is non-recursive and can never
relinquish the CPU (e.g., via a semaphore or preemption), NR_CPUS should
be enough. maxactive is used to determine how many kretprobe_instance
objects to allocate for this particular probed function. If maxactive <=
0, it is set to a default value (if CONFIG_PREEMPT maxactive=max(10, 2 *
NR_CPUS) else maxactive=NR_CPUS)
For example:
struct kretprobe rp;
rp.kp.addr = /* entrypoint address */
rp.handler = /*return probe handler */
rp.maxactive = /* e.g., 1 or NR_CPUS or 0, see the above explanation */
register_kretprobe(&rp);
The following field may also be of interest:
nmissed - Initialized to zero when the function-return probe is
registered, and incremented every time the probed function is entered but
there is no kretprobe_instance object available for establishing the
function-return probe (i.e., because maxactive was set too low).
2.2 Unregister
To unregiter a function-return probe, the user calls
unregister_kretprobe() with the same kretprobe object as registered
previously. If a probed function is running when the return probe is
unregistered, the function will return as expected, but the handler won't
be run.
3. Limitations
3.1 This patch supports only the i386 architecture, but patches for
x86_64 and ppc64 are anticipated soon.
3.2 Return probes operates by replacing the return address in the stack
(or in a known register, such as the lr register for ppc). This may
cause __builtin_return_address(0), when invoked from the return-probed
function, to return the address of the return-probes trampoline.
3.3 This implementation uses the "Multiprobes at an address" feature in
2.6.12-rc3-mm3.
3.4 Due to a limitation in multi-probes, you cannot currently establish
a return probe and a jprobe on the same function. A patch to remove
this limitation is being tested.
This feature is required by SystemTap (http://sourceware.org/systemtap),
and reflects ideas contributed by several SystemTap developers, including
Will Cohen and Ananth Mavinakayanahalli.
Signed-off-by: Hien Nguyen <hien@us.ibm.com>
Signed-off-by: Prasanna S Panchamukhi <prasanna@in.ibm.com>
Signed-off-by: Frederik Deweerdt <frederik.deweerdt@laposte.net>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-23 07:09:19 +00:00
|
|
|
|
2008-04-28 09:14:29 +00:00
|
|
|
#endif /* CONFIG_KRETPROBES */
|
|
|
|
|
2009-01-06 22:41:52 +00:00
|
|
|
/* Set the kprobe gone and remove its instruction buffer. */
|
2014-04-17 08:17:54 +00:00
|
|
|
static void kill_kprobe(struct kprobe *p)
|
2009-01-06 22:41:52 +00:00
|
|
|
{
|
|
|
|
struct kprobe *kp;
|
2009-04-07 02:01:02 +00:00
|
|
|
|
2020-05-12 08:02:44 +00:00
|
|
|
lockdep_assert_held(&kprobe_mutex);
|
|
|
|
|
2022-11-26 11:43:16 +00:00
|
|
|
/*
|
|
|
|
* The module is going away. We should disarm the kprobe which
|
|
|
|
* is using ftrace, because ftrace framework is still available at
|
|
|
|
* 'MODULE_STATE_GOING' notification.
|
|
|
|
*/
|
|
|
|
if (kprobe_ftrace(p) && !kprobe_disabled(p) && !kprobes_all_disarmed)
|
|
|
|
disarm_kprobe_ftrace(p);
|
|
|
|
|
2009-01-06 22:41:52 +00:00
|
|
|
p->flags |= KPROBE_FLAG_GONE;
|
2010-02-25 13:34:07 +00:00
|
|
|
if (kprobe_aggrprobe(p)) {
|
2009-01-06 22:41:52 +00:00
|
|
|
/*
|
|
|
|
* If this is an aggr_kprobe, we have to list all the
|
|
|
|
* chained probes and mark them GONE.
|
|
|
|
*/
|
2020-05-12 08:02:44 +00:00
|
|
|
list_for_each_entry(kp, &p->list, list)
|
2009-01-06 22:41:52 +00:00
|
|
|
kp->flags |= KPROBE_FLAG_GONE;
|
|
|
|
p->post_handler = NULL;
|
2010-02-25 13:34:07 +00:00
|
|
|
kill_optimized_kprobe(p);
|
2009-01-06 22:41:52 +00:00
|
|
|
}
|
|
|
|
/*
|
|
|
|
* Here, we can remove insn_slot safely, because no thread calls
|
|
|
|
* the original probed function (which will be freed soon) any more.
|
|
|
|
*/
|
|
|
|
arch_remove_kprobe(p);
|
|
|
|
}
|
|
|
|
|
2010-04-27 22:33:12 +00:00
|
|
|
/* Disable one kprobe */
|
2014-04-17 08:17:54 +00:00
|
|
|
int disable_kprobe(struct kprobe *kp)
|
2010-04-27 22:33:12 +00:00
|
|
|
{
|
|
|
|
int ret = 0;
|
2018-01-09 23:51:24 +00:00
|
|
|
struct kprobe *p;
|
2010-04-27 22:33:12 +00:00
|
|
|
|
|
|
|
mutex_lock(&kprobe_mutex);
|
|
|
|
|
2010-12-03 09:53:57 +00:00
|
|
|
/* Disable this kprobe */
|
2018-01-09 23:51:24 +00:00
|
|
|
p = __disable_kprobe(kp);
|
|
|
|
if (IS_ERR(p))
|
|
|
|
ret = PTR_ERR(p);
|
2010-04-27 22:33:12 +00:00
|
|
|
|
|
|
|
mutex_unlock(&kprobe_mutex);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(disable_kprobe);
|
|
|
|
|
|
|
|
/* Enable one kprobe */
|
2014-04-17 08:17:54 +00:00
|
|
|
int enable_kprobe(struct kprobe *kp)
|
2010-04-27 22:33:12 +00:00
|
|
|
{
|
|
|
|
int ret = 0;
|
|
|
|
struct kprobe *p;
|
|
|
|
|
|
|
|
mutex_lock(&kprobe_mutex);
|
|
|
|
|
|
|
|
/* Check whether specified probe is valid. */
|
|
|
|
p = __get_valid_kprobe(kp);
|
|
|
|
if (unlikely(p == NULL)) {
|
|
|
|
ret = -EINVAL;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (kprobe_gone(kp)) {
|
|
|
|
/* This kprobe has gone, we couldn't enable it. */
|
|
|
|
ret = -EINVAL;
|
|
|
|
goto out;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (p != kp)
|
|
|
|
kp->flags &= ~KPROBE_FLAG_DISABLED;
|
|
|
|
|
|
|
|
if (!kprobes_all_disarmed && kprobe_disabled(p)) {
|
|
|
|
p->flags &= ~KPROBE_FLAG_DISABLED;
|
2018-01-09 23:51:23 +00:00
|
|
|
ret = arm_kprobe(p);
|
2022-11-03 23:49:31 +00:00
|
|
|
if (ret) {
|
2018-01-09 23:51:23 +00:00
|
|
|
p->flags |= KPROBE_FLAG_DISABLED;
|
2022-11-03 23:49:31 +00:00
|
|
|
if (p != kp)
|
|
|
|
kp->flags |= KPROBE_FLAG_DISABLED;
|
|
|
|
}
|
2010-04-27 22:33:12 +00:00
|
|
|
}
|
|
|
|
out:
|
|
|
|
mutex_unlock(&kprobe_mutex);
|
|
|
|
return ret;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(enable_kprobe);
|
|
|
|
|
2018-04-28 12:36:33 +00:00
|
|
|
/* Caller must NOT call this in usual path. This is only for critical case */
|
2014-04-17 08:18:21 +00:00
|
|
|
void dump_kprobe(struct kprobe *kp)
|
2009-08-26 21:38:30 +00:00
|
|
|
{
|
2021-09-14 14:39:25 +00:00
|
|
|
pr_err("Dump kprobe:\n.symbol_name = %s, .offset = %x, .addr = %pS\n",
|
2018-04-28 12:36:33 +00:00
|
|
|
kp->symbol_name, kp->offset, kp->addr);
|
2009-08-26 21:38:30 +00:00
|
|
|
}
|
2014-04-17 08:18:21 +00:00
|
|
|
NOKPROBE_SYMBOL(dump_kprobe);
|
2009-08-26 21:38:30 +00:00
|
|
|
|
2018-12-17 08:20:55 +00:00
|
|
|
int kprobe_add_ksym_blacklist(unsigned long entry)
|
|
|
|
{
|
|
|
|
struct kprobe_blacklist_entry *ent;
|
|
|
|
unsigned long offset = 0, size = 0;
|
|
|
|
|
|
|
|
if (!kernel_text_address(entry) ||
|
|
|
|
!kallsyms_lookup_size_offset(entry, &size, &offset))
|
|
|
|
return -EINVAL;
|
|
|
|
|
|
|
|
ent = kmalloc(sizeof(*ent), GFP_KERNEL);
|
|
|
|
if (!ent)
|
|
|
|
return -ENOMEM;
|
|
|
|
ent->start_addr = entry;
|
|
|
|
ent->end_addr = entry + size;
|
|
|
|
INIT_LIST_HEAD(&ent->list);
|
|
|
|
list_add_tail(&ent->list, &kprobe_blacklist);
|
|
|
|
|
|
|
|
return (int)size;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Add all symbols in given area into kprobe blacklist */
|
|
|
|
int kprobe_add_area_blacklist(unsigned long start, unsigned long end)
|
|
|
|
{
|
|
|
|
unsigned long entry;
|
|
|
|
int ret = 0;
|
|
|
|
|
|
|
|
for (entry = start; entry < end; entry += ret) {
|
|
|
|
ret = kprobe_add_ksym_blacklist(entry);
|
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
|
|
|
if (ret == 0) /* In case of alias symbol */
|
|
|
|
ret = 1;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2020-05-28 08:00:58 +00:00
|
|
|
int __weak arch_kprobe_get_kallsym(unsigned int *symnum, unsigned long *value,
|
|
|
|
char *type, char *sym)
|
|
|
|
{
|
|
|
|
return -ERANGE;
|
|
|
|
}
|
|
|
|
|
|
|
|
int kprobe_get_kallsym(unsigned int symnum, unsigned long *value, char *type,
|
|
|
|
char *sym)
|
|
|
|
{
|
|
|
|
#ifdef __ARCH_WANT_KPROBES_INSN_SLOT
|
|
|
|
if (!kprobe_cache_get_kallsym(&kprobe_insn_slots, &symnum, value, type, sym))
|
|
|
|
return 0;
|
|
|
|
#ifdef CONFIG_OPTPROBES
|
|
|
|
if (!kprobe_cache_get_kallsym(&kprobe_optinsn_slots, &symnum, value, type, sym))
|
|
|
|
return 0;
|
|
|
|
#endif
|
|
|
|
#endif
|
|
|
|
if (!arch_kprobe_get_kallsym(&symnum, value, type, sym))
|
|
|
|
return 0;
|
|
|
|
return -ERANGE;
|
|
|
|
}
|
|
|
|
|
2018-12-17 08:20:55 +00:00
|
|
|
int __init __weak arch_populate_kprobe_blacklist(void)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2014-04-17 08:17:05 +00:00
|
|
|
/*
|
|
|
|
* Lookup and populate the kprobe_blacklist.
|
|
|
|
*
|
|
|
|
* Unlike the kretprobe blacklist, we'll need to determine
|
|
|
|
* the range of addresses that belong to the said functions,
|
|
|
|
* since a kprobe need not necessarily be at the beginning
|
|
|
|
* of a function.
|
|
|
|
*/
|
|
|
|
static int __init populate_kprobe_blacklist(unsigned long *start,
|
|
|
|
unsigned long *end)
|
|
|
|
{
|
2018-12-17 08:20:55 +00:00
|
|
|
unsigned long entry;
|
2014-04-17 08:17:05 +00:00
|
|
|
unsigned long *iter;
|
2018-12-17 08:20:55 +00:00
|
|
|
int ret;
|
2014-04-17 08:17:05 +00:00
|
|
|
|
|
|
|
for (iter = start; iter < end; iter++) {
|
2021-09-14 14:40:36 +00:00
|
|
|
entry = (unsigned long)dereference_symbol_descriptor((void *)*iter);
|
2018-12-17 08:20:55 +00:00
|
|
|
ret = kprobe_add_ksym_blacklist(entry);
|
|
|
|
if (ret == -EINVAL)
|
2014-04-17 08:17:05 +00:00
|
|
|
continue;
|
2018-12-17 08:20:55 +00:00
|
|
|
if (ret < 0)
|
|
|
|
return ret;
|
2014-04-17 08:17:05 +00:00
|
|
|
}
|
2018-12-17 08:20:55 +00:00
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Symbols in '__kprobes_text' are blacklisted */
|
2018-12-17 08:20:55 +00:00
|
|
|
ret = kprobe_add_area_blacklist((unsigned long)__kprobes_text_start,
|
|
|
|
(unsigned long)__kprobes_text_end);
|
2020-03-10 13:04:34 +00:00
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Symbols in 'noinstr' section are blacklisted */
|
2020-03-10 13:04:34 +00:00
|
|
|
ret = kprobe_add_area_blacklist((unsigned long)__noinstr_text_start,
|
|
|
|
(unsigned long)__noinstr_text_end);
|
2018-12-17 08:20:55 +00:00
|
|
|
|
|
|
|
return ret ? : arch_populate_kprobe_blacklist();
|
2014-04-17 08:17:05 +00:00
|
|
|
}
|
|
|
|
|
2024-05-05 16:06:27 +00:00
|
|
|
#ifdef CONFIG_MODULES
|
|
|
|
/* Remove all symbols in given area from kprobe blacklist */
|
|
|
|
static void kprobe_remove_area_blacklist(unsigned long start, unsigned long end)
|
|
|
|
{
|
|
|
|
struct kprobe_blacklist_entry *ent, *n;
|
|
|
|
|
|
|
|
list_for_each_entry_safe(ent, n, &kprobe_blacklist, list) {
|
|
|
|
if (ent->start_addr < start || ent->start_addr >= end)
|
|
|
|
continue;
|
|
|
|
list_del(&ent->list);
|
|
|
|
kfree(ent);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
static void kprobe_remove_ksym_blacklist(unsigned long entry)
|
|
|
|
{
|
|
|
|
kprobe_remove_area_blacklist(entry, entry + 1);
|
|
|
|
}
|
|
|
|
|
2020-03-26 14:49:48 +00:00
|
|
|
static void add_module_kprobe_blacklist(struct module *mod)
|
|
|
|
{
|
|
|
|
unsigned long start, end;
|
2020-03-26 14:50:00 +00:00
|
|
|
int i;
|
|
|
|
|
|
|
|
if (mod->kprobe_blacklist) {
|
|
|
|
for (i = 0; i < mod->num_kprobe_blacklist; i++)
|
|
|
|
kprobe_add_ksym_blacklist(mod->kprobe_blacklist[i]);
|
|
|
|
}
|
2020-03-26 14:49:48 +00:00
|
|
|
|
|
|
|
start = (unsigned long)mod->kprobes_text_start;
|
|
|
|
if (start) {
|
|
|
|
end = start + mod->kprobes_text_size;
|
|
|
|
kprobe_add_area_blacklist(start, end);
|
|
|
|
}
|
2020-03-10 13:04:34 +00:00
|
|
|
|
|
|
|
start = (unsigned long)mod->noinstr_text_start;
|
|
|
|
if (start) {
|
|
|
|
end = start + mod->noinstr_text_size;
|
|
|
|
kprobe_add_area_blacklist(start, end);
|
|
|
|
}
|
2020-03-26 14:49:48 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static void remove_module_kprobe_blacklist(struct module *mod)
|
|
|
|
{
|
|
|
|
unsigned long start, end;
|
2020-03-26 14:50:00 +00:00
|
|
|
int i;
|
|
|
|
|
|
|
|
if (mod->kprobe_blacklist) {
|
|
|
|
for (i = 0; i < mod->num_kprobe_blacklist; i++)
|
|
|
|
kprobe_remove_ksym_blacklist(mod->kprobe_blacklist[i]);
|
|
|
|
}
|
2020-03-26 14:49:48 +00:00
|
|
|
|
|
|
|
start = (unsigned long)mod->kprobes_text_start;
|
|
|
|
if (start) {
|
|
|
|
end = start + mod->kprobes_text_size;
|
|
|
|
kprobe_remove_area_blacklist(start, end);
|
|
|
|
}
|
2020-03-10 13:04:34 +00:00
|
|
|
|
|
|
|
start = (unsigned long)mod->noinstr_text_start;
|
|
|
|
if (start) {
|
|
|
|
end = start + mod->noinstr_text_size;
|
|
|
|
kprobe_remove_area_blacklist(start, end);
|
|
|
|
}
|
2020-03-26 14:49:48 +00:00
|
|
|
}
|
|
|
|
|
2009-01-06 22:41:52 +00:00
|
|
|
/* Module notifier call back, checking kprobes on the module */
|
2014-04-17 08:17:54 +00:00
|
|
|
static int kprobes_module_callback(struct notifier_block *nb,
|
|
|
|
unsigned long val, void *data)
|
2009-01-06 22:41:52 +00:00
|
|
|
{
|
|
|
|
struct module *mod = data;
|
|
|
|
struct hlist_head *head;
|
|
|
|
struct kprobe *p;
|
|
|
|
unsigned int i;
|
2009-01-06 22:41:55 +00:00
|
|
|
int checkcore = (val == MODULE_STATE_GOING);
|
2009-01-06 22:41:52 +00:00
|
|
|
|
2020-03-26 14:49:48 +00:00
|
|
|
if (val == MODULE_STATE_COMING) {
|
|
|
|
mutex_lock(&kprobe_mutex);
|
|
|
|
add_module_kprobe_blacklist(mod);
|
|
|
|
mutex_unlock(&kprobe_mutex);
|
|
|
|
}
|
2009-01-06 22:41:55 +00:00
|
|
|
if (val != MODULE_STATE_GOING && val != MODULE_STATE_LIVE)
|
2009-01-06 22:41:52 +00:00
|
|
|
return NOTIFY_DONE;
|
|
|
|
|
|
|
|
/*
|
2021-09-14 14:39:34 +00:00
|
|
|
* When 'MODULE_STATE_GOING' was notified, both of module '.text' and
|
|
|
|
* '.init.text' sections would be freed. When 'MODULE_STATE_LIVE' was
|
|
|
|
* notified, only '.init.text' section would be freed. We need to
|
2009-01-06 22:41:55 +00:00
|
|
|
* disable kprobes which have been inserted in the sections.
|
2009-01-06 22:41:52 +00:00
|
|
|
*/
|
|
|
|
mutex_lock(&kprobe_mutex);
|
|
|
|
for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
|
|
|
|
head = &kprobe_table[i];
|
2020-05-12 08:02:44 +00:00
|
|
|
hlist_for_each_entry(p, head, hlist)
|
2009-01-06 22:41:55 +00:00
|
|
|
if (within_module_init((unsigned long)p->addr, mod) ||
|
|
|
|
(checkcore &&
|
|
|
|
within_module_core((unsigned long)p->addr, mod))) {
|
2009-01-06 22:41:52 +00:00
|
|
|
/*
|
|
|
|
* The vaddr this probe is installed will soon
|
|
|
|
* be vfreed buy not synced to disk. Hence,
|
|
|
|
* disarming the breakpoint isn't needed.
|
2017-05-16 18:58:35 +00:00
|
|
|
*
|
|
|
|
* Note, this will also move any optimized probes
|
|
|
|
* that are pending to be removed from their
|
2021-09-14 14:39:34 +00:00
|
|
|
* corresponding lists to the 'freeing_list' and
|
2017-05-16 18:58:35 +00:00
|
|
|
* will not be touched by the delayed
|
2021-09-14 14:39:34 +00:00
|
|
|
* kprobe_optimizer() work handler.
|
2009-01-06 22:41:52 +00:00
|
|
|
*/
|
|
|
|
kill_kprobe(p);
|
|
|
|
}
|
|
|
|
}
|
2020-03-26 14:49:48 +00:00
|
|
|
if (val == MODULE_STATE_GOING)
|
|
|
|
remove_module_kprobe_blacklist(mod);
|
2009-01-06 22:41:52 +00:00
|
|
|
mutex_unlock(&kprobe_mutex);
|
|
|
|
return NOTIFY_DONE;
|
|
|
|
}
|
|
|
|
|
|
|
|
static struct notifier_block kprobe_module_nb = {
|
|
|
|
.notifier_call = kprobes_module_callback,
|
|
|
|
.priority = 0
|
|
|
|
};
|
|
|
|
|
2024-05-05 16:06:27 +00:00
|
|
|
static int kprobe_register_module_notifier(void)
|
|
|
|
{
|
|
|
|
return register_module_notifier(&kprobe_module_nb);
|
|
|
|
}
|
|
|
|
#else
|
|
|
|
static int kprobe_register_module_notifier(void)
|
|
|
|
{
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
#endif /* CONFIG_MODULES */
|
|
|
|
|
2020-09-10 08:55:05 +00:00
|
|
|
void kprobe_free_init_mem(void)
|
|
|
|
{
|
|
|
|
void *start = (void *)(&__init_begin);
|
|
|
|
void *end = (void *)(&__init_end);
|
|
|
|
struct hlist_head *head;
|
|
|
|
struct kprobe *p;
|
|
|
|
int i;
|
|
|
|
|
|
|
|
mutex_lock(&kprobe_mutex);
|
|
|
|
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Kill all kprobes on initmem because the target code has been freed. */
|
2020-09-10 08:55:05 +00:00
|
|
|
for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
|
|
|
|
head = &kprobe_table[i];
|
|
|
|
hlist_for_each_entry(p, head, hlist) {
|
|
|
|
if (start <= (void *)p->addr && (void *)p->addr < end)
|
|
|
|
kill_kprobe(p);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
mutex_unlock(&kprobe_mutex);
|
|
|
|
}
|
|
|
|
|
2005-04-16 22:20:36 +00:00
|
|
|
static int __init init_kprobes(void)
|
|
|
|
{
|
2023-07-11 18:53:53 +00:00
|
|
|
int i, err;
|
2005-04-16 22:20:36 +00:00
|
|
|
|
|
|
|
/* FIXME allocate the probe table, currently defined statically */
|
|
|
|
/* initialize all list heads */
|
2020-08-29 13:03:24 +00:00
|
|
|
for (i = 0; i < KPROBE_TABLE_SIZE; i++)
|
2005-04-16 22:20:36 +00:00
|
|
|
INIT_HLIST_HEAD(&kprobe_table[i]);
|
|
|
|
|
2014-04-17 08:17:05 +00:00
|
|
|
err = populate_kprobe_blacklist(__start_kprobe_blacklist,
|
|
|
|
__stop_kprobe_blacklist);
|
2021-09-14 14:39:34 +00:00
|
|
|
if (err)
|
2021-09-14 14:39:25 +00:00
|
|
|
pr_err("Failed to populate blacklist (error %d), kprobes not restricted, be careful using them!\n", err);
|
2008-04-28 09:14:26 +00:00
|
|
|
|
2007-10-16 08:27:49 +00:00
|
|
|
if (kretprobe_blacklist_size) {
|
|
|
|
/* lookup the function address from its name */
|
|
|
|
for (i = 0; kretprobe_blacklist[i].name != NULL; i++) {
|
2017-04-19 12:51:00 +00:00
|
|
|
kretprobe_blacklist[i].addr =
|
2017-04-19 12:51:01 +00:00
|
|
|
kprobe_lookup_name(kretprobe_blacklist[i].name, 0);
|
2007-10-16 08:27:49 +00:00
|
|
|
if (!kretprobe_blacklist[i].addr)
|
2021-09-14 14:39:25 +00:00
|
|
|
pr_err("Failed to lookup symbol '%s' for kretprobe blacklist. Maybe the target function is removed or renamed.\n",
|
2007-10-16 08:27:49 +00:00
|
|
|
kretprobe_blacklist[i].name);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2009-04-07 02:01:01 +00:00
|
|
|
/* By default, kprobes are armed */
|
|
|
|
kprobes_all_disarmed = false;
|
2007-05-08 07:34:16 +00:00
|
|
|
|
2021-02-18 14:29:23 +00:00
|
|
|
#if defined(CONFIG_OPTPROBES) && defined(__ARCH_WANT_KPROBES_INSN_SLOT)
|
2021-09-14 14:39:34 +00:00
|
|
|
/* Init 'kprobe_optinsn_slots' for allocation */
|
2021-02-18 14:29:23 +00:00
|
|
|
kprobe_optinsn_slots.insn_size = MAX_OPTINSN_SIZE;
|
|
|
|
#endif
|
|
|
|
|
2005-07-06 01:54:50 +00:00
|
|
|
err = arch_init_kprobes();
|
[PATCH] Return probe redesign: architecture independent changes
The following is the second version of the function return probe patches
I sent out earlier this week. Changes since my last submission include:
* Fix in ppc64 code removing an unneeded call to re-enable preemption
* Fix a build problem in ia64 when kprobes was turned off
* Added another BUG_ON check to each of the architecture trampoline
handlers
My initial patch description ==>
From my experiences with adding return probes to x86_64 and ia64, and the
feedback on LKML to those patches, I think we can simplify the design
for return probes.
The following patch tweaks the original design such that:
* Instead of storing the stack address in the return probe instance, the
task pointer is stored. This gives us all we need in order to:
- find the correct return probe instance when we enter the trampoline
(even if we are recursing)
- find all left-over return probe instances when the task is going away
This has the side effect of simplifying the implementation since more
work can be done in kernel/kprobes.c since architecture specific knowledge
of the stack layout is no longer required. Specifically, we no longer have:
- arch_get_kprobe_task()
- arch_kprobe_flush_task()
- get_rp_inst_tsk()
- get_rp_inst()
- trampoline_post_handler() <see next bullet>
* Instead of splitting the return probe handling and cleanup logic across
the pre and post trampoline handlers, all the work is pushed into the
pre function (trampoline_probe_handler), and then we skip single stepping
the original function. In this case the original instruction to be single
stepped was just a NOP, and we can do without the extra interruption.
The new flow of events to having a return probe handler execute when a target
function exits is:
* At system initialization time, a kprobe is inserted at the beginning of
kretprobe_trampoline. kernel/kprobes.c use to handle this on it's own,
but ia64 needed to do this a little differently (i.e. a function pointer
is really a pointer to a structure containing the instruction pointer and
a global pointer), so I added the notion of arch_init(), so that
kernel/kprobes.c:init_kprobes() now allows architecture specific
initialization by calling arch_init() before exiting. Each architecture
now registers a kprobe on it's own trampoline function.
* register_kretprobe() will insert a kprobe at the beginning of the targeted
function with the kprobe pre_handler set to arch_prepare_kretprobe
(still no change)
* When the target function is entered, the kprobe is fired, calling
arch_prepare_kretprobe (still no change)
* In arch_prepare_kretprobe() we try to get a free instance and if one is
available then we fill out the instance with a pointer to the return probe,
the original return address, and a pointer to the task structure (instead
of the stack address.) Just like before we change the return address
to the trampoline function and mark the instance as used.
If multiple return probes are registered for a given target function,
then arch_prepare_kretprobe() will get called multiple times for the same
task (since our kprobe implementation is able to handle multiple kprobes
at the same address.) Past the first call to arch_prepare_kretprobe,
we end up with the original address stored in the return probe instance
pointing to our trampoline function. (This is a significant difference
from the original arch_prepare_kretprobe design.)
* Target function executes like normal and then returns to kretprobe_trampoline.
* kprobe inserted on the first instruction of kretprobe_trampoline is fired
and calls trampoline_probe_handler() (no change here)
* trampoline_probe_handler() consumes each of the instances associated with
the current task by calling the registered handler function and marking
the instance as unused until an instance is found that has a return address
different then the trampoline function.
(change similar to my previous ia64 RFC)
* If the task is killed with some left-over return probe instances (meaning
that a target function was entered, but never returned), then we just
free any instances associated with the task. (Not much different other
then we can handle this without calling architecture specific functions.)
There is a known problem that this patch does not yet solve where
registering a return probe flush_old_exec or flush_thread will put us
in a bad state. Most likely the best way to handle this is to not allow
registering return probes on these two functions.
(Significant change)
This patch series applies to the 2.6.12-rc6-mm1 kernel, and provides:
* kernel/kprobes.c changes
* i386 patch of existing return probes implementation
* x86_64 patch of existing return probe implementation
* ia64 implementation
* ppc64 implementation (provided by Ananth)
This patch implements the architecture independant changes for a reworking
of the kprobes based function return probes design. Changes include:
* Removing functions for querying a return probe instance off a stack address
* Removing the stack_addr field from the kretprobe_instance definition,
and adding a task pointer
* Adding architecture specific initialization via arch_init()
* Removing extern definitions for the architecture trampoline functions
(this isn't needed anymore since the architecture handles the
initialization of the kprobe in the return probe trampoline function.)
Signed-off-by: Rusty Lynch <rusty.lynch@intel.com>
Signed-off-by: Andrew Morton <akpm@osdl.org>
Signed-off-by: Linus Torvalds <torvalds@osdl.org>
2005-06-27 22:17:08 +00:00
|
|
|
if (!err)
|
|
|
|
err = register_die_notifier(&kprobe_exceptions_nb);
|
2009-01-06 22:41:52 +00:00
|
|
|
if (!err)
|
2024-05-05 16:06:27 +00:00
|
|
|
err = kprobe_register_module_notifier();
|
2009-01-06 22:41:52 +00:00
|
|
|
|
2008-07-25 08:46:04 +00:00
|
|
|
kprobes_initialized = (err == 0);
|
2022-01-22 06:13:41 +00:00
|
|
|
kprobe_sysctls_init();
|
2005-04-16 22:20:36 +00:00
|
|
|
return err;
|
|
|
|
}
|
2020-09-10 12:38:39 +00:00
|
|
|
early_initcall(init_kprobes);
|
2005-04-16 22:20:36 +00:00
|
|
|
|
2021-02-18 14:29:23 +00:00
|
|
|
#if defined(CONFIG_OPTPROBES)
|
|
|
|
static int __init init_optprobes(void)
|
|
|
|
{
|
|
|
|
/*
|
|
|
|
* Enable kprobe optimization - this kicks the optimizer which
|
|
|
|
* depends on synchronize_rcu_tasks() and ksoftirqd, that is
|
|
|
|
* not spawned in early initcall. So delay the optimization.
|
|
|
|
*/
|
|
|
|
optimize_all_kprobes();
|
|
|
|
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
subsys_initcall(init_optprobes);
|
|
|
|
#endif
|
|
|
|
|
2007-02-20 21:57:54 +00:00
|
|
|
#ifdef CONFIG_DEBUG_FS
|
2014-04-17 08:17:54 +00:00
|
|
|
static void report_probe(struct seq_file *pi, struct kprobe *p,
|
2010-02-25 13:34:07 +00:00
|
|
|
const char *sym, int offset, char *modname, struct kprobe *pp)
|
2007-02-20 21:57:54 +00:00
|
|
|
{
|
|
|
|
char *kprobe_type;
|
2018-04-28 12:36:02 +00:00
|
|
|
void *addr = p->addr;
|
2007-02-20 21:57:54 +00:00
|
|
|
|
|
|
|
if (p->pre_handler == pre_handler_kretprobe)
|
|
|
|
kprobe_type = "r";
|
|
|
|
else
|
|
|
|
kprobe_type = "k";
|
2010-02-25 13:34:07 +00:00
|
|
|
|
2020-07-02 22:20:22 +00:00
|
|
|
if (!kallsyms_show_value(pi->file->f_cred))
|
2018-04-28 12:36:02 +00:00
|
|
|
addr = NULL;
|
|
|
|
|
2007-02-20 21:57:54 +00:00
|
|
|
if (sym)
|
2018-04-28 12:36:02 +00:00
|
|
|
seq_printf(pi, "%px %s %s+0x%x %s ",
|
|
|
|
addr, kprobe_type, sym, offset,
|
2010-02-25 13:34:07 +00:00
|
|
|
(modname ? modname : " "));
|
2018-04-28 12:36:02 +00:00
|
|
|
else /* try to use %pS */
|
|
|
|
seq_printf(pi, "%px %s %pS ",
|
|
|
|
addr, kprobe_type, p->addr);
|
2010-02-25 13:34:07 +00:00
|
|
|
|
|
|
|
if (!pp)
|
|
|
|
pp = p;
|
2012-06-05 10:28:32 +00:00
|
|
|
seq_printf(pi, "%s%s%s%s\n",
|
2010-02-25 13:34:07 +00:00
|
|
|
(kprobe_gone(p) ? "[GONE]" : ""),
|
|
|
|
((kprobe_disabled(p) && !kprobe_gone(p)) ? "[DISABLED]" : ""),
|
2012-06-05 10:28:32 +00:00
|
|
|
(kprobe_optimized(pp) ? "[OPTIMIZED]" : ""),
|
|
|
|
(kprobe_ftrace(pp) ? "[FTRACE]" : ""));
|
2007-02-20 21:57:54 +00:00
|
|
|
}
|
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
static void *kprobe_seq_start(struct seq_file *f, loff_t *pos)
|
2007-02-20 21:57:54 +00:00
|
|
|
{
|
|
|
|
return (*pos < KPROBE_TABLE_SIZE) ? pos : NULL;
|
|
|
|
}
|
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
static void *kprobe_seq_next(struct seq_file *f, void *v, loff_t *pos)
|
2007-02-20 21:57:54 +00:00
|
|
|
{
|
|
|
|
(*pos)++;
|
|
|
|
if (*pos >= KPROBE_TABLE_SIZE)
|
|
|
|
return NULL;
|
|
|
|
return pos;
|
|
|
|
}
|
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
static void kprobe_seq_stop(struct seq_file *f, void *v)
|
2007-02-20 21:57:54 +00:00
|
|
|
{
|
|
|
|
/* Nothing to do */
|
|
|
|
}
|
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
static int show_kprobe_addr(struct seq_file *pi, void *v)
|
2007-02-20 21:57:54 +00:00
|
|
|
{
|
|
|
|
struct hlist_head *head;
|
|
|
|
struct kprobe *p, *kp;
|
2023-09-19 01:28:23 +00:00
|
|
|
const char *sym;
|
2007-02-20 21:57:54 +00:00
|
|
|
unsigned int i = *(loff_t *) v;
|
2007-05-08 07:28:41 +00:00
|
|
|
unsigned long offset = 0;
|
2013-11-12 23:10:23 +00:00
|
|
|
char *modname, namebuf[KSYM_NAME_LEN];
|
2007-02-20 21:57:54 +00:00
|
|
|
|
|
|
|
head = &kprobe_table[i];
|
|
|
|
preempt_disable();
|
hlist: drop the node parameter from iterators
I'm not sure why, but the hlist for each entry iterators were conceived
list_for_each_entry(pos, head, member)
The hlist ones were greedy and wanted an extra parameter:
hlist_for_each_entry(tpos, pos, head, member)
Why did they need an extra pos parameter? I'm not quite sure. Not only
they don't really need it, it also prevents the iterator from looking
exactly like the list iterator, which is unfortunate.
Besides the semantic patch, there was some manual work required:
- Fix up the actual hlist iterators in linux/list.h
- Fix up the declaration of other iterators based on the hlist ones.
- A very small amount of places were using the 'node' parameter, this
was modified to use 'obj->member' instead.
- Coccinelle didn't handle the hlist_for_each_entry_safe iterator
properly, so those had to be fixed up manually.
The semantic patch which is mostly the work of Peter Senna Tschudin is here:
@@
iterator name hlist_for_each_entry, hlist_for_each_entry_continue, hlist_for_each_entry_from, hlist_for_each_entry_rcu, hlist_for_each_entry_rcu_bh, hlist_for_each_entry_continue_rcu_bh, for_each_busy_worker, ax25_uid_for_each, ax25_for_each, inet_bind_bucket_for_each, sctp_for_each_hentry, sk_for_each, sk_for_each_rcu, sk_for_each_from, sk_for_each_safe, sk_for_each_bound, hlist_for_each_entry_safe, hlist_for_each_entry_continue_rcu, nr_neigh_for_each, nr_neigh_for_each_safe, nr_node_for_each, nr_node_for_each_safe, for_each_gfn_indirect_valid_sp, for_each_gfn_sp, for_each_host;
type T;
expression a,c,d,e;
identifier b;
statement S;
@@
-T b;
<+... when != b
(
hlist_for_each_entry(a,
- b,
c, d) S
|
hlist_for_each_entry_continue(a,
- b,
c) S
|
hlist_for_each_entry_from(a,
- b,
c) S
|
hlist_for_each_entry_rcu(a,
- b,
c, d) S
|
hlist_for_each_entry_rcu_bh(a,
- b,
c, d) S
|
hlist_for_each_entry_continue_rcu_bh(a,
- b,
c) S
|
for_each_busy_worker(a, c,
- b,
d) S
|
ax25_uid_for_each(a,
- b,
c) S
|
ax25_for_each(a,
- b,
c) S
|
inet_bind_bucket_for_each(a,
- b,
c) S
|
sctp_for_each_hentry(a,
- b,
c) S
|
sk_for_each(a,
- b,
c) S
|
sk_for_each_rcu(a,
- b,
c) S
|
sk_for_each_from
-(a, b)
+(a)
S
+ sk_for_each_from(a) S
|
sk_for_each_safe(a,
- b,
c, d) S
|
sk_for_each_bound(a,
- b,
c) S
|
hlist_for_each_entry_safe(a,
- b,
c, d, e) S
|
hlist_for_each_entry_continue_rcu(a,
- b,
c) S
|
nr_neigh_for_each(a,
- b,
c) S
|
nr_neigh_for_each_safe(a,
- b,
c, d) S
|
nr_node_for_each(a,
- b,
c) S
|
nr_node_for_each_safe(a,
- b,
c, d) S
|
- for_each_gfn_sp(a, c, d, b) S
+ for_each_gfn_sp(a, c, d) S
|
- for_each_gfn_indirect_valid_sp(a, c, d, b) S
+ for_each_gfn_indirect_valid_sp(a, c, d) S
|
for_each_host(a,
- b,
c) S
|
for_each_host_safe(a,
- b,
c, d) S
|
for_each_mesh_entry(a,
- b,
c, d) S
)
...+>
[akpm@linux-foundation.org: drop bogus change from net/ipv4/raw.c]
[akpm@linux-foundation.org: drop bogus hunk from net/ipv6/raw.c]
[akpm@linux-foundation.org: checkpatch fixes]
[akpm@linux-foundation.org: fix warnings]
[akpm@linux-foudnation.org: redo intrusive kvm changes]
Tested-by: Peter Senna Tschudin <peter.senna@gmail.com>
Acked-by: Paul E. McKenney <paulmck@linux.vnet.ibm.com>
Signed-off-by: Sasha Levin <sasha.levin@oracle.com>
Cc: Wu Fengguang <fengguang.wu@intel.com>
Cc: Marcelo Tosatti <mtosatti@redhat.com>
Cc: Gleb Natapov <gleb@redhat.com>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
2013-02-28 01:06:00 +00:00
|
|
|
hlist_for_each_entry_rcu(p, head, hlist) {
|
2007-05-08 07:28:41 +00:00
|
|
|
sym = kallsyms_lookup((unsigned long)p->addr, NULL,
|
2007-02-20 21:57:54 +00:00
|
|
|
&offset, &modname, namebuf);
|
2010-02-25 13:34:07 +00:00
|
|
|
if (kprobe_aggrprobe(p)) {
|
2007-02-20 21:57:54 +00:00
|
|
|
list_for_each_entry_rcu(kp, &p->list, list)
|
2010-02-25 13:34:07 +00:00
|
|
|
report_probe(pi, kp, sym, offset, modname, p);
|
2007-02-20 21:57:54 +00:00
|
|
|
} else
|
2010-02-25 13:34:07 +00:00
|
|
|
report_probe(pi, p, sym, offset, modname, NULL);
|
2007-02-20 21:57:54 +00:00
|
|
|
}
|
|
|
|
preempt_enable();
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2020-06-04 23:51:11 +00:00
|
|
|
static const struct seq_operations kprobes_sops = {
|
2007-02-20 21:57:54 +00:00
|
|
|
.start = kprobe_seq_start,
|
|
|
|
.next = kprobe_seq_next,
|
|
|
|
.stop = kprobe_seq_stop,
|
|
|
|
.show = show_kprobe_addr
|
|
|
|
};
|
|
|
|
|
2020-06-04 23:51:11 +00:00
|
|
|
DEFINE_SEQ_ATTRIBUTE(kprobes);
|
2007-02-20 21:57:54 +00:00
|
|
|
|
2014-04-17 08:18:49 +00:00
|
|
|
/* kprobes/blacklist -- shows which functions can not be probed */
|
|
|
|
static void *kprobe_blacklist_seq_start(struct seq_file *m, loff_t *pos)
|
|
|
|
{
|
2020-03-26 14:49:36 +00:00
|
|
|
mutex_lock(&kprobe_mutex);
|
2014-04-17 08:18:49 +00:00
|
|
|
return seq_list_start(&kprobe_blacklist, *pos);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void *kprobe_blacklist_seq_next(struct seq_file *m, void *v, loff_t *pos)
|
|
|
|
{
|
|
|
|
return seq_list_next(v, &kprobe_blacklist, pos);
|
|
|
|
}
|
|
|
|
|
|
|
|
static int kprobe_blacklist_seq_show(struct seq_file *m, void *v)
|
|
|
|
{
|
|
|
|
struct kprobe_blacklist_entry *ent =
|
|
|
|
list_entry(v, struct kprobe_blacklist_entry, list);
|
|
|
|
|
2018-04-28 12:35:32 +00:00
|
|
|
/*
|
2021-09-14 14:39:34 +00:00
|
|
|
* If '/proc/kallsyms' is not showing kernel address, we won't
|
2018-04-28 12:35:32 +00:00
|
|
|
* show them here either.
|
|
|
|
*/
|
2020-07-02 22:20:22 +00:00
|
|
|
if (!kallsyms_show_value(m->file->f_cred))
|
2018-04-28 12:35:32 +00:00
|
|
|
seq_printf(m, "0x%px-0x%px\t%ps\n", NULL, NULL,
|
|
|
|
(void *)ent->start_addr);
|
|
|
|
else
|
|
|
|
seq_printf(m, "0x%px-0x%px\t%ps\n", (void *)ent->start_addr,
|
|
|
|
(void *)ent->end_addr, (void *)ent->start_addr);
|
2014-04-17 08:18:49 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
2020-03-26 14:49:36 +00:00
|
|
|
static void kprobe_blacklist_seq_stop(struct seq_file *f, void *v)
|
|
|
|
{
|
|
|
|
mutex_unlock(&kprobe_mutex);
|
|
|
|
}
|
|
|
|
|
2020-06-04 23:51:11 +00:00
|
|
|
static const struct seq_operations kprobe_blacklist_sops = {
|
2014-04-17 08:18:49 +00:00
|
|
|
.start = kprobe_blacklist_seq_start,
|
|
|
|
.next = kprobe_blacklist_seq_next,
|
2020-03-26 14:49:36 +00:00
|
|
|
.stop = kprobe_blacklist_seq_stop,
|
2014-04-17 08:18:49 +00:00
|
|
|
.show = kprobe_blacklist_seq_show,
|
|
|
|
};
|
2020-06-04 23:51:11 +00:00
|
|
|
DEFINE_SEQ_ATTRIBUTE(kprobe_blacklist);
|
2014-04-17 08:18:49 +00:00
|
|
|
|
2018-01-09 23:51:23 +00:00
|
|
|
static int arm_all_kprobes(void)
|
2007-05-08 07:34:16 +00:00
|
|
|
{
|
|
|
|
struct hlist_head *head;
|
|
|
|
struct kprobe *p;
|
2018-01-09 23:51:23 +00:00
|
|
|
unsigned int i, total = 0, errors = 0;
|
|
|
|
int err, ret = 0;
|
2007-05-08 07:34:16 +00:00
|
|
|
|
|
|
|
mutex_lock(&kprobe_mutex);
|
|
|
|
|
2009-04-07 02:01:01 +00:00
|
|
|
/* If kprobes are armed, just return */
|
|
|
|
if (!kprobes_all_disarmed)
|
2007-05-08 07:34:16 +00:00
|
|
|
goto already_enabled;
|
|
|
|
|
2015-02-13 22:40:24 +00:00
|
|
|
/*
|
|
|
|
* optimize_kprobe() called by arm_kprobe() checks
|
|
|
|
* kprobes_all_disarmed, so set kprobes_all_disarmed before
|
|
|
|
* arm_kprobe.
|
|
|
|
*/
|
|
|
|
kprobes_all_disarmed = false;
|
2010-02-25 13:34:07 +00:00
|
|
|
/* Arming kprobes doesn't optimize kprobe itself */
|
2007-05-08 07:34:16 +00:00
|
|
|
for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
|
|
|
|
head = &kprobe_table[i];
|
2018-01-09 23:51:23 +00:00
|
|
|
/* Arm all kprobes on a best-effort basis */
|
2020-05-12 08:02:44 +00:00
|
|
|
hlist_for_each_entry(p, head, hlist) {
|
2018-01-09 23:51:23 +00:00
|
|
|
if (!kprobe_disabled(p)) {
|
|
|
|
err = arm_kprobe(p);
|
|
|
|
if (err) {
|
|
|
|
errors++;
|
|
|
|
ret = err;
|
|
|
|
}
|
|
|
|
total++;
|
|
|
|
}
|
|
|
|
}
|
2007-05-08 07:34:16 +00:00
|
|
|
}
|
|
|
|
|
2018-01-09 23:51:23 +00:00
|
|
|
if (errors)
|
2021-09-14 14:39:25 +00:00
|
|
|
pr_warn("Kprobes globally enabled, but failed to enable %d out of %d probes. Please check which kprobes are kept disabled via debugfs.\n",
|
2018-01-09 23:51:23 +00:00
|
|
|
errors, total);
|
|
|
|
else
|
|
|
|
pr_info("Kprobes globally enabled\n");
|
2007-05-08 07:34:16 +00:00
|
|
|
|
|
|
|
already_enabled:
|
|
|
|
mutex_unlock(&kprobe_mutex);
|
2018-01-09 23:51:23 +00:00
|
|
|
return ret;
|
2007-05-08 07:34:16 +00:00
|
|
|
}
|
|
|
|
|
2018-01-09 23:51:24 +00:00
|
|
|
static int disarm_all_kprobes(void)
|
2007-05-08 07:34:16 +00:00
|
|
|
{
|
|
|
|
struct hlist_head *head;
|
|
|
|
struct kprobe *p;
|
2018-01-09 23:51:24 +00:00
|
|
|
unsigned int i, total = 0, errors = 0;
|
|
|
|
int err, ret = 0;
|
2007-05-08 07:34:16 +00:00
|
|
|
|
|
|
|
mutex_lock(&kprobe_mutex);
|
|
|
|
|
2009-04-07 02:01:01 +00:00
|
|
|
/* If kprobes are already disarmed, just return */
|
2010-12-03 09:54:09 +00:00
|
|
|
if (kprobes_all_disarmed) {
|
|
|
|
mutex_unlock(&kprobe_mutex);
|
2018-01-09 23:51:24 +00:00
|
|
|
return 0;
|
2010-12-03 09:54:09 +00:00
|
|
|
}
|
2007-05-08 07:34:16 +00:00
|
|
|
|
2009-04-07 02:01:01 +00:00
|
|
|
kprobes_all_disarmed = true;
|
2010-02-25 13:34:07 +00:00
|
|
|
|
2007-05-08 07:34:16 +00:00
|
|
|
for (i = 0; i < KPROBE_TABLE_SIZE; i++) {
|
|
|
|
head = &kprobe_table[i];
|
2018-01-09 23:51:24 +00:00
|
|
|
/* Disarm all kprobes on a best-effort basis */
|
2020-05-12 08:02:44 +00:00
|
|
|
hlist_for_each_entry(p, head, hlist) {
|
2018-01-09 23:51:24 +00:00
|
|
|
if (!arch_trampoline_kprobe(p) && !kprobe_disabled(p)) {
|
|
|
|
err = disarm_kprobe(p, false);
|
|
|
|
if (err) {
|
|
|
|
errors++;
|
|
|
|
ret = err;
|
|
|
|
}
|
|
|
|
total++;
|
|
|
|
}
|
2007-05-08 07:34:16 +00:00
|
|
|
}
|
|
|
|
}
|
2018-01-09 23:51:24 +00:00
|
|
|
|
|
|
|
if (errors)
|
2021-09-14 14:39:25 +00:00
|
|
|
pr_warn("Kprobes globally disabled, but failed to disable %d out of %d probes. Please check which kprobes are kept enabled via debugfs.\n",
|
2018-01-09 23:51:24 +00:00
|
|
|
errors, total);
|
|
|
|
else
|
|
|
|
pr_info("Kprobes globally disabled\n");
|
|
|
|
|
2007-05-08 07:34:16 +00:00
|
|
|
mutex_unlock(&kprobe_mutex);
|
|
|
|
|
2010-12-03 09:54:09 +00:00
|
|
|
/* Wait for disarming all kprobes by optimizer */
|
|
|
|
wait_for_kprobe_optimizer();
|
2018-01-09 23:51:24 +00:00
|
|
|
|
|
|
|
return ret;
|
2007-05-08 07:34:16 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/*
|
|
|
|
* XXX: The debugfs bool file interface doesn't allow for callbacks
|
|
|
|
* when the bool state is switched. We can reuse that facility when
|
|
|
|
* available
|
|
|
|
*/
|
|
|
|
static ssize_t read_enabled_file_bool(struct file *file,
|
|
|
|
char __user *user_buf, size_t count, loff_t *ppos)
|
|
|
|
{
|
|
|
|
char buf[3];
|
|
|
|
|
2009-04-07 02:01:01 +00:00
|
|
|
if (!kprobes_all_disarmed)
|
2007-05-08 07:34:16 +00:00
|
|
|
buf[0] = '1';
|
|
|
|
else
|
|
|
|
buf[0] = '0';
|
|
|
|
buf[1] = '\n';
|
|
|
|
buf[2] = 0x00;
|
|
|
|
return simple_read_from_buffer(user_buf, count, ppos, buf, 2);
|
|
|
|
}
|
|
|
|
|
|
|
|
static ssize_t write_enabled_file_bool(struct file *file,
|
|
|
|
const char __user *user_buf, size_t count, loff_t *ppos)
|
|
|
|
{
|
2021-09-14 14:38:46 +00:00
|
|
|
bool enable;
|
|
|
|
int ret;
|
2007-05-08 07:34:16 +00:00
|
|
|
|
2021-09-14 14:38:46 +00:00
|
|
|
ret = kstrtobool_from_user(user_buf, count, &enable);
|
|
|
|
if (ret)
|
|
|
|
return ret;
|
2007-05-08 07:34:16 +00:00
|
|
|
|
2021-09-14 14:38:46 +00:00
|
|
|
ret = enable ? arm_all_kprobes() : disarm_all_kprobes();
|
2018-01-09 23:51:23 +00:00
|
|
|
if (ret)
|
|
|
|
return ret;
|
|
|
|
|
2007-05-08 07:34:16 +00:00
|
|
|
return count;
|
|
|
|
}
|
|
|
|
|
2009-10-01 22:43:56 +00:00
|
|
|
static const struct file_operations fops_kp = {
|
2007-05-08 07:34:16 +00:00
|
|
|
.read = read_enabled_file_bool,
|
|
|
|
.write = write_enabled_file_bool,
|
llseek: automatically add .llseek fop
All file_operations should get a .llseek operation so we can make
nonseekable_open the default for future file operations without a
.llseek pointer.
The three cases that we can automatically detect are no_llseek, seq_lseek
and default_llseek. For cases where we can we can automatically prove that
the file offset is always ignored, we use noop_llseek, which maintains
the current behavior of not returning an error from a seek.
New drivers should normally not use noop_llseek but instead use no_llseek
and call nonseekable_open at open time. Existing drivers can be converted
to do the same when the maintainer knows for certain that no user code
relies on calling seek on the device file.
The generated code is often incorrectly indented and right now contains
comments that clarify for each added line why a specific variant was
chosen. In the version that gets submitted upstream, the comments will
be gone and I will manually fix the indentation, because there does not
seem to be a way to do that using coccinelle.
Some amount of new code is currently sitting in linux-next that should get
the same modifications, which I will do at the end of the merge window.
Many thanks to Julia Lawall for helping me learn to write a semantic
patch that does all this.
===== begin semantic patch =====
// This adds an llseek= method to all file operations,
// as a preparation for making no_llseek the default.
//
// The rules are
// - use no_llseek explicitly if we do nonseekable_open
// - use seq_lseek for sequential files
// - use default_llseek if we know we access f_pos
// - use noop_llseek if we know we don't access f_pos,
// but we still want to allow users to call lseek
//
@ open1 exists @
identifier nested_open;
@@
nested_open(...)
{
<+...
nonseekable_open(...)
...+>
}
@ open exists@
identifier open_f;
identifier i, f;
identifier open1.nested_open;
@@
int open_f(struct inode *i, struct file *f)
{
<+...
(
nonseekable_open(...)
|
nested_open(...)
)
...+>
}
@ read disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ read_no_fpos disable optional_qualifier exists @
identifier read_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t read_f(struct file *f, char *p, size_t s, loff_t *off)
{
... when != off
}
@ write @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
expression E;
identifier func;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
<+...
(
*off = E
|
*off += E
|
func(..., off, ...)
|
E = *off
)
...+>
}
@ write_no_fpos @
identifier write_f;
identifier f, p, s, off;
type ssize_t, size_t, loff_t;
@@
ssize_t write_f(struct file *f, const char *p, size_t s, loff_t *off)
{
... when != off
}
@ fops0 @
identifier fops;
@@
struct file_operations fops = {
...
};
@ has_llseek depends on fops0 @
identifier fops0.fops;
identifier llseek_f;
@@
struct file_operations fops = {
...
.llseek = llseek_f,
...
};
@ has_read depends on fops0 @
identifier fops0.fops;
identifier read_f;
@@
struct file_operations fops = {
...
.read = read_f,
...
};
@ has_write depends on fops0 @
identifier fops0.fops;
identifier write_f;
@@
struct file_operations fops = {
...
.write = write_f,
...
};
@ has_open depends on fops0 @
identifier fops0.fops;
identifier open_f;
@@
struct file_operations fops = {
...
.open = open_f,
...
};
// use no_llseek if we call nonseekable_open
////////////////////////////////////////////
@ nonseekable1 depends on !has_llseek && has_open @
identifier fops0.fops;
identifier nso ~= "nonseekable_open";
@@
struct file_operations fops = {
... .open = nso, ...
+.llseek = no_llseek, /* nonseekable */
};
@ nonseekable2 depends on !has_llseek @
identifier fops0.fops;
identifier open.open_f;
@@
struct file_operations fops = {
... .open = open_f, ...
+.llseek = no_llseek, /* open uses nonseekable */
};
// use seq_lseek for sequential files
/////////////////////////////////////
@ seq depends on !has_llseek @
identifier fops0.fops;
identifier sr ~= "seq_read";
@@
struct file_operations fops = {
... .read = sr, ...
+.llseek = seq_lseek, /* we have seq_read */
};
// use default_llseek if there is a readdir
///////////////////////////////////////////
@ fops1 depends on !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier readdir_e;
@@
// any other fop is used that changes pos
struct file_operations fops = {
... .readdir = readdir_e, ...
+.llseek = default_llseek, /* readdir is present */
};
// use default_llseek if at least one of read/write touches f_pos
/////////////////////////////////////////////////////////////////
@ fops2 depends on !fops1 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read.read_f;
@@
// read fops use offset
struct file_operations fops = {
... .read = read_f, ...
+.llseek = default_llseek, /* read accesses f_pos */
};
@ fops3 depends on !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write.write_f;
@@
// write fops use offset
struct file_operations fops = {
... .write = write_f, ...
+ .llseek = default_llseek, /* write accesses f_pos */
};
// Use noop_llseek if neither read nor write accesses f_pos
///////////////////////////////////////////////////////////
@ fops4 depends on !fops1 && !fops2 && !fops3 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
identifier write_no_fpos.write_f;
@@
// write fops use offset
struct file_operations fops = {
...
.write = write_f,
.read = read_f,
...
+.llseek = noop_llseek, /* read and write both use no f_pos */
};
@ depends on has_write && !has_read && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier write_no_fpos.write_f;
@@
struct file_operations fops = {
... .write = write_f, ...
+.llseek = noop_llseek, /* write uses no f_pos */
};
@ depends on has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
identifier read_no_fpos.read_f;
@@
struct file_operations fops = {
... .read = read_f, ...
+.llseek = noop_llseek, /* read uses no f_pos */
};
@ depends on !has_read && !has_write && !fops1 && !fops2 && !has_llseek && !nonseekable1 && !nonseekable2 && !seq @
identifier fops0.fops;
@@
struct file_operations fops = {
...
+.llseek = noop_llseek, /* no read or write fn */
};
===== End semantic patch =====
Signed-off-by: Arnd Bergmann <arnd@arndb.de>
Cc: Julia Lawall <julia@diku.dk>
Cc: Christoph Hellwig <hch@infradead.org>
2010-08-15 16:52:59 +00:00
|
|
|
.llseek = default_llseek,
|
2007-05-08 07:34:16 +00:00
|
|
|
};
|
|
|
|
|
2014-04-17 08:17:54 +00:00
|
|
|
static int __init debugfs_kprobe_init(void)
|
2007-02-20 21:57:54 +00:00
|
|
|
{
|
2019-01-22 15:21:46 +00:00
|
|
|
struct dentry *dir;
|
2007-02-20 21:57:54 +00:00
|
|
|
|
|
|
|
dir = debugfs_create_dir("kprobes", NULL);
|
|
|
|
|
2020-06-04 23:51:11 +00:00
|
|
|
debugfs_create_file("list", 0400, dir, NULL, &kprobes_fops);
|
2007-02-20 21:57:54 +00:00
|
|
|
|
2021-09-14 14:38:37 +00:00
|
|
|
debugfs_create_file("enabled", 0600, dir, NULL, &fops_kp);
|
2014-04-17 08:18:49 +00:00
|
|
|
|
2019-01-22 15:21:46 +00:00
|
|
|
debugfs_create_file("blacklist", 0400, dir, NULL,
|
2020-06-04 23:51:11 +00:00
|
|
|
&kprobe_blacklist_fops);
|
2007-05-08 07:34:16 +00:00
|
|
|
|
2007-02-20 21:57:54 +00:00
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
late_initcall(debugfs_kprobe_init);
|
|
|
|
#endif /* CONFIG_DEBUG_FS */
|