/* Because the prio of an upper entry depends on the lower entries, we must remove entries top - down.  */
static void dequeue_rt_stack(struct sched_rt_entity *rt_se)
/* Because the prio of an upper entry depends on the lower entries, we must remove entries top - down.  */
static void dequeue_rt_stack(struct sched_rt_entity *rt_se)
{
	struct sched_rt_entity *back = NULL;
	for_each_sched_rt_entity(rt_se) {
		rt_se->back = back;
		back = rt_se;
	}
	for (rt_se = back; rt_se; rt_se = rt_se->back) {
		if (on_rt_rq(rt_se))
			__dequeue_rt_entity(rt_se);
	}
}