2 * CAM request queue management functions.
4 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
6 * Copyright (c) 1997 Justin T. Gibbs.
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions
12 * 1. Redistributions of source code must retain the above copyright
13 * notice, this list of conditions, and the following disclaimer,
14 * without modification, immediately at the beginning of the file.
15 * 2. The name of the author may not be used to endorse or promote products
16 * derived from this software without specific prior written permission.
18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
19 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
20 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
21 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE FOR
22 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
23 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
24 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
25 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
26 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
27 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31 #include <sys/cdefs.h>
32 __FBSDID("$FreeBSD$");
34 #include <sys/param.h>
35 #include <sys/systm.h>
36 #include <sys/types.h>
37 #include <sys/malloc.h>
38 #include <sys/kernel.h>
41 #include <cam/cam_ccb.h>
42 #include <cam/cam_queue.h>
43 #include <cam/cam_debug.h>
45 static MALLOC_DEFINE(M_CAMQ, "CAM queue", "CAM queue buffers");
46 static MALLOC_DEFINE(M_CAMDEVQ, "CAM dev queue", "CAM dev queue buffers");
47 static MALLOC_DEFINE(M_CAMCCBQ, "CAM ccb queue", "CAM ccb queue buffers");
50 queue_cmp(cam_pinfo **queue_array, int i, int j);
52 swap(cam_pinfo **queue_array, int i, int j);
53 static void heap_up(cam_pinfo **queue_array, int new_index);
54 static void heap_down(cam_pinfo **queue_array, int index,
62 camq = (struct camq *)malloc(sizeof(*camq), M_CAMQ, M_NOWAIT);
64 if (camq_init(camq, size) != 0) {
73 camq_init(struct camq *camq, int size)
75 bzero(camq, sizeof(*camq));
76 camq->array_size = size;
77 if (camq->array_size != 0) {
78 camq->queue_array = (cam_pinfo**)malloc(size*sizeof(cam_pinfo*),
80 if (camq->queue_array == NULL) {
81 printf("camq_init: - cannot malloc array!\n");
85 * Heap algorithms like everything numbered from 1, so
86 * offset our pointer into the heap array by one element.
94 * Free a camq structure. This should only be called if a controller
95 * driver failes somehow during its attach routine or is unloaded and has
96 * obtained a camq structure. The XPT should ensure that the queue
97 * is empty before calling this routine.
100 camq_free(struct camq *queue)
109 camq_fini(struct camq *queue)
111 if (queue->queue_array != NULL) {
113 * Heap algorithms like everything numbered from 1, so
114 * our pointer into the heap array is offset by one element.
116 queue->queue_array++;
117 free(queue->queue_array, M_CAMQ);
122 camq_resize(struct camq *queue, int new_size)
124 cam_pinfo **new_array;
126 KASSERT(new_size >= queue->entries, ("camq_resize: "
127 "New queue size can't accommodate queued entries (%d < %d).",
128 new_size, queue->entries));
129 new_array = (cam_pinfo **)malloc(new_size * sizeof(cam_pinfo *),
131 if (new_array == NULL) {
132 /* Couldn't satisfy request */
133 return (CAM_RESRC_UNAVAIL);
136 * Heap algorithms like everything numbered from 1, so
137 * remember that our pointer into the heap array is offset
140 if (queue->queue_array != NULL) {
141 queue->queue_array++;
142 bcopy(queue->queue_array, new_array,
143 queue->entries * sizeof(cam_pinfo *));
144 free(queue->queue_array, M_CAMQ);
146 queue->queue_array = new_array-1;
147 queue->array_size = new_size;
148 return (CAM_REQ_CMP);
152 * camq_insert: Given an array of cam_pinfo* elememnts with
153 * the Heap(1, num_elements) property and array_size - num_elements >= 1,
154 * output Heap(1, num_elements+1) including new_entry in the array.
157 camq_insert(struct camq *queue, cam_pinfo *new_entry)
160 KASSERT(queue->entries < queue->array_size,
161 ("camq_insert: Attempt to insert into a full queue (%d >= %d)",
162 queue->entries, queue->array_size));
164 queue->queue_array[queue->entries] = new_entry;
165 new_entry->index = queue->entries;
166 if (queue->entries != 0)
167 heap_up(queue->queue_array, queue->entries);
171 * camq_remove: Given an array of cam_pinfo* elevements with the
172 * Heap(1, num_elements) property and an index such that 1 <= index <=
173 * num_elements, remove that entry and restore the Heap(1, num_elements-1)
177 camq_remove(struct camq *queue, int index)
179 cam_pinfo *removed_entry;
181 if (index <= 0 || index > queue->entries)
182 panic("%s: Attempt to remove out-of-bounds index %d "
183 "from queue %p of size %d", __func__, index, queue,
186 removed_entry = queue->queue_array[index];
187 if (queue->entries != index) {
188 queue->queue_array[index] = queue->queue_array[queue->entries];
189 queue->queue_array[index]->index = index;
190 heap_down(queue->queue_array, index, queue->entries - 1);
192 removed_entry->index = CAM_UNQUEUED_INDEX;
194 return (removed_entry);
198 * camq_change_priority: Given an array of cam_pinfo* elements with the
199 * Heap(1, num_entries) property, an index such that 1 <= index <= num_elements,
200 * and a new priority for the element at index, change the priority of
201 * element index and restore the Heap(0, num_elements) property.
204 camq_change_priority(struct camq *queue, int index, u_int32_t new_priority)
206 if (new_priority > queue->queue_array[index]->priority) {
207 queue->queue_array[index]->priority = new_priority;
208 heap_down(queue->queue_array, index, queue->entries);
210 /* new_priority <= old_priority */
211 queue->queue_array[index]->priority = new_priority;
212 heap_up(queue->queue_array, index);
217 cam_devq_alloc(int devices, int openings)
219 struct cam_devq *devq;
221 devq = (struct cam_devq *)malloc(sizeof(*devq), M_CAMDEVQ, M_NOWAIT);
223 printf("cam_devq_alloc: - cannot malloc!\n");
226 if (cam_devq_init(devq, devices, openings) != 0) {
227 free(devq, M_CAMDEVQ);
234 cam_devq_init(struct cam_devq *devq, int devices, int openings)
237 bzero(devq, sizeof(*devq));
238 mtx_init(&devq->send_mtx, "CAM queue lock", NULL, MTX_DEF);
239 if (camq_init(&devq->send_queue, devices) != 0)
241 devq->send_openings = openings;
242 devq->send_active = 0;
247 cam_devq_free(struct cam_devq *devq)
250 camq_fini(&devq->send_queue);
251 mtx_destroy(&devq->send_mtx);
252 free(devq, M_CAMDEVQ);
256 cam_devq_resize(struct cam_devq *camq, int devices)
260 retval = camq_resize(&camq->send_queue, devices);
265 cam_ccbq_alloc(int openings)
267 struct cam_ccbq *ccbq;
269 ccbq = (struct cam_ccbq *)malloc(sizeof(*ccbq), M_CAMCCBQ, M_NOWAIT);
271 printf("cam_ccbq_alloc: - cannot malloc!\n");
274 if (cam_ccbq_init(ccbq, openings) != 0) {
275 free(ccbq, M_CAMCCBQ);
283 cam_ccbq_free(struct cam_ccbq *ccbq)
287 free(ccbq, M_CAMCCBQ);
292 cam_ccbq_resize(struct cam_ccbq *ccbq, int new_size)
296 delta = new_size - (ccbq->dev_active + ccbq->dev_openings);
297 ccbq->total_openings += delta;
298 ccbq->dev_openings += delta;
300 new_size = imax(64, 1 << fls(new_size + new_size / 2));
301 if (new_size > ccbq->queue.array_size)
302 return (camq_resize(&ccbq->queue, new_size));
304 return (CAM_REQ_CMP);
308 cam_ccbq_init(struct cam_ccbq *ccbq, int openings)
310 bzero(ccbq, sizeof(*ccbq));
311 if (camq_init(&ccbq->queue,
312 imax(64, 1 << fls(openings + openings / 2))) != 0)
314 ccbq->total_openings = openings;
315 ccbq->dev_openings = openings;
320 cam_ccbq_fini(struct cam_ccbq *ccbq)
323 camq_fini(&ccbq->queue);
327 * Heap routines for manipulating CAM queues.
330 * queue_cmp: Given an array of cam_pinfo* elements and indexes i
331 * and j, return less than 0, 0, or greater than 0 if i is less than,
332 * equal too, or greater than j respectively.
335 queue_cmp(cam_pinfo **queue_array, int i, int j)
337 if (queue_array[i]->priority == queue_array[j]->priority)
338 return ( queue_array[i]->generation
339 - queue_array[j]->generation );
341 return ( queue_array[i]->priority
342 - queue_array[j]->priority );
346 * swap: Given an array of cam_pinfo* elements and indexes i and j,
347 * exchange elements i and j.
350 swap(cam_pinfo **queue_array, int i, int j)
352 cam_pinfo *temp_qentry;
354 temp_qentry = queue_array[j];
355 queue_array[j] = queue_array[i];
356 queue_array[i] = temp_qentry;
357 queue_array[j]->index = j;
358 queue_array[i]->index = i;
362 * heap_up: Given an array of cam_pinfo* elements with the
363 * Heap(1, new_index-1) property and a new element in location
364 * new_index, output Heap(1, new_index).
367 heap_up(cam_pinfo **queue_array, int new_index)
377 if (queue_cmp(queue_array, parent, child) <= 0)
379 swap(queue_array, parent, child);
385 * heap_down: Given an array of cam_pinfo* elements with the
386 * Heap(index + 1, num_entries) property with index containing
387 * an unsorted entry, output Heap(index, num_entries).
390 heap_down(cam_pinfo **queue_array, int index, int num_entries)
397 for (; child <= num_entries; child = parent << 1) {
399 if (child < num_entries) {
400 /* child+1 is the right child of parent */
401 if (queue_cmp(queue_array, child + 1, child) < 0)
404 /* child is now the least child of parent */
405 if (queue_cmp(queue_array, parent, child) <= 0)
407 swap(queue_array, child, parent);