mthca_mr.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702
  1. /*
  2. * Copyright (c) 2004 Topspin Communications. All rights reserved.
  3. * Copyright (c) 2005 Mellanox Technologies. All rights reserved.
  4. *
  5. * This software is available to you under a choice of one of two
  6. * licenses. You may choose to be licensed under the terms of the GNU
  7. * General Public License (GPL) Version 2, available from the file
  8. * COPYING in the main directory of this source tree, or the
  9. * OpenIB.org BSD license below:
  10. *
  11. * Redistribution and use in source and binary forms, with or
  12. * without modification, are permitted provided that the following
  13. * conditions are met:
  14. *
  15. * - Redistributions of source code must retain the above
  16. * copyright notice, this list of conditions and the following
  17. * disclaimer.
  18. *
  19. * - Redistributions in binary form must reproduce the above
  20. * copyright notice, this list of conditions and the following
  21. * disclaimer in the documentation and/or other materials
  22. * provided with the distribution.
  23. *
  24. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  25. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  26. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  27. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  28. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  29. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  30. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  31. * SOFTWARE.
  32. */
  33. #include <linux/slab.h>
  34. #include <linux/errno.h>
  35. #include "mthca_dev.h"
  36. #include "mthca_cmd.h"
  37. #include "mthca_memfree.h"
  38. struct mthca_mtt {
  39. struct mthca_buddy *buddy;
  40. int order;
  41. u32 first_seg;
  42. };
  43. /*
  44. * Must be packed because mtt_seg is 64 bits but only aligned to 32 bits.
  45. */
  46. struct mthca_mpt_entry {
  47. __be32 flags;
  48. __be32 page_size;
  49. __be32 key;
  50. __be32 pd;
  51. __be64 start;
  52. __be64 length;
  53. __be32 lkey;
  54. __be32 window_count;
  55. __be32 window_count_limit;
  56. __be64 mtt_seg;
  57. __be32 mtt_sz; /* Arbel only */
  58. u32 reserved[2];
  59. } __packed;
  60. #define MTHCA_MPT_FLAG_SW_OWNS (0xfUL << 28)
  61. #define MTHCA_MPT_FLAG_MIO (1 << 17)
  62. #define MTHCA_MPT_FLAG_BIND_ENABLE (1 << 15)
  63. #define MTHCA_MPT_FLAG_PHYSICAL (1 << 9)
  64. #define MTHCA_MPT_FLAG_REGION (1 << 8)
  65. #define MTHCA_MTT_FLAG_PRESENT 1
  66. #define MTHCA_MPT_STATUS_SW 0xF0
  67. #define MTHCA_MPT_STATUS_HW 0x00
  68. #define SINAI_FMR_KEY_INC 0x1000000
  69. /*
  70. * Buddy allocator for MTT segments (currently not very efficient
  71. * since it doesn't keep a free list and just searches linearly
  72. * through the bitmaps)
  73. */
  74. static u32 mthca_buddy_alloc(struct mthca_buddy *buddy, int order)
  75. {
  76. int o;
  77. int m;
  78. u32 seg;
  79. spin_lock(&buddy->lock);
  80. for (o = order; o <= buddy->max_order; ++o)
  81. if (buddy->num_free[o]) {
  82. m = 1 << (buddy->max_order - o);
  83. seg = find_first_bit(buddy->bits[o], m);
  84. if (seg < m)
  85. goto found;
  86. }
  87. spin_unlock(&buddy->lock);
  88. return -1;
  89. found:
  90. __clear_bit(seg, buddy->bits[o]);
  91. --buddy->num_free[o];
  92. while (o > order) {
  93. --o;
  94. seg <<= 1;
  95. __set_bit(seg ^ 1, buddy->bits[o]);
  96. ++buddy->num_free[o];
  97. }
  98. spin_unlock(&buddy->lock);
  99. seg <<= order;
  100. return seg;
  101. }
  102. static void mthca_buddy_free(struct mthca_buddy *buddy, u32 seg, int order)
  103. {
  104. seg >>= order;
  105. spin_lock(&buddy->lock);
  106. while (test_bit(seg ^ 1, buddy->bits[order])) {
  107. __clear_bit(seg ^ 1, buddy->bits[order]);
  108. --buddy->num_free[order];
  109. seg >>= 1;
  110. ++order;
  111. }
  112. __set_bit(seg, buddy->bits[order]);
  113. ++buddy->num_free[order];
  114. spin_unlock(&buddy->lock);
  115. }
  116. static int mthca_buddy_init(struct mthca_buddy *buddy, int max_order)
  117. {
  118. int i;
  119. buddy->max_order = max_order;
  120. spin_lock_init(&buddy->lock);
  121. buddy->bits = kcalloc(buddy->max_order + 1, sizeof(long *),
  122. GFP_KERNEL);
  123. buddy->num_free = kcalloc((buddy->max_order + 1), sizeof *buddy->num_free,
  124. GFP_KERNEL);
  125. if (!buddy->bits || !buddy->num_free)
  126. goto err_out;
  127. for (i = 0; i <= buddy->max_order; ++i) {
  128. buddy->bits[i] = bitmap_zalloc(1 << (buddy->max_order - i),
  129. GFP_KERNEL);
  130. if (!buddy->bits[i])
  131. goto err_out_free;
  132. }
  133. __set_bit(0, buddy->bits[buddy->max_order]);
  134. buddy->num_free[buddy->max_order] = 1;
  135. return 0;
  136. err_out_free:
  137. for (i = 0; i <= buddy->max_order; ++i)
  138. bitmap_free(buddy->bits[i]);
  139. err_out:
  140. kfree(buddy->bits);
  141. kfree(buddy->num_free);
  142. return -ENOMEM;
  143. }
  144. static void mthca_buddy_cleanup(struct mthca_buddy *buddy)
  145. {
  146. int i;
  147. for (i = 0; i <= buddy->max_order; ++i)
  148. bitmap_free(buddy->bits[i]);
  149. kfree(buddy->bits);
  150. kfree(buddy->num_free);
  151. }
  152. static u32 mthca_alloc_mtt_range(struct mthca_dev *dev, int order,
  153. struct mthca_buddy *buddy)
  154. {
  155. u32 seg = mthca_buddy_alloc(buddy, order);
  156. if (seg == -1)
  157. return -1;
  158. if (mthca_is_memfree(dev))
  159. if (mthca_table_get_range(dev, dev->mr_table.mtt_table, seg,
  160. seg + (1 << order) - 1)) {
  161. mthca_buddy_free(buddy, seg, order);
  162. seg = -1;
  163. }
  164. return seg;
  165. }
  166. static struct mthca_mtt *__mthca_alloc_mtt(struct mthca_dev *dev, int size,
  167. struct mthca_buddy *buddy)
  168. {
  169. struct mthca_mtt *mtt;
  170. int i;
  171. if (size <= 0)
  172. return ERR_PTR(-EINVAL);
  173. mtt = kmalloc(sizeof *mtt, GFP_KERNEL);
  174. if (!mtt)
  175. return ERR_PTR(-ENOMEM);
  176. mtt->buddy = buddy;
  177. mtt->order = 0;
  178. for (i = dev->limits.mtt_seg_size / 8; i < size; i <<= 1)
  179. ++mtt->order;
  180. mtt->first_seg = mthca_alloc_mtt_range(dev, mtt->order, buddy);
  181. if (mtt->first_seg == -1) {
  182. kfree(mtt);
  183. return ERR_PTR(-ENOMEM);
  184. }
  185. return mtt;
  186. }
  187. struct mthca_mtt *mthca_alloc_mtt(struct mthca_dev *dev, int size)
  188. {
  189. return __mthca_alloc_mtt(dev, size, &dev->mr_table.mtt_buddy);
  190. }
  191. void mthca_free_mtt(struct mthca_dev *dev, struct mthca_mtt *mtt)
  192. {
  193. if (!mtt)
  194. return;
  195. mthca_buddy_free(mtt->buddy, mtt->first_seg, mtt->order);
  196. mthca_table_put_range(dev, dev->mr_table.mtt_table,
  197. mtt->first_seg,
  198. mtt->first_seg + (1 << mtt->order) - 1);
  199. kfree(mtt);
  200. }
  201. static int __mthca_write_mtt(struct mthca_dev *dev, struct mthca_mtt *mtt,
  202. int start_index, u64 *buffer_list, int list_len)
  203. {
  204. struct mthca_mailbox *mailbox;
  205. __be64 *mtt_entry;
  206. int err = 0;
  207. int i;
  208. mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
  209. if (IS_ERR(mailbox))
  210. return PTR_ERR(mailbox);
  211. mtt_entry = mailbox->buf;
  212. while (list_len > 0) {
  213. mtt_entry[0] = cpu_to_be64(dev->mr_table.mtt_base +
  214. mtt->first_seg * dev->limits.mtt_seg_size +
  215. start_index * 8);
  216. mtt_entry[1] = 0;
  217. for (i = 0; i < list_len && i < MTHCA_MAILBOX_SIZE / 8 - 2; ++i)
  218. mtt_entry[i + 2] = cpu_to_be64(buffer_list[i] |
  219. MTHCA_MTT_FLAG_PRESENT);
  220. /*
  221. * If we have an odd number of entries to write, add
  222. * one more dummy entry for firmware efficiency.
  223. */
  224. if (i & 1)
  225. mtt_entry[i + 2] = 0;
  226. err = mthca_WRITE_MTT(dev, mailbox, (i + 1) & ~1);
  227. if (err) {
  228. mthca_warn(dev, "WRITE_MTT failed (%d)\n", err);
  229. goto out;
  230. }
  231. list_len -= i;
  232. start_index += i;
  233. buffer_list += i;
  234. }
  235. out:
  236. mthca_free_mailbox(dev, mailbox);
  237. return err;
  238. }
  239. int mthca_write_mtt_size(struct mthca_dev *dev)
  240. {
  241. if (dev->mr_table.fmr_mtt_buddy != &dev->mr_table.mtt_buddy ||
  242. !(dev->mthca_flags & MTHCA_FLAG_FMR))
  243. /*
  244. * Be friendly to WRITE_MTT command
  245. * and leave two empty slots for the
  246. * index and reserved fields of the
  247. * mailbox.
  248. */
  249. return PAGE_SIZE / sizeof (u64) - 2;
  250. /* For Arbel, all MTTs must fit in the same page. */
  251. return mthca_is_memfree(dev) ? (PAGE_SIZE / sizeof (u64)) : 0x7ffffff;
  252. }
  253. static void mthca_tavor_write_mtt_seg(struct mthca_dev *dev,
  254. struct mthca_mtt *mtt, int start_index,
  255. u64 *buffer_list, int list_len)
  256. {
  257. u64 __iomem *mtts;
  258. int i;
  259. mtts = dev->mr_table.tavor_fmr.mtt_base + mtt->first_seg * dev->limits.mtt_seg_size +
  260. start_index * sizeof (u64);
  261. for (i = 0; i < list_len; ++i)
  262. mthca_write64_raw(cpu_to_be64(buffer_list[i] | MTHCA_MTT_FLAG_PRESENT),
  263. mtts + i);
  264. }
  265. static void mthca_arbel_write_mtt_seg(struct mthca_dev *dev,
  266. struct mthca_mtt *mtt, int start_index,
  267. u64 *buffer_list, int list_len)
  268. {
  269. __be64 *mtts;
  270. dma_addr_t dma_handle;
  271. int i;
  272. int s = start_index * sizeof (u64);
  273. /* For Arbel, all MTTs must fit in the same page. */
  274. BUG_ON(s / PAGE_SIZE != (s + list_len * sizeof(u64) - 1) / PAGE_SIZE);
  275. /* Require full segments */
  276. BUG_ON(s % dev->limits.mtt_seg_size);
  277. mtts = mthca_table_find(dev->mr_table.mtt_table, mtt->first_seg +
  278. s / dev->limits.mtt_seg_size, &dma_handle);
  279. BUG_ON(!mtts);
  280. dma_sync_single_for_cpu(&dev->pdev->dev, dma_handle,
  281. list_len * sizeof (u64), DMA_TO_DEVICE);
  282. for (i = 0; i < list_len; ++i)
  283. mtts[i] = cpu_to_be64(buffer_list[i] | MTHCA_MTT_FLAG_PRESENT);
  284. dma_sync_single_for_device(&dev->pdev->dev, dma_handle,
  285. list_len * sizeof (u64), DMA_TO_DEVICE);
  286. }
  287. int mthca_write_mtt(struct mthca_dev *dev, struct mthca_mtt *mtt,
  288. int start_index, u64 *buffer_list, int list_len)
  289. {
  290. int size = mthca_write_mtt_size(dev);
  291. int chunk;
  292. if (dev->mr_table.fmr_mtt_buddy != &dev->mr_table.mtt_buddy ||
  293. !(dev->mthca_flags & MTHCA_FLAG_FMR))
  294. return __mthca_write_mtt(dev, mtt, start_index, buffer_list, list_len);
  295. while (list_len > 0) {
  296. chunk = min(size, list_len);
  297. if (mthca_is_memfree(dev))
  298. mthca_arbel_write_mtt_seg(dev, mtt, start_index,
  299. buffer_list, chunk);
  300. else
  301. mthca_tavor_write_mtt_seg(dev, mtt, start_index,
  302. buffer_list, chunk);
  303. list_len -= chunk;
  304. start_index += chunk;
  305. buffer_list += chunk;
  306. }
  307. return 0;
  308. }
  309. static inline u32 tavor_hw_index_to_key(u32 ind)
  310. {
  311. return ind;
  312. }
  313. static inline u32 tavor_key_to_hw_index(u32 key)
  314. {
  315. return key;
  316. }
  317. static inline u32 arbel_hw_index_to_key(u32 ind)
  318. {
  319. return (ind >> 24) | (ind << 8);
  320. }
  321. static inline u32 arbel_key_to_hw_index(u32 key)
  322. {
  323. return (key << 24) | (key >> 8);
  324. }
  325. static inline u32 hw_index_to_key(struct mthca_dev *dev, u32 ind)
  326. {
  327. if (mthca_is_memfree(dev))
  328. return arbel_hw_index_to_key(ind);
  329. else
  330. return tavor_hw_index_to_key(ind);
  331. }
  332. static inline u32 key_to_hw_index(struct mthca_dev *dev, u32 key)
  333. {
  334. if (mthca_is_memfree(dev))
  335. return arbel_key_to_hw_index(key);
  336. else
  337. return tavor_key_to_hw_index(key);
  338. }
  339. static inline u32 adjust_key(struct mthca_dev *dev, u32 key)
  340. {
  341. if (dev->mthca_flags & MTHCA_FLAG_SINAI_OPT)
  342. return ((key << 20) & 0x800000) | (key & 0x7fffff);
  343. else
  344. return key;
  345. }
  346. int mthca_mr_alloc(struct mthca_dev *dev, u32 pd, int buffer_size_shift,
  347. u64 iova, u64 total_size, u32 access, struct mthca_mr *mr)
  348. {
  349. struct mthca_mailbox *mailbox;
  350. struct mthca_mpt_entry *mpt_entry;
  351. u32 key;
  352. int i;
  353. int err;
  354. WARN_ON(buffer_size_shift >= 32);
  355. key = mthca_alloc(&dev->mr_table.mpt_alloc);
  356. if (key == -1)
  357. return -ENOMEM;
  358. key = adjust_key(dev, key);
  359. mr->ibmr.rkey = mr->ibmr.lkey = hw_index_to_key(dev, key);
  360. if (mthca_is_memfree(dev)) {
  361. err = mthca_table_get(dev, dev->mr_table.mpt_table, key);
  362. if (err)
  363. goto err_out_mpt_free;
  364. }
  365. mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
  366. if (IS_ERR(mailbox)) {
  367. err = PTR_ERR(mailbox);
  368. goto err_out_table;
  369. }
  370. mpt_entry = mailbox->buf;
  371. mpt_entry->flags = cpu_to_be32(MTHCA_MPT_FLAG_SW_OWNS |
  372. MTHCA_MPT_FLAG_MIO |
  373. MTHCA_MPT_FLAG_REGION |
  374. access);
  375. if (!mr->mtt)
  376. mpt_entry->flags |= cpu_to_be32(MTHCA_MPT_FLAG_PHYSICAL);
  377. mpt_entry->page_size = cpu_to_be32(buffer_size_shift - 12);
  378. mpt_entry->key = cpu_to_be32(key);
  379. mpt_entry->pd = cpu_to_be32(pd);
  380. mpt_entry->start = cpu_to_be64(iova);
  381. mpt_entry->length = cpu_to_be64(total_size);
  382. memset_startat(mpt_entry, 0, lkey);
  383. if (mr->mtt)
  384. mpt_entry->mtt_seg =
  385. cpu_to_be64(dev->mr_table.mtt_base +
  386. mr->mtt->first_seg * dev->limits.mtt_seg_size);
  387. if (0) {
  388. mthca_dbg(dev, "Dumping MPT entry %08x:\n", mr->ibmr.lkey);
  389. for (i = 0; i < sizeof (struct mthca_mpt_entry) / 4; ++i) {
  390. if (i % 4 == 0)
  391. printk("[%02x] ", i * 4);
  392. printk(" %08x", be32_to_cpu(((__be32 *) mpt_entry)[i]));
  393. if ((i + 1) % 4 == 0)
  394. printk("\n");
  395. }
  396. }
  397. err = mthca_SW2HW_MPT(dev, mailbox,
  398. key & (dev->limits.num_mpts - 1));
  399. if (err) {
  400. mthca_warn(dev, "SW2HW_MPT failed (%d)\n", err);
  401. goto err_out_mailbox;
  402. }
  403. mthca_free_mailbox(dev, mailbox);
  404. return err;
  405. err_out_mailbox:
  406. mthca_free_mailbox(dev, mailbox);
  407. err_out_table:
  408. mthca_table_put(dev, dev->mr_table.mpt_table, key);
  409. err_out_mpt_free:
  410. mthca_free(&dev->mr_table.mpt_alloc, key);
  411. return err;
  412. }
  413. int mthca_mr_alloc_notrans(struct mthca_dev *dev, u32 pd,
  414. u32 access, struct mthca_mr *mr)
  415. {
  416. mr->mtt = NULL;
  417. return mthca_mr_alloc(dev, pd, 12, 0, ~0ULL, access, mr);
  418. }
  419. int mthca_mr_alloc_phys(struct mthca_dev *dev, u32 pd,
  420. u64 *buffer_list, int buffer_size_shift,
  421. int list_len, u64 iova, u64 total_size,
  422. u32 access, struct mthca_mr *mr)
  423. {
  424. int err;
  425. mr->mtt = mthca_alloc_mtt(dev, list_len);
  426. if (IS_ERR(mr->mtt))
  427. return PTR_ERR(mr->mtt);
  428. err = mthca_write_mtt(dev, mr->mtt, 0, buffer_list, list_len);
  429. if (err) {
  430. mthca_free_mtt(dev, mr->mtt);
  431. return err;
  432. }
  433. err = mthca_mr_alloc(dev, pd, buffer_size_shift, iova,
  434. total_size, access, mr);
  435. if (err)
  436. mthca_free_mtt(dev, mr->mtt);
  437. return err;
  438. }
  439. /* Free mr */
  440. static void mthca_free_region(struct mthca_dev *dev, u32 lkey)
  441. {
  442. mthca_table_put(dev, dev->mr_table.mpt_table,
  443. key_to_hw_index(dev, lkey));
  444. mthca_free(&dev->mr_table.mpt_alloc, key_to_hw_index(dev, lkey));
  445. }
  446. void mthca_free_mr(struct mthca_dev *dev, struct mthca_mr *mr)
  447. {
  448. int err;
  449. err = mthca_HW2SW_MPT(dev, NULL,
  450. key_to_hw_index(dev, mr->ibmr.lkey) &
  451. (dev->limits.num_mpts - 1));
  452. if (err)
  453. mthca_warn(dev, "HW2SW_MPT failed (%d)\n", err);
  454. mthca_free_region(dev, mr->ibmr.lkey);
  455. mthca_free_mtt(dev, mr->mtt);
  456. }
  457. int mthca_init_mr_table(struct mthca_dev *dev)
  458. {
  459. phys_addr_t addr;
  460. int mpts, mtts, err, i;
  461. err = mthca_alloc_init(&dev->mr_table.mpt_alloc,
  462. dev->limits.num_mpts,
  463. ~0, dev->limits.reserved_mrws);
  464. if (err)
  465. return err;
  466. if (!mthca_is_memfree(dev) &&
  467. (dev->mthca_flags & MTHCA_FLAG_DDR_HIDDEN))
  468. dev->limits.fmr_reserved_mtts = 0;
  469. else
  470. dev->mthca_flags |= MTHCA_FLAG_FMR;
  471. if (dev->mthca_flags & MTHCA_FLAG_SINAI_OPT)
  472. mthca_dbg(dev, "Memory key throughput optimization activated.\n");
  473. err = mthca_buddy_init(&dev->mr_table.mtt_buddy,
  474. fls(dev->limits.num_mtt_segs - 1));
  475. if (err)
  476. goto err_mtt_buddy;
  477. dev->mr_table.tavor_fmr.mpt_base = NULL;
  478. dev->mr_table.tavor_fmr.mtt_base = NULL;
  479. if (dev->limits.fmr_reserved_mtts) {
  480. i = fls(dev->limits.fmr_reserved_mtts - 1);
  481. if (i >= 31) {
  482. mthca_warn(dev, "Unable to reserve 2^31 FMR MTTs.\n");
  483. err = -EINVAL;
  484. goto err_fmr_mpt;
  485. }
  486. mpts = mtts = 1 << i;
  487. } else {
  488. mtts = dev->limits.num_mtt_segs;
  489. mpts = dev->limits.num_mpts;
  490. }
  491. if (!mthca_is_memfree(dev) &&
  492. (dev->mthca_flags & MTHCA_FLAG_FMR)) {
  493. addr = pci_resource_start(dev->pdev, 4) +
  494. ((pci_resource_len(dev->pdev, 4) - 1) &
  495. dev->mr_table.mpt_base);
  496. dev->mr_table.tavor_fmr.mpt_base =
  497. ioremap(addr, mpts * sizeof(struct mthca_mpt_entry));
  498. if (!dev->mr_table.tavor_fmr.mpt_base) {
  499. mthca_warn(dev, "MPT ioremap for FMR failed.\n");
  500. err = -ENOMEM;
  501. goto err_fmr_mpt;
  502. }
  503. addr = pci_resource_start(dev->pdev, 4) +
  504. ((pci_resource_len(dev->pdev, 4) - 1) &
  505. dev->mr_table.mtt_base);
  506. dev->mr_table.tavor_fmr.mtt_base =
  507. ioremap(addr, mtts * dev->limits.mtt_seg_size);
  508. if (!dev->mr_table.tavor_fmr.mtt_base) {
  509. mthca_warn(dev, "MTT ioremap for FMR failed.\n");
  510. err = -ENOMEM;
  511. goto err_fmr_mtt;
  512. }
  513. }
  514. if (dev->limits.fmr_reserved_mtts) {
  515. err = mthca_buddy_init(&dev->mr_table.tavor_fmr.mtt_buddy, fls(mtts - 1));
  516. if (err)
  517. goto err_fmr_mtt_buddy;
  518. /* Prevent regular MRs from using FMR keys */
  519. err = mthca_buddy_alloc(&dev->mr_table.mtt_buddy, fls(mtts - 1));
  520. if (err)
  521. goto err_reserve_fmr;
  522. dev->mr_table.fmr_mtt_buddy =
  523. &dev->mr_table.tavor_fmr.mtt_buddy;
  524. } else
  525. dev->mr_table.fmr_mtt_buddy = &dev->mr_table.mtt_buddy;
  526. /* FMR table is always the first, take reserved MTTs out of there */
  527. if (dev->limits.reserved_mtts) {
  528. i = fls(dev->limits.reserved_mtts - 1);
  529. if (mthca_alloc_mtt_range(dev, i,
  530. dev->mr_table.fmr_mtt_buddy) == -1) {
  531. mthca_warn(dev, "MTT table of order %d is too small.\n",
  532. dev->mr_table.fmr_mtt_buddy->max_order);
  533. err = -ENOMEM;
  534. goto err_reserve_mtts;
  535. }
  536. }
  537. return 0;
  538. err_reserve_mtts:
  539. err_reserve_fmr:
  540. if (dev->limits.fmr_reserved_mtts)
  541. mthca_buddy_cleanup(&dev->mr_table.tavor_fmr.mtt_buddy);
  542. err_fmr_mtt_buddy:
  543. if (dev->mr_table.tavor_fmr.mtt_base)
  544. iounmap(dev->mr_table.tavor_fmr.mtt_base);
  545. err_fmr_mtt:
  546. if (dev->mr_table.tavor_fmr.mpt_base)
  547. iounmap(dev->mr_table.tavor_fmr.mpt_base);
  548. err_fmr_mpt:
  549. mthca_buddy_cleanup(&dev->mr_table.mtt_buddy);
  550. err_mtt_buddy:
  551. mthca_alloc_cleanup(&dev->mr_table.mpt_alloc);
  552. return err;
  553. }
  554. void mthca_cleanup_mr_table(struct mthca_dev *dev)
  555. {
  556. /* XXX check if any MRs are still allocated? */
  557. if (dev->limits.fmr_reserved_mtts)
  558. mthca_buddy_cleanup(&dev->mr_table.tavor_fmr.mtt_buddy);
  559. mthca_buddy_cleanup(&dev->mr_table.mtt_buddy);
  560. if (dev->mr_table.tavor_fmr.mtt_base)
  561. iounmap(dev->mr_table.tavor_fmr.mtt_base);
  562. if (dev->mr_table.tavor_fmr.mpt_base)
  563. iounmap(dev->mr_table.tavor_fmr.mpt_base);
  564. mthca_alloc_cleanup(&dev->mr_table.mpt_alloc);
  565. }