211 		list_add(&t->rcu_node_entry, &rnp->blkd_tasks);  in rcu_preempt_ctxt_queue()
229 		list_add_tail(&t->rcu_node_entry, &rnp->blkd_tasks);  in rcu_preempt_ctxt_queue()
242 		list_add(&t->rcu_node_entry, rnp->exp_tasks);  in rcu_preempt_ctxt_queue()
253 		list_add(&t->rcu_node_entry, rnp->gp_tasks);  in rcu_preempt_ctxt_queue()
270 		rnp->gp_tasks = &t->rcu_node_entry;  in rcu_preempt_ctxt_queue()
274 		rnp->exp_tasks = &t->rcu_node_entry;  in rcu_preempt_ctxt_queue()
359 		WARN_ON_ONCE(!list_empty(&t->rcu_node_entry));  in rcu_preempt_note_context_switch()
451 	np = t->rcu_node_entry.next;  in rcu_next_node_entry()
555 		list_del_init(&t->rcu_node_entry);  in rcu_read_unlock_special()
559 		if (&t->rcu_node_entry == rnp->gp_tasks)  in rcu_read_unlock_special()
561 		if (&t->rcu_node_entry == rnp->exp_tasks)  in rcu_read_unlock_special()
566 			if (&t->rcu_node_entry == rnp->boost_tasks)  in rcu_read_unlock_special()
620 		       struct task_struct, rcu_node_entry);  in rcu_print_detail_task_stall_rnp()
621 	list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) {  in rcu_print_detail_task_stall_rnp()
669 		       struct task_struct, rcu_node_entry);  in rcu_print_task_stall()
670 	list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) {  in rcu_print_task_stall()
691 		       struct task_struct, rcu_node_entry);  in rcu_print_task_exp_stall()
692 	list_for_each_entry_continue(t, &rnp->blkd_tasks, rcu_node_entry) {  in rcu_print_task_exp_stall()
721 				 rcu_node_entry);  in rcu_preempt_check_blocked_tasks()
856 	if (likely(list_empty(&current->rcu_node_entry)))  in exit_rcu()
1093 	t = container_of(tb, struct task_struct, rcu_node_entry);  in rcu_boost()