mr.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645
  1. /*
  2. * Copyright (c) 2004 Topspin Communications. All rights reserved.
  3. * Copyright (c) 2005 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;
  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_MIO (1 << 17)
  60. #define MLX4_MPT_FLAG_BIND_ENABLE (1 << 15)
  61. #define MLX4_MPT_FLAG_PHYSICAL (1 << 9)
  62. #define MLX4_MPT_FLAG_REGION (1 << 8)
  63. #define MLX4_MTT_FLAG_PRESENT 1
  64. #define MLX4_MPT_STATUS_SW 0xF0
  65. #define MLX4_MPT_STATUS_HW 0x00
  66. static u32 mlx4_buddy_alloc(struct mlx4_buddy *buddy, int order)
  67. {
  68. int o;
  69. int m;
  70. u32 seg;
  71. spin_lock(&buddy->lock);
  72. for (o = order; o <= buddy->max_order; ++o)
  73. if (buddy->num_free[o]) {
  74. m = 1 << (buddy->max_order - o);
  75. seg = find_first_bit(buddy->bits[o], m);
  76. if (seg < m)
  77. goto found;
  78. }
  79. spin_unlock(&buddy->lock);
  80. return -1;
  81. found:
  82. clear_bit(seg, buddy->bits[o]);
  83. --buddy->num_free[o];
  84. while (o > order) {
  85. --o;
  86. seg <<= 1;
  87. set_bit(seg ^ 1, buddy->bits[o]);
  88. ++buddy->num_free[o];
  89. }
  90. spin_unlock(&buddy->lock);
  91. seg <<= order;
  92. return seg;
  93. }
  94. static void mlx4_buddy_free(struct mlx4_buddy *buddy, u32 seg, int order)
  95. {
  96. seg >>= order;
  97. spin_lock(&buddy->lock);
  98. while (test_bit(seg ^ 1, buddy->bits[order])) {
  99. clear_bit(seg ^ 1, buddy->bits[order]);
  100. --buddy->num_free[order];
  101. seg >>= 1;
  102. ++order;
  103. }
  104. set_bit(seg, buddy->bits[order]);
  105. ++buddy->num_free[order];
  106. spin_unlock(&buddy->lock);
  107. }
  108. static int mlx4_buddy_init(struct mlx4_buddy *buddy, int max_order)
  109. {
  110. int i, s;
  111. buddy->max_order = max_order;
  112. spin_lock_init(&buddy->lock);
  113. buddy->bits = kzalloc((buddy->max_order + 1) * sizeof (long *),
  114. GFP_KERNEL);
  115. buddy->num_free = kzalloc((buddy->max_order + 1) * sizeof (int *),
  116. GFP_KERNEL);
  117. if (!buddy->bits || !buddy->num_free)
  118. goto err_out;
  119. for (i = 0; i <= buddy->max_order; ++i) {
  120. s = BITS_TO_LONGS(1 << (buddy->max_order - i));
  121. buddy->bits[i] = kmalloc(s * sizeof (long), GFP_KERNEL);
  122. if (!buddy->bits[i])
  123. goto err_out_free;
  124. bitmap_zero(buddy->bits[i], 1 << (buddy->max_order - i));
  125. }
  126. set_bit(0, buddy->bits[buddy->max_order]);
  127. buddy->num_free[buddy->max_order] = 1;
  128. return 0;
  129. err_out_free:
  130. for (i = 0; i <= buddy->max_order; ++i)
  131. kfree(buddy->bits[i]);
  132. err_out:
  133. kfree(buddy->bits);
  134. kfree(buddy->num_free);
  135. return -ENOMEM;
  136. }
  137. static void mlx4_buddy_cleanup(struct mlx4_buddy *buddy)
  138. {
  139. int i;
  140. for (i = 0; i <= buddy->max_order; ++i)
  141. kfree(buddy->bits[i]);
  142. kfree(buddy->bits);
  143. kfree(buddy->num_free);
  144. }
  145. static u32 mlx4_alloc_mtt_range(struct mlx4_dev *dev, int order)
  146. {
  147. struct mlx4_mr_table *mr_table = &mlx4_priv(dev)->mr_table;
  148. u32 seg;
  149. seg = mlx4_buddy_alloc(&mr_table->mtt_buddy, order);
  150. if (seg == -1)
  151. return -1;
  152. if (mlx4_table_get_range(dev, &mr_table->mtt_table, seg,
  153. seg + (1 << order) - 1)) {
  154. mlx4_buddy_free(&mr_table->mtt_buddy, seg, order);
  155. return -1;
  156. }
  157. return seg;
  158. }
  159. int mlx4_mtt_init(struct mlx4_dev *dev, int npages, int page_shift,
  160. struct mlx4_mtt *mtt)
  161. {
  162. int i;
  163. if (!npages) {
  164. mtt->order = -1;
  165. mtt->page_shift = MLX4_ICM_PAGE_SHIFT;
  166. return 0;
  167. } else
  168. mtt->page_shift = page_shift;
  169. for (mtt->order = 0, i = MLX4_MTT_ENTRY_PER_SEG; i < npages; i <<= 1)
  170. ++mtt->order;
  171. mtt->first_seg = mlx4_alloc_mtt_range(dev, mtt->order);
  172. if (mtt->first_seg == -1)
  173. return -ENOMEM;
  174. return 0;
  175. }
  176. EXPORT_SYMBOL_GPL(mlx4_mtt_init);
  177. void mlx4_mtt_cleanup(struct mlx4_dev *dev, struct mlx4_mtt *mtt)
  178. {
  179. struct mlx4_mr_table *mr_table = &mlx4_priv(dev)->mr_table;
  180. if (mtt->order < 0)
  181. return;
  182. mlx4_buddy_free(&mr_table->mtt_buddy, mtt->first_seg, mtt->order);
  183. mlx4_table_put_range(dev, &mr_table->mtt_table, mtt->first_seg,
  184. mtt->first_seg + (1 << mtt->order) - 1);
  185. }
  186. EXPORT_SYMBOL_GPL(mlx4_mtt_cleanup);
  187. u64 mlx4_mtt_addr(struct mlx4_dev *dev, struct mlx4_mtt *mtt)
  188. {
  189. return (u64) mtt->first_seg * dev->caps.mtt_entry_sz;
  190. }
  191. EXPORT_SYMBOL_GPL(mlx4_mtt_addr);
  192. static u32 hw_index_to_key(u32 ind)
  193. {
  194. return (ind >> 24) | (ind << 8);
  195. }
  196. static u32 key_to_hw_index(u32 key)
  197. {
  198. return (key << 24) | (key >> 8);
  199. }
  200. static int mlx4_SW2HW_MPT(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  201. int mpt_index)
  202. {
  203. return mlx4_cmd(dev, mailbox->dma, mpt_index, 0, MLX4_CMD_SW2HW_MPT,
  204. MLX4_CMD_TIME_CLASS_B);
  205. }
  206. static int mlx4_HW2SW_MPT(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  207. int mpt_index)
  208. {
  209. return mlx4_cmd_box(dev, 0, mailbox ? mailbox->dma : 0, mpt_index,
  210. !mailbox, MLX4_CMD_HW2SW_MPT, MLX4_CMD_TIME_CLASS_B);
  211. }
  212. int mlx4_mr_alloc(struct mlx4_dev *dev, u32 pd, u64 iova, u64 size, u32 access,
  213. int npages, int page_shift, struct mlx4_mr *mr)
  214. {
  215. struct mlx4_priv *priv = mlx4_priv(dev);
  216. u32 index;
  217. int err;
  218. index = mlx4_bitmap_alloc(&priv->mr_table.mpt_bitmap);
  219. if (index == -1)
  220. return -ENOMEM;
  221. mr->iova = iova;
  222. mr->size = size;
  223. mr->pd = pd;
  224. mr->access = access;
  225. mr->enabled = 0;
  226. mr->key = hw_index_to_key(index);
  227. err = mlx4_mtt_init(dev, npages, page_shift, &mr->mtt);
  228. if (err)
  229. mlx4_bitmap_free(&priv->mr_table.mpt_bitmap, index);
  230. return err;
  231. }
  232. EXPORT_SYMBOL_GPL(mlx4_mr_alloc);
  233. void mlx4_mr_free(struct mlx4_dev *dev, struct mlx4_mr *mr)
  234. {
  235. struct mlx4_priv *priv = mlx4_priv(dev);
  236. int err;
  237. if (mr->enabled) {
  238. err = mlx4_HW2SW_MPT(dev, NULL,
  239. key_to_hw_index(mr->key) &
  240. (dev->caps.num_mpts - 1));
  241. if (err)
  242. mlx4_warn(dev, "HW2SW_MPT failed (%d)\n", err);
  243. }
  244. mlx4_mtt_cleanup(dev, &mr->mtt);
  245. mlx4_bitmap_free(&priv->mr_table.mpt_bitmap, key_to_hw_index(mr->key));
  246. }
  247. EXPORT_SYMBOL_GPL(mlx4_mr_free);
  248. int mlx4_mr_enable(struct mlx4_dev *dev, struct mlx4_mr *mr)
  249. {
  250. struct mlx4_mr_table *mr_table = &mlx4_priv(dev)->mr_table;
  251. struct mlx4_cmd_mailbox *mailbox;
  252. struct mlx4_mpt_entry *mpt_entry;
  253. int err;
  254. err = mlx4_table_get(dev, &mr_table->dmpt_table, key_to_hw_index(mr->key));
  255. if (err)
  256. return err;
  257. mailbox = mlx4_alloc_cmd_mailbox(dev);
  258. if (IS_ERR(mailbox)) {
  259. err = PTR_ERR(mailbox);
  260. goto err_table;
  261. }
  262. mpt_entry = mailbox->buf;
  263. memset(mpt_entry, 0, sizeof *mpt_entry);
  264. mpt_entry->flags = cpu_to_be32(MLX4_MPT_FLAG_SW_OWNS |
  265. MLX4_MPT_FLAG_MIO |
  266. MLX4_MPT_FLAG_REGION |
  267. mr->access);
  268. mpt_entry->key = cpu_to_be32(key_to_hw_index(mr->key));
  269. mpt_entry->pd = cpu_to_be32(mr->pd);
  270. mpt_entry->start = cpu_to_be64(mr->iova);
  271. mpt_entry->length = cpu_to_be64(mr->size);
  272. mpt_entry->entity_size = cpu_to_be32(mr->mtt.page_shift);
  273. if (mr->mtt.order < 0) {
  274. mpt_entry->flags |= cpu_to_be32(MLX4_MPT_FLAG_PHYSICAL);
  275. mpt_entry->mtt_seg = 0;
  276. } else
  277. mpt_entry->mtt_seg = cpu_to_be64(mlx4_mtt_addr(dev, &mr->mtt));
  278. err = mlx4_SW2HW_MPT(dev, mailbox,
  279. key_to_hw_index(mr->key) & (dev->caps.num_mpts - 1));
  280. if (err) {
  281. mlx4_warn(dev, "SW2HW_MPT failed (%d)\n", err);
  282. goto err_cmd;
  283. }
  284. mr->enabled = 1;
  285. mlx4_free_cmd_mailbox(dev, mailbox);
  286. return 0;
  287. err_cmd:
  288. mlx4_free_cmd_mailbox(dev, mailbox);
  289. err_table:
  290. mlx4_table_put(dev, &mr_table->dmpt_table, key_to_hw_index(mr->key));
  291. return err;
  292. }
  293. EXPORT_SYMBOL_GPL(mlx4_mr_enable);
  294. static int mlx4_write_mtt_chunk(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  295. int start_index, int npages, u64 *page_list)
  296. {
  297. struct mlx4_priv *priv = mlx4_priv(dev);
  298. __be64 *mtts;
  299. dma_addr_t dma_handle;
  300. int i;
  301. int s = start_index * sizeof (u64);
  302. /* All MTTs must fit in the same page */
  303. if (start_index / (PAGE_SIZE / sizeof (u64)) !=
  304. (start_index + npages - 1) / (PAGE_SIZE / sizeof (u64)))
  305. return -EINVAL;
  306. if (start_index & (MLX4_MTT_ENTRY_PER_SEG - 1))
  307. return -EINVAL;
  308. mtts = mlx4_table_find(&priv->mr_table.mtt_table, mtt->first_seg +
  309. s / dev->caps.mtt_entry_sz, &dma_handle);
  310. if (!mtts)
  311. return -ENOMEM;
  312. for (i = 0; i < npages; ++i)
  313. mtts[i] = cpu_to_be64(page_list[i] | MLX4_MTT_FLAG_PRESENT);
  314. dma_sync_single(&dev->pdev->dev, dma_handle, npages * sizeof (u64), DMA_TO_DEVICE);
  315. return 0;
  316. }
  317. int mlx4_write_mtt(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  318. int start_index, int npages, u64 *page_list)
  319. {
  320. int chunk;
  321. int err;
  322. if (mtt->order < 0)
  323. return -EINVAL;
  324. while (npages > 0) {
  325. chunk = min_t(int, PAGE_SIZE / sizeof(u64), npages);
  326. err = mlx4_write_mtt_chunk(dev, mtt, start_index, chunk, page_list);
  327. if (err)
  328. return err;
  329. npages -= chunk;
  330. start_index += chunk;
  331. page_list += chunk;
  332. }
  333. return 0;
  334. }
  335. EXPORT_SYMBOL_GPL(mlx4_write_mtt);
  336. int mlx4_buf_write_mtt(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  337. struct mlx4_buf *buf)
  338. {
  339. u64 *page_list;
  340. int err;
  341. int i;
  342. page_list = kmalloc(buf->npages * sizeof *page_list, GFP_KERNEL);
  343. if (!page_list)
  344. return -ENOMEM;
  345. for (i = 0; i < buf->npages; ++i)
  346. if (buf->nbufs == 1)
  347. page_list[i] = buf->direct.map + (i << buf->page_shift);
  348. else
  349. page_list[i] = buf->page_list[i].map;
  350. err = mlx4_write_mtt(dev, mtt, 0, buf->npages, page_list);
  351. kfree(page_list);
  352. return err;
  353. }
  354. EXPORT_SYMBOL_GPL(mlx4_buf_write_mtt);
  355. int mlx4_init_mr_table(struct mlx4_dev *dev)
  356. {
  357. struct mlx4_mr_table *mr_table = &mlx4_priv(dev)->mr_table;
  358. int err;
  359. err = mlx4_bitmap_init(&mr_table->mpt_bitmap, dev->caps.num_mpts,
  360. ~0, dev->caps.reserved_mrws);
  361. if (err)
  362. return err;
  363. err = mlx4_buddy_init(&mr_table->mtt_buddy,
  364. ilog2(dev->caps.num_mtt_segs));
  365. if (err)
  366. goto err_buddy;
  367. if (dev->caps.reserved_mtts) {
  368. if (mlx4_alloc_mtt_range(dev, fls(dev->caps.reserved_mtts - 1)) == -1) {
  369. mlx4_warn(dev, "MTT table of order %d is too small.\n",
  370. mr_table->mtt_buddy.max_order);
  371. err = -ENOMEM;
  372. goto err_reserve_mtts;
  373. }
  374. }
  375. return 0;
  376. err_reserve_mtts:
  377. mlx4_buddy_cleanup(&mr_table->mtt_buddy);
  378. err_buddy:
  379. mlx4_bitmap_cleanup(&mr_table->mpt_bitmap);
  380. return err;
  381. }
  382. void mlx4_cleanup_mr_table(struct mlx4_dev *dev)
  383. {
  384. struct mlx4_mr_table *mr_table = &mlx4_priv(dev)->mr_table;
  385. mlx4_buddy_cleanup(&mr_table->mtt_buddy);
  386. mlx4_bitmap_cleanup(&mr_table->mpt_bitmap);
  387. }
  388. static inline int mlx4_check_fmr(struct mlx4_fmr *fmr, u64 *page_list,
  389. int npages, u64 iova)
  390. {
  391. int i, page_mask;
  392. if (npages > fmr->max_pages)
  393. return -EINVAL;
  394. page_mask = (1 << fmr->page_shift) - 1;
  395. /* We are getting page lists, so va must be page aligned. */
  396. if (iova & page_mask)
  397. return -EINVAL;
  398. /* Trust the user not to pass misaligned data in page_list */
  399. if (0)
  400. for (i = 0; i < npages; ++i) {
  401. if (page_list[i] & ~page_mask)
  402. return -EINVAL;
  403. }
  404. if (fmr->maps >= fmr->max_maps)
  405. return -EINVAL;
  406. return 0;
  407. }
  408. int mlx4_map_phys_fmr(struct mlx4_dev *dev, struct mlx4_fmr *fmr, u64 *page_list,
  409. int npages, u64 iova, u32 *lkey, u32 *rkey)
  410. {
  411. u32 key;
  412. int i, err;
  413. err = mlx4_check_fmr(fmr, page_list, npages, iova);
  414. if (err)
  415. return err;
  416. ++fmr->maps;
  417. key = key_to_hw_index(fmr->mr.key);
  418. key += dev->caps.num_mpts;
  419. *lkey = *rkey = fmr->mr.key = hw_index_to_key(key);
  420. *(u8 *) fmr->mpt = MLX4_MPT_STATUS_SW;
  421. /* Make sure MPT status is visible before writing MTT entries */
  422. wmb();
  423. for (i = 0; i < npages; ++i)
  424. fmr->mtts[i] = cpu_to_be64(page_list[i] | MLX4_MTT_FLAG_PRESENT);
  425. dma_sync_single(&dev->pdev->dev, fmr->dma_handle,
  426. npages * sizeof(u64), DMA_TO_DEVICE);
  427. fmr->mpt->key = cpu_to_be32(key);
  428. fmr->mpt->lkey = cpu_to_be32(key);
  429. fmr->mpt->length = cpu_to_be64(npages * (1ull << fmr->page_shift));
  430. fmr->mpt->start = cpu_to_be64(iova);
  431. /* Make MTT entries are visible before setting MPT status */
  432. wmb();
  433. *(u8 *) fmr->mpt = MLX4_MPT_STATUS_HW;
  434. /* Make sure MPT status is visible before consumer can use FMR */
  435. wmb();
  436. return 0;
  437. }
  438. EXPORT_SYMBOL_GPL(mlx4_map_phys_fmr);
  439. int mlx4_fmr_alloc(struct mlx4_dev *dev, u32 pd, u32 access, int max_pages,
  440. int max_maps, u8 page_shift, struct mlx4_fmr *fmr)
  441. {
  442. struct mlx4_priv *priv = mlx4_priv(dev);
  443. u64 mtt_seg;
  444. int err = -ENOMEM;
  445. if (page_shift < (ffs(dev->caps.page_size_cap) - 1) || page_shift >= 32)
  446. return -EINVAL;
  447. /* All MTTs must fit in the same page */
  448. if (max_pages * sizeof *fmr->mtts > PAGE_SIZE)
  449. return -EINVAL;
  450. fmr->page_shift = page_shift;
  451. fmr->max_pages = max_pages;
  452. fmr->max_maps = max_maps;
  453. fmr->maps = 0;
  454. err = mlx4_mr_alloc(dev, pd, 0, 0, access, max_pages,
  455. page_shift, &fmr->mr);
  456. if (err)
  457. return err;
  458. mtt_seg = fmr->mr.mtt.first_seg * dev->caps.mtt_entry_sz;
  459. fmr->mtts = mlx4_table_find(&priv->mr_table.mtt_table,
  460. fmr->mr.mtt.first_seg,
  461. &fmr->dma_handle);
  462. if (!fmr->mtts) {
  463. err = -ENOMEM;
  464. goto err_free;
  465. }
  466. return 0;
  467. err_free:
  468. mlx4_mr_free(dev, &fmr->mr);
  469. return err;
  470. }
  471. EXPORT_SYMBOL_GPL(mlx4_fmr_alloc);
  472. int mlx4_fmr_enable(struct mlx4_dev *dev, struct mlx4_fmr *fmr)
  473. {
  474. struct mlx4_priv *priv = mlx4_priv(dev);
  475. int err;
  476. err = mlx4_mr_enable(dev, &fmr->mr);
  477. if (err)
  478. return err;
  479. fmr->mpt = mlx4_table_find(&priv->mr_table.dmpt_table,
  480. key_to_hw_index(fmr->mr.key), NULL);
  481. if (!fmr->mpt)
  482. return -ENOMEM;
  483. return 0;
  484. }
  485. EXPORT_SYMBOL_GPL(mlx4_fmr_enable);
  486. void mlx4_fmr_unmap(struct mlx4_dev *dev, struct mlx4_fmr *fmr,
  487. u32 *lkey, u32 *rkey)
  488. {
  489. if (!fmr->maps)
  490. return;
  491. fmr->maps = 0;
  492. *(u8 *) fmr->mpt = MLX4_MPT_STATUS_SW;
  493. }
  494. EXPORT_SYMBOL_GPL(mlx4_fmr_unmap);
  495. int mlx4_fmr_free(struct mlx4_dev *dev, struct mlx4_fmr *fmr)
  496. {
  497. if (fmr->maps)
  498. return -EBUSY;
  499. fmr->mr.enabled = 0;
  500. mlx4_mr_free(dev, &fmr->mr);
  501. return 0;
  502. }
  503. EXPORT_SYMBOL_GPL(mlx4_fmr_free);
  504. int mlx4_SYNC_TPT(struct mlx4_dev *dev)
  505. {
  506. return mlx4_cmd(dev, 0, 0, 0, MLX4_CMD_SYNC_TPT, 1000);
  507. }
  508. EXPORT_SYMBOL_GPL(mlx4_SYNC_TPT);