Lines Matching defs:priority
72 GEM_BUG_ON(p->priority >= last_prio);
73 last_prio = p->priority;
93 if (a->priority > b->priority)
95 if (a->priority < b->priority)
104 const int *priorityp = vk, priority = *priorityp;
106 if (p->priority > priority)
108 if (p->priority < priority)
145 /* buckets sorted from highest [in slot 0] to lowest priority */
161 /* most positive priority is scheduled first, equal priorities fifo */
167 if (prio > p->priority) {
169 } else if (prio < p->priority) {
182 /* Convert an allocation failure to a priority bump */
199 p->priority = prio;
256 return rq->sched.attr.priority | __NO_PREEMPTION;
263 * not allow low priority tasks to preempt other low priority
264 * tasks under the impression that latency for low priority
278 * We only need to kick the tasklet once for the high priority
312 const int prio = attr->priority;
320 if (prio <= READ_ONCE(node->attr.priority))
366 if (prio > READ_ONCE(p->signaler->attr.priority))
374 * execlists_submit_request()), we can set our own priority and skip
377 if (node->attr.priority == I915_PRIORITY_INVALID) {
401 if (prio <= node->attr.priority || node_signaled(node))
406 node->attr.priority = prio;
410 * priority lists and then onto the HW runlist. Before the
445 attr.priority |= bump;
454 if (READ_ONCE(rq->sched.attr.priority) & bump)
473 node->attr.priority = I915_PRIORITY_INVALID;
Indexes created Thu Oct 02 01:09:59 GMT 2025