t4.h 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685
  1. /*
  2. * Copyright (c) 2009-2010 Chelsio, Inc. All rights reserved.
  3. *
  4. * This software is available to you under a choice of one of two
  5. * licenses. You may choose to be licensed under the terms of the GNU
  6. * General Public License (GPL) Version 2, available from the file
  7. * COPYING in the main directory of this source tree, or the
  8. * OpenIB.org BSD license below:
  9. *
  10. * Redistribution and use in source and binary forms, with or
  11. * without modification, are permitted provided that the following
  12. * conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above
  15. * copyright notice, this list of conditions and the following
  16. * disclaimer.
  17. * - Redistributions in binary form must reproduce the above
  18. * copyright notice, this list of conditions and the following
  19. * disclaimer in the documentation and/or other materials
  20. * provided with the distribution.
  21. *
  22. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  23. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  24. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  25. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  26. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  27. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  28. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  29. * SOFTWARE.
  30. */
  31. #ifndef __T4_H__
  32. #define __T4_H__
  33. #include "t4_hw.h"
  34. #include "t4_regs.h"
  35. #include "t4_msg.h"
  36. #include "t4fw_ri_api.h"
  37. #define T4_MAX_NUM_PD 65536
  38. #define T4_MAX_MR_SIZE (~0ULL)
  39. #define T4_PAGESIZE_MASK 0xffff000 /* 4KB-128MB */
  40. #define T4_STAG_UNSET 0xffffffff
  41. #define T4_FW_MAJ 0
  42. #define PCIE_MA_SYNC_A 0x30b4
  43. struct t4_status_page {
  44. __be32 rsvd1; /* flit 0 - hw owns */
  45. __be16 rsvd2;
  46. __be16 qid;
  47. __be16 cidx;
  48. __be16 pidx;
  49. u8 qp_err; /* flit 1 - sw owns */
  50. u8 db_off;
  51. u8 pad;
  52. u16 host_wq_pidx;
  53. u16 host_cidx;
  54. u16 host_pidx;
  55. };
  56. #define T4_EQ_ENTRY_SIZE 64
  57. #define T4_SQ_NUM_SLOTS 5
  58. #define T4_SQ_NUM_BYTES (T4_EQ_ENTRY_SIZE * T4_SQ_NUM_SLOTS)
  59. #define T4_MAX_SEND_SGE ((T4_SQ_NUM_BYTES - sizeof(struct fw_ri_send_wr) - \
  60. sizeof(struct fw_ri_isgl)) / sizeof(struct fw_ri_sge))
  61. #define T4_MAX_SEND_INLINE ((T4_SQ_NUM_BYTES - sizeof(struct fw_ri_send_wr) - \
  62. sizeof(struct fw_ri_immd)))
  63. #define T4_MAX_WRITE_INLINE ((T4_SQ_NUM_BYTES - \
  64. sizeof(struct fw_ri_rdma_write_wr) - \
  65. sizeof(struct fw_ri_immd)))
  66. #define T4_MAX_WRITE_SGE ((T4_SQ_NUM_BYTES - \
  67. sizeof(struct fw_ri_rdma_write_wr) - \
  68. sizeof(struct fw_ri_isgl)) / sizeof(struct fw_ri_sge))
  69. #define T4_MAX_FR_IMMD ((T4_SQ_NUM_BYTES - sizeof(struct fw_ri_fr_nsmr_wr) - \
  70. sizeof(struct fw_ri_immd)) & ~31UL)
  71. #define T4_MAX_FR_IMMD_DEPTH (T4_MAX_FR_IMMD / sizeof(u64))
  72. #define T4_MAX_FR_DSGL 1024
  73. #define T4_MAX_FR_DSGL_DEPTH (T4_MAX_FR_DSGL / sizeof(u64))
  74. static inline int t4_max_fr_depth(int use_dsgl)
  75. {
  76. return use_dsgl ? T4_MAX_FR_DSGL_DEPTH : T4_MAX_FR_IMMD_DEPTH;
  77. }
  78. #define T4_RQ_NUM_SLOTS 2
  79. #define T4_RQ_NUM_BYTES (T4_EQ_ENTRY_SIZE * T4_RQ_NUM_SLOTS)
  80. #define T4_MAX_RECV_SGE 4
  81. union t4_wr {
  82. struct fw_ri_res_wr res;
  83. struct fw_ri_wr ri;
  84. struct fw_ri_rdma_write_wr write;
  85. struct fw_ri_send_wr send;
  86. struct fw_ri_rdma_read_wr read;
  87. struct fw_ri_bind_mw_wr bind;
  88. struct fw_ri_fr_nsmr_wr fr;
  89. struct fw_ri_inv_lstag_wr inv;
  90. struct t4_status_page status;
  91. __be64 flits[T4_EQ_ENTRY_SIZE / sizeof(__be64) * T4_SQ_NUM_SLOTS];
  92. };
  93. union t4_recv_wr {
  94. struct fw_ri_recv_wr recv;
  95. struct t4_status_page status;
  96. __be64 flits[T4_EQ_ENTRY_SIZE / sizeof(__be64) * T4_RQ_NUM_SLOTS];
  97. };
  98. static inline void init_wr_hdr(union t4_wr *wqe, u16 wrid,
  99. enum fw_wr_opcodes opcode, u8 flags, u8 len16)
  100. {
  101. wqe->send.opcode = (u8)opcode;
  102. wqe->send.flags = flags;
  103. wqe->send.wrid = wrid;
  104. wqe->send.r1[0] = 0;
  105. wqe->send.r1[1] = 0;
  106. wqe->send.r1[2] = 0;
  107. wqe->send.len16 = len16;
  108. }
  109. /* CQE/AE status codes */
  110. #define T4_ERR_SUCCESS 0x0
  111. #define T4_ERR_STAG 0x1 /* STAG invalid: either the */
  112. /* STAG is offlimt, being 0, */
  113. /* or STAG_key mismatch */
  114. #define T4_ERR_PDID 0x2 /* PDID mismatch */
  115. #define T4_ERR_QPID 0x3 /* QPID mismatch */
  116. #define T4_ERR_ACCESS 0x4 /* Invalid access right */
  117. #define T4_ERR_WRAP 0x5 /* Wrap error */
  118. #define T4_ERR_BOUND 0x6 /* base and bounds voilation */
  119. #define T4_ERR_INVALIDATE_SHARED_MR 0x7 /* attempt to invalidate a */
  120. /* shared memory region */
  121. #define T4_ERR_INVALIDATE_MR_WITH_MW_BOUND 0x8 /* attempt to invalidate a */
  122. /* shared memory region */
  123. #define T4_ERR_ECC 0x9 /* ECC error detected */
  124. #define T4_ERR_ECC_PSTAG 0xA /* ECC error detected when */
  125. /* reading PSTAG for a MW */
  126. /* Invalidate */
  127. #define T4_ERR_PBL_ADDR_BOUND 0xB /* pbl addr out of bounds: */
  128. /* software error */
  129. #define T4_ERR_SWFLUSH 0xC /* SW FLUSHED */
  130. #define T4_ERR_CRC 0x10 /* CRC error */
  131. #define T4_ERR_MARKER 0x11 /* Marker error */
  132. #define T4_ERR_PDU_LEN_ERR 0x12 /* invalid PDU length */
  133. #define T4_ERR_OUT_OF_RQE 0x13 /* out of RQE */
  134. #define T4_ERR_DDP_VERSION 0x14 /* wrong DDP version */
  135. #define T4_ERR_RDMA_VERSION 0x15 /* wrong RDMA version */
  136. #define T4_ERR_OPCODE 0x16 /* invalid rdma opcode */
  137. #define T4_ERR_DDP_QUEUE_NUM 0x17 /* invalid ddp queue number */
  138. #define T4_ERR_MSN 0x18 /* MSN error */
  139. #define T4_ERR_TBIT 0x19 /* tag bit not set correctly */
  140. #define T4_ERR_MO 0x1A /* MO not 0 for TERMINATE */
  141. /* or READ_REQ */
  142. #define T4_ERR_MSN_GAP 0x1B
  143. #define T4_ERR_MSN_RANGE 0x1C
  144. #define T4_ERR_IRD_OVERFLOW 0x1D
  145. #define T4_ERR_RQE_ADDR_BOUND 0x1E /* RQE addr out of bounds: */
  146. /* software error */
  147. #define T4_ERR_INTERNAL_ERR 0x1F /* internal error (opcode */
  148. /* mismatch) */
  149. /*
  150. * CQE defs
  151. */
  152. struct t4_cqe {
  153. __be32 header;
  154. __be32 len;
  155. union {
  156. struct {
  157. __be32 stag;
  158. __be32 msn;
  159. } rcqe;
  160. struct {
  161. u32 nada1;
  162. u16 nada2;
  163. u16 cidx;
  164. } scqe;
  165. struct {
  166. __be32 wrid_hi;
  167. __be32 wrid_low;
  168. } gen;
  169. } u;
  170. __be64 reserved;
  171. __be64 bits_type_ts;
  172. };
  173. /* macros for flit 0 of the cqe */
  174. #define CQE_QPID_S 12
  175. #define CQE_QPID_M 0xFFFFF
  176. #define CQE_QPID_G(x) ((((x) >> CQE_QPID_S)) & CQE_QPID_M)
  177. #define CQE_QPID_V(x) ((x)<<CQE_QPID_S)
  178. #define CQE_SWCQE_S 11
  179. #define CQE_SWCQE_M 0x1
  180. #define CQE_SWCQE_G(x) ((((x) >> CQE_SWCQE_S)) & CQE_SWCQE_M)
  181. #define CQE_SWCQE_V(x) ((x)<<CQE_SWCQE_S)
  182. #define CQE_STATUS_S 5
  183. #define CQE_STATUS_M 0x1F
  184. #define CQE_STATUS_G(x) ((((x) >> CQE_STATUS_S)) & CQE_STATUS_M)
  185. #define CQE_STATUS_V(x) ((x)<<CQE_STATUS_S)
  186. #define CQE_TYPE_S 4
  187. #define CQE_TYPE_M 0x1
  188. #define CQE_TYPE_G(x) ((((x) >> CQE_TYPE_S)) & CQE_TYPE_M)
  189. #define CQE_TYPE_V(x) ((x)<<CQE_TYPE_S)
  190. #define CQE_OPCODE_S 0
  191. #define CQE_OPCODE_M 0xF
  192. #define CQE_OPCODE_G(x) ((((x) >> CQE_OPCODE_S)) & CQE_OPCODE_M)
  193. #define CQE_OPCODE_V(x) ((x)<<CQE_OPCODE_S)
  194. #define SW_CQE(x) (CQE_SWCQE_G(be32_to_cpu((x)->header)))
  195. #define CQE_QPID(x) (CQE_QPID_G(be32_to_cpu((x)->header)))
  196. #define CQE_TYPE(x) (CQE_TYPE_G(be32_to_cpu((x)->header)))
  197. #define SQ_TYPE(x) (CQE_TYPE((x)))
  198. #define RQ_TYPE(x) (!CQE_TYPE((x)))
  199. #define CQE_STATUS(x) (CQE_STATUS_G(be32_to_cpu((x)->header)))
  200. #define CQE_OPCODE(x) (CQE_OPCODE_G(be32_to_cpu((x)->header)))
  201. #define CQE_SEND_OPCODE(x)( \
  202. (CQE_OPCODE_G(be32_to_cpu((x)->header)) == FW_RI_SEND) || \
  203. (CQE_OPCODE_G(be32_to_cpu((x)->header)) == FW_RI_SEND_WITH_SE) || \
  204. (CQE_OPCODE_G(be32_to_cpu((x)->header)) == FW_RI_SEND_WITH_INV) || \
  205. (CQE_OPCODE_G(be32_to_cpu((x)->header)) == FW_RI_SEND_WITH_SE_INV))
  206. #define CQE_LEN(x) (be32_to_cpu((x)->len))
  207. /* used for RQ completion processing */
  208. #define CQE_WRID_STAG(x) (be32_to_cpu((x)->u.rcqe.stag))
  209. #define CQE_WRID_MSN(x) (be32_to_cpu((x)->u.rcqe.msn))
  210. /* used for SQ completion processing */
  211. #define CQE_WRID_SQ_IDX(x) ((x)->u.scqe.cidx)
  212. /* generic accessor macros */
  213. #define CQE_WRID_HI(x) (be32_to_cpu((x)->u.gen.wrid_hi))
  214. #define CQE_WRID_LOW(x) (be32_to_cpu((x)->u.gen.wrid_low))
  215. /* macros for flit 3 of the cqe */
  216. #define CQE_GENBIT_S 63
  217. #define CQE_GENBIT_M 0x1
  218. #define CQE_GENBIT_G(x) (((x) >> CQE_GENBIT_S) & CQE_GENBIT_M)
  219. #define CQE_GENBIT_V(x) ((x)<<CQE_GENBIT_S)
  220. #define CQE_OVFBIT_S 62
  221. #define CQE_OVFBIT_M 0x1
  222. #define CQE_OVFBIT_G(x) ((((x) >> CQE_OVFBIT_S)) & CQE_OVFBIT_M)
  223. #define CQE_IQTYPE_S 60
  224. #define CQE_IQTYPE_M 0x3
  225. #define CQE_IQTYPE_G(x) ((((x) >> CQE_IQTYPE_S)) & CQE_IQTYPE_M)
  226. #define CQE_TS_M 0x0fffffffffffffffULL
  227. #define CQE_TS_G(x) ((x) & CQE_TS_M)
  228. #define CQE_OVFBIT(x) ((unsigned)CQE_OVFBIT_G(be64_to_cpu((x)->bits_type_ts)))
  229. #define CQE_GENBIT(x) ((unsigned)CQE_GENBIT_G(be64_to_cpu((x)->bits_type_ts)))
  230. #define CQE_TS(x) (CQE_TS_G(be64_to_cpu((x)->bits_type_ts)))
  231. struct t4_swsqe {
  232. u64 wr_id;
  233. struct t4_cqe cqe;
  234. int read_len;
  235. int opcode;
  236. int complete;
  237. int signaled;
  238. u16 idx;
  239. int flushed;
  240. struct timespec host_ts;
  241. u64 sge_ts;
  242. };
  243. static inline pgprot_t t4_pgprot_wc(pgprot_t prot)
  244. {
  245. #if defined(__i386__) || defined(__x86_64__) || defined(CONFIG_PPC64)
  246. return pgprot_writecombine(prot);
  247. #else
  248. return pgprot_noncached(prot);
  249. #endif
  250. }
  251. enum {
  252. T4_SQ_ONCHIP = (1<<0),
  253. };
  254. struct t4_sq {
  255. union t4_wr *queue;
  256. dma_addr_t dma_addr;
  257. DEFINE_DMA_UNMAP_ADDR(mapping);
  258. unsigned long phys_addr;
  259. struct t4_swsqe *sw_sq;
  260. struct t4_swsqe *oldest_read;
  261. u64 __iomem *udb;
  262. size_t memsize;
  263. u32 qid;
  264. u16 in_use;
  265. u16 size;
  266. u16 cidx;
  267. u16 pidx;
  268. u16 wq_pidx;
  269. u16 wq_pidx_inc;
  270. u16 flags;
  271. short flush_cidx;
  272. };
  273. struct t4_swrqe {
  274. u64 wr_id;
  275. struct timespec host_ts;
  276. u64 sge_ts;
  277. };
  278. struct t4_rq {
  279. union t4_recv_wr *queue;
  280. dma_addr_t dma_addr;
  281. DEFINE_DMA_UNMAP_ADDR(mapping);
  282. struct t4_swrqe *sw_rq;
  283. u64 __iomem *udb;
  284. size_t memsize;
  285. u32 qid;
  286. u32 msn;
  287. u32 rqt_hwaddr;
  288. u16 rqt_size;
  289. u16 in_use;
  290. u16 size;
  291. u16 cidx;
  292. u16 pidx;
  293. u16 wq_pidx;
  294. u16 wq_pidx_inc;
  295. };
  296. struct t4_wq {
  297. struct t4_sq sq;
  298. struct t4_rq rq;
  299. void __iomem *db;
  300. void __iomem *gts;
  301. struct c4iw_rdev *rdev;
  302. int flushed;
  303. };
  304. static inline int t4_rqes_posted(struct t4_wq *wq)
  305. {
  306. return wq->rq.in_use;
  307. }
  308. static inline int t4_rq_empty(struct t4_wq *wq)
  309. {
  310. return wq->rq.in_use == 0;
  311. }
  312. static inline int t4_rq_full(struct t4_wq *wq)
  313. {
  314. return wq->rq.in_use == (wq->rq.size - 1);
  315. }
  316. static inline u32 t4_rq_avail(struct t4_wq *wq)
  317. {
  318. return wq->rq.size - 1 - wq->rq.in_use;
  319. }
  320. static inline void t4_rq_produce(struct t4_wq *wq, u8 len16)
  321. {
  322. wq->rq.in_use++;
  323. if (++wq->rq.pidx == wq->rq.size)
  324. wq->rq.pidx = 0;
  325. wq->rq.wq_pidx += DIV_ROUND_UP(len16*16, T4_EQ_ENTRY_SIZE);
  326. if (wq->rq.wq_pidx >= wq->rq.size * T4_RQ_NUM_SLOTS)
  327. wq->rq.wq_pidx %= wq->rq.size * T4_RQ_NUM_SLOTS;
  328. }
  329. static inline void t4_rq_consume(struct t4_wq *wq)
  330. {
  331. wq->rq.in_use--;
  332. wq->rq.msn++;
  333. if (++wq->rq.cidx == wq->rq.size)
  334. wq->rq.cidx = 0;
  335. }
  336. static inline u16 t4_rq_host_wq_pidx(struct t4_wq *wq)
  337. {
  338. return wq->rq.queue[wq->rq.size].status.host_wq_pidx;
  339. }
  340. static inline u16 t4_rq_wq_size(struct t4_wq *wq)
  341. {
  342. return wq->rq.size * T4_RQ_NUM_SLOTS;
  343. }
  344. static inline int t4_sq_onchip(struct t4_sq *sq)
  345. {
  346. return sq->flags & T4_SQ_ONCHIP;
  347. }
  348. static inline int t4_sq_empty(struct t4_wq *wq)
  349. {
  350. return wq->sq.in_use == 0;
  351. }
  352. static inline int t4_sq_full(struct t4_wq *wq)
  353. {
  354. return wq->sq.in_use == (wq->sq.size - 1);
  355. }
  356. static inline u32 t4_sq_avail(struct t4_wq *wq)
  357. {
  358. return wq->sq.size - 1 - wq->sq.in_use;
  359. }
  360. static inline void t4_sq_produce(struct t4_wq *wq, u8 len16)
  361. {
  362. wq->sq.in_use++;
  363. if (++wq->sq.pidx == wq->sq.size)
  364. wq->sq.pidx = 0;
  365. wq->sq.wq_pidx += DIV_ROUND_UP(len16*16, T4_EQ_ENTRY_SIZE);
  366. if (wq->sq.wq_pidx >= wq->sq.size * T4_SQ_NUM_SLOTS)
  367. wq->sq.wq_pidx %= wq->sq.size * T4_SQ_NUM_SLOTS;
  368. }
  369. static inline void t4_sq_consume(struct t4_wq *wq)
  370. {
  371. BUG_ON(wq->sq.in_use < 1);
  372. if (wq->sq.cidx == wq->sq.flush_cidx)
  373. wq->sq.flush_cidx = -1;
  374. wq->sq.in_use--;
  375. if (++wq->sq.cidx == wq->sq.size)
  376. wq->sq.cidx = 0;
  377. }
  378. static inline u16 t4_sq_host_wq_pidx(struct t4_wq *wq)
  379. {
  380. return wq->sq.queue[wq->sq.size].status.host_wq_pidx;
  381. }
  382. static inline u16 t4_sq_wq_size(struct t4_wq *wq)
  383. {
  384. return wq->sq.size * T4_SQ_NUM_SLOTS;
  385. }
  386. /* This function copies 64 byte coalesced work request to memory
  387. * mapped BAR2 space. For coalesced WRs, the SGE fetches data
  388. * from the FIFO instead of from Host.
  389. */
  390. static inline void pio_copy(u64 __iomem *dst, u64 *src)
  391. {
  392. int count = 8;
  393. while (count) {
  394. writeq(*src, dst);
  395. src++;
  396. dst++;
  397. count--;
  398. }
  399. }
  400. static inline void t4_ring_sq_db(struct t4_wq *wq, u16 inc, u8 t5,
  401. union t4_wr *wqe)
  402. {
  403. /* Flush host queue memory writes. */
  404. wmb();
  405. if (t5) {
  406. if (inc == 1 && wqe) {
  407. PDBG("%s: WC wq->sq.pidx = %d\n",
  408. __func__, wq->sq.pidx);
  409. pio_copy(wq->sq.udb + 7, (void *)wqe);
  410. } else {
  411. PDBG("%s: DB wq->sq.pidx = %d\n",
  412. __func__, wq->sq.pidx);
  413. writel(PIDX_T5_V(inc), wq->sq.udb);
  414. }
  415. /* Flush user doorbell area writes. */
  416. wmb();
  417. return;
  418. }
  419. writel(QID_V(wq->sq.qid) | PIDX_V(inc), wq->db);
  420. }
  421. static inline void t4_ring_rq_db(struct t4_wq *wq, u16 inc, u8 t5,
  422. union t4_recv_wr *wqe)
  423. {
  424. /* Flush host queue memory writes. */
  425. wmb();
  426. if (t5) {
  427. if (inc == 1 && wqe) {
  428. PDBG("%s: WC wq->rq.pidx = %d\n",
  429. __func__, wq->rq.pidx);
  430. pio_copy(wq->rq.udb + 7, (void *)wqe);
  431. } else {
  432. PDBG("%s: DB wq->rq.pidx = %d\n",
  433. __func__, wq->rq.pidx);
  434. writel(PIDX_T5_V(inc), wq->rq.udb);
  435. }
  436. /* Flush user doorbell area writes. */
  437. wmb();
  438. return;
  439. }
  440. writel(QID_V(wq->rq.qid) | PIDX_V(inc), wq->db);
  441. }
  442. static inline int t4_wq_in_error(struct t4_wq *wq)
  443. {
  444. return wq->rq.queue[wq->rq.size].status.qp_err;
  445. }
  446. static inline void t4_set_wq_in_error(struct t4_wq *wq)
  447. {
  448. wq->rq.queue[wq->rq.size].status.qp_err = 1;
  449. }
  450. static inline void t4_disable_wq_db(struct t4_wq *wq)
  451. {
  452. wq->rq.queue[wq->rq.size].status.db_off = 1;
  453. }
  454. static inline void t4_enable_wq_db(struct t4_wq *wq)
  455. {
  456. wq->rq.queue[wq->rq.size].status.db_off = 0;
  457. }
  458. static inline int t4_wq_db_enabled(struct t4_wq *wq)
  459. {
  460. return !wq->rq.queue[wq->rq.size].status.db_off;
  461. }
  462. enum t4_cq_flags {
  463. CQ_ARMED = 1,
  464. };
  465. struct t4_cq {
  466. struct t4_cqe *queue;
  467. dma_addr_t dma_addr;
  468. DEFINE_DMA_UNMAP_ADDR(mapping);
  469. struct t4_cqe *sw_queue;
  470. void __iomem *gts;
  471. struct c4iw_rdev *rdev;
  472. u64 ugts;
  473. size_t memsize;
  474. __be64 bits_type_ts;
  475. u32 cqid;
  476. u32 qid_mask;
  477. int vector;
  478. u16 size; /* including status page */
  479. u16 cidx;
  480. u16 sw_pidx;
  481. u16 sw_cidx;
  482. u16 sw_in_use;
  483. u16 cidx_inc;
  484. u8 gen;
  485. u8 error;
  486. unsigned long flags;
  487. };
  488. static inline int t4_clear_cq_armed(struct t4_cq *cq)
  489. {
  490. return test_and_clear_bit(CQ_ARMED, &cq->flags);
  491. }
  492. static inline int t4_arm_cq(struct t4_cq *cq, int se)
  493. {
  494. u32 val;
  495. set_bit(CQ_ARMED, &cq->flags);
  496. while (cq->cidx_inc > CIDXINC_M) {
  497. val = SEINTARM_V(0) | CIDXINC_V(CIDXINC_M) | TIMERREG_V(7) |
  498. INGRESSQID_V(cq->cqid & cq->qid_mask);
  499. writel(val, cq->gts);
  500. cq->cidx_inc -= CIDXINC_M;
  501. }
  502. val = SEINTARM_V(se) | CIDXINC_V(cq->cidx_inc) | TIMERREG_V(6) |
  503. INGRESSQID_V(cq->cqid & cq->qid_mask);
  504. writel(val, cq->gts);
  505. cq->cidx_inc = 0;
  506. return 0;
  507. }
  508. static inline void t4_swcq_produce(struct t4_cq *cq)
  509. {
  510. cq->sw_in_use++;
  511. if (cq->sw_in_use == cq->size) {
  512. PDBG("%s cxgb4 sw cq overflow cqid %u\n", __func__, cq->cqid);
  513. cq->error = 1;
  514. BUG_ON(1);
  515. }
  516. if (++cq->sw_pidx == cq->size)
  517. cq->sw_pidx = 0;
  518. }
  519. static inline void t4_swcq_consume(struct t4_cq *cq)
  520. {
  521. BUG_ON(cq->sw_in_use < 1);
  522. cq->sw_in_use--;
  523. if (++cq->sw_cidx == cq->size)
  524. cq->sw_cidx = 0;
  525. }
  526. static inline void t4_hwcq_consume(struct t4_cq *cq)
  527. {
  528. cq->bits_type_ts = cq->queue[cq->cidx].bits_type_ts;
  529. if (++cq->cidx_inc == (cq->size >> 4) || cq->cidx_inc == CIDXINC_M) {
  530. u32 val;
  531. val = SEINTARM_V(0) | CIDXINC_V(cq->cidx_inc) | TIMERREG_V(7) |
  532. INGRESSQID_V(cq->cqid & cq->qid_mask);
  533. writel(val, cq->gts);
  534. cq->cidx_inc = 0;
  535. }
  536. if (++cq->cidx == cq->size) {
  537. cq->cidx = 0;
  538. cq->gen ^= 1;
  539. }
  540. }
  541. static inline int t4_valid_cqe(struct t4_cq *cq, struct t4_cqe *cqe)
  542. {
  543. return (CQE_GENBIT(cqe) == cq->gen);
  544. }
  545. static inline int t4_next_hw_cqe(struct t4_cq *cq, struct t4_cqe **cqe)
  546. {
  547. int ret;
  548. u16 prev_cidx;
  549. if (cq->cidx == 0)
  550. prev_cidx = cq->size - 1;
  551. else
  552. prev_cidx = cq->cidx - 1;
  553. if (cq->queue[prev_cidx].bits_type_ts != cq->bits_type_ts) {
  554. ret = -EOVERFLOW;
  555. cq->error = 1;
  556. printk(KERN_ERR MOD "cq overflow cqid %u\n", cq->cqid);
  557. BUG_ON(1);
  558. } else if (t4_valid_cqe(cq, &cq->queue[cq->cidx])) {
  559. /* Ensure CQE is flushed to memory */
  560. rmb();
  561. *cqe = &cq->queue[cq->cidx];
  562. ret = 0;
  563. } else
  564. ret = -ENODATA;
  565. return ret;
  566. }
  567. static inline struct t4_cqe *t4_next_sw_cqe(struct t4_cq *cq)
  568. {
  569. if (cq->sw_in_use == cq->size) {
  570. PDBG("%s cxgb4 sw cq overflow cqid %u\n", __func__, cq->cqid);
  571. cq->error = 1;
  572. BUG_ON(1);
  573. return NULL;
  574. }
  575. if (cq->sw_in_use)
  576. return &cq->sw_queue[cq->sw_cidx];
  577. return NULL;
  578. }
  579. static inline int t4_next_cqe(struct t4_cq *cq, struct t4_cqe **cqe)
  580. {
  581. int ret = 0;
  582. if (cq->error)
  583. ret = -ENODATA;
  584. else if (cq->sw_in_use)
  585. *cqe = &cq->sw_queue[cq->sw_cidx];
  586. else
  587. ret = t4_next_hw_cqe(cq, cqe);
  588. return ret;
  589. }
  590. static inline int t4_cq_in_error(struct t4_cq *cq)
  591. {
  592. return ((struct t4_status_page *)&cq->queue[cq->size])->qp_err;
  593. }
  594. static inline void t4_set_cq_in_error(struct t4_cq *cq)
  595. {
  596. ((struct t4_status_page *)&cq->queue[cq->size])->qp_err = 1;
  597. }
  598. #endif
  599. struct t4_dev_status_page {
  600. u8 db_off;
  601. };