mthca_mr.c 24 KB

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