struct list_head *queue;
        int idx;
 
-       assert_spin_locked(&rq->lock);
-
        if (likely(rq->rt.rt_nr_running < 2))
                return NULL;
 
        int ret = 0;
        int paranoid = RT_MAX_TRIES;
 
-       assert_spin_locked(&rq->lock);
-
        if (!rq->rt.overloaded)
                return 0;
 
                goto out;
        }
 
-       assert_spin_locked(&lowest_rq->lock);
-
        deactivate_task(rq, next_task, 0);
        set_task_cpu(next_task, lowest_rq->cpu);
        activate_task(lowest_rq, next_task, 0);
        int cpu;
        int ret = 0;
 
-       assert_spin_locked(&this_rq->lock);
-
        /*
         * If cpusets are used, and we have overlapping
         * run queue cpusets, then this algorithm may not catch all.