58 		GEM_BUG_ON(p->priority >= last_prio);  in assert_priolists()
59 		last_prio = p->priority;  in assert_priolists()
83 	/* buckets sorted from highest [in slot 0] to lowest priority */  in i915_sched_lookup_priolist()
90 	/* most positive priority is scheduled first, equal priorities fifo */  in i915_sched_lookup_priolist()
96 		if (prio > p->priority) {  in i915_sched_lookup_priolist()
98 		} else if (prio < p->priority) {  in i915_sched_lookup_priolist()
110 		/* Convert an allocation failure to a priority bump */  in i915_sched_lookup_priolist()
127 	p->priority = prio;  in i915_sched_lookup_priolist()
177 	return rq->sched.attr.priority | __NO_PREEMPTION;  in rq_prio()
184 	 * not allow low priority tasks to preempt other low priority  in need_preempt()
185 	 * tasks under the impression that latency for low priority  in need_preempt()
199 	 * We only need to kick the tasklet once for the high priority  in kick_submission()
216 	 * tasklet, i.e. we have not change the priority queue  in kick_submission()
236 	const int prio = attr->priority;  in __i915_schedule()
244 	if (prio <= READ_ONCE(node->attr.priority))  in __i915_schedule()
290 			if (prio > READ_ONCE(p->signaler->attr.priority))  in __i915_schedule()
298 	 * execlists_submit_request()), we can set our own priority and skip  in __i915_schedule()
301 	if (node->attr.priority == I915_PRIORITY_INVALID) {  in __i915_schedule()
325 		if (prio <= node->attr.priority || node_signaled(node))  in __i915_schedule()
330 		node->attr.priority = prio;  in __i915_schedule()
371 	attr.priority |= bump;  in __bump_priority()
380 	if (READ_ONCE(rq->sched.attr.priority) & bump)  in i915_schedule_bump_priority()
393 	node->attr.priority = I915_PRIORITY_INVALID;  in i915_sched_node_init()