xref: /OK3568_Linux_fs/kernel/drivers/scsi/sym53c8xx_2/sym_misc.h (revision 4882a59341e53eb6f0b4789bf948001014eff981)
1*4882a593Smuzhiyun /* SPDX-License-Identifier: GPL-2.0-or-later */
2*4882a593Smuzhiyun /*
3*4882a593Smuzhiyun  * Device driver for the SYMBIOS/LSILOGIC 53C8XX and 53C1010 family
4*4882a593Smuzhiyun  * of PCI-SCSI IO processors.
5*4882a593Smuzhiyun  *
6*4882a593Smuzhiyun  * Copyright (C) 1999-2001  Gerard Roudier <groudier@free.fr>
7*4882a593Smuzhiyun  *
8*4882a593Smuzhiyun  * This driver is derived from the Linux sym53c8xx driver.
9*4882a593Smuzhiyun  * Copyright (C) 1998-2000  Gerard Roudier
10*4882a593Smuzhiyun  *
11*4882a593Smuzhiyun  * The sym53c8xx driver is derived from the ncr53c8xx driver that had been
12*4882a593Smuzhiyun  * a port of the FreeBSD ncr driver to Linux-1.2.13.
13*4882a593Smuzhiyun  *
14*4882a593Smuzhiyun  * The original ncr driver has been written for 386bsd and FreeBSD by
15*4882a593Smuzhiyun  *         Wolfgang Stanglmeier        <wolf@cologne.de>
16*4882a593Smuzhiyun  *         Stefan Esser                <se@mi.Uni-Koeln.de>
17*4882a593Smuzhiyun  * Copyright (C) 1994  Wolfgang Stanglmeier
18*4882a593Smuzhiyun  *
19*4882a593Smuzhiyun  * Other major contributions:
20*4882a593Smuzhiyun  *
21*4882a593Smuzhiyun  * NVRAM detection and reading.
22*4882a593Smuzhiyun  * Copyright (C) 1997 Richard Waltham <dormouse@farsrobt.demon.co.uk>
23*4882a593Smuzhiyun  *
24*4882a593Smuzhiyun  *-----------------------------------------------------------------------------
25*4882a593Smuzhiyun  */
26*4882a593Smuzhiyun 
27*4882a593Smuzhiyun #ifndef SYM_MISC_H
28*4882a593Smuzhiyun #define SYM_MISC_H
29*4882a593Smuzhiyun 
30*4882a593Smuzhiyun /*
31*4882a593Smuzhiyun  *  A la VMS/CAM-3 queue management.
32*4882a593Smuzhiyun  */
33*4882a593Smuzhiyun typedef struct sym_quehead {
34*4882a593Smuzhiyun 	struct sym_quehead *flink;	/* Forward  pointer */
35*4882a593Smuzhiyun 	struct sym_quehead *blink;	/* Backward pointer */
36*4882a593Smuzhiyun } SYM_QUEHEAD;
37*4882a593Smuzhiyun 
38*4882a593Smuzhiyun #define sym_que_init(ptr) do { \
39*4882a593Smuzhiyun 	(ptr)->flink = (ptr); (ptr)->blink = (ptr); \
40*4882a593Smuzhiyun } while (0)
41*4882a593Smuzhiyun 
sym_que_first(struct sym_quehead * head)42*4882a593Smuzhiyun static inline struct sym_quehead *sym_que_first(struct sym_quehead *head)
43*4882a593Smuzhiyun {
44*4882a593Smuzhiyun 	return (head->flink == head) ? 0 : head->flink;
45*4882a593Smuzhiyun }
46*4882a593Smuzhiyun 
sym_que_last(struct sym_quehead * head)47*4882a593Smuzhiyun static inline struct sym_quehead *sym_que_last(struct sym_quehead *head)
48*4882a593Smuzhiyun {
49*4882a593Smuzhiyun 	return (head->blink == head) ? 0 : head->blink;
50*4882a593Smuzhiyun }
51*4882a593Smuzhiyun 
__sym_que_add(struct sym_quehead * new,struct sym_quehead * blink,struct sym_quehead * flink)52*4882a593Smuzhiyun static inline void __sym_que_add(struct sym_quehead * new,
53*4882a593Smuzhiyun 	struct sym_quehead * blink,
54*4882a593Smuzhiyun 	struct sym_quehead * flink)
55*4882a593Smuzhiyun {
56*4882a593Smuzhiyun 	flink->blink	= new;
57*4882a593Smuzhiyun 	new->flink	= flink;
58*4882a593Smuzhiyun 	new->blink	= blink;
59*4882a593Smuzhiyun 	blink->flink	= new;
60*4882a593Smuzhiyun }
61*4882a593Smuzhiyun 
__sym_que_del(struct sym_quehead * blink,struct sym_quehead * flink)62*4882a593Smuzhiyun static inline void __sym_que_del(struct sym_quehead * blink,
63*4882a593Smuzhiyun 	struct sym_quehead * flink)
64*4882a593Smuzhiyun {
65*4882a593Smuzhiyun 	flink->blink = blink;
66*4882a593Smuzhiyun 	blink->flink = flink;
67*4882a593Smuzhiyun }
68*4882a593Smuzhiyun 
sym_que_empty(struct sym_quehead * head)69*4882a593Smuzhiyun static inline int sym_que_empty(struct sym_quehead *head)
70*4882a593Smuzhiyun {
71*4882a593Smuzhiyun 	return head->flink == head;
72*4882a593Smuzhiyun }
73*4882a593Smuzhiyun 
sym_que_splice(struct sym_quehead * list,struct sym_quehead * head)74*4882a593Smuzhiyun static inline void sym_que_splice(struct sym_quehead *list,
75*4882a593Smuzhiyun 	struct sym_quehead *head)
76*4882a593Smuzhiyun {
77*4882a593Smuzhiyun 	struct sym_quehead *first = list->flink;
78*4882a593Smuzhiyun 
79*4882a593Smuzhiyun 	if (first != list) {
80*4882a593Smuzhiyun 		struct sym_quehead *last = list->blink;
81*4882a593Smuzhiyun 		struct sym_quehead *at   = head->flink;
82*4882a593Smuzhiyun 
83*4882a593Smuzhiyun 		first->blink = head;
84*4882a593Smuzhiyun 		head->flink  = first;
85*4882a593Smuzhiyun 
86*4882a593Smuzhiyun 		last->flink = at;
87*4882a593Smuzhiyun 		at->blink   = last;
88*4882a593Smuzhiyun 	}
89*4882a593Smuzhiyun }
90*4882a593Smuzhiyun 
sym_que_move(struct sym_quehead * orig,struct sym_quehead * dest)91*4882a593Smuzhiyun static inline void sym_que_move(struct sym_quehead *orig,
92*4882a593Smuzhiyun 	struct sym_quehead *dest)
93*4882a593Smuzhiyun {
94*4882a593Smuzhiyun 	struct sym_quehead *first, *last;
95*4882a593Smuzhiyun 
96*4882a593Smuzhiyun 	first = orig->flink;
97*4882a593Smuzhiyun 	if (first != orig) {
98*4882a593Smuzhiyun 		first->blink = dest;
99*4882a593Smuzhiyun 		dest->flink  = first;
100*4882a593Smuzhiyun 		last = orig->blink;
101*4882a593Smuzhiyun 		last->flink  = dest;
102*4882a593Smuzhiyun 		dest->blink  = last;
103*4882a593Smuzhiyun 		orig->flink  = orig;
104*4882a593Smuzhiyun 		orig->blink  = orig;
105*4882a593Smuzhiyun 	} else {
106*4882a593Smuzhiyun 		dest->flink  = dest;
107*4882a593Smuzhiyun 		dest->blink  = dest;
108*4882a593Smuzhiyun 	}
109*4882a593Smuzhiyun }
110*4882a593Smuzhiyun 
111*4882a593Smuzhiyun #define sym_que_entry(ptr, type, member) container_of(ptr, type, member)
112*4882a593Smuzhiyun 
113*4882a593Smuzhiyun #define sym_insque(new, pos)		__sym_que_add(new, pos, (pos)->flink)
114*4882a593Smuzhiyun 
115*4882a593Smuzhiyun #define sym_remque(el)			__sym_que_del((el)->blink, (el)->flink)
116*4882a593Smuzhiyun 
117*4882a593Smuzhiyun #define sym_insque_head(new, head)	__sym_que_add(new, head, (head)->flink)
118*4882a593Smuzhiyun 
sym_remque_head(struct sym_quehead * head)119*4882a593Smuzhiyun static inline struct sym_quehead *sym_remque_head(struct sym_quehead *head)
120*4882a593Smuzhiyun {
121*4882a593Smuzhiyun 	struct sym_quehead *elem = head->flink;
122*4882a593Smuzhiyun 
123*4882a593Smuzhiyun 	if (elem != head)
124*4882a593Smuzhiyun 		__sym_que_del(head, elem->flink);
125*4882a593Smuzhiyun 	else
126*4882a593Smuzhiyun 		elem = NULL;
127*4882a593Smuzhiyun 	return elem;
128*4882a593Smuzhiyun }
129*4882a593Smuzhiyun 
130*4882a593Smuzhiyun #define sym_insque_tail(new, head)	__sym_que_add(new, (head)->blink, head)
131*4882a593Smuzhiyun 
sym_remque_tail(struct sym_quehead * head)132*4882a593Smuzhiyun static inline struct sym_quehead *sym_remque_tail(struct sym_quehead *head)
133*4882a593Smuzhiyun {
134*4882a593Smuzhiyun 	struct sym_quehead *elem = head->blink;
135*4882a593Smuzhiyun 
136*4882a593Smuzhiyun 	if (elem != head)
137*4882a593Smuzhiyun 		__sym_que_del(elem->blink, head);
138*4882a593Smuzhiyun 	else
139*4882a593Smuzhiyun 		elem = 0;
140*4882a593Smuzhiyun 	return elem;
141*4882a593Smuzhiyun }
142*4882a593Smuzhiyun 
143*4882a593Smuzhiyun /*
144*4882a593Smuzhiyun  *  This one may be useful.
145*4882a593Smuzhiyun  */
146*4882a593Smuzhiyun #define FOR_EACH_QUEUED_ELEMENT(head, qp) \
147*4882a593Smuzhiyun 	for (qp = (head)->flink; qp != (head); qp = qp->flink)
148*4882a593Smuzhiyun /*
149*4882a593Smuzhiyun  *  FreeBSD does not offer our kind of queue in the CAM CCB.
150*4882a593Smuzhiyun  *  So, we have to cast.
151*4882a593Smuzhiyun  */
152*4882a593Smuzhiyun #define sym_qptr(p)	((struct sym_quehead *) (p))
153*4882a593Smuzhiyun 
154*4882a593Smuzhiyun /*
155*4882a593Smuzhiyun  *  Simple bitmap operations.
156*4882a593Smuzhiyun  */
157*4882a593Smuzhiyun #define sym_set_bit(p, n)	(((u32 *)(p))[(n)>>5] |=  (1<<((n)&0x1f)))
158*4882a593Smuzhiyun #define sym_clr_bit(p, n)	(((u32 *)(p))[(n)>>5] &= ~(1<<((n)&0x1f)))
159*4882a593Smuzhiyun #define sym_is_bit(p, n)	(((u32 *)(p))[(n)>>5] &   (1<<((n)&0x1f)))
160*4882a593Smuzhiyun 
161*4882a593Smuzhiyun /*
162*4882a593Smuzhiyun  * The below round up/down macros are to be used with a constant
163*4882a593Smuzhiyun  * as argument (sizeof(...) for example), for the compiler to
164*4882a593Smuzhiyun  * optimize the whole thing.
165*4882a593Smuzhiyun  */
166*4882a593Smuzhiyun #define _U_(a,m)	(a)<=(1<<m)?m:
167*4882a593Smuzhiyun 
168*4882a593Smuzhiyun /*
169*4882a593Smuzhiyun  * Round up logarithm to base 2 of a 16 bit constant.
170*4882a593Smuzhiyun  */
171*4882a593Smuzhiyun #define _LGRU16_(a) \
172*4882a593Smuzhiyun ( \
173*4882a593Smuzhiyun  _U_(a, 0)_U_(a, 1)_U_(a, 2)_U_(a, 3)_U_(a, 4)_U_(a, 5)_U_(a, 6)_U_(a, 7) \
174*4882a593Smuzhiyun  _U_(a, 8)_U_(a, 9)_U_(a,10)_U_(a,11)_U_(a,12)_U_(a,13)_U_(a,14)_U_(a,15) \
175*4882a593Smuzhiyun  16)
176*4882a593Smuzhiyun 
177*4882a593Smuzhiyun #endif /* SYM_MISC_H */
178