47 static void	heap_down(cam_pinfo **queue_array, int index,
127 	new_entry->index = queue->entries;  in camq_insert()
139 camq_remove(struct camq *queue, int index)  in camq_remove()  argument
143 	if (index <= 0 || index > queue->entries)  in camq_remove()
145 		    "from queue %p of size %d", __func__, index, queue,  in camq_remove()
148 	removed_entry = queue->queue_array[index];  in camq_remove()
149 	if (queue->entries != index) {  in camq_remove()
150 		queue->queue_array[index] = queue->queue_array[queue->entries];  in camq_remove()
151 		queue->queue_array[index]->index = index;  in camq_remove()
152 		heap_down(queue->queue_array, index, queue->entries - 1);  in camq_remove()
154 	removed_entry->index = CAM_UNQUEUED_INDEX;  in camq_remove()
166 camq_change_priority(struct camq *queue, int index, uint32_t new_priority)  in camq_change_priority()  argument
168 	if (new_priority > queue->queue_array[index]->priority) {  in camq_change_priority()
169 		queue->queue_array[index]->priority = new_priority;  in camq_change_priority()
170 		heap_down(queue->queue_array, index, queue->entries);  in camq_change_priority()
173 		queue->queue_array[index]->priority = new_priority;  in camq_change_priority()
174 		heap_up(queue->queue_array, index);  in camq_change_priority()
319 	queue_array[j]->index = j;  in swap()
320 	queue_array[i]->index = i;  in swap()
351 heap_down(cam_pinfo **queue_array, int index, int num_entries)  in heap_down()  argument
356 	parent = index;  in heap_down()