core-iso.c 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338
  1. /*
  2. * Isochronous I/O functionality:
  3. * - Isochronous DMA context management
  4. * - Isochronous bus resource management (channels, bandwidth), client side
  5. *
  6. * Copyright (C) 2006 Kristian Hoegsberg <krh@bitplanet.net>
  7. *
  8. * This program is free software; you can redistribute it and/or modify
  9. * it under the terms of the GNU General Public License as published by
  10. * the Free Software Foundation; either version 2 of the License, or
  11. * (at your option) any later version.
  12. *
  13. * This program is distributed in the hope that it will be useful,
  14. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  15. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  16. * GNU General Public License for more details.
  17. *
  18. * You should have received a copy of the GNU General Public License
  19. * along with this program; if not, write to the Free Software Foundation,
  20. * Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
  21. */
  22. #include <linux/dma-mapping.h>
  23. #include <linux/errno.h>
  24. #include <linux/firewire.h>
  25. #include <linux/firewire-constants.h>
  26. #include <linux/kernel.h>
  27. #include <linux/mm.h>
  28. #include <linux/spinlock.h>
  29. #include <linux/vmalloc.h>
  30. #include <asm/byteorder.h>
  31. #include "core.h"
  32. /*
  33. * Isochronous DMA context management
  34. */
  35. int fw_iso_buffer_init(struct fw_iso_buffer *buffer, struct fw_card *card,
  36. int page_count, enum dma_data_direction direction)
  37. {
  38. int i, j;
  39. dma_addr_t address;
  40. buffer->page_count = page_count;
  41. buffer->direction = direction;
  42. buffer->pages = kmalloc(page_count * sizeof(buffer->pages[0]),
  43. GFP_KERNEL);
  44. if (buffer->pages == NULL)
  45. goto out;
  46. for (i = 0; i < buffer->page_count; i++) {
  47. buffer->pages[i] = alloc_page(GFP_KERNEL | GFP_DMA32 | __GFP_ZERO);
  48. if (buffer->pages[i] == NULL)
  49. goto out_pages;
  50. address = dma_map_page(card->device, buffer->pages[i],
  51. 0, PAGE_SIZE, direction);
  52. if (dma_mapping_error(card->device, address)) {
  53. __free_page(buffer->pages[i]);
  54. goto out_pages;
  55. }
  56. set_page_private(buffer->pages[i], address);
  57. }
  58. return 0;
  59. out_pages:
  60. for (j = 0; j < i; j++) {
  61. address = page_private(buffer->pages[j]);
  62. dma_unmap_page(card->device, address,
  63. PAGE_SIZE, direction);
  64. __free_page(buffer->pages[j]);
  65. }
  66. kfree(buffer->pages);
  67. out:
  68. buffer->pages = NULL;
  69. return -ENOMEM;
  70. }
  71. EXPORT_SYMBOL(fw_iso_buffer_init);
  72. int fw_iso_buffer_map(struct fw_iso_buffer *buffer, struct vm_area_struct *vma)
  73. {
  74. unsigned long uaddr;
  75. int i, err;
  76. uaddr = vma->vm_start;
  77. for (i = 0; i < buffer->page_count; i++) {
  78. err = vm_insert_page(vma, uaddr, buffer->pages[i]);
  79. if (err)
  80. return err;
  81. uaddr += PAGE_SIZE;
  82. }
  83. return 0;
  84. }
  85. void fw_iso_buffer_destroy(struct fw_iso_buffer *buffer,
  86. struct fw_card *card)
  87. {
  88. int i;
  89. dma_addr_t address;
  90. for (i = 0; i < buffer->page_count; i++) {
  91. address = page_private(buffer->pages[i]);
  92. dma_unmap_page(card->device, address,
  93. PAGE_SIZE, buffer->direction);
  94. __free_page(buffer->pages[i]);
  95. }
  96. kfree(buffer->pages);
  97. buffer->pages = NULL;
  98. }
  99. EXPORT_SYMBOL(fw_iso_buffer_destroy);
  100. struct fw_iso_context *fw_iso_context_create(struct fw_card *card,
  101. int type, int channel, int speed, size_t header_size,
  102. fw_iso_callback_t callback, void *callback_data)
  103. {
  104. struct fw_iso_context *ctx;
  105. ctx = card->driver->allocate_iso_context(card,
  106. type, channel, header_size);
  107. if (IS_ERR(ctx))
  108. return ctx;
  109. ctx->card = card;
  110. ctx->type = type;
  111. ctx->channel = channel;
  112. ctx->speed = speed;
  113. ctx->header_size = header_size;
  114. ctx->callback = callback;
  115. ctx->callback_data = callback_data;
  116. return ctx;
  117. }
  118. EXPORT_SYMBOL(fw_iso_context_create);
  119. void fw_iso_context_destroy(struct fw_iso_context *ctx)
  120. {
  121. struct fw_card *card = ctx->card;
  122. card->driver->free_iso_context(ctx);
  123. }
  124. EXPORT_SYMBOL(fw_iso_context_destroy);
  125. int fw_iso_context_start(struct fw_iso_context *ctx,
  126. int cycle, int sync, int tags)
  127. {
  128. return ctx->card->driver->start_iso(ctx, cycle, sync, tags);
  129. }
  130. EXPORT_SYMBOL(fw_iso_context_start);
  131. int fw_iso_context_queue(struct fw_iso_context *ctx,
  132. struct fw_iso_packet *packet,
  133. struct fw_iso_buffer *buffer,
  134. unsigned long payload)
  135. {
  136. struct fw_card *card = ctx->card;
  137. return card->driver->queue_iso(ctx, packet, buffer, payload);
  138. }
  139. EXPORT_SYMBOL(fw_iso_context_queue);
  140. int fw_iso_context_stop(struct fw_iso_context *ctx)
  141. {
  142. return ctx->card->driver->stop_iso(ctx);
  143. }
  144. EXPORT_SYMBOL(fw_iso_context_stop);
  145. /*
  146. * Isochronous bus resource management (channels, bandwidth), client side
  147. */
  148. static int manage_bandwidth(struct fw_card *card, int irm_id, int generation,
  149. int bandwidth, bool allocate, __be32 data[2])
  150. {
  151. int try, new, old = allocate ? BANDWIDTH_AVAILABLE_INITIAL : 0;
  152. /*
  153. * On a 1394a IRM with low contention, try < 1 is enough.
  154. * On a 1394-1995 IRM, we need at least try < 2.
  155. * Let's just do try < 5.
  156. */
  157. for (try = 0; try < 5; try++) {
  158. new = allocate ? old - bandwidth : old + bandwidth;
  159. if (new < 0 || new > BANDWIDTH_AVAILABLE_INITIAL)
  160. break;
  161. data[0] = cpu_to_be32(old);
  162. data[1] = cpu_to_be32(new);
  163. switch (fw_run_transaction(card, TCODE_LOCK_COMPARE_SWAP,
  164. irm_id, generation, SCODE_100,
  165. CSR_REGISTER_BASE + CSR_BANDWIDTH_AVAILABLE,
  166. data, sizeof(data))) {
  167. case RCODE_GENERATION:
  168. /* A generation change frees all bandwidth. */
  169. return allocate ? -EAGAIN : bandwidth;
  170. case RCODE_COMPLETE:
  171. if (be32_to_cpup(data) == old)
  172. return bandwidth;
  173. old = be32_to_cpup(data);
  174. /* Fall through. */
  175. }
  176. }
  177. return -EIO;
  178. }
  179. static int manage_channel(struct fw_card *card, int irm_id, int generation,
  180. u32 channels_mask, u64 offset, bool allocate, __be32 data[2])
  181. {
  182. __be32 c, all, old;
  183. int i, retry = 5;
  184. old = all = allocate ? cpu_to_be32(~0) : 0;
  185. for (i = 0; i < 32; i++) {
  186. if (!(channels_mask & 1 << i))
  187. continue;
  188. c = cpu_to_be32(1 << (31 - i));
  189. if ((old & c) != (all & c))
  190. continue;
  191. data[0] = old;
  192. data[1] = old ^ c;
  193. switch (fw_run_transaction(card, TCODE_LOCK_COMPARE_SWAP,
  194. irm_id, generation, SCODE_100,
  195. offset, data, sizeof(data))) {
  196. case RCODE_GENERATION:
  197. /* A generation change frees all channels. */
  198. return allocate ? -EAGAIN : i;
  199. case RCODE_COMPLETE:
  200. if (data[0] == old)
  201. return i;
  202. old = data[0];
  203. /* Is the IRM 1394a-2000 compliant? */
  204. if ((data[0] & c) == (data[1] & c))
  205. continue;
  206. /* 1394-1995 IRM, fall through to retry. */
  207. default:
  208. if (retry--)
  209. i--;
  210. }
  211. }
  212. return -EIO;
  213. }
  214. static void deallocate_channel(struct fw_card *card, int irm_id,
  215. int generation, int channel, __be32 buffer[2])
  216. {
  217. u32 mask;
  218. u64 offset;
  219. mask = channel < 32 ? 1 << channel : 1 << (channel - 32);
  220. offset = channel < 32 ? CSR_REGISTER_BASE + CSR_CHANNELS_AVAILABLE_HI :
  221. CSR_REGISTER_BASE + CSR_CHANNELS_AVAILABLE_LO;
  222. manage_channel(card, irm_id, generation, mask, offset, false, buffer);
  223. }
  224. /**
  225. * fw_iso_resource_manage - Allocate or deallocate a channel and/or bandwidth
  226. *
  227. * In parameters: card, generation, channels_mask, bandwidth, allocate
  228. * Out parameters: channel, bandwidth
  229. * This function blocks (sleeps) during communication with the IRM.
  230. *
  231. * Allocates or deallocates at most one channel out of channels_mask.
  232. * channels_mask is a bitfield with MSB for channel 63 and LSB for channel 0.
  233. * (Note, the IRM's CHANNELS_AVAILABLE is a big-endian bitfield with MSB for
  234. * channel 0 and LSB for channel 63.)
  235. * Allocates or deallocates as many bandwidth allocation units as specified.
  236. *
  237. * Returns channel < 0 if no channel was allocated or deallocated.
  238. * Returns bandwidth = 0 if no bandwidth was allocated or deallocated.
  239. *
  240. * If generation is stale, deallocations succeed but allocations fail with
  241. * channel = -EAGAIN.
  242. *
  243. * If channel allocation fails, no bandwidth will be allocated either.
  244. * If bandwidth allocation fails, no channel will be allocated either.
  245. * But deallocations of channel and bandwidth are tried independently
  246. * of each other's success.
  247. */
  248. void fw_iso_resource_manage(struct fw_card *card, int generation,
  249. u64 channels_mask, int *channel, int *bandwidth,
  250. bool allocate, __be32 buffer[2])
  251. {
  252. u32 channels_hi = channels_mask; /* channels 31...0 */
  253. u32 channels_lo = channels_mask >> 32; /* channels 63...32 */
  254. int irm_id, ret, c = -EINVAL;
  255. spin_lock_irq(&card->lock);
  256. irm_id = card->irm_node->node_id;
  257. spin_unlock_irq(&card->lock);
  258. if (channels_hi)
  259. c = manage_channel(card, irm_id, generation, channels_hi,
  260. CSR_REGISTER_BASE + CSR_CHANNELS_AVAILABLE_HI,
  261. allocate, buffer);
  262. if (channels_lo && c < 0) {
  263. c = manage_channel(card, irm_id, generation, channels_lo,
  264. CSR_REGISTER_BASE + CSR_CHANNELS_AVAILABLE_LO,
  265. allocate, buffer);
  266. if (c >= 0)
  267. c += 32;
  268. }
  269. *channel = c;
  270. if (allocate && channels_mask != 0 && c < 0)
  271. *bandwidth = 0;
  272. if (*bandwidth == 0)
  273. return;
  274. ret = manage_bandwidth(card, irm_id, generation, *bandwidth,
  275. allocate, buffer);
  276. if (ret < 0)
  277. *bandwidth = 0;
  278. if (allocate && ret < 0 && c >= 0) {
  279. deallocate_channel(card, irm_id, generation, c, buffer);
  280. *channel = ret;
  281. }
  282. }