1289 		list_node = &cur->scx.dsq_list.node;  in nldsq_next_task()
1304 					 node);  in nldsq_next_task()
1857 	WARN_ON_ONCE(p->scx.dsq || !list_empty(&p->scx.dsq_list.node));  in dispatch_enqueue()
1910 			list_add(&p->scx.dsq_list.node, &prev->scx.dsq_list.node);  in dispatch_enqueue()
1912 			list_add(&p->scx.dsq_list.node, &dsq->list);  in dispatch_enqueue()
1921 			list_add(&p->scx.dsq_list.node, &dsq->list);  in dispatch_enqueue()
1923 			list_add_tail(&p->scx.dsq_list.node, &dsq->list);  in dispatch_enqueue()
1970 	WARN_ON_ONCE(list_empty(&p->scx.dsq_list.node));  in task_unlink_from_dsq()
1978 	list_del_init(&p->scx.dsq_list.node);  in task_unlink_from_dsq()
1992 		if (unlikely(!list_empty(&p->scx.dsq_list.node)))  in dispatch_dequeue()
1993 			list_del_init(&p->scx.dsq_list.node);  in dispatch_dequeue()
2024 		WARN_ON_ONCE(!list_empty(&p->scx.dsq_list.node));  in dispatch_dequeue()
2132 		WARN_ON_ONCE(p->scx.dsq || !list_empty(&p->scx.dsq_list.node));  in direct_dispatch()
2133 		list_add_tail(&p->scx.dsq_list.node,  in direct_dispatch()
2442 		list_add(&p->scx.dsq_list.node, &dst_dsq->list);  in move_local_task_to_local_dsq()
2444 		list_add_tail(&p->scx.dsq_list.node, &dst_dsq->list);  in move_local_task_to_local_dsq()
2763 	int node = cpu_to_node(cpu_of(rq));  in consume_global_dsq()  local
2765 	return consume_dispatch_q(rq, global_dsqs[node]);  in consume_global_dsq()
3123 				struct task_struct, scx.dsq_list.node))) {  in process_ddsp_deferred_locals()
3126 		list_del_init(&p->scx.dsq_list.node);  in process_ddsp_deferred_locals()
3281 					struct task_struct, scx.dsq_list.node);  in first_local_task()
3772 	INIT_LIST_HEAD(&scx->dsq_list.node);  in init_scx_entity()
4163 static struct scx_dispatch_q *create_dsq(u64 dsq_id, int node)  in create_dsq()  argument
4171 	dsq = kmalloc_node(sizeof(*dsq), GFP_KERNEL, node);  in create_dsq()
5263 	int i, cpu, node, ret;  in scx_ops_enable()  local
5300 		for_each_node_state(node, N_POSSIBLE) {  in scx_ops_enable()
5303 			dsq = kzalloc_node(sizeof(*dsq), GFP_KERNEL, node);  in scx_ops_enable()
5305 				for_each_node_state(node, N_POSSIBLE)  in scx_ops_enable()
5306 					kfree(dsqs[node]);  in scx_ops_enable()
5313 			dsqs[node] = dsq;  in scx_ops_enable()
6614 				 scx.dsq_list.node) {  in scx_bpf_reenqueue_local()
6634 		list_add_tail(&p->scx.dsq_list.node, &tasks);  in scx_bpf_reenqueue_local()
6637 	list_for_each_entry_safe(p, n, &tasks, scx.dsq_list.node) {  in scx_bpf_reenqueue_local()
6638 		list_del_init(&p->scx.dsq_list.node);  in scx_bpf_reenqueue_local()
6667 __bpf_kfunc s32 scx_bpf_create_dsq(u64 dsq_id, s32 node)  in scx_bpf_create_dsq()  argument
6669 	if (unlikely(node >= (int)nr_node_ids ||  in scx_bpf_create_dsq()
6670 		     (node < 0 && node != NUMA_NO_NODE)))  in scx_bpf_create_dsq()
6672 	return PTR_ERR_OR_ZERO(create_dsq(dsq_id, node));  in scx_bpf_create_dsq()
6843 	INIT_LIST_HEAD(&kit->cursor.node);  in bpf_iter_scx_dsq_new()
6868 	if (list_empty(&kit->cursor.node))  in bpf_iter_scx_dsq_next()
6884 			list_move_tail(&kit->cursor.node, &p->scx.dsq_list.node);  in bpf_iter_scx_dsq_next()
6886 			list_move(&kit->cursor.node, &p->scx.dsq_list.node);  in bpf_iter_scx_dsq_next()
6888 		list_del_init(&kit->cursor.node);  in bpf_iter_scx_dsq_next()
6909 	if (!list_empty(&kit->cursor.node)) {  in bpf_iter_scx_dsq_destroy()
6913 		list_del_init(&kit->cursor.node);  in bpf_iter_scx_dsq_destroy()