t4.h 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544
  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_QP (1<<16)
  38. #define T4_MAX_NUM_CQ (1<<15)
  39. #define T4_MAX_NUM_PD (1<<15)
  40. #define T4_EQ_STATUS_ENTRIES (L1_CACHE_BYTES > 64 ? 2 : 1)
  41. #define T4_MAX_EQ_SIZE (65520 - T4_EQ_STATUS_ENTRIES)
  42. #define T4_MAX_IQ_SIZE (65520 - 1)
  43. #define T4_MAX_RQ_SIZE (8192 - T4_EQ_STATUS_ENTRIES)
  44. #define T4_MAX_SQ_SIZE (T4_MAX_EQ_SIZE - 1)
  45. #define T4_MAX_QP_DEPTH (T4_MAX_RQ_SIZE - 1)
  46. #define T4_MAX_CQ_DEPTH (T4_MAX_IQ_SIZE - 1)
  47. #define T4_MAX_NUM_STAG (1<<15)
  48. #define T4_MAX_MR_SIZE (~0ULL - 1)
  49. #define T4_PAGESIZE_MASK 0xffff000 /* 4KB-128MB */
  50. #define T4_STAG_UNSET 0xffffffff
  51. #define T4_FW_MAJ 0
  52. #define T4_EQ_STATUS_ENTRIES (L1_CACHE_BYTES > 64 ? 2 : 1)
  53. struct t4_status_page {
  54. __be32 rsvd1; /* flit 0 - hw owns */
  55. __be16 rsvd2;
  56. __be16 qid;
  57. __be16 cidx;
  58. __be16 pidx;
  59. u8 qp_err; /* flit 1 - sw owns */
  60. u8 db_off;
  61. };
  62. #define T4_EQ_ENTRY_SIZE 64
  63. #define T4_SQ_NUM_SLOTS 4
  64. #define T4_SQ_NUM_BYTES (T4_EQ_ENTRY_SIZE * T4_SQ_NUM_SLOTS)
  65. #define T4_MAX_SEND_SGE ((T4_SQ_NUM_BYTES - sizeof(struct fw_ri_send_wr) - \
  66. sizeof(struct fw_ri_isgl)) / sizeof(struct fw_ri_sge))
  67. #define T4_MAX_SEND_INLINE ((T4_SQ_NUM_BYTES - sizeof(struct fw_ri_send_wr) - \
  68. sizeof(struct fw_ri_immd)))
  69. #define T4_MAX_WRITE_INLINE ((T4_SQ_NUM_BYTES - \
  70. sizeof(struct fw_ri_rdma_write_wr) - \
  71. sizeof(struct fw_ri_immd)))
  72. #define T4_MAX_WRITE_SGE ((T4_SQ_NUM_BYTES - \
  73. sizeof(struct fw_ri_rdma_write_wr) - \
  74. sizeof(struct fw_ri_isgl)) / sizeof(struct fw_ri_sge))
  75. #define T4_MAX_FR_IMMD ((T4_SQ_NUM_BYTES - sizeof(struct fw_ri_fr_nsmr_wr) - \
  76. sizeof(struct fw_ri_immd)))
  77. #define T4_MAX_FR_DEPTH (T4_MAX_FR_IMMD / sizeof(u64))
  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 S_CQE_QPID 12
  175. #define M_CQE_QPID 0xFFFFF
  176. #define G_CQE_QPID(x) ((((x) >> S_CQE_QPID)) & M_CQE_QPID)
  177. #define V_CQE_QPID(x) ((x)<<S_CQE_QPID)
  178. #define S_CQE_SWCQE 11
  179. #define M_CQE_SWCQE 0x1
  180. #define G_CQE_SWCQE(x) ((((x) >> S_CQE_SWCQE)) & M_CQE_SWCQE)
  181. #define V_CQE_SWCQE(x) ((x)<<S_CQE_SWCQE)
  182. #define S_CQE_STATUS 5
  183. #define M_CQE_STATUS 0x1F
  184. #define G_CQE_STATUS(x) ((((x) >> S_CQE_STATUS)) & M_CQE_STATUS)
  185. #define V_CQE_STATUS(x) ((x)<<S_CQE_STATUS)
  186. #define S_CQE_TYPE 4
  187. #define M_CQE_TYPE 0x1
  188. #define G_CQE_TYPE(x) ((((x) >> S_CQE_TYPE)) & M_CQE_TYPE)
  189. #define V_CQE_TYPE(x) ((x)<<S_CQE_TYPE)
  190. #define S_CQE_OPCODE 0
  191. #define M_CQE_OPCODE 0xF
  192. #define G_CQE_OPCODE(x) ((((x) >> S_CQE_OPCODE)) & M_CQE_OPCODE)
  193. #define V_CQE_OPCODE(x) ((x)<<S_CQE_OPCODE)
  194. #define SW_CQE(x) (G_CQE_SWCQE(be32_to_cpu((x)->header)))
  195. #define CQE_QPID(x) (G_CQE_QPID(be32_to_cpu((x)->header)))
  196. #define CQE_TYPE(x) (G_CQE_TYPE(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) (G_CQE_STATUS(be32_to_cpu((x)->header)))
  200. #define CQE_OPCODE(x) (G_CQE_OPCODE(be32_to_cpu((x)->header)))
  201. #define CQE_SEND_OPCODE(x)( \
  202. (G_CQE_OPCODE(be32_to_cpu((x)->header)) == FW_RI_SEND) || \
  203. (G_CQE_OPCODE(be32_to_cpu((x)->header)) == FW_RI_SEND_WITH_SE) || \
  204. (G_CQE_OPCODE(be32_to_cpu((x)->header)) == FW_RI_SEND_WITH_INV) || \
  205. (G_CQE_OPCODE(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) ((x)->u.gen.wrid_hi)
  214. #define CQE_WRID_LOW(x) ((x)->u.gen.wrid_low)
  215. /* macros for flit 3 of the cqe */
  216. #define S_CQE_GENBIT 63
  217. #define M_CQE_GENBIT 0x1
  218. #define G_CQE_GENBIT(x) (((x) >> S_CQE_GENBIT) & M_CQE_GENBIT)
  219. #define V_CQE_GENBIT(x) ((x)<<S_CQE_GENBIT)
  220. #define S_CQE_OVFBIT 62
  221. #define M_CQE_OVFBIT 0x1
  222. #define G_CQE_OVFBIT(x) ((((x) >> S_CQE_OVFBIT)) & M_CQE_OVFBIT)
  223. #define S_CQE_IQTYPE 60
  224. #define M_CQE_IQTYPE 0x3
  225. #define G_CQE_IQTYPE(x) ((((x) >> S_CQE_IQTYPE)) & M_CQE_IQTYPE)
  226. #define M_CQE_TS 0x0fffffffffffffffULL
  227. #define G_CQE_TS(x) ((x) & M_CQE_TS)
  228. #define CQE_OVFBIT(x) ((unsigned)G_CQE_OVFBIT(be64_to_cpu((x)->bits_type_ts)))
  229. #define CQE_GENBIT(x) ((unsigned)G_CQE_GENBIT(be64_to_cpu((x)->bits_type_ts)))
  230. #define CQE_TS(x) (G_CQE_TS(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. };
  240. struct t4_sq {
  241. union t4_wr *queue;
  242. dma_addr_t dma_addr;
  243. DEFINE_DMA_UNMAP_ADDR(mapping);
  244. struct t4_swsqe *sw_sq;
  245. struct t4_swsqe *oldest_read;
  246. u64 udb;
  247. size_t memsize;
  248. u32 qid;
  249. u16 in_use;
  250. u16 size;
  251. u16 cidx;
  252. u16 pidx;
  253. u16 wq_pidx;
  254. };
  255. struct t4_swrqe {
  256. u64 wr_id;
  257. };
  258. struct t4_rq {
  259. union t4_recv_wr *queue;
  260. dma_addr_t dma_addr;
  261. DEFINE_DMA_UNMAP_ADDR(mapping);
  262. struct t4_swrqe *sw_rq;
  263. u64 udb;
  264. size_t memsize;
  265. u32 qid;
  266. u32 msn;
  267. u32 rqt_hwaddr;
  268. u16 rqt_size;
  269. u16 in_use;
  270. u16 size;
  271. u16 cidx;
  272. u16 pidx;
  273. u16 wq_pidx;
  274. };
  275. struct t4_wq {
  276. struct t4_sq sq;
  277. struct t4_rq rq;
  278. void __iomem *db;
  279. void __iomem *gts;
  280. struct c4iw_rdev *rdev;
  281. };
  282. static inline int t4_rqes_posted(struct t4_wq *wq)
  283. {
  284. return wq->rq.in_use;
  285. }
  286. static inline int t4_rq_empty(struct t4_wq *wq)
  287. {
  288. return wq->rq.in_use == 0;
  289. }
  290. static inline int t4_rq_full(struct t4_wq *wq)
  291. {
  292. return wq->rq.in_use == (wq->rq.size - 1);
  293. }
  294. static inline u32 t4_rq_avail(struct t4_wq *wq)
  295. {
  296. return wq->rq.size - 1 - wq->rq.in_use;
  297. }
  298. static inline void t4_rq_produce(struct t4_wq *wq, u8 len16)
  299. {
  300. wq->rq.in_use++;
  301. if (++wq->rq.pidx == wq->rq.size)
  302. wq->rq.pidx = 0;
  303. wq->rq.wq_pidx += DIV_ROUND_UP(len16*16, T4_EQ_ENTRY_SIZE);
  304. if (wq->rq.wq_pidx >= wq->rq.size * T4_RQ_NUM_SLOTS)
  305. wq->rq.wq_pidx %= wq->rq.size * T4_RQ_NUM_SLOTS;
  306. }
  307. static inline void t4_rq_consume(struct t4_wq *wq)
  308. {
  309. wq->rq.in_use--;
  310. wq->rq.msn++;
  311. if (++wq->rq.cidx == wq->rq.size)
  312. wq->rq.cidx = 0;
  313. }
  314. static inline int t4_sq_empty(struct t4_wq *wq)
  315. {
  316. return wq->sq.in_use == 0;
  317. }
  318. static inline int t4_sq_full(struct t4_wq *wq)
  319. {
  320. return wq->sq.in_use == (wq->sq.size - 1);
  321. }
  322. static inline u32 t4_sq_avail(struct t4_wq *wq)
  323. {
  324. return wq->sq.size - 1 - wq->sq.in_use;
  325. }
  326. static inline void t4_sq_produce(struct t4_wq *wq, u8 len16)
  327. {
  328. wq->sq.in_use++;
  329. if (++wq->sq.pidx == wq->sq.size)
  330. wq->sq.pidx = 0;
  331. wq->sq.wq_pidx += DIV_ROUND_UP(len16*16, T4_EQ_ENTRY_SIZE);
  332. if (wq->sq.wq_pidx >= wq->sq.size * T4_SQ_NUM_SLOTS)
  333. wq->sq.wq_pidx %= wq->sq.size * T4_SQ_NUM_SLOTS;
  334. }
  335. static inline void t4_sq_consume(struct t4_wq *wq)
  336. {
  337. wq->sq.in_use--;
  338. if (++wq->sq.cidx == wq->sq.size)
  339. wq->sq.cidx = 0;
  340. }
  341. static inline void t4_ring_sq_db(struct t4_wq *wq, u16 inc)
  342. {
  343. wmb();
  344. writel(QID(wq->sq.qid) | PIDX(inc), wq->db);
  345. }
  346. static inline void t4_ring_rq_db(struct t4_wq *wq, u16 inc)
  347. {
  348. wmb();
  349. writel(QID(wq->rq.qid) | PIDX(inc), wq->db);
  350. }
  351. static inline int t4_wq_in_error(struct t4_wq *wq)
  352. {
  353. return wq->sq.queue[wq->sq.size].status.qp_err;
  354. }
  355. static inline void t4_set_wq_in_error(struct t4_wq *wq)
  356. {
  357. wq->sq.queue[wq->sq.size].status.qp_err = 1;
  358. wq->rq.queue[wq->rq.size].status.qp_err = 1;
  359. }
  360. static inline void t4_disable_wq_db(struct t4_wq *wq)
  361. {
  362. wq->sq.queue[wq->sq.size].status.db_off = 1;
  363. wq->rq.queue[wq->rq.size].status.db_off = 1;
  364. }
  365. static inline void t4_enable_wq_db(struct t4_wq *wq)
  366. {
  367. wq->sq.queue[wq->sq.size].status.db_off = 0;
  368. wq->rq.queue[wq->rq.size].status.db_off = 0;
  369. }
  370. static inline int t4_wq_db_enabled(struct t4_wq *wq)
  371. {
  372. return !wq->sq.queue[wq->sq.size].status.db_off;
  373. }
  374. struct t4_cq {
  375. struct t4_cqe *queue;
  376. dma_addr_t dma_addr;
  377. DEFINE_DMA_UNMAP_ADDR(mapping);
  378. struct t4_cqe *sw_queue;
  379. void __iomem *gts;
  380. struct c4iw_rdev *rdev;
  381. u64 ugts;
  382. size_t memsize;
  383. __be64 bits_type_ts;
  384. u32 cqid;
  385. u16 size; /* including status page */
  386. u16 cidx;
  387. u16 sw_pidx;
  388. u16 sw_cidx;
  389. u16 sw_in_use;
  390. u16 cidx_inc;
  391. u8 gen;
  392. u8 error;
  393. };
  394. static inline int t4_arm_cq(struct t4_cq *cq, int se)
  395. {
  396. u32 val;
  397. while (cq->cidx_inc > CIDXINC_MASK) {
  398. val = SEINTARM(0) | CIDXINC(CIDXINC_MASK) | TIMERREG(7) |
  399. INGRESSQID(cq->cqid);
  400. writel(val, cq->gts);
  401. cq->cidx_inc -= CIDXINC_MASK;
  402. }
  403. val = SEINTARM(se) | CIDXINC(cq->cidx_inc) | TIMERREG(6) |
  404. INGRESSQID(cq->cqid);
  405. writel(val, cq->gts);
  406. cq->cidx_inc = 0;
  407. return 0;
  408. }
  409. static inline void t4_swcq_produce(struct t4_cq *cq)
  410. {
  411. cq->sw_in_use++;
  412. if (++cq->sw_pidx == cq->size)
  413. cq->sw_pidx = 0;
  414. }
  415. static inline void t4_swcq_consume(struct t4_cq *cq)
  416. {
  417. cq->sw_in_use--;
  418. if (++cq->sw_cidx == cq->size)
  419. cq->sw_cidx = 0;
  420. }
  421. static inline void t4_hwcq_consume(struct t4_cq *cq)
  422. {
  423. cq->bits_type_ts = cq->queue[cq->cidx].bits_type_ts;
  424. if (++cq->cidx_inc == cq->size)
  425. cq->cidx_inc = 0;
  426. if (++cq->cidx == cq->size) {
  427. cq->cidx = 0;
  428. cq->gen ^= 1;
  429. }
  430. }
  431. static inline int t4_valid_cqe(struct t4_cq *cq, struct t4_cqe *cqe)
  432. {
  433. return (CQE_GENBIT(cqe) == cq->gen);
  434. }
  435. static inline int t4_next_hw_cqe(struct t4_cq *cq, struct t4_cqe **cqe)
  436. {
  437. int ret;
  438. u16 prev_cidx;
  439. if (cq->cidx == 0)
  440. prev_cidx = cq->size - 1;
  441. else
  442. prev_cidx = cq->cidx - 1;
  443. if (cq->queue[prev_cidx].bits_type_ts != cq->bits_type_ts) {
  444. ret = -EOVERFLOW;
  445. cq->error = 1;
  446. printk(KERN_ERR MOD "cq overflow cqid %u\n", cq->cqid);
  447. } else if (t4_valid_cqe(cq, &cq->queue[cq->cidx])) {
  448. *cqe = &cq->queue[cq->cidx];
  449. ret = 0;
  450. } else
  451. ret = -ENODATA;
  452. return ret;
  453. }
  454. static inline struct t4_cqe *t4_next_sw_cqe(struct t4_cq *cq)
  455. {
  456. if (cq->sw_in_use)
  457. return &cq->sw_queue[cq->sw_cidx];
  458. return NULL;
  459. }
  460. static inline int t4_next_cqe(struct t4_cq *cq, struct t4_cqe **cqe)
  461. {
  462. int ret = 0;
  463. if (cq->error)
  464. ret = -ENODATA;
  465. else if (cq->sw_in_use)
  466. *cqe = &cq->sw_queue[cq->sw_cidx];
  467. else
  468. ret = t4_next_hw_cqe(cq, cqe);
  469. return ret;
  470. }
  471. static inline int t4_cq_in_error(struct t4_cq *cq)
  472. {
  473. return ((struct t4_status_page *)&cq->queue[cq->size])->qp_err;
  474. }
  475. static inline void t4_set_cq_in_error(struct t4_cq *cq)
  476. {
  477. ((struct t4_status_page *)&cq->queue[cq->size])->qp_err = 1;
  478. }
  479. #endif