qp.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593
  1. /*
  2. * Copyright (c) 2004 Topspin Communications. All rights reserved.
  3. * Copyright (c) 2005, 2006, 2007 Cisco Systems, Inc. All rights reserved.
  4. * Copyright (c) 2005, 2006, 2007, 2008 Mellanox Technologies. All rights reserved.
  5. * Copyright (c) 2004 Voltaire, Inc. All rights reserved.
  6. *
  7. * This software is available to you under a choice of one of two
  8. * licenses. You may choose to be licensed under the terms of the GNU
  9. * General Public License (GPL) Version 2, available from the file
  10. * COPYING in the main directory of this source tree, or the
  11. * OpenIB.org BSD license below:
  12. *
  13. * Redistribution and use in source and binary forms, with or
  14. * without modification, are permitted provided that the following
  15. * conditions are met:
  16. *
  17. * - Redistributions of source code must retain the above
  18. * copyright notice, this list of conditions and the following
  19. * disclaimer.
  20. *
  21. * - Redistributions in binary form must reproduce the above
  22. * copyright notice, this list of conditions and the following
  23. * disclaimer in the documentation and/or other materials
  24. * provided with the distribution.
  25. *
  26. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  27. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  28. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  29. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  30. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  31. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  32. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  33. * SOFTWARE.
  34. */
  35. #include <linux/gfp.h>
  36. #include <linux/export.h>
  37. #include <linux/init.h>
  38. #include <linux/mlx4/cmd.h>
  39. #include <linux/mlx4/qp.h>
  40. #include "mlx4.h"
  41. #include "icm.h"
  42. void mlx4_qp_event(struct mlx4_dev *dev, u32 qpn, int event_type)
  43. {
  44. struct mlx4_qp_table *qp_table = &mlx4_priv(dev)->qp_table;
  45. struct mlx4_qp *qp;
  46. spin_lock(&qp_table->lock);
  47. qp = __mlx4_qp_lookup(dev, qpn);
  48. if (qp)
  49. atomic_inc(&qp->refcount);
  50. spin_unlock(&qp_table->lock);
  51. if (!qp) {
  52. mlx4_dbg(dev, "Async event for none existent QP %08x\n", qpn);
  53. return;
  54. }
  55. qp->event(qp, event_type);
  56. if (atomic_dec_and_test(&qp->refcount))
  57. complete(&qp->free);
  58. }
  59. /* used for INIT/CLOSE port logic */
  60. static int is_master_qp0(struct mlx4_dev *dev, struct mlx4_qp *qp, int *real_qp0, int *proxy_qp0)
  61. {
  62. /* this procedure is called after we already know we are on the master */
  63. /* qp0 is either the proxy qp0, or the real qp0 */
  64. u32 pf_proxy_offset = dev->phys_caps.base_proxy_sqpn + 8 * mlx4_master_func_num(dev);
  65. *proxy_qp0 = qp->qpn >= pf_proxy_offset && qp->qpn <= pf_proxy_offset + 1;
  66. *real_qp0 = qp->qpn >= dev->phys_caps.base_sqpn &&
  67. qp->qpn <= dev->phys_caps.base_sqpn + 1;
  68. return *real_qp0 || *proxy_qp0;
  69. }
  70. static int __mlx4_qp_modify(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  71. enum mlx4_qp_state cur_state, enum mlx4_qp_state new_state,
  72. struct mlx4_qp_context *context,
  73. enum mlx4_qp_optpar optpar,
  74. int sqd_event, struct mlx4_qp *qp, int native)
  75. {
  76. static const u16 op[MLX4_QP_NUM_STATE][MLX4_QP_NUM_STATE] = {
  77. [MLX4_QP_STATE_RST] = {
  78. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  79. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  80. [MLX4_QP_STATE_INIT] = MLX4_CMD_RST2INIT_QP,
  81. },
  82. [MLX4_QP_STATE_INIT] = {
  83. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  84. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  85. [MLX4_QP_STATE_INIT] = MLX4_CMD_INIT2INIT_QP,
  86. [MLX4_QP_STATE_RTR] = MLX4_CMD_INIT2RTR_QP,
  87. },
  88. [MLX4_QP_STATE_RTR] = {
  89. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  90. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  91. [MLX4_QP_STATE_RTS] = MLX4_CMD_RTR2RTS_QP,
  92. },
  93. [MLX4_QP_STATE_RTS] = {
  94. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  95. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  96. [MLX4_QP_STATE_RTS] = MLX4_CMD_RTS2RTS_QP,
  97. [MLX4_QP_STATE_SQD] = MLX4_CMD_RTS2SQD_QP,
  98. },
  99. [MLX4_QP_STATE_SQD] = {
  100. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  101. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  102. [MLX4_QP_STATE_RTS] = MLX4_CMD_SQD2RTS_QP,
  103. [MLX4_QP_STATE_SQD] = MLX4_CMD_SQD2SQD_QP,
  104. },
  105. [MLX4_QP_STATE_SQER] = {
  106. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  107. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  108. [MLX4_QP_STATE_RTS] = MLX4_CMD_SQERR2RTS_QP,
  109. },
  110. [MLX4_QP_STATE_ERR] = {
  111. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  112. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  113. }
  114. };
  115. struct mlx4_priv *priv = mlx4_priv(dev);
  116. struct mlx4_cmd_mailbox *mailbox;
  117. int ret = 0;
  118. int real_qp0 = 0;
  119. int proxy_qp0 = 0;
  120. u8 port;
  121. if (cur_state >= MLX4_QP_NUM_STATE || new_state >= MLX4_QP_NUM_STATE ||
  122. !op[cur_state][new_state])
  123. return -EINVAL;
  124. if (op[cur_state][new_state] == MLX4_CMD_2RST_QP) {
  125. ret = mlx4_cmd(dev, 0, qp->qpn, 2,
  126. MLX4_CMD_2RST_QP, MLX4_CMD_TIME_CLASS_A, native);
  127. if (mlx4_is_master(dev) && cur_state != MLX4_QP_STATE_ERR &&
  128. cur_state != MLX4_QP_STATE_RST &&
  129. is_master_qp0(dev, qp, &real_qp0, &proxy_qp0)) {
  130. port = (qp->qpn & 1) + 1;
  131. if (proxy_qp0)
  132. priv->mfunc.master.qp0_state[port].proxy_qp0_active = 0;
  133. else
  134. priv->mfunc.master.qp0_state[port].qp0_active = 0;
  135. }
  136. return ret;
  137. }
  138. mailbox = mlx4_alloc_cmd_mailbox(dev);
  139. if (IS_ERR(mailbox))
  140. return PTR_ERR(mailbox);
  141. if (cur_state == MLX4_QP_STATE_RST && new_state == MLX4_QP_STATE_INIT) {
  142. u64 mtt_addr = mlx4_mtt_addr(dev, mtt);
  143. context->mtt_base_addr_h = mtt_addr >> 32;
  144. context->mtt_base_addr_l = cpu_to_be32(mtt_addr & 0xffffffff);
  145. context->log_page_size = mtt->page_shift - MLX4_ICM_PAGE_SHIFT;
  146. }
  147. *(__be32 *) mailbox->buf = cpu_to_be32(optpar);
  148. memcpy(mailbox->buf + 8, context, sizeof *context);
  149. ((struct mlx4_qp_context *) (mailbox->buf + 8))->local_qpn =
  150. cpu_to_be32(qp->qpn);
  151. ret = mlx4_cmd(dev, mailbox->dma,
  152. qp->qpn | (!!sqd_event << 31),
  153. new_state == MLX4_QP_STATE_RST ? 2 : 0,
  154. op[cur_state][new_state], MLX4_CMD_TIME_CLASS_C, native);
  155. if (mlx4_is_master(dev) && is_master_qp0(dev, qp, &real_qp0, &proxy_qp0)) {
  156. port = (qp->qpn & 1) + 1;
  157. if (cur_state != MLX4_QP_STATE_ERR &&
  158. cur_state != MLX4_QP_STATE_RST &&
  159. new_state == MLX4_QP_STATE_ERR) {
  160. if (proxy_qp0)
  161. priv->mfunc.master.qp0_state[port].proxy_qp0_active = 0;
  162. else
  163. priv->mfunc.master.qp0_state[port].qp0_active = 0;
  164. } else if (new_state == MLX4_QP_STATE_RTR) {
  165. if (proxy_qp0)
  166. priv->mfunc.master.qp0_state[port].proxy_qp0_active = 1;
  167. else
  168. priv->mfunc.master.qp0_state[port].qp0_active = 1;
  169. }
  170. }
  171. mlx4_free_cmd_mailbox(dev, mailbox);
  172. return ret;
  173. }
  174. int mlx4_qp_modify(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  175. enum mlx4_qp_state cur_state, enum mlx4_qp_state new_state,
  176. struct mlx4_qp_context *context,
  177. enum mlx4_qp_optpar optpar,
  178. int sqd_event, struct mlx4_qp *qp)
  179. {
  180. return __mlx4_qp_modify(dev, mtt, cur_state, new_state, context,
  181. optpar, sqd_event, qp, 0);
  182. }
  183. EXPORT_SYMBOL_GPL(mlx4_qp_modify);
  184. int __mlx4_qp_reserve_range(struct mlx4_dev *dev, int cnt, int align,
  185. int *base)
  186. {
  187. struct mlx4_priv *priv = mlx4_priv(dev);
  188. struct mlx4_qp_table *qp_table = &priv->qp_table;
  189. *base = mlx4_bitmap_alloc_range(&qp_table->bitmap, cnt, align);
  190. if (*base == -1)
  191. return -ENOMEM;
  192. return 0;
  193. }
  194. int mlx4_qp_reserve_range(struct mlx4_dev *dev, int cnt, int align, int *base)
  195. {
  196. u64 in_param = 0;
  197. u64 out_param;
  198. int err;
  199. if (mlx4_is_mfunc(dev)) {
  200. set_param_l(&in_param, cnt);
  201. set_param_h(&in_param, align);
  202. err = mlx4_cmd_imm(dev, in_param, &out_param,
  203. RES_QP, RES_OP_RESERVE,
  204. MLX4_CMD_ALLOC_RES,
  205. MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
  206. if (err)
  207. return err;
  208. *base = get_param_l(&out_param);
  209. return 0;
  210. }
  211. return __mlx4_qp_reserve_range(dev, cnt, align, base);
  212. }
  213. EXPORT_SYMBOL_GPL(mlx4_qp_reserve_range);
  214. void __mlx4_qp_release_range(struct mlx4_dev *dev, int base_qpn, int cnt)
  215. {
  216. struct mlx4_priv *priv = mlx4_priv(dev);
  217. struct mlx4_qp_table *qp_table = &priv->qp_table;
  218. if (mlx4_is_qp_reserved(dev, (u32) base_qpn))
  219. return;
  220. mlx4_bitmap_free_range(&qp_table->bitmap, base_qpn, cnt);
  221. }
  222. void mlx4_qp_release_range(struct mlx4_dev *dev, int base_qpn, int cnt)
  223. {
  224. u64 in_param = 0;
  225. int err;
  226. if (mlx4_is_mfunc(dev)) {
  227. set_param_l(&in_param, base_qpn);
  228. set_param_h(&in_param, cnt);
  229. err = mlx4_cmd(dev, in_param, RES_QP, RES_OP_RESERVE,
  230. MLX4_CMD_FREE_RES,
  231. MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
  232. if (err) {
  233. mlx4_warn(dev, "Failed to release qp range"
  234. " base:%d cnt:%d\n", base_qpn, cnt);
  235. }
  236. } else
  237. __mlx4_qp_release_range(dev, base_qpn, cnt);
  238. }
  239. EXPORT_SYMBOL_GPL(mlx4_qp_release_range);
  240. int __mlx4_qp_alloc_icm(struct mlx4_dev *dev, int qpn)
  241. {
  242. struct mlx4_priv *priv = mlx4_priv(dev);
  243. struct mlx4_qp_table *qp_table = &priv->qp_table;
  244. int err;
  245. err = mlx4_table_get(dev, &qp_table->qp_table, qpn);
  246. if (err)
  247. goto err_out;
  248. err = mlx4_table_get(dev, &qp_table->auxc_table, qpn);
  249. if (err)
  250. goto err_put_qp;
  251. err = mlx4_table_get(dev, &qp_table->altc_table, qpn);
  252. if (err)
  253. goto err_put_auxc;
  254. err = mlx4_table_get(dev, &qp_table->rdmarc_table, qpn);
  255. if (err)
  256. goto err_put_altc;
  257. err = mlx4_table_get(dev, &qp_table->cmpt_table, qpn);
  258. if (err)
  259. goto err_put_rdmarc;
  260. return 0;
  261. err_put_rdmarc:
  262. mlx4_table_put(dev, &qp_table->rdmarc_table, qpn);
  263. err_put_altc:
  264. mlx4_table_put(dev, &qp_table->altc_table, qpn);
  265. err_put_auxc:
  266. mlx4_table_put(dev, &qp_table->auxc_table, qpn);
  267. err_put_qp:
  268. mlx4_table_put(dev, &qp_table->qp_table, qpn);
  269. err_out:
  270. return err;
  271. }
  272. static int mlx4_qp_alloc_icm(struct mlx4_dev *dev, int qpn)
  273. {
  274. u64 param = 0;
  275. if (mlx4_is_mfunc(dev)) {
  276. set_param_l(&param, qpn);
  277. return mlx4_cmd_imm(dev, param, &param, RES_QP, RES_OP_MAP_ICM,
  278. MLX4_CMD_ALLOC_RES, MLX4_CMD_TIME_CLASS_A,
  279. MLX4_CMD_WRAPPED);
  280. }
  281. return __mlx4_qp_alloc_icm(dev, qpn);
  282. }
  283. void __mlx4_qp_free_icm(struct mlx4_dev *dev, int qpn)
  284. {
  285. struct mlx4_priv *priv = mlx4_priv(dev);
  286. struct mlx4_qp_table *qp_table = &priv->qp_table;
  287. mlx4_table_put(dev, &qp_table->cmpt_table, qpn);
  288. mlx4_table_put(dev, &qp_table->rdmarc_table, qpn);
  289. mlx4_table_put(dev, &qp_table->altc_table, qpn);
  290. mlx4_table_put(dev, &qp_table->auxc_table, qpn);
  291. mlx4_table_put(dev, &qp_table->qp_table, qpn);
  292. }
  293. static void mlx4_qp_free_icm(struct mlx4_dev *dev, int qpn)
  294. {
  295. u64 in_param = 0;
  296. if (mlx4_is_mfunc(dev)) {
  297. set_param_l(&in_param, qpn);
  298. if (mlx4_cmd(dev, in_param, RES_QP, RES_OP_MAP_ICM,
  299. MLX4_CMD_FREE_RES, MLX4_CMD_TIME_CLASS_A,
  300. MLX4_CMD_WRAPPED))
  301. mlx4_warn(dev, "Failed to free icm of qp:%d\n", qpn);
  302. } else
  303. __mlx4_qp_free_icm(dev, qpn);
  304. }
  305. int mlx4_qp_alloc(struct mlx4_dev *dev, int qpn, struct mlx4_qp *qp)
  306. {
  307. struct mlx4_priv *priv = mlx4_priv(dev);
  308. struct mlx4_qp_table *qp_table = &priv->qp_table;
  309. int err;
  310. if (!qpn)
  311. return -EINVAL;
  312. qp->qpn = qpn;
  313. err = mlx4_qp_alloc_icm(dev, qpn);
  314. if (err)
  315. return err;
  316. spin_lock_irq(&qp_table->lock);
  317. err = radix_tree_insert(&dev->qp_table_tree, qp->qpn &
  318. (dev->caps.num_qps - 1), qp);
  319. spin_unlock_irq(&qp_table->lock);
  320. if (err)
  321. goto err_icm;
  322. atomic_set(&qp->refcount, 1);
  323. init_completion(&qp->free);
  324. return 0;
  325. err_icm:
  326. mlx4_qp_free_icm(dev, qpn);
  327. return err;
  328. }
  329. EXPORT_SYMBOL_GPL(mlx4_qp_alloc);
  330. void mlx4_qp_remove(struct mlx4_dev *dev, struct mlx4_qp *qp)
  331. {
  332. struct mlx4_qp_table *qp_table = &mlx4_priv(dev)->qp_table;
  333. unsigned long flags;
  334. spin_lock_irqsave(&qp_table->lock, flags);
  335. radix_tree_delete(&dev->qp_table_tree, qp->qpn & (dev->caps.num_qps - 1));
  336. spin_unlock_irqrestore(&qp_table->lock, flags);
  337. }
  338. EXPORT_SYMBOL_GPL(mlx4_qp_remove);
  339. void mlx4_qp_free(struct mlx4_dev *dev, struct mlx4_qp *qp)
  340. {
  341. if (atomic_dec_and_test(&qp->refcount))
  342. complete(&qp->free);
  343. wait_for_completion(&qp->free);
  344. mlx4_qp_free_icm(dev, qp->qpn);
  345. }
  346. EXPORT_SYMBOL_GPL(mlx4_qp_free);
  347. static int mlx4_CONF_SPECIAL_QP(struct mlx4_dev *dev, u32 base_qpn)
  348. {
  349. return mlx4_cmd(dev, 0, base_qpn, 0, MLX4_CMD_CONF_SPECIAL_QP,
  350. MLX4_CMD_TIME_CLASS_B, MLX4_CMD_NATIVE);
  351. }
  352. int mlx4_init_qp_table(struct mlx4_dev *dev)
  353. {
  354. struct mlx4_qp_table *qp_table = &mlx4_priv(dev)->qp_table;
  355. int err;
  356. int reserved_from_top = 0;
  357. int k;
  358. spin_lock_init(&qp_table->lock);
  359. INIT_RADIX_TREE(&dev->qp_table_tree, GFP_ATOMIC);
  360. if (mlx4_is_slave(dev))
  361. return 0;
  362. /*
  363. * We reserve 2 extra QPs per port for the special QPs. The
  364. * block of special QPs must be aligned to a multiple of 8, so
  365. * round up.
  366. *
  367. * We also reserve the MSB of the 24-bit QP number to indicate
  368. * that a QP is an XRC QP.
  369. */
  370. dev->phys_caps.base_sqpn =
  371. ALIGN(dev->caps.reserved_qps_cnt[MLX4_QP_REGION_FW], 8);
  372. {
  373. int sort[MLX4_NUM_QP_REGION];
  374. int i, j, tmp;
  375. int last_base = dev->caps.num_qps;
  376. for (i = 1; i < MLX4_NUM_QP_REGION; ++i)
  377. sort[i] = i;
  378. for (i = MLX4_NUM_QP_REGION; i > 0; --i) {
  379. for (j = 2; j < i; ++j) {
  380. if (dev->caps.reserved_qps_cnt[sort[j]] >
  381. dev->caps.reserved_qps_cnt[sort[j - 1]]) {
  382. tmp = sort[j];
  383. sort[j] = sort[j - 1];
  384. sort[j - 1] = tmp;
  385. }
  386. }
  387. }
  388. for (i = 1; i < MLX4_NUM_QP_REGION; ++i) {
  389. last_base -= dev->caps.reserved_qps_cnt[sort[i]];
  390. dev->caps.reserved_qps_base[sort[i]] = last_base;
  391. reserved_from_top +=
  392. dev->caps.reserved_qps_cnt[sort[i]];
  393. }
  394. }
  395. /* Reserve 8 real SQPs in both native and SRIOV modes.
  396. * In addition, in SRIOV mode, reserve 8 proxy SQPs per function
  397. * (for all PFs and VFs), and 8 corresponding tunnel QPs.
  398. * Each proxy SQP works opposite its own tunnel QP.
  399. *
  400. * The QPs are arranged as follows:
  401. * a. 8 real SQPs
  402. * b. All the proxy SQPs (8 per function)
  403. * c. All the tunnel QPs (8 per function)
  404. */
  405. err = mlx4_bitmap_init(&qp_table->bitmap, dev->caps.num_qps,
  406. (1 << 23) - 1, dev->phys_caps.base_sqpn + 8 +
  407. 16 * MLX4_MFUNC_MAX * !!mlx4_is_master(dev),
  408. reserved_from_top);
  409. if (err)
  410. return err;
  411. if (mlx4_is_mfunc(dev)) {
  412. /* for PPF use */
  413. dev->phys_caps.base_proxy_sqpn = dev->phys_caps.base_sqpn + 8;
  414. dev->phys_caps.base_tunnel_sqpn = dev->phys_caps.base_sqpn + 8 + 8 * MLX4_MFUNC_MAX;
  415. /* In mfunc, calculate proxy and tunnel qp offsets for the PF here,
  416. * since the PF does not call mlx4_slave_caps */
  417. dev->caps.qp0_tunnel = kcalloc(dev->caps.num_ports, sizeof (u32), GFP_KERNEL);
  418. dev->caps.qp0_proxy = kcalloc(dev->caps.num_ports, sizeof (u32), GFP_KERNEL);
  419. dev->caps.qp1_tunnel = kcalloc(dev->caps.num_ports, sizeof (u32), GFP_KERNEL);
  420. dev->caps.qp1_proxy = kcalloc(dev->caps.num_ports, sizeof (u32), GFP_KERNEL);
  421. if (!dev->caps.qp0_tunnel || !dev->caps.qp0_proxy ||
  422. !dev->caps.qp1_tunnel || !dev->caps.qp1_proxy) {
  423. err = -ENOMEM;
  424. goto err_mem;
  425. }
  426. for (k = 0; k < dev->caps.num_ports; k++) {
  427. dev->caps.qp0_proxy[k] = dev->phys_caps.base_proxy_sqpn +
  428. 8 * mlx4_master_func_num(dev) + k;
  429. dev->caps.qp0_tunnel[k] = dev->caps.qp0_proxy[k] + 8 * MLX4_MFUNC_MAX;
  430. dev->caps.qp1_proxy[k] = dev->phys_caps.base_proxy_sqpn +
  431. 8 * mlx4_master_func_num(dev) + MLX4_MAX_PORTS + k;
  432. dev->caps.qp1_tunnel[k] = dev->caps.qp1_proxy[k] + 8 * MLX4_MFUNC_MAX;
  433. }
  434. }
  435. err = mlx4_CONF_SPECIAL_QP(dev, dev->phys_caps.base_sqpn);
  436. if (err)
  437. goto err_mem;
  438. return 0;
  439. err_mem:
  440. kfree(dev->caps.qp0_tunnel);
  441. kfree(dev->caps.qp0_proxy);
  442. kfree(dev->caps.qp1_tunnel);
  443. kfree(dev->caps.qp1_proxy);
  444. dev->caps.qp0_tunnel = dev->caps.qp0_proxy =
  445. dev->caps.qp1_tunnel = dev->caps.qp1_proxy = NULL;
  446. return err;
  447. }
  448. void mlx4_cleanup_qp_table(struct mlx4_dev *dev)
  449. {
  450. if (mlx4_is_slave(dev))
  451. return;
  452. mlx4_CONF_SPECIAL_QP(dev, 0);
  453. mlx4_bitmap_cleanup(&mlx4_priv(dev)->qp_table.bitmap);
  454. }
  455. int mlx4_qp_query(struct mlx4_dev *dev, struct mlx4_qp *qp,
  456. struct mlx4_qp_context *context)
  457. {
  458. struct mlx4_cmd_mailbox *mailbox;
  459. int err;
  460. mailbox = mlx4_alloc_cmd_mailbox(dev);
  461. if (IS_ERR(mailbox))
  462. return PTR_ERR(mailbox);
  463. err = mlx4_cmd_box(dev, 0, mailbox->dma, qp->qpn, 0,
  464. MLX4_CMD_QUERY_QP, MLX4_CMD_TIME_CLASS_A,
  465. MLX4_CMD_WRAPPED);
  466. if (!err)
  467. memcpy(context, mailbox->buf + 8, sizeof *context);
  468. mlx4_free_cmd_mailbox(dev, mailbox);
  469. return err;
  470. }
  471. EXPORT_SYMBOL_GPL(mlx4_qp_query);
  472. int mlx4_qp_to_ready(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  473. struct mlx4_qp_context *context,
  474. struct mlx4_qp *qp, enum mlx4_qp_state *qp_state)
  475. {
  476. int err;
  477. int i;
  478. enum mlx4_qp_state states[] = {
  479. MLX4_QP_STATE_RST,
  480. MLX4_QP_STATE_INIT,
  481. MLX4_QP_STATE_RTR,
  482. MLX4_QP_STATE_RTS
  483. };
  484. for (i = 0; i < ARRAY_SIZE(states) - 1; i++) {
  485. context->flags &= cpu_to_be32(~(0xf << 28));
  486. context->flags |= cpu_to_be32(states[i + 1] << 28);
  487. err = mlx4_qp_modify(dev, mtt, states[i], states[i + 1],
  488. context, 0, 0, qp);
  489. if (err) {
  490. mlx4_err(dev, "Failed to bring QP to state: "
  491. "%d with error: %d\n",
  492. states[i + 1], err);
  493. return err;
  494. }
  495. *qp_state = states[i + 1];
  496. }
  497. return 0;
  498. }
  499. EXPORT_SYMBOL_GPL(mlx4_qp_to_ready);