Searched refs:dsq_list (Results 1 – 4 of 4) sorted by relevance
| /linux/init/ |
| H A D | init_task.c | 145 .dsq_list.node = LIST_HEAD_INIT(init_task.scx.dsq_list.node),
|
| /linux/kernel/sched/ext/ |
| H A D | ext.c | 526 list_node = &cur->scx.dsq_list.node; in nldsq_next_task() 544 return container_of(dsq_lnode, struct task_struct, scx.dsq_list); in nldsq_next_task() 576 p = container_of(cursor, struct task_struct, scx.dsq_list); in nldsq_cursor_next_task() 585 list_move_tail(&cursor->node, &p->scx.dsq_list.node); in nldsq_cursor_next_task() 587 list_move(&cursor->node, &p->scx.dsq_list.node); in nldsq_cursor_next_task() 1260 list_add(&p->scx.dsq_list.node, &dsq->list); in dsq_insert_head() 1270 q = container_of(node, struct task_struct, scx.dsq_list); in dsq_insert_head() 1277 list_add(&p->scx.dsq_list.node, pos); in dsq_insert_head() 1616 WARN_ON_ONCE(p->scx.dsq || !list_empty(&p->scx.dsq_list.node)); in scx_dispatch_enqueue() 1678 list_add(&p->scx.dsq_list.node, &prev->scx.dsq_list.node); in scx_dispatch_enqueue() [all …]
|
| H A D | sub.c | 482 scx.dsq_list.node); in scx_rescue_check_overload() 555 scx.dsq_list.node); in scx_rescue_timerfn() 593 list_for_each_entry_safe(p, n, &rq->scx.rescue.dsq.list, scx.dsq_list.node) { in scx_rescue_flush() 795 list_for_each_entry_safe(p, n, &rq->scx.reject_dsq.list, scx.dsq_list.node) { in scx_reenq_reject() 807 list_add_tail(&p->scx.dsq_list.node, &tasks); in scx_reenq_reject() 810 list_for_each_entry_safe(p, n, &tasks, scx.dsq_list.node) { in scx_reenq_reject() 811 list_del_init(&p->scx.dsq_list.node); in scx_reenq_reject()
|
| /linux/include/linux/sched/ |
| H A D | ext.h | 199 struct scx_dsq_list_node dsq_list; /* dispatch order */ member
|