diff options
Diffstat (limited to 'drivers/media/video/cx18/cx18-queue.c')
-rw-r--r-- | drivers/media/video/cx18/cx18-queue.c | 316 |
1 files changed, 249 insertions, 67 deletions
diff --git a/drivers/media/video/cx18/cx18-queue.c b/drivers/media/video/cx18/cx18-queue.c index b9bd4ff5535e..c1a49ecf9d98 100644 --- a/drivers/media/video/cx18/cx18-queue.c +++ b/drivers/media/video/cx18/cx18-queue.c | |||
@@ -26,6 +26,7 @@ | |||
26 | #include "cx18-queue.h" | 26 | #include "cx18-queue.h" |
27 | #include "cx18-streams.h" | 27 | #include "cx18-streams.h" |
28 | #include "cx18-scb.h" | 28 | #include "cx18-scb.h" |
29 | #include "cx18-io.h" | ||
29 | 30 | ||
30 | void cx18_buf_swap(struct cx18_buffer *buf) | 31 | void cx18_buf_swap(struct cx18_buffer *buf) |
31 | { | 32 | { |
@@ -35,6 +36,17 @@ void cx18_buf_swap(struct cx18_buffer *buf) | |||
35 | swab32s((u32 *)(buf->buf + i)); | 36 | swab32s((u32 *)(buf->buf + i)); |
36 | } | 37 | } |
37 | 38 | ||
39 | void _cx18_mdl_swap(struct cx18_mdl *mdl) | ||
40 | { | ||
41 | struct cx18_buffer *buf; | ||
42 | |||
43 | list_for_each_entry(buf, &mdl->buf_list, list) { | ||
44 | if (buf->bytesused == 0) | ||
45 | break; | ||
46 | cx18_buf_swap(buf); | ||
47 | } | ||
48 | } | ||
49 | |||
38 | void cx18_queue_init(struct cx18_queue *q) | 50 | void cx18_queue_init(struct cx18_queue *q) |
39 | { | 51 | { |
40 | INIT_LIST_HEAD(&q->list); | 52 | INIT_LIST_HEAD(&q->list); |
@@ -42,15 +54,16 @@ void cx18_queue_init(struct cx18_queue *q) | |||
42 | q->bytesused = 0; | 54 | q->bytesused = 0; |
43 | } | 55 | } |
44 | 56 | ||
45 | struct cx18_queue *_cx18_enqueue(struct cx18_stream *s, struct cx18_buffer *buf, | 57 | struct cx18_queue *_cx18_enqueue(struct cx18_stream *s, struct cx18_mdl *mdl, |
46 | struct cx18_queue *q, int to_front) | 58 | struct cx18_queue *q, int to_front) |
47 | { | 59 | { |
48 | /* clear the buffer if it is not to be enqueued to the full queue */ | 60 | /* clear the mdl if it is not to be enqueued to the full queue */ |
49 | if (q != &s->q_full) { | 61 | if (q != &s->q_full) { |
50 | buf->bytesused = 0; | 62 | mdl->bytesused = 0; |
51 | buf->readpos = 0; | 63 | mdl->readpos = 0; |
52 | buf->b_flags = 0; | 64 | mdl->m_flags = 0; |
53 | buf->skipped = 0; | 65 | mdl->skipped = 0; |
66 | mdl->curr_buf = NULL; | ||
54 | } | 67 | } |
55 | 68 | ||
56 | /* q_busy is restricted to a max buffer count imposed by firmware */ | 69 | /* q_busy is restricted to a max buffer count imposed by firmware */ |
@@ -61,125 +74,270 @@ struct cx18_queue *_cx18_enqueue(struct cx18_stream *s, struct cx18_buffer *buf, | |||
61 | spin_lock(&q->lock); | 74 | spin_lock(&q->lock); |
62 | 75 | ||
63 | if (to_front) | 76 | if (to_front) |
64 | list_add(&buf->list, &q->list); /* LIFO */ | 77 | list_add(&mdl->list, &q->list); /* LIFO */ |
65 | else | 78 | else |
66 | list_add_tail(&buf->list, &q->list); /* FIFO */ | 79 | list_add_tail(&mdl->list, &q->list); /* FIFO */ |
67 | q->bytesused += buf->bytesused - buf->readpos; | 80 | q->bytesused += mdl->bytesused - mdl->readpos; |
68 | atomic_inc(&q->depth); | 81 | atomic_inc(&q->depth); |
69 | 82 | ||
70 | spin_unlock(&q->lock); | 83 | spin_unlock(&q->lock); |
71 | return q; | 84 | return q; |
72 | } | 85 | } |
73 | 86 | ||
74 | struct cx18_buffer *cx18_dequeue(struct cx18_stream *s, struct cx18_queue *q) | 87 | struct cx18_mdl *cx18_dequeue(struct cx18_stream *s, struct cx18_queue *q) |
75 | { | 88 | { |
76 | struct cx18_buffer *buf = NULL; | 89 | struct cx18_mdl *mdl = NULL; |
77 | 90 | ||
78 | spin_lock(&q->lock); | 91 | spin_lock(&q->lock); |
79 | if (!list_empty(&q->list)) { | 92 | if (!list_empty(&q->list)) { |
80 | buf = list_first_entry(&q->list, struct cx18_buffer, list); | 93 | mdl = list_first_entry(&q->list, struct cx18_mdl, list); |
81 | list_del_init(&buf->list); | 94 | list_del_init(&mdl->list); |
82 | q->bytesused -= buf->bytesused - buf->readpos; | 95 | q->bytesused -= mdl->bytesused - mdl->readpos; |
83 | buf->skipped = 0; | 96 | mdl->skipped = 0; |
84 | atomic_dec(&q->depth); | 97 | atomic_dec(&q->depth); |
85 | } | 98 | } |
86 | spin_unlock(&q->lock); | 99 | spin_unlock(&q->lock); |
87 | return buf; | 100 | return mdl; |
101 | } | ||
102 | |||
103 | static void _cx18_mdl_set_buf_bytesused(struct cx18_stream *s, | ||
104 | struct cx18_mdl *mdl) | ||
105 | { | ||
106 | struct cx18_buffer *buf; | ||
107 | u32 buf_size = s->buf_size; | ||
108 | u32 bytesused = mdl->bytesused; | ||
109 | |||
110 | list_for_each_entry(buf, &mdl->buf_list, list) { | ||
111 | buf->readpos = 0; | ||
112 | if (bytesused >= buf_size) { | ||
113 | buf->bytesused = buf_size; | ||
114 | bytesused -= buf_size; | ||
115 | } else { | ||
116 | buf->bytesused = bytesused; | ||
117 | bytesused = 0; | ||
118 | } | ||
119 | } | ||
88 | } | 120 | } |
89 | 121 | ||
90 | struct cx18_buffer *cx18_queue_get_buf(struct cx18_stream *s, u32 id, | 122 | static inline void cx18_mdl_set_buf_bytesused(struct cx18_stream *s, |
123 | struct cx18_mdl *mdl) | ||
124 | { | ||
125 | struct cx18_buffer *buf; | ||
126 | |||
127 | if (list_is_singular(&mdl->buf_list)) { | ||
128 | buf = list_first_entry(&mdl->buf_list, struct cx18_buffer, | ||
129 | list); | ||
130 | buf->bytesused = mdl->bytesused; | ||
131 | buf->readpos = 0; | ||
132 | } else { | ||
133 | _cx18_mdl_set_buf_bytesused(s, mdl); | ||
134 | } | ||
135 | } | ||
136 | |||
137 | struct cx18_mdl *cx18_queue_get_mdl(struct cx18_stream *s, u32 id, | ||
91 | u32 bytesused) | 138 | u32 bytesused) |
92 | { | 139 | { |
93 | struct cx18 *cx = s->cx; | 140 | struct cx18 *cx = s->cx; |
94 | struct cx18_buffer *buf; | 141 | struct cx18_mdl *mdl; |
95 | struct cx18_buffer *tmp; | 142 | struct cx18_mdl *tmp; |
96 | struct cx18_buffer *ret = NULL; | 143 | struct cx18_mdl *ret = NULL; |
97 | LIST_HEAD(sweep_up); | 144 | LIST_HEAD(sweep_up); |
98 | 145 | ||
99 | /* | 146 | /* |
100 | * We don't have to acquire multiple q locks here, because we are | 147 | * We don't have to acquire multiple q locks here, because we are |
101 | * serialized by the single threaded work handler. | 148 | * serialized by the single threaded work handler. |
102 | * Buffers from the firmware will thus remain in order as | 149 | * MDLs from the firmware will thus remain in order as |
103 | * they are moved from q_busy to q_full or to the dvb ring buffer. | 150 | * they are moved from q_busy to q_full or to the dvb ring buffer. |
104 | */ | 151 | */ |
105 | spin_lock(&s->q_busy.lock); | 152 | spin_lock(&s->q_busy.lock); |
106 | list_for_each_entry_safe(buf, tmp, &s->q_busy.list, list) { | 153 | list_for_each_entry_safe(mdl, tmp, &s->q_busy.list, list) { |
107 | /* | 154 | /* |
108 | * We should find what the firmware told us is done, | 155 | * We should find what the firmware told us is done, |
109 | * right at the front of the queue. If we don't, we likely have | 156 | * right at the front of the queue. If we don't, we likely have |
110 | * missed a buffer done message from the firmware. | 157 | * missed an mdl done message from the firmware. |
111 | * Once we skip a buffer repeatedly, relative to the size of | 158 | * Once we skip an mdl repeatedly, relative to the size of |
112 | * q_busy, we have high confidence we've missed it. | 159 | * q_busy, we have high confidence we've missed it. |
113 | */ | 160 | */ |
114 | if (buf->id != id) { | 161 | if (mdl->id != id) { |
115 | buf->skipped++; | 162 | mdl->skipped++; |
116 | if (buf->skipped >= atomic_read(&s->q_busy.depth)-1) { | 163 | if (mdl->skipped >= atomic_read(&s->q_busy.depth)-1) { |
117 | /* buffer must have fallen out of rotation */ | 164 | /* mdl must have fallen out of rotation */ |
118 | CX18_WARN("Skipped %s, buffer %d, %d " | 165 | CX18_WARN("Skipped %s, MDL %d, %d " |
119 | "times - it must have dropped out of " | 166 | "times - it must have dropped out of " |
120 | "rotation\n", s->name, buf->id, | 167 | "rotation\n", s->name, mdl->id, |
121 | buf->skipped); | 168 | mdl->skipped); |
122 | /* Sweep it up to put it back into rotation */ | 169 | /* Sweep it up to put it back into rotation */ |
123 | list_move_tail(&buf->list, &sweep_up); | 170 | list_move_tail(&mdl->list, &sweep_up); |
124 | atomic_dec(&s->q_busy.depth); | 171 | atomic_dec(&s->q_busy.depth); |
125 | } | 172 | } |
126 | continue; | 173 | continue; |
127 | } | 174 | } |
128 | /* | 175 | /* |
129 | * We pull the desired buffer off of the queue here. Something | 176 | * We pull the desired mdl off of the queue here. Something |
130 | * will have to put it back on a queue later. | 177 | * will have to put it back on a queue later. |
131 | */ | 178 | */ |
132 | list_del_init(&buf->list); | 179 | list_del_init(&mdl->list); |
133 | atomic_dec(&s->q_busy.depth); | 180 | atomic_dec(&s->q_busy.depth); |
134 | ret = buf; | 181 | ret = mdl; |
135 | break; | 182 | break; |
136 | } | 183 | } |
137 | spin_unlock(&s->q_busy.lock); | 184 | spin_unlock(&s->q_busy.lock); |
138 | 185 | ||
139 | /* | 186 | /* |
140 | * We found the buffer for which we were looking. Get it ready for | 187 | * We found the mdl for which we were looking. Get it ready for |
141 | * the caller to put on q_full or in the dvb ring buffer. | 188 | * the caller to put on q_full or in the dvb ring buffer. |
142 | */ | 189 | */ |
143 | if (ret != NULL) { | 190 | if (ret != NULL) { |
144 | ret->bytesused = bytesused; | 191 | ret->bytesused = bytesused; |
145 | ret->skipped = 0; | 192 | ret->skipped = 0; |
146 | /* readpos and b_flags were 0'ed when the buf went on q_busy */ | 193 | /* 0'ed readpos, m_flags & curr_buf when mdl went on q_busy */ |
147 | cx18_buf_sync_for_cpu(s, ret); | 194 | cx18_mdl_set_buf_bytesused(s, ret); |
195 | cx18_mdl_sync_for_cpu(s, ret); | ||
148 | if (s->type != CX18_ENC_STREAM_TYPE_TS) | 196 | if (s->type != CX18_ENC_STREAM_TYPE_TS) |
149 | set_bit(CX18_F_B_NEED_BUF_SWAP, &ret->b_flags); | 197 | set_bit(CX18_F_M_NEED_SWAP, &ret->m_flags); |
150 | } | 198 | } |
151 | 199 | ||
152 | /* Put any buffers the firmware is ignoring back into normal rotation */ | 200 | /* Put any mdls the firmware is ignoring back into normal rotation */ |
153 | list_for_each_entry_safe(buf, tmp, &sweep_up, list) { | 201 | list_for_each_entry_safe(mdl, tmp, &sweep_up, list) { |
154 | list_del_init(&buf->list); | 202 | list_del_init(&mdl->list); |
155 | cx18_enqueue(s, buf, &s->q_free); | 203 | cx18_enqueue(s, mdl, &s->q_free); |
156 | } | 204 | } |
157 | return ret; | 205 | return ret; |
158 | } | 206 | } |
159 | 207 | ||
160 | /* Move all buffers of a queue to q_free, while flushing the buffers */ | 208 | /* Move all mdls of a queue, while flushing the mdl */ |
161 | static void cx18_queue_flush(struct cx18_stream *s, struct cx18_queue *q) | 209 | static void cx18_queue_flush(struct cx18_stream *s, |
210 | struct cx18_queue *q_src, struct cx18_queue *q_dst) | ||
162 | { | 211 | { |
163 | struct cx18_buffer *buf; | 212 | struct cx18_mdl *mdl; |
164 | 213 | ||
165 | if (q == &s->q_free) | 214 | /* It only makes sense to flush to q_free or q_idle */ |
215 | if (q_src == q_dst || q_dst == &s->q_full || q_dst == &s->q_busy) | ||
166 | return; | 216 | return; |
167 | 217 | ||
168 | spin_lock(&q->lock); | 218 | spin_lock(&q_src->lock); |
169 | while (!list_empty(&q->list)) { | 219 | spin_lock(&q_dst->lock); |
170 | buf = list_first_entry(&q->list, struct cx18_buffer, list); | 220 | while (!list_empty(&q_src->list)) { |
171 | list_move_tail(&buf->list, &s->q_free.list); | 221 | mdl = list_first_entry(&q_src->list, struct cx18_mdl, list); |
172 | buf->bytesused = buf->readpos = buf->b_flags = buf->skipped = 0; | 222 | list_move_tail(&mdl->list, &q_dst->list); |
173 | atomic_inc(&s->q_free.depth); | 223 | mdl->bytesused = 0; |
224 | mdl->readpos = 0; | ||
225 | mdl->m_flags = 0; | ||
226 | mdl->skipped = 0; | ||
227 | mdl->curr_buf = NULL; | ||
228 | atomic_inc(&q_dst->depth); | ||
174 | } | 229 | } |
175 | cx18_queue_init(q); | 230 | cx18_queue_init(q_src); |
176 | spin_unlock(&q->lock); | 231 | spin_unlock(&q_src->lock); |
232 | spin_unlock(&q_dst->lock); | ||
177 | } | 233 | } |
178 | 234 | ||
179 | void cx18_flush_queues(struct cx18_stream *s) | 235 | void cx18_flush_queues(struct cx18_stream *s) |
180 | { | 236 | { |
181 | cx18_queue_flush(s, &s->q_busy); | 237 | cx18_queue_flush(s, &s->q_busy, &s->q_free); |
182 | cx18_queue_flush(s, &s->q_full); | 238 | cx18_queue_flush(s, &s->q_full, &s->q_free); |
239 | } | ||
240 | |||
241 | /* | ||
242 | * Note, s->buf_pool is not protected by a lock, | ||
243 | * the stream better not have *anything* going on when calling this | ||
244 | */ | ||
245 | void cx18_unload_queues(struct cx18_stream *s) | ||
246 | { | ||
247 | struct cx18_queue *q_idle = &s->q_idle; | ||
248 | struct cx18_mdl *mdl; | ||
249 | struct cx18_buffer *buf; | ||
250 | |||
251 | /* Move all MDLS to q_idle */ | ||
252 | cx18_queue_flush(s, &s->q_busy, q_idle); | ||
253 | cx18_queue_flush(s, &s->q_full, q_idle); | ||
254 | cx18_queue_flush(s, &s->q_free, q_idle); | ||
255 | |||
256 | /* Reset MDL id's and move all buffers back to the stream's buf_pool */ | ||
257 | spin_lock(&q_idle->lock); | ||
258 | list_for_each_entry(mdl, &q_idle->list, list) { | ||
259 | while (!list_empty(&mdl->buf_list)) { | ||
260 | buf = list_first_entry(&mdl->buf_list, | ||
261 | struct cx18_buffer, list); | ||
262 | list_move_tail(&buf->list, &s->buf_pool); | ||
263 | buf->bytesused = 0; | ||
264 | buf->readpos = 0; | ||
265 | } | ||
266 | mdl->id = s->mdl_base_idx; /* reset id to a "safe" value */ | ||
267 | /* all other mdl fields were cleared by cx18_queue_flush() */ | ||
268 | } | ||
269 | spin_unlock(&q_idle->lock); | ||
270 | } | ||
271 | |||
272 | /* | ||
273 | * Note, s->buf_pool is not protected by a lock, | ||
274 | * the stream better not have *anything* going on when calling this | ||
275 | */ | ||
276 | void cx18_load_queues(struct cx18_stream *s) | ||
277 | { | ||
278 | struct cx18 *cx = s->cx; | ||
279 | struct cx18_mdl *mdl; | ||
280 | struct cx18_buffer *buf; | ||
281 | int mdl_id; | ||
282 | int i; | ||
283 | |||
284 | /* | ||
285 | * Attach buffers to MDLs, give the MDLs ids, and add MDLs to q_free | ||
286 | * Excess MDLs are left on q_idle | ||
287 | * Excess buffers are left in buf_pool and/or on an MDL in q_idle | ||
288 | */ | ||
289 | mdl_id = s->mdl_base_idx; | ||
290 | for (mdl = cx18_dequeue(s, &s->q_idle), i = s->bufs_per_mdl; | ||
291 | mdl != NULL && i == s->bufs_per_mdl; | ||
292 | mdl = cx18_dequeue(s, &s->q_idle)) { | ||
293 | |||
294 | mdl->id = mdl_id; | ||
295 | |||
296 | for (i = 0; i < s->bufs_per_mdl; i++) { | ||
297 | if (list_empty(&s->buf_pool)) | ||
298 | break; | ||
299 | |||
300 | buf = list_first_entry(&s->buf_pool, struct cx18_buffer, | ||
301 | list); | ||
302 | list_move_tail(&buf->list, &mdl->buf_list); | ||
303 | |||
304 | /* update the firmware's MDL array with this buffer */ | ||
305 | cx18_writel(cx, buf->dma_handle, | ||
306 | &cx->scb->cpu_mdl[mdl_id + i].paddr); | ||
307 | cx18_writel(cx, s->buf_size, | ||
308 | &cx->scb->cpu_mdl[mdl_id + i].length); | ||
309 | } | ||
310 | |||
311 | if (i == s->bufs_per_mdl) | ||
312 | cx18_enqueue(s, mdl, &s->q_free); | ||
313 | else | ||
314 | cx18_push(s, mdl, &s->q_idle); /* not enough buffers */ | ||
315 | mdl_id += i; | ||
316 | } | ||
317 | } | ||
318 | |||
319 | void _cx18_mdl_sync_for_cpu(struct cx18_stream *s, struct cx18_mdl *mdl) | ||
320 | { | ||
321 | int dma = s->dma; | ||
322 | u32 buf_size = s->buf_size; | ||
323 | struct pci_dev *pci_dev = s->cx->pci_dev; | ||
324 | struct cx18_buffer *buf; | ||
325 | |||
326 | list_for_each_entry(buf, &mdl->buf_list, list) | ||
327 | pci_dma_sync_single_for_cpu(pci_dev, buf->dma_handle, | ||
328 | buf_size, dma); | ||
329 | } | ||
330 | |||
331 | void _cx18_mdl_sync_for_device(struct cx18_stream *s, struct cx18_mdl *mdl) | ||
332 | { | ||
333 | int dma = s->dma; | ||
334 | u32 buf_size = s->buf_size; | ||
335 | struct pci_dev *pci_dev = s->cx->pci_dev; | ||
336 | struct cx18_buffer *buf; | ||
337 | |||
338 | list_for_each_entry(buf, &mdl->buf_list, list) | ||
339 | pci_dma_sync_single_for_device(pci_dev, buf->dma_handle, | ||
340 | buf_size, dma); | ||
183 | } | 341 | } |
184 | 342 | ||
185 | int cx18_stream_alloc(struct cx18_stream *s) | 343 | int cx18_stream_alloc(struct cx18_stream *s) |
@@ -207,24 +365,40 @@ int cx18_stream_alloc(struct cx18_stream *s) | |||
207 | 365 | ||
208 | s->mdl_base_idx = cx->free_mdl_idx; | 366 | s->mdl_base_idx = cx->free_mdl_idx; |
209 | 367 | ||
210 | /* allocate stream buffers. Initially all buffers are in q_free. */ | 368 | /* allocate stream buffers and MDLs */ |
211 | for (i = 0; i < s->buffers; i++) { | 369 | for (i = 0; i < s->buffers; i++) { |
212 | struct cx18_buffer *buf = kzalloc(sizeof(struct cx18_buffer), | 370 | struct cx18_mdl *mdl; |
213 | GFP_KERNEL|__GFP_NOWARN); | 371 | struct cx18_buffer *buf; |
214 | 372 | ||
215 | if (buf == NULL) | 373 | /* 1 MDL per buffer to handle the worst & also default case */ |
374 | mdl = kzalloc(sizeof(struct cx18_mdl), GFP_KERNEL|__GFP_NOWARN); | ||
375 | if (mdl == NULL) | ||
216 | break; | 376 | break; |
377 | |||
378 | buf = kzalloc(sizeof(struct cx18_buffer), | ||
379 | GFP_KERNEL|__GFP_NOWARN); | ||
380 | if (buf == NULL) { | ||
381 | kfree(mdl); | ||
382 | break; | ||
383 | } | ||
384 | |||
217 | buf->buf = kmalloc(s->buf_size, GFP_KERNEL|__GFP_NOWARN); | 385 | buf->buf = kmalloc(s->buf_size, GFP_KERNEL|__GFP_NOWARN); |
218 | if (buf->buf == NULL) { | 386 | if (buf->buf == NULL) { |
387 | kfree(mdl); | ||
219 | kfree(buf); | 388 | kfree(buf); |
220 | break; | 389 | break; |
221 | } | 390 | } |
222 | buf->id = cx->buffer_id++; | 391 | |
392 | INIT_LIST_HEAD(&mdl->list); | ||
393 | INIT_LIST_HEAD(&mdl->buf_list); | ||
394 | mdl->id = s->mdl_base_idx; /* a somewhat safe value */ | ||
395 | cx18_enqueue(s, mdl, &s->q_idle); | ||
396 | |||
223 | INIT_LIST_HEAD(&buf->list); | 397 | INIT_LIST_HEAD(&buf->list); |
224 | buf->dma_handle = pci_map_single(s->cx->pci_dev, | 398 | buf->dma_handle = pci_map_single(s->cx->pci_dev, |
225 | buf->buf, s->buf_size, s->dma); | 399 | buf->buf, s->buf_size, s->dma); |
226 | cx18_buf_sync_for_cpu(s, buf); | 400 | cx18_buf_sync_for_cpu(s, buf); |
227 | cx18_enqueue(s, buf, &s->q_free); | 401 | list_add_tail(&buf->list, &s->buf_pool); |
228 | } | 402 | } |
229 | if (i == s->buffers) { | 403 | if (i == s->buffers) { |
230 | cx->free_mdl_idx += s->buffers; | 404 | cx->free_mdl_idx += s->buffers; |
@@ -237,13 +411,21 @@ int cx18_stream_alloc(struct cx18_stream *s) | |||
237 | 411 | ||
238 | void cx18_stream_free(struct cx18_stream *s) | 412 | void cx18_stream_free(struct cx18_stream *s) |
239 | { | 413 | { |
414 | struct cx18_mdl *mdl; | ||
240 | struct cx18_buffer *buf; | 415 | struct cx18_buffer *buf; |
241 | 416 | ||
242 | /* move all buffers to q_free */ | 417 | /* move all buffers to buf_pool and all MDLs to q_idle */ |
243 | cx18_flush_queues(s); | 418 | cx18_unload_queues(s); |
419 | |||
420 | /* empty q_idle */ | ||
421 | while ((mdl = cx18_dequeue(s, &s->q_idle))) | ||
422 | kfree(mdl); | ||
423 | |||
424 | /* empty buf_pool */ | ||
425 | while (!list_empty(&s->buf_pool)) { | ||
426 | buf = list_first_entry(&s->buf_pool, struct cx18_buffer, list); | ||
427 | list_del_init(&buf->list); | ||
244 | 428 | ||
245 | /* empty q_free */ | ||
246 | while ((buf = cx18_dequeue(s, &s->q_free))) { | ||
247 | pci_unmap_single(s->cx->pci_dev, buf->dma_handle, | 429 | pci_unmap_single(s->cx->pci_dev, buf->dma_handle, |
248 | s->buf_size, s->dma); | 430 | s->buf_size, s->dma); |
249 | kfree(buf->buf); | 431 | kfree(buf->buf); |