Lines Matching refs:priority
75 * resource, and the corresponding cost, priority, owner ID, and conflicting keys list used
78 * Aside from the priority, these values are immutable once the ClientDescriptor has been
107 * Return the priority for this descriptor.
129 void setPriority(const ClientPriority& priority);
206 void ClientDescriptor<KEY, VALUE>::setPriority(const ClientPriority& priority) {
207 mPriority = priority;
238 * result in the lower-priority of the two being removed. Priority ties result in the
241 * will be removed if they have an equal or lower priority than the incoming descriptor;
242 * if any have a higher priority, the incoming descriptor is removed instead.
245 * priority, and a different owner will be evicted in LRU order until either the cost is less
247 * incoming descriptor has the highest priority. Otherwise, the incoming descriptor is
269 * Given a map containing owner (pid) -> priority mappings, update the priority of each
362 * vector of ClientDescriptors that are higher priority than the incoming client and
424 ClientPriority priority = client->getPriority();
429 // Determine the MRU of the owners tied for having the highest priority
431 ClientPriority highestPriority = priority;
440 if (highestPriority == priority) {
441 // Switch back owner if the incoming client has the highest priority, as it is MRU
458 if (conflicting && curPriority < priority) {
459 // Pre-existing conflicting client with higher priority exists
464 (curPriority >= priority) &&
467 // - We are adding a client with higher priority that conflicts with this one.
469 // maximum, and the client has a non-zero cost, lower priority, and a different
471 // highest priority.
478 if (curPriority < priority && (conflicting || (totalCost > mMaxCost && curCost > 0))) {
479 // Pre-existing conflicting client with higher priority exists
490 // If the total cost is too high, return the input unless the input has the highest priority