qp.c 27 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962
  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. /* QP to support BF should have bits 6,7 cleared */
  42. #define MLX4_BF_QP_SKIP_MASK 0xc0
  43. #define MLX4_MAX_BF_QP_RANGE 0x40
  44. void mlx4_qp_event(struct mlx4_dev *dev, u32 qpn, int event_type)
  45. {
  46. struct mlx4_qp_table *qp_table = &mlx4_priv(dev)->qp_table;
  47. struct mlx4_qp *qp;
  48. spin_lock(&qp_table->lock);
  49. qp = __mlx4_qp_lookup(dev, qpn);
  50. if (qp)
  51. atomic_inc(&qp->refcount);
  52. spin_unlock(&qp_table->lock);
  53. if (!qp) {
  54. mlx4_dbg(dev, "Async event for none existent QP %08x\n", qpn);
  55. return;
  56. }
  57. qp->event(qp, event_type);
  58. if (atomic_dec_and_test(&qp->refcount))
  59. complete(&qp->free);
  60. }
  61. /* used for INIT/CLOSE port logic */
  62. static int is_master_qp0(struct mlx4_dev *dev, struct mlx4_qp *qp, int *real_qp0, int *proxy_qp0)
  63. {
  64. /* this procedure is called after we already know we are on the master */
  65. /* qp0 is either the proxy qp0, or the real qp0 */
  66. u32 pf_proxy_offset = dev->phys_caps.base_proxy_sqpn + 8 * mlx4_master_func_num(dev);
  67. *proxy_qp0 = qp->qpn >= pf_proxy_offset && qp->qpn <= pf_proxy_offset + 1;
  68. *real_qp0 = qp->qpn >= dev->phys_caps.base_sqpn &&
  69. qp->qpn <= dev->phys_caps.base_sqpn + 1;
  70. return *real_qp0 || *proxy_qp0;
  71. }
  72. static int __mlx4_qp_modify(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  73. enum mlx4_qp_state cur_state, enum mlx4_qp_state new_state,
  74. struct mlx4_qp_context *context,
  75. enum mlx4_qp_optpar optpar,
  76. int sqd_event, struct mlx4_qp *qp, int native)
  77. {
  78. static const u16 op[MLX4_QP_NUM_STATE][MLX4_QP_NUM_STATE] = {
  79. [MLX4_QP_STATE_RST] = {
  80. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  81. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  82. [MLX4_QP_STATE_INIT] = MLX4_CMD_RST2INIT_QP,
  83. },
  84. [MLX4_QP_STATE_INIT] = {
  85. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  86. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  87. [MLX4_QP_STATE_INIT] = MLX4_CMD_INIT2INIT_QP,
  88. [MLX4_QP_STATE_RTR] = MLX4_CMD_INIT2RTR_QP,
  89. },
  90. [MLX4_QP_STATE_RTR] = {
  91. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  92. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  93. [MLX4_QP_STATE_RTS] = MLX4_CMD_RTR2RTS_QP,
  94. },
  95. [MLX4_QP_STATE_RTS] = {
  96. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  97. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  98. [MLX4_QP_STATE_RTS] = MLX4_CMD_RTS2RTS_QP,
  99. [MLX4_QP_STATE_SQD] = MLX4_CMD_RTS2SQD_QP,
  100. },
  101. [MLX4_QP_STATE_SQD] = {
  102. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  103. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  104. [MLX4_QP_STATE_RTS] = MLX4_CMD_SQD2RTS_QP,
  105. [MLX4_QP_STATE_SQD] = MLX4_CMD_SQD2SQD_QP,
  106. },
  107. [MLX4_QP_STATE_SQER] = {
  108. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  109. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  110. [MLX4_QP_STATE_RTS] = MLX4_CMD_SQERR2RTS_QP,
  111. },
  112. [MLX4_QP_STATE_ERR] = {
  113. [MLX4_QP_STATE_RST] = MLX4_CMD_2RST_QP,
  114. [MLX4_QP_STATE_ERR] = MLX4_CMD_2ERR_QP,
  115. }
  116. };
  117. struct mlx4_priv *priv = mlx4_priv(dev);
  118. struct mlx4_cmd_mailbox *mailbox;
  119. int ret = 0;
  120. int real_qp0 = 0;
  121. int proxy_qp0 = 0;
  122. u8 port;
  123. if (cur_state >= MLX4_QP_NUM_STATE || new_state >= MLX4_QP_NUM_STATE ||
  124. !op[cur_state][new_state])
  125. return -EINVAL;
  126. if (op[cur_state][new_state] == MLX4_CMD_2RST_QP) {
  127. ret = mlx4_cmd(dev, 0, qp->qpn, 2,
  128. MLX4_CMD_2RST_QP, MLX4_CMD_TIME_CLASS_A, native);
  129. if (mlx4_is_master(dev) && cur_state != MLX4_QP_STATE_ERR &&
  130. cur_state != MLX4_QP_STATE_RST &&
  131. is_master_qp0(dev, qp, &real_qp0, &proxy_qp0)) {
  132. port = (qp->qpn & 1) + 1;
  133. if (proxy_qp0)
  134. priv->mfunc.master.qp0_state[port].proxy_qp0_active = 0;
  135. else
  136. priv->mfunc.master.qp0_state[port].qp0_active = 0;
  137. }
  138. return ret;
  139. }
  140. mailbox = mlx4_alloc_cmd_mailbox(dev);
  141. if (IS_ERR(mailbox))
  142. return PTR_ERR(mailbox);
  143. if (cur_state == MLX4_QP_STATE_RST && new_state == MLX4_QP_STATE_INIT) {
  144. u64 mtt_addr = mlx4_mtt_addr(dev, mtt);
  145. context->mtt_base_addr_h = mtt_addr >> 32;
  146. context->mtt_base_addr_l = cpu_to_be32(mtt_addr & 0xffffffff);
  147. context->log_page_size = mtt->page_shift - MLX4_ICM_PAGE_SHIFT;
  148. }
  149. if ((cur_state == MLX4_QP_STATE_RTR) &&
  150. (new_state == MLX4_QP_STATE_RTS) &&
  151. dev->caps.flags2 & MLX4_DEV_CAP_FLAG2_ROCE_V1_V2)
  152. context->roce_entropy =
  153. cpu_to_be16(mlx4_qp_roce_entropy(dev, qp->qpn));
  154. *(__be32 *) mailbox->buf = cpu_to_be32(optpar);
  155. memcpy(mailbox->buf + 8, context, sizeof(*context));
  156. ((struct mlx4_qp_context *) (mailbox->buf + 8))->local_qpn =
  157. cpu_to_be32(qp->qpn);
  158. ret = mlx4_cmd(dev, mailbox->dma,
  159. qp->qpn | (!!sqd_event << 31),
  160. new_state == MLX4_QP_STATE_RST ? 2 : 0,
  161. op[cur_state][new_state], MLX4_CMD_TIME_CLASS_C, native);
  162. if (mlx4_is_master(dev) && is_master_qp0(dev, qp, &real_qp0, &proxy_qp0)) {
  163. port = (qp->qpn & 1) + 1;
  164. if (cur_state != MLX4_QP_STATE_ERR &&
  165. cur_state != MLX4_QP_STATE_RST &&
  166. new_state == MLX4_QP_STATE_ERR) {
  167. if (proxy_qp0)
  168. priv->mfunc.master.qp0_state[port].proxy_qp0_active = 0;
  169. else
  170. priv->mfunc.master.qp0_state[port].qp0_active = 0;
  171. } else if (new_state == MLX4_QP_STATE_RTR) {
  172. if (proxy_qp0)
  173. priv->mfunc.master.qp0_state[port].proxy_qp0_active = 1;
  174. else
  175. priv->mfunc.master.qp0_state[port].qp0_active = 1;
  176. }
  177. }
  178. mlx4_free_cmd_mailbox(dev, mailbox);
  179. return ret;
  180. }
  181. int mlx4_qp_modify(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  182. enum mlx4_qp_state cur_state, enum mlx4_qp_state new_state,
  183. struct mlx4_qp_context *context,
  184. enum mlx4_qp_optpar optpar,
  185. int sqd_event, struct mlx4_qp *qp)
  186. {
  187. return __mlx4_qp_modify(dev, mtt, cur_state, new_state, context,
  188. optpar, sqd_event, qp, 0);
  189. }
  190. EXPORT_SYMBOL_GPL(mlx4_qp_modify);
  191. int __mlx4_qp_reserve_range(struct mlx4_dev *dev, int cnt, int align,
  192. int *base, u8 flags)
  193. {
  194. u32 uid;
  195. int bf_qp = !!(flags & (u8)MLX4_RESERVE_ETH_BF_QP);
  196. struct mlx4_priv *priv = mlx4_priv(dev);
  197. struct mlx4_qp_table *qp_table = &priv->qp_table;
  198. if (cnt > MLX4_MAX_BF_QP_RANGE && bf_qp)
  199. return -ENOMEM;
  200. uid = MLX4_QP_TABLE_ZONE_GENERAL;
  201. if (flags & (u8)MLX4_RESERVE_A0_QP) {
  202. if (bf_qp)
  203. uid = MLX4_QP_TABLE_ZONE_RAW_ETH;
  204. else
  205. uid = MLX4_QP_TABLE_ZONE_RSS;
  206. }
  207. *base = mlx4_zone_alloc_entries(qp_table->zones, uid, cnt, align,
  208. bf_qp ? MLX4_BF_QP_SKIP_MASK : 0, NULL);
  209. if (*base == -1)
  210. return -ENOMEM;
  211. return 0;
  212. }
  213. int mlx4_qp_reserve_range(struct mlx4_dev *dev, int cnt, int align,
  214. int *base, u8 flags, u8 usage)
  215. {
  216. u32 in_modifier = RES_QP | (((u32)usage & 3) << 30);
  217. u64 in_param = 0;
  218. u64 out_param;
  219. int err;
  220. /* Turn off all unsupported QP allocation flags */
  221. flags &= dev->caps.alloc_res_qp_mask;
  222. if (mlx4_is_mfunc(dev)) {
  223. set_param_l(&in_param, (((u32)flags) << 24) | (u32)cnt);
  224. set_param_h(&in_param, align);
  225. err = mlx4_cmd_imm(dev, in_param, &out_param,
  226. in_modifier, RES_OP_RESERVE,
  227. MLX4_CMD_ALLOC_RES,
  228. MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
  229. if (err)
  230. return err;
  231. *base = get_param_l(&out_param);
  232. return 0;
  233. }
  234. return __mlx4_qp_reserve_range(dev, cnt, align, base, flags);
  235. }
  236. EXPORT_SYMBOL_GPL(mlx4_qp_reserve_range);
  237. void __mlx4_qp_release_range(struct mlx4_dev *dev, int base_qpn, int cnt)
  238. {
  239. struct mlx4_priv *priv = mlx4_priv(dev);
  240. struct mlx4_qp_table *qp_table = &priv->qp_table;
  241. if (mlx4_is_qp_reserved(dev, (u32) base_qpn))
  242. return;
  243. mlx4_zone_free_entries_unique(qp_table->zones, base_qpn, cnt);
  244. }
  245. void mlx4_qp_release_range(struct mlx4_dev *dev, int base_qpn, int cnt)
  246. {
  247. u64 in_param = 0;
  248. int err;
  249. if (mlx4_is_mfunc(dev)) {
  250. set_param_l(&in_param, base_qpn);
  251. set_param_h(&in_param, cnt);
  252. err = mlx4_cmd(dev, in_param, RES_QP, RES_OP_RESERVE,
  253. MLX4_CMD_FREE_RES,
  254. MLX4_CMD_TIME_CLASS_A, MLX4_CMD_WRAPPED);
  255. if (err) {
  256. mlx4_warn(dev, "Failed to release qp range base:%d cnt:%d\n",
  257. base_qpn, cnt);
  258. }
  259. } else
  260. __mlx4_qp_release_range(dev, base_qpn, cnt);
  261. }
  262. EXPORT_SYMBOL_GPL(mlx4_qp_release_range);
  263. int __mlx4_qp_alloc_icm(struct mlx4_dev *dev, int qpn)
  264. {
  265. struct mlx4_priv *priv = mlx4_priv(dev);
  266. struct mlx4_qp_table *qp_table = &priv->qp_table;
  267. int err;
  268. err = mlx4_table_get(dev, &qp_table->qp_table, qpn);
  269. if (err)
  270. goto err_out;
  271. err = mlx4_table_get(dev, &qp_table->auxc_table, qpn);
  272. if (err)
  273. goto err_put_qp;
  274. err = mlx4_table_get(dev, &qp_table->altc_table, qpn);
  275. if (err)
  276. goto err_put_auxc;
  277. err = mlx4_table_get(dev, &qp_table->rdmarc_table, qpn);
  278. if (err)
  279. goto err_put_altc;
  280. err = mlx4_table_get(dev, &qp_table->cmpt_table, qpn);
  281. if (err)
  282. goto err_put_rdmarc;
  283. return 0;
  284. err_put_rdmarc:
  285. mlx4_table_put(dev, &qp_table->rdmarc_table, qpn);
  286. err_put_altc:
  287. mlx4_table_put(dev, &qp_table->altc_table, qpn);
  288. err_put_auxc:
  289. mlx4_table_put(dev, &qp_table->auxc_table, qpn);
  290. err_put_qp:
  291. mlx4_table_put(dev, &qp_table->qp_table, qpn);
  292. err_out:
  293. return err;
  294. }
  295. static int mlx4_qp_alloc_icm(struct mlx4_dev *dev, int qpn)
  296. {
  297. u64 param = 0;
  298. if (mlx4_is_mfunc(dev)) {
  299. set_param_l(&param, qpn);
  300. return mlx4_cmd_imm(dev, param, &param, RES_QP, RES_OP_MAP_ICM,
  301. MLX4_CMD_ALLOC_RES, MLX4_CMD_TIME_CLASS_A,
  302. MLX4_CMD_WRAPPED);
  303. }
  304. return __mlx4_qp_alloc_icm(dev, qpn);
  305. }
  306. void __mlx4_qp_free_icm(struct mlx4_dev *dev, int qpn)
  307. {
  308. struct mlx4_priv *priv = mlx4_priv(dev);
  309. struct mlx4_qp_table *qp_table = &priv->qp_table;
  310. mlx4_table_put(dev, &qp_table->cmpt_table, qpn);
  311. mlx4_table_put(dev, &qp_table->rdmarc_table, qpn);
  312. mlx4_table_put(dev, &qp_table->altc_table, qpn);
  313. mlx4_table_put(dev, &qp_table->auxc_table, qpn);
  314. mlx4_table_put(dev, &qp_table->qp_table, qpn);
  315. }
  316. static void mlx4_qp_free_icm(struct mlx4_dev *dev, int qpn)
  317. {
  318. u64 in_param = 0;
  319. if (mlx4_is_mfunc(dev)) {
  320. set_param_l(&in_param, qpn);
  321. if (mlx4_cmd(dev, in_param, RES_QP, RES_OP_MAP_ICM,
  322. MLX4_CMD_FREE_RES, MLX4_CMD_TIME_CLASS_A,
  323. MLX4_CMD_WRAPPED))
  324. mlx4_warn(dev, "Failed to free icm of qp:%d\n", qpn);
  325. } else
  326. __mlx4_qp_free_icm(dev, qpn);
  327. }
  328. struct mlx4_qp *mlx4_qp_lookup(struct mlx4_dev *dev, u32 qpn)
  329. {
  330. struct mlx4_qp_table *qp_table = &mlx4_priv(dev)->qp_table;
  331. struct mlx4_qp *qp;
  332. spin_lock(&qp_table->lock);
  333. qp = __mlx4_qp_lookup(dev, qpn);
  334. spin_unlock(&qp_table->lock);
  335. return qp;
  336. }
  337. int mlx4_qp_alloc(struct mlx4_dev *dev, int qpn, struct mlx4_qp *qp)
  338. {
  339. struct mlx4_priv *priv = mlx4_priv(dev);
  340. struct mlx4_qp_table *qp_table = &priv->qp_table;
  341. int err;
  342. if (!qpn)
  343. return -EINVAL;
  344. qp->qpn = qpn;
  345. err = mlx4_qp_alloc_icm(dev, qpn);
  346. if (err)
  347. return err;
  348. spin_lock_irq(&qp_table->lock);
  349. err = radix_tree_insert(&dev->qp_table_tree, qp->qpn &
  350. (dev->caps.num_qps - 1), qp);
  351. spin_unlock_irq(&qp_table->lock);
  352. if (err)
  353. goto err_icm;
  354. atomic_set(&qp->refcount, 1);
  355. init_completion(&qp->free);
  356. return 0;
  357. err_icm:
  358. mlx4_qp_free_icm(dev, qpn);
  359. return err;
  360. }
  361. EXPORT_SYMBOL_GPL(mlx4_qp_alloc);
  362. int mlx4_update_qp(struct mlx4_dev *dev, u32 qpn,
  363. enum mlx4_update_qp_attr attr,
  364. struct mlx4_update_qp_params *params)
  365. {
  366. struct mlx4_cmd_mailbox *mailbox;
  367. struct mlx4_update_qp_context *cmd;
  368. u64 pri_addr_path_mask = 0;
  369. u64 qp_mask = 0;
  370. int err = 0;
  371. if (!attr || (attr & ~MLX4_UPDATE_QP_SUPPORTED_ATTRS))
  372. return -EINVAL;
  373. mailbox = mlx4_alloc_cmd_mailbox(dev);
  374. if (IS_ERR(mailbox))
  375. return PTR_ERR(mailbox);
  376. cmd = (struct mlx4_update_qp_context *)mailbox->buf;
  377. if (attr & MLX4_UPDATE_QP_SMAC) {
  378. pri_addr_path_mask |= 1ULL << MLX4_UPD_QP_PATH_MASK_MAC_INDEX;
  379. cmd->qp_context.pri_path.grh_mylmc = params->smac_index;
  380. }
  381. if (attr & MLX4_UPDATE_QP_ETH_SRC_CHECK_MC_LB) {
  382. if (!(dev->caps.flags2
  383. & MLX4_DEV_CAP_FLAG2_UPDATE_QP_SRC_CHECK_LB)) {
  384. mlx4_warn(dev,
  385. "Trying to set src check LB, but it isn't supported\n");
  386. err = -EOPNOTSUPP;
  387. goto out;
  388. }
  389. pri_addr_path_mask |=
  390. 1ULL << MLX4_UPD_QP_PATH_MASK_ETH_SRC_CHECK_MC_LB;
  391. if (params->flags &
  392. MLX4_UPDATE_QP_PARAMS_FLAGS_ETH_CHECK_MC_LB) {
  393. cmd->qp_context.pri_path.fl |=
  394. MLX4_FL_ETH_SRC_CHECK_MC_LB;
  395. }
  396. }
  397. if (attr & MLX4_UPDATE_QP_VSD) {
  398. qp_mask |= 1ULL << MLX4_UPD_QP_MASK_VSD;
  399. if (params->flags & MLX4_UPDATE_QP_PARAMS_FLAGS_VSD_ENABLE)
  400. cmd->qp_context.param3 |= cpu_to_be32(MLX4_STRIP_VLAN);
  401. }
  402. if (attr & MLX4_UPDATE_QP_RATE_LIMIT) {
  403. qp_mask |= 1ULL << MLX4_UPD_QP_MASK_RATE_LIMIT;
  404. cmd->qp_context.rate_limit_params = cpu_to_be16((params->rate_unit << 14) | params->rate_val);
  405. }
  406. if (attr & MLX4_UPDATE_QP_QOS_VPORT) {
  407. if (!(dev->caps.flags2 & MLX4_DEV_CAP_FLAG2_QOS_VPP)) {
  408. mlx4_warn(dev, "Granular QoS per VF is not enabled\n");
  409. err = -EOPNOTSUPP;
  410. goto out;
  411. }
  412. qp_mask |= 1ULL << MLX4_UPD_QP_MASK_QOS_VPP;
  413. cmd->qp_context.qos_vport = params->qos_vport;
  414. }
  415. cmd->primary_addr_path_mask = cpu_to_be64(pri_addr_path_mask);
  416. cmd->qp_mask = cpu_to_be64(qp_mask);
  417. err = mlx4_cmd(dev, mailbox->dma, qpn & 0xffffff, 0,
  418. MLX4_CMD_UPDATE_QP, MLX4_CMD_TIME_CLASS_A,
  419. MLX4_CMD_NATIVE);
  420. out:
  421. mlx4_free_cmd_mailbox(dev, mailbox);
  422. return err;
  423. }
  424. EXPORT_SYMBOL_GPL(mlx4_update_qp);
  425. void mlx4_qp_remove(struct mlx4_dev *dev, struct mlx4_qp *qp)
  426. {
  427. struct mlx4_qp_table *qp_table = &mlx4_priv(dev)->qp_table;
  428. unsigned long flags;
  429. spin_lock_irqsave(&qp_table->lock, flags);
  430. radix_tree_delete(&dev->qp_table_tree, qp->qpn & (dev->caps.num_qps - 1));
  431. spin_unlock_irqrestore(&qp_table->lock, flags);
  432. }
  433. EXPORT_SYMBOL_GPL(mlx4_qp_remove);
  434. void mlx4_qp_free(struct mlx4_dev *dev, struct mlx4_qp *qp)
  435. {
  436. if (atomic_dec_and_test(&qp->refcount))
  437. complete(&qp->free);
  438. wait_for_completion(&qp->free);
  439. mlx4_qp_free_icm(dev, qp->qpn);
  440. }
  441. EXPORT_SYMBOL_GPL(mlx4_qp_free);
  442. static int mlx4_CONF_SPECIAL_QP(struct mlx4_dev *dev, u32 base_qpn)
  443. {
  444. return mlx4_cmd(dev, 0, base_qpn, 0, MLX4_CMD_CONF_SPECIAL_QP,
  445. MLX4_CMD_TIME_CLASS_B, MLX4_CMD_NATIVE);
  446. }
  447. #define MLX4_QP_TABLE_RSS_ETH_PRIORITY 2
  448. #define MLX4_QP_TABLE_RAW_ETH_PRIORITY 1
  449. #define MLX4_QP_TABLE_RAW_ETH_SIZE 256
  450. static int mlx4_create_zones(struct mlx4_dev *dev,
  451. u32 reserved_bottom_general,
  452. u32 reserved_top_general,
  453. u32 reserved_bottom_rss,
  454. u32 start_offset_rss,
  455. u32 max_table_offset)
  456. {
  457. struct mlx4_qp_table *qp_table = &mlx4_priv(dev)->qp_table;
  458. struct mlx4_bitmap (*bitmap)[MLX4_QP_TABLE_ZONE_NUM] = NULL;
  459. int bitmap_initialized = 0;
  460. u32 last_offset;
  461. int k;
  462. int err;
  463. qp_table->zones = mlx4_zone_allocator_create(MLX4_ZONE_ALLOC_FLAGS_NO_OVERLAP);
  464. if (NULL == qp_table->zones)
  465. return -ENOMEM;
  466. bitmap = kmalloc(sizeof(*bitmap), GFP_KERNEL);
  467. if (NULL == bitmap) {
  468. err = -ENOMEM;
  469. goto free_zone;
  470. }
  471. err = mlx4_bitmap_init(*bitmap + MLX4_QP_TABLE_ZONE_GENERAL, dev->caps.num_qps,
  472. (1 << 23) - 1, reserved_bottom_general,
  473. reserved_top_general);
  474. if (err)
  475. goto free_bitmap;
  476. ++bitmap_initialized;
  477. err = mlx4_zone_add_one(qp_table->zones, *bitmap + MLX4_QP_TABLE_ZONE_GENERAL,
  478. MLX4_ZONE_FALLBACK_TO_HIGHER_PRIO |
  479. MLX4_ZONE_USE_RR, 0,
  480. 0, qp_table->zones_uids + MLX4_QP_TABLE_ZONE_GENERAL);
  481. if (err)
  482. goto free_bitmap;
  483. err = mlx4_bitmap_init(*bitmap + MLX4_QP_TABLE_ZONE_RSS,
  484. reserved_bottom_rss,
  485. reserved_bottom_rss - 1,
  486. dev->caps.reserved_qps_cnt[MLX4_QP_REGION_FW],
  487. reserved_bottom_rss - start_offset_rss);
  488. if (err)
  489. goto free_bitmap;
  490. ++bitmap_initialized;
  491. err = mlx4_zone_add_one(qp_table->zones, *bitmap + MLX4_QP_TABLE_ZONE_RSS,
  492. MLX4_ZONE_ALLOW_ALLOC_FROM_LOWER_PRIO |
  493. MLX4_ZONE_ALLOW_ALLOC_FROM_EQ_PRIO |
  494. MLX4_ZONE_USE_RR, MLX4_QP_TABLE_RSS_ETH_PRIORITY,
  495. 0, qp_table->zones_uids + MLX4_QP_TABLE_ZONE_RSS);
  496. if (err)
  497. goto free_bitmap;
  498. last_offset = dev->caps.reserved_qps_cnt[MLX4_QP_REGION_FW];
  499. /* We have a single zone for the A0 steering QPs area of the FW. This area
  500. * needs to be split into subareas. One set of subareas is for RSS QPs
  501. * (in which qp number bits 6 and/or 7 are set); the other set of subareas
  502. * is for RAW_ETH QPs, which require that both bits 6 and 7 are zero.
  503. * Currently, the values returned by the FW (A0 steering area starting qp number
  504. * and A0 steering area size) are such that there are only two subareas -- one
  505. * for RSS and one for RAW_ETH.
  506. */
  507. for (k = MLX4_QP_TABLE_ZONE_RSS + 1; k < sizeof(*bitmap)/sizeof((*bitmap)[0]);
  508. k++) {
  509. int size;
  510. u32 offset = start_offset_rss;
  511. u32 bf_mask;
  512. u32 requested_size;
  513. /* Assuming MLX4_BF_QP_SKIP_MASK is consecutive ones, this calculates
  514. * a mask of all LSB bits set until (and not including) the first
  515. * set bit of MLX4_BF_QP_SKIP_MASK. For example, if MLX4_BF_QP_SKIP_MASK
  516. * is 0xc0, bf_mask will be 0x3f.
  517. */
  518. bf_mask = (MLX4_BF_QP_SKIP_MASK & ~(MLX4_BF_QP_SKIP_MASK - 1)) - 1;
  519. requested_size = min((u32)MLX4_QP_TABLE_RAW_ETH_SIZE, bf_mask + 1);
  520. if (((last_offset & MLX4_BF_QP_SKIP_MASK) &&
  521. ((int)(max_table_offset - last_offset)) >=
  522. roundup_pow_of_two(MLX4_BF_QP_SKIP_MASK)) ||
  523. (!(last_offset & MLX4_BF_QP_SKIP_MASK) &&
  524. !((last_offset + requested_size - 1) &
  525. MLX4_BF_QP_SKIP_MASK)))
  526. size = requested_size;
  527. else {
  528. u32 candidate_offset =
  529. (last_offset | MLX4_BF_QP_SKIP_MASK | bf_mask) + 1;
  530. if (last_offset & MLX4_BF_QP_SKIP_MASK)
  531. last_offset = candidate_offset;
  532. /* From this point, the BF bits are 0 */
  533. if (last_offset > max_table_offset) {
  534. /* need to skip */
  535. size = -1;
  536. } else {
  537. size = min3(max_table_offset - last_offset,
  538. bf_mask - (last_offset & bf_mask),
  539. requested_size);
  540. if (size < requested_size) {
  541. int candidate_size;
  542. candidate_size = min3(
  543. max_table_offset - candidate_offset,
  544. bf_mask - (last_offset & bf_mask),
  545. requested_size);
  546. /* We will not take this path if last_offset was
  547. * already set above to candidate_offset
  548. */
  549. if (candidate_size > size) {
  550. last_offset = candidate_offset;
  551. size = candidate_size;
  552. }
  553. }
  554. }
  555. }
  556. if (size > 0) {
  557. /* mlx4_bitmap_alloc_range will find a contiguous range of "size"
  558. * QPs in which both bits 6 and 7 are zero, because we pass it the
  559. * MLX4_BF_SKIP_MASK).
  560. */
  561. offset = mlx4_bitmap_alloc_range(
  562. *bitmap + MLX4_QP_TABLE_ZONE_RSS,
  563. size, 1,
  564. MLX4_BF_QP_SKIP_MASK);
  565. if (offset == (u32)-1) {
  566. err = -ENOMEM;
  567. break;
  568. }
  569. last_offset = offset + size;
  570. err = mlx4_bitmap_init(*bitmap + k, roundup_pow_of_two(size),
  571. roundup_pow_of_two(size) - 1, 0,
  572. roundup_pow_of_two(size) - size);
  573. } else {
  574. /* Add an empty bitmap, we'll allocate from different zones (since
  575. * at least one is reserved)
  576. */
  577. err = mlx4_bitmap_init(*bitmap + k, 1,
  578. MLX4_QP_TABLE_RAW_ETH_SIZE - 1, 0,
  579. 0);
  580. mlx4_bitmap_alloc_range(*bitmap + k, 1, 1, 0);
  581. }
  582. if (err)
  583. break;
  584. ++bitmap_initialized;
  585. err = mlx4_zone_add_one(qp_table->zones, *bitmap + k,
  586. MLX4_ZONE_ALLOW_ALLOC_FROM_LOWER_PRIO |
  587. MLX4_ZONE_ALLOW_ALLOC_FROM_EQ_PRIO |
  588. MLX4_ZONE_USE_RR, MLX4_QP_TABLE_RAW_ETH_PRIORITY,
  589. offset, qp_table->zones_uids + k);
  590. if (err)
  591. break;
  592. }
  593. if (err)
  594. goto free_bitmap;
  595. qp_table->bitmap_gen = *bitmap;
  596. return err;
  597. free_bitmap:
  598. for (k = 0; k < bitmap_initialized; k++)
  599. mlx4_bitmap_cleanup(*bitmap + k);
  600. kfree(bitmap);
  601. free_zone:
  602. mlx4_zone_allocator_destroy(qp_table->zones);
  603. return err;
  604. }
  605. static void mlx4_cleanup_qp_zones(struct mlx4_dev *dev)
  606. {
  607. struct mlx4_qp_table *qp_table = &mlx4_priv(dev)->qp_table;
  608. if (qp_table->zones) {
  609. int i;
  610. for (i = 0;
  611. i < sizeof(qp_table->zones_uids)/sizeof(qp_table->zones_uids[0]);
  612. i++) {
  613. struct mlx4_bitmap *bitmap =
  614. mlx4_zone_get_bitmap(qp_table->zones,
  615. qp_table->zones_uids[i]);
  616. mlx4_zone_remove_one(qp_table->zones, qp_table->zones_uids[i]);
  617. if (NULL == bitmap)
  618. continue;
  619. mlx4_bitmap_cleanup(bitmap);
  620. }
  621. mlx4_zone_allocator_destroy(qp_table->zones);
  622. kfree(qp_table->bitmap_gen);
  623. qp_table->bitmap_gen = NULL;
  624. qp_table->zones = NULL;
  625. }
  626. }
  627. int mlx4_init_qp_table(struct mlx4_dev *dev)
  628. {
  629. struct mlx4_qp_table *qp_table = &mlx4_priv(dev)->qp_table;
  630. int err;
  631. int reserved_from_top = 0;
  632. int reserved_from_bot;
  633. int k;
  634. int fixed_reserved_from_bot_rv = 0;
  635. int bottom_reserved_for_rss_bitmap;
  636. u32 max_table_offset = dev->caps.dmfs_high_rate_qpn_base +
  637. dev->caps.dmfs_high_rate_qpn_range;
  638. spin_lock_init(&qp_table->lock);
  639. INIT_RADIX_TREE(&dev->qp_table_tree, GFP_ATOMIC);
  640. if (mlx4_is_slave(dev))
  641. return 0;
  642. /* We reserve 2 extra QPs per port for the special QPs. The
  643. * block of special QPs must be aligned to a multiple of 8, so
  644. * round up.
  645. *
  646. * We also reserve the MSB of the 24-bit QP number to indicate
  647. * that a QP is an XRC QP.
  648. */
  649. for (k = 0; k <= MLX4_QP_REGION_BOTTOM; k++)
  650. fixed_reserved_from_bot_rv += dev->caps.reserved_qps_cnt[k];
  651. if (fixed_reserved_from_bot_rv < max_table_offset)
  652. fixed_reserved_from_bot_rv = max_table_offset;
  653. /* We reserve at least 1 extra for bitmaps that we don't have enough space for*/
  654. bottom_reserved_for_rss_bitmap =
  655. roundup_pow_of_two(fixed_reserved_from_bot_rv + 1);
  656. dev->phys_caps.base_sqpn = ALIGN(bottom_reserved_for_rss_bitmap, 8);
  657. {
  658. int sort[MLX4_NUM_QP_REGION];
  659. int i, j;
  660. int last_base = dev->caps.num_qps;
  661. for (i = 1; i < MLX4_NUM_QP_REGION; ++i)
  662. sort[i] = i;
  663. for (i = MLX4_NUM_QP_REGION; i > MLX4_QP_REGION_BOTTOM; --i) {
  664. for (j = MLX4_QP_REGION_BOTTOM + 2; j < i; ++j) {
  665. if (dev->caps.reserved_qps_cnt[sort[j]] >
  666. dev->caps.reserved_qps_cnt[sort[j - 1]])
  667. swap(sort[j], sort[j - 1]);
  668. }
  669. }
  670. for (i = MLX4_QP_REGION_BOTTOM + 1; i < MLX4_NUM_QP_REGION; ++i) {
  671. last_base -= dev->caps.reserved_qps_cnt[sort[i]];
  672. dev->caps.reserved_qps_base[sort[i]] = last_base;
  673. reserved_from_top +=
  674. dev->caps.reserved_qps_cnt[sort[i]];
  675. }
  676. }
  677. /* Reserve 8 real SQPs in both native and SRIOV modes.
  678. * In addition, in SRIOV mode, reserve 8 proxy SQPs per function
  679. * (for all PFs and VFs), and 8 corresponding tunnel QPs.
  680. * Each proxy SQP works opposite its own tunnel QP.
  681. *
  682. * The QPs are arranged as follows:
  683. * a. 8 real SQPs
  684. * b. All the proxy SQPs (8 per function)
  685. * c. All the tunnel QPs (8 per function)
  686. */
  687. reserved_from_bot = mlx4_num_reserved_sqps(dev);
  688. if (reserved_from_bot + reserved_from_top > dev->caps.num_qps) {
  689. mlx4_err(dev, "Number of reserved QPs is higher than number of QPs\n");
  690. return -EINVAL;
  691. }
  692. err = mlx4_create_zones(dev, reserved_from_bot, reserved_from_bot,
  693. bottom_reserved_for_rss_bitmap,
  694. fixed_reserved_from_bot_rv,
  695. max_table_offset);
  696. if (err)
  697. return err;
  698. if (mlx4_is_mfunc(dev)) {
  699. /* for PPF use */
  700. dev->phys_caps.base_proxy_sqpn = dev->phys_caps.base_sqpn + 8;
  701. dev->phys_caps.base_tunnel_sqpn = dev->phys_caps.base_sqpn + 8 + 8 * MLX4_MFUNC_MAX;
  702. /* In mfunc, calculate proxy and tunnel qp offsets for the PF here,
  703. * since the PF does not call mlx4_slave_caps */
  704. dev->caps.spec_qps = kcalloc(dev->caps.num_ports,
  705. sizeof(*dev->caps.spec_qps),
  706. GFP_KERNEL);
  707. if (!dev->caps.spec_qps) {
  708. err = -ENOMEM;
  709. goto err_mem;
  710. }
  711. for (k = 0; k < dev->caps.num_ports; k++) {
  712. dev->caps.spec_qps[k].qp0_proxy = dev->phys_caps.base_proxy_sqpn +
  713. 8 * mlx4_master_func_num(dev) + k;
  714. dev->caps.spec_qps[k].qp0_tunnel = dev->caps.spec_qps[k].qp0_proxy + 8 * MLX4_MFUNC_MAX;
  715. dev->caps.spec_qps[k].qp1_proxy = dev->phys_caps.base_proxy_sqpn +
  716. 8 * mlx4_master_func_num(dev) + MLX4_MAX_PORTS + k;
  717. dev->caps.spec_qps[k].qp1_tunnel = dev->caps.spec_qps[k].qp1_proxy + 8 * MLX4_MFUNC_MAX;
  718. }
  719. }
  720. err = mlx4_CONF_SPECIAL_QP(dev, dev->phys_caps.base_sqpn);
  721. if (err)
  722. goto err_mem;
  723. return err;
  724. err_mem:
  725. kfree(dev->caps.spec_qps);
  726. dev->caps.spec_qps = NULL;
  727. mlx4_cleanup_qp_zones(dev);
  728. return err;
  729. }
  730. void mlx4_cleanup_qp_table(struct mlx4_dev *dev)
  731. {
  732. if (mlx4_is_slave(dev))
  733. return;
  734. mlx4_CONF_SPECIAL_QP(dev, 0);
  735. mlx4_cleanup_qp_zones(dev);
  736. }
  737. int mlx4_qp_query(struct mlx4_dev *dev, struct mlx4_qp *qp,
  738. struct mlx4_qp_context *context)
  739. {
  740. struct mlx4_cmd_mailbox *mailbox;
  741. int err;
  742. mailbox = mlx4_alloc_cmd_mailbox(dev);
  743. if (IS_ERR(mailbox))
  744. return PTR_ERR(mailbox);
  745. err = mlx4_cmd_box(dev, 0, mailbox->dma, qp->qpn, 0,
  746. MLX4_CMD_QUERY_QP, MLX4_CMD_TIME_CLASS_A,
  747. MLX4_CMD_WRAPPED);
  748. if (!err)
  749. memcpy(context, mailbox->buf + 8, sizeof(*context));
  750. mlx4_free_cmd_mailbox(dev, mailbox);
  751. return err;
  752. }
  753. EXPORT_SYMBOL_GPL(mlx4_qp_query);
  754. int mlx4_qp_to_ready(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  755. struct mlx4_qp_context *context,
  756. struct mlx4_qp *qp, enum mlx4_qp_state *qp_state)
  757. {
  758. int err;
  759. int i;
  760. enum mlx4_qp_state states[] = {
  761. MLX4_QP_STATE_RST,
  762. MLX4_QP_STATE_INIT,
  763. MLX4_QP_STATE_RTR,
  764. MLX4_QP_STATE_RTS
  765. };
  766. for (i = 0; i < ARRAY_SIZE(states) - 1; i++) {
  767. context->flags &= cpu_to_be32(~(0xf << 28));
  768. context->flags |= cpu_to_be32(states[i + 1] << 28);
  769. if (states[i + 1] != MLX4_QP_STATE_RTR)
  770. context->params2 &= ~MLX4_QP_BIT_FPP;
  771. err = mlx4_qp_modify(dev, mtt, states[i], states[i + 1],
  772. context, 0, 0, qp);
  773. if (err) {
  774. mlx4_err(dev, "Failed to bring QP to state: %d with error: %d\n",
  775. states[i + 1], err);
  776. return err;
  777. }
  778. *qp_state = states[i + 1];
  779. }
  780. return 0;
  781. }
  782. EXPORT_SYMBOL_GPL(mlx4_qp_to_ready);
  783. u16 mlx4_qp_roce_entropy(struct mlx4_dev *dev, u32 qpn)
  784. {
  785. struct mlx4_qp_context context;
  786. struct mlx4_qp qp;
  787. int err;
  788. qp.qpn = qpn;
  789. err = mlx4_qp_query(dev, &qp, &context);
  790. if (!err) {
  791. u32 dest_qpn = be32_to_cpu(context.remote_qpn) & 0xffffff;
  792. u16 folded_dst = folded_qp(dest_qpn);
  793. u16 folded_src = folded_qp(qpn);
  794. return (dest_qpn != qpn) ?
  795. ((folded_dst ^ folded_src) | 0xC000) :
  796. folded_src | 0xC000;
  797. }
  798. return 0xdead;
  799. }