rq->idle_stamp = 0;
        }
 #endif
-
-       p->dl_server = NULL;
 }
 
 /*
                        break;
        }
 #endif
-
-       /*
-        * We've updated @prev and no longer need the server link, clear it.
-        * Must be done before ->pick_next_task() because that can (re)set
-        * ->dl_server.
-        */
-       if (prev->dl_server)
-               prev->dl_server = NULL;
 }
 
 /*
        const struct sched_class *class;
        struct task_struct *p;
 
+       rq->dl_server = NULL;
+
        /*
         * Optimization: we know that if all tasks are in the fair class we can
         * call that function directly, but only if the @prev task wasn't of a
                        put_prev_set_next_task(rq, prev, p);
                }
 
-               /*
-                * This is a normal CFS pick, but the previous could be a DL pick.
-                * Clear it as previous is no longer picked.
-                */
-               if (prev->dl_server)
-                       prev->dl_server = NULL;
-
-               /*
-                * This is the fast path; it cannot be a DL server pick;
-                * therefore even if @p == @prev, ->dl_server must be NULL.
-                */
-               if (p->dl_server)
-                       p->dl_server = NULL;
-
                return p;
        }
 
        const struct sched_class *class;
        struct task_struct *p;
 
+       rq->dl_server = NULL;
+
        for_each_class(class) {
                p = class->pick_task(rq);
                if (p)
                 * another cpu during offline.
                 */
                rq->core_pick = NULL;
+               rq->core_dl_server = NULL;
                return __pick_next_task(rq, prev, rf);
        }
 
                WRITE_ONCE(rq->core_sched_seq, rq->core->core_pick_seq);
 
                next = rq->core_pick;
+               rq->dl_server = rq->core_dl_server;
                rq->core_pick = NULL;
+               rq->core_dl_server = NULL;
                goto out_set_next;
        }
 
                next = pick_task(rq);
                if (!next->core_cookie) {
                        rq->core_pick = NULL;
+                       rq->core_dl_server = NULL;
                        /*
                         * For robustness, update the min_vruntime_fi for
                         * unconstrained picks as well.
                if (i != cpu && (rq_i != rq->core || !core_clock_updated))
                        update_rq_clock(rq_i);
 
-               p = rq_i->core_pick = pick_task(rq_i);
+               rq_i->core_pick = p = pick_task(rq_i);
+               rq_i->core_dl_server = rq_i->dl_server;
+
                if (!max || prio_less(max, p, fi_before))
                        max = p;
        }
                }
 
                rq_i->core_pick = p;
+               rq_i->core_dl_server = NULL;
 
                if (p == rq_i->idle) {
                        if (rq_i->nr_running) {
 
                if (i == cpu) {
                        rq_i->core_pick = NULL;
+                       rq_i->core_dl_server = NULL;
                        continue;
                }
 
 
                if (rq_i->curr == rq_i->core_pick) {
                        rq_i->core_pick = NULL;
+                       rq_i->core_dl_server = NULL;
                        continue;
                }
 
 #ifdef CONFIG_SCHED_CORE
                rq->core = rq;
                rq->core_pick = NULL;
+               rq->core_dl_server = NULL;
                rq->core_enabled = 0;
                rq->core_tree = RB_ROOT;
                rq->core_forceidle_count = 0;
 
                cfs_rq = group_cfs_rq(se);
        } while (cfs_rq);
 
-       /*
-        * This can be called from directly from CFS's ->pick_task() or indirectly
-        * from DL's ->pick_task when fair server is enabled. In the indirect case,
-        * DL will set ->dl_server just after this function is called, so its Ok to
-        * clear. In the direct case, we are picking directly so we must clear it.
-        */
-       task_of(se)->dl_server = NULL;
-
        return task_of(se);
 }
 
        if (prev->sched_class != &fair_sched_class)
                goto simple;
 
+       __put_prev_set_next_dl_server(rq, prev, p);
+
        /*
         * Because of the set_next_buddy() in dequeue_task_fair() it is rather
         * likely that a next task is from the same cgroup as the current.
 
        unsigned int            nr_uninterruptible;
 
        struct task_struct __rcu        *curr;
+       struct sched_dl_entity  *dl_server;
        struct task_struct      *idle;
        struct task_struct      *stop;
        unsigned long           next_balance;
        /* per rq */
        struct rq               *core;
        struct task_struct      *core_pick;
+       struct sched_dl_entity  *core_dl_server;
        unsigned int            core_enabled;
        unsigned int            core_sched_seq;
        struct rb_root          core_tree;
        next->sched_class->set_next_task(rq, next, false);
 }
 
+static inline void
+__put_prev_set_next_dl_server(struct rq *rq,
+                             struct task_struct *prev,
+                             struct task_struct *next)
+{
+       prev->dl_server = NULL;
+       next->dl_server = rq->dl_server;
+       rq->dl_server = NULL;
+}
+
 static inline void put_prev_set_next_task(struct rq *rq,
                                          struct task_struct *prev,
                                          struct task_struct *next)
 {
        WARN_ON_ONCE(rq->curr != prev);
 
+       __put_prev_set_next_dl_server(rq, prev, next);
+
        if (next == prev)
                return;