4 * Derived from ivtv-queue.c
6 * Copyright (C) 2007 Hans Verkuil <hverkuil@xs4all.nl>
7 * Copyright (C) 2008 Andy Walls <awalls@radix.net>
9 * This program is free software; you can redistribute it and/or modify
10 * it under the terms of the GNU General Public License as published by
11 * the Free Software Foundation; either version 2 of the License, or
12 * (at your option) any later version.
14 * This program is distributed in the hope that it will be useful,
15 * but WITHOUT ANY WARRANTY; without even the implied warranty of
16 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 * GNU General Public License for more details.
19 * You should have received a copy of the GNU General Public License
20 * along with this program; if not, write to the Free Software
21 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
25 #include "cx18-driver.h"
26 #include "cx18-streams.h"
27 #include "cx18-queue.h"
30 void cx18_buf_swap(struct cx18_buffer *buf)
34 for (i = 0; i < buf->bytesused; i += 4)
35 swab32s((u32 *)(buf->buf + i));
38 void cx18_queue_init(struct cx18_queue *q)
40 INIT_LIST_HEAD(&q->list);
41 atomic_set(&q->buffers, 0);
45 struct cx18_queue *_cx18_enqueue(struct cx18_stream *s, struct cx18_buffer *buf,
46 struct cx18_queue *q, int to_front)
48 /* clear the buffer if it is not to be enqueued to the full queue */
49 if (q != &s->q_full) {
56 mutex_lock(&s->qlock);
58 /* q_busy is restricted to a max buffer count imposed by firmware */
59 if (q == &s->q_busy &&
60 atomic_read(&q->buffers) >= CX18_MAX_FW_MDLS_PER_STREAM)
64 list_add(&buf->list, &q->list); /* LIFO */
66 list_add_tail(&buf->list, &q->list); /* FIFO */
67 q->bytesused += buf->bytesused - buf->readpos;
68 atomic_inc(&q->buffers);
70 mutex_unlock(&s->qlock);
74 struct cx18_buffer *cx18_dequeue(struct cx18_stream *s, struct cx18_queue *q)
76 struct cx18_buffer *buf = NULL;
78 mutex_lock(&s->qlock);
79 if (!list_empty(&q->list)) {
80 buf = list_first_entry(&q->list, struct cx18_buffer, list);
81 list_del_init(&buf->list);
82 q->bytesused -= buf->bytesused - buf->readpos;
84 atomic_dec(&q->buffers);
86 mutex_unlock(&s->qlock);
90 struct cx18_buffer *cx18_queue_get_buf(struct cx18_stream *s, u32 id,
93 struct cx18 *cx = s->cx;
94 struct cx18_buffer *buf;
95 struct cx18_buffer *tmp;
96 struct cx18_buffer *ret = NULL;
98 mutex_lock(&s->qlock);
99 list_for_each_entry_safe(buf, tmp, &s->q_busy.list, list) {
102 if (buf->skipped >= atomic_read(&s->q_busy.buffers)-1) {
103 /* buffer must have fallen out of rotation */
104 CX18_WARN("Skipped %s, buffer %d, %d "
105 "times - it must have dropped out of "
106 "rotation\n", s->name, buf->id,
108 /* move it to q_free */
109 list_move_tail(&buf->list, &s->q_free.list);
110 buf->bytesused = buf->readpos = buf->b_flags =
112 atomic_dec(&s->q_busy.buffers);
113 atomic_inc(&s->q_free.buffers);
118 buf->bytesused = bytesused;
119 /* Sync the buffer before we release the qlock */
120 cx18_buf_sync_for_cpu(s, buf);
121 if (s->type == CX18_ENC_STREAM_TYPE_TS) {
123 * TS doesn't use q_full. As we pull the buffer off of
124 * the queue here, the caller will have to put it back.
126 list_del_init(&buf->list);
128 /* Move buffer from q_busy to q_full */
129 list_move_tail(&buf->list, &s->q_full.list);
130 set_bit(CX18_F_B_NEED_BUF_SWAP, &buf->b_flags);
131 s->q_full.bytesused += buf->bytesused;
132 atomic_inc(&s->q_full.buffers);
134 atomic_dec(&s->q_busy.buffers);
139 mutex_unlock(&s->qlock);
143 /* Move all buffers of a queue to q_free, while flushing the buffers */
144 static void cx18_queue_flush(struct cx18_stream *s, struct cx18_queue *q)
146 struct cx18_buffer *buf;
151 mutex_lock(&s->qlock);
152 while (!list_empty(&q->list)) {
153 buf = list_first_entry(&q->list, struct cx18_buffer, list);
154 list_move_tail(&buf->list, &s->q_free.list);
155 buf->bytesused = buf->readpos = buf->b_flags = buf->skipped = 0;
156 atomic_inc(&s->q_free.buffers);
159 mutex_unlock(&s->qlock);
162 void cx18_flush_queues(struct cx18_stream *s)
164 cx18_queue_flush(s, &s->q_busy);
165 cx18_queue_flush(s, &s->q_full);
168 int cx18_stream_alloc(struct cx18_stream *s)
170 struct cx18 *cx = s->cx;
176 CX18_DEBUG_INFO("Allocate %s stream: %d x %d buffers (%dkB total)\n",
177 s->name, s->buffers, s->buf_size,
178 s->buffers * s->buf_size / 1024);
180 if (((char __iomem *)&cx->scb->cpu_mdl[cx->mdl_offset + s->buffers] -
181 (char __iomem *)cx->scb) > SCB_RESERVED_SIZE) {
182 unsigned bufsz = (((char __iomem *)cx->scb) + SCB_RESERVED_SIZE -
183 ((char __iomem *)cx->scb->cpu_mdl));
185 CX18_ERR("Too many buffers, cannot fit in SCB area\n");
186 CX18_ERR("Max buffers = %zd\n",
187 bufsz / sizeof(struct cx18_mdl));
191 s->mdl_offset = cx->mdl_offset;
193 /* allocate stream buffers. Initially all buffers are in q_free. */
194 for (i = 0; i < s->buffers; i++) {
195 struct cx18_buffer *buf = kzalloc(sizeof(struct cx18_buffer),
196 GFP_KERNEL|__GFP_NOWARN);
200 buf->buf = kmalloc(s->buf_size, GFP_KERNEL|__GFP_NOWARN);
201 if (buf->buf == NULL) {
205 buf->id = cx->buffer_id++;
206 INIT_LIST_HEAD(&buf->list);
207 buf->dma_handle = pci_map_single(s->cx->dev,
208 buf->buf, s->buf_size, s->dma);
209 cx18_buf_sync_for_cpu(s, buf);
210 cx18_enqueue(s, buf, &s->q_free);
212 if (i == s->buffers) {
213 cx->mdl_offset += s->buffers;
216 CX18_ERR("Couldn't allocate buffers for %s stream\n", s->name);
221 void cx18_stream_free(struct cx18_stream *s)
223 struct cx18_buffer *buf;
225 /* move all buffers to q_free */
226 cx18_flush_queues(s);
229 while ((buf = cx18_dequeue(s, &s->q_free))) {
230 pci_unmap_single(s->cx->dev, buf->dma_handle,
231 s->buf_size, s->dma);