cam_queue.c (0699955838130d85fbc325ba019b4613c9b3fef8) cam_queue.c (ac2fffa4b74cd83963f0d462c379c7f50eeabf20)
1/*-
2 * CAM request queue management functions.
3 *
4 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
5 *
6 * Copyright (c) 1997 Justin T. Gibbs.
7 * All rights reserved.
8 *

--- 112 unchanged lines hidden (view full) ---

121u_int32_t
122camq_resize(struct camq *queue, int new_size)
123{
124 cam_pinfo **new_array;
125
126 KASSERT(new_size >= queue->entries, ("camq_resize: "
127 "New queue size can't accommodate queued entries (%d < %d).",
128 new_size, queue->entries));
1/*-
2 * CAM request queue management functions.
3 *
4 * SPDX-License-Identifier: BSD-2-Clause-FreeBSD
5 *
6 * Copyright (c) 1997 Justin T. Gibbs.
7 * All rights reserved.
8 *

--- 112 unchanged lines hidden (view full) ---

121u_int32_t
122camq_resize(struct camq *queue, int new_size)
123{
124 cam_pinfo **new_array;
125
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 **)mallocarray(new_size, sizeof(cam_pinfo *),
129 new_array = (cam_pinfo **)malloc(new_size * sizeof(cam_pinfo *),
130 M_CAMQ, M_NOWAIT);
131 if (new_array == NULL) {
132 /* Couldn't satisfy request */
133 return (CAM_RESRC_UNAVAIL);
134 }
135 /*
136 * Heap algorithms like everything numbered from 1, so
137 * remember that our pointer into the heap array is offset

--- 273 unchanged lines hidden --- 		130 M_CAMQ, M_NOWAIT);
131 if (new_array == NULL) {
132 /* Couldn't satisfy request */
133 return (CAM_RESRC_UNAVAIL);
134 }
135 /*
136 * Heap algorithms like everything numbered from 1, so
137 * remember that our pointer into the heap array is offset

--- 273 unchanged lines hidden ---