qp.c 18 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633
  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/mlx4/cmd.h>
  38. #include <linux/mlx4/qp.h>
  39. #include "mlx4.h"
  40. #include "icm.h"
  41. void mlx4_qp_event(struct mlx4_dev *dev, u32 qpn, int event_type)
  42. {
  43. struct mlx4_qp_table *qp_table = &mlx4_priv(dev)->qp_table;
  44. struct mlx4_qp *qp;
  45. spin_lock(&qp_table->lock);
  46. qp = __mlx4_qp_lookup(dev, qpn);
  47. if (qp)
  48. atomic_inc(&qp->refcount);
  49. spin_unlock(&qp_table->lock);
  50. if (!qp) {
  51. mlx4_dbg(dev, "Async event for none existent QP %08x\n", qpn);
  52. return;
  53. }
  54. qp->event(qp, event_type);
  55. if (atomic_dec_and_test(&qp->refcount))
  56. complete(&qp->free);
  57. }
  58. /* used for INIT/CLOSE port logic */
  59. static int is_master_qp0(struct mlx4_dev *dev, struct mlx4_qp *qp, int *real_qp0, int *proxy_qp0)
  60. {
  61. /* this procedure is called after we already know we are on the master */
  62. /* qp0 is either the proxy qp0, or the real qp0 */
  63. u32 pf_proxy_offset = dev->phys_caps.base_proxy_sqpn + 8 * mlx4_master_func_num(dev);
  64. *proxy_qp0 = qp->qpn >= pf_proxy_offset && qp->qpn <= pf_proxy_offset + 1;
  65. *real_qp0 = qp->qpn >= dev->phys_caps.base_sqpn &&
  66. qp->qpn <= dev->phys_caps.base_sqpn + 1;
  67. return *real_qp0 || *proxy_qp0;
  68. }
  69. static int __mlx4_qp_modify(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  70. enum mlx4_qp_state cur_state, enum mlx4_qp_state new_state,
  71. struct mlx4_qp_context *context,
  72. enum mlx4_qp_optpar optpar,
  73. int sqd_event, struct mlx4_qp *qp, int native)
  74. {
  75. static const u16 op[MLX4_QP_NUM_STATE][MLX4_QP_NUM_STATE] = {
  76. [MLX4_QP_STATE_RST] = {
  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_RST2INIT_QP,
  80. },
  81. [MLX4_QP_STATE_INIT] = {
  82. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  83. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  84. [MLX4_QP_STATE_INIT] = MLX4_CMD_INIT2INIT_QP,
  85. [MLX4_QP_STATE_RTR] = MLX4_CMD_INIT2RTR_QP,
  86. },
  87. [MLX4_QP_STATE_RTR] = {
  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_RTR2RTS_QP,
  91. },
  92. [MLX4_QP_STATE_RTS] = {
  93. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  94. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  95. [MLX4_QP_STATE_RTS] = MLX4_CMD_RTS2RTS_QP,
  96. [MLX4_QP_STATE_SQD] = MLX4_CMD_RTS2SQD_QP,
  97. },
  98. [MLX4_QP_STATE_SQD] = {
  99. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  100. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  101. [MLX4_QP_STATE_RTS] = MLX4_CMD_SQD2RTS_QP,
  102. [MLX4_QP_STATE_SQD] = MLX4_CMD_SQD2SQD_QP,
  103. },
  104. [MLX4_QP_STATE_SQER] = {
  105. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  106. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  107. [MLX4_QP_STATE_RTS] = MLX4_CMD_SQERR2RTS_QP,
  108. },
  109. [MLX4_QP_STATE_ERR] = {
  110. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  111. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  112. }
  113. };
  114. struct mlx4_priv *priv = mlx4_priv(dev);
  115. struct mlx4_cmd_mailbox *mailbox;
  116. int ret = 0;
  117. int real_qp0 = 0;
  118. int proxy_qp0 = 0;
  119. u8 port;
  120. if (cur_state >= MLX4_QP_NUM_STATE || new_state >= MLX4_QP_NUM_STATE ||
  121. !op[cur_state][new_state])
  122. return -EINVAL;
  123. if (op[cur_state][new_state] == MLX4_CMD_2RST_QP) {
  124. ret = mlx4_cmd(dev, 0, qp->qpn, 2,
  125. MLX4_CMD_2RST_QP, MLX4_CMD_TIME_CLASS_A, native);
  126. if (mlx4_is_master(dev) && cur_state != MLX4_QP_STATE_ERR &&
  127. cur_state != MLX4_QP_STATE_RST &&
  128. is_master_qp0(dev, qp, &real_qp0, &proxy_qp0)) {
  129. port = (qp->qpn & 1) + 1;
  130. if (proxy_qp0)
  131. priv->mfunc.master.qp0_state[port].proxy_qp0_active = 0;
  132. else
  133. priv->mfunc.master.qp0_state[port].qp0_active = 0;
  134. }
  135. return ret;
  136. }
  137. mailbox = mlx4_alloc_cmd_mailbox(dev);
  138. if (IS_ERR(mailbox))
  139. return PTR_ERR(mailbox);
  140. if (cur_state == MLX4_QP_STATE_RST && new_state == MLX4_QP_STATE_INIT) {
  141. u64 mtt_addr = mlx4_mtt_addr(dev, mtt);
  142. context->mtt_base_addr_h = mtt_addr >> 32;
  143. context->mtt_base_addr_l = cpu_to_be32(mtt_addr & 0xffffffff);
  144. context->log_page_size = mtt->page_shift - MLX4_ICM_PAGE_SHIFT;
  145. }
  146. *(__be32 *) mailbox->buf = cpu_to_be32(optpar);
  147. memcpy(mailbox->buf + 8, context, sizeof *context);
  148. ((struct mlx4_qp_context *) (mailbox->buf + 8))->local_qpn =
  149. cpu_to_be32(qp->qpn);
  150. ret = mlx4_cmd(dev, mailbox->dma,
  151. qp->qpn | (!!sqd_event << 31),
  152. new_state == MLX4_QP_STATE_RST ? 2 : 0,
  153. op[cur_state][new_state], MLX4_CMD_TIME_CLASS_C, native);
  154. if (mlx4_is_master(dev) && is_master_qp0(dev, qp, &real_qp0, &proxy_qp0)) {
  155. port = (qp->qpn & 1) + 1;
  156. if (cur_state != MLX4_QP_STATE_ERR &&
  157. cur_state != MLX4_QP_STATE_RST &&
  158. new_state == MLX4_QP_STATE_ERR) {
  159. if (proxy_qp0)
  160. priv->mfunc.master.qp0_state[port].proxy_qp0_active = 0;
  161. else
  162. priv->mfunc.master.qp0_state[port].qp0_active = 0;
  163. } else if (new_state == MLX4_QP_STATE_RTR) {
  164. if (proxy_qp0)
  165. priv->mfunc.master.qp0_state[port].proxy_qp0_active = 1;
  166. else
  167. priv->mfunc.master.qp0_state[port].qp0_active = 1;
  168. }
  169. }
  170. mlx4_free_cmd_mailbox(dev, mailbox);
  171. return ret;
  172. }
  173. int mlx4_qp_modify(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  174. enum mlx4_qp_state cur_state, enum mlx4_qp_state new_state,
  175. struct mlx4_qp_context *context,
  176. enum mlx4_qp_optpar optpar,
  177. int sqd_event, struct mlx4_qp *qp)
  178. {
  179. return __mlx4_qp_modify(dev, mtt, cur_state, new_state, context,
  180. optpar, sqd_event, qp, 0);
  181. }
  182. EXPORT_SYMBOL_GPL(mlx4_qp_modify);
  183. int __mlx4_qp_reserve_range(struct mlx4_dev *dev, int cnt, int align,
  184. int *base)
  185. {
  186. struct mlx4_priv *priv = mlx4_priv(dev);
  187. struct mlx4_qp_table *qp_table = &priv->qp_table;
  188. *base = mlx4_bitmap_alloc_range(&qp_table->bitmap, cnt, align);
  189. if (*base == -1)
  190. return -ENOMEM;
  191. return 0;
  192. }
  193. int mlx4_qp_reserve_range(struct mlx4_dev *dev, int cnt, int align, int *base)
  194. {
  195. u64 in_param = 0;
  196. u64 out_param;
  197. int err;
  198. if (mlx4_is_mfunc(dev)) {
  199. set_param_l(&in_param, cnt);
  200. set_param_h(&in_param, align);
  201. err = mlx4_cmd_imm(dev, in_param, &out_param,
  202. RES_QP, RES_OP_RESERVE,
  203. MLX4_CMD_ALLOC_RES,
  204. MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
  205. if (err)
  206. return err;
  207. *base = get_param_l(&out_param);
  208. return 0;
  209. }
  210. return __mlx4_qp_reserve_range(dev, cnt, align, base);
  211. }
  212. EXPORT_SYMBOL_GPL(mlx4_qp_reserve_range);
  213. void __mlx4_qp_release_range(struct mlx4_dev *dev, int base_qpn, int cnt)
  214. {
  215. struct mlx4_priv *priv = mlx4_priv(dev);
  216. struct mlx4_qp_table *qp_table = &priv->qp_table;
  217. if (mlx4_is_qp_reserved(dev, (u32) base_qpn))
  218. return;
  219. mlx4_bitmap_free_range(&qp_table->bitmap, base_qpn, cnt, MLX4_USE_RR);
  220. }
  221. void mlx4_qp_release_range(struct mlx4_dev *dev, int base_qpn, int cnt)
  222. {
  223. u64 in_param = 0;
  224. int err;
  225. if (mlx4_is_mfunc(dev)) {
  226. set_param_l(&in_param, base_qpn);
  227. set_param_h(&in_param, cnt);
  228. err = mlx4_cmd(dev, in_param, RES_QP, RES_OP_RESERVE,
  229. MLX4_CMD_FREE_RES,
  230. MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
  231. if (err) {
  232. mlx4_warn(dev, "Failed to release qp range base:%d cnt:%d\n",
  233. base_qpn, cnt);
  234. }
  235. } else
  236. __mlx4_qp_release_range(dev, base_qpn, cnt);
  237. }
  238. EXPORT_SYMBOL_GPL(mlx4_qp_release_range);
  239. int __mlx4_qp_alloc_icm(struct mlx4_dev *dev, int qpn, gfp_t gfp)
  240. {
  241. struct mlx4_priv *priv = mlx4_priv(dev);
  242. struct mlx4_qp_table *qp_table = &priv->qp_table;
  243. int err;
  244. err = mlx4_table_get(dev, &qp_table->qp_table, qpn, gfp);
  245. if (err)
  246. goto err_out;
  247. err = mlx4_table_get(dev, &qp_table->auxc_table, qpn, gfp);
  248. if (err)
  249. goto err_put_qp;
  250. err = mlx4_table_get(dev, &qp_table->altc_table, qpn, gfp);
  251. if (err)
  252. goto err_put_auxc;
  253. err = mlx4_table_get(dev, &qp_table->rdmarc_table, qpn, gfp);
  254. if (err)
  255. goto err_put_altc;
  256. err = mlx4_table_get(dev, &qp_table->cmpt_table, qpn, gfp);
  257. if (err)
  258. goto err_put_rdmarc;
  259. return 0;
  260. err_put_rdmarc:
  261. mlx4_table_put(dev, &qp_table->rdmarc_table, qpn);
  262. err_put_altc:
  263. mlx4_table_put(dev, &qp_table->altc_table, qpn);
  264. err_put_auxc:
  265. mlx4_table_put(dev, &qp_table->auxc_table, qpn);
  266. err_put_qp:
  267. mlx4_table_put(dev, &qp_table->qp_table, qpn);
  268. err_out:
  269. return err;
  270. }
  271. static int mlx4_qp_alloc_icm(struct mlx4_dev *dev, int qpn, gfp_t gfp)
  272. {
  273. u64 param = 0;
  274. if (mlx4_is_mfunc(dev)) {
  275. set_param_l(&param, qpn);
  276. return mlx4_cmd_imm(dev, param, &param, RES_QP, RES_OP_MAP_ICM,
  277. MLX4_CMD_ALLOC_RES, MLX4_CMD_TIME_CLASS_A,
  278. MLX4_CMD_WRAPPED);
  279. }
  280. return __mlx4_qp_alloc_icm(dev, qpn, gfp);
  281. }
  282. void __mlx4_qp_free_icm(struct mlx4_dev *dev, int qpn)
  283. {
  284. struct mlx4_priv *priv = mlx4_priv(dev);
  285. struct mlx4_qp_table *qp_table = &priv->qp_table;
  286. mlx4_table_put(dev, &qp_table->cmpt_table, qpn);
  287. mlx4_table_put(dev, &qp_table->rdmarc_table, qpn);
  288. mlx4_table_put(dev, &qp_table->altc_table, qpn);
  289. mlx4_table_put(dev, &qp_table->auxc_table, qpn);
  290. mlx4_table_put(dev, &qp_table->qp_table, qpn);
  291. }
  292. static void mlx4_qp_free_icm(struct mlx4_dev *dev, int qpn)
  293. {
  294. u64 in_param = 0;
  295. if (mlx4_is_mfunc(dev)) {
  296. set_param_l(&in_param, qpn);
  297. if (mlx4_cmd(dev, in_param, RES_QP, RES_OP_MAP_ICM,
  298. MLX4_CMD_FREE_RES, MLX4_CMD_TIME_CLASS_A,
  299. MLX4_CMD_WRAPPED))
  300. mlx4_warn(dev, "Failed to free icm of qp:%d\n", qpn);
  301. } else
  302. __mlx4_qp_free_icm(dev, qpn);
  303. }
  304. int mlx4_qp_alloc(struct mlx4_dev *dev, int qpn, struct mlx4_qp *qp, gfp_t gfp)
  305. {
  306. struct mlx4_priv *priv = mlx4_priv(dev);
  307. struct mlx4_qp_table *qp_table = &priv->qp_table;
  308. int err;
  309. if (!qpn)
  310. return -EINVAL;
  311. qp->qpn = qpn;
  312. err = mlx4_qp_alloc_icm(dev, qpn, gfp);
  313. if (err)
  314. return err;
  315. spin_lock_irq(&qp_table->lock);
  316. err = radix_tree_insert(&dev->qp_table_tree, qp->qpn &
  317. (dev->caps.num_qps - 1), qp);
  318. spin_unlock_irq(&qp_table->lock);
  319. if (err)
  320. goto err_icm;
  321. atomic_set(&qp->refcount, 1);
  322. init_completion(&qp->free);
  323. return 0;
  324. err_icm:
  325. mlx4_qp_free_icm(dev, qpn);
  326. return err;
  327. }
  328. EXPORT_SYMBOL_GPL(mlx4_qp_alloc);
  329. #define MLX4_UPDATE_QP_SUPPORTED_ATTRS MLX4_UPDATE_QP_SMAC
  330. int mlx4_update_qp(struct mlx4_dev *dev, u32 qpn,
  331. enum mlx4_update_qp_attr attr,
  332. struct mlx4_update_qp_params *params)
  333. {
  334. struct mlx4_cmd_mailbox *mailbox;
  335. struct mlx4_update_qp_context *cmd;
  336. u64 pri_addr_path_mask = 0;
  337. u64 qp_mask = 0;
  338. int err = 0;
  339. mailbox = mlx4_alloc_cmd_mailbox(dev);
  340. if (IS_ERR(mailbox))
  341. return PTR_ERR(mailbox);
  342. cmd = (struct mlx4_update_qp_context *)mailbox->buf;
  343. if (!attr || (attr & ~MLX4_UPDATE_QP_SUPPORTED_ATTRS))
  344. return -EINVAL;
  345. if (attr & MLX4_UPDATE_QP_SMAC) {
  346. pri_addr_path_mask |= 1ULL << MLX4_UPD_QP_PATH_MASK_MAC_INDEX;
  347. cmd->qp_context.pri_path.grh_mylmc = params->smac_index;
  348. }
  349. if (attr & MLX4_UPDATE_QP_VSD) {
  350. qp_mask |= 1ULL << MLX4_UPD_QP_MASK_VSD;
  351. if (params->flags & MLX4_UPDATE_QP_PARAMS_FLAGS_VSD_ENABLE)
  352. cmd->qp_context.param3 |= cpu_to_be32(MLX4_STRIP_VLAN);
  353. }
  354. cmd->primary_addr_path_mask = cpu_to_be64(pri_addr_path_mask);
  355. cmd->qp_mask = cpu_to_be64(qp_mask);
  356. err = mlx4_cmd(dev, mailbox->dma, qpn & 0xffffff, 0,
  357. MLX4_CMD_UPDATE_QP, MLX4_CMD_TIME_CLASS_A,
  358. MLX4_CMD_NATIVE);
  359. mlx4_free_cmd_mailbox(dev, mailbox);
  360. return err;
  361. }
  362. EXPORT_SYMBOL_GPL(mlx4_update_qp);
  363. void mlx4_qp_remove(struct mlx4_dev *dev, struct mlx4_qp *qp)
  364. {
  365. struct mlx4_qp_table *qp_table = &mlx4_priv(dev)->qp_table;
  366. unsigned long flags;
  367. spin_lock_irqsave(&qp_table->lock, flags);
  368. radix_tree_delete(&dev->qp_table_tree, qp->qpn & (dev->caps.num_qps - 1));
  369. spin_unlock_irqrestore(&qp_table->lock, flags);
  370. }
  371. EXPORT_SYMBOL_GPL(mlx4_qp_remove);
  372. void mlx4_qp_free(struct mlx4_dev *dev, struct mlx4_qp *qp)
  373. {
  374. if (atomic_dec_and_test(&qp->refcount))
  375. complete(&qp->free);
  376. wait_for_completion(&qp->free);
  377. mlx4_qp_free_icm(dev, qp->qpn);
  378. }
  379. EXPORT_SYMBOL_GPL(mlx4_qp_free);
  380. static int mlx4_CONF_SPECIAL_QP(struct mlx4_dev *dev, u32 base_qpn)
  381. {
  382. return mlx4_cmd(dev, 0, base_qpn, 0, MLX4_CMD_CONF_SPECIAL_QP,
  383. MLX4_CMD_TIME_CLASS_B, MLX4_CMD_NATIVE);
  384. }
  385. int mlx4_init_qp_table(struct mlx4_dev *dev)
  386. {
  387. struct mlx4_qp_table *qp_table = &mlx4_priv(dev)->qp_table;
  388. int err;
  389. int reserved_from_top = 0;
  390. int k;
  391. spin_lock_init(&qp_table->lock);
  392. INIT_RADIX_TREE(&dev->qp_table_tree, GFP_ATOMIC);
  393. if (mlx4_is_slave(dev))
  394. return 0;
  395. /*
  396. * We reserve 2 extra QPs per port for the special QPs. The
  397. * block of special QPs must be aligned to a multiple of 8, so
  398. * round up.
  399. *
  400. * We also reserve the MSB of the 24-bit QP number to indicate
  401. * that a QP is an XRC QP.
  402. */
  403. dev->phys_caps.base_sqpn =
  404. ALIGN(dev->caps.reserved_qps_cnt[MLX4_QP_REGION_FW], 8);
  405. {
  406. int sort[MLX4_NUM_QP_REGION];
  407. int i, j, tmp;
  408. int last_base = dev->caps.num_qps;
  409. for (i = 1; i < MLX4_NUM_QP_REGION; ++i)
  410. sort[i] = i;
  411. for (i = MLX4_NUM_QP_REGION; i > 0; --i) {
  412. for (j = 2; j < i; ++j) {
  413. if (dev->caps.reserved_qps_cnt[sort[j]] >
  414. dev->caps.reserved_qps_cnt[sort[j - 1]]) {
  415. tmp = sort[j];
  416. sort[j] = sort[j - 1];
  417. sort[j - 1] = tmp;
  418. }
  419. }
  420. }
  421. for (i = 1; i < MLX4_NUM_QP_REGION; ++i) {
  422. last_base -= dev->caps.reserved_qps_cnt[sort[i]];
  423. dev->caps.reserved_qps_base[sort[i]] = last_base;
  424. reserved_from_top +=
  425. dev->caps.reserved_qps_cnt[sort[i]];
  426. }
  427. }
  428. /* Reserve 8 real SQPs in both native and SRIOV modes.
  429. * In addition, in SRIOV mode, reserve 8 proxy SQPs per function
  430. * (for all PFs and VFs), and 8 corresponding tunnel QPs.
  431. * Each proxy SQP works opposite its own tunnel QP.
  432. *
  433. * The QPs are arranged as follows:
  434. * a. 8 real SQPs
  435. * b. All the proxy SQPs (8 per function)
  436. * c. All the tunnel QPs (8 per function)
  437. */
  438. err = mlx4_bitmap_init(&qp_table->bitmap, dev->caps.num_qps,
  439. (1 << 23) - 1, mlx4_num_reserved_sqps(dev),
  440. reserved_from_top);
  441. if (err)
  442. return err;
  443. if (mlx4_is_mfunc(dev)) {
  444. /* for PPF use */
  445. dev->phys_caps.base_proxy_sqpn = dev->phys_caps.base_sqpn + 8;
  446. dev->phys_caps.base_tunnel_sqpn = dev->phys_caps.base_sqpn + 8 + 8 * MLX4_MFUNC_MAX;
  447. /* In mfunc, calculate proxy and tunnel qp offsets for the PF here,
  448. * since the PF does not call mlx4_slave_caps */
  449. dev->caps.qp0_tunnel = kcalloc(dev->caps.num_ports, sizeof (u32), GFP_KERNEL);
  450. dev->caps.qp0_proxy = kcalloc(dev->caps.num_ports, sizeof (u32), GFP_KERNEL);
  451. dev->caps.qp1_tunnel = kcalloc(dev->caps.num_ports, sizeof (u32), GFP_KERNEL);
  452. dev->caps.qp1_proxy = kcalloc(dev->caps.num_ports, sizeof (u32), GFP_KERNEL);
  453. if (!dev->caps.qp0_tunnel || !dev->caps.qp0_proxy ||
  454. !dev->caps.qp1_tunnel || !dev->caps.qp1_proxy) {
  455. err = -ENOMEM;
  456. goto err_mem;
  457. }
  458. for (k = 0; k < dev->caps.num_ports; k++) {
  459. dev->caps.qp0_proxy[k] = dev->phys_caps.base_proxy_sqpn +
  460. 8 * mlx4_master_func_num(dev) + k;
  461. dev->caps.qp0_tunnel[k] = dev->caps.qp0_proxy[k] + 8 * MLX4_MFUNC_MAX;
  462. dev->caps.qp1_proxy[k] = dev->phys_caps.base_proxy_sqpn +
  463. 8 * mlx4_master_func_num(dev) + MLX4_MAX_PORTS + k;
  464. dev->caps.qp1_tunnel[k] = dev->caps.qp1_proxy[k] + 8 * MLX4_MFUNC_MAX;
  465. }
  466. }
  467. err = mlx4_CONF_SPECIAL_QP(dev, dev->phys_caps.base_sqpn);
  468. if (err)
  469. goto err_mem;
  470. return 0;
  471. err_mem:
  472. kfree(dev->caps.qp0_tunnel);
  473. kfree(dev->caps.qp0_proxy);
  474. kfree(dev->caps.qp1_tunnel);
  475. kfree(dev->caps.qp1_proxy);
  476. dev->caps.qp0_tunnel = dev->caps.qp0_proxy =
  477. dev->caps.qp1_tunnel = dev->caps.qp1_proxy = NULL;
  478. return err;
  479. }
  480. void mlx4_cleanup_qp_table(struct mlx4_dev *dev)
  481. {
  482. if (mlx4_is_slave(dev))
  483. return;
  484. mlx4_CONF_SPECIAL_QP(dev, 0);
  485. mlx4_bitmap_cleanup(&mlx4_priv(dev)->qp_table.bitmap);
  486. }
  487. int mlx4_qp_query(struct mlx4_dev *dev, struct mlx4_qp *qp,
  488. struct mlx4_qp_context *context)
  489. {
  490. struct mlx4_cmd_mailbox *mailbox;
  491. int err;
  492. mailbox = mlx4_alloc_cmd_mailbox(dev);
  493. if (IS_ERR(mailbox))
  494. return PTR_ERR(mailbox);
  495. err = mlx4_cmd_box(dev, 0, mailbox->dma, qp->qpn, 0,
  496. MLX4_CMD_QUERY_QP, MLX4_CMD_TIME_CLASS_A,
  497. MLX4_CMD_WRAPPED);
  498. if (!err)
  499. memcpy(context, mailbox->buf + 8, sizeof *context);
  500. mlx4_free_cmd_mailbox(dev, mailbox);
  501. return err;
  502. }
  503. EXPORT_SYMBOL_GPL(mlx4_qp_query);
  504. int mlx4_qp_to_ready(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  505. struct mlx4_qp_context *context,
  506. struct mlx4_qp *qp, enum mlx4_qp_state *qp_state)
  507. {
  508. int err;
  509. int i;
  510. enum mlx4_qp_state states[] = {
  511. MLX4_QP_STATE_RST,
  512. MLX4_QP_STATE_INIT,
  513. MLX4_QP_STATE_RTR,
  514. MLX4_QP_STATE_RTS
  515. };
  516. for (i = 0; i < ARRAY_SIZE(states) - 1; i++) {
  517. context->flags &= cpu_to_be32(~(0xf << 28));
  518. context->flags |= cpu_to_be32(states[i + 1] << 28);
  519. err = mlx4_qp_modify(dev, mtt, states[i], states[i + 1],
  520. context, 0, 0, qp);
  521. if (err) {
  522. mlx4_err(dev, "Failed to bring QP to state: %d with error: %d\n",
  523. states[i + 1], err);
  524. return err;
  525. }
  526. *qp_state = states[i + 1];
  527. }
  528. return 0;
  529. }
  530. EXPORT_SYMBOL_GPL(mlx4_qp_to_ready);