Loading...
1/*
2 * ALSA sequencer Memory Manager
3 * Copyright (c) 1998 by Frank van de Pol <fvdpol@coil.demon.nl>
4 * Jaroslav Kysela <perex@perex.cz>
5 * 2000 by Takashi Iwai <tiwai@suse.de>
6 *
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License as published by
9 * the Free Software Foundation; either version 2 of the License, or
10 * (at your option) any later version.
11 *
12 * This program is distributed in the hope that it will be useful,
13 * but WITHOUT ANY WARRANTY; without even the implied warranty of
14 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 * GNU General Public License for more details.
16 *
17 * You should have received a copy of the GNU General Public License
18 * along with this program; if not, write to the Free Software
19 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
20 *
21 */
22
23#include <linux/init.h>
24#include <linux/export.h>
25#include <linux/slab.h>
26#include <linux/sched/signal.h>
27#include <linux/vmalloc.h>
28#include <sound/core.h>
29
30#include <sound/seq_kernel.h>
31#include "seq_memory.h"
32#include "seq_queue.h"
33#include "seq_info.h"
34#include "seq_lock.h"
35
36static inline int snd_seq_pool_available(struct snd_seq_pool *pool)
37{
38 return pool->total_elements - atomic_read(&pool->counter);
39}
40
41static inline int snd_seq_output_ok(struct snd_seq_pool *pool)
42{
43 return snd_seq_pool_available(pool) >= pool->room;
44}
45
46/*
47 * Variable length event:
48 * The event like sysex uses variable length type.
49 * The external data may be stored in three different formats.
50 * 1) kernel space
51 * This is the normal case.
52 * ext.data.len = length
53 * ext.data.ptr = buffer pointer
54 * 2) user space
55 * When an event is generated via read(), the external data is
56 * kept in user space until expanded.
57 * ext.data.len = length | SNDRV_SEQ_EXT_USRPTR
58 * ext.data.ptr = userspace pointer
59 * 3) chained cells
60 * When the variable length event is enqueued (in prioq or fifo),
61 * the external data is decomposed to several cells.
62 * ext.data.len = length | SNDRV_SEQ_EXT_CHAINED
63 * ext.data.ptr = the additiona cell head
64 * -> cell.next -> cell.next -> ..
65 */
66
67/*
68 * exported:
69 * call dump function to expand external data.
70 */
71
72static int get_var_len(const struct snd_seq_event *event)
73{
74 if ((event->flags & SNDRV_SEQ_EVENT_LENGTH_MASK) != SNDRV_SEQ_EVENT_LENGTH_VARIABLE)
75 return -EINVAL;
76
77 return event->data.ext.len & ~SNDRV_SEQ_EXT_MASK;
78}
79
80int snd_seq_dump_var_event(const struct snd_seq_event *event,
81 snd_seq_dump_func_t func, void *private_data)
82{
83 int len, err;
84 struct snd_seq_event_cell *cell;
85
86 if ((len = get_var_len(event)) <= 0)
87 return len;
88
89 if (event->data.ext.len & SNDRV_SEQ_EXT_USRPTR) {
90 char buf[32];
91 char __user *curptr = (char __force __user *)event->data.ext.ptr;
92 while (len > 0) {
93 int size = sizeof(buf);
94 if (len < size)
95 size = len;
96 if (copy_from_user(buf, curptr, size))
97 return -EFAULT;
98 err = func(private_data, buf, size);
99 if (err < 0)
100 return err;
101 curptr += size;
102 len -= size;
103 }
104 return 0;
105 }
106 if (!(event->data.ext.len & SNDRV_SEQ_EXT_CHAINED))
107 return func(private_data, event->data.ext.ptr, len);
108
109 cell = (struct snd_seq_event_cell *)event->data.ext.ptr;
110 for (; len > 0 && cell; cell = cell->next) {
111 int size = sizeof(struct snd_seq_event);
112 if (len < size)
113 size = len;
114 err = func(private_data, &cell->event, size);
115 if (err < 0)
116 return err;
117 len -= size;
118 }
119 return 0;
120}
121EXPORT_SYMBOL(snd_seq_dump_var_event);
122
123
124/*
125 * exported:
126 * expand the variable length event to linear buffer space.
127 */
128
129static int seq_copy_in_kernel(char **bufptr, const void *src, int size)
130{
131 memcpy(*bufptr, src, size);
132 *bufptr += size;
133 return 0;
134}
135
136static int seq_copy_in_user(char __user **bufptr, const void *src, int size)
137{
138 if (copy_to_user(*bufptr, src, size))
139 return -EFAULT;
140 *bufptr += size;
141 return 0;
142}
143
144int snd_seq_expand_var_event(const struct snd_seq_event *event, int count, char *buf,
145 int in_kernel, int size_aligned)
146{
147 int len, newlen;
148 int err;
149
150 if ((len = get_var_len(event)) < 0)
151 return len;
152 newlen = len;
153 if (size_aligned > 0)
154 newlen = roundup(len, size_aligned);
155 if (count < newlen)
156 return -EAGAIN;
157
158 if (event->data.ext.len & SNDRV_SEQ_EXT_USRPTR) {
159 if (! in_kernel)
160 return -EINVAL;
161 if (copy_from_user(buf, (void __force __user *)event->data.ext.ptr, len))
162 return -EFAULT;
163 return newlen;
164 }
165 err = snd_seq_dump_var_event(event,
166 in_kernel ? (snd_seq_dump_func_t)seq_copy_in_kernel :
167 (snd_seq_dump_func_t)seq_copy_in_user,
168 &buf);
169 return err < 0 ? err : newlen;
170}
171EXPORT_SYMBOL(snd_seq_expand_var_event);
172
173/*
174 * release this cell, free extended data if available
175 */
176
177static inline void free_cell(struct snd_seq_pool *pool,
178 struct snd_seq_event_cell *cell)
179{
180 cell->next = pool->free;
181 pool->free = cell;
182 atomic_dec(&pool->counter);
183}
184
185void snd_seq_cell_free(struct snd_seq_event_cell * cell)
186{
187 unsigned long flags;
188 struct snd_seq_pool *pool;
189
190 if (snd_BUG_ON(!cell))
191 return;
192 pool = cell->pool;
193 if (snd_BUG_ON(!pool))
194 return;
195
196 spin_lock_irqsave(&pool->lock, flags);
197 free_cell(pool, cell);
198 if (snd_seq_ev_is_variable(&cell->event)) {
199 if (cell->event.data.ext.len & SNDRV_SEQ_EXT_CHAINED) {
200 struct snd_seq_event_cell *curp, *nextptr;
201 curp = cell->event.data.ext.ptr;
202 for (; curp; curp = nextptr) {
203 nextptr = curp->next;
204 curp->next = pool->free;
205 free_cell(pool, curp);
206 }
207 }
208 }
209 if (waitqueue_active(&pool->output_sleep)) {
210 /* has enough space now? */
211 if (snd_seq_output_ok(pool))
212 wake_up(&pool->output_sleep);
213 }
214 spin_unlock_irqrestore(&pool->lock, flags);
215}
216
217
218/*
219 * allocate an event cell.
220 */
221static int snd_seq_cell_alloc(struct snd_seq_pool *pool,
222 struct snd_seq_event_cell **cellp,
223 int nonblock, struct file *file,
224 struct mutex *mutexp)
225{
226 struct snd_seq_event_cell *cell;
227 unsigned long flags;
228 int err = -EAGAIN;
229 wait_queue_entry_t wait;
230
231 if (pool == NULL)
232 return -EINVAL;
233
234 *cellp = NULL;
235
236 init_waitqueue_entry(&wait, current);
237 spin_lock_irqsave(&pool->lock, flags);
238 if (pool->ptr == NULL) { /* not initialized */
239 pr_debug("ALSA: seq: pool is not initialized\n");
240 err = -EINVAL;
241 goto __error;
242 }
243 while (pool->free == NULL && ! nonblock && ! pool->closing) {
244
245 set_current_state(TASK_INTERRUPTIBLE);
246 add_wait_queue(&pool->output_sleep, &wait);
247 spin_unlock_irq(&pool->lock);
248 if (mutexp)
249 mutex_unlock(mutexp);
250 schedule();
251 if (mutexp)
252 mutex_lock(mutexp);
253 spin_lock_irq(&pool->lock);
254 remove_wait_queue(&pool->output_sleep, &wait);
255 /* interrupted? */
256 if (signal_pending(current)) {
257 err = -ERESTARTSYS;
258 goto __error;
259 }
260 }
261 if (pool->closing) { /* closing.. */
262 err = -ENOMEM;
263 goto __error;
264 }
265
266 cell = pool->free;
267 if (cell) {
268 int used;
269 pool->free = cell->next;
270 atomic_inc(&pool->counter);
271 used = atomic_read(&pool->counter);
272 if (pool->max_used < used)
273 pool->max_used = used;
274 pool->event_alloc_success++;
275 /* clear cell pointers */
276 cell->next = NULL;
277 err = 0;
278 } else
279 pool->event_alloc_failures++;
280 *cellp = cell;
281
282__error:
283 spin_unlock_irqrestore(&pool->lock, flags);
284 return err;
285}
286
287
288/*
289 * duplicate the event to a cell.
290 * if the event has external data, the data is decomposed to additional
291 * cells.
292 */
293int snd_seq_event_dup(struct snd_seq_pool *pool, struct snd_seq_event *event,
294 struct snd_seq_event_cell **cellp, int nonblock,
295 struct file *file, struct mutex *mutexp)
296{
297 int ncells, err;
298 unsigned int extlen;
299 struct snd_seq_event_cell *cell;
300
301 *cellp = NULL;
302
303 ncells = 0;
304 extlen = 0;
305 if (snd_seq_ev_is_variable(event)) {
306 extlen = event->data.ext.len & ~SNDRV_SEQ_EXT_MASK;
307 ncells = (extlen + sizeof(struct snd_seq_event) - 1) / sizeof(struct snd_seq_event);
308 }
309 if (ncells >= pool->total_elements)
310 return -ENOMEM;
311
312 err = snd_seq_cell_alloc(pool, &cell, nonblock, file, mutexp);
313 if (err < 0)
314 return err;
315
316 /* copy the event */
317 cell->event = *event;
318
319 /* decompose */
320 if (snd_seq_ev_is_variable(event)) {
321 int len = extlen;
322 int is_chained = event->data.ext.len & SNDRV_SEQ_EXT_CHAINED;
323 int is_usrptr = event->data.ext.len & SNDRV_SEQ_EXT_USRPTR;
324 struct snd_seq_event_cell *src, *tmp, *tail;
325 char *buf;
326
327 cell->event.data.ext.len = extlen | SNDRV_SEQ_EXT_CHAINED;
328 cell->event.data.ext.ptr = NULL;
329
330 src = (struct snd_seq_event_cell *)event->data.ext.ptr;
331 buf = (char *)event->data.ext.ptr;
332 tail = NULL;
333
334 while (ncells-- > 0) {
335 int size = sizeof(struct snd_seq_event);
336 if (len < size)
337 size = len;
338 err = snd_seq_cell_alloc(pool, &tmp, nonblock, file,
339 mutexp);
340 if (err < 0)
341 goto __error;
342 if (cell->event.data.ext.ptr == NULL)
343 cell->event.data.ext.ptr = tmp;
344 if (tail)
345 tail->next = tmp;
346 tail = tmp;
347 /* copy chunk */
348 if (is_chained && src) {
349 tmp->event = src->event;
350 src = src->next;
351 } else if (is_usrptr) {
352 if (copy_from_user(&tmp->event, (char __force __user *)buf, size)) {
353 err = -EFAULT;
354 goto __error;
355 }
356 } else {
357 memcpy(&tmp->event, buf, size);
358 }
359 buf += size;
360 len -= size;
361 }
362 }
363
364 *cellp = cell;
365 return 0;
366
367__error:
368 snd_seq_cell_free(cell);
369 return err;
370}
371
372
373/* poll wait */
374int snd_seq_pool_poll_wait(struct snd_seq_pool *pool, struct file *file,
375 poll_table *wait)
376{
377 poll_wait(file, &pool->output_sleep, wait);
378 return snd_seq_output_ok(pool);
379}
380
381
382/* allocate room specified number of events */
383int snd_seq_pool_init(struct snd_seq_pool *pool)
384{
385 int cell;
386 struct snd_seq_event_cell *cellptr;
387 unsigned long flags;
388
389 if (snd_BUG_ON(!pool))
390 return -EINVAL;
391
392 cellptr = vmalloc(sizeof(struct snd_seq_event_cell) * pool->size);
393 if (!cellptr)
394 return -ENOMEM;
395
396 /* add new cells to the free cell list */
397 spin_lock_irqsave(&pool->lock, flags);
398 if (pool->ptr) {
399 spin_unlock_irqrestore(&pool->lock, flags);
400 vfree(cellptr);
401 return 0;
402 }
403
404 pool->ptr = cellptr;
405 pool->free = NULL;
406
407 for (cell = 0; cell < pool->size; cell++) {
408 cellptr = pool->ptr + cell;
409 cellptr->pool = pool;
410 cellptr->next = pool->free;
411 pool->free = cellptr;
412 }
413 pool->room = (pool->size + 1) / 2;
414
415 /* init statistics */
416 pool->max_used = 0;
417 pool->total_elements = pool->size;
418 spin_unlock_irqrestore(&pool->lock, flags);
419 return 0;
420}
421
422/* refuse the further insertion to the pool */
423void snd_seq_pool_mark_closing(struct snd_seq_pool *pool)
424{
425 unsigned long flags;
426
427 if (snd_BUG_ON(!pool))
428 return;
429 spin_lock_irqsave(&pool->lock, flags);
430 pool->closing = 1;
431 spin_unlock_irqrestore(&pool->lock, flags);
432}
433
434/* remove events */
435int snd_seq_pool_done(struct snd_seq_pool *pool)
436{
437 unsigned long flags;
438 struct snd_seq_event_cell *ptr;
439
440 if (snd_BUG_ON(!pool))
441 return -EINVAL;
442
443 /* wait for closing all threads */
444 if (waitqueue_active(&pool->output_sleep))
445 wake_up(&pool->output_sleep);
446
447 while (atomic_read(&pool->counter) > 0)
448 schedule_timeout_uninterruptible(1);
449
450 /* release all resources */
451 spin_lock_irqsave(&pool->lock, flags);
452 ptr = pool->ptr;
453 pool->ptr = NULL;
454 pool->free = NULL;
455 pool->total_elements = 0;
456 spin_unlock_irqrestore(&pool->lock, flags);
457
458 vfree(ptr);
459
460 spin_lock_irqsave(&pool->lock, flags);
461 pool->closing = 0;
462 spin_unlock_irqrestore(&pool->lock, flags);
463
464 return 0;
465}
466
467
468/* init new memory pool */
469struct snd_seq_pool *snd_seq_pool_new(int poolsize)
470{
471 struct snd_seq_pool *pool;
472
473 /* create pool block */
474 pool = kzalloc(sizeof(*pool), GFP_KERNEL);
475 if (!pool)
476 return NULL;
477 spin_lock_init(&pool->lock);
478 pool->ptr = NULL;
479 pool->free = NULL;
480 pool->total_elements = 0;
481 atomic_set(&pool->counter, 0);
482 pool->closing = 0;
483 init_waitqueue_head(&pool->output_sleep);
484
485 pool->size = poolsize;
486
487 /* init statistics */
488 pool->max_used = 0;
489 return pool;
490}
491
492/* remove memory pool */
493int snd_seq_pool_delete(struct snd_seq_pool **ppool)
494{
495 struct snd_seq_pool *pool = *ppool;
496
497 *ppool = NULL;
498 if (pool == NULL)
499 return 0;
500 snd_seq_pool_mark_closing(pool);
501 snd_seq_pool_done(pool);
502 kfree(pool);
503 return 0;
504}
505
506/* initialize sequencer memory */
507int __init snd_sequencer_memory_init(void)
508{
509 return 0;
510}
511
512/* release sequencer memory */
513void __exit snd_sequencer_memory_done(void)
514{
515}
516
517
518/* exported to seq_clientmgr.c */
519void snd_seq_info_pool(struct snd_info_buffer *buffer,
520 struct snd_seq_pool *pool, char *space)
521{
522 if (pool == NULL)
523 return;
524 snd_iprintf(buffer, "%sPool size : %d\n", space, pool->total_elements);
525 snd_iprintf(buffer, "%sCells in use : %d\n", space, atomic_read(&pool->counter));
526 snd_iprintf(buffer, "%sPeak cells in use : %d\n", space, pool->max_used);
527 snd_iprintf(buffer, "%sAlloc success : %d\n", space, pool->event_alloc_success);
528 snd_iprintf(buffer, "%sAlloc failures : %d\n", space, pool->event_alloc_failures);
529}
1// SPDX-License-Identifier: GPL-2.0-or-later
2/*
3 * ALSA sequencer Memory Manager
4 * Copyright (c) 1998 by Frank van de Pol <fvdpol@coil.demon.nl>
5 * Jaroslav Kysela <perex@perex.cz>
6 * 2000 by Takashi Iwai <tiwai@suse.de>
7 */
8
9#include <linux/init.h>
10#include <linux/export.h>
11#include <linux/slab.h>
12#include <linux/sched/signal.h>
13#include <linux/mm.h>
14#include <sound/core.h>
15
16#include <sound/seq_kernel.h>
17#include "seq_memory.h"
18#include "seq_queue.h"
19#include "seq_info.h"
20#include "seq_lock.h"
21
22static inline int snd_seq_pool_available(struct snd_seq_pool *pool)
23{
24 return pool->total_elements - atomic_read(&pool->counter);
25}
26
27static inline int snd_seq_output_ok(struct snd_seq_pool *pool)
28{
29 return snd_seq_pool_available(pool) >= pool->room;
30}
31
32/*
33 * Variable length event:
34 * The event like sysex uses variable length type.
35 * The external data may be stored in three different formats.
36 * 1) kernel space
37 * This is the normal case.
38 * ext.data.len = length
39 * ext.data.ptr = buffer pointer
40 * 2) user space
41 * When an event is generated via read(), the external data is
42 * kept in user space until expanded.
43 * ext.data.len = length | SNDRV_SEQ_EXT_USRPTR
44 * ext.data.ptr = userspace pointer
45 * 3) chained cells
46 * When the variable length event is enqueued (in prioq or fifo),
47 * the external data is decomposed to several cells.
48 * ext.data.len = length | SNDRV_SEQ_EXT_CHAINED
49 * ext.data.ptr = the additiona cell head
50 * -> cell.next -> cell.next -> ..
51 */
52
53/*
54 * exported:
55 * call dump function to expand external data.
56 */
57
58static int get_var_len(const struct snd_seq_event *event)
59{
60 if ((event->flags & SNDRV_SEQ_EVENT_LENGTH_MASK) != SNDRV_SEQ_EVENT_LENGTH_VARIABLE)
61 return -EINVAL;
62
63 return event->data.ext.len & ~SNDRV_SEQ_EXT_MASK;
64}
65
66int snd_seq_dump_var_event(const struct snd_seq_event *event,
67 snd_seq_dump_func_t func, void *private_data)
68{
69 int len, err;
70 struct snd_seq_event_cell *cell;
71
72 len = get_var_len(event);
73 if (len <= 0)
74 return len;
75
76 if (event->data.ext.len & SNDRV_SEQ_EXT_USRPTR) {
77 char buf[32];
78 char __user *curptr = (char __force __user *)event->data.ext.ptr;
79 while (len > 0) {
80 int size = sizeof(buf);
81 if (len < size)
82 size = len;
83 if (copy_from_user(buf, curptr, size))
84 return -EFAULT;
85 err = func(private_data, buf, size);
86 if (err < 0)
87 return err;
88 curptr += size;
89 len -= size;
90 }
91 return 0;
92 }
93 if (!(event->data.ext.len & SNDRV_SEQ_EXT_CHAINED))
94 return func(private_data, event->data.ext.ptr, len);
95
96 cell = (struct snd_seq_event_cell *)event->data.ext.ptr;
97 for (; len > 0 && cell; cell = cell->next) {
98 int size = sizeof(struct snd_seq_event);
99 if (len < size)
100 size = len;
101 err = func(private_data, &cell->event, size);
102 if (err < 0)
103 return err;
104 len -= size;
105 }
106 return 0;
107}
108EXPORT_SYMBOL(snd_seq_dump_var_event);
109
110
111/*
112 * exported:
113 * expand the variable length event to linear buffer space.
114 */
115
116static int seq_copy_in_kernel(void *ptr, void *src, int size)
117{
118 char **bufptr = ptr;
119
120 memcpy(*bufptr, src, size);
121 *bufptr += size;
122 return 0;
123}
124
125static int seq_copy_in_user(void *ptr, void *src, int size)
126{
127 char __user **bufptr = ptr;
128
129 if (copy_to_user(*bufptr, src, size))
130 return -EFAULT;
131 *bufptr += size;
132 return 0;
133}
134
135int snd_seq_expand_var_event(const struct snd_seq_event *event, int count, char *buf,
136 int in_kernel, int size_aligned)
137{
138 int len, newlen;
139 int err;
140
141 len = get_var_len(event);
142 if (len < 0)
143 return len;
144 newlen = len;
145 if (size_aligned > 0)
146 newlen = roundup(len, size_aligned);
147 if (count < newlen)
148 return -EAGAIN;
149
150 if (event->data.ext.len & SNDRV_SEQ_EXT_USRPTR) {
151 if (! in_kernel)
152 return -EINVAL;
153 if (copy_from_user(buf, (void __force __user *)event->data.ext.ptr, len))
154 return -EFAULT;
155 return newlen;
156 }
157 err = snd_seq_dump_var_event(event,
158 in_kernel ? seq_copy_in_kernel : seq_copy_in_user,
159 &buf);
160 return err < 0 ? err : newlen;
161}
162EXPORT_SYMBOL(snd_seq_expand_var_event);
163
164/*
165 * release this cell, free extended data if available
166 */
167
168static inline void free_cell(struct snd_seq_pool *pool,
169 struct snd_seq_event_cell *cell)
170{
171 cell->next = pool->free;
172 pool->free = cell;
173 atomic_dec(&pool->counter);
174}
175
176void snd_seq_cell_free(struct snd_seq_event_cell * cell)
177{
178 unsigned long flags;
179 struct snd_seq_pool *pool;
180
181 if (snd_BUG_ON(!cell))
182 return;
183 pool = cell->pool;
184 if (snd_BUG_ON(!pool))
185 return;
186
187 spin_lock_irqsave(&pool->lock, flags);
188 free_cell(pool, cell);
189 if (snd_seq_ev_is_variable(&cell->event)) {
190 if (cell->event.data.ext.len & SNDRV_SEQ_EXT_CHAINED) {
191 struct snd_seq_event_cell *curp, *nextptr;
192 curp = cell->event.data.ext.ptr;
193 for (; curp; curp = nextptr) {
194 nextptr = curp->next;
195 curp->next = pool->free;
196 free_cell(pool, curp);
197 }
198 }
199 }
200 if (waitqueue_active(&pool->output_sleep)) {
201 /* has enough space now? */
202 if (snd_seq_output_ok(pool))
203 wake_up(&pool->output_sleep);
204 }
205 spin_unlock_irqrestore(&pool->lock, flags);
206}
207
208
209/*
210 * allocate an event cell.
211 */
212static int snd_seq_cell_alloc(struct snd_seq_pool *pool,
213 struct snd_seq_event_cell **cellp,
214 int nonblock, struct file *file,
215 struct mutex *mutexp)
216{
217 struct snd_seq_event_cell *cell;
218 unsigned long flags;
219 int err = -EAGAIN;
220 wait_queue_entry_t wait;
221
222 if (pool == NULL)
223 return -EINVAL;
224
225 *cellp = NULL;
226
227 init_waitqueue_entry(&wait, current);
228 spin_lock_irqsave(&pool->lock, flags);
229 if (pool->ptr == NULL) { /* not initialized */
230 pr_debug("ALSA: seq: pool is not initialized\n");
231 err = -EINVAL;
232 goto __error;
233 }
234 while (pool->free == NULL && ! nonblock && ! pool->closing) {
235
236 set_current_state(TASK_INTERRUPTIBLE);
237 add_wait_queue(&pool->output_sleep, &wait);
238 spin_unlock_irqrestore(&pool->lock, flags);
239 if (mutexp)
240 mutex_unlock(mutexp);
241 schedule();
242 if (mutexp)
243 mutex_lock(mutexp);
244 spin_lock_irqsave(&pool->lock, flags);
245 remove_wait_queue(&pool->output_sleep, &wait);
246 /* interrupted? */
247 if (signal_pending(current)) {
248 err = -ERESTARTSYS;
249 goto __error;
250 }
251 }
252 if (pool->closing) { /* closing.. */
253 err = -ENOMEM;
254 goto __error;
255 }
256
257 cell = pool->free;
258 if (cell) {
259 int used;
260 pool->free = cell->next;
261 atomic_inc(&pool->counter);
262 used = atomic_read(&pool->counter);
263 if (pool->max_used < used)
264 pool->max_used = used;
265 pool->event_alloc_success++;
266 /* clear cell pointers */
267 cell->next = NULL;
268 err = 0;
269 } else
270 pool->event_alloc_failures++;
271 *cellp = cell;
272
273__error:
274 spin_unlock_irqrestore(&pool->lock, flags);
275 return err;
276}
277
278
279/*
280 * duplicate the event to a cell.
281 * if the event has external data, the data is decomposed to additional
282 * cells.
283 */
284int snd_seq_event_dup(struct snd_seq_pool *pool, struct snd_seq_event *event,
285 struct snd_seq_event_cell **cellp, int nonblock,
286 struct file *file, struct mutex *mutexp)
287{
288 int ncells, err;
289 unsigned int extlen;
290 struct snd_seq_event_cell *cell;
291
292 *cellp = NULL;
293
294 ncells = 0;
295 extlen = 0;
296 if (snd_seq_ev_is_variable(event)) {
297 extlen = event->data.ext.len & ~SNDRV_SEQ_EXT_MASK;
298 ncells = DIV_ROUND_UP(extlen, sizeof(struct snd_seq_event));
299 }
300 if (ncells >= pool->total_elements)
301 return -ENOMEM;
302
303 err = snd_seq_cell_alloc(pool, &cell, nonblock, file, mutexp);
304 if (err < 0)
305 return err;
306
307 /* copy the event */
308 cell->event = *event;
309
310 /* decompose */
311 if (snd_seq_ev_is_variable(event)) {
312 int len = extlen;
313 int is_chained = event->data.ext.len & SNDRV_SEQ_EXT_CHAINED;
314 int is_usrptr = event->data.ext.len & SNDRV_SEQ_EXT_USRPTR;
315 struct snd_seq_event_cell *src, *tmp, *tail;
316 char *buf;
317
318 cell->event.data.ext.len = extlen | SNDRV_SEQ_EXT_CHAINED;
319 cell->event.data.ext.ptr = NULL;
320
321 src = (struct snd_seq_event_cell *)event->data.ext.ptr;
322 buf = (char *)event->data.ext.ptr;
323 tail = NULL;
324
325 while (ncells-- > 0) {
326 int size = sizeof(struct snd_seq_event);
327 if (len < size)
328 size = len;
329 err = snd_seq_cell_alloc(pool, &tmp, nonblock, file,
330 mutexp);
331 if (err < 0)
332 goto __error;
333 if (cell->event.data.ext.ptr == NULL)
334 cell->event.data.ext.ptr = tmp;
335 if (tail)
336 tail->next = tmp;
337 tail = tmp;
338 /* copy chunk */
339 if (is_chained && src) {
340 tmp->event = src->event;
341 src = src->next;
342 } else if (is_usrptr) {
343 if (copy_from_user(&tmp->event, (char __force __user *)buf, size)) {
344 err = -EFAULT;
345 goto __error;
346 }
347 } else {
348 memcpy(&tmp->event, buf, size);
349 }
350 buf += size;
351 len -= size;
352 }
353 }
354
355 *cellp = cell;
356 return 0;
357
358__error:
359 snd_seq_cell_free(cell);
360 return err;
361}
362
363
364/* poll wait */
365int snd_seq_pool_poll_wait(struct snd_seq_pool *pool, struct file *file,
366 poll_table *wait)
367{
368 poll_wait(file, &pool->output_sleep, wait);
369 return snd_seq_output_ok(pool);
370}
371
372
373/* allocate room specified number of events */
374int snd_seq_pool_init(struct snd_seq_pool *pool)
375{
376 int cell;
377 struct snd_seq_event_cell *cellptr;
378
379 if (snd_BUG_ON(!pool))
380 return -EINVAL;
381
382 cellptr = kvmalloc_array(sizeof(struct snd_seq_event_cell), pool->size,
383 GFP_KERNEL);
384 if (!cellptr)
385 return -ENOMEM;
386
387 /* add new cells to the free cell list */
388 spin_lock_irq(&pool->lock);
389 if (pool->ptr) {
390 spin_unlock_irq(&pool->lock);
391 kvfree(cellptr);
392 return 0;
393 }
394
395 pool->ptr = cellptr;
396 pool->free = NULL;
397
398 for (cell = 0; cell < pool->size; cell++) {
399 cellptr = pool->ptr + cell;
400 cellptr->pool = pool;
401 cellptr->next = pool->free;
402 pool->free = cellptr;
403 }
404 pool->room = (pool->size + 1) / 2;
405
406 /* init statistics */
407 pool->max_used = 0;
408 pool->total_elements = pool->size;
409 spin_unlock_irq(&pool->lock);
410 return 0;
411}
412
413/* refuse the further insertion to the pool */
414void snd_seq_pool_mark_closing(struct snd_seq_pool *pool)
415{
416 unsigned long flags;
417
418 if (snd_BUG_ON(!pool))
419 return;
420 spin_lock_irqsave(&pool->lock, flags);
421 pool->closing = 1;
422 spin_unlock_irqrestore(&pool->lock, flags);
423}
424
425/* remove events */
426int snd_seq_pool_done(struct snd_seq_pool *pool)
427{
428 struct snd_seq_event_cell *ptr;
429
430 if (snd_BUG_ON(!pool))
431 return -EINVAL;
432
433 /* wait for closing all threads */
434 if (waitqueue_active(&pool->output_sleep))
435 wake_up(&pool->output_sleep);
436
437 while (atomic_read(&pool->counter) > 0)
438 schedule_timeout_uninterruptible(1);
439
440 /* release all resources */
441 spin_lock_irq(&pool->lock);
442 ptr = pool->ptr;
443 pool->ptr = NULL;
444 pool->free = NULL;
445 pool->total_elements = 0;
446 spin_unlock_irq(&pool->lock);
447
448 kvfree(ptr);
449
450 spin_lock_irq(&pool->lock);
451 pool->closing = 0;
452 spin_unlock_irq(&pool->lock);
453
454 return 0;
455}
456
457
458/* init new memory pool */
459struct snd_seq_pool *snd_seq_pool_new(int poolsize)
460{
461 struct snd_seq_pool *pool;
462
463 /* create pool block */
464 pool = kzalloc(sizeof(*pool), GFP_KERNEL);
465 if (!pool)
466 return NULL;
467 spin_lock_init(&pool->lock);
468 pool->ptr = NULL;
469 pool->free = NULL;
470 pool->total_elements = 0;
471 atomic_set(&pool->counter, 0);
472 pool->closing = 0;
473 init_waitqueue_head(&pool->output_sleep);
474
475 pool->size = poolsize;
476
477 /* init statistics */
478 pool->max_used = 0;
479 return pool;
480}
481
482/* remove memory pool */
483int snd_seq_pool_delete(struct snd_seq_pool **ppool)
484{
485 struct snd_seq_pool *pool = *ppool;
486
487 *ppool = NULL;
488 if (pool == NULL)
489 return 0;
490 snd_seq_pool_mark_closing(pool);
491 snd_seq_pool_done(pool);
492 kfree(pool);
493 return 0;
494}
495
496/* exported to seq_clientmgr.c */
497void snd_seq_info_pool(struct snd_info_buffer *buffer,
498 struct snd_seq_pool *pool, char *space)
499{
500 if (pool == NULL)
501 return;
502 snd_iprintf(buffer, "%sPool size : %d\n", space, pool->total_elements);
503 snd_iprintf(buffer, "%sCells in use : %d\n", space, atomic_read(&pool->counter));
504 snd_iprintf(buffer, "%sPeak cells in use : %d\n", space, pool->max_used);
505 snd_iprintf(buffer, "%sAlloc success : %d\n", space, pool->event_alloc_success);
506 snd_iprintf(buffer, "%sAlloc failures : %d\n", space, pool->event_alloc_failures);
507}