Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 | /* * Copyright (c) 2005-2010 Brocade Communications Systems, Inc. * All rights reserved * www.brocade.com * * Linux driver for Brocade Fibre Channel Host Bus Adapter. * * This program is free software; you can redistribute it and/or modify it * under the terms of the GNU General Public License (GPL) Version 2 as * published by the Free Software Foundation * * This program is distributed in the hope that it will be useful, but * WITHOUT ANY WARRANTY; without even the implied warranty of * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU * General Public License for more details. */ /* * bfa_cs.h BFA common services */ #ifndef __BFA_CS_H__ #define __BFA_CS_H__ #include "bfad_drv.h" /* * BFA TRC */ #ifndef BFA_TRC_MAX #define BFA_TRC_MAX (4 * 1024) #endif #define BFA_TRC_TS(_trcm) \ ({ \ struct timeval tv; \ \ do_gettimeofday(&tv); \ (tv.tv_sec*1000000+tv.tv_usec); \ }) #ifndef BFA_TRC_TS #define BFA_TRC_TS(_trcm) ((_trcm)->ticks++) #endif struct bfa_trc_s { #ifdef __BIG_ENDIAN u16 fileno; u16 line; #else u16 line; u16 fileno; #endif u32 timestamp; union { struct { u32 rsvd; u32 u32; } u32; u64 u64; } data; }; struct bfa_trc_mod_s { u32 head; u32 tail; u32 ntrc; u32 stopped; u32 ticks; u32 rsvd[3]; struct bfa_trc_s trc[BFA_TRC_MAX]; }; enum { BFA_TRC_HAL = 1, /* BFA modules */ BFA_TRC_FCS = 2, /* BFA FCS modules */ BFA_TRC_LDRV = 3, /* Linux driver modules */ BFA_TRC_CNA = 4, /* Common modules */ }; #define BFA_TRC_MOD_SH 10 #define BFA_TRC_MOD(__mod) ((BFA_TRC_ ## __mod) << BFA_TRC_MOD_SH) /* * Define a new tracing file (module). Module should match one defined above. */ #define BFA_TRC_FILE(__mod, __submod) \ static int __trc_fileno = ((BFA_TRC_ ## __mod ## _ ## __submod) | \ BFA_TRC_MOD(__mod)) #define bfa_trc32(_trcp, _data) \ __bfa_trc((_trcp)->trcmod, __trc_fileno, __LINE__, (u32)_data) #define bfa_trc(_trcp, _data) \ __bfa_trc((_trcp)->trcmod, __trc_fileno, __LINE__, (u64)_data) static inline void bfa_trc_init(struct bfa_trc_mod_s *trcm) { trcm->head = trcm->tail = trcm->stopped = 0; trcm->ntrc = BFA_TRC_MAX; } static inline void bfa_trc_stop(struct bfa_trc_mod_s *trcm) { trcm->stopped = 1; } static inline void __bfa_trc(struct bfa_trc_mod_s *trcm, int fileno, int line, u64 data) { int tail = trcm->tail; struct bfa_trc_s *trc = &trcm->trc[tail]; if (trcm->stopped) return; trc->fileno = (u16) fileno; trc->line = (u16) line; trc->data.u64 = data; trc->timestamp = BFA_TRC_TS(trcm); trcm->tail = (trcm->tail + 1) & (BFA_TRC_MAX - 1); if (trcm->tail == trcm->head) trcm->head = (trcm->head + 1) & (BFA_TRC_MAX - 1); } static inline void __bfa_trc32(struct bfa_trc_mod_s *trcm, int fileno, int line, u32 data) { int tail = trcm->tail; struct bfa_trc_s *trc = &trcm->trc[tail]; if (trcm->stopped) return; trc->fileno = (u16) fileno; trc->line = (u16) line; trc->data.u32.u32 = data; trc->timestamp = BFA_TRC_TS(trcm); trcm->tail = (trcm->tail + 1) & (BFA_TRC_MAX - 1); if (trcm->tail == trcm->head) trcm->head = (trcm->head + 1) & (BFA_TRC_MAX - 1); } #define bfa_sm_fault(__mod, __event) do { \ bfa_trc(__mod, (((u32)0xDEAD << 16) | __event)); \ printk(KERN_ERR "Assertion failure: %s:%d: %d", \ __FILE__, __LINE__, (__event)); \ } while (0) /* BFA queue definitions */ #define bfa_q_first(_q) ((void *)(((struct list_head *) (_q))->next)) #define bfa_q_next(_qe) (((struct list_head *) (_qe))->next) #define bfa_q_prev(_qe) (((struct list_head *) (_qe))->prev) /* * bfa_q_qe_init - to initialize a queue element */ #define bfa_q_qe_init(_qe) { \ bfa_q_next(_qe) = (struct list_head *) NULL; \ bfa_q_prev(_qe) = (struct list_head *) NULL; \ } /* * bfa_q_deq - dequeue an element from head of the queue */ #define bfa_q_deq(_q, _qe) { \ if (!list_empty(_q)) { \ (*((struct list_head **) (_qe))) = bfa_q_next(_q); \ bfa_q_prev(bfa_q_next(*((struct list_head **) _qe))) = \ (struct list_head *) (_q); \ bfa_q_next(_q) = bfa_q_next(*((struct list_head **) _qe));\ } else { \ *((struct list_head **) (_qe)) = (struct list_head *) NULL;\ } \ } /* * bfa_q_deq_tail - dequeue an element from tail of the queue */ #define bfa_q_deq_tail(_q, _qe) { \ if (!list_empty(_q)) { \ *((struct list_head **) (_qe)) = bfa_q_prev(_q); \ bfa_q_next(bfa_q_prev(*((struct list_head **) _qe))) = \ (struct list_head *) (_q); \ bfa_q_prev(_q) = bfa_q_prev(*(struct list_head **) _qe);\ } else { \ *((struct list_head **) (_qe)) = (struct list_head *) NULL;\ } \ } static inline int bfa_q_is_on_q_func(struct list_head *q, struct list_head *qe) { struct list_head *tqe; tqe = bfa_q_next(q); while (tqe != q) { if (tqe == qe) return 1; tqe = bfa_q_next(tqe); if (tqe == NULL) break; } return 0; } #define bfa_q_is_on_q(_q, _qe) \ bfa_q_is_on_q_func(_q, (struct list_head *)(_qe)) /* * @ BFA state machine interfaces */ typedef void (*bfa_sm_t)(void *sm, int event); /* * oc - object class eg. bfa_ioc * st - state, eg. reset * otype - object type, eg. struct bfa_ioc_s * etype - object type, eg. enum ioc_event */ #define bfa_sm_state_decl(oc, st, otype, etype) \ static void oc ## _sm_ ## st(otype * fsm, etype event) #define bfa_sm_set_state(_sm, _state) ((_sm)->sm = (bfa_sm_t)(_state)) #define bfa_sm_send_event(_sm, _event) ((_sm)->sm((_sm), (_event))) #define bfa_sm_get_state(_sm) ((_sm)->sm) #define bfa_sm_cmp_state(_sm, _state) ((_sm)->sm == (bfa_sm_t)(_state)) /* * For converting from state machine function to state encoding. */ struct bfa_sm_table_s { bfa_sm_t sm; /* state machine function */ int state; /* state machine encoding */ char *name; /* state name for display */ }; #define BFA_SM(_sm) ((bfa_sm_t)(_sm)) /* * State machine with entry actions. */ typedef void (*bfa_fsm_t)(void *fsm, int event); /* * oc - object class eg. bfa_ioc * st - state, eg. reset * otype - object type, eg. struct bfa_ioc_s * etype - object type, eg. enum ioc_event */ #define bfa_fsm_state_decl(oc, st, otype, etype) \ static void oc ## _sm_ ## st(otype * fsm, etype event); \ static void oc ## _sm_ ## st ## _entry(otype * fsm) #define bfa_fsm_set_state(_fsm, _state) do { \ (_fsm)->fsm = (bfa_fsm_t)(_state); \ _state ## _entry(_fsm); \ } while (0) #define bfa_fsm_send_event(_fsm, _event) ((_fsm)->fsm((_fsm), (_event))) #define bfa_fsm_get_state(_fsm) ((_fsm)->fsm) #define bfa_fsm_cmp_state(_fsm, _state) \ ((_fsm)->fsm == (bfa_fsm_t)(_state)) static inline int bfa_sm_to_state(struct bfa_sm_table_s *smt, bfa_sm_t sm) { int i = 0; while (smt[i].sm && smt[i].sm != sm) i++; return smt[i].state; } /* * @ Generic wait counter. */ typedef void (*bfa_wc_resume_t) (void *cbarg); struct bfa_wc_s { bfa_wc_resume_t wc_resume; void *wc_cbarg; int wc_count; }; static inline void bfa_wc_up(struct bfa_wc_s *wc) { wc->wc_count++; } static inline void bfa_wc_down(struct bfa_wc_s *wc) { wc->wc_count--; if (wc->wc_count == 0) wc->wc_resume(wc->wc_cbarg); } /* * Initialize a waiting counter. */ static inline void bfa_wc_init(struct bfa_wc_s *wc, bfa_wc_resume_t wc_resume, void *wc_cbarg) { wc->wc_resume = wc_resume; wc->wc_cbarg = wc_cbarg; wc->wc_count = 0; bfa_wc_up(wc); } /* * Wait for counter to reach zero */ static inline void bfa_wc_wait(struct bfa_wc_s *wc) { bfa_wc_down(wc); } static inline void wwn2str(char *wwn_str, u64 wwn) { union { u64 wwn; u8 byte[8]; } w; w.wwn = wwn; sprintf(wwn_str, "%02x:%02x:%02x:%02x:%02x:%02x:%02x:%02x", w.byte[0], w.byte[1], w.byte[2], w.byte[3], w.byte[4], w.byte[5], w.byte[6], w.byte[7]); } static inline void fcid2str(char *fcid_str, u32 fcid) { union { u32 fcid; u8 byte[4]; } f; f.fcid = fcid; sprintf(fcid_str, "%02x:%02x:%02x", f.byte[1], f.byte[2], f.byte[3]); } #define bfa_swap_3b(_x) \ ((((_x) & 0xff) << 16) | \ ((_x) & 0x00ff00) | \ (((_x) & 0xff0000) >> 16)) #ifndef __BIG_ENDIAN #define bfa_hton3b(_x) bfa_swap_3b(_x) #else #define bfa_hton3b(_x) (_x) #endif #define bfa_ntoh3b(_x) bfa_hton3b(_x) #endif /* __BFA_CS_H__ */ |