blob: 179a8f610d0f00ded795bfa0b07310a9ac1fc986 [file] [log] [blame]
Linus Torvalds1da177e2005-04-16 15:20:36 -07001/*
2 * Copyright (c) 2004 Topspin Communications. All rights reserved.
Roland Dreier4885bf62006-01-30 14:31:33 -08003 * Copyright (c) 2005, 2006 Cisco Systems. All rights reserved.
Roland Dreier2a1d9b72005-08-10 23:03:10 -07004 * Copyright (c) 2005 Mellanox Technologies. All rights reserved.
Linus Torvalds1da177e2005-04-16 15:20:36 -07005 *
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:
11 *
12 * Redistribution and use in source and binary forms, with or
13 * without modification, are permitted provided that the following
14 * conditions are met:
15 *
16 * - Redistributions of source code must retain the above
17 * copyright notice, this list of conditions and the following
18 * disclaimer.
19 *
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.
24 *
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
32 * SOFTWARE.
33 *
34 * $Id: mthca_provider.h 1349 2004-12-16 21:09:43Z roland $
35 */
36
37#ifndef MTHCA_PROVIDER_H
38#define MTHCA_PROVIDER_H
39
Roland Dreiera4d61e82005-08-25 13:40:04 -070040#include <rdma/ib_verbs.h>
41#include <rdma/ib_pack.h>
Linus Torvalds1da177e2005-04-16 15:20:36 -070042
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)
48
49struct mthca_buf_list {
50 void *buf;
51 DECLARE_PCI_UNMAP_ADDR(mapping)
52};
53
Roland Dreier87b81672005-08-18 13:39:31 -070054union mthca_buf {
55 struct mthca_buf_list direct;
56 struct mthca_buf_list *page_list;
57};
58
Linus Torvalds1da177e2005-04-16 15:20:36 -070059struct mthca_uar {
60 unsigned long pfn;
61 int index;
62};
63
Roland Dreier5e0b5372005-07-07 17:57:16 -070064struct mthca_user_db_table;
65
66struct mthca_ucontext {
67 struct ib_ucontext ibucontext;
68 struct mthca_uar uar;
69 struct mthca_user_db_table *db_tab;
70};
71
Roland Dreierd56d6f92005-06-27 14:36:43 -070072struct mthca_mtt;
73
Linus Torvalds1da177e2005-04-16 15:20:36 -070074struct mthca_mr {
Roland Dreierd56d6f92005-06-27 14:36:43 -070075 struct ib_mr ibmr;
76 struct mthca_mtt *mtt;
Linus Torvalds1da177e2005-04-16 15:20:36 -070077};
78
Michael S. Tsirkine0f5fdc2005-04-16 15:26:30 -070079struct mthca_fmr {
Roland Dreierd56d6f92005-06-27 14:36:43 -070080 struct ib_fmr ibmr;
Michael S. Tsirkine0f5fdc2005-04-16 15:26:30 -070081 struct ib_fmr_attr attr;
Roland Dreierd56d6f92005-06-27 14:36:43 -070082 struct mthca_mtt *mtt;
83 int maps;
Michael S. Tsirkine0f5fdc2005-04-16 15:26:30 -070084 union {
85 struct {
86 struct mthca_mpt_entry __iomem *mpt;
87 u64 __iomem *mtts;
88 } tavor;
89 struct {
90 struct mthca_mpt_entry *mpt;
91 __be64 *mtts;
92 } arbel;
93 } mem;
94};
95
Linus Torvalds1da177e2005-04-16 15:20:36 -070096struct mthca_pd {
97 struct ib_pd ibpd;
98 u32 pd_num;
99 atomic_t sqp_count;
100 struct mthca_mr ntmr;
Roland Dreier99264c12005-07-07 17:57:18 -0700101 int privileged;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700102};
103
104struct mthca_eq {
105 struct mthca_dev *dev;
106 int eqn;
107 u32 eqn_mask;
108 u32 cons_index;
109 u16 msi_x_vector;
110 u16 msi_x_entry;
111 int have_irq;
112 int nent;
113 struct mthca_buf_list *page_list;
114 struct mthca_mr mr;
115};
116
117struct mthca_av;
118
119enum mthca_ah_type {
120 MTHCA_AH_ON_HCA,
121 MTHCA_AH_PCI_POOL,
122 MTHCA_AH_KMALLOC
123};
124
125struct mthca_ah {
126 struct ib_ah ibah;
127 enum mthca_ah_type type;
128 u32 key;
129 struct mthca_av *av;
130 dma_addr_t avdma;
131};
132
133/*
134 * Quick description of our CQ/QP locking scheme:
135 *
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.
141 *
Roland Dreiera3285aa2006-05-09 10:50:29 -0700142 * Each struct mthca_cq/qp also has an ref count, protected by the
143 * corresponding table lock. The pointer from the cq/qp_table to the
144 * struct counts as one reference. This reference also is good for
145 * access through the consumer API, so modifying the CQ/QP etc doesn't
146 * need to take another reference. Access to a QP because of a
147 * completion being polled does not need a reference either.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700148 *
149 * Finally, each struct mthca_cq/qp has a wait_queue_head_t for the
150 * destroy function to sleep on.
151 *
152 * This means that access from the consumer API requires nothing but
153 * taking the struct's lock.
154 *
155 * Access because of a completion event should go as follows:
156 * - lock cq/qp_table and look up struct
157 * - increment ref count in struct
158 * - drop cq/qp_table lock
159 * - lock struct, do your thing, and unlock struct
160 * - decrement ref count; if zero, wake up waiters
161 *
162 * To destroy a CQ/QP, we can do the following:
Roland Dreiera3285aa2006-05-09 10:50:29 -0700163 * - lock cq/qp_table
164 * - remove pointer and decrement ref count
165 * - unlock cq/qp_table lock
Linus Torvalds1da177e2005-04-16 15:20:36 -0700166 * - wait_event until ref count is zero
167 *
168 * It is the consumer's responsibilty to make sure that no QP
Roland Dreier4885bf62006-01-30 14:31:33 -0800169 * operations (WQE posting or state modification) are pending when a
Linus Torvalds1da177e2005-04-16 15:20:36 -0700170 * QP is destroyed. Also, the consumer must make sure that calls to
Roland Dreier4885bf62006-01-30 14:31:33 -0800171 * qp_modify are serialized. Similarly, the consumer is responsible
172 * for ensuring that no CQ resize operations are pending when a CQ
173 * is destroyed.
Linus Torvalds1da177e2005-04-16 15:20:36 -0700174 *
175 * Possible optimizations (wait for profile data to see if/where we
176 * have locks bouncing between CPUs):
177 * - split cq/qp table lock into n separate (cache-aligned) locks,
178 * indexed (say) by the page in the table
179 * - split QP struct lock into three (one for common info, one for the
180 * send queue and one for the receive queue)
181 */
182
Roland Dreier4885bf62006-01-30 14:31:33 -0800183struct mthca_cq_buf {
184 union mthca_buf queue;
185 struct mthca_mr mr;
186 int is_direct;
187};
188
189struct mthca_cq_resize {
190 struct mthca_cq_buf buf;
191 int cqe;
192 enum {
193 CQ_RESIZE_ALLOC,
194 CQ_RESIZE_READY,
195 CQ_RESIZE_SWAPPED
196 } state;
197};
198
Linus Torvalds1da177e2005-04-16 15:20:36 -0700199struct mthca_cq {
Roland Dreier4885bf62006-01-30 14:31:33 -0800200 struct ib_cq ibcq;
201 spinlock_t lock;
Roland Dreiera3285aa2006-05-09 10:50:29 -0700202 int refcount;
Roland Dreier4885bf62006-01-30 14:31:33 -0800203 int cqn;
204 u32 cons_index;
205 struct mthca_cq_buf buf;
206 struct mthca_cq_resize *resize_buf;
207 int is_kernel;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700208
209 /* Next fields are Arbel only */
Roland Dreier4885bf62006-01-30 14:31:33 -0800210 int set_ci_db_index;
211 __be32 *set_ci_db;
212 int arm_db_index;
213 __be32 *arm_db;
214 int arm_sn;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700215
Roland Dreier4885bf62006-01-30 14:31:33 -0800216 wait_queue_head_t wait;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700217};
218
Roland Dreierec34a922005-08-19 10:59:31 -0700219struct mthca_srq {
220 struct ib_srq ibsrq;
221 spinlock_t lock;
Roland Dreiera3285aa2006-05-09 10:50:29 -0700222 int refcount;
Roland Dreierec34a922005-08-19 10:59:31 -0700223 int srqn;
224 int max;
225 int max_gs;
226 int wqe_shift;
227 int first_free;
228 int last_free;
229 u16 counter; /* Arbel only */
230 int db_index; /* Arbel only */
231 __be32 *db; /* Arbel only */
232 void *last;
233
234 int is_direct;
235 u64 *wrid;
236 union mthca_buf queue;
237 struct mthca_mr mr;
238
239 wait_queue_head_t wait;
240};
241
Linus Torvalds1da177e2005-04-16 15:20:36 -0700242struct mthca_wq {
243 spinlock_t lock;
244 int max;
245 unsigned next_ind;
246 unsigned last_comp;
247 unsigned head;
248 unsigned tail;
249 void *last;
250 int max_gs;
251 int wqe_shift;
252
253 int db_index; /* Arbel only */
Sean Hefty97f52eb2005-08-13 21:05:57 -0700254 __be32 *db;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700255};
256
257struct mthca_qp {
258 struct ib_qp ibqp;
Roland Dreiera3285aa2006-05-09 10:50:29 -0700259 int refcount;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700260 u32 qpn;
261 int is_direct;
Jack Morgensteinbf6a9e32006-04-10 09:43:47 -0700262 u8 port; /* for SQP and memfree use only */
263 u8 alt_port; /* for memfree use only */
Linus Torvalds1da177e2005-04-16 15:20:36 -0700264 u8 transport;
265 u8 state;
266 u8 atomic_rd_en;
267 u8 resp_depth;
268
269 struct mthca_mr mr;
270
271 struct mthca_wq rq;
272 struct mthca_wq sq;
273 enum ib_sig_type sq_policy;
274 int send_wqe_offset;
Jack Morgenstein77369ed2005-11-09 11:26:07 -0800275 int max_inline_data;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700276
277 u64 *wrid;
Roland Dreier87b81672005-08-18 13:39:31 -0700278 union mthca_buf queue;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700279
280 wait_queue_head_t wait;
281};
282
283struct mthca_sqp {
284 struct mthca_qp qp;
Linus Torvalds1da177e2005-04-16 15:20:36 -0700285 int pkey_index;
286 u32 qkey;
287 u32 send_psn;
288 struct ib_ud_header ud_header;
289 int header_buf_size;
290 void *header_buf;
291 dma_addr_t header_dma;
292};
293
Roland Dreier5e0b5372005-07-07 17:57:16 -0700294static inline struct mthca_ucontext *to_mucontext(struct ib_ucontext *ibucontext)
295{
296 return container_of(ibucontext, struct mthca_ucontext, ibucontext);
297}
298
Michael S. Tsirkine0f5fdc2005-04-16 15:26:30 -0700299static inline struct mthca_fmr *to_mfmr(struct ib_fmr *ibmr)
300{
301 return container_of(ibmr, struct mthca_fmr, ibmr);
302}
303
Linus Torvalds1da177e2005-04-16 15:20:36 -0700304static inline struct mthca_mr *to_mmr(struct ib_mr *ibmr)
305{
306 return container_of(ibmr, struct mthca_mr, ibmr);
307}
308
309static inline struct mthca_pd *to_mpd(struct ib_pd *ibpd)
310{
311 return container_of(ibpd, struct mthca_pd, ibpd);
312}
313
314static inline struct mthca_ah *to_mah(struct ib_ah *ibah)
315{
316 return container_of(ibah, struct mthca_ah, ibah);
317}
318
319static inline struct mthca_cq *to_mcq(struct ib_cq *ibcq)
320{
321 return container_of(ibcq, struct mthca_cq, ibcq);
322}
323
Roland Dreierec34a922005-08-19 10:59:31 -0700324static inline struct mthca_srq *to_msrq(struct ib_srq *ibsrq)
325{
326 return container_of(ibsrq, struct mthca_srq, ibsrq);
327}
328
Linus Torvalds1da177e2005-04-16 15:20:36 -0700329static inline struct mthca_qp *to_mqp(struct ib_qp *ibqp)
330{
331 return container_of(ibqp, struct mthca_qp, ibqp);
332}
333
334static inline struct mthca_sqp *to_msqp(struct mthca_qp *qp)
335{
336 return container_of(qp, struct mthca_sqp, qp);
337}
338
339#endif /* MTHCA_PROVIDER_H */