mr.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472
  1. /*
  2. * Copyright (c) 2004 Topspin Communications. All rights reserved.
  3. * Copyright (c) 2005 Mellanox Technologies. All rights reserved.
  4. * Copyright (c) 2006, 2007 Cisco Systems, Inc. All rights reserved.
  5. *
  6. * This software is available to you under a choice of one of two
  7. * licenses. You may choose to be licensed under the terms of the GNU
  8. * General Public License (GPL) Version 2, available from the file
  9. * COPYING in the main directory of this source tree, or the
  10. * OpenIB.org BSD license below:
  11. *
  12. * Redistribution and use in source and binary forms, with or
  13. * without modification, are permitted provided that the following
  14. * conditions are met:
  15. *
  16. * - Redistributions of source code must retain the above
  17. * copyright notice, this list of conditions and the following
  18. * disclaimer.
  19. *
  20. * - Redistributions in binary form must reproduce the above
  21. * copyright notice, this list of conditions and the following
  22. * disclaimer in the documentation and/or other materials
  23. * provided with the distribution.
  24. *
  25. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  26. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  27. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  28. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  29. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  30. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  31. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  32. * SOFTWARE.
  33. */
  34. #include <linux/init.h>
  35. #include <linux/errno.h>
  36. #include <linux/mlx4/cmd.h>
  37. #include "mlx4.h"
  38. #include "icm.h"
  39. /*
  40. * Must be packed because mtt_seg is 64 bits but only aligned to 32 bits.
  41. */
  42. struct mlx4_mpt_entry {
  43. __be32 flags;
  44. __be32 qpn;
  45. __be32 key;
  46. __be32 pd;
  47. __be64 start;
  48. __be64 length;
  49. __be32 lkey;
  50. __be32 win_cnt;
  51. u8 reserved1[3];
  52. u8 mtt_rep;
  53. __be64 mtt_seg;
  54. __be32 mtt_sz;
  55. __be32 entity_size;
  56. __be32 first_byte_offset;
  57. } __attribute__((packed));
  58. #define MLX4_MPT_FLAG_SW_OWNS (0xfUL << 28)
  59. #define MLX4_MPT_FLAG_MIO (1 << 17)
  60. #define MLX4_MPT_FLAG_BIND_ENABLE (1 << 15)
  61. #define MLX4_MPT_FLAG_PHYSICAL (1 << 9)
  62. #define MLX4_MPT_FLAG_REGION (1 << 8)
  63. #define MLX4_MTT_FLAG_PRESENT 1
  64. static u32 mlx4_buddy_alloc(struct mlx4_buddy *buddy, int order)
  65. {
  66. int o;
  67. int m;
  68. u32 seg;
  69. spin_lock(&buddy->lock);
  70. for (o = order; o <= buddy->max_order; ++o) {
  71. m = 1 << (buddy->max_order - o);
  72. seg = find_first_bit(buddy->bits[o], m);
  73. if (seg < m)
  74. goto found;
  75. }
  76. spin_unlock(&buddy->lock);
  77. return -1;
  78. found:
  79. clear_bit(seg, buddy->bits[o]);
  80. while (o > order) {
  81. --o;
  82. seg <<= 1;
  83. set_bit(seg ^ 1, buddy->bits[o]);
  84. }
  85. spin_unlock(&buddy->lock);
  86. seg <<= order;
  87. return seg;
  88. }
  89. static void mlx4_buddy_free(struct mlx4_buddy *buddy, u32 seg, int order)
  90. {
  91. seg >>= order;
  92. spin_lock(&buddy->lock);
  93. while (test_bit(seg ^ 1, buddy->bits[order])) {
  94. clear_bit(seg ^ 1, buddy->bits[order]);
  95. seg >>= 1;
  96. ++order;
  97. }
  98. set_bit(seg, buddy->bits[order]);
  99. spin_unlock(&buddy->lock);
  100. }
  101. static int __devinit mlx4_buddy_init(struct mlx4_buddy *buddy, int max_order)
  102. {
  103. int i, s;
  104. buddy->max_order = max_order;
  105. spin_lock_init(&buddy->lock);
  106. buddy->bits = kzalloc((buddy->max_order + 1) * sizeof (long *),
  107. GFP_KERNEL);
  108. if (!buddy->bits)
  109. goto err_out;
  110. for (i = 0; i <= buddy->max_order; ++i) {
  111. s = BITS_TO_LONGS(1 << (buddy->max_order - i));
  112. buddy->bits[i] = kmalloc(s * sizeof (long), GFP_KERNEL);
  113. if (!buddy->bits[i])
  114. goto err_out_free;
  115. bitmap_zero(buddy->bits[i], 1 << (buddy->max_order - i));
  116. }
  117. set_bit(0, buddy->bits[buddy->max_order]);
  118. return 0;
  119. err_out_free:
  120. for (i = 0; i <= buddy->max_order; ++i)
  121. kfree(buddy->bits[i]);
  122. kfree(buddy->bits);
  123. err_out:
  124. return -ENOMEM;
  125. }
  126. static void mlx4_buddy_cleanup(struct mlx4_buddy *buddy)
  127. {
  128. int i;
  129. for (i = 0; i <= buddy->max_order; ++i)
  130. kfree(buddy->bits[i]);
  131. kfree(buddy->bits);
  132. }
  133. static u32 mlx4_alloc_mtt_range(struct mlx4_dev *dev, int order)
  134. {
  135. struct mlx4_mr_table *mr_table = &mlx4_priv(dev)->mr_table;
  136. u32 seg;
  137. seg = mlx4_buddy_alloc(&mr_table->mtt_buddy, order);
  138. if (seg == -1)
  139. return -1;
  140. if (mlx4_table_get_range(dev, &mr_table->mtt_table, seg,
  141. seg + (1 << order) - 1)) {
  142. mlx4_buddy_free(&mr_table->mtt_buddy, seg, order);
  143. return -1;
  144. }
  145. return seg;
  146. }
  147. int mlx4_mtt_init(struct mlx4_dev *dev, int npages, int page_shift,
  148. struct mlx4_mtt *mtt)
  149. {
  150. int i;
  151. if (!npages) {
  152. mtt->order = -1;
  153. mtt->page_shift = MLX4_ICM_PAGE_SHIFT;
  154. return 0;
  155. } else
  156. mtt->page_shift = page_shift;
  157. for (mtt->order = 0, i = MLX4_MTT_ENTRY_PER_SEG; i < npages; i <<= 1)
  158. ++mtt->order;
  159. mtt->first_seg = mlx4_alloc_mtt_range(dev, mtt->order);
  160. if (mtt->first_seg == -1)
  161. return -ENOMEM;
  162. return 0;
  163. }
  164. EXPORT_SYMBOL_GPL(mlx4_mtt_init);
  165. void mlx4_mtt_cleanup(struct mlx4_dev *dev, struct mlx4_mtt *mtt)
  166. {
  167. struct mlx4_mr_table *mr_table = &mlx4_priv(dev)->mr_table;
  168. if (mtt->order < 0)
  169. return;
  170. mlx4_buddy_free(&mr_table->mtt_buddy, mtt->first_seg, mtt->order);
  171. mlx4_table_put_range(dev, &mr_table->mtt_table, mtt->first_seg,
  172. mtt->first_seg + (1 << mtt->order) - 1);
  173. }
  174. EXPORT_SYMBOL_GPL(mlx4_mtt_cleanup);
  175. u64 mlx4_mtt_addr(struct mlx4_dev *dev, struct mlx4_mtt *mtt)
  176. {
  177. return (u64) mtt->first_seg * dev->caps.mtt_entry_sz;
  178. }
  179. EXPORT_SYMBOL_GPL(mlx4_mtt_addr);
  180. static u32 hw_index_to_key(u32 ind)
  181. {
  182. return (ind >> 24) | (ind << 8);
  183. }
  184. static u32 key_to_hw_index(u32 key)
  185. {
  186. return (key << 24) | (key >> 8);
  187. }
  188. static int mlx4_SW2HW_MPT(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  189. int mpt_index)
  190. {
  191. return mlx4_cmd(dev, mailbox->dma, mpt_index, 0, MLX4_CMD_SW2HW_MPT,
  192. MLX4_CMD_TIME_CLASS_B);
  193. }
  194. static int mlx4_HW2SW_MPT(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  195. int mpt_index)
  196. {
  197. return mlx4_cmd_box(dev, 0, mailbox ? mailbox->dma : 0, mpt_index,
  198. !mailbox, MLX4_CMD_HW2SW_MPT, MLX4_CMD_TIME_CLASS_B);
  199. }
  200. int mlx4_mr_alloc(struct mlx4_dev *dev, u32 pd, u64 iova, u64 size, u32 access,
  201. int npages, int page_shift, struct mlx4_mr *mr)
  202. {
  203. struct mlx4_priv *priv = mlx4_priv(dev);
  204. u32 index;
  205. int err;
  206. index = mlx4_bitmap_alloc(&priv->mr_table.mpt_bitmap);
  207. if (index == -1)
  208. return -ENOMEM;
  209. mr->iova = iova;
  210. mr->size = size;
  211. mr->pd = pd;
  212. mr->access = access;
  213. mr->enabled = 0;
  214. mr->key = hw_index_to_key(index);
  215. err = mlx4_mtt_init(dev, npages, page_shift, &mr->mtt);
  216. if (err)
  217. mlx4_bitmap_free(&priv->mr_table.mpt_bitmap, index);
  218. return err;
  219. }
  220. EXPORT_SYMBOL_GPL(mlx4_mr_alloc);
  221. void mlx4_mr_free(struct mlx4_dev *dev, struct mlx4_mr *mr)
  222. {
  223. struct mlx4_priv *priv = mlx4_priv(dev);
  224. int err;
  225. if (mr->enabled) {
  226. err = mlx4_HW2SW_MPT(dev, NULL,
  227. key_to_hw_index(mr->key) &
  228. (dev->caps.num_mpts - 1));
  229. if (err)
  230. mlx4_warn(dev, "HW2SW_MPT failed (%d)\n", err);
  231. }
  232. mlx4_mtt_cleanup(dev, &mr->mtt);
  233. mlx4_bitmap_free(&priv->mr_table.mpt_bitmap, key_to_hw_index(mr->key));
  234. }
  235. EXPORT_SYMBOL_GPL(mlx4_mr_free);
  236. int mlx4_mr_enable(struct mlx4_dev *dev, struct mlx4_mr *mr)
  237. {
  238. struct mlx4_mr_table *mr_table = &mlx4_priv(dev)->mr_table;
  239. struct mlx4_cmd_mailbox *mailbox;
  240. struct mlx4_mpt_entry *mpt_entry;
  241. int err;
  242. err = mlx4_table_get(dev, &mr_table->dmpt_table, key_to_hw_index(mr->key));
  243. if (err)
  244. return err;
  245. mailbox = mlx4_alloc_cmd_mailbox(dev);
  246. if (IS_ERR(mailbox)) {
  247. err = PTR_ERR(mailbox);
  248. goto err_table;
  249. }
  250. mpt_entry = mailbox->buf;
  251. memset(mpt_entry, 0, sizeof *mpt_entry);
  252. mpt_entry->flags = cpu_to_be32(MLX4_MPT_FLAG_SW_OWNS |
  253. MLX4_MPT_FLAG_MIO |
  254. MLX4_MPT_FLAG_REGION |
  255. mr->access);
  256. mpt_entry->key = cpu_to_be32(key_to_hw_index(mr->key));
  257. mpt_entry->pd = cpu_to_be32(mr->pd);
  258. mpt_entry->start = cpu_to_be64(mr->iova);
  259. mpt_entry->length = cpu_to_be64(mr->size);
  260. mpt_entry->entity_size = cpu_to_be32(mr->mtt.page_shift);
  261. if (mr->mtt.order < 0) {
  262. mpt_entry->flags |= cpu_to_be32(MLX4_MPT_FLAG_PHYSICAL);
  263. mpt_entry->mtt_seg = 0;
  264. } else
  265. mpt_entry->mtt_seg = cpu_to_be64(mlx4_mtt_addr(dev, &mr->mtt));
  266. err = mlx4_SW2HW_MPT(dev, mailbox,
  267. key_to_hw_index(mr->key) & (dev->caps.num_mpts - 1));
  268. if (err) {
  269. mlx4_warn(dev, "SW2HW_MPT failed (%d)\n", err);
  270. goto err_cmd;
  271. }
  272. mr->enabled = 1;
  273. mlx4_free_cmd_mailbox(dev, mailbox);
  274. return 0;
  275. err_cmd:
  276. mlx4_free_cmd_mailbox(dev, mailbox);
  277. err_table:
  278. mlx4_table_put(dev, &mr_table->dmpt_table, key_to_hw_index(mr->key));
  279. return err;
  280. }
  281. EXPORT_SYMBOL_GPL(mlx4_mr_enable);
  282. static int mlx4_WRITE_MTT(struct mlx4_dev *dev, struct mlx4_cmd_mailbox *mailbox,
  283. int num_mtt)
  284. {
  285. return mlx4_cmd(dev, mailbox->dma, num_mtt, 0, MLX4_CMD_WRITE_MTT,
  286. MLX4_CMD_TIME_CLASS_B);
  287. }
  288. int mlx4_write_mtt(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  289. int start_index, int npages, u64 *page_list)
  290. {
  291. struct mlx4_cmd_mailbox *mailbox;
  292. __be64 *mtt_entry;
  293. int i;
  294. int err = 0;
  295. if (mtt->order < 0)
  296. return -EINVAL;
  297. mailbox = mlx4_alloc_cmd_mailbox(dev);
  298. if (IS_ERR(mailbox))
  299. return PTR_ERR(mailbox);
  300. mtt_entry = mailbox->buf;
  301. while (npages > 0) {
  302. mtt_entry[0] = cpu_to_be64(mlx4_mtt_addr(dev, mtt) + start_index * 8);
  303. mtt_entry[1] = 0;
  304. for (i = 0; i < npages && i < MLX4_MAILBOX_SIZE / 8 - 2; ++i)
  305. mtt_entry[i + 2] = cpu_to_be64(page_list[i] |
  306. MLX4_MTT_FLAG_PRESENT);
  307. /*
  308. * If we have an odd number of entries to write, add
  309. * one more dummy entry for firmware efficiency.
  310. */
  311. if (i & 1)
  312. mtt_entry[i + 2] = 0;
  313. err = mlx4_WRITE_MTT(dev, mailbox, (i + 1) & ~1);
  314. if (err)
  315. goto out;
  316. npages -= i;
  317. start_index += i;
  318. page_list += i;
  319. }
  320. out:
  321. mlx4_free_cmd_mailbox(dev, mailbox);
  322. return err;
  323. }
  324. EXPORT_SYMBOL_GPL(mlx4_write_mtt);
  325. int mlx4_buf_write_mtt(struct mlx4_dev *dev, struct mlx4_mtt *mtt,
  326. struct mlx4_buf *buf)
  327. {
  328. u64 *page_list;
  329. int err;
  330. int i;
  331. page_list = kmalloc(buf->npages * sizeof *page_list, GFP_KERNEL);
  332. if (!page_list)
  333. return -ENOMEM;
  334. for (i = 0; i < buf->npages; ++i)
  335. if (buf->nbufs == 1)
  336. page_list[i] = buf->u.direct.map + (i << buf->page_shift);
  337. else
  338. page_list[i] = buf->u.page_list[i].map;
  339. err = mlx4_write_mtt(dev, mtt, 0, buf->npages, page_list);
  340. kfree(page_list);
  341. return err;
  342. }
  343. EXPORT_SYMBOL_GPL(mlx4_buf_write_mtt);
  344. int __devinit mlx4_init_mr_table(struct mlx4_dev *dev)
  345. {
  346. struct mlx4_mr_table *mr_table = &mlx4_priv(dev)->mr_table;
  347. int err;
  348. err = mlx4_bitmap_init(&mr_table->mpt_bitmap, dev->caps.num_mpts,
  349. ~0, dev->caps.reserved_mrws);
  350. if (err)
  351. return err;
  352. err = mlx4_buddy_init(&mr_table->mtt_buddy,
  353. ilog2(dev->caps.num_mtt_segs));
  354. if (err)
  355. goto err_buddy;
  356. if (dev->caps.reserved_mtts) {
  357. if (mlx4_alloc_mtt_range(dev, ilog2(dev->caps.reserved_mtts)) == -1) {
  358. mlx4_warn(dev, "MTT table of order %d is too small.\n",
  359. mr_table->mtt_buddy.max_order);
  360. err = -ENOMEM;
  361. goto err_reserve_mtts;
  362. }
  363. }
  364. return 0;
  365. err_reserve_mtts:
  366. mlx4_buddy_cleanup(&mr_table->mtt_buddy);
  367. err_buddy:
  368. mlx4_bitmap_cleanup(&mr_table->mpt_bitmap);
  369. return err;
  370. }
  371. void mlx4_cleanup_mr_table(struct mlx4_dev *dev)
  372. {
  373. struct mlx4_mr_table *mr_table = &mlx4_priv(dev)->mr_table;
  374. mlx4_buddy_cleanup(&mr_table->mtt_buddy);
  375. mlx4_bitmap_cleanup(&mr_table->mpt_bitmap);
  376. }