[<prev] [next>] [thread-next>] [day] [month] [year] [list]
Message-ID: <20240918012752.2045713-1-liaochang1@huawei.com>
Date: Wed, 18 Sep 2024 01:27:52 +0000
From: Liao Chang <liaochang1@...wei.com>
To: <mhiramat@...nel.org>, <oleg@...hat.com>, <andrii@...nel.org>,
<peterz@...radead.org>, <mingo@...hat.com>, <acme@...nel.org>,
<namhyung@...nel.org>, <mark.rutland@....com>,
<alexander.shishkin@...ux.intel.com>, <jolsa@...nel.org>,
<irogers@...gle.com>, <adrian.hunter@...el.com>, <kan.liang@...ux.intel.com>
CC: <linux-kernel@...r.kernel.org>, <linux-trace-kernel@...r.kernel.org>,
<linux-perf-users@...r.kernel.org>, <bpf@...r.kernel.org>
Subject: [PATCH] uprobes: Improve the usage of xol slots for better scalability
The kprobe handler allocates xol slot from xol_area and quickly release
it in the single-step handler. The atomic operations on the xol bitmap
and slot_count lead to expensive cache line bouncing between multiple
CPUs. Given the xol slot is on the hot path for kprobe and kretprobe
handling, the profiling results on some Arm64 machine show that nearly
80% of cycles are spent on this. So optimizing xol slot usage will
become important to scalability after the Andrii's series land.
This patch address this scalability issues from two perspectives:
- Allocated xol slot is now saved in the thread associated utask data.
It allows to reuse it throughout the therad's lifetime. This avoid
the frequent atomic operation on the slot bitmap and slot_count of
xol_area data, which is the major negative impact on scalability.
- A garbage collection routine xol_recycle_insn_slot() is introduced to
reclaim unused xol slots. utask instances that own xol slot but
haven't reclaimed them are linked in a linked list. When xol_area runs
out of slots, the garbage collection routine travel the list to free
one slot. Allocated xol slots is marked as unused in single-step
handler. While the marking relies on the refcount of utask instance,
due to thread can't run on multiple CPUs at same time, therefore, it
is unlikely CPUs take the refcount of same utask, minimizing cache
line bouncing.
Upon thread exit, the utask is deleted from the linked-list, and the
associated xol slot will be free.
Signed-off-by: Liao Chang <liaochang1@...wei.com>
---
include/linux/uprobes.h | 4 +
kernel/events/uprobes.c | 173 ++++++++++++++++++++++++++++++----------
2 files changed, 135 insertions(+), 42 deletions(-)
diff --git a/include/linux/uprobes.h b/include/linux/uprobes.h
index e6f4e73125ff..87fa24c74eb8 100644
--- a/include/linux/uprobes.h
+++ b/include/linux/uprobes.h
@@ -77,6 +77,10 @@ struct uprobe_task {
struct uprobe *active_uprobe;
unsigned long xol_vaddr;
+ struct list_head gc;
+ refcount_t slot_ref;
+ int insn_slot;
+
struct arch_uprobe *auprobe;
struct return_instance *return_instances;
diff --git a/kernel/events/uprobes.c b/kernel/events/uprobes.c
index 86fcb2386ea2..5ba1bd3ad27f 100644
--- a/kernel/events/uprobes.c
+++ b/kernel/events/uprobes.c
@@ -111,6 +111,12 @@ struct xol_area {
* the vma go away, and we must handle that reasonably gracefully.
*/
unsigned long vaddr; /* Page(s) of instruction slots */
+ struct list_head gc_list; /* The list for the
+ garbage slots */
+ spinlock_t list_lock; /* Hold for
+ list_add_rcu() and
+ list_del_rcu() on
+ gc_list */
};
static void uprobe_warn(struct task_struct *t, const char *msg)
@@ -1557,6 +1563,8 @@ static struct xol_area *__create_xol_area(unsigned long vaddr)
area->vaddr = vaddr;
init_waitqueue_head(&area->wq);
+ INIT_LIST_HEAD(&area->gc_list);
+ spin_lock_init(&area->list_lock);
/* Reserve the 1st slot for get_trampoline_vaddr() */
set_bit(0, area->bitmap);
atomic_set(&area->slot_count, 1);
@@ -1613,37 +1621,91 @@ void uprobe_dup_mmap(struct mm_struct *oldmm, struct mm_struct *newmm)
}
}
+static __always_inline
+struct uprobe_task *test_and_get_task_slot(struct uprobe_task *utask)
+{
+ return refcount_inc_not_zero(&utask->slot_ref) ? utask : NULL;
+}
+
+static __always_inline
+struct uprobe_task *test_and_put_task_slot(struct uprobe_task *utask)
+{
+ return refcount_dec_if_one(&utask->slot_ref) ? utask : NULL;
+}
+
+static __always_inline
+void put_task_slot(struct uprobe_task *utask)
+{
+ refcount_dec(&utask->slot_ref);
+}
+
+static __always_inline
+void get_task_slot(struct uprobe_task *utask)
+{
+ refcount_inc(&utask->slot_ref);
+}
+
+/*
+ * xol_recycle_insn_slot - recycle a slot from the garbage collection list.
+ */
+static int xol_recycle_insn_slot(struct xol_area *area)
+{
+ struct uprobe_task *utask;
+ int slot = UINSNS_PER_PAGE;
+
+ rcu_read_lock();
+ list_for_each_entry_rcu(utask, &area->gc_list, gc) {
+ /*
+ * The utask associated slot is in-use or recycling when
+ * utask associated slot_ref is not one.
+ */
+ if (test_and_put_task_slot(utask)) {
+ slot = utask->insn_slot;
+ utask->insn_slot = UINSNS_PER_PAGE;
+ clear_bit(slot, area->bitmap);
+ atomic_dec(&area->slot_count);
+ get_task_slot(utask);
+ break;
+ }
+ }
+ rcu_read_unlock();
+
+ return slot;
+}
+
/*
* - search for a free slot.
*/
-static unsigned long xol_take_insn_slot(struct xol_area *area)
+static int xol_take_insn_slot(struct xol_area *area)
{
- unsigned long slot_addr;
int slot_nr;
do {
slot_nr = find_first_zero_bit(area->bitmap, UINSNS_PER_PAGE);
- if (slot_nr < UINSNS_PER_PAGE) {
- if (!test_and_set_bit(slot_nr, area->bitmap))
- break;
+ if (slot_nr == UINSNS_PER_PAGE)
+ slot_nr = xol_recycle_insn_slot(area);
+
+ if (slot_nr == UINSNS_PER_PAGE)
+ wait_event(area->wq,
+ (atomic_read(&area->slot_count) <
+ UINSNS_PER_PAGE));
+ else if (!test_and_set_bit(slot_nr, area->bitmap))
+ break;
- slot_nr = UINSNS_PER_PAGE;
- continue;
- }
- wait_event(area->wq, (atomic_read(&area->slot_count) < UINSNS_PER_PAGE));
+ slot_nr = UINSNS_PER_PAGE;
} while (slot_nr >= UINSNS_PER_PAGE);
- slot_addr = area->vaddr + (slot_nr * UPROBE_XOL_SLOT_BYTES);
atomic_inc(&area->slot_count);
- return slot_addr;
+ return slot_nr;
}
/*
* xol_get_insn_slot - allocate a slot for xol.
* Returns the allocated slot address or 0.
*/
-static unsigned long xol_get_insn_slot(struct uprobe *uprobe)
+static unsigned long xol_get_insn_slot(struct uprobe_task *utask,
+ struct uprobe *uprobe)
{
struct xol_area *area;
unsigned long xol_vaddr;
@@ -1652,16 +1714,45 @@ static unsigned long xol_get_insn_slot(struct uprobe *uprobe)
if (!area)
return 0;
- xol_vaddr = xol_take_insn_slot(area);
- if (unlikely(!xol_vaddr))
+ /*
+ * The utask associated slot is recycling when utask associated
+ * slot_ref is zero.
+ */
+ if (!test_and_get_task_slot(utask))
return 0;
+ if (utask->insn_slot == UINSNS_PER_PAGE) {
+ utask->insn_slot = xol_take_insn_slot(area);
+ spin_lock(&area->list_lock);
+ list_add_rcu(&utask->gc, &area->gc_list);
+ spin_unlock(&area->list_lock);
+ }
+
+ xol_vaddr = area->vaddr + (utask->insn_slot * UPROBE_XOL_SLOT_BYTES);
+
arch_uprobe_copy_ixol(area->pages[0], xol_vaddr,
&uprobe->arch.ixol, sizeof(uprobe->arch.ixol));
return xol_vaddr;
}
+/*
+ * xol_delay_free_insn_slot - Make the slot available for garbage collection
+ */
+static void xol_delay_free_insn_slot(void)
+{
+ struct xol_area *area = current->mm->uprobes_state.xol_area;
+
+ /*
+ * This refcount would't cause expensive cache line bouncing
+ * between CPUs, as it is unlikely that multiple CPUs take the
+ * slot_ref of same utask.
+ */
+ put_task_slot(current->utask);
+ if (waitqueue_active(&area->wq))
+ wake_up(&area->wq);
+}
+
/*
* xol_free_insn_slot - If slot was earlier allocated by
* @xol_get_insn_slot(), make the slot available for
@@ -1670,35 +1761,31 @@ static unsigned long xol_get_insn_slot(struct uprobe *uprobe)
static void xol_free_insn_slot(struct task_struct *tsk)
{
struct xol_area *area;
- unsigned long vma_end;
- unsigned long slot_addr;
+ unsigned long flags;
+ int slot_nr;
if (!tsk->mm || !tsk->mm->uprobes_state.xol_area || !tsk->utask)
return;
- slot_addr = tsk->utask->xol_vaddr;
- if (unlikely(!slot_addr))
- return;
-
area = tsk->mm->uprobes_state.xol_area;
- vma_end = area->vaddr + PAGE_SIZE;
- if (area->vaddr <= slot_addr && slot_addr < vma_end) {
- unsigned long offset;
- int slot_nr;
-
- offset = slot_addr - area->vaddr;
- slot_nr = offset / UPROBE_XOL_SLOT_BYTES;
- if (slot_nr >= UINSNS_PER_PAGE)
- return;
- clear_bit(slot_nr, area->bitmap);
- atomic_dec(&area->slot_count);
- smp_mb__after_atomic(); /* pairs with prepare_to_wait() */
- if (waitqueue_active(&area->wq))
- wake_up(&area->wq);
+ spin_lock_irqsave(&area->list_lock, flags);
+ list_del_rcu(&tsk->utask->gc);
+ spin_unlock_irqrestore(&area->list_lock, flags);
+ synchronize_rcu();
- tsk->utask->xol_vaddr = 0;
- }
+ slot_nr = tsk->utask->insn_slot;
+ if (unlikely(slot_nr == UINSNS_PER_PAGE))
+ return;
+
+ tsk->utask->insn_slot = UINSNS_PER_PAGE;
+ clear_bit(slot_nr, area->bitmap);
+ atomic_dec(&area->slot_count);
+ smp_mb__after_atomic(); /* pairs with prepare_to_wait() */
+ if (waitqueue_active(&area->wq))
+ wake_up(&area->wq);
+
+ tsk->utask->xol_vaddr = 0;
}
void __weak arch_uprobe_copy_ixol(struct page *page, unsigned long vaddr,
@@ -1779,8 +1866,12 @@ void uprobe_free_utask(struct task_struct *t)
*/
static struct uprobe_task *get_utask(void)
{
- if (!current->utask)
+ if (!current->utask) {
current->utask = kzalloc(sizeof(struct uprobe_task), GFP_KERNEL);
+ current->utask->insn_slot = UINSNS_PER_PAGE;
+ INIT_LIST_HEAD(¤t->utask->gc);
+ refcount_set(¤t->utask->slot_ref, 1);
+ }
return current->utask;
}
@@ -1978,7 +2069,7 @@ pre_ssout(struct uprobe *uprobe, struct pt_regs *regs, unsigned long bp_vaddr)
if (!try_get_uprobe(uprobe))
return -EINVAL;
- xol_vaddr = xol_get_insn_slot(uprobe);
+ xol_vaddr = xol_get_insn_slot(utask, uprobe);
if (!xol_vaddr) {
err = -ENOMEM;
goto err_out;
@@ -1988,10 +2079,8 @@ pre_ssout(struct uprobe *uprobe, struct pt_regs *regs, unsigned long bp_vaddr)
utask->vaddr = bp_vaddr;
err = arch_uprobe_pre_xol(&uprobe->arch, regs);
- if (unlikely(err)) {
- xol_free_insn_slot(current);
+ if (unlikely(err))
goto err_out;
- }
utask->active_uprobe = uprobe;
utask->state = UTASK_SSTEP;
@@ -2340,7 +2429,7 @@ static void handle_singlestep(struct uprobe_task *utask, struct pt_regs *regs)
put_uprobe(uprobe);
utask->active_uprobe = NULL;
utask->state = UTASK_RUNNING;
- xol_free_insn_slot(current);
+ xol_delay_free_insn_slot();
spin_lock_irq(¤t->sighand->siglock);
recalc_sigpending(); /* see uprobe_deny_signal() */
--
2.34.1
Powered by blists - more mailing lists