Lines Matching full:highest
97 struct mqueue *queue, *highest; in link_SequenceQueue() local
101 highest = LINK_HIGHQ(l); in link_SequenceQueue()
102 for (queue = l->Queue; queue < highest; queue++) in link_SequenceQueue()
104 m_enqueue(highest, m_dequeue(queue)); in link_SequenceQueue()
110 struct mqueue *queue, *highest; in link_DeleteQueue() local
112 highest = LINK_HIGHQ(l); in link_DeleteQueue()
113 for (queue = l->Queue; queue <= highest; queue++) in link_DeleteQueue()
153 struct mqueue *queue, *highest; in link_PendingLowPriorityData() local
159 * everything that's not in the highest priority queue, we must be able to in link_PendingLowPriorityData()
168 highest = LINK_HIGHQ(l); in link_PendingLowPriorityData()
170 for (queue = l->Queue; queue < highest; queue++) { in link_PendingLowPriorityData()