177 		list_add(&t->rcu_node_entry, &rnp->blkd_tasks);  in rcu_preempt_ctxt_queue()
195 		list_add_tail(&t->rcu_node_entry, &rnp->blkd_tasks);  in rcu_preempt_ctxt_queue()
208 		list_add(&t->rcu_node_entry, rnp->exp_tasks);  in rcu_preempt_ctxt_queue()
219 		list_add(&t->rcu_node_entry, rnp->gp_tasks);  in rcu_preempt_ctxt_queue()
236 		rnp->gp_tasks = &t->rcu_node_entry;  in rcu_preempt_ctxt_queue()
238 		rnp->exp_tasks = &t->rcu_node_entry;  in rcu_preempt_ctxt_queue()
315 		WARN_ON_ONCE(!list_empty(&t->rcu_node_entry));  in rcu_preempt_note_context_switch()
363 	np = t->rcu_node_entry.next;  in rcu_next_node_entry()
471 		list_del_init(&t->rcu_node_entry);  in rcu_read_unlock_special()
475 		if (&t->rcu_node_entry == rnp->gp_tasks)  in rcu_read_unlock_special()
477 		if (&t->rcu_node_entry == rnp->exp_tasks)  in rcu_read_unlock_special()
480 			if (&t->rcu_node_entry == rnp->boost_tasks)  in rcu_read_unlock_special()
536 		       struct task_struct, rcu_node_entry);  in rcu_print_detail_task_stall_rnp()
537 	list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry)  in rcu_print_detail_task_stall_rnp()
579 		       struct task_struct, rcu_node_entry);  in rcu_print_task_stall()
580 	list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) {  in rcu_print_task_stall()
601 		       struct task_struct, rcu_node_entry);  in rcu_print_task_exp_stall()
602 	list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) {  in rcu_print_task_exp_stall()
804 	if (likely(list_empty(&current->rcu_node_entry)))  in exit_rcu()
1035 	t = container_of(tb, struct task_struct, rcu_node_entry);  in rcu_boost()