mthca_mr.c 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871
  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/init.h>
  37. #include <linux/errno.h>
  38. #include "mthca_dev.h"
  39. #include "mthca_cmd.h"
  40. #include "mthca_memfree.h"
  41. struct mthca_mtt {
  42. struct mthca_buddy *buddy;
  43. int order;
  44. u32 first_seg;
  45. };
  46. /*
  47. * Must be packed because mtt_seg is 64 bits but only aligned to 32 bits.
  48. */
  49. struct mthca_mpt_entry {
  50. __be32 flags;
  51. __be32 page_size;
  52. __be32 key;
  53. __be32 pd;
  54. __be64 start;
  55. __be64 length;
  56. __be32 lkey;
  57. __be32 window_count;
  58. __be32 window_count_limit;
  59. __be64 mtt_seg;
  60. __be32 mtt_sz; /* Arbel only */
  61. u32 reserved[2];
  62. } __attribute__((packed));
  63. #define MTHCA_MPT_FLAG_SW_OWNS (0xfUL << 28)
  64. #define MTHCA_MPT_FLAG_MIO (1 << 17)
  65. #define MTHCA_MPT_FLAG_BIND_ENABLE (1 << 15)
  66. #define MTHCA_MPT_FLAG_PHYSICAL (1 << 9)
  67. #define MTHCA_MPT_FLAG_REGION (1 << 8)
  68. #define MTHCA_MTT_FLAG_PRESENT 1
  69. #define MTHCA_MPT_STATUS_SW 0xF0
  70. #define MTHCA_MPT_STATUS_HW 0x00
  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 __devinit 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 __devexit 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. 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. static inline u32 tavor_hw_index_to_key(u32 ind)
  241. {
  242. return ind;
  243. }
  244. static inline u32 tavor_key_to_hw_index(u32 key)
  245. {
  246. return key;
  247. }
  248. static inline u32 arbel_hw_index_to_key(u32 ind)
  249. {
  250. return (ind >> 24) | (ind << 8);
  251. }
  252. static inline u32 arbel_key_to_hw_index(u32 key)
  253. {
  254. return (key << 24) | (key >> 8);
  255. }
  256. static inline u32 hw_index_to_key(struct mthca_dev *dev, u32 ind)
  257. {
  258. if (mthca_is_memfree(dev))
  259. return arbel_hw_index_to_key(ind);
  260. else
  261. return tavor_hw_index_to_key(ind);
  262. }
  263. static inline u32 key_to_hw_index(struct mthca_dev *dev, u32 key)
  264. {
  265. if (mthca_is_memfree(dev))
  266. return arbel_key_to_hw_index(key);
  267. else
  268. return tavor_key_to_hw_index(key);
  269. }
  270. int mthca_mr_alloc(struct mthca_dev *dev, u32 pd, int buffer_size_shift,
  271. u64 iova, u64 total_size, u32 access, struct mthca_mr *mr)
  272. {
  273. struct mthca_mailbox *mailbox;
  274. struct mthca_mpt_entry *mpt_entry;
  275. u32 key;
  276. int i;
  277. int err;
  278. u8 status;
  279. might_sleep();
  280. WARN_ON(buffer_size_shift >= 32);
  281. key = mthca_alloc(&dev->mr_table.mpt_alloc);
  282. if (key == -1)
  283. return -ENOMEM;
  284. mr->ibmr.rkey = mr->ibmr.lkey = hw_index_to_key(dev, key);
  285. if (mthca_is_memfree(dev)) {
  286. err = mthca_table_get(dev, dev->mr_table.mpt_table, key);
  287. if (err)
  288. goto err_out_mpt_free;
  289. }
  290. mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
  291. if (IS_ERR(mailbox)) {
  292. err = PTR_ERR(mailbox);
  293. goto err_out_table;
  294. }
  295. mpt_entry = mailbox->buf;
  296. mpt_entry->flags = cpu_to_be32(MTHCA_MPT_FLAG_SW_OWNS |
  297. MTHCA_MPT_FLAG_MIO |
  298. MTHCA_MPT_FLAG_REGION |
  299. access);
  300. if (!mr->mtt)
  301. mpt_entry->flags |= cpu_to_be32(MTHCA_MPT_FLAG_PHYSICAL);
  302. mpt_entry->page_size = cpu_to_be32(buffer_size_shift - 12);
  303. mpt_entry->key = cpu_to_be32(key);
  304. mpt_entry->pd = cpu_to_be32(pd);
  305. mpt_entry->start = cpu_to_be64(iova);
  306. mpt_entry->length = cpu_to_be64(total_size);
  307. memset(&mpt_entry->lkey, 0,
  308. sizeof *mpt_entry - offsetof(struct mthca_mpt_entry, lkey));
  309. if (mr->mtt)
  310. mpt_entry->mtt_seg =
  311. cpu_to_be64(dev->mr_table.mtt_base +
  312. mr->mtt->first_seg * MTHCA_MTT_SEG_SIZE);
  313. if (0) {
  314. mthca_dbg(dev, "Dumping MPT entry %08x:\n", mr->ibmr.lkey);
  315. for (i = 0; i < sizeof (struct mthca_mpt_entry) / 4; ++i) {
  316. if (i % 4 == 0)
  317. printk("[%02x] ", i * 4);
  318. printk(" %08x", be32_to_cpu(((__be32 *) mpt_entry)[i]));
  319. if ((i + 1) % 4 == 0)
  320. printk("\n");
  321. }
  322. }
  323. err = mthca_SW2HW_MPT(dev, mailbox,
  324. key & (dev->limits.num_mpts - 1),
  325. &status);
  326. if (err) {
  327. mthca_warn(dev, "SW2HW_MPT failed (%d)\n", err);
  328. goto err_out_mailbox;
  329. } else if (status) {
  330. mthca_warn(dev, "SW2HW_MPT returned status 0x%02x\n",
  331. status);
  332. err = -EINVAL;
  333. goto err_out_mailbox;
  334. }
  335. mthca_free_mailbox(dev, mailbox);
  336. return err;
  337. err_out_mailbox:
  338. mthca_free_mailbox(dev, mailbox);
  339. err_out_table:
  340. mthca_table_put(dev, dev->mr_table.mpt_table, key);
  341. err_out_mpt_free:
  342. mthca_free(&dev->mr_table.mpt_alloc, key);
  343. return err;
  344. }
  345. int mthca_mr_alloc_notrans(struct mthca_dev *dev, u32 pd,
  346. u32 access, struct mthca_mr *mr)
  347. {
  348. mr->mtt = NULL;
  349. return mthca_mr_alloc(dev, pd, 12, 0, ~0ULL, access, mr);
  350. }
  351. int mthca_mr_alloc_phys(struct mthca_dev *dev, u32 pd,
  352. u64 *buffer_list, int buffer_size_shift,
  353. int list_len, u64 iova, u64 total_size,
  354. u32 access, struct mthca_mr *mr)
  355. {
  356. int err;
  357. mr->mtt = mthca_alloc_mtt(dev, list_len);
  358. if (IS_ERR(mr->mtt))
  359. return PTR_ERR(mr->mtt);
  360. err = mthca_write_mtt(dev, mr->mtt, 0, buffer_list, list_len);
  361. if (err) {
  362. mthca_free_mtt(dev, mr->mtt);
  363. return err;
  364. }
  365. err = mthca_mr_alloc(dev, pd, buffer_size_shift, iova,
  366. total_size, access, mr);
  367. if (err)
  368. mthca_free_mtt(dev, mr->mtt);
  369. return err;
  370. }
  371. /* Free mr or fmr */
  372. static void mthca_free_region(struct mthca_dev *dev, u32 lkey)
  373. {
  374. mthca_table_put(dev, dev->mr_table.mpt_table,
  375. key_to_hw_index(dev, lkey));
  376. mthca_free(&dev->mr_table.mpt_alloc, key_to_hw_index(dev, lkey));
  377. }
  378. void mthca_free_mr(struct mthca_dev *dev, struct mthca_mr *mr)
  379. {
  380. int err;
  381. u8 status;
  382. might_sleep();
  383. err = mthca_HW2SW_MPT(dev, NULL,
  384. key_to_hw_index(dev, mr->ibmr.lkey) &
  385. (dev->limits.num_mpts - 1),
  386. &status);
  387. if (err)
  388. mthca_warn(dev, "HW2SW_MPT failed (%d)\n", err);
  389. else if (status)
  390. mthca_warn(dev, "HW2SW_MPT returned status 0x%02x\n",
  391. status);
  392. mthca_free_region(dev, mr->ibmr.lkey);
  393. mthca_free_mtt(dev, mr->mtt);
  394. }
  395. int mthca_fmr_alloc(struct mthca_dev *dev, u32 pd,
  396. u32 access, struct mthca_fmr *mr)
  397. {
  398. struct mthca_mpt_entry *mpt_entry;
  399. struct mthca_mailbox *mailbox;
  400. u64 mtt_seg;
  401. u32 key, idx;
  402. u8 status;
  403. int list_len = mr->attr.max_pages;
  404. int err = -ENOMEM;
  405. int i;
  406. might_sleep();
  407. if (mr->attr.page_size < 12 || mr->attr.page_size >= 32)
  408. return -EINVAL;
  409. /* For Arbel, all MTTs must fit in the same page. */
  410. if (mthca_is_memfree(dev) &&
  411. mr->attr.max_pages * sizeof *mr->mem.arbel.mtts > PAGE_SIZE)
  412. return -EINVAL;
  413. mr->maps = 0;
  414. key = mthca_alloc(&dev->mr_table.mpt_alloc);
  415. if (key == -1)
  416. return -ENOMEM;
  417. idx = key & (dev->limits.num_mpts - 1);
  418. mr->ibmr.rkey = mr->ibmr.lkey = hw_index_to_key(dev, key);
  419. if (mthca_is_memfree(dev)) {
  420. err = mthca_table_get(dev, dev->mr_table.mpt_table, key);
  421. if (err)
  422. goto err_out_mpt_free;
  423. mr->mem.arbel.mpt = mthca_table_find(dev->mr_table.mpt_table, key);
  424. BUG_ON(!mr->mem.arbel.mpt);
  425. } else
  426. mr->mem.tavor.mpt = dev->mr_table.tavor_fmr.mpt_base +
  427. sizeof *(mr->mem.tavor.mpt) * idx;
  428. mr->mtt = __mthca_alloc_mtt(dev, list_len, dev->mr_table.fmr_mtt_buddy);
  429. if (IS_ERR(mr->mtt))
  430. goto err_out_table;
  431. mtt_seg = mr->mtt->first_seg * MTHCA_MTT_SEG_SIZE;
  432. if (mthca_is_memfree(dev)) {
  433. mr->mem.arbel.mtts = mthca_table_find(dev->mr_table.mtt_table,
  434. mr->mtt->first_seg);
  435. BUG_ON(!mr->mem.arbel.mtts);
  436. } else
  437. mr->mem.tavor.mtts = dev->mr_table.tavor_fmr.mtt_base + mtt_seg;
  438. mailbox = mthca_alloc_mailbox(dev, GFP_KERNEL);
  439. if (IS_ERR(mailbox))
  440. goto err_out_free_mtt;
  441. mpt_entry = mailbox->buf;
  442. mpt_entry->flags = cpu_to_be32(MTHCA_MPT_FLAG_SW_OWNS |
  443. MTHCA_MPT_FLAG_MIO |
  444. MTHCA_MPT_FLAG_REGION |
  445. access);
  446. mpt_entry->page_size = cpu_to_be32(mr->attr.page_size - 12);
  447. mpt_entry->key = cpu_to_be32(key);
  448. mpt_entry->pd = cpu_to_be32(pd);
  449. memset(&mpt_entry->start, 0,
  450. sizeof *mpt_entry - offsetof(struct mthca_mpt_entry, start));
  451. mpt_entry->mtt_seg = cpu_to_be64(dev->mr_table.mtt_base + mtt_seg);
  452. if (0) {
  453. mthca_dbg(dev, "Dumping MPT entry %08x:\n", mr->ibmr.lkey);
  454. for (i = 0; i < sizeof (struct mthca_mpt_entry) / 4; ++i) {
  455. if (i % 4 == 0)
  456. printk("[%02x] ", i * 4);
  457. printk(" %08x", be32_to_cpu(((__be32 *) mpt_entry)[i]));
  458. if ((i + 1) % 4 == 0)
  459. printk("\n");
  460. }
  461. }
  462. err = mthca_SW2HW_MPT(dev, mailbox,
  463. key & (dev->limits.num_mpts - 1),
  464. &status);
  465. if (err) {
  466. mthca_warn(dev, "SW2HW_MPT failed (%d)\n", err);
  467. goto err_out_mailbox_free;
  468. }
  469. if (status) {
  470. mthca_warn(dev, "SW2HW_MPT returned status 0x%02x\n",
  471. status);
  472. err = -EINVAL;
  473. goto err_out_mailbox_free;
  474. }
  475. mthca_free_mailbox(dev, mailbox);
  476. return 0;
  477. err_out_mailbox_free:
  478. mthca_free_mailbox(dev, mailbox);
  479. err_out_free_mtt:
  480. mthca_free_mtt(dev, mr->mtt);
  481. err_out_table:
  482. mthca_table_put(dev, dev->mr_table.mpt_table, key);
  483. err_out_mpt_free:
  484. mthca_free(&dev->mr_table.mpt_alloc, mr->ibmr.lkey);
  485. return err;
  486. }
  487. int mthca_free_fmr(struct mthca_dev *dev, struct mthca_fmr *fmr)
  488. {
  489. if (fmr->maps)
  490. return -EBUSY;
  491. mthca_free_region(dev, fmr->ibmr.lkey);
  492. mthca_free_mtt(dev, fmr->mtt);
  493. return 0;
  494. }
  495. static inline int mthca_check_fmr(struct mthca_fmr *fmr, u64 *page_list,
  496. int list_len, u64 iova)
  497. {
  498. int i, page_mask;
  499. if (list_len > fmr->attr.max_pages)
  500. return -EINVAL;
  501. page_mask = (1 << fmr->attr.page_size) - 1;
  502. /* We are getting page lists, so va must be page aligned. */
  503. if (iova & page_mask)
  504. return -EINVAL;
  505. /* Trust the user not to pass misaligned data in page_list */
  506. if (0)
  507. for (i = 0; i < list_len; ++i) {
  508. if (page_list[i] & ~page_mask)
  509. return -EINVAL;
  510. }
  511. if (fmr->maps >= fmr->attr.max_maps)
  512. return -EINVAL;
  513. return 0;
  514. }
  515. int mthca_tavor_map_phys_fmr(struct ib_fmr *ibfmr, u64 *page_list,
  516. int list_len, u64 iova)
  517. {
  518. struct mthca_fmr *fmr = to_mfmr(ibfmr);
  519. struct mthca_dev *dev = to_mdev(ibfmr->device);
  520. struct mthca_mpt_entry mpt_entry;
  521. u32 key;
  522. int i, err;
  523. err = mthca_check_fmr(fmr, page_list, list_len, iova);
  524. if (err)
  525. return err;
  526. ++fmr->maps;
  527. key = tavor_key_to_hw_index(fmr->ibmr.lkey);
  528. key += dev->limits.num_mpts;
  529. fmr->ibmr.lkey = fmr->ibmr.rkey = tavor_hw_index_to_key(key);
  530. writeb(MTHCA_MPT_STATUS_SW, fmr->mem.tavor.mpt);
  531. for (i = 0; i < list_len; ++i) {
  532. __be64 mtt_entry = cpu_to_be64(page_list[i] |
  533. MTHCA_MTT_FLAG_PRESENT);
  534. mthca_write64_raw(mtt_entry, fmr->mem.tavor.mtts + i);
  535. }
  536. mpt_entry.lkey = cpu_to_be32(key);
  537. mpt_entry.length = cpu_to_be64(list_len * (1ull << fmr->attr.page_size));
  538. mpt_entry.start = cpu_to_be64(iova);
  539. __raw_writel((__force u32) mpt_entry.lkey, &fmr->mem.tavor.mpt->key);
  540. memcpy_toio(&fmr->mem.tavor.mpt->start, &mpt_entry.start,
  541. offsetof(struct mthca_mpt_entry, window_count) -
  542. offsetof(struct mthca_mpt_entry, start));
  543. writeb(MTHCA_MPT_STATUS_HW, fmr->mem.tavor.mpt);
  544. return 0;
  545. }
  546. int mthca_arbel_map_phys_fmr(struct ib_fmr *ibfmr, u64 *page_list,
  547. int list_len, u64 iova)
  548. {
  549. struct mthca_fmr *fmr = to_mfmr(ibfmr);
  550. struct mthca_dev *dev = to_mdev(ibfmr->device);
  551. u32 key;
  552. int i, err;
  553. err = mthca_check_fmr(fmr, page_list, list_len, iova);
  554. if (err)
  555. return err;
  556. ++fmr->maps;
  557. key = arbel_key_to_hw_index(fmr->ibmr.lkey);
  558. key += dev->limits.num_mpts;
  559. fmr->ibmr.lkey = fmr->ibmr.rkey = arbel_hw_index_to_key(key);
  560. *(u8 *) fmr->mem.arbel.mpt = MTHCA_MPT_STATUS_SW;
  561. wmb();
  562. for (i = 0; i < list_len; ++i)
  563. fmr->mem.arbel.mtts[i] = cpu_to_be64(page_list[i] |
  564. MTHCA_MTT_FLAG_PRESENT);
  565. fmr->mem.arbel.mpt->key = cpu_to_be32(key);
  566. fmr->mem.arbel.mpt->lkey = cpu_to_be32(key);
  567. fmr->mem.arbel.mpt->length = cpu_to_be64(list_len * (1ull << fmr->attr.page_size));
  568. fmr->mem.arbel.mpt->start = cpu_to_be64(iova);
  569. wmb();
  570. *(u8 *) fmr->mem.arbel.mpt = MTHCA_MPT_STATUS_HW;
  571. wmb();
  572. return 0;
  573. }
  574. void mthca_tavor_fmr_unmap(struct mthca_dev *dev, struct mthca_fmr *fmr)
  575. {
  576. u32 key;
  577. if (!fmr->maps)
  578. return;
  579. key = tavor_key_to_hw_index(fmr->ibmr.lkey);
  580. key &= dev->limits.num_mpts - 1;
  581. fmr->ibmr.lkey = fmr->ibmr.rkey = tavor_hw_index_to_key(key);
  582. fmr->maps = 0;
  583. writeb(MTHCA_MPT_STATUS_SW, fmr->mem.tavor.mpt);
  584. }
  585. void mthca_arbel_fmr_unmap(struct mthca_dev *dev, struct mthca_fmr *fmr)
  586. {
  587. u32 key;
  588. if (!fmr->maps)
  589. return;
  590. key = arbel_key_to_hw_index(fmr->ibmr.lkey);
  591. key &= dev->limits.num_mpts - 1;
  592. fmr->ibmr.lkey = fmr->ibmr.rkey = arbel_hw_index_to_key(key);
  593. fmr->maps = 0;
  594. *(u8 *) fmr->mem.arbel.mpt = MTHCA_MPT_STATUS_SW;
  595. }
  596. int __devinit mthca_init_mr_table(struct mthca_dev *dev)
  597. {
  598. int err, i;
  599. err = mthca_alloc_init(&dev->mr_table.mpt_alloc,
  600. dev->limits.num_mpts,
  601. ~0, dev->limits.reserved_mrws);
  602. if (err)
  603. return err;
  604. if (!mthca_is_memfree(dev) &&
  605. (dev->mthca_flags & MTHCA_FLAG_DDR_HIDDEN))
  606. dev->limits.fmr_reserved_mtts = 0;
  607. else
  608. dev->mthca_flags |= MTHCA_FLAG_FMR;
  609. err = mthca_buddy_init(&dev->mr_table.mtt_buddy,
  610. fls(dev->limits.num_mtt_segs - 1));
  611. if (err)
  612. goto err_mtt_buddy;
  613. dev->mr_table.tavor_fmr.mpt_base = NULL;
  614. dev->mr_table.tavor_fmr.mtt_base = NULL;
  615. if (dev->limits.fmr_reserved_mtts) {
  616. i = fls(dev->limits.fmr_reserved_mtts - 1);
  617. if (i >= 31) {
  618. mthca_warn(dev, "Unable to reserve 2^31 FMR MTTs.\n");
  619. err = -EINVAL;
  620. goto err_fmr_mpt;
  621. }
  622. dev->mr_table.tavor_fmr.mpt_base =
  623. ioremap(dev->mr_table.mpt_base,
  624. (1 << i) * sizeof (struct mthca_mpt_entry));
  625. if (!dev->mr_table.tavor_fmr.mpt_base) {
  626. mthca_warn(dev, "MPT ioremap for FMR failed.\n");
  627. err = -ENOMEM;
  628. goto err_fmr_mpt;
  629. }
  630. dev->mr_table.tavor_fmr.mtt_base =
  631. ioremap(dev->mr_table.mtt_base,
  632. (1 << i) * MTHCA_MTT_SEG_SIZE);
  633. if (!dev->mr_table.tavor_fmr.mtt_base) {
  634. mthca_warn(dev, "MTT ioremap for FMR failed.\n");
  635. err = -ENOMEM;
  636. goto err_fmr_mtt;
  637. }
  638. err = mthca_buddy_init(&dev->mr_table.tavor_fmr.mtt_buddy, i);
  639. if (err)
  640. goto err_fmr_mtt_buddy;
  641. /* Prevent regular MRs from using FMR keys */
  642. err = mthca_buddy_alloc(&dev->mr_table.mtt_buddy, i);
  643. if (err)
  644. goto err_reserve_fmr;
  645. dev->mr_table.fmr_mtt_buddy =
  646. &dev->mr_table.tavor_fmr.mtt_buddy;
  647. } else
  648. dev->mr_table.fmr_mtt_buddy = &dev->mr_table.mtt_buddy;
  649. /* FMR table is always the first, take reserved MTTs out of there */
  650. if (dev->limits.reserved_mtts) {
  651. i = fls(dev->limits.reserved_mtts - 1);
  652. if (mthca_alloc_mtt_range(dev, i,
  653. dev->mr_table.fmr_mtt_buddy) == -1) {
  654. mthca_warn(dev, "MTT table of order %d is too small.\n",
  655. dev->mr_table.fmr_mtt_buddy->max_order);
  656. err = -ENOMEM;
  657. goto err_reserve_mtts;
  658. }
  659. }
  660. return 0;
  661. err_reserve_mtts:
  662. err_reserve_fmr:
  663. if (dev->limits.fmr_reserved_mtts)
  664. mthca_buddy_cleanup(&dev->mr_table.tavor_fmr.mtt_buddy);
  665. err_fmr_mtt_buddy:
  666. if (dev->mr_table.tavor_fmr.mtt_base)
  667. iounmap(dev->mr_table.tavor_fmr.mtt_base);
  668. err_fmr_mtt:
  669. if (dev->mr_table.tavor_fmr.mpt_base)
  670. iounmap(dev->mr_table.tavor_fmr.mpt_base);
  671. err_fmr_mpt:
  672. mthca_buddy_cleanup(&dev->mr_table.mtt_buddy);
  673. err_mtt_buddy:
  674. mthca_alloc_cleanup(&dev->mr_table.mpt_alloc);
  675. return err;
  676. }
  677. void __devexit mthca_cleanup_mr_table(struct mthca_dev *dev)
  678. {
  679. /* XXX check if any MRs are still allocated? */
  680. if (dev->limits.fmr_reserved_mtts)
  681. mthca_buddy_cleanup(&dev->mr_table.tavor_fmr.mtt_buddy);
  682. mthca_buddy_cleanup(&dev->mr_table.mtt_buddy);
  683. if (dev->mr_table.tavor_fmr.mtt_base)
  684. iounmap(dev->mr_table.tavor_fmr.mtt_base);
  685. if (dev->mr_table.tavor_fmr.mpt_base)
  686. iounmap(dev->mr_table.tavor_fmr.mpt_base);
  687. mthca_alloc_cleanup(&dev->mr_table.mpt_alloc);
  688. }