Home
last modified time | relevance | path

Searched refs:blkd_tasks (Results 1 – 7 of 7) 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()
457 if (np == &rnp->blkd_tasks) in rcu_next_node_entry()
468 return !list_empty(&rnp->blkd_tasks); in rcu_preempt_has_tasks()
714 WRITE_ONCE(rnp->gp_tasks, rnp->blkd_tasks.next); in rcu_preempt_check_blocked_tasks()
809 list_for_each(lhp, &rnp->blkd_tasks) { in dump_blkd_tasks()
1008 WARN_ON_ONCE(!list_empty(&rnp->blkd_tasks)); in dump_blkd_tasks()
H A Dtree_exp.h395 WRITE_ONCE(rnp->exp_tasks, rnp->blkd_tasks.next); in __sync_rcu_exp_select_node_cpus()
798 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) { in rcu_print_task_exp_stall()
825 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) { in rcu_exp_print_detail_task_stall_rnp()
H A Dtasks.h1797 LIST_HEAD(blkd_tasks); in rcu_tasks_trace_pregp_step()
1839 list_splice_init(&rtpcp->rtp_blkd_tasks, &blkd_tasks); in rcu_tasks_trace_pregp_step()
1840 while (!list_empty(&blkd_tasks)) { in rcu_tasks_trace_pregp_step()
1842 t = list_first_entry(&blkd_tasks, struct task_struct, trc_blkd_node); in rcu_tasks_trace_pregp_step()
H A Dtree.h88 struct list_head blkd_tasks; member
H A Dtree_stall.h228 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) { in rcu_print_detail_task_stall_rnp()
284 list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) { in rcu_print_task_stall()
H A Dtree.c5485 INIT_LIST_HEAD(&rnp->blkd_tasks); in rcu_init_one()
/linux/Documentation/RCU/Design/Data-Structures/
H A 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