* [PATCH 2/5] sched_ext: Add comments to scx_bypass() for bypass depth semantics
@ 2026-03-06 12:48 zhidao su
0 siblings, 0 replies; 2+ messages in thread
From: zhidao su @ 2026-03-06 12:48 UTC (permalink / raw)
To: tj, sched-ext, linux-kernel
Cc: void, arighi, changwoo, linux-kselftest, Su Zhidao
From: Su Zhidao <suzhidao@xiaomi.com>
The bypass depth counter (scx_bypass_depth) uses WRITE_ONCE/READ_ONCE
to communicate that it can be observed locklessly from IRQ context, even
though modifications are serialized by bypass_lock. The existing code did
not explain this pattern or the re-queue loop's role in propagating the
bypass state change to all CPUs.
Add inline comments to clarify:
- Why bypass_depth uses WRITE_ONCE/READ_ONCE despite lock protection
- How the dequeue/enqueue cycle propagates bypass state to all per-CPU queues
Signed-off-by: Su Zhidao <suzhidao@xiaomi.com>
---
kernel/sched/ext.c | 12 ++++++++++++
1 file changed, 12 insertions(+)
diff --git a/kernel/sched/ext.c b/kernel/sched/ext.c
index 56ff5874af94..053d99c58802 100644
--- a/kernel/sched/ext.c
+++ b/kernel/sched/ext.c
@@ -4229,6 +4229,14 @@ static void scx_bypass(bool bypass)
if (bypass) {
u32 intv_us;
+ /*
+ * Increment bypass depth. Only the first caller (depth 0->1)
+ * needs to set up the bypass state; subsequent callers just
+ * increment the counter and return. The depth counter is
+ * protected by bypass_lock but READ_ONCE/WRITE_ONCE are used
+ * to communicate that the value can be observed locklessly
+ * (e.g., from scx_bypass_lb_timerfn() in softirq context).
+ */
WRITE_ONCE(scx_bypass_depth, scx_bypass_depth + 1);
WARN_ON_ONCE(scx_bypass_depth <= 0);
if (scx_bypass_depth != 1)
@@ -4263,6 +4271,10 @@ static void scx_bypass(bool bypass)
*
* This function can't trust the scheduler and thus can't use
* cpus_read_lock(). Walk all possible CPUs instead of online.
+ *
+ * The dequeue/enqueue cycle forces tasks through the updated code
+ * paths: in bypass mode, do_enqueue_task() routes to the per-CPU
+ * bypass DSQ instead of calling ops.enqueue().
*/
for_each_possible_cpu(cpu) {
struct rq *rq = cpu_rq(cpu);
--
2.43.0
^ permalink raw reply [flat|nested] 2+ messages in thread* [PATCH 0/5] sched_ext: bypass state machine cleanup and selftest
@ 2026-03-06 14:03 zhidao su
2026-03-06 14:03 ` [PATCH 2/5] sched_ext: Add comments to scx_bypass() for bypass depth semantics zhidao su
0 siblings, 1 reply; 2+ messages in thread
From: zhidao su @ 2026-03-06 14:03 UTC (permalink / raw)
To: tj, sched-ext, linux-kernel
Cc: void, arighi, changwoo, linux-kselftest, Su Zhidao
From: Su Zhidao <suzhidao@xiaomi.com>
This series does a small cleanup pass on the sched_ext bypass code path
and adds a selftest for the bypass mechanism.
Patch 1 removes SCX_OPS_HAS_CGROUP_WEIGHT, which was marked deprecated
in 6.15 with a "will be removed on 6.18" comment. We are now past that
point.
Patches 2-3 improve the bypass code in ext.c: add inline comments
explaining the bypass depth counter semantics and the dequeue/enqueue
re-queue loop, and replace rcu_dereference_all() with the more precise
rcu_dereference_bh() in scx_bypass_lb_timerfn() which runs in softirq
context.
Patch 4 adds a selftest that verifies forward progress under bypass
mode: worker processes are spawned while the scheduler is active, then
bpf_link__destroy() is called (triggering bypass), and the test confirms
all workers complete successfully.
Patch 5 adds a comment to the scx_bypass_depth declaration noting its
planned migration into struct scx_sched.
Tested on 6.18.7 with CONFIG_SCHED_CLASS_EXT=y; all existing selftests
pass.
Su Zhidao (5):
sched_ext: Remove deprecated SCX_OPS_HAS_CGROUP_WEIGHT flag
sched_ext: Add comments to scx_bypass() for bypass depth semantics
sched_ext: Use rcu_dereference_bh() in scx_bypass_lb_timerfn()
sched_ext/selftests: Add bypass mode operational test
sched_ext: Document scx_bypass_depth migration path
kernel/sched/ext.c | 29 ++++-
kernel/sched/ext_internal.h | 8 +-
.../sched_ext/include/scx/enum_defs.autogen.h | 1 -
tools/sched_ext/scx_flatcg.bpf.c | 2 +-
tools/testing/selftests/sched_ext/Makefile | 1 +
.../testing/selftests/sched_ext/bypass.bpf.c | 32 ++++++
tools/testing/selftests/sched_ext/bypass.c | 105 ++++++++++++++++++
7 files changed, 165 insertions(+), 13 deletions(-)
create mode 100644 tools/testing/selftests/sched_ext/bypass.bpf.c
create mode 100644 tools/testing/selftests/sched_ext/bypass.c
--
2.43.0
^ permalink raw reply [flat|nested] 2+ messages in thread
* [PATCH 2/5] sched_ext: Add comments to scx_bypass() for bypass depth semantics
2026-03-06 14:03 [PATCH 0/5] sched_ext: bypass state machine cleanup and selftest zhidao su
@ 2026-03-06 14:03 ` zhidao su
0 siblings, 0 replies; 2+ messages in thread
From: zhidao su @ 2026-03-06 14:03 UTC (permalink / raw)
To: tj, sched-ext, linux-kernel
Cc: void, arighi, changwoo, linux-kselftest, Su Zhidao
From: Su Zhidao <suzhidao@xiaomi.com>
The bypass depth counter (scx_bypass_depth) uses WRITE_ONCE/READ_ONCE
to communicate that it can be observed locklessly from IRQ context, even
though modifications are serialized by bypass_lock. The existing code did
not explain this pattern or the re-queue loop's role in propagating the
bypass state change to all CPUs.
Add inline comments to clarify:
- Why bypass_depth uses WRITE_ONCE/READ_ONCE despite lock protection
- How the dequeue/enqueue cycle propagates bypass state to all per-CPU queues
Signed-off-by: Su Zhidao <suzhidao@xiaomi.com>
---
kernel/sched/ext.c | 12 ++++++++++++
1 file changed, 12 insertions(+)
diff --git a/kernel/sched/ext.c b/kernel/sched/ext.c
index 56ff5874af94..053d99c58802 100644
--- a/kernel/sched/ext.c
+++ b/kernel/sched/ext.c
@@ -4229,6 +4229,14 @@ static void scx_bypass(bool bypass)
if (bypass) {
u32 intv_us;
+ /*
+ * Increment bypass depth. Only the first caller (depth 0->1)
+ * needs to set up the bypass state; subsequent callers just
+ * increment the counter and return. The depth counter is
+ * protected by bypass_lock but READ_ONCE/WRITE_ONCE are used
+ * to communicate that the value can be observed locklessly
+ * (e.g., from scx_bypass_lb_timerfn() in softirq context).
+ */
WRITE_ONCE(scx_bypass_depth, scx_bypass_depth + 1);
WARN_ON_ONCE(scx_bypass_depth <= 0);
if (scx_bypass_depth != 1)
@@ -4263,6 +4271,10 @@ static void scx_bypass(bool bypass)
*
* This function can't trust the scheduler and thus can't use
* cpus_read_lock(). Walk all possible CPUs instead of online.
+ *
+ * The dequeue/enqueue cycle forces tasks through the updated code
+ * paths: in bypass mode, do_enqueue_task() routes to the per-CPU
+ * bypass DSQ instead of calling ops.enqueue().
*/
for_each_possible_cpu(cpu) {
struct rq *rq = cpu_rq(cpu);
--
2.43.0
^ permalink raw reply [flat|nested] 2+ messages in thread
end of thread, other threads:[~2026-03-06 14:03 UTC | newest]
Thread overview: 2+ messages (download: mbox.gz / follow: Atom feed)
-- links below jump to the message on this page --
2026-03-06 12:48 [PATCH 2/5] sched_ext: Add comments to scx_bypass() for bypass depth semantics zhidao su
2026-03-06 14:03 [PATCH 0/5] sched_ext: bypass state machine cleanup and selftest zhidao su
2026-03-06 14:03 ` [PATCH 2/5] sched_ext: Add comments to scx_bypass() for bypass depth semantics zhidao su
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox
all inboxes | Powered by JetHome®