sched: Restructure task_mm_cid_work for predictability
Subsystems (5)
v6 cover sched: Restructure task_mm_cid_work for predictability
This patchset moves the task_mm_cid_work to a preemptible and migratable context. This reduces the impact of this task to the scheduling latency of real time tasks.
The change makes the recurrence of the task a bit more predictable. We also add optimisation and fixes to make sure the task_mm_cid_work works as intended.
The behaviour causing latency was introduced in commit 223baf9d17f2 ("sched: Fix performance regression introduced by mm_cid") which introduced a task work tied to the scheduler tick.
That approach presents two possible issues:
* the task work runs before returning to user and causes, in fact, a scheduling latency (with order of magnitude significant in PREEMPT_RT)
* periodic tasks with short runtime are less likely to run during the tick, hence they might not run the task work at all
Patch 1 allows the mm_cids to be actually compacted when a process reduces its number of threads, which was not the case since the same mm_cids were reused to improve cache locality, more details in [4].
Patch 2 contains the main changes, removing the task_work on the scheduler tick and using a delayed_work instead. Additionally, we terminate the call immediately if we see that no mm_cid is actually active, which could happen on processes sleeping for long time or which exited but whose mm has not been freed yet.
Patch 3 adds a selftest to validate the functionality of the task_mm_cid_work (i.e. to compact the mm_cids). The test fails if patch 1 is not applied and is flaky without patch 2. We expect it to always pass with the entire patchset applied.
Changes since V5:
* Punctuation
Changes since V4 [1]:
* Fixes on the selftest
* Polished memory allocation and cleanup
* Handle the test failure in main
Changes since V3 [2]:
* Fixes on the selftest
* Minor style issues in comments and indentation
* Use of perror where possible
* Add a barrier to align threads execution
* Improve test failure and error handling
Changes since V2 [3]:
* Change the order of the patches
* Merge patches changing the main delayed_work logic
* Improved self-test to spawn 1 less thread and use the main one instead
Changes since V1 [4]:
* Re-arm the delayed_work at each invocation
* Cancel the work synchronously at mmdrop
* Remove next scan fields and completely rely on the delayed_work
* Shrink mm_cid allocation with nr thread/affinity (Mathieu Desnoyers)
* Add self test
Overhead comparison in [4]
[1] - https://lore.kernel.org/lkml/[email protected]
[2] - https://lore.kernel.org/lkml/[email protected]
[3] - https://lore.kernel.org/lkml/[email protected]
[4] - https://lore.kernel.org/lkml/[email protected]
To: Mathieu Desnoyers <[email protected]>
To: Peter Zijlstra <[email protected]>
To: Ingo Molnar <[email protected]>
To: Paul E. McKenney <[email protected]>
To: Shuah Khan <[email protected]>
Gabriele Monaco (2):
sched: Move task_mm_cid_work to mm delayed work
rseq/selftests: Add test for mm_cid compaction
Mathieu Desnoyers (1):
sched: Compact RSEQ concurrency IDs with reduced threads and affinity
include/linux/mm_types.h | 23 +- include/linux/sched.h | 1 - kernel/sched/core.c | 66 +----- kernel/sched/sched.h | 32 ++- tools/testing/selftests/rseq/.gitignore | 1 + tools/testing/selftests/rseq/Makefile | 2 +- .../selftests/rseq/mm_cid_compaction_test.c | 200 ++++++++++++++++++ 7 files changed, 246 insertions(+), 79 deletions(-) create mode 100644 tools/testing/selftests/rseq/mm_cid_compaction_test.c
base-commit: a64dcfb451e254085a7daee5fe51bf22959d52d3
Signature · 1 line
2.48.1
PATCH v6 1/3 sched: Compact RSEQ concurrency IDs with reduced threads and affinity
From: Mathieu Desnoyers <[email protected]>
When a process reduces its number of threads or clears bits in its CPU affinity mask, the mm_cid allocation should eventually converge towards smaller values.
However, the change introduced by:
commit 7e019dcc470f ("sched: Improve cache locality of RSEQ concurrency IDs for intermittent workloads")
adds a per-mm/CPU recent_cid which is never unset unless a thread migrates.
This is a tradeoff between:
A) Preserving cache locality after a transition from many threads to few threads, or after reducing the hamming weight of the allowed CPU mask.
B) Making the mm_cid upper bounds wrt nr threads and allowed CPU mask easy to document and understand.
C) Allowing applications to eventually react to mm_cid compaction after reduction of the nr threads or allowed CPU mask, making the tracking of mm_cid compaction easier by shrinking it back towards 0 or not.
D) Making sure applications that periodically reduce and then increase again the nr threads or allowed CPU mask still benefit from good cache locality with mm_cid.
Introduce the following changes:
* After shrinking the number of threads or reducing the number of allowed CPUs, reduce the value of max_nr_cid so expansion of CID allocation will preserve cache locality if the number of threads or allowed CPUs increase again.
* Only re-use a recent_cid if it is within the max_nr_cid upper bound, else find the first available CID.
--- include/linux/mm_types.h | 7 ++++--- kernel/sched/sched.h | 25 ++++++++++++++++++++++--- 2 files changed, 26 insertions(+), 6 deletions(-)
include/linux/mm_types.h +4 -3
@@ -875,10 +875,11 @@ struct mm_struct {*/ unsigned int nr_cpus_allowed;/** -* @max_nr_cid: Maximum number of concurrency IDs allocated. +* @max_nr_cid: Maximum number of allowed concurrency +* IDs allocated. * -* Track the highest number of concurrency IDs allocated for the -* mm. +* Track the highest number of allowed concurrency IDs +* allocated for the mm. */ atomic_t max_nr_cid;/**
kernel/sched/sched.h +22 -3
@@ -3698,10 +3698,28 @@ static inline int __mm_cid_try_get(struct task_struct *t, struct mm_struct *mm) {struct cpumask *cidmask =mm_cidmask (mm);struct mm_cid __percpu *pcpu_cid = mm->pcpu_cid; -int cid =__this_cpu_read (pcpu_cid->recent_cid); +int cid, max_nr_cid, allowed_max_nr_cid; +/* +* After shrinking the number of threads or reducing the number +* of allowed cpus, reduce the value of max_nr_cid so expansion +* of cid allocation will preserve cache locality if the number +* of threads or allowed cpus increase again. +*/ + max_nr_cid =atomic_read (&mm->max_nr_cid); +while ((allowed_max_nr_cid =min_t (int,READ_ONCE (mm->nr_cpus_allowed), +atomic_read (&mm->mm_users))), + max_nr_cid > allowed_max_nr_cid) { +/* atomic_try_cmpxchg loads previous mm->max_nr_cid into max_nr_cid. */ +if (atomic_try_cmpxchg (&mm->max_nr_cid, &max_nr_cid, allowed_max_nr_cid)) { + max_nr_cid = allowed_max_nr_cid; +break ; + } + }/* Try to re-use recent cid. This improves cache locality. */ -if (!mm_cid_is_unset (cid) && !cpumask_test_and_set_cpu (cid, cidmask)) + cid =__this_cpu_read (pcpu_cid->recent_cid); +if (!mm_cid_is_unset (cid) && cid < max_nr_cid && + !cpumask_test_and_set_cpu (cid, cidmask))return cid;/* * Expand cid allocation if the maximum number of concurrency
@@ -3709,8 +3727,9 @@ static inline int __mm_cid_try_get(struct task_struct *t, struct mm_struct *mm)* and number of threads. Expanding cid allocation as much as * possible improves cache locality. */ - cid =atomic_read (&mm->max_nr_cid); + cid = max_nr_cid;while (cid <READ_ONCE (mm->nr_cpus_allowed) && cid <atomic_read (&mm->mm_users)) { +/* atomic_try_cmpxchg loads previous mm->max_nr_cid into cid. */ if (!atomic_try_cmpxchg (&mm->max_nr_cid, &cid, cid +1 ))continue ;if (!cpumask_test_and_set_cpu (cid, cidmask))
Signature · 1 line
2.48.1
Mathieu Desnoyers
maintainerRe: [PATCH v6 1/3] sched: Compact RSEQ concurrency IDs with reduced threads and affinity
Quoted 2 lines · Gabriele Monaco
From: Mathieu Desnoyers <[email protected]>
Peter, Ingo, this patch has been ready for inclusion for a while. The rest of this series does not seem to be quite ready yet, but can we at least merge this patch into tip ?
Thanks,
Mathieu
Quoted 115 lines
When a process reduces its number of threads or clears bits in its CPU affinity mask, the
mm_cidallocation should eventually converge towards smaller values.However, the change introduced by:
commit
7e019dcc470f("sched: Improve cache locality of RSEQ concurrency IDs for intermittent workloads")adds a per-mm/CPU
recent_cidwhich is never unset unless a thread migrates.This is a tradeoff between:
A) Preserving cache locality after a transition from many threads to few threads, or after reducing the hamming weight of the allowed CPU mask.
B) Making the
mm_cidupper bounds wrt nr threads and allowed CPU mask easy to document and understand.C) Allowing applications to eventually react to
mm_cidcompaction after reduction of the nr threads or allowed CPU mask, making the tracking ofmm_cidcompaction easier by shrinking it back towards 0 or not.D) Making sure applications that periodically reduce and then increase again the nr threads or allowed CPU mask still benefit from good cache locality with
mm_cid.Introduce the following changes:
* After shrinking the number of threads or reducing the number of allowed CPUs, reduce the value of
max_nr_cidso expansion of CID allocation will preserve cache locality if the number of threads or allowed CPUs increase again.* Only re-use a
recent_cidif it is within themax_nr_cidupper bound, else find the first available CID.Fixes 7e019dcc470f ("sched: Improve cache locality of RSEQ concurrency IDs for intermittent workloads")Cc Peter Zijlstra (Intel) <[email protected]>Cc Marco Elver <[email protected]>Cc Ingo Molnar <[email protected]>Tested-by Gabriele Monaco <[email protected]>Signed-off-by Mathieu Desnoyers <[email protected]>Signed-off-by Gabriele Monaco <[email protected]>--- include/linux/mm_types.h | 7 ++++--- kernel/sched/sched.h | 25 ++++++++++++++++++++++--- 2 files changed, 26 insertions(+), 6 deletions(-)include/linux/mm_types.h +4
-3@@ -875,10 +875,11 @@ struct mm_struct {*/ unsigned int nr_cpus_allowed;/** -* @max_nr_cid: Maximum number of concurrency IDs allocated. +* @max_nr_cid: Maximum number of allowed concurrency +* IDs allocated. * -* Track the highest number of concurrency IDs allocated for the -* mm. +* Track the highest number of allowed concurrency IDs +* allocated for the mm. */ atomic_t max_nr_cid;/** kernel/sched/sched.h +22
-3@@ -3698,10 +3698,28 @@ static inline int __mm_cid_try_get(struct task_struct *t, struct mm_struct *mm) {struct cpumask *cidmask =mm_cidmask (mm);struct mm_cid __percpu *pcpu_cid = mm->pcpu_cid; -int cid =__this_cpu_read (pcpu_cid->recent_cid); +int cid, max_nr_cid, allowed_max_nr_cid; +/* +* After shrinking the number of threads or reducing the number +* of allowed cpus, reduce the value of max_nr_cid so expansion +* of cid allocation will preserve cache locality if the number +* of threads or allowed cpus increase again. +*/ + max_nr_cid =atomic_read (&mm->max_nr_cid); +while ((allowed_max_nr_cid =min_t (int,READ_ONCE (mm->nr_cpus_allowed), +atomic_read (&mm->mm_users))), + max_nr_cid > allowed_max_nr_cid) { +/* atomic_try_cmpxchg loads previous mm->max_nr_cid into max_nr_cid. */ +if (atomic_try_cmpxchg (&mm->max_nr_cid, &max_nr_cid, allowed_max_nr_cid)) { + max_nr_cid = allowed_max_nr_cid; +break ; + } + }/* Try to re-use recent cid. This improves cache locality. */ -if (!mm_cid_is_unset (cid) && !cpumask_test_and_set_cpu (cid, cidmask)) + cid =__this_cpu_read (pcpu_cid->recent_cid); +if (!mm_cid_is_unset (cid) && cid < max_nr_cid && + !cpumask_test_and_set_cpu (cid, cidmask))return cid;/* * Expand cid allocation if the maximum number of concurrency @@ -3709,8 +3727,9 @@ static inline int __mm_cid_try_get(struct task_struct *t, struct mm_struct *mm)* and number of threads. Expanding cid allocation as much as * possible improves cache locality. */ - cid =atomic_read (&mm->max_nr_cid); + cid = max_nr_cid;while (cid <READ_ONCE (mm->nr_cpus_allowed) && cid <atomic_read (&mm->mm_users)) { +/* atomic_try_cmpxchg loads previous mm->max_nr_cid into cid. */ if (!atomic_try_cmpxchg (&mm->max_nr_cid, &cid, cid +1 ))continue ;if (!cpumask_test_and_set_cpu (cid, cidmask))
Signature · 3 lines
Mathieu Desnoyers EfficiOS Inc. https://www.efficios.com
Peter Zijlstra
maintainerRe: [PATCH v6 1/3] sched: Compact RSEQ concurrency IDs with reduced threads and affinity
Quoted 7 lines · Mathieu Desnoyers
Quoted 2 lines · Gabriele Monaco
From: Mathieu Desnoyers <[email protected]>
Peter, Ingo, this patch has been ready for inclusion for a while. The rest of this series does not seem to be quite ready yet, but can we at least merge this patch into tip ?
Done; stuck it in queue/sched/urgent for the robots. If that passes I'll push it to tip.
[tip: sched/urgent] sched: Compact RSEQ concurrency IDs with reduced threads and affinity
In reply to Gabriele MonacoThe following commit has been merged into the sched/urgent branch of tip:
The following commit has been merged into the sched/urgent branch of tip:
Commit-ID: 02d954c0fdf91845169cdacc7405b120f90afe01 Gitweb: https://git.kernel.org/tip/02d954c0fdf91845169cdacc7405b120f90afe01 Author: Mathieu Desnoyers <[email protected]> AuthorDate: Mon, 10 Feb 2025 16:32:50 +01:00 Committer: Peter Zijlstra <[email protected]> CommitterDate: Tue, 18 Feb 2025 08:50:36 +01:00
sched: Compact RSEQ concurrency IDs with reduced threads and affinity
When a process reduces its number of threads or clears bits in its CPU affinity mask, the mm_cid allocation should eventually converge towards smaller values.
However, the change introduced by:
commit 7e019dcc470f ("sched: Improve cache locality of RSEQ concurrency IDs for intermittent workloads")
adds a per-mm/CPU recent_cid which is never unset unless a thread migrates.
This is a tradeoff between:
A) Preserving cache locality after a transition from many threads to few threads, or after reducing the hamming weight of the allowed CPU mask.
B) Making the mm_cid upper bounds wrt nr threads and allowed CPU mask easy to document and understand.
C) Allowing applications to eventually react to mm_cid compaction after reduction of the nr threads or allowed CPU mask, making the tracking of mm_cid compaction easier by shrinking it back towards 0 or not.
D) Making sure applications that periodically reduce and then increase again the nr threads or allowed CPU mask still benefit from good cache locality with mm_cid.
Introduce the following changes:
* After shrinking the number of threads or reducing the number of allowed CPUs, reduce the value of max_nr_cid so expansion of CID allocation will preserve cache locality if the number of threads or allowed CPUs increase again.
* Only re-use a recent_cid if it is within the max_nr_cid upper bound, else find the first available CID.
--- include/linux/mm_types.h | 7 ++++--- kernel/sched/sched.h | 25 ++++++++++++++++++++++--- 2 files changed, 26 insertions(+), 6 deletions(-)
include/linux/mm_types.h +4 -3
@@ -875,10 +875,11 @@ struct mm_struct {*/ unsigned int nr_cpus_allowed;/** -* @max_nr_cid: Maximum number of concurrency IDs allocated. +* @max_nr_cid: Maximum number of allowed concurrency +* IDs allocated. * -* Track the highest number of concurrency IDs allocated for the -* mm. +* Track the highest number of allowed concurrency IDs +* allocated for the mm. */ atomic_t max_nr_cid;/**
kernel/sched/sched.h +22 -3
@@ -3698,10 +3698,28 @@ static inline int __mm_cid_try_get(struct task_struct *t, struct mm_struct *mm) {struct cpumask *cidmask =mm_cidmask (mm);struct mm_cid __percpu *pcpu_cid = mm->pcpu_cid; -int cid =__this_cpu_read (pcpu_cid->recent_cid); +int cid, max_nr_cid, allowed_max_nr_cid; +/* +* After shrinking the number of threads or reducing the number +* of allowed cpus, reduce the value of max_nr_cid so expansion +* of cid allocation will preserve cache locality if the number +* of threads or allowed cpus increase again. +*/ + max_nr_cid =atomic_read (&mm->max_nr_cid); +while ((allowed_max_nr_cid =min_t (int,READ_ONCE (mm->nr_cpus_allowed), +atomic_read (&mm->mm_users))), + max_nr_cid > allowed_max_nr_cid) { +/* atomic_try_cmpxchg loads previous mm->max_nr_cid into max_nr_cid. */ +if (atomic_try_cmpxchg (&mm->max_nr_cid, &max_nr_cid, allowed_max_nr_cid)) { + max_nr_cid = allowed_max_nr_cid; +break ; + } + }/* Try to re-use recent cid. This improves cache locality. */ -if (!mm_cid_is_unset (cid) && !cpumask_test_and_set_cpu (cid, cidmask)) + cid =__this_cpu_read (pcpu_cid->recent_cid); +if (!mm_cid_is_unset (cid) && cid < max_nr_cid && + !cpumask_test_and_set_cpu (cid, cidmask))return cid;/* * Expand cid allocation if the maximum number of concurrency
@@ -3709,8 +3727,9 @@ static inline int __mm_cid_try_get(struct task_struct *t, struct mm_struct *mm)* and number of threads. Expanding cid allocation as much as * possible improves cache locality. */ - cid =atomic_read (&mm->max_nr_cid); + cid = max_nr_cid;while (cid <READ_ONCE (mm->nr_cpus_allowed) && cid <atomic_read (&mm->mm_users)) { +/* atomic_try_cmpxchg loads previous mm->max_nr_cid into cid. */ if (!atomic_try_cmpxchg (&mm->max_nr_cid, &cid, cid +1 ))continue ;if (!cpumask_test_and_set_cpu (cid, cidmask))
PATCH v6 2/3 sched: Move task_mm_cid_work to mm delayed work
In reply to Gabriele MonacoCurrently, the task_mm_cid_work function is called in a task work triggered by a scheduler tick to frequently compact the mm_cids of each process. This can delay the execution of the corresponding thread for the entire duration of the function, negatively affecting the response in case of real time tasks. In practice, we observe task_mm_cid_work increasing the latency of 30-35us on a 128 cores system, this order of magnitude is meaningful under PREEMPT_RT.
Run the task_mm_cid_work in a new delayed work connected to the mm_struct rather than in the task context before returning to userspace.
This delayed work is initialised while allocating the mm and disabled before freeing it, its execution is no longer triggered by scheduler ticks but run periodically based on the defined MM_CID_SCAN_DELAY.
The main advantage of this change is that the function can be offloaded to a different CPU and even preempted by RT tasks.
Moreover, this new behaviour could be more predictable with periodic tasks with short runtime, which may rarely run during a scheduler tick. Now, the work is always scheduled with the same periodicity for each mm (though the periodicity is not guaranteed due to interference from other tasks, but mm_cid compaction is mostly best effort).
To avoid excessively increased runtime, we quickly return from the function if we have no work to be done (i.e. no mm_cid is allocated). This is helpful for tasks that sleep for a long time, but also for terminated task. We are no longer following the process' state, hence the function continues to run after a process terminates but before its mm is freed.
--- include/linux/mm_types.h | 16 ++++++---- include/linux/sched.h | 1 - kernel/sched/core.c | 66 +++++----------------------------------- kernel/sched/sched.h | 7 ----- 4 files changed, 18 insertions(+), 72 deletions(-)
include/linux/mm_types.h +10 -6
@@ -861,12 +861,6 @@ struct mm_struct {* runqueue locks. */ struct mm_cid __percpu *pcpu_cid; -/* -* @mm_cid_next_scan: Next mm_cid scan (in jiffies). -* -* When the next mm_cid scan is due (in jiffies). -*/ -unsigned long mm_cid_next_scan;/** * @nr_cpus_allowed: Number of CPUs allowed for mm. *
@@ -889,6 +883,7 @@ struct mm_struct {* mm nr_cpus_allowed updates. */ raw_spinlock_t cpus_allowed_lock; +struct delayed_work mm_cid_work;#endif #ifdef CONFIG_MMU atomic_long_t pgtables_bytes;/* size of all page tables */
@@ -1180,11 +1175,16 @@ static inline void vma_iter_init(struct vma_iterator *vmi,#ifdef CONFIG_SCHED_MM_CID +#define SCHED_MM_CID_PERIOD_NS (100ULL * 1000000)/* 100ms */ +#define MM_CID_SCAN_DELAY 100/* 100ms */ +enum mm_cid_state {MM_CID_UNSET =-1U ,/* Unset state has lazy_put flag set. */ MM_CID_LAZY_PUT = (1U <<31 ), }; +extern void task_mm_cid_work (struct work_struct *work); +static inline bool mm_cid_is_unset (int cid) {return cid ==MM_CID_UNSET ;
@@ -1257,12 +1257,16 @@ static inline int mm_alloc_cid_noprof(struct mm_struct *mm, struct task_struct *if (!mm->pcpu_cid)return -ENOMEM ;mm_init_cid (mm, p); +INIT_DELAYED_WORK (&mm->mm_cid_work, task_mm_cid_work); +schedule_delayed_work (&mm->mm_cid_work, +msecs_to_jiffies (MM_CID_SCAN_DELAY ));return 0 ; }#define mm_alloc_cid (...) alloc_hooks(mm_alloc_cid_noprof(__VA_ARGS__))static inline void mm_destroy_cid (struct mm_struct *mm) { +disable_delayed_work_sync (&mm->mm_cid_work);free_percpu (mm->pcpu_cid); mm->pcpu_cid =NULL ; }
include/linux/sched.h +0 -1
@@ -1397,7 +1397,6 @@ struct task_struct {int last_mm_cid;/* Most recent cid in mm */ int migrate_from_cpu;int mm_cid_active;/* Whether cid bitmap is active */ -struct callback_head cid_work;#endif struct tlbflush_unmap_batch tlb_ubc;
kernel/sched/core.c +8 -58
95 lines not on this page · raw message
kernel/sched/sched.h +0 -7
@@ -3622,16 +3622,11 @@ extern void sched_dynamic_update(int mode);#ifdef CONFIG_SCHED_MM_CID -#define SCHED_MM_CID_PERIOD_NS (100ULL * 1000000)/* 100ms */ -#define MM_CID_SCAN_DELAY 100/* 100ms */ -extern raw_spinlock_t cid_lock;extern int use_cid_lock;extern void sched_mm_cid_migrate_from (struct task_struct *t);extern void sched_mm_cid_migrate_to (struct rq *dst_rq,struct task_struct *t); -extern void task_tick_mm_cid (struct rq *rq,struct task_struct *curr); -extern void init_sched_mm_cid (struct task_struct *t);static inline void __mm_cid_put (struct mm_struct *mm,int cid) {
@@ -3899,8 +3894,6 @@ static inline void switch_mm_cid(struct rq *rq,static inline void switch_mm_cid (struct rq *rq,struct task_struct *prev,struct task_struct *next) { }static inline void sched_mm_cid_migrate_from (struct task_struct *t) { }static inline void sched_mm_cid_migrate_to (struct rq *dst_rq,struct task_struct *t) { } -static inline void task_tick_mm_cid (struct rq *rq,struct task_struct *curr) { } -static inline void init_sched_mm_cid (struct task_struct *t) { }#endif /* !CONFIG_SCHED_MM_CID */ extern u64 avg_vruntime (struct cfs_rq *cfs_rq);
Signature · 1 line
2.48.1
kernel test robot
build botRe: [PATCH v6 2/3] sched: Move task_mm_cid_work to mm delayed work
kernel test robot noticed "WARNING:at_kernel/workqueue.c:#__queue_delayed_work" on:
Hello,
kernel test robot noticed "WARNING:at_kernel/workqueue.c:#__queue_delayed_work" on:
commit: 287adf9e9c1fa8a0e2b50ab1a1de3e4572a8ccd2 ("[PATCH v6 2/3] sched: Move task_mm_cid_work to mm delayed work")
url: https://github.com/intel-lab-lkp/linux/commits/Gabriele-Monaco/sched-Compact-RSEQ-concurrency-IDs-with-reduced-threads-and-affinity/20250210-233547
patch link: https://lore.kernel.org/all/[email protected]/
patch subject: [PATCH v6 2/3] sched: Move task_mm_cid_work to mm delayed work
in testcase: boot
config: x86_64-randconfig-004-20250211
compiler: clang-19
test machine: qemu-system-x86_64 -enable-kvm -cpu SandyBridge -smp 2 -m 16G
(please refer to attached dmesg/kmsg for entire log/backtrace)
If you fix the issue in a separate patch/commit (i.e. not just a new version of the same patch/commit), kindly add following tags
| Reported-by: kernel test robot <[email protected]>
| Closes: https://lore.kernel.org/oe-lkp/[email protected]
[ 2.640924][ T0] ------------[ cut here ]------------ [ 2.641646][ T0] WARNING: CPU: 0 PID: 0 at kernel/workqueue.c:2495 __queue_delayed_work (kernel/workqueue.c:2495 (discriminator 9)) [ 2.642874][ T0] Modules linked in: [ 2.643381][ T0] CPU: 0 UID: 0 PID: 0 Comm: swapper Not tainted 6.14.0-rc2-00002-g287adf9e9c1f #1 [ 2.644582][ T0] Hardware name: QEMU Standard PC (i440FX + PIIX, 1996), BIOS 1.16.2-debian-1.16.2-1 04/01/2014 [ 2.645943][ T0] RIP: 0010:__queue_delayed_work (kernel/workqueue.c:2495 (discriminator 9)) [ 2.646755][ T0] Code: 44 89 fe 4c 89 33 e8 6d 24 19 00 48 83 c4 08 5b 41 5c 41 5d 41 5e 41 5f 5d 31 c0 31 c9 31 ff 31 d2 31 f6 c3 e8 7f 87 25 00 90 <0f> 0b 90 e9 58 fd ff ff e8 71 87 25 00 90 0f 0b 90 e9 80 fd ff ff All code ======== 0: 44 89 fe mov %r15d,%esi 3: 4c 89 33 mov %r14,(%rbx) 6: e8 6d 24 19 00 call 0x192478 b: 48 83 c4 08 add $0x8,%rsp f: 5b pop %rbx 10: 41 5c pop %r12 12: 41 5d pop %r13 14: 41 5e pop %r14 16: 41 5f pop %r15 18: 5d pop %rbp 19: 31 c0 xor %eax,%eax 1b: 31 c9 xor %ecx,%ecx 1d: 31 ff xor %edi,%edi 1f: 31 d2 xor %edx,%edx 21: 31 f6 xor %esi,%esi 23: c3 ret 24: e8 7f 87 25 00 call 0x2587a8 29: 90 nop 2a:* 0f 0b ud2 <-- trapping instruction 2c: 90 nop 2d: e9 58 fd ff ff jmp 0xfffffffffffffd8a 32: e8 71 87 25 00 call 0x2587a8 37: 90 nop 38: 0f 0b ud2 3a: 90 nop 3b: e9 80 fd ff ff jmp 0xfffffffffffffdc0
Code starting with the faulting instruction
===========================================
0: 0f 0b ud2 2: 90 nop 3: e9 58 fd ff ff jmp 0xfffffffffffffd60 8: e8 71 87 25 00 call 0x25877e d: 90 nop e: 0f 0b ud2 10: 90 nop 11: e9 80 fd ff ff jmp 0xfffffffffffffd96 [ 2.649301][ T0] RSP: 0000:ffffffffab007d80 EFLAGS: 00010046 [ 2.650081][ T0] RAX: 0000000000000000 RBX: ffff888100090b98 RCX: 0000000000000000 [ 2.651084][ T0] RDX: 0000000000000000 RSI: 0000000000000000 RDI: 0000000000000000 [ 2.652078][ T0] RBP: ffffffffab007db0 R08: 0000000000000000 R09: 0000000000000000 [ 2.653077][ T0] R10: 0000000000000000 R11: 0000000000000000 R12: 0000000000000000 [ 2.654101][ T0] R13: 0000000000000040 R14: 0000000000000019 R15: 0000000000000040 [ 2.655112][ T0] FS: 0000000000000000(0000) GS:ffff8883af200000(0000) knlGS:0000000000000000 [ 2.656263][ T0] CS: 0010 DS: 0000 ES: 0000 CR0: 0000000080050033 [ 2.657103][ T0] CR2: ffff88843ffff000 CR3: 00000001d3617000 CR4: 00000000000000b0 [ 2.658128][ T0] DR0: 0000000000000000 DR1: 0000000000000000 DR2: 0000000000000000 [ 2.659147][ T0] DR3: 0000000000000000 DR6: 00000000fffe0ff0 DR7: 0000000000000400 [ 2.660143][ T0] Call Trace: [ 2.660553][ T0] <TASK> [ 2.660934][ T0] ? show_regs (arch/x86/kernel/dumpstack.c:479) [ 2.661524][ T0] ? __warn (kernel/panic.c:748) [ 2.662065][ T0] ? __queue_delayed_work (kernel/workqueue.c:2495 (discriminator 9)) [ 2.662796][ T0] ? __queue_delayed_work (kernel/workqueue.c:2495 (discriminator 9)) [ 2.663535][ T0] ? report_bug (lib/bug.c:?) [ 2.664119][ T0] ? __queue_delayed_work (kernel/workqueue.c:2495 (discriminator 9)) [ 2.664836][ T0] ? handle_bug (arch/x86/kernel/traps.c:285) [ 2.665404][ T0] ? exc_invalid_op (arch/x86/kernel/traps.c:309 (discriminator 1)) [ 2.665848][ T0] ? asm_exc_invalid_op (arch/x86/include/asm/idtentry.h:621) [ 2.666292][ T0] ? __queue_delayed_work (kernel/workqueue.c:2495 (discriminator 9)) [ 2.666762][ T0] queue_delayed_work_on (kernel/workqueue.c:?) [ 2.667215][ T0] mm_init (include/linux/workqueue.h:? include/linux/workqueue.h:817 include/linux/mm_types.h:1261 kernel/fork.c:1310) [ 2.667575][ T0] mm_alloc (kernel/fork.c:?) [ 2.667916][ T0] ? x86_64_start_reservations (usercopy_64.c:?) [ 2.668400][ T0] poking_init (arch/x86/mm/init.c:822) [ 2.668777][ T0] ? x86_64_start_reservations (usercopy_64.c:?) [ 2.669266][ T0] start_kernel (init/main.c:959) [ 2.669671][ T0] x86_64_start_reservations (usercopy_64.c:?) [ 2.670140][ T0] x86_64_start_kernel (arch/x86/kernel/head64.c:445 (discriminator 2)) [ 2.670574][ T0] common_startup_64 (arch/x86/kernel/head_64.S:421) [ 2.671018][ T0] </TASK> [ 2.671271][ T0] irq event stamp: 0 [ 2.671595][ T0] hardirqs last enabled at (0): 0x0 [ 2.672192][ T0] hardirqs last disabled at (0): 0x0 [ 2.672789][ T0] softirqs last enabled at (0): 0x0 [ 2.673386][ T0] softirqs last disabled at (0): 0x0 [ 2.674005][ T0] ---[ end trace 0000000000000000 ]---
The kernel config and materials to reproduce are available at:
https://download.01.org/0day-ci/archive/20250213/[email protected]
Signature · 2 lines
0-DAY CI Kernel Test Service https://github.com/intel/lkp-tests/wiki
Re: [PATCH v6 2/3] sched: Move task_mm_cid_work to mm delayed work
Quoted 5 lines · kernel test robot
kernel test robot noticed "WARNING:at_kernel/workqueue.c:#__queue_delayed_work" on:
[ 2.640924][ T0] ------------[ cut here ]------------
[ 2.641646][ T0] WARNING: CPU: 0 PID: 0 at kernel/workqueue.c:2495
Quoted 8 lines
__queue_delayed_work(kernel/workqueue.c:2495(discriminator 9)) [ 2.642874][ T0] Modules linked in:
[ 2.643381][ T0] CPU: 0 UID: 0 PID: 0 Comm: swapper Not tainted 6.14.0-rc2-00002-g287adf9e9c1f #1
[ 2.644582][ T0] Hardware name: QEMU Standard PC (i440FX + PIIX, 1996), BIOS 1.16.2-debian-1.16.2-1 04/01/2014[ 2.645943][ T0] RIP: 0010:__queue_delayed_work(
kernel/workqueue.c:2495(discriminator 9))
There seem to be major problems with this configuration, I'm trying to understand what's wrong but, for the time being, this patchset is not ready for inclusion.
Gabriele
Mathieu Desnoyers
maintainerRe: [PATCH v6 2/3] sched: Move task_mm_cid_work to mm delayed work
Quoted 15 lines · Gabriele Monaco
Quoted 5 lines · kernel test robot
kernel test robot noticed "WARNING:at_kernel/workqueue.c:#__queue_delayed_work" on:
[ 2.640924][ T0] ------------[ cut here ]------------
[ 2.641646][ T0] WARNING: CPU: 0 PID: 0 at kernel/workqueue.c:2495Quoted 8 lines
__queue_delayed_work(kernel/workqueue.c:2495(discriminator 9)) [ 2.642874][ T0] Modules linked in:
[ 2.643381][ T0] CPU: 0 UID: 0 PID: 0 Comm: swapper Not tainted 6.14.0-rc2-00002-g287adf9e9c1f #1
[ 2.644582][ T0] Hardware name: QEMU Standard PC (i440FX + PIIX, 1996), BIOS 1.16.2-debian-1.16.2-1 04/01/2014[ 2.645943][ T0] RIP: 0010:__queue_delayed_work(
kernel/workqueue.c:2495(discriminator 9))
Quoted 3 lines
There seem to be major problems with this configuration, I'm trying to understand what's wrong but, for the time being, this patchset is not ready for inclusion.
I think there is an issue with the order of init functions at boot.
poking_init() calls mm_alloc(), which ends up calling mm_init().
The WARN_ON() is about a NULL wq pointer, which I suspect happens if poking_init() is called before workqueue_init_early(), which allocates system_wq.
Indeed, in start_kernel(), poking_init() is called before workqueue_init_early().
I'm not sure what are the init order dependencies across subsystems here. There is the following order in start_kernel():
[...]
mm_core_init();
poking_init();
ftrace_init();
/* trace_printk can be enabled here */
early_trace_init();
/*
* Set up the scheduler prior starting any interrupts (such as the
* timer interrupt). Full topology setup happens at smp_init()
* time - but meanwhile we still have a functioning scheduler.
*/
sched_init();
if (WARN(!irqs_disabled(),
"Interrupts were enabled *very* early, fixing it\n"))
local_irq_disable();
radix_tree_init();
maple_tree_init();
/*
* Set up housekeeping before setting up workqueues to allow the unbound
* workqueue to take non-housekeeping into account.
*/
housekeeping_init();
/*
* Allow workqueue creation and work item queueing/cancelling
* early. Work item execution depends on kthreads and starts after
* workqueue_init().
*/
workqueue_init_early();[...]
So either we find a way to reorder this, or we make sure poking_init() does not require the workqueue.
Thanks,
Mathieu
Signature · 3 lines
Mathieu Desnoyers EfficiOS Inc. https://www.efficios.com
Re: [PATCH v6 2/3] sched: Move task_mm_cid_work to mm delayed work
Quoted 81 lines · Mathieu Desnoyers
Quoted 17 lines · Gabriele Monaco
Quoted 13 lines · kernel test robot
kernel test robot noticed "WARNING:at_kernel/workqueue.c:#__queue_delayed_work" on:
[ 2.640924][ T0] ------------[ cut here ]------------
[ 2.641646][ T0] WARNING: CPU: 0 PID: 0 at
kernel/workqueue.c:2495__queue_delayed_work(kernel/workqueue.c:2495(discriminator 9)) [ 2.642874][ T0] Modules linked in:
[ 2.643381][ T0] CPU: 0 UID: 0 PID: 0 Comm: swapper Not tainted
6.14.0-rc2-00002-g287adf9e9c1f #1
[ 2.644582][ T0] Hardware name: QEMU Standard PC (i440FX + PIIX, 1996), BIOS 1.16.2-debian-1.16.2-1 04/01/2014Quoted 2 lines
[ 2.645943][ T0] RIP: 0010:__queue_delayed_work(
kernel/workqueue.c:2495(discriminator 9))Quoted 5 lines
There seem to be major problems with this configuration, I'm trying to
understand what's wrong but, for the time being, this patchset is not
ready for inclusion.I think there is an issue with the order of init functions at boot.
poking_init()callsmm_alloc(), which ends up callingmm_init().The
WARN_ON()is about a NULL wq pointer, which I suspect happens ifpoking_init()is called beforeworkqueue_init_early(), which allocatessystem_wq.Indeed, in
start_kernel(),poking_init()is called beforeworkqueue_init_early().I'm not sure what are the init order dependencies across subsystems here.
There is the following order instart_kernel():[...]
mm_core_init();
poking_init();
ftrace_init();/*
trace_printkcan be enabled here */
early_trace_init();/*
* Set up the scheduler prior starting any interrupts (such as the
* timer interrupt). Full topology setup happens atsmp_init()
* time - but meanwhile we still have a functioning scheduler.
*/
sched_init();if (WARN(!irqs_disabled(),
"Interrupts were enabled *very* early, fixing it\n"))
local_irq_disable();radix_tree_init();
maple_tree_init();/*
* Set up housekeeping before setting up workqueues to allow the unbound
* workqueue to take non-housekeeping into account. */
housekeeping_init();/*
* Allow workqueue creation and work item queueing/cancelling
* early. Work item execution depends on kthreads and starts after
*workqueue_init().
*/
workqueue_init_early();
[...]
Quoted 8 lines
So either we find a way to reorder this, or we make sure
poking_init()
does not require the workqueue.Thanks,
Mathieu
Nice suggestion! That seems the culprit..
From the full dmesg of the failure I've seen there's also a problem with disabling the delayed work synchronously, since mmdrop cannot sleep if we are not in PREEMPT_RT.
I'm trying to come with some satisfactory solution for both, ideally:
1. the delayed work is not needed in early boot, we may have a better place where to start it
2. we can cancel the work asynchronously on mmdrop and abort it if the pcpu_cid is null, but it seems racy, perhaps there's a better place for that too
Thanks,
Gabriele
Mathieu Desnoyers
maintainerRe: [PATCH v6 2/3] sched: Move task_mm_cid_work to mm delayed work
In reply to Gabriele MonacoQuoted 15 lines · Gabriele Monaco
Quoted 5 lines · kernel test robot
kernel test robot noticed "WARNING:at_kernel/workqueue.c:#__queue_delayed_work" on:
[ 2.640924][ T0] ------------[ cut here ]------------
[ 2.641646][ T0] WARNING: CPU: 0 PID: 0 at kernel/workqueue.c:2495Quoted 8 lines
__queue_delayed_work(kernel/workqueue.c:2495(discriminator 9)) [ 2.642874][ T0] Modules linked in:
[ 2.643381][ T0] CPU: 0 UID: 0 PID: 0 Comm: swapper Not tainted 6.14.0-rc2-00002-g287adf9e9c1f #1
[ 2.644582][ T0] Hardware name: QEMU Standard PC (i440FX + PIIX, 1996), BIOS 1.16.2-debian-1.16.2-1 04/01/2014[ 2.645943][ T0] RIP: 0010:__queue_delayed_work(
kernel/workqueue.c:2495(discriminator 9))
Quoted 3 lines
There seem to be major problems with this configuration, I'm trying to understand what's wrong but, for the time being, this patchset is not ready for inclusion.
Patch 1/3 has been ready for a while though. Can we post it separately for inclusion ?
Thanks,
Mathieu
Quoted 3 lines
Gabriele
Signature · 3 lines
Mathieu Desnoyers EfficiOS Inc. https://www.efficios.com
Re: [PATCH v6 2/3] sched: Move task_mm_cid_work to mm delayed work
Quoted 24 lines · Mathieu Desnoyers
Quoted 17 lines · Gabriele Monaco
Quoted 13 lines · kernel test robot
kernel test robot noticed "WARNING:at_kernel/workqueue.c:#__queue_delayed_work" on:
[ 2.640924][ T0] ------------[ cut here ]------------
[ 2.641646][ T0] WARNING: CPU: 0 PID: 0 at
kernel/workqueue.c:2495__queue_delayed_work(kernel/workqueue.c:2495(discriminator 9)) [ 2.642874][ T0] Modules linked in:
[ 2.643381][ T0] CPU: 0 UID: 0 PID: 0 Comm: swapper Not tainted
6.14.0-rc2-00002-g287adf9e9c1f #1
[ 2.644582][ T0] Hardware name: QEMU Standard PC (i440FX + PIIX, 1996), BIOS 1.16.2-debian-1.16.2-1 04/01/2014Quoted 2 lines
[ 2.645943][ T0] RIP: 0010:__queue_delayed_work(
kernel/workqueue.c:2495(discriminator 9))Quoted 5 lines
There seem to be major problems with this configuration, I'm trying to
understand what's wrong but, for the time being, this patchset is not
ready for inclusion.
Quoted 4 lines
Patch 1/3 has been ready for a while though. Can we post it separately
for inclusion ?
I would say so, there's no need to delay it further.
Thanks,
Gabriele
Mathieu Desnoyers
maintainerRe: [PATCH v6 2/3] sched: Move task_mm_cid_work to mm delayed work
In reply to Gabriele MonacoQuoted 15 lines · Gabriele Monaco
Quoted 5 lines · kernel test robot
kernel test robot noticed "WARNING:at_kernel/workqueue.c:#__queue_delayed_work" on:
[ 2.640924][ T0] ------------[ cut here ]------------
[ 2.641646][ T0] WARNING: CPU: 0 PID: 0 at kernel/workqueue.c:2495Quoted 8 lines
__queue_delayed_work(kernel/workqueue.c:2495(discriminator 9)) [ 2.642874][ T0] Modules linked in:
[ 2.643381][ T0] CPU: 0 UID: 0 PID: 0 Comm: swapper Not tainted 6.14.0-rc2-00002-g287adf9e9c1f #1
[ 2.644582][ T0] Hardware name: QEMU Standard PC (i440FX + PIIX, 1996), BIOS 1.16.2-debian-1.16.2-1 04/01/2014[ 2.645943][ T0] RIP: 0010:__queue_delayed_work(
kernel/workqueue.c:2495(discriminator 9))
Quoted 3 lines
There seem to be major problems with this configuration, I'm trying to understand what's wrong but, for the time being, this patchset is not ready for inclusion.
I'm staring at this now, and I'm thinking we could do a simpler change that would solve your RT issues without having to introduce a dependency on workqueue.c.
So if the culprit is that task_mm_cid_work() runs for too long on large many-cpus systems, why not break it up into smaller iterations ?
So rather than iterating on "for_each_possible_cpu", we could simply break this down into iteration on at most N cpus, so:
tick #1: iteration on CPUs 0 .. N - 1
tick #2: iteration on CPUs N .. 2*N - 1
...
circling back to 0 when it reaches the number of possible cpus.
This N value could be configurable, e.g. CONFIG_RSEQ_CID_SCAN_BATCH, with a sane default. An RT system could decide to make that value lower.
Then all we need to do is remember which was that last observed cpu number in the mm struct, so the next tick picks up from there.
The main downside of this approach compared to scheduling delayed work in a workqueue is that it depends on having the mm be current when the scheduler tick happens. But perhaps this is something we could fix in a different way that does not add a dependency on workqueue. I'm not sure how though.
Thoughts ?
Thanks,
Mathieu
Signature · 3 lines
Mathieu Desnoyers EfficiOS Inc. https://www.efficios.com
Re: [PATCH v6 2/3] sched: Move task_mm_cid_work to mm delayed work
Quoted 58 lines · Mathieu Desnoyers
Quoted 17 lines · Gabriele Monaco
Quoted 13 lines · kernel test robot
kernel test robot noticed "WARNING:at_kernel/workqueue.c:#__queue_delayed_work" on:
[ 2.640924][ T0] ------------[ cut here ]------------
[ 2.641646][ T0] WARNING: CPU: 0 PID: 0 at
kernel/workqueue.c:2495__queue_delayed_work(kernel/workqueue.c:2495(discriminator 9)) [ 2.642874][ T0] Modules linked in:
[ 2.643381][ T0] CPU: 0 UID: 0 PID: 0 Comm: swapper Not tainted
6.14.0-rc2-00002-g287adf9e9c1f #1
[ 2.644582][ T0] Hardware name: QEMU Standard PC (i440FX + PIIX, 1996), BIOS 1.16.2-debian-1.16.2-1 04/01/2014Quoted 2 lines
[ 2.645943][ T0] RIP: 0010:__queue_delayed_work(
kernel/workqueue.c:2495(discriminator 9))Quoted 5 lines
There seem to be major problems with this configuration, I'm trying to
understand what's wrong but, for the time being, this patchset is not
ready for inclusion.I'm staring at this now, and I'm thinking we could do a simpler change
that would solve your RT issues without having to introduce a dependency
onworkqueue.c.So if the culprit is that
task_mm_cid_work()runs for too long on large
many-cpus systems, why not break it up into smaller iterations ?So rather than iterating on "
for_each_possible_cpu", we could simply break this down into iteration on at most N cpus, so:tick #1: iteration on CPUs 0 .. N - 1
tick #2: iteration on CPUs N .. 2*N - 1
...
circling back to 0 when it reaches the number of possible cpus.This N value could be configurable, e.g.
CONFIG_RSEQ_CID_SCAN_BATCH, with a sane default. An RT system could decide to make that value lower.Then all we need to do is remember which was that last observed cpu number in the mm struct, so the next tick picks up from there.
The main downside of this approach compared to scheduling delayed work in a workqueue is that it depends on having the mm be current when
the scheduler tick happens. But perhaps this is something we could fix
in a different way that does not add a dependency on workqueue. I'm not
sure how though.
Quoted 1 line
Thoughts ?
Mmh, that's indeed neat, what is not so good about this type of task work is that it's a pure latency, it will happen before scheduling the task and can't be interrupted.
The only acceptable latency is a bounded one and your idea is going in that direction.
As you mentioned, this will make the compaction of mm_cid even more rare and will likely have the test in 3/3 fail even more often, I'm not sure if this is necessarily a bad thing though, since mm_cid compaction is mainly aesthetic, so we could just increase the duration of the test or even add a busy loop inside to make the task more likely to run this compaction.
I gave a thought about this whole thing, don't take this too seriously, but what I see essentially flawed in this approach is:
1. task_works are set on tick
2. task_works are run returning to userspace
1. is the issue with frequency and 2. can be mitigated by your idea, but not essentially solved. What if we (also) did:
1+. set this task_work while switching in
2+. run this task_work while switching out to sleep (i.e. no preemption)
1+. would make sure all threads have this task_work scheduled at a certain point (perhaps a bit too much, but we have a periodicity check in place). 2+. can effectively run the task in a moment when it is not problematic for the real time response: on a preemptible kernel, as soon as a task with higher priority is ready to run, it will preempt the currently running one, the fact current is going to sleep willingly implies there's no higher priority task ready, so likely no task really caring about RT response is going to run after.
Not all tasks are ever going to sleep, so we must keep the original TWA_RESUME in the task_work, especially for those long-running or low- priority, both unlikely to be RT tasks.
I'm going to try a patch with this CONFIG_RSEQ_CID_SCAN_BATCH and tuning the test to pass. In the future we can see if those ideas make sense and perhaps bring them in.
Thanks,
Gabriele
PATCH v6 3/3 rseq/selftests: Add test for mm_cid compaction
In reply to Gabriele MonacoA task in the kernel (task_mm_cid_work) runs somewhat periodically to compact the mm_cid for each process. Add a test to validate that it runs correctly and timely.
The test spawns 1 thread pinned to each CPU, then each thread, including the main one, runs in short bursts for some time. During this period, the mm_cids should be spanning all numbers between 0 and nproc.
At the end of this phase, a thread with high enough mm_cid (>= nproc/2) is selected to be the new leader, all other threads terminate.
After some time, the only running thread should see 0 as mm_cid, if that doesn't happen, the compaction mechanism didn't work and the test fails.
The test never fails if only 1 core is available, in which case, we cannot test anything as the only available mm_cid is 0.
--- tools/testing/selftests/rseq/.gitignore | 1 + tools/testing/selftests/rseq/Makefile | 2 +- .../selftests/rseq/mm_cid_compaction_test.c | 200 ++++++++++++++++++ 3 files changed, 202 insertions(+), 1 deletion(-) create mode 100644 tools/testing/selftests/rseq/mm_cid_compaction_test.c
tools/testing/selftests/rseq/.gitignore +1 -0
@@ -3,6 +3,7 @@ basic_percpu_ops_test basic_percpu_ops_mm_cid_test basic_test basic_rseq_op_test +mm_cid_compaction_test param_test param_test_benchmark param_test_compare_twice
tools/testing/selftests/rseq/Makefile +1 -1
@@ -16,7 +16,7 @@ OVERRIDE_TARGETS = 1 TEST_GEN_PROGS = basic_test basic_percpu_ops_test basic_percpu_ops_mm_cid_test param_test \ param_test_benchmark param_test_compare_twice param_test_mm_cid \ - param_test_mm_cid_benchmark param_test_mm_cid_compare_twice + param_test_mm_cid_benchmark param_test_mm_cid_compare_twice mm_cid_compaction_test TEST_GEN_PROGS_EXTENDED = librseq.so
tools/testing/selftests/rseq/mm_cid_compaction_test.c new file +200 -0
200 lines not on this page · raw message
Signature · 1 line
2.48.1
Mathieu Desnoyers
maintainerQuoted 6 lines · Gabriele Monaco
This patchset moves the
task_mm_cid_workto a preemptible and migratable context. This reduces the impact of this task to the scheduling latency of real time tasks.
The change makes the recurrence of the task a bit more predictable. We also add optimisation and fixes to make sure thetask_mm_cid_workworks as intended.
Ingo, Peter, this series is ready to be pulled into tip.
Thanks!
Mathieu
Quoted 84 lines
The behaviour causing latency was introduced in commit
223baf9d17f2("sched: Fix performance regression introduced bymm_cid") which introduced a task work tied to the scheduler tick.
That approach presents two possible issues:
* the task work runs before returning to user and causes, in fact, a scheduling latency (with order of magnitude significant inPREEMPT_RT)
* periodic tasks with short runtime are less likely to run during the tick, hence they might not run the task work at allPatch 1 allows the
mm_cidsto be actually compacted when a process reduces its number of threads, which was not the case since the samemm_cidswere reused to improve cache locality, more details in [4].Patch 2 contains the main changes, removing the
task_workon the scheduler tick and using adelayed_workinstead. Additionally, we terminate the call immediately if we see that nomm_cidis actually active, which could happen on processes sleeping for long time or which exited but whose mm has not been freed yet.Patch 3 adds a selftest to validate the functionality of the
task_mm_cid_work(i.e. to compact themm_cids). The test fails if patch 1 is not applied and is flaky without patch 2. We expect it to always pass with the entire patchset applied.Changes since V5:
* PunctuationChanges since V4 [1]:
* Fixes on the selftest
* Polished memory allocation and cleanup
* Handle the test failure in mainChanges since V3 [2]:
* Fixes on the selftest
* Minor style issues in comments and indentation
* Use of perror where possible
* Add a barrier to align threads execution
* Improve test failure and error handlingChanges since V2 [3]:
* Change the order of the patches
* Merge patches changing the maindelayed_worklogic
* Improved self-test to spawn 1 less thread and use the main one insteadChanges since V1 [4]:
* Re-arm thedelayed_workat each invocation
* Cancel the work synchronously at mmdrop
* Remove next scan fields and completely rely on thedelayed_work
* Shrinkmm_cidallocation with nr thread/affinity (Mathieu Desnoyers)
* Add self testOverhead comparison in [4]
[1] - https://lore.kernel.org/lkml/[email protected]
[2] - https://lore.kernel.org/lkml/[email protected]
[3] - https://lore.kernel.org/lkml/[email protected]
[4] - https://lore.kernel.org/lkml/[email protected]To: Mathieu Desnoyers <[email protected]>
To: Peter Zijlstra <[email protected]>
To: Ingo Molnar <[email protected]>
To: Paul E. McKenney <[email protected]>
To: Shuah Khan <[email protected]>Gabriele Monaco (2):
sched: Movetask_mm_cid_workto mm delayed work rseq/selftests: Add test formm_cidcompactionMathieu Desnoyers (1):
sched: Compact RSEQ concurrency IDs with reduced threads and affinityinclude/linux/mm_types.h | 23 +- include/linux/sched.h | 1 - kernel/sched/core.c | 66 +----- kernel/sched/sched.h | 32 ++- tools/testing/selftests/rseq/.gitignore | 1 + tools/testing/selftests/rseq/Makefile | 2 +- .../selftests/rseq/mm_cid_compaction_test.c | 200 ++++++++++++++++++ 7 files changed, 246 insertions(+), 79 deletions(-)create mode 100644
tools/testing/selftests/rseq/mm_cid_compaction_test.cbase-commit:
a64dcfb451e254085a7daee5fe51bf22959d52d3
Signature · 3 lines
Mathieu Desnoyers EfficiOS Inc. https://www.efficios.com