Loading...
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 if ((len = get_var_len(event)) <= 0)
73 return len;
74
75 if (event->data.ext.len & SNDRV_SEQ_EXT_USRPTR) {
76 char buf[32];
77 char __user *curptr = (char __force __user *)event->data.ext.ptr;
78 while (len > 0) {
79 int size = sizeof(buf);
80 if (len < size)
81 size = len;
82 if (copy_from_user(buf, curptr, size))
83 return -EFAULT;
84 err = func(private_data, buf, size);
85 if (err < 0)
86 return err;
87 curptr += size;
88 len -= size;
89 }
90 return 0;
91 }
92 if (!(event->data.ext.len & SNDRV_SEQ_EXT_CHAINED))
93 return func(private_data, event->data.ext.ptr, len);
94
95 cell = (struct snd_seq_event_cell *)event->data.ext.ptr;
96 for (; len > 0 && cell; cell = cell->next) {
97 int size = sizeof(struct snd_seq_event);
98 if (len < size)
99 size = len;
100 err = func(private_data, &cell->event, size);
101 if (err < 0)
102 return err;
103 len -= size;
104 }
105 return 0;
106}
107EXPORT_SYMBOL(snd_seq_dump_var_event);
108
109
110/*
111 * exported:
112 * expand the variable length event to linear buffer space.
113 */
114
115static int seq_copy_in_kernel(char **bufptr, const void *src, int size)
116{
117 memcpy(*bufptr, src, size);
118 *bufptr += size;
119 return 0;
120}
121
122static int seq_copy_in_user(char __user **bufptr, const void *src, int size)
123{
124 if (copy_to_user(*bufptr, src, size))
125 return -EFAULT;
126 *bufptr += size;
127 return 0;
128}
129
130int snd_seq_expand_var_event(const struct snd_seq_event *event, int count, char *buf,
131 int in_kernel, int size_aligned)
132{
133 int len, newlen;
134 int err;
135
136 if ((len = get_var_len(event)) < 0)
137 return len;
138 newlen = len;
139 if (size_aligned > 0)
140 newlen = roundup(len, size_aligned);
141 if (count < newlen)
142 return -EAGAIN;
143
144 if (event->data.ext.len & SNDRV_SEQ_EXT_USRPTR) {
145 if (! in_kernel)
146 return -EINVAL;
147 if (copy_from_user(buf, (void __force __user *)event->data.ext.ptr, len))
148 return -EFAULT;
149 return newlen;
150 }
151 err = snd_seq_dump_var_event(event,
152 in_kernel ? (snd_seq_dump_func_t)seq_copy_in_kernel :
153 (snd_seq_dump_func_t)seq_copy_in_user,
154 &buf);
155 return err < 0 ? err : newlen;
156}
157EXPORT_SYMBOL(snd_seq_expand_var_event);
158
159/*
160 * release this cell, free extended data if available
161 */
162
163static inline void free_cell(struct snd_seq_pool *pool,
164 struct snd_seq_event_cell *cell)
165{
166 cell->next = pool->free;
167 pool->free = cell;
168 atomic_dec(&pool->counter);
169}
170
171void snd_seq_cell_free(struct snd_seq_event_cell * cell)
172{
173 unsigned long flags;
174 struct snd_seq_pool *pool;
175
176 if (snd_BUG_ON(!cell))
177 return;
178 pool = cell->pool;
179 if (snd_BUG_ON(!pool))
180 return;
181
182 spin_lock_irqsave(&pool->lock, flags);
183 free_cell(pool, cell);
184 if (snd_seq_ev_is_variable(&cell->event)) {
185 if (cell->event.data.ext.len & SNDRV_SEQ_EXT_CHAINED) {
186 struct snd_seq_event_cell *curp, *nextptr;
187 curp = cell->event.data.ext.ptr;
188 for (; curp; curp = nextptr) {
189 nextptr = curp->next;
190 curp->next = pool->free;
191 free_cell(pool, curp);
192 }
193 }
194 }
195 if (waitqueue_active(&pool->output_sleep)) {
196 /* has enough space now? */
197 if (snd_seq_output_ok(pool))
198 wake_up(&pool->output_sleep);
199 }
200 spin_unlock_irqrestore(&pool->lock, flags);
201}
202
203
204/*
205 * allocate an event cell.
206 */
207static int snd_seq_cell_alloc(struct snd_seq_pool *pool,
208 struct snd_seq_event_cell **cellp,
209 int nonblock, struct file *file,
210 struct mutex *mutexp)
211{
212 struct snd_seq_event_cell *cell;
213 unsigned long flags;
214 int err = -EAGAIN;
215 wait_queue_entry_t wait;
216
217 if (pool == NULL)
218 return -EINVAL;
219
220 *cellp = NULL;
221
222 init_waitqueue_entry(&wait, current);
223 spin_lock_irqsave(&pool->lock, flags);
224 if (pool->ptr == NULL) { /* not initialized */
225 pr_debug("ALSA: seq: pool is not initialized\n");
226 err = -EINVAL;
227 goto __error;
228 }
229 while (pool->free == NULL && ! nonblock && ! pool->closing) {
230
231 set_current_state(TASK_INTERRUPTIBLE);
232 add_wait_queue(&pool->output_sleep, &wait);
233 spin_unlock_irqrestore(&pool->lock, flags);
234 if (mutexp)
235 mutex_unlock(mutexp);
236 schedule();
237 if (mutexp)
238 mutex_lock(mutexp);
239 spin_lock_irqsave(&pool->lock, flags);
240 remove_wait_queue(&pool->output_sleep, &wait);
241 /* interrupted? */
242 if (signal_pending(current)) {
243 err = -ERESTARTSYS;
244 goto __error;
245 }
246 }
247 if (pool->closing) { /* closing.. */
248 err = -ENOMEM;
249 goto __error;
250 }
251
252 cell = pool->free;
253 if (cell) {
254 int used;
255 pool->free = cell->next;
256 atomic_inc(&pool->counter);
257 used = atomic_read(&pool->counter);
258 if (pool->max_used < used)
259 pool->max_used = used;
260 pool->event_alloc_success++;
261 /* clear cell pointers */
262 cell->next = NULL;
263 err = 0;
264 } else
265 pool->event_alloc_failures++;
266 *cellp = cell;
267
268__error:
269 spin_unlock_irqrestore(&pool->lock, flags);
270 return err;
271}
272
273
274/*
275 * duplicate the event to a cell.
276 * if the event has external data, the data is decomposed to additional
277 * cells.
278 */
279int snd_seq_event_dup(struct snd_seq_pool *pool, struct snd_seq_event *event,
280 struct snd_seq_event_cell **cellp, int nonblock,
281 struct file *file, struct mutex *mutexp)
282{
283 int ncells, err;
284 unsigned int extlen;
285 struct snd_seq_event_cell *cell;
286
287 *cellp = NULL;
288
289 ncells = 0;
290 extlen = 0;
291 if (snd_seq_ev_is_variable(event)) {
292 extlen = event->data.ext.len & ~SNDRV_SEQ_EXT_MASK;
293 ncells = (extlen + sizeof(struct snd_seq_event) - 1) / sizeof(struct snd_seq_event);
294 }
295 if (ncells >= pool->total_elements)
296 return -ENOMEM;
297
298 err = snd_seq_cell_alloc(pool, &cell, nonblock, file, mutexp);
299 if (err < 0)
300 return err;
301
302 /* copy the event */
303 cell->event = *event;
304
305 /* decompose */
306 if (snd_seq_ev_is_variable(event)) {
307 int len = extlen;
308 int is_chained = event->data.ext.len & SNDRV_SEQ_EXT_CHAINED;
309 int is_usrptr = event->data.ext.len & SNDRV_SEQ_EXT_USRPTR;
310 struct snd_seq_event_cell *src, *tmp, *tail;
311 char *buf;
312
313 cell->event.data.ext.len = extlen | SNDRV_SEQ_EXT_CHAINED;
314 cell->event.data.ext.ptr = NULL;
315
316 src = (struct snd_seq_event_cell *)event->data.ext.ptr;
317 buf = (char *)event->data.ext.ptr;
318 tail = NULL;
319
320 while (ncells-- > 0) {
321 int size = sizeof(struct snd_seq_event);
322 if (len < size)
323 size = len;
324 err = snd_seq_cell_alloc(pool, &tmp, nonblock, file,
325 mutexp);
326 if (err < 0)
327 goto __error;
328 if (cell->event.data.ext.ptr == NULL)
329 cell->event.data.ext.ptr = tmp;
330 if (tail)
331 tail->next = tmp;
332 tail = tmp;
333 /* copy chunk */
334 if (is_chained && src) {
335 tmp->event = src->event;
336 src = src->next;
337 } else if (is_usrptr) {
338 if (copy_from_user(&tmp->event, (char __force __user *)buf, size)) {
339 err = -EFAULT;
340 goto __error;
341 }
342 } else {
343 memcpy(&tmp->event, buf, size);
344 }
345 buf += size;
346 len -= size;
347 }
348 }
349
350 *cellp = cell;
351 return 0;
352
353__error:
354 snd_seq_cell_free(cell);
355 return err;
356}
357
358
359/* poll wait */
360int snd_seq_pool_poll_wait(struct snd_seq_pool *pool, struct file *file,
361 poll_table *wait)
362{
363 poll_wait(file, &pool->output_sleep, wait);
364 return snd_seq_output_ok(pool);
365}
366
367
368/* allocate room specified number of events */
369int snd_seq_pool_init(struct snd_seq_pool *pool)
370{
371 int cell;
372 struct snd_seq_event_cell *cellptr;
373
374 if (snd_BUG_ON(!pool))
375 return -EINVAL;
376
377 cellptr = kvmalloc_array(sizeof(struct snd_seq_event_cell), pool->size,
378 GFP_KERNEL);
379 if (!cellptr)
380 return -ENOMEM;
381
382 /* add new cells to the free cell list */
383 spin_lock_irq(&pool->lock);
384 if (pool->ptr) {
385 spin_unlock_irq(&pool->lock);
386 kvfree(cellptr);
387 return 0;
388 }
389
390 pool->ptr = cellptr;
391 pool->free = NULL;
392
393 for (cell = 0; cell < pool->size; cell++) {
394 cellptr = pool->ptr + cell;
395 cellptr->pool = pool;
396 cellptr->next = pool->free;
397 pool->free = cellptr;
398 }
399 pool->room = (pool->size + 1) / 2;
400
401 /* init statistics */
402 pool->max_used = 0;
403 pool->total_elements = pool->size;
404 spin_unlock_irq(&pool->lock);
405 return 0;
406}
407
408/* refuse the further insertion to the pool */
409void snd_seq_pool_mark_closing(struct snd_seq_pool *pool)
410{
411 unsigned long flags;
412
413 if (snd_BUG_ON(!pool))
414 return;
415 spin_lock_irqsave(&pool->lock, flags);
416 pool->closing = 1;
417 spin_unlock_irqrestore(&pool->lock, flags);
418}
419
420/* remove events */
421int snd_seq_pool_done(struct snd_seq_pool *pool)
422{
423 struct snd_seq_event_cell *ptr;
424
425 if (snd_BUG_ON(!pool))
426 return -EINVAL;
427
428 /* wait for closing all threads */
429 if (waitqueue_active(&pool->output_sleep))
430 wake_up(&pool->output_sleep);
431
432 while (atomic_read(&pool->counter) > 0)
433 schedule_timeout_uninterruptible(1);
434
435 /* release all resources */
436 spin_lock_irq(&pool->lock);
437 ptr = pool->ptr;
438 pool->ptr = NULL;
439 pool->free = NULL;
440 pool->total_elements = 0;
441 spin_unlock_irq(&pool->lock);
442
443 kvfree(ptr);
444
445 spin_lock_irq(&pool->lock);
446 pool->closing = 0;
447 spin_unlock_irq(&pool->lock);
448
449 return 0;
450}
451
452
453/* init new memory pool */
454struct snd_seq_pool *snd_seq_pool_new(int poolsize)
455{
456 struct snd_seq_pool *pool;
457
458 /* create pool block */
459 pool = kzalloc(sizeof(*pool), GFP_KERNEL);
460 if (!pool)
461 return NULL;
462 spin_lock_init(&pool->lock);
463 pool->ptr = NULL;
464 pool->free = NULL;
465 pool->total_elements = 0;
466 atomic_set(&pool->counter, 0);
467 pool->closing = 0;
468 init_waitqueue_head(&pool->output_sleep);
469
470 pool->size = poolsize;
471
472 /* init statistics */
473 pool->max_used = 0;
474 return pool;
475}
476
477/* remove memory pool */
478int snd_seq_pool_delete(struct snd_seq_pool **ppool)
479{
480 struct snd_seq_pool *pool = *ppool;
481
482 *ppool = NULL;
483 if (pool == NULL)
484 return 0;
485 snd_seq_pool_mark_closing(pool);
486 snd_seq_pool_done(pool);
487 kfree(pool);
488 return 0;
489}
490
491/* exported to seq_clientmgr.c */
492void snd_seq_info_pool(struct snd_info_buffer *buffer,
493 struct snd_seq_pool *pool, char *space)
494{
495 if (pool == NULL)
496 return;
497 snd_iprintf(buffer, "%sPool size : %d\n", space, pool->total_elements);
498 snd_iprintf(buffer, "%sCells in use : %d\n", space, atomic_read(&pool->counter));
499 snd_iprintf(buffer, "%sPeak cells in use : %d\n", space, pool->max_used);
500 snd_iprintf(buffer, "%sAlloc success : %d\n", space, pool->event_alloc_success);
501 snd_iprintf(buffer, "%sAlloc failures : %d\n", space, pool->event_alloc_failures);
502}
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
66static 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)
69{
70 int len, err;
71 struct snd_seq_event_cell *cell;
72
73 len = get_var_len(event);
74 if (len <= 0)
75 return len;
76 if (len <= offset)
77 return 0;
78 if (maxlen && len > offset + maxlen)
79 len = offset + maxlen;
80
81 if (event->data.ext.len & SNDRV_SEQ_EXT_USRPTR) {
82 char buf[32];
83 char __user *curptr = (char __force __user *)event->data.ext.ptr;
84 curptr += offset;
85 len -= offset;
86 while (len > 0) {
87 int size = sizeof(buf);
88 if (len < size)
89 size = len;
90 if (copy_from_user(buf, curptr, size))
91 return -EFAULT;
92 err = func(private_data, buf, size);
93 if (err < 0)
94 return err;
95 curptr += size;
96 len -= size;
97 }
98 return 0;
99 }
100 if (!(event->data.ext.len & SNDRV_SEQ_EXT_CHAINED))
101 return func(private_data, event->data.ext.ptr + offset,
102 len - offset);
103
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;
108
109 if (offset >= size) {
110 offset -= size;
111 len -= size;
112 continue;
113 }
114 if (len < size)
115 size = len;
116 err = func(private_data, curptr + offset, size - offset);
117 if (err < 0)
118 return err;
119 offset = 0;
120 len -= size;
121 }
122 return 0;
123}
124
125int snd_seq_dump_var_event(const struct snd_seq_event *event,
126 snd_seq_dump_func_t func, void *private_data)
127{
128 return dump_var_event(event, func, private_data, 0, 0);
129}
130EXPORT_SYMBOL(snd_seq_dump_var_event);
131
132
133/*
134 * exported:
135 * expand the variable length event to linear buffer space.
136 */
137
138static int seq_copy_in_kernel(void *ptr, void *src, int size)
139{
140 char **bufptr = ptr;
141
142 memcpy(*bufptr, src, size);
143 *bufptr += size;
144 return 0;
145}
146
147static int seq_copy_in_user(void *ptr, void *src, int size)
148{
149 char __user **bufptr = ptr;
150
151 if (copy_to_user(*bufptr, src, size))
152 return -EFAULT;
153 *bufptr += size;
154 return 0;
155}
156
157static int expand_var_event(const struct snd_seq_event *event,
158 int offset, int size, char *buf, bool in_kernel)
159{
160 if (event->data.ext.len & SNDRV_SEQ_EXT_USRPTR) {
161 if (! in_kernel)
162 return -EINVAL;
163 if (copy_from_user(buf,
164 (char __force __user *)event->data.ext.ptr + offset,
165 size))
166 return -EFAULT;
167 return 0;
168 }
169 return dump_var_event(event,
170 in_kernel ? seq_copy_in_kernel : seq_copy_in_user,
171 &buf, offset, size);
172}
173
174int snd_seq_expand_var_event(const struct snd_seq_event *event, int count, char *buf,
175 int in_kernel, int size_aligned)
176{
177 int len, newlen, err;
178
179 len = get_var_len(event);
180 if (len < 0)
181 return len;
182 newlen = len;
183 if (size_aligned > 0)
184 newlen = roundup(len, size_aligned);
185 if (count < newlen)
186 return -EAGAIN;
187 err = expand_var_event(event, 0, len, buf, in_kernel);
188 if (err < 0)
189 return err;
190 if (len != newlen) {
191 if (in_kernel)
192 memset(buf + len, 0, newlen - len);
193 else if (clear_user((__force void __user *)buf + len,
194 newlen - len))
195 return -EFAULT;
196 }
197 return newlen;
198}
199EXPORT_SYMBOL(snd_seq_expand_var_event);
200
201int snd_seq_expand_var_event_at(const struct snd_seq_event *event, int count,
202 char *buf, int offset)
203{
204 int len, err;
205
206 len = get_var_len(event);
207 if (len < 0)
208 return len;
209 if (len <= offset)
210 return 0;
211 len -= offset;
212 if (len > count)
213 len = count;
214 err = expand_var_event(event, offset, count, buf, true);
215 if (err < 0)
216 return err;
217 return len;
218}
219EXPORT_SYMBOL_GPL(snd_seq_expand_var_event_at);
220
221/*
222 * release this cell, free extended data if available
223 */
224
225static inline void free_cell(struct snd_seq_pool *pool,
226 struct snd_seq_event_cell *cell)
227{
228 cell->next = pool->free;
229 pool->free = cell;
230 atomic_dec(&pool->counter);
231}
232
233void snd_seq_cell_free(struct snd_seq_event_cell * cell)
234{
235 struct snd_seq_pool *pool;
236
237 if (snd_BUG_ON(!cell))
238 return;
239 pool = cell->pool;
240 if (snd_BUG_ON(!pool))
241 return;
242
243 guard(spinlock_irqsave)(&pool->lock);
244 free_cell(pool, cell);
245 if (snd_seq_ev_is_variable(&cell->event)) {
246 if (cell->event.data.ext.len & SNDRV_SEQ_EXT_CHAINED) {
247 struct snd_seq_event_cell *curp, *nextptr;
248 curp = cell->event.data.ext.ptr;
249 for (; curp; curp = nextptr) {
250 nextptr = curp->next;
251 curp->next = pool->free;
252 free_cell(pool, curp);
253 }
254 }
255 }
256 if (waitqueue_active(&pool->output_sleep)) {
257 /* has enough space now? */
258 if (snd_seq_output_ok(pool))
259 wake_up(&pool->output_sleep);
260 }
261}
262
263
264/*
265 * allocate an event cell.
266 */
267static int snd_seq_cell_alloc(struct snd_seq_pool *pool,
268 struct snd_seq_event_cell **cellp,
269 int nonblock, struct file *file,
270 struct mutex *mutexp)
271{
272 struct snd_seq_event_cell *cell;
273 unsigned long flags;
274 int err = -EAGAIN;
275 wait_queue_entry_t wait;
276
277 if (pool == NULL)
278 return -EINVAL;
279
280 *cellp = NULL;
281
282 init_waitqueue_entry(&wait, current);
283 spin_lock_irqsave(&pool->lock, flags);
284 if (pool->ptr == NULL) { /* not initialized */
285 pr_debug("ALSA: seq: pool is not initialized\n");
286 err = -EINVAL;
287 goto __error;
288 }
289 while (pool->free == NULL && ! nonblock && ! pool->closing) {
290
291 set_current_state(TASK_INTERRUPTIBLE);
292 add_wait_queue(&pool->output_sleep, &wait);
293 spin_unlock_irqrestore(&pool->lock, flags);
294 if (mutexp)
295 mutex_unlock(mutexp);
296 schedule();
297 if (mutexp)
298 mutex_lock(mutexp);
299 spin_lock_irqsave(&pool->lock, flags);
300 remove_wait_queue(&pool->output_sleep, &wait);
301 /* interrupted? */
302 if (signal_pending(current)) {
303 err = -ERESTARTSYS;
304 goto __error;
305 }
306 }
307 if (pool->closing) { /* closing.. */
308 err = -ENOMEM;
309 goto __error;
310 }
311
312 cell = pool->free;
313 if (cell) {
314 int used;
315 pool->free = cell->next;
316 atomic_inc(&pool->counter);
317 used = atomic_read(&pool->counter);
318 if (pool->max_used < used)
319 pool->max_used = used;
320 pool->event_alloc_success++;
321 /* clear cell pointers */
322 cell->next = NULL;
323 err = 0;
324 } else
325 pool->event_alloc_failures++;
326 *cellp = cell;
327
328__error:
329 spin_unlock_irqrestore(&pool->lock, flags);
330 return err;
331}
332
333
334/*
335 * duplicate the event to a cell.
336 * if the event has external data, the data is decomposed to additional
337 * cells.
338 */
339int snd_seq_event_dup(struct snd_seq_pool *pool, struct snd_seq_event *event,
340 struct snd_seq_event_cell **cellp, int nonblock,
341 struct file *file, struct mutex *mutexp)
342{
343 int ncells, err;
344 unsigned int extlen;
345 struct snd_seq_event_cell *cell;
346 int size;
347
348 *cellp = NULL;
349
350 ncells = 0;
351 extlen = 0;
352 if (snd_seq_ev_is_variable(event)) {
353 extlen = event->data.ext.len & ~SNDRV_SEQ_EXT_MASK;
354 ncells = DIV_ROUND_UP(extlen, sizeof(struct snd_seq_event));
355 }
356 if (ncells >= pool->total_elements)
357 return -ENOMEM;
358
359 err = snd_seq_cell_alloc(pool, &cell, nonblock, file, mutexp);
360 if (err < 0)
361 return err;
362
363 /* copy the event */
364 size = snd_seq_event_packet_size(event);
365 memcpy(&cell->ump, event, size);
366#if IS_ENABLED(CONFIG_SND_SEQ_UMP)
367 if (size < sizeof(cell->event))
368 cell->ump.raw.extra = 0;
369#endif
370
371 /* decompose */
372 if (snd_seq_ev_is_variable(event)) {
373 int len = extlen;
374 int is_chained = event->data.ext.len & SNDRV_SEQ_EXT_CHAINED;
375 int is_usrptr = event->data.ext.len & SNDRV_SEQ_EXT_USRPTR;
376 struct snd_seq_event_cell *src, *tmp, *tail;
377 char *buf;
378
379 cell->event.data.ext.len = extlen | SNDRV_SEQ_EXT_CHAINED;
380 cell->event.data.ext.ptr = NULL;
381
382 src = (struct snd_seq_event_cell *)event->data.ext.ptr;
383 buf = (char *)event->data.ext.ptr;
384 tail = NULL;
385
386 while (ncells-- > 0) {
387 size = sizeof(struct snd_seq_event);
388 if (len < size)
389 size = len;
390 err = snd_seq_cell_alloc(pool, &tmp, nonblock, file,
391 mutexp);
392 if (err < 0)
393 goto __error;
394 if (cell->event.data.ext.ptr == NULL)
395 cell->event.data.ext.ptr = tmp;
396 if (tail)
397 tail->next = tmp;
398 tail = tmp;
399 /* copy chunk */
400 if (is_chained && src) {
401 tmp->event = src->event;
402 src = src->next;
403 } else if (is_usrptr) {
404 if (copy_from_user(&tmp->event, (char __force __user *)buf, size)) {
405 err = -EFAULT;
406 goto __error;
407 }
408 } else {
409 memcpy(&tmp->event, buf, size);
410 }
411 buf += size;
412 len -= size;
413 }
414 }
415
416 *cellp = cell;
417 return 0;
418
419__error:
420 snd_seq_cell_free(cell);
421 return err;
422}
423
424
425/* poll wait */
426int snd_seq_pool_poll_wait(struct snd_seq_pool *pool, struct file *file,
427 poll_table *wait)
428{
429 poll_wait(file, &pool->output_sleep, wait);
430 return snd_seq_output_ok(pool);
431}
432
433
434/* allocate room specified number of events */
435int snd_seq_pool_init(struct snd_seq_pool *pool)
436{
437 int cell;
438 struct snd_seq_event_cell *cellptr;
439
440 if (snd_BUG_ON(!pool))
441 return -EINVAL;
442
443 cellptr = kvmalloc_array(pool->size,
444 sizeof(struct snd_seq_event_cell),
445 GFP_KERNEL);
446 if (!cellptr)
447 return -ENOMEM;
448
449 /* add new cells to the free cell list */
450 guard(spinlock_irq)(&pool->lock);
451 if (pool->ptr) {
452 kvfree(cellptr);
453 return 0;
454 }
455
456 pool->ptr = cellptr;
457 pool->free = NULL;
458
459 for (cell = 0; cell < pool->size; cell++) {
460 cellptr = pool->ptr + cell;
461 cellptr->pool = pool;
462 cellptr->next = pool->free;
463 pool->free = cellptr;
464 }
465 pool->room = (pool->size + 1) / 2;
466
467 /* init statistics */
468 pool->max_used = 0;
469 pool->total_elements = pool->size;
470 return 0;
471}
472
473/* refuse the further insertion to the pool */
474void snd_seq_pool_mark_closing(struct snd_seq_pool *pool)
475{
476 if (snd_BUG_ON(!pool))
477 return;
478 guard(spinlock_irqsave)(&pool->lock);
479 pool->closing = 1;
480}
481
482/* remove events */
483int snd_seq_pool_done(struct snd_seq_pool *pool)
484{
485 struct snd_seq_event_cell *ptr;
486
487 if (snd_BUG_ON(!pool))
488 return -EINVAL;
489
490 /* wait for closing all threads */
491 if (waitqueue_active(&pool->output_sleep))
492 wake_up(&pool->output_sleep);
493
494 while (atomic_read(&pool->counter) > 0)
495 schedule_timeout_uninterruptible(1);
496
497 /* release all resources */
498 scoped_guard(spinlock_irq, &pool->lock) {
499 ptr = pool->ptr;
500 pool->ptr = NULL;
501 pool->free = NULL;
502 pool->total_elements = 0;
503 }
504
505 kvfree(ptr);
506
507 guard(spinlock_irq)(&pool->lock);
508 pool->closing = 0;
509
510 return 0;
511}
512
513
514/* init new memory pool */
515struct snd_seq_pool *snd_seq_pool_new(int poolsize)
516{
517 struct snd_seq_pool *pool;
518
519 /* create pool block */
520 pool = kzalloc(sizeof(*pool), GFP_KERNEL);
521 if (!pool)
522 return NULL;
523 spin_lock_init(&pool->lock);
524 pool->ptr = NULL;
525 pool->free = NULL;
526 pool->total_elements = 0;
527 atomic_set(&pool->counter, 0);
528 pool->closing = 0;
529 init_waitqueue_head(&pool->output_sleep);
530
531 pool->size = poolsize;
532
533 /* init statistics */
534 pool->max_used = 0;
535 return pool;
536}
537
538/* remove memory pool */
539int snd_seq_pool_delete(struct snd_seq_pool **ppool)
540{
541 struct snd_seq_pool *pool = *ppool;
542
543 *ppool = NULL;
544 if (pool == NULL)
545 return 0;
546 snd_seq_pool_mark_closing(pool);
547 snd_seq_pool_done(pool);
548 kfree(pool);
549 return 0;
550}
551
552/* exported to seq_clientmgr.c */
553void snd_seq_info_pool(struct snd_info_buffer *buffer,
554 struct snd_seq_pool *pool, char *space)
555{
556 if (pool == NULL)
557 return;
558 snd_iprintf(buffer, "%sPool size : %d\n", space, pool->total_elements);
559 snd_iprintf(buffer, "%sCells in use : %d\n", space, atomic_read(&pool->counter));
560 snd_iprintf(buffer, "%sPeak cells in use : %d\n", space, pool->max_used);
561 snd_iprintf(buffer, "%sAlloc success : %d\n", space, pool->event_alloc_success);
562 snd_iprintf(buffer, "%sAlloc failures : %d\n", space, pool->event_alloc_failures);
563}