libsrp.c 10 KB

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