rxe_loc.h 7.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287
  1. /*
  2. * Copyright (c) 2016 Mellanox Technologies Ltd. All rights reserved.
  3. * Copyright (c) 2015 System Fabric Works, Inc. All rights reserved.
  4. *
  5. * This software is available to you under a choice of one of two
  6. * licenses. You may choose to be licensed under the terms of the GNU
  7. * General Public License (GPL) Version 2, available from the file
  8. * COPYING in the main directory of this source tree, or the
  9. * OpenIB.org BSD license below:
  10. *
  11. * Redistribution and use in source and binary forms, with or
  12. * without modification, are permitted provided that the following
  13. * conditions are met:
  14. *
  15. * - Redistributions of source code must retain the above
  16. * copyright notice, this list of conditions and the following
  17. * disclaimer.
  18. *
  19. * - Redistributions in binary form must reproduce the above
  20. * copyright notice, this list of conditions and the following
  21. * disclaimer in the documentation and/or other materials
  22. * provided with the distribution.
  23. *
  24. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  25. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  26. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  27. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  28. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  29. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  30. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  31. * SOFTWARE.
  32. */
  33. #ifndef RXE_LOC_H
  34. #define RXE_LOC_H
  35. /* rxe_av.c */
  36. int rxe_av_chk_attr(struct rxe_dev *rxe, struct ib_ah_attr *attr);
  37. int rxe_av_from_attr(struct rxe_dev *rxe, u8 port_num,
  38. struct rxe_av *av, struct ib_ah_attr *attr);
  39. int rxe_av_to_attr(struct rxe_dev *rxe, struct rxe_av *av,
  40. struct ib_ah_attr *attr);
  41. int rxe_av_fill_ip_info(struct rxe_dev *rxe,
  42. struct rxe_av *av,
  43. struct ib_ah_attr *attr,
  44. struct ib_gid_attr *sgid_attr,
  45. union ib_gid *sgid);
  46. struct rxe_av *rxe_get_av(struct rxe_pkt_info *pkt);
  47. /* rxe_cq.c */
  48. int rxe_cq_chk_attr(struct rxe_dev *rxe, struct rxe_cq *cq,
  49. int cqe, int comp_vector, struct ib_udata *udata);
  50. int rxe_cq_from_init(struct rxe_dev *rxe, struct rxe_cq *cq, int cqe,
  51. int comp_vector, struct ib_ucontext *context,
  52. struct ib_udata *udata);
  53. int rxe_cq_resize_queue(struct rxe_cq *cq, int new_cqe, struct ib_udata *udata);
  54. int rxe_cq_post(struct rxe_cq *cq, struct rxe_cqe *cqe, int solicited);
  55. void rxe_cq_cleanup(void *arg);
  56. /* rxe_mcast.c */
  57. int rxe_mcast_get_grp(struct rxe_dev *rxe, union ib_gid *mgid,
  58. struct rxe_mc_grp **grp_p);
  59. int rxe_mcast_add_grp_elem(struct rxe_dev *rxe, struct rxe_qp *qp,
  60. struct rxe_mc_grp *grp);
  61. int rxe_mcast_drop_grp_elem(struct rxe_dev *rxe, struct rxe_qp *qp,
  62. union ib_gid *mgid);
  63. void rxe_drop_all_mcast_groups(struct rxe_qp *qp);
  64. void rxe_mc_cleanup(void *arg);
  65. /* rxe_mmap.c */
  66. struct rxe_mmap_info {
  67. struct list_head pending_mmaps;
  68. struct ib_ucontext *context;
  69. struct kref ref;
  70. void *obj;
  71. struct mminfo info;
  72. };
  73. void rxe_mmap_release(struct kref *ref);
  74. struct rxe_mmap_info *rxe_create_mmap_info(struct rxe_dev *dev,
  75. u32 size,
  76. struct ib_ucontext *context,
  77. void *obj);
  78. int rxe_mmap(struct ib_ucontext *context, struct vm_area_struct *vma);
  79. /* rxe_mr.c */
  80. enum copy_direction {
  81. to_mem_obj,
  82. from_mem_obj,
  83. };
  84. int rxe_mem_init_dma(struct rxe_dev *rxe, struct rxe_pd *pd,
  85. int access, struct rxe_mem *mem);
  86. int rxe_mem_init_user(struct rxe_dev *rxe, struct rxe_pd *pd, u64 start,
  87. u64 length, u64 iova, int access, struct ib_udata *udata,
  88. struct rxe_mem *mr);
  89. int rxe_mem_init_fast(struct rxe_dev *rxe, struct rxe_pd *pd,
  90. int max_pages, struct rxe_mem *mem);
  91. int rxe_mem_copy(struct rxe_mem *mem, u64 iova, void *addr,
  92. int length, enum copy_direction dir, u32 *crcp);
  93. int copy_data(struct rxe_dev *rxe, struct rxe_pd *pd, int access,
  94. struct rxe_dma_info *dma, void *addr, int length,
  95. enum copy_direction dir, u32 *crcp);
  96. void *iova_to_vaddr(struct rxe_mem *mem, u64 iova, int length);
  97. enum lookup_type {
  98. lookup_local,
  99. lookup_remote,
  100. };
  101. struct rxe_mem *lookup_mem(struct rxe_pd *pd, int access, u32 key,
  102. enum lookup_type type);
  103. int mem_check_range(struct rxe_mem *mem, u64 iova, size_t length);
  104. int rxe_mem_map_pages(struct rxe_dev *rxe, struct rxe_mem *mem,
  105. u64 *page, int num_pages, u64 iova);
  106. void rxe_mem_cleanup(void *arg);
  107. int advance_dma_data(struct rxe_dma_info *dma, unsigned int length);
  108. /* rxe_qp.c */
  109. int rxe_qp_chk_init(struct rxe_dev *rxe, struct ib_qp_init_attr *init);
  110. int rxe_qp_from_init(struct rxe_dev *rxe, struct rxe_qp *qp, struct rxe_pd *pd,
  111. struct ib_qp_init_attr *init, struct ib_udata *udata,
  112. struct ib_pd *ibpd);
  113. int rxe_qp_to_init(struct rxe_qp *qp, struct ib_qp_init_attr *init);
  114. int rxe_qp_chk_attr(struct rxe_dev *rxe, struct rxe_qp *qp,
  115. struct ib_qp_attr *attr, int mask);
  116. int rxe_qp_from_attr(struct rxe_qp *qp, struct ib_qp_attr *attr,
  117. int mask, struct ib_udata *udata);
  118. int rxe_qp_to_attr(struct rxe_qp *qp, struct ib_qp_attr *attr, int mask);
  119. void rxe_qp_error(struct rxe_qp *qp);
  120. void rxe_qp_destroy(struct rxe_qp *qp);
  121. void rxe_qp_cleanup(void *arg);
  122. static inline int qp_num(struct rxe_qp *qp)
  123. {
  124. return qp->ibqp.qp_num;
  125. }
  126. static inline enum ib_qp_type qp_type(struct rxe_qp *qp)
  127. {
  128. return qp->ibqp.qp_type;
  129. }
  130. static inline enum ib_qp_state qp_state(struct rxe_qp *qp)
  131. {
  132. return qp->attr.qp_state;
  133. }
  134. static inline int qp_mtu(struct rxe_qp *qp)
  135. {
  136. if (qp->ibqp.qp_type == IB_QPT_RC || qp->ibqp.qp_type == IB_QPT_UC)
  137. return qp->attr.path_mtu;
  138. else
  139. return RXE_PORT_MAX_MTU;
  140. }
  141. static inline int rcv_wqe_size(int max_sge)
  142. {
  143. return sizeof(struct rxe_recv_wqe) +
  144. max_sge * sizeof(struct ib_sge);
  145. }
  146. void free_rd_atomic_resource(struct rxe_qp *qp, struct resp_res *res);
  147. static inline void rxe_advance_resp_resource(struct rxe_qp *qp)
  148. {
  149. qp->resp.res_head++;
  150. if (unlikely(qp->resp.res_head == qp->attr.max_dest_rd_atomic))
  151. qp->resp.res_head = 0;
  152. }
  153. void retransmit_timer(unsigned long data);
  154. void rnr_nak_timer(unsigned long data);
  155. void dump_qp(struct rxe_qp *qp);
  156. /* rxe_srq.c */
  157. #define IB_SRQ_INIT_MASK (~IB_SRQ_LIMIT)
  158. int rxe_srq_chk_attr(struct rxe_dev *rxe, struct rxe_srq *srq,
  159. struct ib_srq_attr *attr, enum ib_srq_attr_mask mask);
  160. int rxe_srq_from_init(struct rxe_dev *rxe, struct rxe_srq *srq,
  161. struct ib_srq_init_attr *init,
  162. struct ib_ucontext *context, struct ib_udata *udata);
  163. int rxe_srq_from_attr(struct rxe_dev *rxe, struct rxe_srq *srq,
  164. struct ib_srq_attr *attr, enum ib_srq_attr_mask mask,
  165. struct ib_udata *udata);
  166. extern struct ib_dma_mapping_ops rxe_dma_mapping_ops;
  167. void rxe_release(struct kref *kref);
  168. int rxe_completer(void *arg);
  169. int rxe_requester(void *arg);
  170. int rxe_responder(void *arg);
  171. u32 rxe_icrc_hdr(struct rxe_pkt_info *pkt, struct sk_buff *skb);
  172. void rxe_resp_queue_pkt(struct rxe_dev *rxe,
  173. struct rxe_qp *qp, struct sk_buff *skb);
  174. void rxe_comp_queue_pkt(struct rxe_dev *rxe,
  175. struct rxe_qp *qp, struct sk_buff *skb);
  176. static inline unsigned wr_opcode_mask(int opcode, struct rxe_qp *qp)
  177. {
  178. return rxe_wr_opcode_info[opcode].mask[qp->ibqp.qp_type];
  179. }
  180. static inline int rxe_xmit_packet(struct rxe_dev *rxe, struct rxe_qp *qp,
  181. struct rxe_pkt_info *pkt, struct sk_buff *skb)
  182. {
  183. int err;
  184. int is_request = pkt->mask & RXE_REQ_MASK;
  185. if ((is_request && (qp->req.state != QP_STATE_READY)) ||
  186. (!is_request && (qp->resp.state != QP_STATE_READY))) {
  187. pr_info("Packet dropped. QP is not in ready state\n");
  188. goto drop;
  189. }
  190. if (pkt->mask & RXE_LOOPBACK_MASK) {
  191. memcpy(SKB_TO_PKT(skb), pkt, sizeof(*pkt));
  192. err = rxe->ifc_ops->loopback(skb);
  193. } else {
  194. err = rxe->ifc_ops->send(rxe, pkt, skb);
  195. }
  196. if (err) {
  197. rxe->xmit_errors++;
  198. return err;
  199. }
  200. atomic_inc(&qp->skb_out);
  201. if ((qp_type(qp) != IB_QPT_RC) &&
  202. (pkt->mask & RXE_END_MASK)) {
  203. pkt->wqe->state = wqe_state_done;
  204. rxe_run_task(&qp->comp.task, 1);
  205. }
  206. goto done;
  207. drop:
  208. kfree_skb(skb);
  209. err = 0;
  210. done:
  211. return err;
  212. }
  213. #endif /* RXE_LOC_H */