lpfc_disc.h 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248
  1. /*******************************************************************
  2. * This file is part of the Emulex Linux Device Driver for *
  3. * Fibre Channel Host Bus Adapters. *
  4. * Copyright (C) 2004-2008 Emulex. All rights reserved. *
  5. * EMULEX and SLI are trademarks of Emulex. *
  6. * www.emulex.com *
  7. * *
  8. * This program is free software; you can redistribute it and/or *
  9. * modify it under the terms of version 2 of the GNU General *
  10. * Public License as published by the Free Software Foundation. *
  11. * This program is distributed in the hope that it will be useful. *
  12. * ALL EXPRESS OR IMPLIED CONDITIONS, REPRESENTATIONS AND *
  13. * WARRANTIES, INCLUDING ANY IMPLIED WARRANTY OF MERCHANTABILITY, *
  14. * FITNESS FOR A PARTICULAR PURPOSE, OR NON-INFRINGEMENT, ARE *
  15. * DISCLAIMED, EXCEPT TO THE EXTENT THAT SUCH DISCLAIMERS ARE HELD *
  16. * TO BE LEGALLY INVALID. See the GNU General Public License for *
  17. * more details, a copy of which can be found in the file COPYING *
  18. * included with this package. *
  19. *******************************************************************/
  20. #define FC_MAX_HOLD_RSCN 32 /* max number of deferred RSCNs */
  21. #define FC_MAX_NS_RSP 64512 /* max size NameServer rsp */
  22. #define FC_MAXLOOP 126 /* max devices supported on a fc loop */
  23. #define LPFC_DISC_FLOGI_TMO 10 /* Discovery FLOGI ratov */
  24. /* This is the protocol dependent definition for a Node List Entry.
  25. * This is used by Fibre Channel protocol to support FCP.
  26. */
  27. /* worker thread events */
  28. enum lpfc_work_type {
  29. LPFC_EVT_ONLINE,
  30. LPFC_EVT_OFFLINE_PREP,
  31. LPFC_EVT_OFFLINE,
  32. LPFC_EVT_WARM_START,
  33. LPFC_EVT_KILL,
  34. LPFC_EVT_ELS_RETRY,
  35. LPFC_EVT_DEV_LOSS,
  36. LPFC_EVT_FASTPATH_MGMT_EVT,
  37. LPFC_EVT_RESET_HBA,
  38. };
  39. /* structure used to queue event to the discovery tasklet */
  40. struct lpfc_work_evt {
  41. struct list_head evt_listp;
  42. void *evt_arg1;
  43. void *evt_arg2;
  44. enum lpfc_work_type evt;
  45. };
  46. struct lpfc_scsi_check_condition_event;
  47. struct lpfc_scsi_varqueuedepth_event;
  48. struct lpfc_scsi_event_header;
  49. struct lpfc_fabric_event_header;
  50. struct lpfc_fcprdchkerr_event;
  51. /* structure used for sending events from fast path */
  52. struct lpfc_fast_path_event {
  53. struct lpfc_work_evt work_evt;
  54. struct lpfc_vport *vport;
  55. union {
  56. struct lpfc_scsi_check_condition_event check_cond_evt;
  57. struct lpfc_scsi_varqueuedepth_event queue_depth_evt;
  58. struct lpfc_scsi_event_header scsi_evt;
  59. struct lpfc_fabric_event_header fabric_evt;
  60. struct lpfc_fcprdchkerr_event read_check_error;
  61. } un;
  62. };
  63. struct lpfc_nodelist {
  64. struct list_head nlp_listp;
  65. struct lpfc_name nlp_portname;
  66. struct lpfc_name nlp_nodename;
  67. uint32_t nlp_flag; /* entry flags */
  68. uint32_t nlp_DID; /* FC D_ID of entry */
  69. uint32_t nlp_last_elscmd; /* Last ELS cmd sent */
  70. uint16_t nlp_type;
  71. #define NLP_FC_NODE 0x1 /* entry is an FC node */
  72. #define NLP_FABRIC 0x4 /* entry rep a Fabric entity */
  73. #define NLP_FCP_TARGET 0x8 /* entry is an FCP target */
  74. #define NLP_FCP_INITIATOR 0x10 /* entry is an FCP Initiator */
  75. uint16_t nlp_rpi;
  76. uint16_t nlp_state; /* state transition indicator */
  77. uint16_t nlp_prev_state; /* state transition indicator */
  78. uint16_t nlp_xri; /* output exchange id for RPI */
  79. uint16_t nlp_sid; /* scsi id */
  80. #define NLP_NO_SID 0xffff
  81. uint16_t nlp_maxframe; /* Max RCV frame size */
  82. uint8_t nlp_class_sup; /* Supported Classes */
  83. uint8_t nlp_retry; /* used for ELS retries */
  84. uint8_t nlp_fcp_info; /* class info, bits 0-3 */
  85. #define NLP_FCP_2_DEVICE 0x10 /* FCP-2 device */
  86. uint16_t nlp_usg_map; /* ndlp management usage bitmap */
  87. #define NLP_USG_NODE_ACT_BIT 0x1 /* Indicate ndlp is actively used */
  88. #define NLP_USG_IACT_REQ_BIT 0x2 /* Request to inactivate ndlp */
  89. #define NLP_USG_FREE_REQ_BIT 0x4 /* Request to invoke ndlp memory free */
  90. #define NLP_USG_FREE_ACK_BIT 0x8 /* Indicate ndlp memory free invoked */
  91. struct timer_list nlp_delayfunc; /* Used for delayed ELS cmds */
  92. struct lpfc_hba *phba;
  93. struct fc_rport *rport; /* Corresponding FC transport
  94. port structure */
  95. struct lpfc_vport *vport;
  96. struct lpfc_work_evt els_retry_evt;
  97. struct lpfc_work_evt dev_loss_evt;
  98. struct kref kref;
  99. atomic_t cmd_pending;
  100. uint32_t cmd_qdepth;
  101. unsigned long last_change_time;
  102. struct lpfc_scsicmd_bkt *lat_data; /* Latency data */
  103. };
  104. /* Defines for nlp_flag (uint32) */
  105. #define NLP_IGNR_REG_CMPL 0x00000001 /* Rcvd rscn before we cmpl reg login */
  106. #define NLP_REG_LOGIN_SEND 0x00000002 /* sent reglogin to adapter */
  107. #define NLP_PLOGI_SND 0x00000020 /* sent PLOGI request for this entry */
  108. #define NLP_PRLI_SND 0x00000040 /* sent PRLI request for this entry */
  109. #define NLP_ADISC_SND 0x00000080 /* sent ADISC request for this entry */
  110. #define NLP_LOGO_SND 0x00000100 /* sent LOGO request for this entry */
  111. #define NLP_RNID_SND 0x00000400 /* sent RNID request for this entry */
  112. #define NLP_ELS_SND_MASK 0x000007e0 /* sent ELS request for this entry */
  113. #define NLP_DEFER_RM 0x00010000 /* Remove this ndlp if no longer used */
  114. #define NLP_DELAY_TMO 0x00020000 /* delay timeout is running for node */
  115. #define NLP_NPR_2B_DISC 0x00040000 /* node is included in num_disc_nodes */
  116. #define NLP_RCV_PLOGI 0x00080000 /* Rcv'ed PLOGI from remote system */
  117. #define NLP_LOGO_ACC 0x00100000 /* Process LOGO after ACC completes */
  118. #define NLP_TGT_NO_SCSIID 0x00200000 /* good PRLI but no binding for scsid */
  119. #define NLP_ACC_REGLOGIN 0x01000000 /* Issue Reg Login after successful
  120. ACC */
  121. #define NLP_NPR_ADISC 0x02000000 /* Issue ADISC when dq'ed from
  122. NPR list */
  123. #define NLP_RM_DFLT_RPI 0x04000000 /* need to remove leftover dflt RPI */
  124. #define NLP_NODEV_REMOVE 0x08000000 /* Defer removal till discovery ends */
  125. #define NLP_TARGET_REMOVE 0x10000000 /* Target remove in process */
  126. #define NLP_SC_REQ 0x20000000 /* Target requires authentication */
  127. #define NLP_RPI_VALID 0x80000000 /* nlp_rpi is valid */
  128. /* ndlp usage management macros */
  129. #define NLP_CHK_NODE_ACT(ndlp) (((ndlp)->nlp_usg_map \
  130. & NLP_USG_NODE_ACT_BIT) \
  131. && \
  132. !((ndlp)->nlp_usg_map \
  133. & NLP_USG_FREE_ACK_BIT))
  134. #define NLP_SET_NODE_ACT(ndlp) ((ndlp)->nlp_usg_map \
  135. |= NLP_USG_NODE_ACT_BIT)
  136. #define NLP_INT_NODE_ACT(ndlp) ((ndlp)->nlp_usg_map \
  137. = NLP_USG_NODE_ACT_BIT)
  138. #define NLP_CLR_NODE_ACT(ndlp) ((ndlp)->nlp_usg_map \
  139. &= ~NLP_USG_NODE_ACT_BIT)
  140. #define NLP_CHK_IACT_REQ(ndlp) ((ndlp)->nlp_usg_map \
  141. & NLP_USG_IACT_REQ_BIT)
  142. #define NLP_SET_IACT_REQ(ndlp) ((ndlp)->nlp_usg_map \
  143. |= NLP_USG_IACT_REQ_BIT)
  144. #define NLP_CHK_FREE_REQ(ndlp) ((ndlp)->nlp_usg_map \
  145. & NLP_USG_FREE_REQ_BIT)
  146. #define NLP_SET_FREE_REQ(ndlp) ((ndlp)->nlp_usg_map \
  147. |= NLP_USG_FREE_REQ_BIT)
  148. #define NLP_CHK_FREE_ACK(ndlp) ((ndlp)->nlp_usg_map \
  149. & NLP_USG_FREE_ACK_BIT)
  150. #define NLP_SET_FREE_ACK(ndlp) ((ndlp)->nlp_usg_map \
  151. |= NLP_USG_FREE_ACK_BIT)
  152. /* There are 4 different double linked lists nodelist entries can reside on.
  153. * The Port Login (PLOGI) list and Address Discovery (ADISC) list are used
  154. * when Link Up discovery or Registered State Change Notification (RSCN)
  155. * processing is needed. Each list holds the nodes that require a PLOGI or
  156. * ADISC Extended Link Service (ELS) request. These lists keep track of the
  157. * nodes affected by an RSCN, or a Link Up (Typically, all nodes are effected
  158. * by Link Up) event. The unmapped_list contains all nodes that have
  159. * successfully logged into at the Fibre Channel level. The
  160. * mapped_list will contain all nodes that are mapped FCP targets.
  161. *
  162. * The bind list is a list of undiscovered (potentially non-existent) nodes
  163. * that we have saved binding information on. This information is used when
  164. * nodes transition from the unmapped to the mapped list.
  165. */
  166. /* Defines for nlp_state */
  167. #define NLP_STE_UNUSED_NODE 0x0 /* node is just allocated */
  168. #define NLP_STE_PLOGI_ISSUE 0x1 /* PLOGI was sent to NL_PORT */
  169. #define NLP_STE_ADISC_ISSUE 0x2 /* ADISC was sent to NL_PORT */
  170. #define NLP_STE_REG_LOGIN_ISSUE 0x3 /* REG_LOGIN was issued for NL_PORT */
  171. #define NLP_STE_PRLI_ISSUE 0x4 /* PRLI was sent to NL_PORT */
  172. #define NLP_STE_UNMAPPED_NODE 0x5 /* PRLI completed from NL_PORT */
  173. #define NLP_STE_MAPPED_NODE 0x6 /* Identified as a FCP Target */
  174. #define NLP_STE_NPR_NODE 0x7 /* NPort disappeared */
  175. #define NLP_STE_MAX_STATE 0x8
  176. #define NLP_STE_FREED_NODE 0xff /* node entry was freed to MEM_NLP */
  177. /* For UNUSED_NODE state, the node has just been allocated.
  178. * For PLOGI_ISSUE and REG_LOGIN_ISSUE, the node is on
  179. * the PLOGI list. For REG_LOGIN_COMPL, the node is taken off the PLOGI list
  180. * and put on the unmapped list. For ADISC processing, the node is taken off
  181. * the ADISC list and placed on either the mapped or unmapped list (depending
  182. * on its previous state). Once on the unmapped list, a PRLI is issued and the
  183. * state changed to PRLI_ISSUE. When the PRLI completion occurs, the state is
  184. * changed to PRLI_COMPL. If the completion indicates a mapped
  185. * node, the node is taken off the unmapped list. The binding list is checked
  186. * for a valid binding, or a binding is automatically assigned. If binding
  187. * assignment is unsuccessful, the node is left on the unmapped list. If
  188. * binding assignment is successful, the associated binding list entry (if
  189. * any) is removed, and the node is placed on the mapped list.
  190. */
  191. /*
  192. * For a Link Down, all nodes on the ADISC, PLOGI, unmapped or mapped
  193. * lists will receive a DEVICE_RECOVERY event. If the linkdown or devloss timers
  194. * expire, all effected nodes will receive a DEVICE_RM event.
  195. */
  196. /*
  197. * For a Link Up or RSCN, all nodes will move from the mapped / unmapped lists
  198. * to either the ADISC or PLOGI list. After a Nameserver query or ALPA loopmap
  199. * check, additional nodes may be added (DEVICE_ADD) or removed (DEVICE_RM) to /
  200. * from the PLOGI or ADISC lists. Once the PLOGI and ADISC lists are populated,
  201. * we will first process the ADISC list. 32 entries are processed initially and
  202. * ADISC is initited for each one. Completions / Events for each node are
  203. * funnelled thru the state machine. As each node finishes ADISC processing, it
  204. * starts ADISC for any nodes waiting for ADISC processing. If no nodes are
  205. * waiting, and the ADISC list count is identically 0, then we are done. For
  206. * Link Up discovery, since all nodes on the PLOGI list are UNREG_LOGIN'ed, we
  207. * can issue a CLEAR_LA and reenable Link Events. Next we will process the PLOGI
  208. * list. 32 entries are processed initially and PLOGI is initited for each one.
  209. * Completions / Events for each node are funnelled thru the state machine. As
  210. * each node finishes PLOGI processing, it starts PLOGI for any nodes waiting
  211. * for PLOGI processing. If no nodes are waiting, and the PLOGI list count is
  212. * identically 0, then we are done. We have now completed discovery / RSCN
  213. * handling. Upon completion, ALL nodes should be on either the mapped or
  214. * unmapped lists.
  215. */
  216. /* Defines for Node List Entry Events that could happen */
  217. #define NLP_EVT_RCV_PLOGI 0x0 /* Rcv'd an ELS PLOGI command */
  218. #define NLP_EVT_RCV_PRLI 0x1 /* Rcv'd an ELS PRLI command */
  219. #define NLP_EVT_RCV_LOGO 0x2 /* Rcv'd an ELS LOGO command */
  220. #define NLP_EVT_RCV_ADISC 0x3 /* Rcv'd an ELS ADISC command */
  221. #define NLP_EVT_RCV_PDISC 0x4 /* Rcv'd an ELS PDISC command */
  222. #define NLP_EVT_RCV_PRLO 0x5 /* Rcv'd an ELS PRLO command */
  223. #define NLP_EVT_CMPL_PLOGI 0x6 /* Sent an ELS PLOGI command */
  224. #define NLP_EVT_CMPL_PRLI 0x7 /* Sent an ELS PRLI command */
  225. #define NLP_EVT_CMPL_LOGO 0x8 /* Sent an ELS LOGO command */
  226. #define NLP_EVT_CMPL_ADISC 0x9 /* Sent an ELS ADISC command */
  227. #define NLP_EVT_CMPL_REG_LOGIN 0xa /* REG_LOGIN mbox cmd completed */
  228. #define NLP_EVT_DEVICE_RM 0xb /* Device not found in NS / ALPAmap */
  229. #define NLP_EVT_DEVICE_RECOVERY 0xc /* Device existence unknown */
  230. #define NLP_EVT_MAX_EVENT 0xd