2 * Copyright (c) 2005-2010 Brocade Communications Systems, Inc.
6 * Linux driver for Brocade Fibre Channel Host Bus Adapter.
8 * This program is free software; you can redistribute it and/or modify it
9 * under the terms of the GNU General Public License (GPL) Version 2 as
10 * published by the Free Software Foundation
12 * This program is distributed in the hope that it will be useful, but
13 * WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
15 * General Public License for more details.
19 * bfa_cs.h BFA common services
32 #define BFA_TRC_MAX (4 * 1024)
35 #define BFA_TRC_TS(_trcm) \
39 do_gettimeofday(&tv); \
40 (tv.tv_sec*1000000+tv.tv_usec); \
44 #define BFA_TRC_TS(_trcm) ((_trcm)->ticks++)
65 struct bfa_trc_mod_s {
72 struct bfa_trc_s trc[BFA_TRC_MAX];
76 BFA_TRC_HAL = 1, /* BFA modules */
77 BFA_TRC_FCS = 2, /* BFA FCS modules */
78 BFA_TRC_LDRV = 3, /* Linux driver modules */
79 BFA_TRC_CNA = 4, /* Common modules */
81 #define BFA_TRC_MOD_SH 10
82 #define BFA_TRC_MOD(__mod) ((BFA_TRC_ ## __mod) << BFA_TRC_MOD_SH)
85 * Define a new tracing file (module). Module should match one defined above.
87 #define BFA_TRC_FILE(__mod, __submod) \
88 static int __trc_fileno = ((BFA_TRC_ ## __mod ## _ ## __submod) | \
92 #define bfa_trc32(_trcp, _data) \
93 __bfa_trc((_trcp)->trcmod, __trc_fileno, __LINE__, (u32)_data)
94 #define bfa_trc(_trcp, _data) \
95 __bfa_trc((_trcp)->trcmod, __trc_fileno, __LINE__, (u64)_data)
98 bfa_trc_init(struct bfa_trc_mod_s *trcm)
100 trcm->head = trcm->tail = trcm->stopped = 0;
101 trcm->ntrc = BFA_TRC_MAX;
105 bfa_trc_stop(struct bfa_trc_mod_s *trcm)
111 extern void dc_flush(void *data);
113 #define dc_flush(data)
118 __bfa_trc(struct bfa_trc_mod_s *trcm, int fileno, int line, u64 data)
120 int tail = trcm->tail;
121 struct bfa_trc_s *trc = &trcm->trc[tail];
126 trc->fileno = (u16) fileno;
127 trc->line = (u16) line;
128 trc->data.u64 = data;
129 trc->timestamp = BFA_TRC_TS(trcm);
132 trcm->tail = (trcm->tail + 1) & (BFA_TRC_MAX - 1);
133 if (trcm->tail == trcm->head)
134 trcm->head = (trcm->head + 1) & (BFA_TRC_MAX - 1);
140 __bfa_trc32(struct bfa_trc_mod_s *trcm, int fileno, int line, u32 data)
142 int tail = trcm->tail;
143 struct bfa_trc_s *trc = &trcm->trc[tail];
148 trc->fileno = (u16) fileno;
149 trc->line = (u16) line;
150 trc->data.u32.u32 = data;
151 trc->timestamp = BFA_TRC_TS(trcm);
154 trcm->tail = (trcm->tail + 1) & (BFA_TRC_MAX - 1);
155 if (trcm->tail == trcm->head)
156 trcm->head = (trcm->head + 1) & (BFA_TRC_MAX - 1);
160 #ifndef BFA_PERF_BUILD
161 #define bfa_trc_fp(_trcp, _data) bfa_trc(_trcp, _data)
163 #define bfa_trc_fp(_trcp, _data)
167 * @ BFA LOG interfaces
169 #define bfa_assert(__cond) do { \
171 printk(KERN_ERR "assert(%s) failed at %s:%d\\n", \
172 #__cond, __FILE__, __LINE__); \
176 #define bfa_sm_fault(__mod, __event) do { \
177 bfa_trc(__mod, (((u32)0xDEAD << 16) | __event)); \
178 printk(KERN_ERR "Assertion failure: %s:%d: %d", \
179 __FILE__, __LINE__, (__event)); \
182 #ifndef BFA_PERF_BUILD
183 #define bfa_assert_fp(__cond) bfa_assert(__cond)
185 #define bfa_assert_fp(__cond)
188 /* BFA queue definitions */
189 #define bfa_q_first(_q) ((void *)(((struct list_head *) (_q))->next))
190 #define bfa_q_next(_qe) (((struct list_head *) (_qe))->next)
191 #define bfa_q_prev(_qe) (((struct list_head *) (_qe))->prev)
194 * bfa_q_qe_init - to initialize a queue element
196 #define bfa_q_qe_init(_qe) { \
197 bfa_q_next(_qe) = (struct list_head *) NULL; \
198 bfa_q_prev(_qe) = (struct list_head *) NULL; \
202 * bfa_q_deq - dequeue an element from head of the queue
204 #define bfa_q_deq(_q, _qe) { \
205 if (!list_empty(_q)) { \
206 (*((struct list_head **) (_qe))) = bfa_q_next(_q); \
207 bfa_q_prev(bfa_q_next(*((struct list_head **) _qe))) = \
208 (struct list_head *) (_q); \
209 bfa_q_next(_q) = bfa_q_next(*((struct list_head **) _qe));\
210 BFA_Q_DBG_INIT(*((struct list_head **) _qe)); \
212 *((struct list_head **) (_qe)) = (struct list_head *) NULL;\
217 * bfa_q_deq_tail - dequeue an element from tail of the queue
219 #define bfa_q_deq_tail(_q, _qe) { \
220 if (!list_empty(_q)) { \
221 *((struct list_head **) (_qe)) = bfa_q_prev(_q); \
222 bfa_q_next(bfa_q_prev(*((struct list_head **) _qe))) = \
223 (struct list_head *) (_q); \
224 bfa_q_prev(_q) = bfa_q_prev(*(struct list_head **) _qe);\
225 BFA_Q_DBG_INIT(*((struct list_head **) _qe)); \
227 *((struct list_head **) (_qe)) = (struct list_head *) NULL;\
232 bfa_q_is_on_q_func(struct list_head *q, struct list_head *qe)
234 struct list_head *tqe;
240 tqe = bfa_q_next(tqe);
248 * #ifdef BFA_DEBUG (Using bfa_assert to check for debug_build is not
249 * consistent across modules)
251 #ifndef BFA_PERF_BUILD
252 #define BFA_Q_DBG_INIT(_qe) bfa_q_qe_init(_qe)
254 #define BFA_Q_DBG_INIT(_qe)
257 #define bfa_q_is_on_q(_q, _qe) \
258 bfa_q_is_on_q_func(_q, (struct list_head *)(_qe))
261 * @ BFA state machine interfaces
264 typedef void (*bfa_sm_t)(void *sm, int event);
267 * oc - object class eg. bfa_ioc
268 * st - state, eg. reset
269 * otype - object type, eg. struct bfa_ioc_s
270 * etype - object type, eg. enum ioc_event
272 #define bfa_sm_state_decl(oc, st, otype, etype) \
273 static void oc ## _sm_ ## st(otype * fsm, etype event)
275 #define bfa_sm_set_state(_sm, _state) ((_sm)->sm = (bfa_sm_t)(_state))
276 #define bfa_sm_send_event(_sm, _event) ((_sm)->sm((_sm), (_event)))
277 #define bfa_sm_get_state(_sm) ((_sm)->sm)
278 #define bfa_sm_cmp_state(_sm, _state) ((_sm)->sm == (bfa_sm_t)(_state))
281 * For converting from state machine function to state encoding.
283 struct bfa_sm_table_s {
284 bfa_sm_t sm; /* state machine function */
285 int state; /* state machine encoding */
286 char *name; /* state name for display */
288 #define BFA_SM(_sm) ((bfa_sm_t)(_sm))
291 * State machine with entry actions.
293 typedef void (*bfa_fsm_t)(void *fsm, int event);
296 * oc - object class eg. bfa_ioc
297 * st - state, eg. reset
298 * otype - object type, eg. struct bfa_ioc_s
299 * etype - object type, eg. enum ioc_event
301 #define bfa_fsm_state_decl(oc, st, otype, etype) \
302 static void oc ## _sm_ ## st(otype * fsm, etype event); \
303 static void oc ## _sm_ ## st ## _entry(otype * fsm)
305 #define bfa_fsm_set_state(_fsm, _state) do { \
306 (_fsm)->fsm = (bfa_fsm_t)(_state); \
307 _state ## _entry(_fsm); \
310 #define bfa_fsm_send_event(_fsm, _event) ((_fsm)->fsm((_fsm), (_event)))
311 #define bfa_fsm_get_state(_fsm) ((_fsm)->fsm)
312 #define bfa_fsm_cmp_state(_fsm, _state) \
313 ((_fsm)->fsm == (bfa_fsm_t)(_state))
316 bfa_sm_to_state(struct bfa_sm_table_s *smt, bfa_sm_t sm)
320 while (smt[i].sm && smt[i].sm != sm)
326 * @ Generic wait counter.
329 typedef void (*bfa_wc_resume_t) (void *cbarg);
332 bfa_wc_resume_t wc_resume;
338 bfa_wc_up(struct bfa_wc_s *wc)
344 bfa_wc_down(struct bfa_wc_s *wc)
347 if (wc->wc_count == 0)
348 wc->wc_resume(wc->wc_cbarg);
352 * Initialize a waiting counter.
355 bfa_wc_init(struct bfa_wc_s *wc, bfa_wc_resume_t wc_resume, void *wc_cbarg)
357 wc->wc_resume = wc_resume;
358 wc->wc_cbarg = wc_cbarg;
364 * Wait for counter to reach zero
367 bfa_wc_wait(struct bfa_wc_s *wc)
373 wwn2str(char *wwn_str, u64 wwn)
381 sprintf(wwn_str, "%02x:%02x:%02x:%02x:%02x:%02x:%02x:%02x", w.byte[0],
382 w.byte[1], w.byte[2], w.byte[3], w.byte[4], w.byte[5],
383 w.byte[6], w.byte[7]);
387 fcid2str(char *fcid_str, u32 fcid)
395 sprintf(fcid_str, "%02x:%02x:%02x", f.byte[1], f.byte[2], f.byte[3]);
398 #define bfa_swap_3b(_x) \
399 ((((_x) & 0xff) << 16) | \
400 ((_x) & 0x00ff00) | \
401 (((_x) & 0xff0000) >> 16))
404 #define bfa_hton3b(_x) bfa_swap_3b(_x)
406 #define bfa_hton3b(_x) (_x)
409 #define bfa_ntoh3b(_x) bfa_hton3b(_x)
411 #endif /* __BFA_CS_H__ */