Home
last modified time | relevance | path

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

/linux/kernel/rcu/
H A Dtree_plugin.h196 list_add(&t->rcu_node_entry, &rnp->blkd_tasks); in rcu_preempt_ctxt_queue()
214 list_add_tail(&t->rcu_node_entry, &rnp->blkd_tasks); in rcu_preempt_ctxt_queue()
458 if (np == &rnp->blkd_tasks) in rcu_next_node_entry()
469 return !list_empty(&rnp->blkd_tasks); in rcu_preempt_has_tasks()
820 WRITE_ONCE(rnp->gp_tasks, rnp->blkd_tasks.next); in rcu_preempt_check_blocked_tasks()
913 list_for_each(lhp, &rnp->blkd_tasks) { in dump_blkd_tasks()
1128 WARN_ON_ONCE(!list_empty(&rnp->blkd_tasks)); in dump_blkd_tasks()
H A Dtree_exp.h150 WRITE_ONCE(rnp->exp_tasks, rnp->blkd_tasks.next); in sync_exp_reset_tree()
829 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) { in rcu_print_task_exp_stall()
856 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) { in rcu_exp_print_detail_task_stall_rnp()
H A Dtree.h88 struct list_head blkd_tasks; member
H A Dtree_stall.h286 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) { in rcu_print_detail_task_stall_rnp()
342 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) { in rcu_print_task_stall()
H A Dtree.c4784 INIT_LIST_HEAD(&rnp->blkd_tasks); in rcu_init_one()
/linux/Documentation/RCU/Design/Data-Structures/
H A DData-Structures.rst526 1 struct list_head blkd_tasks;
531 The ``->blkd_tasks`` field is a list header for the list of blocked and
535 ``->blkd_tasks`` list for the leaf ``rcu_node`` structure corresponding
547 removes itself from the ``->blkd_tasks`` list, then that task must