mthca_mr.c 24 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985
  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. } __attribute__((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, s;
  119. buddy->max_order = max_order;
  120. spin_lock_init(&buddy->lock);
  121. buddy->bits = kzalloc((buddy->max_order + 1) * sizeof (long *),
  122. GFP_KERNEL);
  123. buddy->num_free = kzalloc((buddy->max_order + 1) * sizeof (int *),
  124. GFP_KERNEL);
  125. if (!buddy->bits || !buddy->num_free)
  126. goto err_out;
  127. for (i = 0; i <= buddy->max_order; ++i) {
  128. s = BITS_TO_LONGS(1 << (buddy->max_order - i));
  129. buddy->bits[i] = kmalloc(s * sizeof (long), GFP_KERNEL);
  130. if (!buddy->bits[i])
  131. goto err_out_free;
  132. bitmap_zero(buddy->bits[i],
  133. 1 << (buddy->max_order - i));
  134. }
  135. set_bit(0, buddy->bits[buddy->max_order]);
  136. buddy->num_free[buddy->max_order] = 1;
  137. return 0;
  138. err_out_free:
  139. for (i = 0; i <= buddy->max_order; ++i)
  140. kfree(buddy->bits[i]);
  141. err_out:
  142. kfree(buddy->bits);
  143. kfree(buddy->num_free);
  144. return -ENOMEM;
  145. }
  146. static void mthca_buddy_cleanup(struct mthca_buddy *buddy)
  147. {
  148. int i;
  149. for (i = 0; i <= buddy->max_order; ++i)
  150. kfree(buddy->bits[i]);
  151. kfree(buddy->bits);
  152. kfree(buddy->num_free);
  153. }
  154. static u32 mthca_alloc_mtt_range(struct mthca_dev *dev, int order,
  155. struct mthca_buddy *buddy)
  156. {
  157. u32 seg = mthca_buddy_alloc(buddy, order);
  158. if (seg == -1)
  159. return -1;
  160. if (mthca_is_memfree(dev))
  161. if (mthca_table_get_range(dev, dev->mr_table.mtt_table, seg,
  162. seg + (1 << order) - 1)) {
  163. mthca_buddy_free(buddy, seg, order);
  164. seg = -1;
  165. }
  166. return seg;
  167. }
  168. static struct mthca_mtt *__mthca_alloc_mtt(struct mthca_dev *dev, int size,
  169. struct mthca_buddy *buddy)
  170. {
  171. struct mthca_mtt *mtt;
  172. int i;
  173. if (size <= 0)
  174. return ERR_PTR(-EINVAL);
  175. mtt = kmalloc(sizeof *mtt, GFP_KERNEL);
  176. if (!mtt)
  177. return ERR_PTR(-ENOMEM);
  178. mtt->buddy = buddy;
  179. mtt->order = 0;
  180. for (i = MTHCA_MTT_SEG_SIZE / 8; i < size; i <<= 1)
  181. ++mtt->order;
  182. mtt->first_seg = mthca_alloc_mtt_range(dev, mtt->order, buddy);
  183. if (mtt->first_seg == -1) {
  184. kfree(mtt);
  185. return ERR_PTR(-ENOMEM);
  186. }
  187. return mtt;
  188. }
  189. struct mthca_mtt *mthca_alloc_mtt(struct mthca_dev *dev, int size)
  190. {
  191. return __mthca_alloc_mtt(dev, size, &dev->mr_table.mtt_buddy);
  192. }
  193. void mthca_free_mtt(struct mthca_dev *dev, struct mthca_mtt *mtt)
  194. {
  195. if (!mtt)
  196. return;
  197. mthca_buddy_free(mtt->buddy, mtt->first_seg, mtt->order);
  198. mthca_table_put_range(dev, dev->mr_table.mtt_table,
  199. mtt->first_seg,
  200. mtt->first_seg + (1 << mtt->order) - 1);
  201. kfree(mtt);
  202. }
  203. static int __mthca_write_mtt(struct mthca_dev *dev, struct mthca_mtt *mtt,
  204. int start_index, u64 *buffer_list, int list_len)
  205. {
  206. struct mthca_mailbox *mailbox;
  207. __be64 *mtt_entry;
  208. int err = 0;
  209. u8 status;
  210. int i;
  211. mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
  212. if (IS_ERR(mailbox))
  213. return PTR_ERR(mailbox);
  214. mtt_entry = mailbox->buf;
  215. while (list_len > 0) {
  216. mtt_entry[0] = cpu_to_be64(dev->mr_table.mtt_base +
  217. mtt->first_seg * MTHCA_MTT_SEG_SIZE +
  218. start_index * 8);
  219. mtt_entry[1] = 0;
  220. for (i = 0; i < list_len && i < MTHCA_MAILBOX_SIZE / 8 - 2; ++i)
  221. mtt_entry[i + 2] = cpu_to_be64(buffer_list[i] |
  222. MTHCA_MTT_FLAG_PRESENT);
  223. /*
  224. * If we have an odd number of entries to write, add
  225. * one more dummy entry for firmware efficiency.
  226. */
  227. if (i & 1)
  228. mtt_entry[i + 2] = 0;
  229. err = mthca_WRITE_MTT(dev, mailbox, (i + 1) & ~1, &status);
  230. if (err) {
  231. mthca_warn(dev, "WRITE_MTT failed (%d)\n", err);
  232. goto out;
  233. }
  234. if (status) {
  235. mthca_warn(dev, "WRITE_MTT returned status 0x%02x\n",
  236. status);
  237. err = -EINVAL;
  238. goto out;
  239. }
  240. list_len -= i;
  241. start_index += i;
  242. buffer_list += i;
  243. }
  244. out:
  245. mthca_free_mailbox(dev, mailbox);
  246. return err;
  247. }
  248. int mthca_write_mtt_size(struct mthca_dev *dev)
  249. {
  250. if (dev->mr_table.fmr_mtt_buddy != &dev->mr_table.mtt_buddy ||
  251. !(dev->mthca_flags & MTHCA_FLAG_FMR))
  252. /*
  253. * Be friendly to WRITE_MTT command
  254. * and leave two empty slots for the
  255. * index and reserved fields of the
  256. * mailbox.
  257. */
  258. return PAGE_SIZE / sizeof (u64) - 2;
  259. /* For Arbel, all MTTs must fit in the same page. */
  260. return mthca_is_memfree(dev) ? (PAGE_SIZE / sizeof (u64)) : 0x7ffffff;
  261. }
  262. static void mthca_tavor_write_mtt_seg(struct mthca_dev *dev,
  263. struct mthca_mtt *mtt, int start_index,
  264. u64 *buffer_list, int list_len)
  265. {
  266. u64 __iomem *mtts;
  267. int i;
  268. mtts = dev->mr_table.tavor_fmr.mtt_base + mtt->first_seg * MTHCA_MTT_SEG_SIZE +
  269. start_index * sizeof (u64);
  270. for (i = 0; i < list_len; ++i)
  271. mthca_write64_raw(cpu_to_be64(buffer_list[i] | MTHCA_MTT_FLAG_PRESENT),
  272. mtts + i);
  273. }
  274. static void mthca_arbel_write_mtt_seg(struct mthca_dev *dev,
  275. struct mthca_mtt *mtt, int start_index,
  276. u64 *buffer_list, int list_len)
  277. {
  278. __be64 *mtts;
  279. dma_addr_t dma_handle;
  280. int i;
  281. int s = start_index * sizeof (u64);
  282. /* For Arbel, all MTTs must fit in the same page. */
  283. BUG_ON(s / PAGE_SIZE != (s + list_len * sizeof(u64) - 1) / PAGE_SIZE);
  284. /* Require full segments */
  285. BUG_ON(s % MTHCA_MTT_SEG_SIZE);
  286. mtts = mthca_table_find(dev->mr_table.mtt_table, mtt->first_seg +
  287. s / MTHCA_MTT_SEG_SIZE, &dma_handle);
  288. BUG_ON(!mtts);
  289. for (i = 0; i < list_len; ++i)
  290. mtts[i] = cpu_to_be64(buffer_list[i] | MTHCA_MTT_FLAG_PRESENT);
  291. dma_sync_single(&dev->pdev->dev, dma_handle, list_len * sizeof (u64), DMA_TO_DEVICE);
  292. }
  293. int mthca_write_mtt(struct mthca_dev *dev, struct mthca_mtt *mtt,
  294. int start_index, u64 *buffer_list, int list_len)
  295. {
  296. int size = mthca_write_mtt_size(dev);
  297. int chunk;
  298. if (dev->mr_table.fmr_mtt_buddy != &dev->mr_table.mtt_buddy ||
  299. !(dev->mthca_flags & MTHCA_FLAG_FMR))
  300. return __mthca_write_mtt(dev, mtt, start_index, buffer_list, list_len);
  301. while (list_len > 0) {
  302. chunk = min(size, list_len);
  303. if (mthca_is_memfree(dev))
  304. mthca_arbel_write_mtt_seg(dev, mtt, start_index,
  305. buffer_list, chunk);
  306. else
  307. mthca_tavor_write_mtt_seg(dev, mtt, start_index,
  308. buffer_list, chunk);
  309. list_len -= chunk;
  310. start_index += chunk;
  311. buffer_list += chunk;
  312. }
  313. return 0;
  314. }
  315. static inline u32 tavor_hw_index_to_key(u32 ind)
  316. {
  317. return ind;
  318. }
  319. static inline u32 tavor_key_to_hw_index(u32 key)
  320. {
  321. return key;
  322. }
  323. static inline u32 arbel_hw_index_to_key(u32 ind)
  324. {
  325. return (ind >> 24) | (ind << 8);
  326. }
  327. static inline u32 arbel_key_to_hw_index(u32 key)
  328. {
  329. return (key << 24) | (key >> 8);
  330. }
  331. static inline u32 hw_index_to_key(struct mthca_dev *dev, u32 ind)
  332. {
  333. if (mthca_is_memfree(dev))
  334. return arbel_hw_index_to_key(ind);
  335. else
  336. return tavor_hw_index_to_key(ind);
  337. }
  338. static inline u32 key_to_hw_index(struct mthca_dev *dev, u32 key)
  339. {
  340. if (mthca_is_memfree(dev))
  341. return arbel_key_to_hw_index(key);
  342. else
  343. return tavor_key_to_hw_index(key);
  344. }
  345. static inline u32 adjust_key(struct mthca_dev *dev, u32 key)
  346. {
  347. if (dev->mthca_flags & MTHCA_FLAG_SINAI_OPT)
  348. return ((key << 20) & 0x800000) | (key & 0x7fffff);
  349. else
  350. return key;
  351. }
  352. int mthca_mr_alloc(struct mthca_dev *dev, u32 pd, int buffer_size_shift,
  353. u64 iova, u64 total_size, u32 access, struct mthca_mr *mr)
  354. {
  355. struct mthca_mailbox *mailbox;
  356. struct mthca_mpt_entry *mpt_entry;
  357. u32 key;
  358. int i;
  359. int err;
  360. u8 status;
  361. WARN_ON(buffer_size_shift >= 32);
  362. key = mthca_alloc(&dev->mr_table.mpt_alloc);
  363. if (key == -1)
  364. return -ENOMEM;
  365. key = adjust_key(dev, key);
  366. mr->ibmr.rkey = mr->ibmr.lkey = hw_index_to_key(dev, key);
  367. if (mthca_is_memfree(dev)) {
  368. err = mthca_table_get(dev, dev->mr_table.mpt_table, key);
  369. if (err)
  370. goto err_out_mpt_free;
  371. }
  372. mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
  373. if (IS_ERR(mailbox)) {
  374. err = PTR_ERR(mailbox);
  375. goto err_out_table;
  376. }
  377. mpt_entry = mailbox->buf;
  378. mpt_entry->flags = cpu_to_be32(MTHCA_MPT_FLAG_SW_OWNS |
  379. MTHCA_MPT_FLAG_MIO |
  380. MTHCA_MPT_FLAG_REGION |
  381. access);
  382. if (!mr->mtt)
  383. mpt_entry->flags |= cpu_to_be32(MTHCA_MPT_FLAG_PHYSICAL);
  384. mpt_entry->page_size = cpu_to_be32(buffer_size_shift - 12);
  385. mpt_entry->key = cpu_to_be32(key);
  386. mpt_entry->pd = cpu_to_be32(pd);
  387. mpt_entry->start = cpu_to_be64(iova);
  388. mpt_entry->length = cpu_to_be64(total_size);
  389. memset(&mpt_entry->lkey, 0,
  390. sizeof *mpt_entry - offsetof(struct mthca_mpt_entry, lkey));
  391. if (mr->mtt)
  392. mpt_entry->mtt_seg =
  393. cpu_to_be64(dev->mr_table.mtt_base +
  394. mr->mtt->first_seg * MTHCA_MTT_SEG_SIZE);
  395. if (0) {
  396. mthca_dbg(dev, "Dumping MPT entry %08x:\n", mr->ibmr.lkey);
  397. for (i = 0; i < sizeof (struct mthca_mpt_entry) / 4; ++i) {
  398. if (i % 4 == 0)
  399. printk("[%02x] ", i * 4);
  400. printk(" %08x", be32_to_cpu(((__be32 *) mpt_entry)[i]));
  401. if ((i + 1) % 4 == 0)
  402. printk("\n");
  403. }
  404. }
  405. err = mthca_SW2HW_MPT(dev, mailbox,
  406. key & (dev->limits.num_mpts - 1),
  407. &status);
  408. if (err) {
  409. mthca_warn(dev, "SW2HW_MPT failed (%d)\n", err);
  410. goto err_out_mailbox;
  411. } else if (status) {
  412. mthca_warn(dev, "SW2HW_MPT returned status 0x%02x\n",
  413. status);
  414. err = -EINVAL;
  415. goto err_out_mailbox;
  416. }
  417. mthca_free_mailbox(dev, mailbox);
  418. return err;
  419. err_out_mailbox:
  420. mthca_free_mailbox(dev, mailbox);
  421. err_out_table:
  422. mthca_table_put(dev, dev->mr_table.mpt_table, key);
  423. err_out_mpt_free:
  424. mthca_free(&dev->mr_table.mpt_alloc, key);
  425. return err;
  426. }
  427. int mthca_mr_alloc_notrans(struct mthca_dev *dev, u32 pd,
  428. u32 access, struct mthca_mr *mr)
  429. {
  430. mr->mtt = NULL;
  431. return mthca_mr_alloc(dev, pd, 12, 0, ~0ULL, access, mr);
  432. }
  433. int mthca_mr_alloc_phys(struct mthca_dev *dev, u32 pd,
  434. u64 *buffer_list, int buffer_size_shift,
  435. int list_len, u64 iova, u64 total_size,
  436. u32 access, struct mthca_mr *mr)
  437. {
  438. int err;
  439. mr->mtt = mthca_alloc_mtt(dev, list_len);
  440. if (IS_ERR(mr->mtt))
  441. return PTR_ERR(mr->mtt);
  442. err = mthca_write_mtt(dev, mr->mtt, 0, buffer_list, list_len);
  443. if (err) {
  444. mthca_free_mtt(dev, mr->mtt);
  445. return err;
  446. }
  447. err = mthca_mr_alloc(dev, pd, buffer_size_shift, iova,
  448. total_size, access, mr);
  449. if (err)
  450. mthca_free_mtt(dev, mr->mtt);
  451. return err;
  452. }
  453. /* Free mr or fmr */
  454. static void mthca_free_region(struct mthca_dev *dev, u32 lkey)
  455. {
  456. mthca_table_put(dev, dev->mr_table.mpt_table,
  457. key_to_hw_index(dev, lkey));
  458. mthca_free(&dev->mr_table.mpt_alloc, key_to_hw_index(dev, lkey));
  459. }
  460. void mthca_free_mr(struct mthca_dev *dev, struct mthca_mr *mr)
  461. {
  462. int err;
  463. u8 status;
  464. err = mthca_HW2SW_MPT(dev, NULL,
  465. key_to_hw_index(dev, mr->ibmr.lkey) &
  466. (dev->limits.num_mpts - 1),
  467. &status);
  468. if (err)
  469. mthca_warn(dev, "HW2SW_MPT failed (%d)\n", err);
  470. else if (status)
  471. mthca_warn(dev, "HW2SW_MPT returned status 0x%02x\n",
  472. status);
  473. mthca_free_region(dev, mr->ibmr.lkey);
  474. mthca_free_mtt(dev, mr->mtt);
  475. }
  476. int mthca_fmr_alloc(struct mthca_dev *dev, u32 pd,
  477. u32 access, struct mthca_fmr *mr)
  478. {
  479. struct mthca_mpt_entry *mpt_entry;
  480. struct mthca_mailbox *mailbox;
  481. u64 mtt_seg;
  482. u32 key, idx;
  483. u8 status;
  484. int list_len = mr->attr.max_pages;
  485. int err = -ENOMEM;
  486. int i;
  487. if (mr->attr.page_shift < 12 || mr->attr.page_shift >= 32)
  488. return -EINVAL;
  489. /* For Arbel, all MTTs must fit in the same page. */
  490. if (mthca_is_memfree(dev) &&
  491. mr->attr.max_pages * sizeof *mr->mem.arbel.mtts > PAGE_SIZE)
  492. return -EINVAL;
  493. mr->maps = 0;
  494. key = mthca_alloc(&dev->mr_table.mpt_alloc);
  495. if (key == -1)
  496. return -ENOMEM;
  497. key = adjust_key(dev, key);
  498. idx = key & (dev->limits.num_mpts - 1);
  499. mr->ibmr.rkey = mr->ibmr.lkey = hw_index_to_key(dev, key);
  500. if (mthca_is_memfree(dev)) {
  501. err = mthca_table_get(dev, dev->mr_table.mpt_table, key);
  502. if (err)
  503. goto err_out_mpt_free;
  504. mr->mem.arbel.mpt = mthca_table_find(dev->mr_table.mpt_table, key, NULL);
  505. BUG_ON(!mr->mem.arbel.mpt);
  506. } else
  507. mr->mem.tavor.mpt = dev->mr_table.tavor_fmr.mpt_base +
  508. sizeof *(mr->mem.tavor.mpt) * idx;
  509. mr->mtt = __mthca_alloc_mtt(dev, list_len, dev->mr_table.fmr_mtt_buddy);
  510. if (IS_ERR(mr->mtt)) {
  511. err = PTR_ERR(mr->mtt);
  512. goto err_out_table;
  513. }
  514. mtt_seg = mr->mtt->first_seg * MTHCA_MTT_SEG_SIZE;
  515. if (mthca_is_memfree(dev)) {
  516. mr->mem.arbel.mtts = mthca_table_find(dev->mr_table.mtt_table,
  517. mr->mtt->first_seg,
  518. &mr->mem.arbel.dma_handle);
  519. BUG_ON(!mr->mem.arbel.mtts);
  520. } else
  521. mr->mem.tavor.mtts = dev->mr_table.tavor_fmr.mtt_base + mtt_seg;
  522. mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
  523. if (IS_ERR(mailbox)) {
  524. err = PTR_ERR(mailbox);
  525. goto err_out_free_mtt;
  526. }
  527. mpt_entry = mailbox->buf;
  528. mpt_entry->flags = cpu_to_be32(MTHCA_MPT_FLAG_SW_OWNS |
  529. MTHCA_MPT_FLAG_MIO |
  530. MTHCA_MPT_FLAG_REGION |
  531. access);
  532. mpt_entry->page_size = cpu_to_be32(mr->attr.page_shift - 12);
  533. mpt_entry->key = cpu_to_be32(key);
  534. mpt_entry->pd = cpu_to_be32(pd);
  535. memset(&mpt_entry->start, 0,
  536. sizeof *mpt_entry - offsetof(struct mthca_mpt_entry, start));
  537. mpt_entry->mtt_seg = cpu_to_be64(dev->mr_table.mtt_base + mtt_seg);
  538. if (0) {
  539. mthca_dbg(dev, "Dumping MPT entry %08x:\n", mr->ibmr.lkey);
  540. for (i = 0; i < sizeof (struct mthca_mpt_entry) / 4; ++i) {
  541. if (i % 4 == 0)
  542. printk("[%02x] ", i * 4);
  543. printk(" %08x", be32_to_cpu(((__be32 *) mpt_entry)[i]));
  544. if ((i + 1) % 4 == 0)
  545. printk("\n");
  546. }
  547. }
  548. err = mthca_SW2HW_MPT(dev, mailbox,
  549. key & (dev->limits.num_mpts - 1),
  550. &status);
  551. if (err) {
  552. mthca_warn(dev, "SW2HW_MPT failed (%d)\n", err);
  553. goto err_out_mailbox_free;
  554. }
  555. if (status) {
  556. mthca_warn(dev, "SW2HW_MPT returned status 0x%02x\n",
  557. status);
  558. err = -EINVAL;
  559. goto err_out_mailbox_free;
  560. }
  561. mthca_free_mailbox(dev, mailbox);
  562. return 0;
  563. err_out_mailbox_free:
  564. mthca_free_mailbox(dev, mailbox);
  565. err_out_free_mtt:
  566. mthca_free_mtt(dev, mr->mtt);
  567. err_out_table:
  568. mthca_table_put(dev, dev->mr_table.mpt_table, key);
  569. err_out_mpt_free:
  570. mthca_free(&dev->mr_table.mpt_alloc, key);
  571. return err;
  572. }
  573. int mthca_free_fmr(struct mthca_dev *dev, struct mthca_fmr *fmr)
  574. {
  575. if (fmr->maps)
  576. return -EBUSY;
  577. mthca_free_region(dev, fmr->ibmr.lkey);
  578. mthca_free_mtt(dev, fmr->mtt);
  579. return 0;
  580. }
  581. static inline int mthca_check_fmr(struct mthca_fmr *fmr, u64 *page_list,
  582. int list_len, u64 iova)
  583. {
  584. int i, page_mask;
  585. if (list_len > fmr->attr.max_pages)
  586. return -EINVAL;
  587. page_mask = (1 << fmr->attr.page_shift) - 1;
  588. /* We are getting page lists, so va must be page aligned. */
  589. if (iova & page_mask)
  590. return -EINVAL;
  591. /* Trust the user not to pass misaligned data in page_list */
  592. if (0)
  593. for (i = 0; i < list_len; ++i) {
  594. if (page_list[i] & ~page_mask)
  595. return -EINVAL;
  596. }
  597. if (fmr->maps >= fmr->attr.max_maps)
  598. return -EINVAL;
  599. return 0;
  600. }
  601. int mthca_tavor_map_phys_fmr(struct ib_fmr *ibfmr, u64 *page_list,
  602. int list_len, u64 iova)
  603. {
  604. struct mthca_fmr *fmr = to_mfmr(ibfmr);
  605. struct mthca_dev *dev = to_mdev(ibfmr->device);
  606. struct mthca_mpt_entry mpt_entry;
  607. u32 key;
  608. int i, err;
  609. err = mthca_check_fmr(fmr, page_list, list_len, iova);
  610. if (err)
  611. return err;
  612. ++fmr->maps;
  613. key = tavor_key_to_hw_index(fmr->ibmr.lkey);
  614. key += dev->limits.num_mpts;
  615. fmr->ibmr.lkey = fmr->ibmr.rkey = tavor_hw_index_to_key(key);
  616. writeb(MTHCA_MPT_STATUS_SW, fmr->mem.tavor.mpt);
  617. for (i = 0; i < list_len; ++i) {
  618. __be64 mtt_entry = cpu_to_be64(page_list[i] |
  619. MTHCA_MTT_FLAG_PRESENT);
  620. mthca_write64_raw(mtt_entry, fmr->mem.tavor.mtts + i);
  621. }
  622. mpt_entry.lkey = cpu_to_be32(key);
  623. mpt_entry.length = cpu_to_be64(list_len * (1ull << fmr->attr.page_shift));
  624. mpt_entry.start = cpu_to_be64(iova);
  625. __raw_writel((__force u32) mpt_entry.lkey, &fmr->mem.tavor.mpt->key);
  626. memcpy_toio(&fmr->mem.tavor.mpt->start, &mpt_entry.start,
  627. offsetof(struct mthca_mpt_entry, window_count) -
  628. offsetof(struct mthca_mpt_entry, start));
  629. writeb(MTHCA_MPT_STATUS_HW, fmr->mem.tavor.mpt);
  630. return 0;
  631. }
  632. int mthca_arbel_map_phys_fmr(struct ib_fmr *ibfmr, u64 *page_list,
  633. int list_len, u64 iova)
  634. {
  635. struct mthca_fmr *fmr = to_mfmr(ibfmr);
  636. struct mthca_dev *dev = to_mdev(ibfmr->device);
  637. u32 key;
  638. int i, err;
  639. err = mthca_check_fmr(fmr, page_list, list_len, iova);
  640. if (err)
  641. return err;
  642. ++fmr->maps;
  643. key = arbel_key_to_hw_index(fmr->ibmr.lkey);
  644. if (dev->mthca_flags & MTHCA_FLAG_SINAI_OPT)
  645. key += SINAI_FMR_KEY_INC;
  646. else
  647. key += dev->limits.num_mpts;
  648. fmr->ibmr.lkey = fmr->ibmr.rkey = arbel_hw_index_to_key(key);
  649. *(u8 *) fmr->mem.arbel.mpt = MTHCA_MPT_STATUS_SW;
  650. wmb();
  651. for (i = 0; i < list_len; ++i)
  652. fmr->mem.arbel.mtts[i] = cpu_to_be64(page_list[i] |
  653. MTHCA_MTT_FLAG_PRESENT);
  654. dma_sync_single(&dev->pdev->dev, fmr->mem.arbel.dma_handle,
  655. list_len * sizeof(u64), DMA_TO_DEVICE);
  656. fmr->mem.arbel.mpt->key = cpu_to_be32(key);
  657. fmr->mem.arbel.mpt->lkey = cpu_to_be32(key);
  658. fmr->mem.arbel.mpt->length = cpu_to_be64(list_len * (1ull << fmr->attr.page_shift));
  659. fmr->mem.arbel.mpt->start = cpu_to_be64(iova);
  660. wmb();
  661. *(u8 *) fmr->mem.arbel.mpt = MTHCA_MPT_STATUS_HW;
  662. wmb();
  663. return 0;
  664. }
  665. void mthca_tavor_fmr_unmap(struct mthca_dev *dev, struct mthca_fmr *fmr)
  666. {
  667. if (!fmr->maps)
  668. return;
  669. fmr->maps = 0;
  670. writeb(MTHCA_MPT_STATUS_SW, fmr->mem.tavor.mpt);
  671. }
  672. void mthca_arbel_fmr_unmap(struct mthca_dev *dev, struct mthca_fmr *fmr)
  673. {
  674. if (!fmr->maps)
  675. return;
  676. fmr->maps = 0;
  677. *(u8 *) fmr->mem.arbel.mpt = MTHCA_MPT_STATUS_SW;
  678. }
  679. int mthca_init_mr_table(struct mthca_dev *dev)
  680. {
  681. unsigned long addr;
  682. int mpts, mtts, err, i;
  683. err = mthca_alloc_init(&dev->mr_table.mpt_alloc,
  684. dev->limits.num_mpts,
  685. ~0, dev->limits.reserved_mrws);
  686. if (err)
  687. return err;
  688. if (!mthca_is_memfree(dev) &&
  689. (dev->mthca_flags & MTHCA_FLAG_DDR_HIDDEN))
  690. dev->limits.fmr_reserved_mtts = 0;
  691. else
  692. dev->mthca_flags |= MTHCA_FLAG_FMR;
  693. if (dev->mthca_flags & MTHCA_FLAG_SINAI_OPT)
  694. mthca_dbg(dev, "Memory key throughput optimization activated.\n");
  695. err = mthca_buddy_init(&dev->mr_table.mtt_buddy,
  696. fls(dev->limits.num_mtt_segs - 1));
  697. if (err)
  698. goto err_mtt_buddy;
  699. dev->mr_table.tavor_fmr.mpt_base = NULL;
  700. dev->mr_table.tavor_fmr.mtt_base = NULL;
  701. if (dev->limits.fmr_reserved_mtts) {
  702. i = fls(dev->limits.fmr_reserved_mtts - 1);
  703. if (i >= 31) {
  704. mthca_warn(dev, "Unable to reserve 2^31 FMR MTTs.\n");
  705. err = -EINVAL;
  706. goto err_fmr_mpt;
  707. }
  708. mpts = mtts = 1 << i;
  709. } else {
  710. mtts = dev->limits.num_mtt_segs;
  711. mpts = dev->limits.num_mpts;
  712. }
  713. if (!mthca_is_memfree(dev) &&
  714. (dev->mthca_flags & MTHCA_FLAG_FMR)) {
  715. addr = pci_resource_start(dev->pdev, 4) +
  716. ((pci_resource_len(dev->pdev, 4) - 1) &
  717. dev->mr_table.mpt_base);
  718. dev->mr_table.tavor_fmr.mpt_base =
  719. ioremap(addr, mpts * sizeof(struct mthca_mpt_entry));
  720. if (!dev->mr_table.tavor_fmr.mpt_base) {
  721. mthca_warn(dev, "MPT ioremap for FMR failed.\n");
  722. err = -ENOMEM;
  723. goto err_fmr_mpt;
  724. }
  725. addr = pci_resource_start(dev->pdev, 4) +
  726. ((pci_resource_len(dev->pdev, 4) - 1) &
  727. dev->mr_table.mtt_base);
  728. dev->mr_table.tavor_fmr.mtt_base =
  729. ioremap(addr, mtts * MTHCA_MTT_SEG_SIZE);
  730. if (!dev->mr_table.tavor_fmr.mtt_base) {
  731. mthca_warn(dev, "MTT ioremap for FMR failed.\n");
  732. err = -ENOMEM;
  733. goto err_fmr_mtt;
  734. }
  735. }
  736. if (dev->limits.fmr_reserved_mtts) {
  737. err = mthca_buddy_init(&dev->mr_table.tavor_fmr.mtt_buddy, fls(mtts - 1));
  738. if (err)
  739. goto err_fmr_mtt_buddy;
  740. /* Prevent regular MRs from using FMR keys */
  741. err = mthca_buddy_alloc(&dev->mr_table.mtt_buddy, fls(mtts - 1));
  742. if (err)
  743. goto err_reserve_fmr;
  744. dev->mr_table.fmr_mtt_buddy =
  745. &dev->mr_table.tavor_fmr.mtt_buddy;
  746. } else
  747. dev->mr_table.fmr_mtt_buddy = &dev->mr_table.mtt_buddy;
  748. /* FMR table is always the first, take reserved MTTs out of there */
  749. if (dev->limits.reserved_mtts) {
  750. i = fls(dev->limits.reserved_mtts - 1);
  751. if (mthca_alloc_mtt_range(dev, i,
  752. dev->mr_table.fmr_mtt_buddy) == -1) {
  753. mthca_warn(dev, "MTT table of order %d is too small.\n",
  754. dev->mr_table.fmr_mtt_buddy->max_order);
  755. err = -ENOMEM;
  756. goto err_reserve_mtts;
  757. }
  758. }
  759. return 0;
  760. err_reserve_mtts:
  761. err_reserve_fmr:
  762. if (dev->limits.fmr_reserved_mtts)
  763. mthca_buddy_cleanup(&dev->mr_table.tavor_fmr.mtt_buddy);
  764. err_fmr_mtt_buddy:
  765. if (dev->mr_table.tavor_fmr.mtt_base)
  766. iounmap(dev->mr_table.tavor_fmr.mtt_base);
  767. err_fmr_mtt:
  768. if (dev->mr_table.tavor_fmr.mpt_base)
  769. iounmap(dev->mr_table.tavor_fmr.mpt_base);
  770. err_fmr_mpt:
  771. mthca_buddy_cleanup(&dev->mr_table.mtt_buddy);
  772. err_mtt_buddy:
  773. mthca_alloc_cleanup(&dev->mr_table.mpt_alloc);
  774. return err;
  775. }
  776. void mthca_cleanup_mr_table(struct mthca_dev *dev)
  777. {
  778. /* XXX check if any MRs are still allocated? */
  779. if (dev->limits.fmr_reserved_mtts)
  780. mthca_buddy_cleanup(&dev->mr_table.tavor_fmr.mtt_buddy);
  781. mthca_buddy_cleanup(&dev->mr_table.mtt_buddy);
  782. if (dev->mr_table.tavor_fmr.mtt_base)
  783. iounmap(dev->mr_table.tavor_fmr.mtt_base);
  784. if (dev->mr_table.tavor_fmr.mpt_base)
  785. iounmap(dev->mr_table.tavor_fmr.mpt_base);
  786. mthca_alloc_cleanup(&dev->mr_table.mpt_alloc);
  787. }