2 * Copyright (c) 2004 Topspin Communications. All rights reserved.
3 * Copyright (c) 2005 Cisco Systems. All rights reserved.
4 * Copyright (c) 2005 Mellanox Technologies. All rights reserved.
6 * This software is available to you under a choice of one of two
7 * licenses. You may choose to be licensed under the terms of the GNU
8 * General Public License (GPL) Version 2, available from the file
9 * COPYING in the main directory of this source tree, or the
10 * OpenIB.org BSD license below:
12 * Redistribution and use in source and binary forms, with or
13 * without modification, are permitted provided that the following
16 * - Redistributions of source code must retain the above
17 * copyright notice, this list of conditions and the following
20 * - Redistributions in binary form must reproduce the above
21 * copyright notice, this list of conditions and the following
22 * disclaimer in the documentation and/or other materials
23 * provided with the distribution.
25 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
26 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
27 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
28 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
29 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
30 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
31 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
34 * $Id: mthca_provider.h 1349 2004-12-16 21:09:43Z roland $
37 #ifndef MTHCA_PROVIDER_H
38 #define MTHCA_PROVIDER_H
40 #include <rdma/ib_verbs.h>
41 #include <rdma/ib_pack.h>
43 #define MTHCA_MPT_FLAG_ATOMIC (1 << 14)
44 #define MTHCA_MPT_FLAG_REMOTE_WRITE (1 << 13)
45 #define MTHCA_MPT_FLAG_REMOTE_READ (1 << 12)
46 #define MTHCA_MPT_FLAG_LOCAL_WRITE (1 << 11)
47 #define MTHCA_MPT_FLAG_LOCAL_READ (1 << 10)
49 struct mthca_buf_list {
51 DECLARE_PCI_UNMAP_ADDR(mapping)
55 struct mthca_buf_list direct;
56 struct mthca_buf_list *page_list;
64 struct mthca_user_db_table;
66 struct mthca_ucontext {
67 struct ib_ucontext ibucontext;
69 struct mthca_user_db_table *db_tab;
76 struct mthca_mtt *mtt;
81 struct ib_fmr_attr attr;
82 struct mthca_mtt *mtt;
86 struct mthca_mpt_entry __iomem *mpt;
90 struct mthca_mpt_entry *mpt;
100 struct mthca_mr ntmr;
105 struct mthca_dev *dev;
113 struct mthca_buf_list *page_list;
127 enum mthca_ah_type type;
134 * Quick description of our CQ/QP locking scheme:
136 * We have one global lock that protects dev->cq/qp_table. Each
137 * struct mthca_cq/qp also has its own lock. An individual qp lock
138 * may be taken inside of an individual cq lock. Both cqs attached to
139 * a qp may be locked, with the send cq locked first. No other
140 * nesting should be done.
142 * Each struct mthca_cq/qp also has an atomic_t ref count. The
143 * pointer from the cq/qp_table to the struct counts as one reference.
144 * This reference also is good for access through the consumer API, so
145 * modifying the CQ/QP etc doesn't need to take another reference.
146 * Access because of a completion being polled does need a reference.
148 * Finally, each struct mthca_cq/qp has a wait_queue_head_t for the
149 * destroy function to sleep on.
151 * This means that access from the consumer API requires nothing but
152 * taking the struct's lock.
154 * Access because of a completion event should go as follows:
155 * - lock cq/qp_table and look up struct
156 * - increment ref count in struct
157 * - drop cq/qp_table lock
158 * - lock struct, do your thing, and unlock struct
159 * - decrement ref count; if zero, wake up waiters
161 * To destroy a CQ/QP, we can do the following:
162 * - lock cq/qp_table, remove pointer, unlock cq/qp_table lock
163 * - decrement ref count
164 * - wait_event until ref count is zero
166 * It is the consumer's responsibilty to make sure that no QP
167 * operations (WQE posting or state modification) are pending when the
168 * QP is destroyed. Also, the consumer must make sure that calls to
169 * qp_modify are serialized.
171 * Possible optimizations (wait for profile data to see if/where we
172 * have locks bouncing between CPUs):
173 * - split cq/qp table lock into n separate (cache-aligned) locks,
174 * indexed (say) by the page in the table
175 * - split QP struct lock into three (one for common info, one for the
176 * send queue and one for the receive queue)
188 /* Next fields are Arbel only */
195 union mthca_buf queue;
197 wait_queue_head_t wait;
210 u16 counter; /* Arbel only */
211 int db_index; /* Arbel only */
212 __be32 *db; /* Arbel only */
217 union mthca_buf queue;
220 wait_queue_head_t wait;
234 int db_index; /* Arbel only */
252 enum ib_sig_type sq_policy;
257 union mthca_buf queue;
259 wait_queue_head_t wait;
268 struct ib_ud_header ud_header;
271 dma_addr_t header_dma;
274 static inline struct mthca_ucontext *to_mucontext(struct ib_ucontext *ibucontext)
276 return container_of(ibucontext, struct mthca_ucontext, ibucontext);
279 static inline struct mthca_fmr *to_mfmr(struct ib_fmr *ibmr)
281 return container_of(ibmr, struct mthca_fmr, ibmr);
284 static inline struct mthca_mr *to_mmr(struct ib_mr *ibmr)
286 return container_of(ibmr, struct mthca_mr, ibmr);
289 static inline struct mthca_pd *to_mpd(struct ib_pd *ibpd)
291 return container_of(ibpd, struct mthca_pd, ibpd);
294 static inline struct mthca_ah *to_mah(struct ib_ah *ibah)
296 return container_of(ibah, struct mthca_ah, ibah);
299 static inline struct mthca_cq *to_mcq(struct ib_cq *ibcq)
301 return container_of(ibcq, struct mthca_cq, ibcq);
304 static inline struct mthca_srq *to_msrq(struct ib_srq *ibsrq)
306 return container_of(ibsrq, struct mthca_srq, ibsrq);
309 static inline struct mthca_qp *to_mqp(struct ib_qp *ibqp)
311 return container_of(ibqp, struct mthca_qp, ibqp);
314 static inline struct mthca_sqp *to_msqp(struct mthca_qp *qp)
316 return container_of(qp, struct mthca_sqp, qp);
319 #endif /* MTHCA_PROVIDER_H */