libsrp.c 10 KB

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