cam_queue.h (8bad620d540097ff831bebc109b57c864feb053f) cam_queue.h (5a526431f84768cc809e654ae2f3e9b66d0066bd)
1/*
2 * CAM request queue management definitions.
3 *
4 * Copyright (c) 1997 Justin T. Gibbs.
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions

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

20 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 * SUCH DAMAGE.
27 *
1/*
2 * CAM request queue management definitions.
3 *
4 * Copyright (c) 1997 Justin T. Gibbs.
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions

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

20 * ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
21 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
22 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
23 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
24 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
25 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
26 * SUCH DAMAGE.
27 *
28 * $Id: cam_queue.h,v 1.2 1998/12/15 08:12:03 gibbs Exp $
28 * $Id: cam_queue.h,v 1.3 1999/04/07 22:57:48 gibbs Exp $
29 */
30
31#ifndef _CAM_CAM_QUEUE_H
32#define _CAM_CAM_QUEUE_H 1
33
34#ifdef KERNEL
35
36#include <sys/queue.h>

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

131 */
132void camq_insert(struct camq *queue, cam_pinfo *new_entry);
133
134/*
135 * camq_remove: Remove and arbitrary entry from the queue maintaining
136 * queue order.
137 */
138cam_pinfo *camq_remove(struct camq *queue, int index);
29 */
30
31#ifndef _CAM_CAM_QUEUE_H
32#define _CAM_CAM_QUEUE_H 1
33
34#ifdef KERNEL
35
36#include <sys/queue.h>

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

131 */
132void camq_insert(struct camq *queue, cam_pinfo *new_entry);
133
134/*
135 * camq_remove: Remove and arbitrary entry from the queue maintaining
136 * queue order.
137 */
138cam_pinfo *camq_remove(struct camq *queue, int index);
139#define CAMQ_HEAD 1 /* Head of queue index */
139
140
141/* Index the first element in the heap */
142#define CAMQ_GET_HEAD(camq) ((camq)->queue_array[CAMQ_HEAD])
143
140/*
141 * camq_change_priority: Raise or lower the priority of an entry
142 * maintaining queue order.
143 */
144void camq_change_priority(struct camq *queue, int index,
145 u_int32_t new_priority);
146
147static __inline int

--- 87 unchanged lines hidden --- 		144/*
145 * camq_change_priority: Raise or lower the priority of an entry
146 * maintaining queue order.
147 */
148void camq_change_priority(struct camq *queue, int index,
149 u_int32_t new_priority);
150
151static __inline int

--- 87 unchanged lines hidden ---