iser_memory.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479
  1. /*
  2. * Copyright (c) 2004, 2005, 2006 Voltaire, Inc. All rights reserved.
  3. *
  4. * This software is available to you under a choice of one of two
  5. * licenses. You may choose to be licensed under the terms of the GNU
  6. * General Public License (GPL) Version 2, available from the file
  7. * COPYING in the main directory of this source tree, or the
  8. * OpenIB.org BSD license below:
  9. *
  10. * Redistribution and use in source and binary forms, with or
  11. * without modification, are permitted provided that the following
  12. * conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above
  15. * copyright notice, this list of conditions and the following
  16. * disclaimer.
  17. *
  18. * - Redistributions in binary form must reproduce the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer in the documentation and/or other materials
  21. * provided with the distribution.
  22. *
  23. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  24. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  25. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  26. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  27. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  28. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  29. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  30. * SOFTWARE.
  31. *
  32. * $Id: iser_memory.c 6964 2006-05-07 11:11:43Z ogerlitz $
  33. */
  34. #include <linux/module.h>
  35. #include <linux/kernel.h>
  36. #include <linux/slab.h>
  37. #include <linux/mm.h>
  38. #include <linux/highmem.h>
  39. #include <linux/scatterlist.h>
  40. #include "iscsi_iser.h"
  41. #define ISER_KMALLOC_THRESHOLD 0x20000 /* 128K - kmalloc limit */
  42. /**
  43. * Decrements the reference count for the
  44. * registered buffer & releases it
  45. *
  46. * returns 0 if released, 1 if deferred
  47. */
  48. int iser_regd_buff_release(struct iser_regd_buf *regd_buf)
  49. {
  50. struct ib_device *dev;
  51. if ((atomic_read(&regd_buf->ref_count) == 0) ||
  52. atomic_dec_and_test(&regd_buf->ref_count)) {
  53. /* if we used the dma mr, unreg is just NOP */
  54. if (regd_buf->reg.is_fmr)
  55. iser_unreg_mem(&regd_buf->reg);
  56. if (regd_buf->dma_addr) {
  57. dev = regd_buf->device->ib_device;
  58. ib_dma_unmap_single(dev,
  59. regd_buf->dma_addr,
  60. regd_buf->data_size,
  61. regd_buf->direction);
  62. }
  63. /* else this regd buf is associated with task which we */
  64. /* dma_unmap_single/sg later */
  65. return 0;
  66. } else {
  67. iser_dbg("Release deferred, regd.buff: 0x%p\n", regd_buf);
  68. return 1;
  69. }
  70. }
  71. /**
  72. * iser_reg_single - fills registered buffer descriptor with
  73. * registration information
  74. */
  75. void iser_reg_single(struct iser_device *device,
  76. struct iser_regd_buf *regd_buf,
  77. enum dma_data_direction direction)
  78. {
  79. u64 dma_addr;
  80. dma_addr = ib_dma_map_single(device->ib_device,
  81. regd_buf->virt_addr,
  82. regd_buf->data_size, direction);
  83. BUG_ON(ib_dma_mapping_error(device->ib_device, dma_addr));
  84. regd_buf->reg.lkey = device->mr->lkey;
  85. regd_buf->reg.len = regd_buf->data_size;
  86. regd_buf->reg.va = dma_addr;
  87. regd_buf->reg.is_fmr = 0;
  88. regd_buf->dma_addr = dma_addr;
  89. regd_buf->direction = direction;
  90. }
  91. /**
  92. * iser_start_rdma_unaligned_sg
  93. */
  94. static int iser_start_rdma_unaligned_sg(struct iscsi_iser_cmd_task *iser_ctask,
  95. enum iser_data_dir cmd_dir)
  96. {
  97. int dma_nents;
  98. struct ib_device *dev;
  99. char *mem = NULL;
  100. struct iser_data_buf *data = &iser_ctask->data[cmd_dir];
  101. unsigned long cmd_data_len = data->data_len;
  102. if (cmd_data_len > ISER_KMALLOC_THRESHOLD)
  103. mem = (void *)__get_free_pages(GFP_NOIO,
  104. ilog2(roundup_pow_of_two(cmd_data_len)) - PAGE_SHIFT);
  105. else
  106. mem = kmalloc(cmd_data_len, GFP_NOIO);
  107. if (mem == NULL) {
  108. iser_err("Failed to allocate mem size %d %d for copying sglist\n",
  109. data->size,(int)cmd_data_len);
  110. return -ENOMEM;
  111. }
  112. if (cmd_dir == ISER_DIR_OUT) {
  113. /* copy the unaligned sg the buffer which is used for RDMA */
  114. struct scatterlist *sg = (struct scatterlist *)data->buf;
  115. int i;
  116. char *p, *from;
  117. for (p = mem, i = 0; i < data->size; i++) {
  118. from = kmap_atomic(sg[i].page, KM_USER0);
  119. memcpy(p,
  120. from + sg[i].offset,
  121. sg[i].length);
  122. kunmap_atomic(from, KM_USER0);
  123. p += sg[i].length;
  124. }
  125. }
  126. sg_init_one(&iser_ctask->data_copy[cmd_dir].sg_single, mem, cmd_data_len);
  127. iser_ctask->data_copy[cmd_dir].buf =
  128. &iser_ctask->data_copy[cmd_dir].sg_single;
  129. iser_ctask->data_copy[cmd_dir].size = 1;
  130. iser_ctask->data_copy[cmd_dir].copy_buf = mem;
  131. dev = iser_ctask->iser_conn->ib_conn->device->ib_device;
  132. dma_nents = ib_dma_map_sg(dev,
  133. &iser_ctask->data_copy[cmd_dir].sg_single,
  134. 1,
  135. (cmd_dir == ISER_DIR_OUT) ?
  136. DMA_TO_DEVICE : DMA_FROM_DEVICE);
  137. BUG_ON(dma_nents == 0);
  138. iser_ctask->data_copy[cmd_dir].dma_nents = dma_nents;
  139. return 0;
  140. }
  141. /**
  142. * iser_finalize_rdma_unaligned_sg
  143. */
  144. void iser_finalize_rdma_unaligned_sg(struct iscsi_iser_cmd_task *iser_ctask,
  145. enum iser_data_dir cmd_dir)
  146. {
  147. struct ib_device *dev;
  148. struct iser_data_buf *mem_copy;
  149. unsigned long cmd_data_len;
  150. dev = iser_ctask->iser_conn->ib_conn->device->ib_device;
  151. mem_copy = &iser_ctask->data_copy[cmd_dir];
  152. ib_dma_unmap_sg(dev, &mem_copy->sg_single, 1,
  153. (cmd_dir == ISER_DIR_OUT) ?
  154. DMA_TO_DEVICE : DMA_FROM_DEVICE);
  155. if (cmd_dir == ISER_DIR_IN) {
  156. char *mem;
  157. struct scatterlist *sg;
  158. unsigned char *p, *to;
  159. unsigned int sg_size;
  160. int i;
  161. /* copy back read RDMA to unaligned sg */
  162. mem = mem_copy->copy_buf;
  163. sg = (struct scatterlist *)iser_ctask->data[ISER_DIR_IN].buf;
  164. sg_size = iser_ctask->data[ISER_DIR_IN].size;
  165. for (p = mem, i = 0; i < sg_size; i++){
  166. to = kmap_atomic(sg[i].page, KM_SOFTIRQ0);
  167. memcpy(to + sg[i].offset,
  168. p,
  169. sg[i].length);
  170. kunmap_atomic(to, KM_SOFTIRQ0);
  171. p += sg[i].length;
  172. }
  173. }
  174. cmd_data_len = iser_ctask->data[cmd_dir].data_len;
  175. if (cmd_data_len > ISER_KMALLOC_THRESHOLD)
  176. free_pages((unsigned long)mem_copy->copy_buf,
  177. ilog2(roundup_pow_of_two(cmd_data_len)) - PAGE_SHIFT);
  178. else
  179. kfree(mem_copy->copy_buf);
  180. mem_copy->copy_buf = NULL;
  181. }
  182. /**
  183. * iser_sg_to_page_vec - Translates scatterlist entries to physical addresses
  184. * and returns the length of resulting physical address array (may be less than
  185. * the original due to possible compaction).
  186. *
  187. * we build a "page vec" under the assumption that the SG meets the RDMA
  188. * alignment requirements. Other then the first and last SG elements, all
  189. * the "internal" elements can be compacted into a list whose elements are
  190. * dma addresses of physical pages. The code supports also the weird case
  191. * where --few fragments of the same page-- are present in the SG as
  192. * consecutive elements. Also, it handles one entry SG.
  193. */
  194. static int iser_sg_to_page_vec(struct iser_data_buf *data,
  195. struct iser_page_vec *page_vec,
  196. struct ib_device *ibdev)
  197. {
  198. struct scatterlist *sg = (struct scatterlist *)data->buf;
  199. u64 first_addr, last_addr, page;
  200. int end_aligned;
  201. unsigned int cur_page = 0;
  202. unsigned long total_sz = 0;
  203. int i;
  204. /* compute the offset of first element */
  205. page_vec->offset = (u64) sg[0].offset & ~MASK_4K;
  206. for (i = 0; i < data->dma_nents; i++) {
  207. unsigned int dma_len = ib_sg_dma_len(ibdev, &sg[i]);
  208. total_sz += dma_len;
  209. first_addr = ib_sg_dma_address(ibdev, &sg[i]);
  210. last_addr = first_addr + dma_len;
  211. end_aligned = !(last_addr & ~MASK_4K);
  212. /* continue to collect page fragments till aligned or SG ends */
  213. while (!end_aligned && (i + 1 < data->dma_nents)) {
  214. i++;
  215. dma_len = ib_sg_dma_len(ibdev, &sg[i]);
  216. total_sz += dma_len;
  217. last_addr = ib_sg_dma_address(ibdev, &sg[i]) + dma_len;
  218. end_aligned = !(last_addr & ~MASK_4K);
  219. }
  220. /* handle the 1st page in the 1st DMA element */
  221. if (cur_page == 0) {
  222. page = first_addr & MASK_4K;
  223. page_vec->pages[cur_page] = page;
  224. cur_page++;
  225. page += SIZE_4K;
  226. } else
  227. page = first_addr;
  228. for (; page < last_addr; page += SIZE_4K) {
  229. page_vec->pages[cur_page] = page;
  230. cur_page++;
  231. }
  232. }
  233. page_vec->data_size = total_sz;
  234. iser_dbg("page_vec->data_size:%d cur_page %d\n", page_vec->data_size,cur_page);
  235. return cur_page;
  236. }
  237. #define IS_4K_ALIGNED(addr) ((((unsigned long)addr) & ~MASK_4K) == 0)
  238. /**
  239. * iser_data_buf_aligned_len - Tries to determine the maximal correctly aligned
  240. * for RDMA sub-list of a scatter-gather list of memory buffers, and returns
  241. * the number of entries which are aligned correctly. Supports the case where
  242. * consecutive SG elements are actually fragments of the same physcial page.
  243. */
  244. static unsigned int iser_data_buf_aligned_len(struct iser_data_buf *data,
  245. struct ib_device *ibdev)
  246. {
  247. struct scatterlist *sg;
  248. u64 end_addr, next_addr;
  249. int i, cnt;
  250. unsigned int ret_len = 0;
  251. sg = (struct scatterlist *)data->buf;
  252. for (cnt = 0, i = 0; i < data->dma_nents; i++, cnt++) {
  253. /* iser_dbg("Checking sg iobuf [%d]: phys=0x%08lX "
  254. "offset: %ld sz: %ld\n", i,
  255. (unsigned long)page_to_phys(sg[i].page),
  256. (unsigned long)sg[i].offset,
  257. (unsigned long)sg[i].length); */
  258. end_addr = ib_sg_dma_address(ibdev, &sg[i]) +
  259. ib_sg_dma_len(ibdev, &sg[i]);
  260. /* iser_dbg("Checking sg iobuf end address "
  261. "0x%08lX\n", end_addr); */
  262. if (i + 1 < data->dma_nents) {
  263. next_addr = ib_sg_dma_address(ibdev, &sg[i+1]);
  264. /* are i, i+1 fragments of the same page? */
  265. if (end_addr == next_addr)
  266. continue;
  267. else if (!IS_4K_ALIGNED(end_addr)) {
  268. ret_len = cnt + 1;
  269. break;
  270. }
  271. }
  272. }
  273. if (i == data->dma_nents)
  274. ret_len = cnt; /* loop ended */
  275. iser_dbg("Found %d aligned entries out of %d in sg:0x%p\n",
  276. ret_len, data->dma_nents, data);
  277. return ret_len;
  278. }
  279. static void iser_data_buf_dump(struct iser_data_buf *data,
  280. struct ib_device *ibdev)
  281. {
  282. struct scatterlist *sg = (struct scatterlist *)data->buf;
  283. int i;
  284. for (i = 0; i < data->dma_nents; i++)
  285. iser_err("sg[%d] dma_addr:0x%lX page:0x%p "
  286. "off:0x%x sz:0x%x dma_len:0x%x\n",
  287. i, (unsigned long)ib_sg_dma_address(ibdev, &sg[i]),
  288. sg[i].page, sg[i].offset,
  289. sg[i].length, ib_sg_dma_len(ibdev, &sg[i]));
  290. }
  291. static void iser_dump_page_vec(struct iser_page_vec *page_vec)
  292. {
  293. int i;
  294. iser_err("page vec length %d data size %d\n",
  295. page_vec->length, page_vec->data_size);
  296. for (i = 0; i < page_vec->length; i++)
  297. iser_err("%d %lx\n",i,(unsigned long)page_vec->pages[i]);
  298. }
  299. static void iser_page_vec_build(struct iser_data_buf *data,
  300. struct iser_page_vec *page_vec,
  301. struct ib_device *ibdev)
  302. {
  303. int page_vec_len = 0;
  304. page_vec->length = 0;
  305. page_vec->offset = 0;
  306. iser_dbg("Translating sg sz: %d\n", data->dma_nents);
  307. page_vec_len = iser_sg_to_page_vec(data, page_vec, ibdev);
  308. iser_dbg("sg len %d page_vec_len %d\n", data->dma_nents,page_vec_len);
  309. page_vec->length = page_vec_len;
  310. if (page_vec_len * SIZE_4K < page_vec->data_size) {
  311. iser_err("page_vec too short to hold this SG\n");
  312. iser_data_buf_dump(data, ibdev);
  313. iser_dump_page_vec(page_vec);
  314. BUG();
  315. }
  316. }
  317. int iser_dma_map_task_data(struct iscsi_iser_cmd_task *iser_ctask,
  318. struct iser_data_buf *data,
  319. enum iser_data_dir iser_dir,
  320. enum dma_data_direction dma_dir)
  321. {
  322. struct ib_device *dev;
  323. iser_ctask->dir[iser_dir] = 1;
  324. dev = iser_ctask->iser_conn->ib_conn->device->ib_device;
  325. data->dma_nents = ib_dma_map_sg(dev, data->buf, data->size, dma_dir);
  326. if (data->dma_nents == 0) {
  327. iser_err("dma_map_sg failed!!!\n");
  328. return -EINVAL;
  329. }
  330. return 0;
  331. }
  332. void iser_dma_unmap_task_data(struct iscsi_iser_cmd_task *iser_ctask)
  333. {
  334. struct ib_device *dev;
  335. struct iser_data_buf *data;
  336. dev = iser_ctask->iser_conn->ib_conn->device->ib_device;
  337. if (iser_ctask->dir[ISER_DIR_IN]) {
  338. data = &iser_ctask->data[ISER_DIR_IN];
  339. ib_dma_unmap_sg(dev, data->buf, data->size, DMA_FROM_DEVICE);
  340. }
  341. if (iser_ctask->dir[ISER_DIR_OUT]) {
  342. data = &iser_ctask->data[ISER_DIR_OUT];
  343. ib_dma_unmap_sg(dev, data->buf, data->size, DMA_TO_DEVICE);
  344. }
  345. }
  346. /**
  347. * iser_reg_rdma_mem - Registers memory intended for RDMA,
  348. * obtaining rkey and va
  349. *
  350. * returns 0 on success, errno code on failure
  351. */
  352. int iser_reg_rdma_mem(struct iscsi_iser_cmd_task *iser_ctask,
  353. enum iser_data_dir cmd_dir)
  354. {
  355. struct iser_conn *ib_conn = iser_ctask->iser_conn->ib_conn;
  356. struct iser_device *device = ib_conn->device;
  357. struct ib_device *ibdev = device->ib_device;
  358. struct iser_data_buf *mem = &iser_ctask->data[cmd_dir];
  359. struct iser_regd_buf *regd_buf;
  360. int aligned_len;
  361. int err;
  362. int i;
  363. struct scatterlist *sg;
  364. regd_buf = &iser_ctask->rdma_regd[cmd_dir];
  365. aligned_len = iser_data_buf_aligned_len(mem, ibdev);
  366. if (aligned_len != mem->dma_nents) {
  367. iser_err("rdma alignment violation %d/%d aligned\n",
  368. aligned_len, mem->size);
  369. iser_data_buf_dump(mem, ibdev);
  370. /* unmap the command data before accessing it */
  371. iser_dma_unmap_task_data(iser_ctask);
  372. /* allocate copy buf, if we are writing, copy the */
  373. /* unaligned scatterlist, dma map the copy */
  374. if (iser_start_rdma_unaligned_sg(iser_ctask, cmd_dir) != 0)
  375. return -ENOMEM;
  376. mem = &iser_ctask->data_copy[cmd_dir];
  377. }
  378. /* if there a single dma entry, FMR is not needed */
  379. if (mem->dma_nents == 1) {
  380. sg = (struct scatterlist *)mem->buf;
  381. regd_buf->reg.lkey = device->mr->lkey;
  382. regd_buf->reg.rkey = device->mr->rkey;
  383. regd_buf->reg.len = ib_sg_dma_len(ibdev, &sg[0]);
  384. regd_buf->reg.va = ib_sg_dma_address(ibdev, &sg[0]);
  385. regd_buf->reg.is_fmr = 0;
  386. iser_dbg("PHYSICAL Mem.register: lkey: 0x%08X rkey: 0x%08X "
  387. "va: 0x%08lX sz: %ld]\n",
  388. (unsigned int)regd_buf->reg.lkey,
  389. (unsigned int)regd_buf->reg.rkey,
  390. (unsigned long)regd_buf->reg.va,
  391. (unsigned long)regd_buf->reg.len);
  392. } else { /* use FMR for multiple dma entries */
  393. iser_page_vec_build(mem, ib_conn->page_vec, ibdev);
  394. err = iser_reg_page_vec(ib_conn, ib_conn->page_vec, &regd_buf->reg);
  395. if (err) {
  396. iser_data_buf_dump(mem, ibdev);
  397. iser_err("mem->dma_nents = %d (dlength = 0x%x)\n", mem->dma_nents,
  398. ntoh24(iser_ctask->desc.iscsi_header.dlength));
  399. iser_err("page_vec: data_size = 0x%x, length = %d, offset = 0x%x\n",
  400. ib_conn->page_vec->data_size, ib_conn->page_vec->length,
  401. ib_conn->page_vec->offset);
  402. for (i=0 ; i<ib_conn->page_vec->length ; i++)
  403. iser_err("page_vec[%d] = 0x%llx\n", i,
  404. (unsigned long long) ib_conn->page_vec->pages[i]);
  405. return err;
  406. }
  407. }
  408. /* take a reference on this regd buf such that it will not be released *
  409. * (eg in send dto completion) before we get the scsi response */
  410. atomic_inc(&regd_buf->ref_count);
  411. return 0;
  412. }