qp.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514
  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. static int is_qp0(struct mlx4_dev *dev, struct mlx4_qp *qp)
  60. {
  61. return qp->qpn >= dev->caps.sqp_start &&
  62. qp->qpn <= dev->caps.sqp_start + 1;
  63. }
  64. static int __mlx4_qp_modify(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  65. enum mlx4_qp_state cur_state, enum mlx4_qp_state new_state,
  66. struct mlx4_qp_context *context,
  67. enum mlx4_qp_optpar optpar,
  68. int sqd_event, struct mlx4_qp *qp, int native)
  69. {
  70. static const u16 op[MLX4_QP_NUM_STATE][MLX4_QP_NUM_STATE] = {
  71. [MLX4_QP_STATE_RST] = {
  72. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  73. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  74. [MLX4_QP_STATE_INIT] = MLX4_CMD_RST2INIT_QP,
  75. },
  76. [MLX4_QP_STATE_INIT] = {
  77. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  78. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  79. [MLX4_QP_STATE_INIT] = MLX4_CMD_INIT2INIT_QP,
  80. [MLX4_QP_STATE_RTR] = MLX4_CMD_INIT2RTR_QP,
  81. },
  82. [MLX4_QP_STATE_RTR] = {
  83. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  84. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  85. [MLX4_QP_STATE_RTS] = MLX4_CMD_RTR2RTS_QP,
  86. },
  87. [MLX4_QP_STATE_RTS] = {
  88. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  89. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  90. [MLX4_QP_STATE_RTS] = MLX4_CMD_RTS2RTS_QP,
  91. [MLX4_QP_STATE_SQD] = MLX4_CMD_RTS2SQD_QP,
  92. },
  93. [MLX4_QP_STATE_SQD] = {
  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_SQD2RTS_QP,
  97. [MLX4_QP_STATE_SQD] = MLX4_CMD_SQD2SQD_QP,
  98. },
  99. [MLX4_QP_STATE_SQER] = {
  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_SQERR2RTS_QP,
  103. },
  104. [MLX4_QP_STATE_ERR] = {
  105. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  106. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  107. }
  108. };
  109. struct mlx4_priv *priv = mlx4_priv(dev);
  110. struct mlx4_cmd_mailbox *mailbox;
  111. int ret = 0;
  112. u8 port;
  113. if (cur_state >= MLX4_QP_NUM_STATE || new_state >= MLX4_QP_NUM_STATE ||
  114. !op[cur_state][new_state])
  115. return -EINVAL;
  116. if (op[cur_state][new_state] == MLX4_CMD_2RST_QP) {
  117. ret = mlx4_cmd(dev, 0, qp->qpn, 2,
  118. MLX4_CMD_2RST_QP, MLX4_CMD_TIME_CLASS_A, native);
  119. if (mlx4_is_master(dev) && cur_state != MLX4_QP_STATE_ERR &&
  120. cur_state != MLX4_QP_STATE_RST &&
  121. is_qp0(dev, qp)) {
  122. port = (qp->qpn & 1) + 1;
  123. priv->mfunc.master.qp0_state[port].qp0_active = 0;
  124. }
  125. return ret;
  126. }
  127. mailbox = mlx4_alloc_cmd_mailbox(dev);
  128. if (IS_ERR(mailbox))
  129. return PTR_ERR(mailbox);
  130. if (cur_state == MLX4_QP_STATE_RST && new_state == MLX4_QP_STATE_INIT) {
  131. u64 mtt_addr = mlx4_mtt_addr(dev, mtt);
  132. context->mtt_base_addr_h = mtt_addr >> 32;
  133. context->mtt_base_addr_l = cpu_to_be32(mtt_addr & 0xffffffff);
  134. context->log_page_size = mtt->page_shift - MLX4_ICM_PAGE_SHIFT;
  135. }
  136. port = ((context->pri_path.sched_queue >> 6) & 1) + 1;
  137. if (dev->caps.port_type[port] == MLX4_PORT_TYPE_ETH)
  138. context->pri_path.sched_queue = (context->pri_path.sched_queue &
  139. 0xc3);
  140. *(__be32 *) mailbox->buf = cpu_to_be32(optpar);
  141. memcpy(mailbox->buf + 8, context, sizeof *context);
  142. ((struct mlx4_qp_context *) (mailbox->buf + 8))->local_qpn =
  143. cpu_to_be32(qp->qpn);
  144. ret = mlx4_cmd(dev, mailbox->dma,
  145. qp->qpn | (!!sqd_event << 31),
  146. new_state == MLX4_QP_STATE_RST ? 2 : 0,
  147. op[cur_state][new_state], MLX4_CMD_TIME_CLASS_C, native);
  148. mlx4_free_cmd_mailbox(dev, mailbox);
  149. return ret;
  150. }
  151. int mlx4_qp_modify(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  152. enum mlx4_qp_state cur_state, enum mlx4_qp_state new_state,
  153. struct mlx4_qp_context *context,
  154. enum mlx4_qp_optpar optpar,
  155. int sqd_event, struct mlx4_qp *qp)
  156. {
  157. return __mlx4_qp_modify(dev, mtt, cur_state, new_state, context,
  158. optpar, sqd_event, qp, 0);
  159. }
  160. EXPORT_SYMBOL_GPL(mlx4_qp_modify);
  161. int __mlx4_qp_reserve_range(struct mlx4_dev *dev, int cnt, int align,
  162. int *base)
  163. {
  164. struct mlx4_priv *priv = mlx4_priv(dev);
  165. struct mlx4_qp_table *qp_table = &priv->qp_table;
  166. *base = mlx4_bitmap_alloc_range(&qp_table->bitmap, cnt, align);
  167. if (*base == -1)
  168. return -ENOMEM;
  169. return 0;
  170. }
  171. int mlx4_qp_reserve_range(struct mlx4_dev *dev, int cnt, int align, int *base)
  172. {
  173. u64 in_param;
  174. u64 out_param;
  175. int err;
  176. if (mlx4_is_mfunc(dev)) {
  177. set_param_l(&in_param, cnt);
  178. set_param_h(&in_param, align);
  179. err = mlx4_cmd_imm(dev, in_param, &out_param,
  180. RES_QP, RES_OP_RESERVE,
  181. MLX4_CMD_ALLOC_RES,
  182. MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
  183. if (err)
  184. return err;
  185. *base = get_param_l(&out_param);
  186. return 0;
  187. }
  188. return __mlx4_qp_reserve_range(dev, cnt, align, base);
  189. }
  190. EXPORT_SYMBOL_GPL(mlx4_qp_reserve_range);
  191. void __mlx4_qp_release_range(struct mlx4_dev *dev, int base_qpn, int cnt)
  192. {
  193. struct mlx4_priv *priv = mlx4_priv(dev);
  194. struct mlx4_qp_table *qp_table = &priv->qp_table;
  195. if (mlx4_is_qp_reserved(dev, (u32) base_qpn))
  196. return;
  197. mlx4_bitmap_free_range(&qp_table->bitmap, base_qpn, cnt);
  198. }
  199. void mlx4_qp_release_range(struct mlx4_dev *dev, int base_qpn, int cnt)
  200. {
  201. u64 in_param;
  202. int err;
  203. if (mlx4_is_mfunc(dev)) {
  204. set_param_l(&in_param, base_qpn);
  205. set_param_h(&in_param, cnt);
  206. err = mlx4_cmd(dev, in_param, RES_QP, RES_OP_RESERVE,
  207. MLX4_CMD_FREE_RES,
  208. MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
  209. if (err) {
  210. mlx4_warn(dev, "Failed to release qp range"
  211. " base:%d cnt:%d\n", base_qpn, cnt);
  212. }
  213. } else
  214. __mlx4_qp_release_range(dev, base_qpn, cnt);
  215. }
  216. EXPORT_SYMBOL_GPL(mlx4_qp_release_range);
  217. int __mlx4_qp_alloc_icm(struct mlx4_dev *dev, int qpn)
  218. {
  219. struct mlx4_priv *priv = mlx4_priv(dev);
  220. struct mlx4_qp_table *qp_table = &priv->qp_table;
  221. int err;
  222. err = mlx4_table_get(dev, &qp_table->qp_table, qpn);
  223. if (err)
  224. goto err_out;
  225. err = mlx4_table_get(dev, &qp_table->auxc_table, qpn);
  226. if (err)
  227. goto err_put_qp;
  228. err = mlx4_table_get(dev, &qp_table->altc_table, qpn);
  229. if (err)
  230. goto err_put_auxc;
  231. err = mlx4_table_get(dev, &qp_table->rdmarc_table, qpn);
  232. if (err)
  233. goto err_put_altc;
  234. err = mlx4_table_get(dev, &qp_table->cmpt_table, qpn);
  235. if (err)
  236. goto err_put_rdmarc;
  237. return 0;
  238. err_put_rdmarc:
  239. mlx4_table_put(dev, &qp_table->rdmarc_table, qpn);
  240. err_put_altc:
  241. mlx4_table_put(dev, &qp_table->altc_table, qpn);
  242. err_put_auxc:
  243. mlx4_table_put(dev, &qp_table->auxc_table, qpn);
  244. err_put_qp:
  245. mlx4_table_put(dev, &qp_table->qp_table, qpn);
  246. err_out:
  247. return err;
  248. }
  249. static int mlx4_qp_alloc_icm(struct mlx4_dev *dev, int qpn)
  250. {
  251. u64 param;
  252. if (mlx4_is_mfunc(dev)) {
  253. set_param_l(&param, qpn);
  254. return mlx4_cmd_imm(dev, param, &param, RES_QP, RES_OP_MAP_ICM,
  255. MLX4_CMD_ALLOC_RES, MLX4_CMD_TIME_CLASS_A,
  256. MLX4_CMD_WRAPPED);
  257. }
  258. return __mlx4_qp_alloc_icm(dev, qpn);
  259. }
  260. void __mlx4_qp_free_icm(struct mlx4_dev *dev, int qpn)
  261. {
  262. struct mlx4_priv *priv = mlx4_priv(dev);
  263. struct mlx4_qp_table *qp_table = &priv->qp_table;
  264. mlx4_table_put(dev, &qp_table->cmpt_table, qpn);
  265. mlx4_table_put(dev, &qp_table->rdmarc_table, qpn);
  266. mlx4_table_put(dev, &qp_table->altc_table, qpn);
  267. mlx4_table_put(dev, &qp_table->auxc_table, qpn);
  268. mlx4_table_put(dev, &qp_table->qp_table, qpn);
  269. }
  270. static void mlx4_qp_free_icm(struct mlx4_dev *dev, int qpn)
  271. {
  272. u64 in_param;
  273. if (mlx4_is_mfunc(dev)) {
  274. set_param_l(&in_param, qpn);
  275. if (mlx4_cmd(dev, in_param, RES_QP, RES_OP_MAP_ICM,
  276. MLX4_CMD_FREE_RES, MLX4_CMD_TIME_CLASS_A,
  277. MLX4_CMD_WRAPPED))
  278. mlx4_warn(dev, "Failed to free icm of qp:%d\n", qpn);
  279. } else
  280. __mlx4_qp_free_icm(dev, qpn);
  281. }
  282. int mlx4_qp_alloc(struct mlx4_dev *dev, int qpn, struct mlx4_qp *qp)
  283. {
  284. struct mlx4_priv *priv = mlx4_priv(dev);
  285. struct mlx4_qp_table *qp_table = &priv->qp_table;
  286. int err;
  287. if (!qpn)
  288. return -EINVAL;
  289. qp->qpn = qpn;
  290. err = mlx4_qp_alloc_icm(dev, qpn);
  291. if (err)
  292. return err;
  293. spin_lock_irq(&qp_table->lock);
  294. err = radix_tree_insert(&dev->qp_table_tree, qp->qpn &
  295. (dev->caps.num_qps - 1), qp);
  296. spin_unlock_irq(&qp_table->lock);
  297. if (err)
  298. goto err_icm;
  299. atomic_set(&qp->refcount, 1);
  300. init_completion(&qp->free);
  301. return 0;
  302. err_icm:
  303. mlx4_qp_free_icm(dev, qpn);
  304. return err;
  305. }
  306. EXPORT_SYMBOL_GPL(mlx4_qp_alloc);
  307. void mlx4_qp_remove(struct mlx4_dev *dev, struct mlx4_qp *qp)
  308. {
  309. struct mlx4_qp_table *qp_table = &mlx4_priv(dev)->qp_table;
  310. unsigned long flags;
  311. spin_lock_irqsave(&qp_table->lock, flags);
  312. radix_tree_delete(&dev->qp_table_tree, qp->qpn & (dev->caps.num_qps - 1));
  313. spin_unlock_irqrestore(&qp_table->lock, flags);
  314. }
  315. EXPORT_SYMBOL_GPL(mlx4_qp_remove);
  316. void mlx4_qp_free(struct mlx4_dev *dev, struct mlx4_qp *qp)
  317. {
  318. if (atomic_dec_and_test(&qp->refcount))
  319. complete(&qp->free);
  320. wait_for_completion(&qp->free);
  321. mlx4_qp_free_icm(dev, qp->qpn);
  322. }
  323. EXPORT_SYMBOL_GPL(mlx4_qp_free);
  324. static int mlx4_CONF_SPECIAL_QP(struct mlx4_dev *dev, u32 base_qpn)
  325. {
  326. return mlx4_cmd(dev, 0, base_qpn, 0, MLX4_CMD_CONF_SPECIAL_QP,
  327. MLX4_CMD_TIME_CLASS_B, MLX4_CMD_NATIVE);
  328. }
  329. int mlx4_init_qp_table(struct mlx4_dev *dev)
  330. {
  331. struct mlx4_qp_table *qp_table = &mlx4_priv(dev)->qp_table;
  332. int err;
  333. int reserved_from_top = 0;
  334. spin_lock_init(&qp_table->lock);
  335. INIT_RADIX_TREE(&dev->qp_table_tree, GFP_ATOMIC);
  336. if (mlx4_is_slave(dev))
  337. return 0;
  338. /*
  339. * We reserve 2 extra QPs per port for the special QPs. The
  340. * block of special QPs must be aligned to a multiple of 8, so
  341. * round up.
  342. *
  343. * We also reserve the MSB of the 24-bit QP number to indicate
  344. * that a QP is an XRC QP.
  345. */
  346. dev->caps.sqp_start =
  347. ALIGN(dev->caps.reserved_qps_cnt[MLX4_QP_REGION_FW], 8);
  348. {
  349. int sort[MLX4_NUM_QP_REGION];
  350. int i, j, tmp;
  351. int last_base = dev->caps.num_qps;
  352. for (i = 1; i < MLX4_NUM_QP_REGION; ++i)
  353. sort[i] = i;
  354. for (i = MLX4_NUM_QP_REGION; i > 0; --i) {
  355. for (j = 2; j < i; ++j) {
  356. if (dev->caps.reserved_qps_cnt[sort[j]] >
  357. dev->caps.reserved_qps_cnt[sort[j - 1]]) {
  358. tmp = sort[j];
  359. sort[j] = sort[j - 1];
  360. sort[j - 1] = tmp;
  361. }
  362. }
  363. }
  364. for (i = 1; i < MLX4_NUM_QP_REGION; ++i) {
  365. last_base -= dev->caps.reserved_qps_cnt[sort[i]];
  366. dev->caps.reserved_qps_base[sort[i]] = last_base;
  367. reserved_from_top +=
  368. dev->caps.reserved_qps_cnt[sort[i]];
  369. }
  370. }
  371. err = mlx4_bitmap_init(&qp_table->bitmap, dev->caps.num_qps,
  372. (1 << 23) - 1, dev->caps.sqp_start + 8,
  373. reserved_from_top);
  374. if (err)
  375. return err;
  376. return mlx4_CONF_SPECIAL_QP(dev, dev->caps.sqp_start);
  377. }
  378. void mlx4_cleanup_qp_table(struct mlx4_dev *dev)
  379. {
  380. if (mlx4_is_slave(dev))
  381. return;
  382. mlx4_CONF_SPECIAL_QP(dev, 0);
  383. mlx4_bitmap_cleanup(&mlx4_priv(dev)->qp_table.bitmap);
  384. }
  385. int mlx4_qp_query(struct mlx4_dev *dev, struct mlx4_qp *qp,
  386. struct mlx4_qp_context *context)
  387. {
  388. struct mlx4_cmd_mailbox *mailbox;
  389. int err;
  390. mailbox = mlx4_alloc_cmd_mailbox(dev);
  391. if (IS_ERR(mailbox))
  392. return PTR_ERR(mailbox);
  393. err = mlx4_cmd_box(dev, 0, mailbox->dma, qp->qpn, 0,
  394. MLX4_CMD_QUERY_QP, MLX4_CMD_TIME_CLASS_A,
  395. MLX4_CMD_WRAPPED);
  396. if (!err)
  397. memcpy(context, mailbox->buf + 8, sizeof *context);
  398. mlx4_free_cmd_mailbox(dev, mailbox);
  399. return err;
  400. }
  401. EXPORT_SYMBOL_GPL(mlx4_qp_query);
  402. int mlx4_qp_to_ready(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  403. struct mlx4_qp_context *context,
  404. struct mlx4_qp *qp, enum mlx4_qp_state *qp_state)
  405. {
  406. int err;
  407. int i;
  408. enum mlx4_qp_state states[] = {
  409. MLX4_QP_STATE_RST,
  410. MLX4_QP_STATE_INIT,
  411. MLX4_QP_STATE_RTR,
  412. MLX4_QP_STATE_RTS
  413. };
  414. for (i = 0; i < ARRAY_SIZE(states) - 1; i++) {
  415. context->flags &= cpu_to_be32(~(0xf << 28));
  416. context->flags |= cpu_to_be32(states[i + 1] << 28);
  417. err = mlx4_qp_modify(dev, mtt, states[i], states[i + 1],
  418. context, 0, 0, qp);
  419. if (err) {
  420. mlx4_err(dev, "Failed to bring QP to state: "
  421. "%d with error: %d\n",
  422. states[i + 1], err);
  423. return err;
  424. }
  425. *qp_state = states[i + 1];
  426. }
  427. return 0;
  428. }
  429. EXPORT_SYMBOL_GPL(mlx4_qp_to_ready);