Home
last modified time | relevance | path

Searched refs:blkd_tasks (Results 1 – 6 of 6) sorted by relevance

/Linux-v5.15/kernel/rcu/
Dtree_plugin.h187 list_add(&t->rcu_node_entry, &rnp->blkd_tasks); in rcu_preempt_ctxt_queue()
205 list_add_tail(&t->rcu_node_entry, &rnp->blkd_tasks); in rcu_preempt_ctxt_queue()
442 if (np == &rnp->blkd_tasks) in rcu_next_node_entry()
453 return !list_empty(&rnp->blkd_tasks); in rcu_preempt_has_tasks()
691 WRITE_ONCE(rnp->gp_tasks, rnp->blkd_tasks.next); in rcu_preempt_check_blocked_tasks()
790 list_for_each(lhp, &rnp->blkd_tasks) { in dump_blkd_tasks()
979 WARN_ON_ONCE(!list_empty(&rnp->blkd_tasks)); in dump_blkd_tasks()
Dtree_exp.h376 WRITE_ONCE(rnp->exp_tasks, rnp->blkd_tasks.next); in sync_rcu_exp_select_node_cpus()
713 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) { in rcu_print_task_exp_stall()
Dtree.h86 struct list_head blkd_tasks; member
Dtree_stall.h221 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) { in rcu_print_detail_task_stall_rnp()
277 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) { in rcu_print_task_stall()
Dtree.c4529 INIT_LIST_HEAD(&rnp->blkd_tasks); in rcu_init_one()
/Linux-v5.15/Documentation/RCU/Design/Data-Structures/
DData-Structures.rst493 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