dvb_ringbuffer.c 6.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270
  1. /*
  2. *
  3. * dvb_ringbuffer.c: ring buffer implementation for the dvb driver
  4. *
  5. * Copyright (C) 2003 Oliver Endriss
  6. * Copyright (C) 2004 Andrew de Quincey
  7. *
  8. * based on code originally found in av7110.c & dvb_ci.c:
  9. * Copyright (C) 1999-2003 Ralph Metzler
  10. * & Marcus Metzler for convergence integrated media GmbH
  11. *
  12. * This program is free software; you can redistribute it and/or
  13. * modify it under the terms of the GNU Lesser General Public License
  14. * as published by the Free Software Foundation; either version 2.1
  15. * of the License, or (at your option) any later version.
  16. *
  17. * This program is distributed in the hope that it will be useful,
  18. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  19. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  20. * GNU Lesser General Public License for more details.
  21. *
  22. * You should have received a copy of the GNU Lesser General Public License
  23. * along with this program; if not, write to the Free Software
  24. * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
  25. */
  26. #include <linux/errno.h>
  27. #include <linux/kernel.h>
  28. #include <linux/module.h>
  29. #include <linux/sched.h>
  30. #include <linux/string.h>
  31. #include <asm/uaccess.h>
  32. #include "dvb_ringbuffer.h"
  33. #define PKT_READY 0
  34. #define PKT_DISPOSED 1
  35. void dvb_ringbuffer_init(struct dvb_ringbuffer *rbuf, void *data, size_t len)
  36. {
  37. rbuf->pread=rbuf->pwrite=0;
  38. rbuf->data=data;
  39. rbuf->size=len;
  40. rbuf->error=0;
  41. init_waitqueue_head(&rbuf->queue);
  42. spin_lock_init(&(rbuf->lock));
  43. }
  44. int dvb_ringbuffer_empty(struct dvb_ringbuffer *rbuf)
  45. {
  46. return (rbuf->pread==rbuf->pwrite);
  47. }
  48. ssize_t dvb_ringbuffer_free(struct dvb_ringbuffer *rbuf)
  49. {
  50. ssize_t free;
  51. free = rbuf->pread - rbuf->pwrite;
  52. if (free <= 0)
  53. free += rbuf->size;
  54. return free-1;
  55. }
  56. ssize_t dvb_ringbuffer_avail(struct dvb_ringbuffer *rbuf)
  57. {
  58. ssize_t avail;
  59. avail = rbuf->pwrite - rbuf->pread;
  60. if (avail < 0)
  61. avail += rbuf->size;
  62. return avail;
  63. }
  64. void dvb_ringbuffer_flush(struct dvb_ringbuffer *rbuf)
  65. {
  66. rbuf->pread = rbuf->pwrite;
  67. rbuf->error = 0;
  68. }
  69. void dvb_ringbuffer_reset(struct dvb_ringbuffer *rbuf)
  70. {
  71. rbuf->pread = rbuf->pwrite = 0;
  72. rbuf->error = 0;
  73. }
  74. void dvb_ringbuffer_flush_spinlock_wakeup(struct dvb_ringbuffer *rbuf)
  75. {
  76. unsigned long flags;
  77. spin_lock_irqsave(&rbuf->lock, flags);
  78. dvb_ringbuffer_flush(rbuf);
  79. spin_unlock_irqrestore(&rbuf->lock, flags);
  80. wake_up(&rbuf->queue);
  81. }
  82. ssize_t dvb_ringbuffer_read(struct dvb_ringbuffer *rbuf, u8 *buf, size_t len, int usermem)
  83. {
  84. size_t todo = len;
  85. size_t split;
  86. split = (rbuf->pread + len > rbuf->size) ? rbuf->size - rbuf->pread : 0;
  87. if (split > 0) {
  88. if (!usermem)
  89. memcpy(buf, rbuf->data+rbuf->pread, split);
  90. else
  91. if (copy_to_user(buf, rbuf->data+rbuf->pread, split))
  92. return -EFAULT;
  93. buf += split;
  94. todo -= split;
  95. rbuf->pread = 0;
  96. }
  97. if (!usermem)
  98. memcpy(buf, rbuf->data+rbuf->pread, todo);
  99. else
  100. if (copy_to_user(buf, rbuf->data+rbuf->pread, todo))
  101. return -EFAULT;
  102. rbuf->pread = (rbuf->pread + todo) % rbuf->size;
  103. return len;
  104. }
  105. ssize_t dvb_ringbuffer_write(struct dvb_ringbuffer *rbuf, const u8 *buf, size_t len)
  106. {
  107. size_t todo = len;
  108. size_t split;
  109. split = (rbuf->pwrite + len > rbuf->size) ? rbuf->size - rbuf->pwrite : 0;
  110. if (split > 0) {
  111. memcpy(rbuf->data+rbuf->pwrite, buf, split);
  112. buf += split;
  113. todo -= split;
  114. rbuf->pwrite = 0;
  115. }
  116. memcpy(rbuf->data+rbuf->pwrite, buf, todo);
  117. rbuf->pwrite = (rbuf->pwrite + todo) % rbuf->size;
  118. return len;
  119. }
  120. ssize_t dvb_ringbuffer_pkt_write(struct dvb_ringbuffer *rbuf, u8* buf, size_t len)
  121. {
  122. int status;
  123. ssize_t oldpwrite = rbuf->pwrite;
  124. DVB_RINGBUFFER_WRITE_BYTE(rbuf, len >> 8);
  125. DVB_RINGBUFFER_WRITE_BYTE(rbuf, len & 0xff);
  126. DVB_RINGBUFFER_WRITE_BYTE(rbuf, PKT_READY);
  127. status = dvb_ringbuffer_write(rbuf, buf, len);
  128. if (status < 0) rbuf->pwrite = oldpwrite;
  129. return status;
  130. }
  131. ssize_t dvb_ringbuffer_pkt_read(struct dvb_ringbuffer *rbuf, size_t idx,
  132. int offset, u8* buf, size_t len, int usermem)
  133. {
  134. size_t todo;
  135. size_t split;
  136. size_t pktlen;
  137. pktlen = rbuf->data[idx] << 8;
  138. pktlen |= rbuf->data[(idx + 1) % rbuf->size];
  139. if (offset > pktlen) return -EINVAL;
  140. if ((offset + len) > pktlen) len = pktlen - offset;
  141. idx = (idx + DVB_RINGBUFFER_PKTHDRSIZE + offset) % rbuf->size;
  142. todo = len;
  143. split = ((idx + len) > rbuf->size) ? rbuf->size - idx : 0;
  144. if (split > 0) {
  145. if (!usermem)
  146. memcpy(buf, rbuf->data+idx, split);
  147. else
  148. if (copy_to_user(buf, rbuf->data+idx, split))
  149. return -EFAULT;
  150. buf += split;
  151. todo -= split;
  152. idx = 0;
  153. }
  154. if (!usermem)
  155. memcpy(buf, rbuf->data+idx, todo);
  156. else
  157. if (copy_to_user(buf, rbuf->data+idx, todo))
  158. return -EFAULT;
  159. return len;
  160. }
  161. void dvb_ringbuffer_pkt_dispose(struct dvb_ringbuffer *rbuf, size_t idx)
  162. {
  163. size_t pktlen;
  164. rbuf->data[(idx + 2) % rbuf->size] = PKT_DISPOSED;
  165. // clean up disposed packets
  166. while(dvb_ringbuffer_avail(rbuf) > DVB_RINGBUFFER_PKTHDRSIZE) {
  167. if (DVB_RINGBUFFER_PEEK(rbuf, 2) == PKT_DISPOSED) {
  168. pktlen = DVB_RINGBUFFER_PEEK(rbuf, 0) << 8;
  169. pktlen |= DVB_RINGBUFFER_PEEK(rbuf, 1);
  170. DVB_RINGBUFFER_SKIP(rbuf, pktlen + DVB_RINGBUFFER_PKTHDRSIZE);
  171. } else {
  172. // first packet is not disposed, so we stop cleaning now
  173. break;
  174. }
  175. }
  176. }
  177. ssize_t dvb_ringbuffer_pkt_next(struct dvb_ringbuffer *rbuf, size_t idx, size_t* pktlen)
  178. {
  179. int consumed;
  180. int curpktlen;
  181. int curpktstatus;
  182. if (idx == -1) {
  183. idx = rbuf->pread;
  184. } else {
  185. curpktlen = rbuf->data[idx] << 8;
  186. curpktlen |= rbuf->data[(idx + 1) % rbuf->size];
  187. idx = (idx + curpktlen + DVB_RINGBUFFER_PKTHDRSIZE) % rbuf->size;
  188. }
  189. consumed = (idx - rbuf->pread) % rbuf->size;
  190. while((dvb_ringbuffer_avail(rbuf) - consumed) > DVB_RINGBUFFER_PKTHDRSIZE) {
  191. curpktlen = rbuf->data[idx] << 8;
  192. curpktlen |= rbuf->data[(idx + 1) % rbuf->size];
  193. curpktstatus = rbuf->data[(idx + 2) % rbuf->size];
  194. if (curpktstatus == PKT_READY) {
  195. *pktlen = curpktlen;
  196. return idx;
  197. }
  198. consumed += curpktlen + DVB_RINGBUFFER_PKTHDRSIZE;
  199. idx = (idx + curpktlen + DVB_RINGBUFFER_PKTHDRSIZE) % rbuf->size;
  200. }
  201. // no packets available
  202. return -1;
  203. }
  204. EXPORT_SYMBOL(dvb_ringbuffer_init);
  205. EXPORT_SYMBOL(dvb_ringbuffer_empty);
  206. EXPORT_SYMBOL(dvb_ringbuffer_free);
  207. EXPORT_SYMBOL(dvb_ringbuffer_avail);
  208. EXPORT_SYMBOL(dvb_ringbuffer_flush_spinlock_wakeup);
  209. EXPORT_SYMBOL(dvb_ringbuffer_read);
  210. EXPORT_SYMBOL(dvb_ringbuffer_write);