ehea_qmr.h 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390
  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 (1UL << EHEA_PAGESHIFT)
  37. #define EHEA_SECTSIZE (1UL << 24)
  38. #define EHEA_PAGES_PER_SECTION (EHEA_SECTSIZE >> EHEA_PAGESHIFT)
  39. #define EHEA_HUGEPAGESHIFT 34
  40. #define EHEA_HUGEPAGE_SIZE (1UL << EHEA_HUGEPAGESHIFT)
  41. #define EHEA_HUGEPAGE_PFN_MASK ((EHEA_HUGEPAGE_SIZE - 1) >> PAGE_SHIFT)
  42. #if ((1UL << SECTION_SIZE_BITS) < EHEA_SECTSIZE)
  43. #error eHEA module cannot work if kernel sectionsize < ehea sectionsize
  44. #endif
  45. /* Some abbreviations used here:
  46. *
  47. * WQE - Work Queue Entry
  48. * SWQE - Send Work Queue Entry
  49. * RWQE - Receive Work Queue Entry
  50. * CQE - Completion Queue Entry
  51. * EQE - Event Queue Entry
  52. * MR - Memory Region
  53. */
  54. /* Use of WR_ID field for EHEA */
  55. #define EHEA_WR_ID_COUNT EHEA_BMASK_IBM(0, 19)
  56. #define EHEA_WR_ID_TYPE EHEA_BMASK_IBM(20, 23)
  57. #define EHEA_SWQE2_TYPE 0x1
  58. #define EHEA_SWQE3_TYPE 0x2
  59. #define EHEA_RWQE2_TYPE 0x3
  60. #define EHEA_RWQE3_TYPE 0x4
  61. #define EHEA_WR_ID_INDEX EHEA_BMASK_IBM(24, 47)
  62. #define EHEA_WR_ID_REFILL EHEA_BMASK_IBM(48, 63)
  63. struct ehea_vsgentry {
  64. u64 vaddr;
  65. u32 l_key;
  66. u32 len;
  67. };
  68. /* maximum number of sg entries allowed in a WQE */
  69. #define EHEA_MAX_WQE_SG_ENTRIES 252
  70. #define SWQE2_MAX_IMM (0xD0 - 0x30)
  71. #define SWQE3_MAX_IMM 224
  72. /* tx control flags for swqe */
  73. #define EHEA_SWQE_CRC 0x8000
  74. #define EHEA_SWQE_IP_CHECKSUM 0x4000
  75. #define EHEA_SWQE_TCP_CHECKSUM 0x2000
  76. #define EHEA_SWQE_TSO 0x1000
  77. #define EHEA_SWQE_SIGNALLED_COMPLETION 0x0800
  78. #define EHEA_SWQE_VLAN_INSERT 0x0400
  79. #define EHEA_SWQE_IMM_DATA_PRESENT 0x0200
  80. #define EHEA_SWQE_DESCRIPTORS_PRESENT 0x0100
  81. #define EHEA_SWQE_WRAP_CTL_REC 0x0080
  82. #define EHEA_SWQE_WRAP_CTL_FORCE 0x0040
  83. #define EHEA_SWQE_BIND 0x0020
  84. #define EHEA_SWQE_PURGE 0x0010
  85. /* sizeof(struct ehea_swqe) less the union */
  86. #define SWQE_HEADER_SIZE 32
  87. struct ehea_swqe {
  88. u64 wr_id;
  89. u16 tx_control;
  90. u16 vlan_tag;
  91. u8 reserved1;
  92. u8 ip_start;
  93. u8 ip_end;
  94. u8 immediate_data_length;
  95. u8 tcp_offset;
  96. u8 reserved2;
  97. u16 tcp_end;
  98. u8 wrap_tag;
  99. u8 descriptors; /* number of valid descriptors in WQE */
  100. u16 reserved3;
  101. u16 reserved4;
  102. u16 mss;
  103. u32 reserved5;
  104. union {
  105. /* Send WQE Format 1 */
  106. struct {
  107. struct ehea_vsgentry sg_list[EHEA_MAX_WQE_SG_ENTRIES];
  108. } no_immediate_data;
  109. /* Send WQE Format 2 */
  110. struct {
  111. struct ehea_vsgentry sg_entry;
  112. /* 0x30 */
  113. u8 immediate_data[SWQE2_MAX_IMM];
  114. /* 0xd0 */
  115. struct ehea_vsgentry sg_list[EHEA_MAX_WQE_SG_ENTRIES-1];
  116. } immdata_desc __attribute__ ((packed));
  117. /* Send WQE Format 3 */
  118. struct {
  119. u8 immediate_data[SWQE3_MAX_IMM];
  120. } immdata_nodesc;
  121. } u;
  122. };
  123. struct ehea_rwqe {
  124. u64 wr_id; /* work request ID */
  125. u8 reserved1[5];
  126. u8 data_segments;
  127. u16 reserved2;
  128. u64 reserved3;
  129. u64 reserved4;
  130. struct ehea_vsgentry sg_list[EHEA_MAX_WQE_SG_ENTRIES];
  131. };
  132. #define EHEA_CQE_VLAN_TAG_XTRACT 0x0400
  133. #define EHEA_CQE_TYPE_RQ 0x60
  134. #define EHEA_CQE_STAT_ERR_MASK 0x700F
  135. #define EHEA_CQE_STAT_FAT_ERR_MASK 0xF
  136. #define EHEA_CQE_STAT_ERR_TCP 0x4000
  137. #define EHEA_CQE_STAT_ERR_IP 0x2000
  138. #define EHEA_CQE_STAT_ERR_CRC 0x1000
  139. struct ehea_cqe {
  140. u64 wr_id; /* work request ID from WQE */
  141. u8 type;
  142. u8 valid;
  143. u16 status;
  144. u16 reserved1;
  145. u16 num_bytes_transfered;
  146. u16 vlan_tag;
  147. u16 inet_checksum_value;
  148. u8 reserved2;
  149. u8 header_length;
  150. u16 reserved3;
  151. u16 page_offset;
  152. u16 wqe_count;
  153. u32 qp_token;
  154. u32 timestamp;
  155. u32 reserved4;
  156. u64 reserved5[3];
  157. };
  158. #define EHEA_EQE_VALID EHEA_BMASK_IBM(0, 0)
  159. #define EHEA_EQE_IS_CQE EHEA_BMASK_IBM(1, 1)
  160. #define EHEA_EQE_IDENTIFIER EHEA_BMASK_IBM(2, 7)
  161. #define EHEA_EQE_QP_CQ_NUMBER EHEA_BMASK_IBM(8, 31)
  162. #define EHEA_EQE_QP_TOKEN EHEA_BMASK_IBM(32, 63)
  163. #define EHEA_EQE_CQ_TOKEN EHEA_BMASK_IBM(32, 63)
  164. #define EHEA_EQE_KEY EHEA_BMASK_IBM(32, 63)
  165. #define EHEA_EQE_PORT_NUMBER EHEA_BMASK_IBM(56, 63)
  166. #define EHEA_EQE_EQ_NUMBER EHEA_BMASK_IBM(48, 63)
  167. #define EHEA_EQE_SM_ID EHEA_BMASK_IBM(48, 63)
  168. #define EHEA_EQE_SM_MECH_NUMBER EHEA_BMASK_IBM(48, 55)
  169. #define EHEA_EQE_SM_PORT_NUMBER EHEA_BMASK_IBM(56, 63)
  170. struct ehea_eqe {
  171. u64 entry;
  172. };
  173. #define ERROR_DATA_LENGTH EHEA_BMASK_IBM(52, 63)
  174. #define ERROR_DATA_TYPE EHEA_BMASK_IBM(0, 7)
  175. static inline void *hw_qeit_calc(struct hw_queue *queue, u64 q_offset)
  176. {
  177. struct ehea_page *current_page;
  178. if (q_offset >= queue->queue_length)
  179. q_offset -= queue->queue_length;
  180. current_page = (queue->queue_pages)[q_offset >> EHEA_PAGESHIFT];
  181. return &current_page->entries[q_offset & (EHEA_PAGESIZE - 1)];
  182. }
  183. static inline void *hw_qeit_get(struct hw_queue *queue)
  184. {
  185. return hw_qeit_calc(queue, queue->current_q_offset);
  186. }
  187. static inline void hw_qeit_inc(struct hw_queue *queue)
  188. {
  189. queue->current_q_offset += queue->qe_size;
  190. if (queue->current_q_offset >= queue->queue_length) {
  191. queue->current_q_offset = 0;
  192. /* toggle the valid flag */
  193. queue->toggle_state = (~queue->toggle_state) & 1;
  194. }
  195. }
  196. static inline void *hw_qeit_get_inc(struct hw_queue *queue)
  197. {
  198. void *retvalue = hw_qeit_get(queue);
  199. hw_qeit_inc(queue);
  200. return retvalue;
  201. }
  202. static inline void *hw_qeit_get_inc_valid(struct hw_queue *queue)
  203. {
  204. struct ehea_cqe *retvalue = hw_qeit_get(queue);
  205. u8 valid = retvalue->valid;
  206. void *pref;
  207. if ((valid >> 7) == (queue->toggle_state & 1)) {
  208. /* this is a good one */
  209. hw_qeit_inc(queue);
  210. pref = hw_qeit_calc(queue, queue->current_q_offset);
  211. prefetch(pref);
  212. prefetch(pref + 128);
  213. } else
  214. retvalue = NULL;
  215. return retvalue;
  216. }
  217. static inline void *hw_qeit_get_valid(struct hw_queue *queue)
  218. {
  219. struct ehea_cqe *retvalue = hw_qeit_get(queue);
  220. void *pref;
  221. u8 valid;
  222. pref = hw_qeit_calc(queue, queue->current_q_offset);
  223. prefetch(pref);
  224. prefetch(pref + 128);
  225. prefetch(pref + 256);
  226. valid = retvalue->valid;
  227. if (!((valid >> 7) == (queue->toggle_state & 1)))
  228. retvalue = NULL;
  229. return retvalue;
  230. }
  231. static inline void *hw_qeit_reset(struct hw_queue *queue)
  232. {
  233. queue->current_q_offset = 0;
  234. return hw_qeit_get(queue);
  235. }
  236. static inline void *hw_qeit_eq_get_inc(struct hw_queue *queue)
  237. {
  238. u64 last_entry_in_q = queue->queue_length - queue->qe_size;
  239. void *retvalue;
  240. retvalue = hw_qeit_get(queue);
  241. queue->current_q_offset += queue->qe_size;
  242. if (queue->current_q_offset > last_entry_in_q) {
  243. queue->current_q_offset = 0;
  244. queue->toggle_state = (~queue->toggle_state) & 1;
  245. }
  246. return retvalue;
  247. }
  248. static inline void *hw_eqit_eq_get_inc_valid(struct hw_queue *queue)
  249. {
  250. void *retvalue = hw_qeit_get(queue);
  251. u32 qe = *(u8 *)retvalue;
  252. if ((qe >> 7) == (queue->toggle_state & 1))
  253. hw_qeit_eq_get_inc(queue);
  254. else
  255. retvalue = NULL;
  256. return retvalue;
  257. }
  258. static inline struct ehea_rwqe *ehea_get_next_rwqe(struct ehea_qp *qp,
  259. int rq_nr)
  260. {
  261. struct hw_queue *queue;
  262. if (rq_nr == 1)
  263. queue = &qp->hw_rqueue1;
  264. else if (rq_nr == 2)
  265. queue = &qp->hw_rqueue2;
  266. else
  267. queue = &qp->hw_rqueue3;
  268. return hw_qeit_get_inc(queue);
  269. }
  270. static inline struct ehea_swqe *ehea_get_swqe(struct ehea_qp *my_qp,
  271. int *wqe_index)
  272. {
  273. struct hw_queue *queue = &my_qp->hw_squeue;
  274. struct ehea_swqe *wqe_p;
  275. *wqe_index = (queue->current_q_offset) >> (7 + EHEA_SG_SQ);
  276. wqe_p = hw_qeit_get_inc(&my_qp->hw_squeue);
  277. return wqe_p;
  278. }
  279. static inline void ehea_post_swqe(struct ehea_qp *my_qp, struct ehea_swqe *swqe)
  280. {
  281. iosync();
  282. ehea_update_sqa(my_qp, 1);
  283. }
  284. static inline struct ehea_cqe *ehea_poll_rq1(struct ehea_qp *qp, int *wqe_index)
  285. {
  286. struct hw_queue *queue = &qp->hw_rqueue1;
  287. *wqe_index = (queue->current_q_offset) >> (7 + EHEA_SG_RQ1);
  288. return hw_qeit_get_valid(queue);
  289. }
  290. static inline void ehea_inc_cq(struct ehea_cq *cq)
  291. {
  292. hw_qeit_inc(&cq->hw_queue);
  293. }
  294. static inline void ehea_inc_rq1(struct ehea_qp *qp)
  295. {
  296. hw_qeit_inc(&qp->hw_rqueue1);
  297. }
  298. static inline struct ehea_cqe *ehea_poll_cq(struct ehea_cq *my_cq)
  299. {
  300. return hw_qeit_get_valid(&my_cq->hw_queue);
  301. }
  302. #define EHEA_CQ_REGISTER_ORIG 0
  303. #define EHEA_EQ_REGISTER_ORIG 0
  304. enum ehea_eq_type {
  305. EHEA_EQ = 0, /* event queue */
  306. EHEA_NEQ /* notification event queue */
  307. };
  308. struct ehea_eq *ehea_create_eq(struct ehea_adapter *adapter,
  309. enum ehea_eq_type type,
  310. const u32 length, const u8 eqe_gen);
  311. int ehea_destroy_eq(struct ehea_eq *eq);
  312. struct ehea_eqe *ehea_poll_eq(struct ehea_eq *eq);
  313. struct ehea_cq *ehea_create_cq(struct ehea_adapter *adapter, int cqe,
  314. u64 eq_handle, u32 cq_token);
  315. int ehea_destroy_cq(struct ehea_cq *cq);
  316. struct ehea_qp *ehea_create_qp(struct ehea_adapter *adapter, u32 pd,
  317. struct ehea_qp_init_attr *init_attr);
  318. int ehea_destroy_qp(struct ehea_qp *qp);
  319. int ehea_reg_kernel_mr(struct ehea_adapter *adapter, struct ehea_mr *mr);
  320. int ehea_gen_smr(struct ehea_adapter *adapter, struct ehea_mr *old_mr,
  321. struct ehea_mr *shared_mr);
  322. int ehea_rem_mr(struct ehea_mr *mr);
  323. void ehea_error_data(struct ehea_adapter *adapter, u64 res_handle);
  324. int ehea_add_sect_bmap(unsigned long pfn, unsigned long nr_pages);
  325. int ehea_rem_sect_bmap(unsigned long pfn, unsigned long nr_pages);
  326. int ehea_create_busmap(void);
  327. void ehea_destroy_busmap(void);
  328. u64 ehea_map_vaddr(void *caddr);
  329. #endif /* __EHEA_QMR_H__ */