icm.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431
  1. /*
  2. * Copyright (c) 2005, 2006, 2007, 2008 Mellanox Technologies. All rights reserved.
  3. * Copyright (c) 2006, 2007 Cisco Systems, Inc. All rights reserved.
  4. *
  5. * This software is available to you under a choice of one of two
  6. * licenses. You may choose to be licensed under the terms of the GNU
  7. * General Public License (GPL) Version 2, available from the file
  8. * COPYING in the main directory of this source tree, or the
  9. * OpenIB.org BSD license below:
  10. *
  11. * Redistribution and use in source and binary forms, with or
  12. * without modification, are permitted provided that the following
  13. * conditions are met:
  14. *
  15. * - Redistributions of source code must retain the above
  16. * copyright notice, this list of conditions and the following
  17. * disclaimer.
  18. *
  19. * - Redistributions in binary form must reproduce the above
  20. * copyright notice, this list of conditions and the following
  21. * disclaimer in the documentation and/or other materials
  22. * provided with the distribution.
  23. *
  24. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  25. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  26. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  27. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  28. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  29. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  30. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  31. * SOFTWARE.
  32. */
  33. #include <linux/errno.h>
  34. #include <linux/mm.h>
  35. #include <linux/scatterlist.h>
  36. #include <linux/slab.h>
  37. #include <linux/mlx4/cmd.h>
  38. #include "mlx4.h"
  39. #include "icm.h"
  40. #include "fw.h"
  41. /*
  42. * We allocate in as big chunks as we can, up to a maximum of 256 KB
  43. * per chunk.
  44. */
  45. enum {
  46. MLX4_ICM_ALLOC_SIZE = 1 << 18,
  47. MLX4_TABLE_CHUNK_SIZE = 1 << 18
  48. };
  49. static void mlx4_free_icm_pages(struct mlx4_dev *dev, struct mlx4_icm_chunk *chunk)
  50. {
  51. int i;
  52. if (chunk->nsg > 0)
  53. pci_unmap_sg(dev->pdev, chunk->mem, chunk->npages,
  54. PCI_DMA_BIDIRECTIONAL);
  55. for (i = 0; i < chunk->npages; ++i)
  56. __free_pages(sg_page(&chunk->mem[i]),
  57. get_order(chunk->mem[i].length));
  58. }
  59. static void mlx4_free_icm_coherent(struct mlx4_dev *dev, struct mlx4_icm_chunk *chunk)
  60. {
  61. int i;
  62. for (i = 0; i < chunk->npages; ++i)
  63. dma_free_coherent(&dev->pdev->dev, chunk->mem[i].length,
  64. lowmem_page_address(sg_page(&chunk->mem[i])),
  65. sg_dma_address(&chunk->mem[i]));
  66. }
  67. void mlx4_free_icm(struct mlx4_dev *dev, struct mlx4_icm *icm, int coherent)
  68. {
  69. struct mlx4_icm_chunk *chunk, *tmp;
  70. if (!icm)
  71. return;
  72. list_for_each_entry_safe(chunk, tmp, &icm->chunk_list, list) {
  73. if (coherent)
  74. mlx4_free_icm_coherent(dev, chunk);
  75. else
  76. mlx4_free_icm_pages(dev, chunk);
  77. kfree(chunk);
  78. }
  79. kfree(icm);
  80. }
  81. static int mlx4_alloc_icm_pages(struct scatterlist *mem, int order, gfp_t gfp_mask)
  82. {
  83. struct page *page;
  84. page = alloc_pages(gfp_mask, order);
  85. if (!page)
  86. return -ENOMEM;
  87. sg_set_page(mem, page, PAGE_SIZE << order, 0);
  88. return 0;
  89. }
  90. static int mlx4_alloc_icm_coherent(struct device *dev, struct scatterlist *mem,
  91. int order, gfp_t gfp_mask)
  92. {
  93. void *buf = dma_alloc_coherent(dev, PAGE_SIZE << order,
  94. &sg_dma_address(mem), gfp_mask);
  95. if (!buf)
  96. return -ENOMEM;
  97. sg_set_buf(mem, buf, PAGE_SIZE << order);
  98. BUG_ON(mem->offset);
  99. sg_dma_len(mem) = PAGE_SIZE << order;
  100. return 0;
  101. }
  102. struct mlx4_icm *mlx4_alloc_icm(struct mlx4_dev *dev, int npages,
  103. gfp_t gfp_mask, int coherent)
  104. {
  105. struct mlx4_icm *icm;
  106. struct mlx4_icm_chunk *chunk = NULL;
  107. int cur_order;
  108. int ret;
  109. /* We use sg_set_buf for coherent allocs, which assumes low memory */
  110. BUG_ON(coherent && (gfp_mask & __GFP_HIGHMEM));
  111. icm = kmalloc(sizeof *icm, gfp_mask & ~(__GFP_HIGHMEM | __GFP_NOWARN));
  112. if (!icm)
  113. return NULL;
  114. icm->refcount = 0;
  115. INIT_LIST_HEAD(&icm->chunk_list);
  116. cur_order = get_order(MLX4_ICM_ALLOC_SIZE);
  117. while (npages > 0) {
  118. if (!chunk) {
  119. chunk = kmalloc(sizeof *chunk,
  120. gfp_mask & ~(__GFP_HIGHMEM | __GFP_NOWARN));
  121. if (!chunk)
  122. goto fail;
  123. sg_init_table(chunk->mem, MLX4_ICM_CHUNK_LEN);
  124. chunk->npages = 0;
  125. chunk->nsg = 0;
  126. list_add_tail(&chunk->list, &icm->chunk_list);
  127. }
  128. while (1 << cur_order > npages)
  129. --cur_order;
  130. if (coherent)
  131. ret = mlx4_alloc_icm_coherent(&dev->pdev->dev,
  132. &chunk->mem[chunk->npages],
  133. cur_order, gfp_mask);
  134. else
  135. ret = mlx4_alloc_icm_pages(&chunk->mem[chunk->npages],
  136. cur_order, gfp_mask);
  137. if (ret) {
  138. if (--cur_order < 0)
  139. goto fail;
  140. else
  141. continue;
  142. }
  143. ++chunk->npages;
  144. if (coherent)
  145. ++chunk->nsg;
  146. else if (chunk->npages == MLX4_ICM_CHUNK_LEN) {
  147. chunk->nsg = pci_map_sg(dev->pdev, chunk->mem,
  148. chunk->npages,
  149. PCI_DMA_BIDIRECTIONAL);
  150. if (chunk->nsg <= 0)
  151. goto fail;
  152. }
  153. if (chunk->npages == MLX4_ICM_CHUNK_LEN)
  154. chunk = NULL;
  155. npages -= 1 << cur_order;
  156. }
  157. if (!coherent && chunk) {
  158. chunk->nsg = pci_map_sg(dev->pdev, chunk->mem,
  159. chunk->npages,
  160. PCI_DMA_BIDIRECTIONAL);
  161. if (chunk->nsg <= 0)
  162. goto fail;
  163. }
  164. return icm;
  165. fail:
  166. mlx4_free_icm(dev, icm, coherent);
  167. return NULL;
  168. }
  169. static int mlx4_MAP_ICM(struct mlx4_dev *dev, struct mlx4_icm *icm, u64 virt)
  170. {
  171. return mlx4_map_cmd(dev, MLX4_CMD_MAP_ICM, icm, virt);
  172. }
  173. static int mlx4_UNMAP_ICM(struct mlx4_dev *dev, u64 virt, u32 page_count)
  174. {
  175. return mlx4_cmd(dev, virt, page_count, 0, MLX4_CMD_UNMAP_ICM,
  176. MLX4_CMD_TIME_CLASS_B);
  177. }
  178. int mlx4_MAP_ICM_AUX(struct mlx4_dev *dev, struct mlx4_icm *icm)
  179. {
  180. return mlx4_map_cmd(dev, MLX4_CMD_MAP_ICM_AUX, icm, -1);
  181. }
  182. int mlx4_UNMAP_ICM_AUX(struct mlx4_dev *dev)
  183. {
  184. return mlx4_cmd(dev, 0, 0, 0, MLX4_CMD_UNMAP_ICM_AUX, MLX4_CMD_TIME_CLASS_B);
  185. }
  186. int mlx4_table_get(struct mlx4_dev *dev, struct mlx4_icm_table *table, int obj)
  187. {
  188. int i = (obj & (table->num_obj - 1)) / (MLX4_TABLE_CHUNK_SIZE / table->obj_size);
  189. int ret = 0;
  190. mutex_lock(&table->mutex);
  191. if (table->icm[i]) {
  192. ++table->icm[i]->refcount;
  193. goto out;
  194. }
  195. table->icm[i] = mlx4_alloc_icm(dev, MLX4_TABLE_CHUNK_SIZE >> PAGE_SHIFT,
  196. (table->lowmem ? GFP_KERNEL : GFP_HIGHUSER) |
  197. __GFP_NOWARN, table->coherent);
  198. if (!table->icm[i]) {
  199. ret = -ENOMEM;
  200. goto out;
  201. }
  202. if (mlx4_MAP_ICM(dev, table->icm[i], table->virt +
  203. (u64) i * MLX4_TABLE_CHUNK_SIZE)) {
  204. mlx4_free_icm(dev, table->icm[i], table->coherent);
  205. table->icm[i] = NULL;
  206. ret = -ENOMEM;
  207. goto out;
  208. }
  209. ++table->icm[i]->refcount;
  210. out:
  211. mutex_unlock(&table->mutex);
  212. return ret;
  213. }
  214. void mlx4_table_put(struct mlx4_dev *dev, struct mlx4_icm_table *table, int obj)
  215. {
  216. int i;
  217. i = (obj & (table->num_obj - 1)) / (MLX4_TABLE_CHUNK_SIZE / table->obj_size);
  218. mutex_lock(&table->mutex);
  219. if (--table->icm[i]->refcount == 0) {
  220. mlx4_UNMAP_ICM(dev, table->virt + i * MLX4_TABLE_CHUNK_SIZE,
  221. MLX4_TABLE_CHUNK_SIZE / MLX4_ICM_PAGE_SIZE);
  222. mlx4_free_icm(dev, table->icm[i], table->coherent);
  223. table->icm[i] = NULL;
  224. }
  225. mutex_unlock(&table->mutex);
  226. }
  227. void *mlx4_table_find(struct mlx4_icm_table *table, int obj, dma_addr_t *dma_handle)
  228. {
  229. int idx, offset, dma_offset, i;
  230. struct mlx4_icm_chunk *chunk;
  231. struct mlx4_icm *icm;
  232. struct page *page = NULL;
  233. if (!table->lowmem)
  234. return NULL;
  235. mutex_lock(&table->mutex);
  236. idx = (obj & (table->num_obj - 1)) * table->obj_size;
  237. icm = table->icm[idx / MLX4_TABLE_CHUNK_SIZE];
  238. dma_offset = offset = idx % MLX4_TABLE_CHUNK_SIZE;
  239. if (!icm)
  240. goto out;
  241. list_for_each_entry(chunk, &icm->chunk_list, list) {
  242. for (i = 0; i < chunk->npages; ++i) {
  243. if (dma_handle && dma_offset >= 0) {
  244. if (sg_dma_len(&chunk->mem[i]) > dma_offset)
  245. *dma_handle = sg_dma_address(&chunk->mem[i]) +
  246. dma_offset;
  247. dma_offset -= sg_dma_len(&chunk->mem[i]);
  248. }
  249. /*
  250. * DMA mapping can merge pages but not split them,
  251. * so if we found the page, dma_handle has already
  252. * been assigned to.
  253. */
  254. if (chunk->mem[i].length > offset) {
  255. page = sg_page(&chunk->mem[i]);
  256. goto out;
  257. }
  258. offset -= chunk->mem[i].length;
  259. }
  260. }
  261. out:
  262. mutex_unlock(&table->mutex);
  263. return page ? lowmem_page_address(page) + offset : NULL;
  264. }
  265. int mlx4_table_get_range(struct mlx4_dev *dev, struct mlx4_icm_table *table,
  266. int start, int end)
  267. {
  268. int inc = MLX4_TABLE_CHUNK_SIZE / table->obj_size;
  269. int i, err;
  270. for (i = start; i <= end; i += inc) {
  271. err = mlx4_table_get(dev, table, i);
  272. if (err)
  273. goto fail;
  274. }
  275. return 0;
  276. fail:
  277. while (i > start) {
  278. i -= inc;
  279. mlx4_table_put(dev, table, i);
  280. }
  281. return err;
  282. }
  283. void mlx4_table_put_range(struct mlx4_dev *dev, struct mlx4_icm_table *table,
  284. int start, int end)
  285. {
  286. int i;
  287. for (i = start; i <= end; i += MLX4_TABLE_CHUNK_SIZE / table->obj_size)
  288. mlx4_table_put(dev, table, i);
  289. }
  290. int mlx4_init_icm_table(struct mlx4_dev *dev, struct mlx4_icm_table *table,
  291. u64 virt, int obj_size, int nobj, int reserved,
  292. int use_lowmem, int use_coherent)
  293. {
  294. int obj_per_chunk;
  295. int num_icm;
  296. unsigned chunk_size;
  297. int i;
  298. obj_per_chunk = MLX4_TABLE_CHUNK_SIZE / obj_size;
  299. num_icm = (nobj + obj_per_chunk - 1) / obj_per_chunk;
  300. table->icm = kcalloc(num_icm, sizeof *table->icm, GFP_KERNEL);
  301. if (!table->icm)
  302. return -ENOMEM;
  303. table->virt = virt;
  304. table->num_icm = num_icm;
  305. table->num_obj = nobj;
  306. table->obj_size = obj_size;
  307. table->lowmem = use_lowmem;
  308. table->coherent = use_coherent;
  309. mutex_init(&table->mutex);
  310. for (i = 0; i * MLX4_TABLE_CHUNK_SIZE < reserved * obj_size; ++i) {
  311. chunk_size = MLX4_TABLE_CHUNK_SIZE;
  312. if ((i + 1) * MLX4_TABLE_CHUNK_SIZE > nobj * obj_size)
  313. chunk_size = PAGE_ALIGN(nobj * obj_size - i * MLX4_TABLE_CHUNK_SIZE);
  314. table->icm[i] = mlx4_alloc_icm(dev, chunk_size >> PAGE_SHIFT,
  315. (use_lowmem ? GFP_KERNEL : GFP_HIGHUSER) |
  316. __GFP_NOWARN, use_coherent);
  317. if (!table->icm[i])
  318. goto err;
  319. if (mlx4_MAP_ICM(dev, table->icm[i], virt + i * MLX4_TABLE_CHUNK_SIZE)) {
  320. mlx4_free_icm(dev, table->icm[i], use_coherent);
  321. table->icm[i] = NULL;
  322. goto err;
  323. }
  324. /*
  325. * Add a reference to this ICM chunk so that it never
  326. * gets freed (since it contains reserved firmware objects).
  327. */
  328. ++table->icm[i]->refcount;
  329. }
  330. return 0;
  331. err:
  332. for (i = 0; i < num_icm; ++i)
  333. if (table->icm[i]) {
  334. mlx4_UNMAP_ICM(dev, virt + i * MLX4_TABLE_CHUNK_SIZE,
  335. MLX4_TABLE_CHUNK_SIZE / MLX4_ICM_PAGE_SIZE);
  336. mlx4_free_icm(dev, table->icm[i], use_coherent);
  337. }
  338. return -ENOMEM;
  339. }
  340. void mlx4_cleanup_icm_table(struct mlx4_dev *dev, struct mlx4_icm_table *table)
  341. {
  342. int i;
  343. for (i = 0; i < table->num_icm; ++i)
  344. if (table->icm[i]) {
  345. mlx4_UNMAP_ICM(dev, table->virt + i * MLX4_TABLE_CHUNK_SIZE,
  346. MLX4_TABLE_CHUNK_SIZE / MLX4_ICM_PAGE_SIZE);
  347. mlx4_free_icm(dev, table->icm[i], table->coherent);
  348. }
  349. kfree(table->icm);
  350. }