mthca_mr.c 21 KB

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