highest_prio       90 kernel/sched/rt.c 	rt_rq->highest_prio.curr = MAX_RT_PRIO;
highest_prio       91 kernel/sched/rt.c 	rt_rq->highest_prio.next = MAX_RT_PRIO;
highest_prio      162 kernel/sched/rt.c 	rt_rq->highest_prio.curr = MAX_RT_PRIO;
highest_prio      266 kernel/sched/rt.c 	return rq->rt.highest_prio.curr > prev->prio;
highest_prio      381 kernel/sched/rt.c 	if (p->prio < rq->rt.highest_prio.next)
highest_prio      382 kernel/sched/rt.c 		rq->rt.highest_prio.next = p->prio;
highest_prio      393 kernel/sched/rt.c 		rq->rt.highest_prio.next = p->prio;
highest_prio      395 kernel/sched/rt.c 		rq->rt.highest_prio.next = MAX_RT_PRIO;
highest_prio      502 kernel/sched/rt.c 		if (rt_rq->highest_prio.curr < curr->prio)
highest_prio      902 kernel/sched/rt.c 		return rt_rq->highest_prio.curr;
highest_prio     1064 kernel/sched/rt.c 	if (rq->online && rt_rq->highest_prio.curr != prev_prio)
highest_prio     1065 kernel/sched/rt.c 		cpupri_set(&rq->rd->cpupri, rq->cpu, rt_rq->highest_prio.curr);
highest_prio     1081 kernel/sched/rt.c 	int prev_prio = rt_rq->highest_prio.curr;
highest_prio     1084 kernel/sched/rt.c 		rt_rq->highest_prio.curr = prio;
highest_prio     1092 kernel/sched/rt.c 	int prev_prio = rt_rq->highest_prio.curr;
highest_prio     1105 kernel/sched/rt.c 			rt_rq->highest_prio.curr =
highest_prio     1110 kernel/sched/rt.c 		rt_rq->highest_prio.curr = MAX_RT_PRIO;
highest_prio     1436 kernel/sched/rt.c 		    p->prio < cpu_rq(target)->rt.highest_prio.curr)
highest_prio     1725 kernel/sched/rt.c 		if (lowest_rq->rt.highest_prio.curr <= task->prio) {
highest_prio     1756 kernel/sched/rt.c 		if (lowest_rq->rt.highest_prio.curr > task->prio)
highest_prio     2091 kernel/sched/rt.c 		if (src_rq->rt.highest_prio.next >=
highest_prio     2092 kernel/sched/rt.c 		    this_rq->rt.highest_prio.curr)
highest_prio     2112 kernel/sched/rt.c 		if (p && (p->prio < this_rq->rt.highest_prio.curr)) {
highest_prio     2170 kernel/sched/rt.c 	cpupri_set(&rq->rd->cpupri, rq->cpu, rq->rt.highest_prio.curr);
highest_prio     2261 kernel/sched/rt.c 		if (p->prio > rq->rt.highest_prio.curr)
highest_prio      607 kernel/sched/sched.h 	} highest_prio;
highest_prio       36 net/sched/sch_skbprio.c 	u16 highest_prio;
highest_prio       44 net/sched/sch_skbprio.c 	for (prio = q->highest_prio - 1; prio >= q->lowest_prio; prio--) {
highest_prio       57 net/sched/sch_skbprio.c 	for (prio = q->lowest_prio + 1; prio <= q->highest_prio; prio++) {
highest_prio       88 net/sched/sch_skbprio.c 		if (prio > q->highest_prio)
highest_prio       89 net/sched/sch_skbprio.c 			q->highest_prio = prio;
highest_prio      123 net/sched/sch_skbprio.c 		if (q->lowest_prio == q->highest_prio) {
highest_prio      127 net/sched/sch_skbprio.c 			q->highest_prio = prio;
highest_prio      133 net/sched/sch_skbprio.c 	if (prio > q->highest_prio)
highest_prio      134 net/sched/sch_skbprio.c 		q->highest_prio = prio;
highest_prio      142 net/sched/sch_skbprio.c 	struct sk_buff_head *hpq = &q->qdiscs[q->highest_prio];
highest_prio      152 net/sched/sch_skbprio.c 	q->qstats[q->highest_prio].backlog -= qdisc_pkt_len(skb);
highest_prio      156 net/sched/sch_skbprio.c 		if (q->lowest_prio == q->highest_prio) {
highest_prio      158 net/sched/sch_skbprio.c 			q->highest_prio = 0;
highest_prio      161 net/sched/sch_skbprio.c 			q->highest_prio = calc_new_high_prio(q);
highest_prio      190 net/sched/sch_skbprio.c 	q->highest_prio = 0;
highest_prio      223 net/sched/sch_skbprio.c 	q->highest_prio = 0;