Lines Matching refs:rt_rq
272 struct rt_rq **rt_rq;
388 struct rt_rq {
485 struct rt_rq rt;
551 /* could above be rq->cfs_rq.exec_clock + rq->rt_rq.rt_runtime ? */
643 p->rt.rt_rq = task_group(p)->rt_rq[cpu];
7763 static void init_rt_rq(struct rt_rq *rt_rq, struct rq *rq)
7768 array = &rt_rq->active;
7777 rt_rq->highest_prio.curr = MAX_RT_PRIO;
7779 rt_rq->highest_prio.next = MAX_RT_PRIO;
7783 rt_rq->rt_nr_migratory = 0;
7784 rt_rq->overloaded = 0;
7785 plist_head_init_raw(&rt_rq->pushable_tasks, &rq->lock);
7788 rt_rq->rt_time = 0;
7789 rt_rq->rt_throttled = 0;
7790 rt_rq->rt_runtime = 0;
7791 raw_spin_lock_init(&rt_rq->rt_runtime_lock);
7794 rt_rq->rt_nr_boosted = 0;
7795 rt_rq->rq = rq;
7829 static void init_tg_rt_entry(struct task_group *tg, struct rt_rq *rt_rq,
7835 tg->rt_rq[cpu] = rt_rq;
7836 init_rt_rq(rt_rq, rq);
7837 rt_rq->tg = tg;
7838 rt_rq->rt_runtime = tg->rt_bandwidth.rt_runtime;
7840 list_add(&rt_rq->leaf_rt_rq_list, &rq->leaf_rt_rq_list);
7847 rt_se->rt_rq = &rq->rt;
7849 rt_se->rt_rq = parent->my_q;
7851 rt_se->my_q = rt_rq;
7886 init_task_group.rt_rq = (struct rt_rq **)ptr;
8286 if (tg->rt_rq)
8287 kfree(tg->rt_rq[i]);
8292 kfree(tg->rt_rq);
8299 struct rt_rq *rt_rq;
8304 tg->rt_rq = kzalloc(sizeof(rt_rq) * nr_cpu_ids, GFP_KERNEL);
8305 if (!tg->rt_rq)
8317 rt_rq = kzalloc_node(sizeof(struct rt_rq),
8319 if (!rt_rq)
8327 init_tg_rt_entry(tg, rt_rq, rt_se, i, 0, parent->rt_se[i]);
8333 kfree(rt_rq);
8340 list_add_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list,
8346 list_del_rcu(&tg->rt_rq[cpu]->leaf_rt_rq_list);
8685 struct rt_rq *rt_rq = tg->rt_rq[i];
8687 raw_spin_lock(&rt_rq->rt_runtime_lock);
8688 rt_rq->rt_runtime = rt_runtime;
8689 raw_spin_unlock(&rt_rq->rt_runtime_lock);
8798 struct rt_rq *rt_rq = &cpu_rq(i)->rt;
8800 raw_spin_lock(&rt_rq->rt_runtime_lock);
8801 rt_rq->rt_runtime = global_rt_runtime();
8802 raw_spin_unlock(&rt_rq->rt_runtime_lock);