mr.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662
  1. /*
  2. * Copyright (c) 2004 Topspin Communications. All rights reserved.
  3. * Copyright (c) 2005, 2006, 2007, 2008 Mellanox Technologies. All rights reserved.
  4. * Copyright (c) 2006, 2007 Cisco Systems, Inc. All rights reserved.
  5. *
  6. * This software is available to you under a choice of one of two
  7. * licenses. You may choose to be licensed under the terms of the GNU
  8. * General Public License (GPL) Version 2, available from the file
  9. * COPYING in the main directory of this source tree, or the
  10. * OpenIB.org BSD license below:
  11. *
  12. * Redistribution and use in source and binary forms, with or
  13. * without modification, are permitted provided that the following
  14. * conditions are met:
  15. *
  16. * - Redistributions of source code must retain the above
  17. * copyright notice, this list of conditions and the following
  18. * disclaimer.
  19. *
  20. * - Redistributions in binary form must reproduce the above
  21. * copyright notice, this list of conditions and the following
  22. * disclaimer in the documentation and/or other materials
  23. * provided with the distribution.
  24. *
  25. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  26. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  27. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  28. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  29. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  30. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  31. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  32. * SOFTWARE.
  33. */
  34. #include <linux/init.h>
  35. #include <linux/errno.h>
  36. #include <linux/mlx4/cmd.h>
  37. #include "mlx4.h"
  38. #include "icm.h"
  39. /*
  40. * Must be packed because mtt_seg is 64 bits but only aligned to 32 bits.
  41. */
  42. struct mlx4_mpt_entry {
  43. __be32 flags;
  44. __be32 qpn;
  45. __be32 key;
  46. __be32 pd_flags;
  47. __be64 start;
  48. __be64 length;
  49. __be32 lkey;
  50. __be32 win_cnt;
  51. u8 reserved1[3];
  52. u8 mtt_rep;
  53. __be64 mtt_seg;
  54. __be32 mtt_sz;
  55. __be32 entity_size;
  56. __be32 first_byte_offset;
  57. } __attribute__((packed));
  58. #define MLX4_MPT_FLAG_SW_OWNS (0xfUL << 28)
  59. #define MLX4_MPT_FLAG_FREE (0x3UL << 28)
  60. #define MLX4_MPT_FLAG_MIO (1 << 17)
  61. #define MLX4_MPT_FLAG_BIND_ENABLE (1 << 15)
  62. #define MLX4_MPT_FLAG_PHYSICAL (1 << 9)
  63. #define MLX4_MPT_FLAG_REGION (1 << 8)
  64. #define MLX4_MPT_PD_FLAG_FAST_REG (1 << 27)
  65. #define MLX4_MPT_PD_FLAG_RAE (1 << 28)
  66. #define MLX4_MPT_PD_FLAG_EN_INV (3 << 24)
  67. #define MLX4_MTT_FLAG_PRESENT 1
  68. #define MLX4_MPT_STATUS_SW 0xF0
  69. #define MLX4_MPT_STATUS_HW 0x00
  70. static u32 mlx4_buddy_alloc(struct mlx4_buddy *buddy, int order)
  71. {
  72. int o;
  73. int m;
  74. u32 seg;
  75. spin_lock(&buddy->lock);
  76. for (o = order; o <= buddy->max_order; ++o)
  77. if (buddy->num_free[o]) {
  78. m = 1 << (buddy->max_order - o);
  79. seg = find_first_bit(buddy->bits[o], m);
  80. if (seg < m)
  81. goto found;
  82. }
  83. spin_unlock(&buddy->lock);
  84. return -1;
  85. found:
  86. clear_bit(seg, buddy->bits[o]);
  87. --buddy->num_free[o];
  88. while (o > order) {
  89. --o;
  90. seg <<= 1;
  91. set_bit(seg ^ 1, buddy->bits[o]);
  92. ++buddy->num_free[o];
  93. }
  94. spin_unlock(&buddy->lock);
  95. seg <<= order;
  96. return seg;
  97. }
  98. static void mlx4_buddy_free(struct mlx4_buddy *buddy, u32 seg, int order)
  99. {
  100. seg >>= order;
  101. spin_lock(&buddy->lock);
  102. while (test_bit(seg ^ 1, buddy->bits[order])) {
  103. clear_bit(seg ^ 1, buddy->bits[order]);
  104. --buddy->num_free[order];
  105. seg >>= 1;
  106. ++order;
  107. }
  108. set_bit(seg, buddy->bits[order]);
  109. ++buddy->num_free[order];
  110. spin_unlock(&buddy->lock);
  111. }
  112. static int mlx4_buddy_init(struct mlx4_buddy *buddy, int max_order)
  113. {
  114. int i, s;
  115. buddy->max_order = max_order;
  116. spin_lock_init(&buddy->lock);
  117. buddy->bits = kzalloc((buddy->max_order + 1) * sizeof (long *),
  118. GFP_KERNEL);
  119. buddy->num_free = kzalloc((buddy->max_order + 1) * sizeof (int *),
  120. GFP_KERNEL);
  121. if (!buddy->bits || !buddy->num_free)
  122. goto err_out;
  123. for (i = 0; i <= buddy->max_order; ++i) {
  124. s = BITS_TO_LONGS(1 << (buddy->max_order - i));
  125. buddy->bits[i] = kmalloc(s * sizeof (long), GFP_KERNEL);
  126. if (!buddy->bits[i])
  127. goto err_out_free;
  128. bitmap_zero(buddy->bits[i], 1 << (buddy->max_order - i));
  129. }
  130. set_bit(0, buddy->bits[buddy->max_order]);
  131. buddy->num_free[buddy->max_order] = 1;
  132. return 0;
  133. err_out_free:
  134. for (i = 0; i <= buddy->max_order; ++i)
  135. kfree(buddy->bits[i]);
  136. err_out:
  137. kfree(buddy->bits);
  138. kfree(buddy->num_free);
  139. return -ENOMEM;
  140. }
  141. static void mlx4_buddy_cleanup(struct mlx4_buddy *buddy)
  142. {
  143. int i;
  144. for (i = 0; i <= buddy->max_order; ++i)
  145. kfree(buddy->bits[i]);
  146. kfree(buddy->bits);
  147. kfree(buddy->num_free);
  148. }
  149. static u32 mlx4_alloc_mtt_range(struct mlx4_dev *dev, int order)
  150. {
  151. struct mlx4_mr_table *mr_table = &mlx4_priv(dev)->mr_table;
  152. u32 seg;
  153. seg = mlx4_buddy_alloc(&mr_table->mtt_buddy, order);
  154. if (seg == -1)
  155. return -1;
  156. if (mlx4_table_get_range(dev, &mr_table->mtt_table, seg,
  157. seg + (1 << order) - 1)) {
  158. mlx4_buddy_free(&mr_table->mtt_buddy, seg, order);
  159. return -1;
  160. }
  161. return seg;
  162. }
  163. int mlx4_mtt_init(struct mlx4_dev *dev, int npages, int page_shift,
  164. struct mlx4_mtt *mtt)
  165. {
  166. int i;
  167. if (!npages) {
  168. mtt->order = -1;
  169. mtt->page_shift = MLX4_ICM_PAGE_SHIFT;
  170. return 0;
  171. } else
  172. mtt->page_shift = page_shift;
  173. for (mtt->order = 0, i = MLX4_MTT_ENTRY_PER_SEG; i < npages; i <<= 1)
  174. ++mtt->order;
  175. mtt->first_seg = mlx4_alloc_mtt_range(dev, mtt->order);
  176. if (mtt->first_seg == -1)
  177. return -ENOMEM;
  178. return 0;
  179. }
  180. EXPORT_SYMBOL_GPL(mlx4_mtt_init);
  181. void mlx4_mtt_cleanup(struct mlx4_dev *dev, struct mlx4_mtt *mtt)
  182. {
  183. struct mlx4_mr_table *mr_table = &mlx4_priv(dev)->mr_table;
  184. if (mtt->order < 0)
  185. return;
  186. mlx4_buddy_free(&mr_table->mtt_buddy, mtt->first_seg, mtt->order);
  187. mlx4_table_put_range(dev, &mr_table->mtt_table, mtt->first_seg,
  188. mtt->first_seg + (1 << mtt->order) - 1);
  189. }
  190. EXPORT_SYMBOL_GPL(mlx4_mtt_cleanup);
  191. u64 mlx4_mtt_addr(struct mlx4_dev *dev, struct mlx4_mtt *mtt)
  192. {
  193. return (u64) mtt->first_seg * dev->caps.mtt_entry_sz;
  194. }
  195. EXPORT_SYMBOL_GPL(mlx4_mtt_addr);
  196. static u32 hw_index_to_key(u32 ind)
  197. {
  198. return (ind >> 24) | (ind << 8);
  199. }
  200. static u32 key_to_hw_index(u32 key)
  201. {
  202. return (key << 24) | (key >> 8);
  203. }
  204. static int mlx4_SW2HW_MPT(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  205. int mpt_index)
  206. {
  207. return mlx4_cmd(dev, mailbox->dma, mpt_index, 0, MLX4_CMD_SW2HW_MPT,
  208. MLX4_CMD_TIME_CLASS_B);
  209. }
  210. static int mlx4_HW2SW_MPT(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  211. int mpt_index)
  212. {
  213. return mlx4_cmd_box(dev, 0, mailbox ? mailbox->dma : 0, mpt_index,
  214. !mailbox, MLX4_CMD_HW2SW_MPT, MLX4_CMD_TIME_CLASS_B);
  215. }
  216. int mlx4_mr_alloc(struct mlx4_dev *dev, u32 pd, u64 iova, u64 size, u32 access,
  217. int npages, int page_shift, struct mlx4_mr *mr)
  218. {
  219. struct mlx4_priv *priv = mlx4_priv(dev);
  220. u32 index;
  221. int err;
  222. index = mlx4_bitmap_alloc(&priv->mr_table.mpt_bitmap);
  223. if (index == -1)
  224. return -ENOMEM;
  225. mr->iova = iova;
  226. mr->size = size;
  227. mr->pd = pd;
  228. mr->access = access;
  229. mr->enabled = 0;
  230. mr->key = hw_index_to_key(index);
  231. err = mlx4_mtt_init(dev, npages, page_shift, &mr->mtt);
  232. if (err)
  233. mlx4_bitmap_free(&priv->mr_table.mpt_bitmap, index);
  234. return err;
  235. }
  236. EXPORT_SYMBOL_GPL(mlx4_mr_alloc);
  237. void mlx4_mr_free(struct mlx4_dev *dev, struct mlx4_mr *mr)
  238. {
  239. struct mlx4_priv *priv = mlx4_priv(dev);
  240. int err;
  241. if (mr->enabled) {
  242. err = mlx4_HW2SW_MPT(dev, NULL,
  243. key_to_hw_index(mr->key) &
  244. (dev->caps.num_mpts - 1));
  245. if (err)
  246. mlx4_warn(dev, "HW2SW_MPT failed (%d)\n", err);
  247. }
  248. mlx4_mtt_cleanup(dev, &mr->mtt);
  249. mlx4_bitmap_free(&priv->mr_table.mpt_bitmap, key_to_hw_index(mr->key));
  250. }
  251. EXPORT_SYMBOL_GPL(mlx4_mr_free);
  252. int mlx4_mr_enable(struct mlx4_dev *dev, struct mlx4_mr *mr)
  253. {
  254. struct mlx4_mr_table *mr_table = &mlx4_priv(dev)->mr_table;
  255. struct mlx4_cmd_mailbox *mailbox;
  256. struct mlx4_mpt_entry *mpt_entry;
  257. int err;
  258. err = mlx4_table_get(dev, &mr_table->dmpt_table, key_to_hw_index(mr->key));
  259. if (err)
  260. return err;
  261. mailbox = mlx4_alloc_cmd_mailbox(dev);
  262. if (IS_ERR(mailbox)) {
  263. err = PTR_ERR(mailbox);
  264. goto err_table;
  265. }
  266. mpt_entry = mailbox->buf;
  267. memset(mpt_entry, 0, sizeof *mpt_entry);
  268. mpt_entry->flags = cpu_to_be32(MLX4_MPT_FLAG_MIO |
  269. MLX4_MPT_FLAG_REGION |
  270. mr->access);
  271. mpt_entry->key = cpu_to_be32(key_to_hw_index(mr->key));
  272. mpt_entry->pd_flags = cpu_to_be32(mr->pd | MLX4_MPT_PD_FLAG_EN_INV);
  273. mpt_entry->start = cpu_to_be64(mr->iova);
  274. mpt_entry->length = cpu_to_be64(mr->size);
  275. mpt_entry->entity_size = cpu_to_be32(mr->mtt.page_shift);
  276. if (mr->mtt.order < 0) {
  277. mpt_entry->flags |= cpu_to_be32(MLX4_MPT_FLAG_PHYSICAL);
  278. mpt_entry->mtt_seg = 0;
  279. } else {
  280. mpt_entry->mtt_seg = cpu_to_be64(mlx4_mtt_addr(dev, &mr->mtt));
  281. }
  282. if (mr->mtt.order >= 0 && mr->mtt.page_shift == 0) {
  283. /* fast register MR in free state */
  284. mpt_entry->flags |= cpu_to_be32(MLX4_MPT_FLAG_FREE);
  285. mpt_entry->pd_flags |= cpu_to_be32(MLX4_MPT_PD_FLAG_FAST_REG |
  286. MLX4_MPT_PD_FLAG_RAE);
  287. mpt_entry->mtt_sz = cpu_to_be32((1 << mr->mtt.order) *
  288. MLX4_MTT_ENTRY_PER_SEG);
  289. } else {
  290. mpt_entry->flags |= cpu_to_be32(MLX4_MPT_FLAG_SW_OWNS);
  291. }
  292. err = mlx4_SW2HW_MPT(dev, mailbox,
  293. key_to_hw_index(mr->key) & (dev->caps.num_mpts - 1));
  294. if (err) {
  295. mlx4_warn(dev, "SW2HW_MPT failed (%d)\n", err);
  296. goto err_cmd;
  297. }
  298. mr->enabled = 1;
  299. mlx4_free_cmd_mailbox(dev, mailbox);
  300. return 0;
  301. err_cmd:
  302. mlx4_free_cmd_mailbox(dev, mailbox);
  303. err_table:
  304. mlx4_table_put(dev, &mr_table->dmpt_table, key_to_hw_index(mr->key));
  305. return err;
  306. }
  307. EXPORT_SYMBOL_GPL(mlx4_mr_enable);
  308. static int mlx4_write_mtt_chunk(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  309. int start_index, int npages, u64 *page_list)
  310. {
  311. struct mlx4_priv *priv = mlx4_priv(dev);
  312. __be64 *mtts;
  313. dma_addr_t dma_handle;
  314. int i;
  315. int s = start_index * sizeof (u64);
  316. /* All MTTs must fit in the same page */
  317. if (start_index / (PAGE_SIZE / sizeof (u64)) !=
  318. (start_index + npages - 1) / (PAGE_SIZE / sizeof (u64)))
  319. return -EINVAL;
  320. if (start_index & (MLX4_MTT_ENTRY_PER_SEG - 1))
  321. return -EINVAL;
  322. mtts = mlx4_table_find(&priv->mr_table.mtt_table, mtt->first_seg +
  323. s / dev->caps.mtt_entry_sz, &dma_handle);
  324. if (!mtts)
  325. return -ENOMEM;
  326. for (i = 0; i < npages; ++i)
  327. mtts[i] = cpu_to_be64(page_list[i] | MLX4_MTT_FLAG_PRESENT);
  328. dma_sync_single(&dev->pdev->dev, dma_handle, npages * sizeof (u64), DMA_TO_DEVICE);
  329. return 0;
  330. }
  331. int mlx4_write_mtt(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  332. int start_index, int npages, u64 *page_list)
  333. {
  334. int chunk;
  335. int err;
  336. if (mtt->order < 0)
  337. return -EINVAL;
  338. while (npages > 0) {
  339. chunk = min_t(int, PAGE_SIZE / sizeof(u64), npages);
  340. err = mlx4_write_mtt_chunk(dev, mtt, start_index, chunk, page_list);
  341. if (err)
  342. return err;
  343. npages -= chunk;
  344. start_index += chunk;
  345. page_list += chunk;
  346. }
  347. return 0;
  348. }
  349. EXPORT_SYMBOL_GPL(mlx4_write_mtt);
  350. int mlx4_buf_write_mtt(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  351. struct mlx4_buf *buf)
  352. {
  353. u64 *page_list;
  354. int err;
  355. int i;
  356. page_list = kmalloc(buf->npages * sizeof *page_list, GFP_KERNEL);
  357. if (!page_list)
  358. return -ENOMEM;
  359. for (i = 0; i < buf->npages; ++i)
  360. if (buf->nbufs == 1)
  361. page_list[i] = buf->direct.map + (i << buf->page_shift);
  362. else
  363. page_list[i] = buf->page_list[i].map;
  364. err = mlx4_write_mtt(dev, mtt, 0, buf->npages, page_list);
  365. kfree(page_list);
  366. return err;
  367. }
  368. EXPORT_SYMBOL_GPL(mlx4_buf_write_mtt);
  369. int mlx4_init_mr_table(struct mlx4_dev *dev)
  370. {
  371. struct mlx4_mr_table *mr_table = &mlx4_priv(dev)->mr_table;
  372. int err;
  373. err = mlx4_bitmap_init(&mr_table->mpt_bitmap, dev->caps.num_mpts,
  374. ~0, dev->caps.reserved_mrws);
  375. if (err)
  376. return err;
  377. err = mlx4_buddy_init(&mr_table->mtt_buddy,
  378. ilog2(dev->caps.num_mtt_segs));
  379. if (err)
  380. goto err_buddy;
  381. if (dev->caps.reserved_mtts) {
  382. if (mlx4_alloc_mtt_range(dev, fls(dev->caps.reserved_mtts - 1)) == -1) {
  383. mlx4_warn(dev, "MTT table of order %d is too small.\n",
  384. mr_table->mtt_buddy.max_order);
  385. err = -ENOMEM;
  386. goto err_reserve_mtts;
  387. }
  388. }
  389. return 0;
  390. err_reserve_mtts:
  391. mlx4_buddy_cleanup(&mr_table->mtt_buddy);
  392. err_buddy:
  393. mlx4_bitmap_cleanup(&mr_table->mpt_bitmap);
  394. return err;
  395. }
  396. void mlx4_cleanup_mr_table(struct mlx4_dev *dev)
  397. {
  398. struct mlx4_mr_table *mr_table = &mlx4_priv(dev)->mr_table;
  399. mlx4_buddy_cleanup(&mr_table->mtt_buddy);
  400. mlx4_bitmap_cleanup(&mr_table->mpt_bitmap);
  401. }
  402. static inline int mlx4_check_fmr(struct mlx4_fmr *fmr, u64 *page_list,
  403. int npages, u64 iova)
  404. {
  405. int i, page_mask;
  406. if (npages > fmr->max_pages)
  407. return -EINVAL;
  408. page_mask = (1 << fmr->page_shift) - 1;
  409. /* We are getting page lists, so va must be page aligned. */
  410. if (iova & page_mask)
  411. return -EINVAL;
  412. /* Trust the user not to pass misaligned data in page_list */
  413. if (0)
  414. for (i = 0; i < npages; ++i) {
  415. if (page_list[i] & ~page_mask)
  416. return -EINVAL;
  417. }
  418. if (fmr->maps >= fmr->max_maps)
  419. return -EINVAL;
  420. return 0;
  421. }
  422. int mlx4_map_phys_fmr(struct mlx4_dev *dev, struct mlx4_fmr *fmr, u64 *page_list,
  423. int npages, u64 iova, u32 *lkey, u32 *rkey)
  424. {
  425. u32 key;
  426. int i, err;
  427. err = mlx4_check_fmr(fmr, page_list, npages, iova);
  428. if (err)
  429. return err;
  430. ++fmr->maps;
  431. key = key_to_hw_index(fmr->mr.key);
  432. key += dev->caps.num_mpts;
  433. *lkey = *rkey = fmr->mr.key = hw_index_to_key(key);
  434. *(u8 *) fmr->mpt = MLX4_MPT_STATUS_SW;
  435. /* Make sure MPT status is visible before writing MTT entries */
  436. wmb();
  437. for (i = 0; i < npages; ++i)
  438. fmr->mtts[i] = cpu_to_be64(page_list[i] | MLX4_MTT_FLAG_PRESENT);
  439. dma_sync_single(&dev->pdev->dev, fmr->dma_handle,
  440. npages * sizeof(u64), DMA_TO_DEVICE);
  441. fmr->mpt->key = cpu_to_be32(key);
  442. fmr->mpt->lkey = cpu_to_be32(key);
  443. fmr->mpt->length = cpu_to_be64(npages * (1ull << fmr->page_shift));
  444. fmr->mpt->start = cpu_to_be64(iova);
  445. /* Make MTT entries are visible before setting MPT status */
  446. wmb();
  447. *(u8 *) fmr->mpt = MLX4_MPT_STATUS_HW;
  448. /* Make sure MPT status is visible before consumer can use FMR */
  449. wmb();
  450. return 0;
  451. }
  452. EXPORT_SYMBOL_GPL(mlx4_map_phys_fmr);
  453. int mlx4_fmr_alloc(struct mlx4_dev *dev, u32 pd, u32 access, int max_pages,
  454. int max_maps, u8 page_shift, struct mlx4_fmr *fmr)
  455. {
  456. struct mlx4_priv *priv = mlx4_priv(dev);
  457. u64 mtt_seg;
  458. int err = -ENOMEM;
  459. if (page_shift < (ffs(dev->caps.page_size_cap) - 1) || page_shift >= 32)
  460. return -EINVAL;
  461. /* All MTTs must fit in the same page */
  462. if (max_pages * sizeof *fmr->mtts > PAGE_SIZE)
  463. return -EINVAL;
  464. fmr->page_shift = page_shift;
  465. fmr->max_pages = max_pages;
  466. fmr->max_maps = max_maps;
  467. fmr->maps = 0;
  468. err = mlx4_mr_alloc(dev, pd, 0, 0, access, max_pages,
  469. page_shift, &fmr->mr);
  470. if (err)
  471. return err;
  472. mtt_seg = fmr->mr.mtt.first_seg * dev->caps.mtt_entry_sz;
  473. fmr->mtts = mlx4_table_find(&priv->mr_table.mtt_table,
  474. fmr->mr.mtt.first_seg,
  475. &fmr->dma_handle);
  476. if (!fmr->mtts) {
  477. err = -ENOMEM;
  478. goto err_free;
  479. }
  480. return 0;
  481. err_free:
  482. mlx4_mr_free(dev, &fmr->mr);
  483. return err;
  484. }
  485. EXPORT_SYMBOL_GPL(mlx4_fmr_alloc);
  486. int mlx4_fmr_enable(struct mlx4_dev *dev, struct mlx4_fmr *fmr)
  487. {
  488. struct mlx4_priv *priv = mlx4_priv(dev);
  489. int err;
  490. err = mlx4_mr_enable(dev, &fmr->mr);
  491. if (err)
  492. return err;
  493. fmr->mpt = mlx4_table_find(&priv->mr_table.dmpt_table,
  494. key_to_hw_index(fmr->mr.key), NULL);
  495. if (!fmr->mpt)
  496. return -ENOMEM;
  497. return 0;
  498. }
  499. EXPORT_SYMBOL_GPL(mlx4_fmr_enable);
  500. void mlx4_fmr_unmap(struct mlx4_dev *dev, struct mlx4_fmr *fmr,
  501. u32 *lkey, u32 *rkey)
  502. {
  503. if (!fmr->maps)
  504. return;
  505. fmr->maps = 0;
  506. *(u8 *) fmr->mpt = MLX4_MPT_STATUS_SW;
  507. }
  508. EXPORT_SYMBOL_GPL(mlx4_fmr_unmap);
  509. int mlx4_fmr_free(struct mlx4_dev *dev, struct mlx4_fmr *fmr)
  510. {
  511. if (fmr->maps)
  512. return -EBUSY;
  513. fmr->mr.enabled = 0;
  514. mlx4_mr_free(dev, &fmr->mr);
  515. return 0;
  516. }
  517. EXPORT_SYMBOL_GPL(mlx4_fmr_free);
  518. int mlx4_SYNC_TPT(struct mlx4_dev *dev)
  519. {
  520. return mlx4_cmd(dev, 0, 0, 0, MLX4_CMD_SYNC_TPT, 1000);
  521. }
  522. EXPORT_SYMBOL_GPL(mlx4_SYNC_TPT);