ehea_qmr.h 9.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363
  1. /*
  2. * linux/drivers/net/ehea/ehea_qmr.h
  3. *
  4. * eHEA ethernet device driver for IBM eServer System p
  5. *
  6. * (C) Copyright IBM Corp. 2006
  7. *
  8. * Authors:
  9. * Christoph Raisch <raisch@de.ibm.com>
  10. * Jan-Bernd Themann <themann@de.ibm.com>
  11. * Thomas Klein <tklein@de.ibm.com>
  12. *
  13. *
  14. * This program is free software; you can redistribute it and/or modify
  15. * it under the terms of the GNU General Public License as published by
  16. * the Free Software Foundation; either version 2, or (at your option)
  17. * any later version.
  18. *
  19. * This program is distributed in the hope that it will be useful,
  20. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  21. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  22. * GNU General Public License for more details.
  23. *
  24. * You should have received a copy of the GNU General Public License
  25. * along with this program; if not, write to the Free Software
  26. * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
  27. */
  28. #ifndef __EHEA_QMR_H__
  29. #define __EHEA_QMR_H__
  30. #include "ehea.h"
  31. #include "ehea_hw.h"
  32. /*
  33. * page size of ehea hardware queues
  34. */
  35. #define EHEA_PAGESHIFT 12
  36. #define EHEA_PAGESIZE 4096UL
  37. /* Some abbreviations used here:
  38. *
  39. * WQE - Work Queue Entry
  40. * SWQE - Send Work Queue Entry
  41. * RWQE - Receive Work Queue Entry
  42. * CQE - Completion Queue Entry
  43. * EQE - Event Queue Entry
  44. * MR - Memory Region
  45. */
  46. /* Use of WR_ID field for EHEA */
  47. #define EHEA_WR_ID_COUNT EHEA_BMASK_IBM(0, 19)
  48. #define EHEA_WR_ID_TYPE EHEA_BMASK_IBM(20, 23)
  49. #define EHEA_SWQE2_TYPE 0x1
  50. #define EHEA_SWQE3_TYPE 0x2
  51. #define EHEA_RWQE2_TYPE 0x3
  52. #define EHEA_RWQE3_TYPE 0x4
  53. #define EHEA_WR_ID_INDEX EHEA_BMASK_IBM(24, 47)
  54. #define EHEA_WR_ID_REFILL EHEA_BMASK_IBM(48, 63)
  55. struct ehea_vsgentry {
  56. u64 vaddr;
  57. u32 l_key;
  58. u32 len;
  59. };
  60. /* maximum number of sg entries allowed in a WQE */
  61. #define EHEA_MAX_WQE_SG_ENTRIES 252
  62. #define SWQE2_MAX_IMM (0xD0 - 0x30)
  63. #define SWQE3_MAX_IMM 224
  64. /* tx control flags for swqe */
  65. #define EHEA_SWQE_CRC 0x8000
  66. #define EHEA_SWQE_IP_CHECKSUM 0x4000
  67. #define EHEA_SWQE_TCP_CHECKSUM 0x2000
  68. #define EHEA_SWQE_TSO 0x1000
  69. #define EHEA_SWQE_SIGNALLED_COMPLETION 0x0800
  70. #define EHEA_SWQE_VLAN_INSERT 0x0400
  71. #define EHEA_SWQE_IMM_DATA_PRESENT 0x0200
  72. #define EHEA_SWQE_DESCRIPTORS_PRESENT 0x0100
  73. #define EHEA_SWQE_WRAP_CTL_REC 0x0080
  74. #define EHEA_SWQE_WRAP_CTL_FORCE 0x0040
  75. #define EHEA_SWQE_BIND 0x0020
  76. #define EHEA_SWQE_PURGE 0x0010
  77. /* sizeof(struct ehea_swqe) less the union */
  78. #define SWQE_HEADER_SIZE 32
  79. struct ehea_swqe {
  80. u64 wr_id;
  81. u16 tx_control;
  82. u16 vlan_tag;
  83. u8 reserved1;
  84. u8 ip_start;
  85. u8 ip_end;
  86. u8 immediate_data_length;
  87. u8 tcp_offset;
  88. u8 reserved2;
  89. u16 tcp_end;
  90. u8 wrap_tag;
  91. u8 descriptors; /* number of valid descriptors in WQE */
  92. u16 reserved3;
  93. u16 reserved4;
  94. u16 mss;
  95. u32 reserved5;
  96. union {
  97. /* Send WQE Format 1 */
  98. struct {
  99. struct ehea_vsgentry sg_list[EHEA_MAX_WQE_SG_ENTRIES];
  100. } no_immediate_data;
  101. /* Send WQE Format 2 */
  102. struct {
  103. struct ehea_vsgentry sg_entry;
  104. /* 0x30 */
  105. u8 immediate_data[SWQE2_MAX_IMM];
  106. /* 0xd0 */
  107. struct ehea_vsgentry sg_list[EHEA_MAX_WQE_SG_ENTRIES-1];
  108. } immdata_desc __attribute__ ((packed));
  109. /* Send WQE Format 3 */
  110. struct {
  111. u8 immediate_data[SWQE3_MAX_IMM];
  112. } immdata_nodesc;
  113. } u;
  114. };
  115. struct ehea_rwqe {
  116. u64 wr_id; /* work request ID */
  117. u8 reserved1[5];
  118. u8 data_segments;
  119. u16 reserved2;
  120. u64 reserved3;
  121. u64 reserved4;
  122. struct ehea_vsgentry sg_list[EHEA_MAX_WQE_SG_ENTRIES];
  123. };
  124. #define EHEA_CQE_VLAN_TAG_XTRACT 0x0400
  125. #define EHEA_CQE_TYPE_RQ 0x60
  126. #define EHEA_CQE_STAT_ERR_MASK 0x721F
  127. #define EHEA_CQE_STAT_FAT_ERR_MASK 0x1F
  128. #define EHEA_CQE_STAT_ERR_TCP 0x4000
  129. struct ehea_cqe {
  130. u64 wr_id; /* work request ID from WQE */
  131. u8 type;
  132. u8 valid;
  133. u16 status;
  134. u16 reserved1;
  135. u16 num_bytes_transfered;
  136. u16 vlan_tag;
  137. u16 inet_checksum_value;
  138. u8 reserved2;
  139. u8 header_length;
  140. u16 reserved3;
  141. u16 page_offset;
  142. u16 wqe_count;
  143. u32 qp_token;
  144. u32 timestamp;
  145. u32 reserved4;
  146. u64 reserved5[3];
  147. };
  148. #define EHEA_EQE_VALID EHEA_BMASK_IBM(0, 0)
  149. #define EHEA_EQE_IS_CQE EHEA_BMASK_IBM(1, 1)
  150. #define EHEA_EQE_IDENTIFIER EHEA_BMASK_IBM(2, 7)
  151. #define EHEA_EQE_QP_CQ_NUMBER EHEA_BMASK_IBM(8, 31)
  152. #define EHEA_EQE_QP_TOKEN EHEA_BMASK_IBM(32, 63)
  153. #define EHEA_EQE_CQ_TOKEN EHEA_BMASK_IBM(32, 63)
  154. #define EHEA_EQE_KEY EHEA_BMASK_IBM(32, 63)
  155. #define EHEA_EQE_PORT_NUMBER EHEA_BMASK_IBM(56, 63)
  156. #define EHEA_EQE_EQ_NUMBER EHEA_BMASK_IBM(48, 63)
  157. #define EHEA_EQE_SM_ID EHEA_BMASK_IBM(48, 63)
  158. #define EHEA_EQE_SM_MECH_NUMBER EHEA_BMASK_IBM(48, 55)
  159. #define EHEA_EQE_SM_PORT_NUMBER EHEA_BMASK_IBM(56, 63)
  160. struct ehea_eqe {
  161. u64 entry;
  162. };
  163. #define ERROR_DATA_LENGTH EHEA_BMASK_IBM(52,63)
  164. #define ERROR_DATA_TYPE EHEA_BMASK_IBM(0,7)
  165. static inline void *hw_qeit_calc(struct hw_queue *queue, u64 q_offset)
  166. {
  167. struct ehea_page *current_page;
  168. if (q_offset >= queue->queue_length)
  169. q_offset -= queue->queue_length;
  170. current_page = (queue->queue_pages)[q_offset >> EHEA_PAGESHIFT];
  171. return &current_page->entries[q_offset & (EHEA_PAGESIZE - 1)];
  172. }
  173. static inline void *hw_qeit_get(struct hw_queue *queue)
  174. {
  175. return hw_qeit_calc(queue, queue->current_q_offset);
  176. }
  177. static inline void hw_qeit_inc(struct hw_queue *queue)
  178. {
  179. queue->current_q_offset += queue->qe_size;
  180. if (queue->current_q_offset >= queue->queue_length) {
  181. queue->current_q_offset = 0;
  182. /* toggle the valid flag */
  183. queue->toggle_state = (~queue->toggle_state) & 1;
  184. }
  185. }
  186. static inline void *hw_qeit_get_inc(struct hw_queue *queue)
  187. {
  188. void *retvalue = hw_qeit_get(queue);
  189. hw_qeit_inc(queue);
  190. return retvalue;
  191. }
  192. static inline void *hw_qeit_get_inc_valid(struct hw_queue *queue)
  193. {
  194. struct ehea_cqe *retvalue = hw_qeit_get(queue);
  195. u8 valid = retvalue->valid;
  196. void *pref;
  197. if ((valid >> 7) == (queue->toggle_state & 1)) {
  198. /* this is a good one */
  199. hw_qeit_inc(queue);
  200. pref = hw_qeit_calc(queue, queue->current_q_offset);
  201. prefetch(pref);
  202. prefetch(pref + 128);
  203. } else
  204. retvalue = NULL;
  205. return retvalue;
  206. }
  207. static inline void *hw_qeit_get_valid(struct hw_queue *queue)
  208. {
  209. struct ehea_cqe *retvalue = hw_qeit_get(queue);
  210. void *pref;
  211. u8 valid;
  212. pref = hw_qeit_calc(queue, queue->current_q_offset);
  213. prefetch(pref);
  214. prefetch(pref + 128);
  215. prefetch(pref + 256);
  216. valid = retvalue->valid;
  217. if (!((valid >> 7) == (queue->toggle_state & 1)))
  218. retvalue = NULL;
  219. return retvalue;
  220. }
  221. static inline void *hw_qeit_reset(struct hw_queue *queue)
  222. {
  223. queue->current_q_offset = 0;
  224. return hw_qeit_get(queue);
  225. }
  226. static inline void *hw_qeit_eq_get_inc(struct hw_queue *queue)
  227. {
  228. u64 last_entry_in_q = queue->queue_length - queue->qe_size;
  229. void *retvalue;
  230. retvalue = hw_qeit_get(queue);
  231. queue->current_q_offset += queue->qe_size;
  232. if (queue->current_q_offset > last_entry_in_q) {
  233. queue->current_q_offset = 0;
  234. queue->toggle_state = (~queue->toggle_state) & 1;
  235. }
  236. return retvalue;
  237. }
  238. static inline void *hw_eqit_eq_get_inc_valid(struct hw_queue *queue)
  239. {
  240. void *retvalue = hw_qeit_get(queue);
  241. u32 qe = *(u8*)retvalue;
  242. if ((qe >> 7) == (queue->toggle_state & 1))
  243. hw_qeit_eq_get_inc(queue);
  244. else
  245. retvalue = NULL;
  246. return retvalue;
  247. }
  248. static inline struct ehea_rwqe *ehea_get_next_rwqe(struct ehea_qp *qp,
  249. int rq_nr)
  250. {
  251. struct hw_queue *queue;
  252. if (rq_nr == 1)
  253. queue = &qp->hw_rqueue1;
  254. else if (rq_nr == 2)
  255. queue = &qp->hw_rqueue2;
  256. else
  257. queue = &qp->hw_rqueue3;
  258. return hw_qeit_get_inc(queue);
  259. }
  260. static inline struct ehea_swqe *ehea_get_swqe(struct ehea_qp *my_qp,
  261. int *wqe_index)
  262. {
  263. struct hw_queue *queue = &my_qp->hw_squeue;
  264. struct ehea_swqe *wqe_p;
  265. *wqe_index = (queue->current_q_offset) >> (7 + EHEA_SG_SQ);
  266. wqe_p = hw_qeit_get_inc(&my_qp->hw_squeue);
  267. return wqe_p;
  268. }
  269. static inline void ehea_post_swqe(struct ehea_qp *my_qp, struct ehea_swqe *swqe)
  270. {
  271. iosync();
  272. ehea_update_sqa(my_qp, 1);
  273. }
  274. static inline struct ehea_cqe *ehea_poll_rq1(struct ehea_qp *qp, int *wqe_index)
  275. {
  276. struct hw_queue *queue = &qp->hw_rqueue1;
  277. *wqe_index = (queue->current_q_offset) >> (7 + EHEA_SG_RQ1);
  278. return hw_qeit_get_valid(queue);
  279. }
  280. static inline void ehea_inc_rq1(struct ehea_qp *qp)
  281. {
  282. hw_qeit_inc(&qp->hw_rqueue1);
  283. }
  284. static inline struct ehea_cqe *ehea_poll_cq(struct ehea_cq *my_cq)
  285. {
  286. return hw_qeit_get_inc_valid(&my_cq->hw_queue);
  287. }
  288. #define EHEA_CQ_REGISTER_ORIG 0
  289. #define EHEA_EQ_REGISTER_ORIG 0
  290. enum ehea_eq_type {
  291. EHEA_EQ = 0, /* event queue */
  292. EHEA_NEQ /* notification event queue */
  293. };
  294. struct ehea_eq *ehea_create_eq(struct ehea_adapter *adapter,
  295. enum ehea_eq_type type,
  296. const u32 length, const u8 eqe_gen);
  297. int ehea_destroy_eq(struct ehea_eq *eq);
  298. struct ehea_eqe *ehea_poll_eq(struct ehea_eq *eq);
  299. struct ehea_cq *ehea_create_cq(struct ehea_adapter *adapter, int cqe,
  300. u64 eq_handle, u32 cq_token);
  301. int ehea_destroy_cq(struct ehea_cq *cq);
  302. struct ehea_qp *ehea_create_qp(struct ehea_adapter * adapter, u32 pd,
  303. struct ehea_qp_init_attr *init_attr);
  304. int ehea_destroy_qp(struct ehea_qp *qp);
  305. int ehea_reg_mr_adapter(struct ehea_adapter *adapter);
  306. void ehea_error_data(struct ehea_adapter *adapter, u64 res_handle);
  307. #endif /* __EHEA_QMR_H__ */