mlx4_qp.c revision 255932
1117397Skan/*
2117397Skan * Copyright (c) 2004 Topspin Communications.  All rights reserved.
3117397Skan * Copyright (c) 2005, 2006, 2007 Cisco Systems, Inc. All rights reserved.
4117397Skan * Copyright (c) 2005, 2006, 2007, 2008 Mellanox Technologies. All rights reserved.
5117397Skan * Copyright (c) 2004 Voltaire, Inc. All rights reserved.
6117397Skan *
7117397Skan * This software is available to you under a choice of one of two
8117397Skan * licenses.  You may choose to be licensed under the terms of the GNU
9117397Skan * General Public License (GPL) Version 2, available from the file
10117397Skan * COPYING in the main directory of this source tree, or the
11117397Skan * OpenIB.org BSD license below:
12117397Skan *
13117397Skan *     Redistribution and use in source and binary forms, with or
14117397Skan *     without modification, are permitted provided that the following
15117397Skan *     conditions are met:
16117397Skan *
17117397Skan *      - Redistributions of source code must retain the above
18117397Skan *        copyright notice, this list of conditions and the following
19117397Skan *        disclaimer.
20117397Skan *
21117397Skan *      - Redistributions in binary form must reproduce the above
22117397Skan *        copyright notice, this list of conditions and the following
23117397Skan *        disclaimer in the documentation and/or other materials
24117397Skan *        provided with the distribution.
25117397Skan *
26117397Skan * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
27117397Skan * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
28117397Skan * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
29117397Skan * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
30117397Skan * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
31117397Skan * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
32117397Skan * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
33117397Skan * SOFTWARE.
34117397Skan */
35117397Skan
36117397Skan#include <linux/init.h>
37117397Skan
38117397Skan#include <linux/mlx4/cmd.h>
39117397Skan#include <linux/mlx4/qp.h>
40117397Skan
41117397Skan#include "mlx4.h"
42117397Skan#include "icm.h"
43117397Skan
44117397Skan/*
45117397Skan * QP to support BF should have bits 6,7 cleared
46117397Skan */
47117397Skan#define MLX4_BF_QP_SKIP_MASK	0xc0
48117397Skan#define MLX4_MAX_BF_QP_RANGE	0x40
49117397Skan
50117397Skanvoid mlx4_qp_event(struct mlx4_dev *dev, u32 qpn, int event_type)
51117397Skan{
52117397Skan	struct mlx4_qp_table *qp_table = &mlx4_priv(dev)->qp_table;
53117397Skan	struct mlx4_qp *qp;
54117397Skan
55117397Skan	spin_lock(&qp_table->lock);
56117397Skan
57117397Skan	qp = __mlx4_qp_lookup(dev, qpn);
58117397Skan	if (qp)
59117397Skan		atomic_inc(&qp->refcount);
60117397Skan
61117397Skan	spin_unlock(&qp_table->lock);
62117397Skan
63117397Skan	if (!qp) {
64117397Skan		mlx4_dbg(dev, "Async event for none existent QP %08x\n", qpn);
65117397Skan		return;
66117397Skan	}
67117397Skan
68117397Skan	qp->event(qp, event_type);
69117397Skan
70117397Skan	if (atomic_dec_and_test(&qp->refcount))
71117397Skan		complete(&qp->free);
72117397Skan}
73117397Skan
74117397Skan/* used for INIT/CLOSE port logic */
75117397Skanstatic int is_master_qp0(struct mlx4_dev *dev, struct mlx4_qp *qp, int *real_qp0, int *proxy_qp0)
76117397Skan{
77117397Skan	/* this procedure is called after we already know we are on the master */
78117397Skan	/* qp0 is either the proxy qp0, or the real qp0 */
79117397Skan	u32 pf_proxy_offset = dev->phys_caps.base_proxy_sqpn + 8 * mlx4_master_func_num(dev);
80117397Skan	*proxy_qp0 = qp->qpn >= pf_proxy_offset && qp->qpn <= pf_proxy_offset + 1;
81117397Skan
82117397Skan	*real_qp0 = qp->qpn >= dev->phys_caps.base_sqpn &&
83		qp->qpn <= dev->phys_caps.base_sqpn + 1;
84
85	return *real_qp0 || *proxy_qp0;
86}
87
88static int __mlx4_qp_modify(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
89		     enum mlx4_qp_state cur_state, enum mlx4_qp_state new_state,
90		     struct mlx4_qp_context *context,
91		     enum mlx4_qp_optpar optpar,
92		     int sqd_event, struct mlx4_qp *qp, int native)
93{
94	static const u16 op[MLX4_QP_NUM_STATE][MLX4_QP_NUM_STATE] = {
95		[MLX4_QP_STATE_RST] = {
96			[MLX4_QP_STATE_RST]	= MLX4_CMD_2RST_QP,
97			[MLX4_QP_STATE_ERR]	= MLX4_CMD_2ERR_QP,
98			[MLX4_QP_STATE_INIT]	= MLX4_CMD_RST2INIT_QP,
99		},
100		[MLX4_QP_STATE_INIT]  = {
101			[MLX4_QP_STATE_RST]	= MLX4_CMD_2RST_QP,
102			[MLX4_QP_STATE_ERR]	= MLX4_CMD_2ERR_QP,
103			[MLX4_QP_STATE_INIT]	= MLX4_CMD_INIT2INIT_QP,
104			[MLX4_QP_STATE_RTR]	= MLX4_CMD_INIT2RTR_QP,
105		},
106		[MLX4_QP_STATE_RTR]   = {
107			[MLX4_QP_STATE_RST]	= MLX4_CMD_2RST_QP,
108			[MLX4_QP_STATE_ERR]	= MLX4_CMD_2ERR_QP,
109			[MLX4_QP_STATE_RTS]	= MLX4_CMD_RTR2RTS_QP,
110		},
111		[MLX4_QP_STATE_RTS]   = {
112			[MLX4_QP_STATE_RST]	= MLX4_CMD_2RST_QP,
113			[MLX4_QP_STATE_ERR]	= MLX4_CMD_2ERR_QP,
114			[MLX4_QP_STATE_RTS]	= MLX4_CMD_RTS2RTS_QP,
115			[MLX4_QP_STATE_SQD]	= MLX4_CMD_RTS2SQD_QP,
116		},
117		[MLX4_QP_STATE_SQD] = {
118			[MLX4_QP_STATE_RST]	= MLX4_CMD_2RST_QP,
119			[MLX4_QP_STATE_ERR]	= MLX4_CMD_2ERR_QP,
120			[MLX4_QP_STATE_RTS]	= MLX4_CMD_SQD2RTS_QP,
121			[MLX4_QP_STATE_SQD]	= MLX4_CMD_SQD2SQD_QP,
122		},
123		[MLX4_QP_STATE_SQER] = {
124			[MLX4_QP_STATE_RST]	= MLX4_CMD_2RST_QP,
125			[MLX4_QP_STATE_ERR]	= MLX4_CMD_2ERR_QP,
126			[MLX4_QP_STATE_RTS]	= MLX4_CMD_SQERR2RTS_QP,
127		},
128		[MLX4_QP_STATE_ERR] = {
129			[MLX4_QP_STATE_RST]	= MLX4_CMD_2RST_QP,
130			[MLX4_QP_STATE_ERR]	= MLX4_CMD_2ERR_QP,
131		}
132	};
133
134	struct mlx4_priv *priv = mlx4_priv(dev);
135	struct mlx4_cmd_mailbox *mailbox;
136	int ret = 0;
137	int real_qp0 = 0;
138	int proxy_qp0 = 0;
139	u8 port;
140
141	if (cur_state >= MLX4_QP_NUM_STATE || new_state >= MLX4_QP_NUM_STATE ||
142	    !op[cur_state][new_state])
143		return -EINVAL;
144
145	if (op[cur_state][new_state] == MLX4_CMD_2RST_QP) {
146		ret = mlx4_cmd(dev, 0, qp->qpn, 2,
147			MLX4_CMD_2RST_QP, MLX4_CMD_TIME_CLASS_A, native);
148		if (mlx4_is_master(dev) && cur_state != MLX4_QP_STATE_ERR &&
149		    cur_state != MLX4_QP_STATE_RST &&
150		    is_master_qp0(dev, qp, &real_qp0, &proxy_qp0)) {
151			port = (qp->qpn & 1) + 1;
152			if (proxy_qp0)
153				priv->mfunc.master.qp0_state[port].proxy_qp0_active = 0;
154			else
155				priv->mfunc.master.qp0_state[port].qp0_active = 0;
156		}
157		return ret;
158	}
159
160	mailbox = mlx4_alloc_cmd_mailbox(dev);
161	if (IS_ERR(mailbox))
162		return PTR_ERR(mailbox);
163
164	if (cur_state == MLX4_QP_STATE_RST && new_state == MLX4_QP_STATE_INIT) {
165		u64 mtt_addr = mlx4_mtt_addr(dev, mtt);
166		context->mtt_base_addr_h = mtt_addr >> 32;
167		context->mtt_base_addr_l = cpu_to_be32(mtt_addr & 0xffffffff);
168		context->log_page_size   = mtt->page_shift - MLX4_ICM_PAGE_SHIFT;
169	}
170
171	*(__be32 *) mailbox->buf = cpu_to_be32(optpar);
172	memcpy(mailbox->buf + 8, context, sizeof *context);
173
174	((struct mlx4_qp_context *) (mailbox->buf + 8))->local_qpn =
175		cpu_to_be32(qp->qpn);
176
177	ret = mlx4_cmd(dev, mailbox->dma,
178		       qp->qpn | (!!sqd_event << 31),
179		       new_state == MLX4_QP_STATE_RST ? 2 : 0,
180		       op[cur_state][new_state], MLX4_CMD_TIME_CLASS_C, native);
181
182	if (mlx4_is_master(dev) && is_master_qp0(dev, qp, &real_qp0, &proxy_qp0)) {
183		port = (qp->qpn & 1) + 1;
184		if (cur_state != MLX4_QP_STATE_ERR &&
185		    cur_state != MLX4_QP_STATE_RST &&
186		    new_state == MLX4_QP_STATE_ERR) {
187			if (proxy_qp0)
188				priv->mfunc.master.qp0_state[port].proxy_qp0_active = 0;
189			else
190				priv->mfunc.master.qp0_state[port].qp0_active = 0;
191		} else if (new_state == MLX4_QP_STATE_RTR) {
192			if (proxy_qp0)
193				priv->mfunc.master.qp0_state[port].proxy_qp0_active = 1;
194			else
195				priv->mfunc.master.qp0_state[port].qp0_active = 1;
196		}
197	}
198
199	mlx4_free_cmd_mailbox(dev, mailbox);
200	return ret;
201}
202
203int mlx4_qp_modify(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
204		   enum mlx4_qp_state cur_state, enum mlx4_qp_state new_state,
205		   struct mlx4_qp_context *context,
206		   enum mlx4_qp_optpar optpar,
207		   int sqd_event, struct mlx4_qp *qp)
208{
209	return __mlx4_qp_modify(dev, mtt, cur_state, new_state, context,
210				optpar, sqd_event, qp, 0);
211}
212EXPORT_SYMBOL_GPL(mlx4_qp_modify);
213
214int __mlx4_qp_reserve_range(struct mlx4_dev *dev, int cnt, int align,
215			    int *base, u8 bf_qp)
216{
217	struct mlx4_priv *priv = mlx4_priv(dev);
218	struct mlx4_qp_table *qp_table = &priv->qp_table;
219
220	if (cnt > MLX4_MAX_BF_QP_RANGE && bf_qp)
221		return -ENOMEM;
222
223	*base = mlx4_bitmap_alloc_range(&qp_table->bitmap, cnt, align,
224					bf_qp ? MLX4_BF_QP_SKIP_MASK : 0);
225	if (*base == -1)
226		return -ENOMEM;
227
228	return 0;
229}
230
231int mlx4_qp_reserve_range(struct mlx4_dev *dev, int cnt, int align,
232			  int *base, u8 bf_qp)
233{
234	u64 in_param = 0;
235	u64 out_param;
236	int err;
237
238	if (mlx4_is_mfunc(dev)) {
239		set_param_l(&in_param, (((!!bf_qp) << 31) | (u32)cnt));
240		set_param_h(&in_param, align);
241		err = mlx4_cmd_imm(dev, in_param, &out_param,
242				   RES_QP, RES_OP_RESERVE,
243				   MLX4_CMD_ALLOC_RES,
244				   MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
245		if (err)
246			return err;
247
248		*base = get_param_l(&out_param);
249		return 0;
250	}
251	return __mlx4_qp_reserve_range(dev, cnt, align, base, bf_qp);
252}
253EXPORT_SYMBOL_GPL(mlx4_qp_reserve_range);
254
255void __mlx4_qp_release_range(struct mlx4_dev *dev, int base_qpn, int cnt)
256{
257	struct mlx4_priv *priv = mlx4_priv(dev);
258	struct mlx4_qp_table *qp_table = &priv->qp_table;
259
260	if (mlx4_is_qp_reserved(dev, (u32) base_qpn))
261		return;
262	mlx4_bitmap_free_range(&qp_table->bitmap, base_qpn, cnt);
263}
264
265void mlx4_qp_release_range(struct mlx4_dev *dev, int base_qpn, int cnt)
266{
267	u64 in_param = 0;
268	int err;
269
270	if (mlx4_is_mfunc(dev)) {
271		set_param_l(&in_param, base_qpn);
272		set_param_h(&in_param, cnt);
273		err = mlx4_cmd(dev, in_param, RES_QP, RES_OP_RESERVE,
274			       MLX4_CMD_FREE_RES,
275			       MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
276		if (err) {
277			mlx4_warn(dev, "Failed to release qp range"
278				  " base:%d cnt:%d\n", base_qpn, cnt);
279		}
280	} else
281		 __mlx4_qp_release_range(dev, base_qpn, cnt);
282}
283EXPORT_SYMBOL_GPL(mlx4_qp_release_range);
284
285int __mlx4_qp_alloc_icm(struct mlx4_dev *dev, int qpn)
286{
287	struct mlx4_priv *priv = mlx4_priv(dev);
288	struct mlx4_qp_table *qp_table = &priv->qp_table;
289	int err;
290
291	err = mlx4_table_get(dev, &qp_table->qp_table, qpn);
292	if (err)
293		goto err_out;
294
295	err = mlx4_table_get(dev, &qp_table->auxc_table, qpn);
296	if (err)
297		goto err_put_qp;
298
299	err = mlx4_table_get(dev, &qp_table->altc_table, qpn);
300	if (err)
301		goto err_put_auxc;
302
303	err = mlx4_table_get(dev, &qp_table->rdmarc_table, qpn);
304	if (err)
305		goto err_put_altc;
306
307	err = mlx4_table_get(dev, &qp_table->cmpt_table, qpn);
308	if (err)
309		goto err_put_rdmarc;
310
311	return 0;
312
313err_put_rdmarc:
314	mlx4_table_put(dev, &qp_table->rdmarc_table, qpn);
315
316err_put_altc:
317	mlx4_table_put(dev, &qp_table->altc_table, qpn);
318
319err_put_auxc:
320	mlx4_table_put(dev, &qp_table->auxc_table, qpn);
321
322err_put_qp:
323	mlx4_table_put(dev, &qp_table->qp_table, qpn);
324
325err_out:
326	return err;
327}
328
329static int mlx4_qp_alloc_icm(struct mlx4_dev *dev, int qpn)
330{
331	u64 param = 0;
332
333	if (mlx4_is_mfunc(dev)) {
334		set_param_l(&param, qpn);
335		return mlx4_cmd_imm(dev, param, &param, RES_QP, RES_OP_MAP_ICM,
336				    MLX4_CMD_ALLOC_RES, MLX4_CMD_TIME_CLASS_A,
337				    MLX4_CMD_WRAPPED);
338	}
339	return __mlx4_qp_alloc_icm(dev, qpn);
340}
341
342void __mlx4_qp_free_icm(struct mlx4_dev *dev, int qpn)
343{
344	struct mlx4_priv *priv = mlx4_priv(dev);
345	struct mlx4_qp_table *qp_table = &priv->qp_table;
346
347	mlx4_table_put(dev, &qp_table->cmpt_table, qpn);
348	mlx4_table_put(dev, &qp_table->rdmarc_table, qpn);
349	mlx4_table_put(dev, &qp_table->altc_table, qpn);
350	mlx4_table_put(dev, &qp_table->auxc_table, qpn);
351	mlx4_table_put(dev, &qp_table->qp_table, qpn);
352}
353
354static void mlx4_qp_free_icm(struct mlx4_dev *dev, int qpn)
355{
356	u64 in_param = 0;
357
358	if (mlx4_is_mfunc(dev)) {
359		set_param_l(&in_param, qpn);
360		if (mlx4_cmd(dev, in_param, RES_QP, RES_OP_MAP_ICM,
361			     MLX4_CMD_FREE_RES, MLX4_CMD_TIME_CLASS_A,
362			     MLX4_CMD_WRAPPED))
363			mlx4_warn(dev, "Failed to free icm of qp:%d\n", qpn);
364	} else
365		__mlx4_qp_free_icm(dev, qpn);
366}
367
368int mlx4_qp_alloc(struct mlx4_dev *dev, int qpn, struct mlx4_qp *qp)
369{
370	struct mlx4_priv *priv = mlx4_priv(dev);
371	struct mlx4_qp_table *qp_table = &priv->qp_table;
372	int err;
373
374	if (!qpn)
375		return -EINVAL;
376
377	qp->qpn = qpn;
378
379	err = mlx4_qp_alloc_icm(dev, qpn);
380	if (err)
381		return err;
382
383	spin_lock_irq(&qp_table->lock);
384	err = radix_tree_insert(&dev->qp_table_tree, qp->qpn &
385				(dev->caps.num_qps - 1), qp);
386	spin_unlock_irq(&qp_table->lock);
387	if (err)
388		goto err_icm;
389
390	atomic_set(&qp->refcount, 1);
391	init_completion(&qp->free);
392
393	return 0;
394
395err_icm:
396	mlx4_qp_free_icm(dev, qpn);
397	return err;
398}
399
400EXPORT_SYMBOL_GPL(mlx4_qp_alloc);
401
402void mlx4_qp_remove(struct mlx4_dev *dev, struct mlx4_qp *qp)
403{
404	struct mlx4_qp_table *qp_table = &mlx4_priv(dev)->qp_table;
405	unsigned long flags;
406
407	spin_lock_irqsave(&qp_table->lock, flags);
408	radix_tree_delete(&dev->qp_table_tree, qp->qpn & (dev->caps.num_qps - 1));
409	spin_unlock_irqrestore(&qp_table->lock, flags);
410}
411EXPORT_SYMBOL_GPL(mlx4_qp_remove);
412
413void mlx4_qp_free(struct mlx4_dev *dev, struct mlx4_qp *qp)
414{
415	if (atomic_dec_and_test(&qp->refcount))
416		complete(&qp->free);
417	wait_for_completion(&qp->free);
418
419	mlx4_qp_free_icm(dev, qp->qpn);
420}
421EXPORT_SYMBOL_GPL(mlx4_qp_free);
422
423static int mlx4_CONF_SPECIAL_QP(struct mlx4_dev *dev, u32 base_qpn)
424{
425	return mlx4_cmd(dev, 0, base_qpn, 0, MLX4_CMD_CONF_SPECIAL_QP,
426			MLX4_CMD_TIME_CLASS_B, MLX4_CMD_NATIVE);
427}
428
429int mlx4_init_qp_table(struct mlx4_dev *dev)
430{
431	struct mlx4_qp_table *qp_table = &mlx4_priv(dev)->qp_table;
432	int err;
433	int reserved_from_top = 0;
434	int reserved_from_bot;
435	int k;
436
437	spin_lock_init(&qp_table->lock);
438	INIT_RADIX_TREE(&dev->qp_table_tree, GFP_ATOMIC);
439	if (mlx4_is_slave(dev))
440		return 0;
441
442	/*
443	 * We reserve 2 extra QPs per port for the special QPs.  The
444	 * block of special QPs must be aligned to a multiple of 8, so
445	 * round up.
446	 *
447	 * We also reserve the MSB of the 24-bit QP number to indicate
448	 * that a QP is an XRC QP.
449	 */
450	dev->phys_caps.base_sqpn =
451		ALIGN(dev->caps.reserved_qps_cnt[MLX4_QP_REGION_FW], 8);
452
453	{
454		int sort[MLX4_NUM_QP_REGION];
455		int i, j, tmp;
456		int last_base = dev->caps.num_qps;
457
458		for (i = 1; i < MLX4_NUM_QP_REGION; ++i)
459			sort[i] = i;
460
461		for (i = MLX4_NUM_QP_REGION; i > 0; --i) {
462			for (j = 2; j < i; ++j) {
463				if (dev->caps.reserved_qps_cnt[sort[j]] >
464				    dev->caps.reserved_qps_cnt[sort[j - 1]]) {
465					tmp             = sort[j];
466					sort[j]         = sort[j - 1];
467					sort[j - 1]     = tmp;
468				}
469			}
470		}
471
472		for (i = 1; i < MLX4_NUM_QP_REGION; ++i) {
473			last_base -= dev->caps.reserved_qps_cnt[sort[i]];
474			dev->caps.reserved_qps_base[sort[i]] = last_base;
475			reserved_from_top +=
476				dev->caps.reserved_qps_cnt[sort[i]];
477		}
478
479	}
480
481       /* Reserve 8 real SQPs in both native and SRIOV modes.
482	* In addition, in SRIOV mode, reserve 8 proxy SQPs per function
483	* (for all PFs and VFs), and 8 corresponding tunnel QPs.
484	* Each proxy SQP works opposite its own tunnel QP.
485	*
486	* The QPs are arranged as follows:
487	* a. 8 real SQPs
488	* b. All the proxy SQPs (8 per function)
489	* c. All the tunnel QPs (8 per function)
490	*/
491	reserved_from_bot = mlx4_num_reserved_sqps(dev);
492	if (reserved_from_bot + reserved_from_top > dev->caps.num_qps) {
493		mlx4_err(dev, "Number of reserved QPs is higher than number "
494			 "of QPs, increase the value of log_num_qp\n");
495		return -EINVAL;
496	}
497
498	err = mlx4_bitmap_init(&qp_table->bitmap, dev->caps.num_qps,
499			       (1 << 23) - 1, reserved_from_bot,
500			       reserved_from_top);
501	if (err)
502		return err;
503
504	if (mlx4_is_mfunc(dev)) {
505		/* for PPF use */
506		dev->phys_caps.base_proxy_sqpn = dev->phys_caps.base_sqpn + 8;
507		dev->phys_caps.base_tunnel_sqpn = dev->phys_caps.base_sqpn + 8 + 8 * MLX4_MFUNC_MAX;
508
509		/* In mfunc, calculate proxy and tunnel qp offsets for the PF here,
510		 * since the PF does not call mlx4_slave_caps */
511		dev->caps.qp0_tunnel = kcalloc(dev->caps.num_ports, sizeof (u32), GFP_KERNEL);
512		dev->caps.qp0_proxy = kcalloc(dev->caps.num_ports, sizeof (u32), GFP_KERNEL);
513		dev->caps.qp1_tunnel = kcalloc(dev->caps.num_ports, sizeof (u32), GFP_KERNEL);
514		dev->caps.qp1_proxy = kcalloc(dev->caps.num_ports, sizeof (u32), GFP_KERNEL);
515
516		if (!dev->caps.qp0_tunnel || !dev->caps.qp0_proxy ||
517		    !dev->caps.qp1_tunnel || !dev->caps.qp1_proxy) {
518			err = -ENOMEM;
519			goto err_mem;
520		}
521
522		for (k = 0; k < dev->caps.num_ports; k++) {
523			dev->caps.qp0_proxy[k] = dev->phys_caps.base_proxy_sqpn +
524				8 * mlx4_master_func_num(dev) + k;
525			dev->caps.qp0_tunnel[k] = dev->caps.qp0_proxy[k] + 8 * MLX4_MFUNC_MAX;
526			dev->caps.qp1_proxy[k] = dev->phys_caps.base_proxy_sqpn +
527				8 * mlx4_master_func_num(dev) + MLX4_MAX_PORTS + k;
528			dev->caps.qp1_tunnel[k] = dev->caps.qp1_proxy[k] + 8 * MLX4_MFUNC_MAX;
529		}
530	}
531
532
533	err = mlx4_CONF_SPECIAL_QP(dev, dev->phys_caps.base_sqpn);
534	if (err)
535		goto err_mem;
536	return 0;
537
538err_mem:
539	kfree(dev->caps.qp0_tunnel);
540	kfree(dev->caps.qp0_proxy);
541	kfree(dev->caps.qp1_tunnel);
542	kfree(dev->caps.qp1_proxy);
543	dev->caps.qp0_tunnel = dev->caps.qp0_proxy =
544		dev->caps.qp1_tunnel = dev->caps.qp1_proxy = NULL;
545	return err;
546}
547
548void mlx4_cleanup_qp_table(struct mlx4_dev *dev)
549{
550	if (mlx4_is_slave(dev))
551		return;
552
553	mlx4_CONF_SPECIAL_QP(dev, 0);
554	mlx4_bitmap_cleanup(&mlx4_priv(dev)->qp_table.bitmap);
555}
556
557int mlx4_qp_query(struct mlx4_dev *dev, struct mlx4_qp *qp,
558		  struct mlx4_qp_context *context)
559{
560	struct mlx4_cmd_mailbox *mailbox;
561	int err;
562
563	mailbox = mlx4_alloc_cmd_mailbox(dev);
564	if (IS_ERR(mailbox))
565		return PTR_ERR(mailbox);
566
567	err = mlx4_cmd_box(dev, 0, mailbox->dma, qp->qpn, 0,
568			   MLX4_CMD_QUERY_QP, MLX4_CMD_TIME_CLASS_A,
569			   MLX4_CMD_WRAPPED);
570	if (!err)
571		memcpy(context, mailbox->buf + 8, sizeof *context);
572
573	mlx4_free_cmd_mailbox(dev, mailbox);
574	return err;
575}
576EXPORT_SYMBOL_GPL(mlx4_qp_query);
577
578int mlx4_qp_to_ready(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
579		     struct mlx4_qp_context *context,
580		     struct mlx4_qp *qp, enum mlx4_qp_state *qp_state)
581{
582	int err;
583	int i;
584	enum mlx4_qp_state states[] = {
585		MLX4_QP_STATE_RST,
586		MLX4_QP_STATE_INIT,
587		MLX4_QP_STATE_RTR,
588		MLX4_QP_STATE_RTS
589	};
590
591	for (i = 0; i < ARRAY_SIZE(states) - 1; i++) {
592		context->flags &= cpu_to_be32(~(0xf << 28));
593		context->flags |= cpu_to_be32(states[i + 1] << 28);
594		err = mlx4_qp_modify(dev, mtt, states[i], states[i + 1],
595				     context, 0, 0, qp);
596		if (err) {
597			mlx4_err(dev, "Failed to bring QP to state: "
598				 "%d with error: %d\n",
599				 states[i + 1], err);
600			return err;
601		}
602
603		*qp_state = states[i + 1];
604	}
605
606	return 0;
607}
608EXPORT_SYMBOL_GPL(mlx4_qp_to_ready);
609