1 // SPDX-License-Identifier: GPL-2.0-or-later
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>
9 #include <linux/init.h>
10 #include <linux/export.h>
11 #include <linux/slab.h>
12 #include <linux/sched/signal.h>
14 #include <sound/core.h>
16 #include <sound/seq_kernel.h>
17 #include "seq_memory.h"
18 #include "seq_queue.h"
22 static inline int snd_seq_pool_available(struct snd_seq_pool *pool)
24 return pool->total_elements - atomic_read(&pool->counter);
27 static inline int snd_seq_output_ok(struct snd_seq_pool *pool)
29 return snd_seq_pool_available(pool) >= pool->room;
33 * Variable length event:
34 * The event like sysex uses variable length type.
35 * The external data may be stored in three different formats.
37 * This is the normal case.
38 * ext.data.len = length
39 * ext.data.ptr = buffer pointer
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
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 -> ..
55 * call dump function to expand external data.
58 static int get_var_len(const struct snd_seq_event *event)
60 if ((event->flags & SNDRV_SEQ_EVENT_LENGTH_MASK) != SNDRV_SEQ_EVENT_LENGTH_VARIABLE)
63 return event->data.ext.len & ~SNDRV_SEQ_EXT_MASK;
66 static int dump_var_event(const struct snd_seq_event *event,
67 snd_seq_dump_func_t func, void *private_data,
68 int offset, int maxlen)
71 struct snd_seq_event_cell *cell;
73 len = get_var_len(event);
78 if (maxlen && len > offset + maxlen)
79 len = offset + maxlen;
81 if (event->data.ext.len & SNDRV_SEQ_EXT_USRPTR) {
83 char __user *curptr = (char __force __user *)event->data.ext.ptr;
87 int size = sizeof(buf);
90 if (copy_from_user(buf, curptr, size))
92 err = func(private_data, buf, size);
100 if (!(event->data.ext.len & SNDRV_SEQ_EXT_CHAINED))
101 return func(private_data, event->data.ext.ptr + offset,
104 cell = (struct snd_seq_event_cell *)event->data.ext.ptr;
105 for (; len > 0 && cell; cell = cell->next) {
106 int size = sizeof(struct snd_seq_event);
107 char *curptr = (char *)&cell->event;
109 if (offset >= size) {
116 err = func(private_data, curptr + offset, size - offset);
125 int snd_seq_dump_var_event(const struct snd_seq_event *event,
126 snd_seq_dump_func_t func, void *private_data)
128 return dump_var_event(event, func, private_data, 0, 0);
130 EXPORT_SYMBOL(snd_seq_dump_var_event);
135 * expand the variable length event to linear buffer space.
138 static int seq_copy_in_kernel(void *ptr, void *src, int size)
142 memcpy(*bufptr, src, size);
147 static int seq_copy_in_user(void *ptr, void *src, int size)
149 char __user **bufptr = ptr;
151 if (copy_to_user(*bufptr, src, size))
157 static int expand_var_event(const struct snd_seq_event *event,
158 int offset, int size, char *buf, bool in_kernel)
160 if (event->data.ext.len & SNDRV_SEQ_EXT_USRPTR) {
163 if (copy_from_user(buf,
164 (char __force __user *)event->data.ext.ptr + offset,
169 return dump_var_event(event,
170 in_kernel ? seq_copy_in_kernel : seq_copy_in_user,
174 int snd_seq_expand_var_event(const struct snd_seq_event *event, int count, char *buf,
175 int in_kernel, int size_aligned)
177 int len, newlen, err;
179 len = get_var_len(event);
183 if (size_aligned > 0)
184 newlen = roundup(len, size_aligned);
187 err = expand_var_event(event, 0, len, buf, in_kernel);
191 memset(buf + len, 0, newlen - len);
194 EXPORT_SYMBOL(snd_seq_expand_var_event);
196 int snd_seq_expand_var_event_at(const struct snd_seq_event *event, int count,
197 char *buf, int offset)
201 len = get_var_len(event);
209 err = expand_var_event(event, offset, count, buf, true);
214 EXPORT_SYMBOL_GPL(snd_seq_expand_var_event_at);
217 * release this cell, free extended data if available
220 static inline void free_cell(struct snd_seq_pool *pool,
221 struct snd_seq_event_cell *cell)
223 cell->next = pool->free;
225 atomic_dec(&pool->counter);
228 void snd_seq_cell_free(struct snd_seq_event_cell * cell)
231 struct snd_seq_pool *pool;
233 if (snd_BUG_ON(!cell))
236 if (snd_BUG_ON(!pool))
239 spin_lock_irqsave(&pool->lock, flags);
240 free_cell(pool, cell);
241 if (snd_seq_ev_is_variable(&cell->event)) {
242 if (cell->event.data.ext.len & SNDRV_SEQ_EXT_CHAINED) {
243 struct snd_seq_event_cell *curp, *nextptr;
244 curp = cell->event.data.ext.ptr;
245 for (; curp; curp = nextptr) {
246 nextptr = curp->next;
247 curp->next = pool->free;
248 free_cell(pool, curp);
252 if (waitqueue_active(&pool->output_sleep)) {
253 /* has enough space now? */
254 if (snd_seq_output_ok(pool))
255 wake_up(&pool->output_sleep);
257 spin_unlock_irqrestore(&pool->lock, flags);
262 * allocate an event cell.
264 static int snd_seq_cell_alloc(struct snd_seq_pool *pool,
265 struct snd_seq_event_cell **cellp,
266 int nonblock, struct file *file,
267 struct mutex *mutexp)
269 struct snd_seq_event_cell *cell;
272 wait_queue_entry_t wait;
279 init_waitqueue_entry(&wait, current);
280 spin_lock_irqsave(&pool->lock, flags);
281 if (pool->ptr == NULL) { /* not initialized */
282 pr_debug("ALSA: seq: pool is not initialized\n");
286 while (pool->free == NULL && ! nonblock && ! pool->closing) {
288 set_current_state(TASK_INTERRUPTIBLE);
289 add_wait_queue(&pool->output_sleep, &wait);
290 spin_unlock_irqrestore(&pool->lock, flags);
292 mutex_unlock(mutexp);
296 spin_lock_irqsave(&pool->lock, flags);
297 remove_wait_queue(&pool->output_sleep, &wait);
299 if (signal_pending(current)) {
304 if (pool->closing) { /* closing.. */
312 pool->free = cell->next;
313 atomic_inc(&pool->counter);
314 used = atomic_read(&pool->counter);
315 if (pool->max_used < used)
316 pool->max_used = used;
317 pool->event_alloc_success++;
318 /* clear cell pointers */
322 pool->event_alloc_failures++;
326 spin_unlock_irqrestore(&pool->lock, flags);
332 * duplicate the event to a cell.
333 * if the event has external data, the data is decomposed to additional
336 int snd_seq_event_dup(struct snd_seq_pool *pool, struct snd_seq_event *event,
337 struct snd_seq_event_cell **cellp, int nonblock,
338 struct file *file, struct mutex *mutexp)
342 struct snd_seq_event_cell *cell;
349 if (snd_seq_ev_is_variable(event)) {
350 extlen = event->data.ext.len & ~SNDRV_SEQ_EXT_MASK;
351 ncells = DIV_ROUND_UP(extlen, sizeof(struct snd_seq_event));
353 if (ncells >= pool->total_elements)
356 err = snd_seq_cell_alloc(pool, &cell, nonblock, file, mutexp);
361 size = snd_seq_event_packet_size(event);
362 memcpy(&cell->ump, event, size);
363 #if IS_ENABLED(CONFIG_SND_SEQ_UMP)
364 if (size < sizeof(cell->event))
365 cell->ump.raw.extra = 0;
369 if (snd_seq_ev_is_variable(event)) {
371 int is_chained = event->data.ext.len & SNDRV_SEQ_EXT_CHAINED;
372 int is_usrptr = event->data.ext.len & SNDRV_SEQ_EXT_USRPTR;
373 struct snd_seq_event_cell *src, *tmp, *tail;
376 cell->event.data.ext.len = extlen | SNDRV_SEQ_EXT_CHAINED;
377 cell->event.data.ext.ptr = NULL;
379 src = (struct snd_seq_event_cell *)event->data.ext.ptr;
380 buf = (char *)event->data.ext.ptr;
383 while (ncells-- > 0) {
384 size = sizeof(struct snd_seq_event);
387 err = snd_seq_cell_alloc(pool, &tmp, nonblock, file,
391 if (cell->event.data.ext.ptr == NULL)
392 cell->event.data.ext.ptr = tmp;
397 if (is_chained && src) {
398 tmp->event = src->event;
400 } else if (is_usrptr) {
401 if (copy_from_user(&tmp->event, (char __force __user *)buf, size)) {
406 memcpy(&tmp->event, buf, size);
417 snd_seq_cell_free(cell);
423 int snd_seq_pool_poll_wait(struct snd_seq_pool *pool, struct file *file,
426 poll_wait(file, &pool->output_sleep, wait);
427 return snd_seq_output_ok(pool);
431 /* allocate room specified number of events */
432 int snd_seq_pool_init(struct snd_seq_pool *pool)
435 struct snd_seq_event_cell *cellptr;
437 if (snd_BUG_ON(!pool))
440 cellptr = kvmalloc_array(sizeof(struct snd_seq_event_cell), pool->size,
445 /* add new cells to the free cell list */
446 spin_lock_irq(&pool->lock);
448 spin_unlock_irq(&pool->lock);
456 for (cell = 0; cell < pool->size; cell++) {
457 cellptr = pool->ptr + cell;
458 cellptr->pool = pool;
459 cellptr->next = pool->free;
460 pool->free = cellptr;
462 pool->room = (pool->size + 1) / 2;
464 /* init statistics */
466 pool->total_elements = pool->size;
467 spin_unlock_irq(&pool->lock);
471 /* refuse the further insertion to the pool */
472 void snd_seq_pool_mark_closing(struct snd_seq_pool *pool)
476 if (snd_BUG_ON(!pool))
478 spin_lock_irqsave(&pool->lock, flags);
480 spin_unlock_irqrestore(&pool->lock, flags);
484 int snd_seq_pool_done(struct snd_seq_pool *pool)
486 struct snd_seq_event_cell *ptr;
488 if (snd_BUG_ON(!pool))
491 /* wait for closing all threads */
492 if (waitqueue_active(&pool->output_sleep))
493 wake_up(&pool->output_sleep);
495 while (atomic_read(&pool->counter) > 0)
496 schedule_timeout_uninterruptible(1);
498 /* release all resources */
499 spin_lock_irq(&pool->lock);
503 pool->total_elements = 0;
504 spin_unlock_irq(&pool->lock);
508 spin_lock_irq(&pool->lock);
510 spin_unlock_irq(&pool->lock);
516 /* init new memory pool */
517 struct snd_seq_pool *snd_seq_pool_new(int poolsize)
519 struct snd_seq_pool *pool;
521 /* create pool block */
522 pool = kzalloc(sizeof(*pool), GFP_KERNEL);
525 spin_lock_init(&pool->lock);
528 pool->total_elements = 0;
529 atomic_set(&pool->counter, 0);
531 init_waitqueue_head(&pool->output_sleep);
533 pool->size = poolsize;
535 /* init statistics */
540 /* remove memory pool */
541 int snd_seq_pool_delete(struct snd_seq_pool **ppool)
543 struct snd_seq_pool *pool = *ppool;
548 snd_seq_pool_mark_closing(pool);
549 snd_seq_pool_done(pool);
554 /* exported to seq_clientmgr.c */
555 void snd_seq_info_pool(struct snd_info_buffer *buffer,
556 struct snd_seq_pool *pool, char *space)
560 snd_iprintf(buffer, "%sPool size : %d\n", space, pool->total_elements);
561 snd_iprintf(buffer, "%sCells in use : %d\n", space, atomic_read(&pool->counter));
562 snd_iprintf(buffer, "%sPeak cells in use : %d\n", space, pool->max_used);
563 snd_iprintf(buffer, "%sAlloc success : %d\n", space, pool->event_alloc_success);
564 snd_iprintf(buffer, "%sAlloc failures : %d\n", space, pool->event_alloc_failures);