libsrp.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447
  1. /*
  2. * SCSI RDMA Protocol lib functions
  3. *
  4. * Copyright (C) 2006 FUJITA Tomonori <tomof@acm.org>
  5. *
  6. * This program is free software; you can redistribute it and/or
  7. * modify it under the terms of the GNU General Public License as
  8. * published by the Free Software Foundation; either version 2 of the
  9. * License, or (at your option) any later version.
  10. *
  11. * This program is distributed in the hope that it will be useful, but
  12. * WITHOUT ANY WARRANTY; without even the implied warranty of
  13. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
  14. * General Public License for more details.
  15. *
  16. * You should have received a copy of the GNU General Public License
  17. * along with this program; if not, write to the Free Software
  18. * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
  19. * 02110-1301 USA
  20. */
  21. #include <linux/err.h>
  22. #include <linux/slab.h>
  23. #include <linux/kfifo.h>
  24. #include <linux/scatterlist.h>
  25. #include <linux/dma-mapping.h>
  26. #include <scsi/scsi.h>
  27. #include <scsi/scsi_cmnd.h>
  28. #include <scsi/scsi_tcq.h>
  29. #include <scsi/scsi_tgt.h>
  30. #include <scsi/srp.h>
  31. #include <scsi/libsrp.h>
  32. enum srp_task_attributes {
  33. SRP_SIMPLE_TASK = 0,
  34. SRP_HEAD_TASK = 1,
  35. SRP_ORDERED_TASK = 2,
  36. SRP_ACA_TASK = 4
  37. };
  38. /* tmp - will replace with SCSI logging stuff */
  39. #define eprintk(fmt, args...) \
  40. do { \
  41. printk("%s(%d) " fmt, __func__, __LINE__, ##args); \
  42. } while (0)
  43. /* #define dprintk eprintk */
  44. #define dprintk(fmt, args...)
  45. static int srp_iu_pool_alloc(struct srp_queue *q, size_t max,
  46. struct srp_buf **ring)
  47. {
  48. int i;
  49. struct iu_entry *iue;
  50. q->pool = kcalloc(max, sizeof(struct iu_entry *), GFP_KERNEL);
  51. if (!q->pool)
  52. return -ENOMEM;
  53. q->items = kcalloc(max, sizeof(struct iu_entry), GFP_KERNEL);
  54. if (!q->items)
  55. goto free_pool;
  56. spin_lock_init(&q->lock);
  57. kfifo_init(&q->queue, (void *) q->pool, max * sizeof(void *));
  58. for (i = 0, iue = q->items; i < max; i++) {
  59. kfifo_in(&q->queue, (void *) &iue, sizeof(void *));
  60. iue->sbuf = ring[i];
  61. iue++;
  62. }
  63. return 0;
  64. kfree(q->items);
  65. free_pool:
  66. kfree(q->pool);
  67. return -ENOMEM;
  68. }
  69. static void srp_iu_pool_free(struct srp_queue *q)
  70. {
  71. kfree(q->items);
  72. kfree(q->pool);
  73. }
  74. static struct srp_buf **srp_ring_alloc(struct device *dev,
  75. size_t max, size_t size)
  76. {
  77. int i;
  78. struct srp_buf **ring;
  79. ring = kcalloc(max, sizeof(struct srp_buf *), GFP_KERNEL);
  80. if (!ring)
  81. return NULL;
  82. for (i = 0; i < max; i++) {
  83. ring[i] = kzalloc(sizeof(struct srp_buf), GFP_KERNEL);
  84. if (!ring[i])
  85. goto out;
  86. ring[i]->buf = dma_alloc_coherent(dev, size, &ring[i]->dma,
  87. GFP_KERNEL);
  88. if (!ring[i]->buf)
  89. goto out;
  90. }
  91. return ring;
  92. out:
  93. for (i = 0; i < max && ring[i]; i++) {
  94. if (ring[i]->buf)
  95. dma_free_coherent(dev, size, ring[i]->buf, ring[i]->dma);
  96. kfree(ring[i]);
  97. }
  98. kfree(ring);
  99. return NULL;
  100. }
  101. static void srp_ring_free(struct device *dev, struct srp_buf **ring, size_t max,
  102. size_t size)
  103. {
  104. int i;
  105. for (i = 0; i < max; i++) {
  106. dma_free_coherent(dev, size, ring[i]->buf, ring[i]->dma);
  107. kfree(ring[i]);
  108. }
  109. kfree(ring);
  110. }
  111. int srp_target_alloc(struct srp_target *target, struct device *dev,
  112. size_t nr, size_t iu_size)
  113. {
  114. int err;
  115. spin_lock_init(&target->lock);
  116. INIT_LIST_HEAD(&target->cmd_queue);
  117. target->dev = dev;
  118. dev_set_drvdata(target->dev, target);
  119. target->srp_iu_size = iu_size;
  120. target->rx_ring_size = nr;
  121. target->rx_ring = srp_ring_alloc(target->dev, nr, iu_size);
  122. if (!target->rx_ring)
  123. return -ENOMEM;
  124. err = srp_iu_pool_alloc(&target->iu_queue, nr, target->rx_ring);
  125. if (err)
  126. goto free_ring;
  127. return 0;
  128. free_ring:
  129. srp_ring_free(target->dev, target->rx_ring, nr, iu_size);
  130. return -ENOMEM;
  131. }
  132. EXPORT_SYMBOL_GPL(srp_target_alloc);
  133. void srp_target_free(struct srp_target *target)
  134. {
  135. srp_ring_free(target->dev, target->rx_ring, target->rx_ring_size,
  136. target->srp_iu_size);
  137. srp_iu_pool_free(&target->iu_queue);
  138. }
  139. EXPORT_SYMBOL_GPL(srp_target_free);
  140. struct iu_entry *srp_iu_get(struct srp_target *target)
  141. {
  142. struct iu_entry *iue = NULL;
  143. if (kfifo_out_locked(&target->iu_queue.queue, (void *) &iue,
  144. sizeof(void *), &target->iu_queue.lock) != sizeof(void *)) {
  145. WARN_ONCE(1, "unexpected fifo state");
  146. return NULL;
  147. }
  148. if (!iue)
  149. return iue;
  150. iue->target = target;
  151. INIT_LIST_HEAD(&iue->ilist);
  152. iue->flags = 0;
  153. return iue;
  154. }
  155. EXPORT_SYMBOL_GPL(srp_iu_get);
  156. void srp_iu_put(struct iu_entry *iue)
  157. {
  158. kfifo_in_locked(&iue->target->iu_queue.queue, (void *) &iue,
  159. sizeof(void *), &iue->target->iu_queue.lock);
  160. }
  161. EXPORT_SYMBOL_GPL(srp_iu_put);
  162. static int srp_direct_data(struct scsi_cmnd *sc, struct srp_direct_buf *md,
  163. enum dma_data_direction dir, srp_rdma_t rdma_io,
  164. int dma_map, int ext_desc)
  165. {
  166. struct iu_entry *iue = NULL;
  167. struct scatterlist *sg = NULL;
  168. int err, nsg = 0, len;
  169. if (dma_map) {
  170. iue = (struct iu_entry *) sc->SCp.ptr;
  171. sg = scsi_sglist(sc);
  172. dprintk("%p %u %u %d\n", iue, scsi_bufflen(sc),
  173. md->len, scsi_sg_count(sc));
  174. nsg = dma_map_sg(iue->target->dev, sg, scsi_sg_count(sc),
  175. DMA_BIDIRECTIONAL);
  176. if (!nsg) {
  177. printk("fail to map %p %d\n", iue, scsi_sg_count(sc));
  178. return 0;
  179. }
  180. len = min(scsi_bufflen(sc), md->len);
  181. } else
  182. len = md->len;
  183. err = rdma_io(sc, sg, nsg, md, 1, dir, len);
  184. if (dma_map)
  185. dma_unmap_sg(iue->target->dev, sg, nsg, DMA_BIDIRECTIONAL);
  186. return err;
  187. }
  188. static int srp_indirect_data(struct scsi_cmnd *sc, struct srp_cmd *cmd,
  189. struct srp_indirect_buf *id,
  190. enum dma_data_direction dir, srp_rdma_t rdma_io,
  191. int dma_map, int ext_desc)
  192. {
  193. struct iu_entry *iue = NULL;
  194. struct srp_direct_buf *md = NULL;
  195. struct scatterlist dummy, *sg = NULL;
  196. dma_addr_t token = 0;
  197. int err = 0;
  198. int nmd, nsg = 0, len;
  199. if (dma_map || ext_desc) {
  200. iue = (struct iu_entry *) sc->SCp.ptr;
  201. sg = scsi_sglist(sc);
  202. dprintk("%p %u %u %d %d\n",
  203. iue, scsi_bufflen(sc), id->len,
  204. cmd->data_in_desc_cnt, cmd->data_out_desc_cnt);
  205. }
  206. nmd = id->table_desc.len / sizeof(struct srp_direct_buf);
  207. if ((dir == DMA_FROM_DEVICE && nmd == cmd->data_in_desc_cnt) ||
  208. (dir == DMA_TO_DEVICE && nmd == cmd->data_out_desc_cnt)) {
  209. md = &id->desc_list[0];
  210. goto rdma;
  211. }
  212. if (ext_desc && dma_map) {
  213. md = dma_alloc_coherent(iue->target->dev, id->table_desc.len,
  214. &token, GFP_KERNEL);
  215. if (!md) {
  216. eprintk("Can't get dma memory %u\n", id->table_desc.len);
  217. return -ENOMEM;
  218. }
  219. sg_init_one(&dummy, md, id->table_desc.len);
  220. sg_dma_address(&dummy) = token;
  221. sg_dma_len(&dummy) = id->table_desc.len;
  222. err = rdma_io(sc, &dummy, 1, &id->table_desc, 1, DMA_TO_DEVICE,
  223. id->table_desc.len);
  224. if (err) {
  225. eprintk("Error copying indirect table %d\n", err);
  226. goto free_mem;
  227. }
  228. } else {
  229. eprintk("This command uses external indirect buffer\n");
  230. return -EINVAL;
  231. }
  232. rdma:
  233. if (dma_map) {
  234. nsg = dma_map_sg(iue->target->dev, sg, scsi_sg_count(sc),
  235. DMA_BIDIRECTIONAL);
  236. if (!nsg) {
  237. eprintk("fail to map %p %d\n", iue, scsi_sg_count(sc));
  238. err = -EIO;
  239. goto free_mem;
  240. }
  241. len = min(scsi_bufflen(sc), id->len);
  242. } else
  243. len = id->len;
  244. err = rdma_io(sc, sg, nsg, md, nmd, dir, len);
  245. if (dma_map)
  246. dma_unmap_sg(iue->target->dev, sg, nsg, DMA_BIDIRECTIONAL);
  247. free_mem:
  248. if (token && dma_map)
  249. dma_free_coherent(iue->target->dev, id->table_desc.len, md, token);
  250. return err;
  251. }
  252. static int data_out_desc_size(struct srp_cmd *cmd)
  253. {
  254. int size = 0;
  255. u8 fmt = cmd->buf_fmt >> 4;
  256. switch (fmt) {
  257. case SRP_NO_DATA_DESC:
  258. break;
  259. case SRP_DATA_DESC_DIRECT:
  260. size = sizeof(struct srp_direct_buf);
  261. break;
  262. case SRP_DATA_DESC_INDIRECT:
  263. size = sizeof(struct srp_indirect_buf) +
  264. sizeof(struct srp_direct_buf) * cmd->data_out_desc_cnt;
  265. break;
  266. default:
  267. eprintk("client error. Invalid data_out_format %x\n", fmt);
  268. break;
  269. }
  270. return size;
  271. }
  272. /*
  273. * TODO: this can be called multiple times for a single command if it
  274. * has very long data.
  275. */
  276. int srp_transfer_data(struct scsi_cmnd *sc, struct srp_cmd *cmd,
  277. srp_rdma_t rdma_io, int dma_map, int ext_desc)
  278. {
  279. struct srp_direct_buf *md;
  280. struct srp_indirect_buf *id;
  281. enum dma_data_direction dir;
  282. int offset, err = 0;
  283. u8 format;
  284. offset = cmd->add_cdb_len & ~3;
  285. dir = srp_cmd_direction(cmd);
  286. if (dir == DMA_FROM_DEVICE)
  287. offset += data_out_desc_size(cmd);
  288. if (dir == DMA_TO_DEVICE)
  289. format = cmd->buf_fmt >> 4;
  290. else
  291. format = cmd->buf_fmt & ((1U << 4) - 1);
  292. switch (format) {
  293. case SRP_NO_DATA_DESC:
  294. break;
  295. case SRP_DATA_DESC_DIRECT:
  296. md = (struct srp_direct_buf *)
  297. (cmd->add_data + offset);
  298. err = srp_direct_data(sc, md, dir, rdma_io, dma_map, ext_desc);
  299. break;
  300. case SRP_DATA_DESC_INDIRECT:
  301. id = (struct srp_indirect_buf *)
  302. (cmd->add_data + offset);
  303. err = srp_indirect_data(sc, cmd, id, dir, rdma_io, dma_map,
  304. ext_desc);
  305. break;
  306. default:
  307. eprintk("Unknown format %d %x\n", dir, format);
  308. err = -EINVAL;
  309. }
  310. return err;
  311. }
  312. EXPORT_SYMBOL_GPL(srp_transfer_data);
  313. static int vscsis_data_length(struct srp_cmd *cmd, enum dma_data_direction dir)
  314. {
  315. struct srp_direct_buf *md;
  316. struct srp_indirect_buf *id;
  317. int len = 0, offset = cmd->add_cdb_len & ~3;
  318. u8 fmt;
  319. if (dir == DMA_TO_DEVICE)
  320. fmt = cmd->buf_fmt >> 4;
  321. else {
  322. fmt = cmd->buf_fmt & ((1U << 4) - 1);
  323. offset += data_out_desc_size(cmd);
  324. }
  325. switch (fmt) {
  326. case SRP_NO_DATA_DESC:
  327. break;
  328. case SRP_DATA_DESC_DIRECT:
  329. md = (struct srp_direct_buf *) (cmd->add_data + offset);
  330. len = md->len;
  331. break;
  332. case SRP_DATA_DESC_INDIRECT:
  333. id = (struct srp_indirect_buf *) (cmd->add_data + offset);
  334. len = id->len;
  335. break;
  336. default:
  337. eprintk("invalid data format %x\n", fmt);
  338. break;
  339. }
  340. return len;
  341. }
  342. int srp_cmd_queue(struct Scsi_Host *shost, struct srp_cmd *cmd, void *info,
  343. u64 itn_id, u64 addr)
  344. {
  345. enum dma_data_direction dir;
  346. struct scsi_cmnd *sc;
  347. int tag, len, err;
  348. switch (cmd->task_attr) {
  349. case SRP_SIMPLE_TASK:
  350. tag = MSG_SIMPLE_TAG;
  351. break;
  352. case SRP_ORDERED_TASK:
  353. tag = MSG_ORDERED_TAG;
  354. break;
  355. case SRP_HEAD_TASK:
  356. tag = MSG_HEAD_TAG;
  357. break;
  358. default:
  359. eprintk("Task attribute %d not supported\n", cmd->task_attr);
  360. tag = MSG_ORDERED_TAG;
  361. }
  362. dir = srp_cmd_direction(cmd);
  363. len = vscsis_data_length(cmd, dir);
  364. dprintk("%p %x %lx %d %d %d %llx\n", info, cmd->cdb[0],
  365. cmd->lun, dir, len, tag, (unsigned long long) cmd->tag);
  366. sc = scsi_host_get_command(shost, dir, GFP_KERNEL);
  367. if (!sc)
  368. return -ENOMEM;
  369. sc->SCp.ptr = info;
  370. memcpy(sc->cmnd, cmd->cdb, MAX_COMMAND_SIZE);
  371. sc->sdb.length = len;
  372. sc->sdb.table.sgl = (void *) (unsigned long) addr;
  373. sc->tag = tag;
  374. err = scsi_tgt_queue_command(sc, itn_id, (struct scsi_lun *)&cmd->lun,
  375. cmd->tag);
  376. if (err)
  377. scsi_host_put_command(shost, sc);
  378. return err;
  379. }
  380. EXPORT_SYMBOL_GPL(srp_cmd_queue);
  381. MODULE_DESCRIPTION("SCSI RDMA Protocol lib functions");
  382. MODULE_AUTHOR("FUJITA Tomonori");
  383. MODULE_LICENSE("GPL");