Searched refs:blkd_tasks (Results 1 – 7 of 7) sorted by relevance
| /linux-6.1.9/kernel/rcu/ |
| D | tree_plugin.h | 185 list_add(&t->rcu_node_entry, &rnp->blkd_tasks); in rcu_preempt_ctxt_queue()
203 list_add_tail(&t->rcu_node_entry, &rnp->blkd_tasks); in rcu_preempt_ctxt_queue()
444 if (np == &rnp->blkd_tasks) in rcu_next_node_entry()
455 return !list_empty(&rnp->blkd_tasks); in rcu_preempt_has_tasks()
701 WRITE_ONCE(rnp->gp_tasks, rnp->blkd_tasks.next); in rcu_preempt_check_blocked_tasks()
796 list_for_each(lhp, &rnp->blkd_tasks) { in dump_blkd_tasks()
995 WARN_ON_ONCE(!list_empty(&rnp->blkd_tasks)); in dump_blkd_tasks()
|
| D | tasks.h | 1480 LIST_HEAD(blkd_tasks); in rcu_tasks_trace_pregp_step()
1512 list_splice_init(&rtpcp->rtp_blkd_tasks, &blkd_tasks); in rcu_tasks_trace_pregp_step()
1513 while (!list_empty(&blkd_tasks)) { in rcu_tasks_trace_pregp_step()
1515 t = list_first_entry(&blkd_tasks, struct task_struct, trc_blkd_node); in rcu_tasks_trace_pregp_step()
|
| D | tree.h | 89 struct list_head blkd_tasks; member
|
| D | tree_exp.h | 376 WRITE_ONCE(rnp->exp_tasks, rnp->blkd_tasks.next); in __sync_rcu_exp_select_node_cpus()
806 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) { in rcu_print_task_exp_stall()
|
| D | tree_stall.h | 249 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) { in rcu_print_detail_task_stall_rnp()
305 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) { in rcu_print_task_stall()
|
| D | tree.c | 4559 INIT_LIST_HEAD(&rnp->blkd_tasks); in rcu_init_one()
|
| /linux-6.1.9/Documentation/RCU/Design/Data-Structures/ |
| D | Data-Structures.rst | 493 1 struct list_head blkd_tasks;
498 The ``->blkd_tasks`` field is a list header for the list of blocked and
502 ``->blkd_tasks`` list for the leaf ``rcu_node`` structure corresponding
514 removes itself from the ``->blkd_tasks`` list, then that task must
|