tools/sched_ext/scx_sdt.bpf.c

235

int mark_nodes_avail(sdt_desc_t *lv_desc[SDT_TASK_LEVELS], __u64 lv_pos[SDT_TASK_LEVELS])

tools/sched_ext/scx_sdt.bpf.c

241

for (u = zero; u < SDT_TASK_LEVELS && can_loop; u++) {

tools/sched_ext/scx_sdt.bpf.c

242

level = SDT_TASK_LEVELS - 1 - u;

tools/sched_ext/scx_sdt.bpf.c

267

sdt_desc_t *lv_desc[SDT_TASK_LEVELS];

tools/sched_ext/scx_sdt.bpf.c

273

__u64 lv_pos[SDT_TASK_LEVELS];

tools/sched_ext/scx_sdt.bpf.c

285

for (level = zero; level < SDT_TASK_LEVELS && can_loop; level++) {

tools/sched_ext/scx_sdt.bpf.c

291

for (level = zero; level < SDT_TASK_LEVELS && can_loop; level++) {

tools/sched_ext/scx_sdt.bpf.c

292

shift = (SDT_TASK_LEVELS - 1 - level) * SDT_TASK_ENTS_PER_PAGE_SHIFT;

tools/sched_ext/scx_sdt.bpf.c

298

if (level == SDT_TASK_LEVELS - 1)

tools/sched_ext/scx_sdt.bpf.c

399

sdt_desc_t *lv_desc[SDT_TASK_LEVELS];

tools/sched_ext/scx_sdt.bpf.c

403

__u64 lv_pos[SDT_TASK_LEVELS];

tools/sched_ext/scx_sdt.bpf.c

408

for (level = zero; level < SDT_TASK_LEVELS && can_loop; level++) {

tools/sched_ext/scx_sdt.bpf.c

426

if (level == SDT_TASK_LEVELS - 1)

tools/sched_ext/scx_sdt.bpf.c

448

bpf_for(u, 0, SDT_TASK_LEVELS) {

tools/sched_ext/scx_sdt.bpf.c

449

level = SDT_TASK_LEVELS - 1 - u;