Commit | Line | Data |
---|---|---|
1da177e4 LT |
1 | /* |
2 | * ALSA sequencer Timing queue handling | |
3 | * Copyright (c) 1998-1999 by Frank van de Pol <fvdpol@coil.demon.nl> | |
4 | * | |
5 | * This program is free software; you can redistribute it and/or modify | |
6 | * it under the terms of the GNU General Public License as published by | |
7 | * the Free Software Foundation; either version 2 of the License, or | |
8 | * (at your option) any later version. | |
9 | * | |
10 | * This program is distributed in the hope that it will be useful, | |
11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of | |
12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the | |
13 | * GNU General Public License for more details. | |
14 | * | |
15 | * You should have received a copy of the GNU General Public License | |
16 | * along with this program; if not, write to the Free Software | |
17 | * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA | |
18 | * | |
19 | * MAJOR CHANGES | |
20 | * Nov. 13, 1999 Takashi Iwai <iwai@ww.uni-erlangen.de> | |
21 | * - Queues are allocated dynamically via ioctl. | |
22 | * - When owner client is deleted, all owned queues are deleted, too. | |
23 | * - Owner of unlocked queue is kept unmodified even if it is | |
24 | * manipulated by other clients. | |
25 | * - Owner field in SET_QUEUE_OWNER ioctl must be identical with the | |
26 | * caller client. i.e. Changing owner to a third client is not | |
27 | * allowed. | |
28 | * | |
29 | * Aug. 30, 2000 Takashi Iwai | |
30 | * - Queues are managed in static array again, but with better way. | |
31 | * The API itself is identical. | |
c7e0b5bf | 32 | * - The queue is locked when struct snd_seq_queue pointer is returned via |
1da177e4 LT |
33 | * queueptr(). This pointer *MUST* be released afterward by |
34 | * queuefree(ptr). | |
35 | * - Addition of experimental sync support. | |
36 | */ | |
37 | ||
1da177e4 LT |
38 | #include <linux/init.h> |
39 | #include <linux/slab.h> | |
40 | #include <sound/core.h> | |
41 | ||
42 | #include "seq_memory.h" | |
43 | #include "seq_queue.h" | |
44 | #include "seq_clientmgr.h" | |
45 | #include "seq_fifo.h" | |
46 | #include "seq_timer.h" | |
47 | #include "seq_info.h" | |
48 | ||
49 | /* list of allocated queues */ | |
c7e0b5bf | 50 | static struct snd_seq_queue *queue_list[SNDRV_SEQ_MAX_QUEUES]; |
1da177e4 LT |
51 | static DEFINE_SPINLOCK(queue_list_lock); |
52 | /* number of queues allocated */ | |
53 | static int num_queues; | |
54 | ||
55 | int snd_seq_queue_get_cur_queues(void) | |
56 | { | |
57 | return num_queues; | |
58 | } | |
59 | ||
60 | /*----------------------------------------------------------------*/ | |
61 | ||
62 | /* assign queue id and insert to list */ | |
c7e0b5bf | 63 | static int queue_list_add(struct snd_seq_queue *q) |
1da177e4 LT |
64 | { |
65 | int i; | |
66 | unsigned long flags; | |
67 | ||
68 | spin_lock_irqsave(&queue_list_lock, flags); | |
69 | for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) { | |
70 | if (! queue_list[i]) { | |
71 | queue_list[i] = q; | |
72 | q->queue = i; | |
73 | num_queues++; | |
74 | spin_unlock_irqrestore(&queue_list_lock, flags); | |
75 | return i; | |
76 | } | |
77 | } | |
78 | spin_unlock_irqrestore(&queue_list_lock, flags); | |
79 | return -1; | |
80 | } | |
81 | ||
c7e0b5bf | 82 | static struct snd_seq_queue *queue_list_remove(int id, int client) |
1da177e4 | 83 | { |
c7e0b5bf | 84 | struct snd_seq_queue *q; |
1da177e4 LT |
85 | unsigned long flags; |
86 | ||
87 | spin_lock_irqsave(&queue_list_lock, flags); | |
88 | q = queue_list[id]; | |
89 | if (q) { | |
90 | spin_lock(&q->owner_lock); | |
91 | if (q->owner == client) { | |
92 | /* found */ | |
93 | q->klocked = 1; | |
94 | spin_unlock(&q->owner_lock); | |
95 | queue_list[id] = NULL; | |
96 | num_queues--; | |
97 | spin_unlock_irqrestore(&queue_list_lock, flags); | |
98 | return q; | |
99 | } | |
100 | spin_unlock(&q->owner_lock); | |
101 | } | |
102 | spin_unlock_irqrestore(&queue_list_lock, flags); | |
103 | return NULL; | |
104 | } | |
105 | ||
106 | /*----------------------------------------------------------------*/ | |
107 | ||
108 | /* create new queue (constructor) */ | |
c7e0b5bf | 109 | static struct snd_seq_queue *queue_new(int owner, int locked) |
1da177e4 | 110 | { |
c7e0b5bf | 111 | struct snd_seq_queue *q; |
1da177e4 | 112 | |
ecca82b4 | 113 | q = kzalloc(sizeof(*q), GFP_KERNEL); |
1da177e4 LT |
114 | if (q == NULL) { |
115 | snd_printd("malloc failed for snd_seq_queue_new()\n"); | |
116 | return NULL; | |
117 | } | |
118 | ||
119 | spin_lock_init(&q->owner_lock); | |
120 | spin_lock_init(&q->check_lock); | |
1a60d4c5 | 121 | mutex_init(&q->timer_mutex); |
1da177e4 LT |
122 | snd_use_lock_init(&q->use_lock); |
123 | q->queue = -1; | |
124 | ||
125 | q->tickq = snd_seq_prioq_new(); | |
126 | q->timeq = snd_seq_prioq_new(); | |
127 | q->timer = snd_seq_timer_new(); | |
128 | if (q->tickq == NULL || q->timeq == NULL || q->timer == NULL) { | |
129 | snd_seq_prioq_delete(&q->tickq); | |
130 | snd_seq_prioq_delete(&q->timeq); | |
131 | snd_seq_timer_delete(&q->timer); | |
132 | kfree(q); | |
133 | return NULL; | |
134 | } | |
135 | ||
136 | q->owner = owner; | |
137 | q->locked = locked; | |
138 | q->klocked = 0; | |
139 | ||
140 | return q; | |
141 | } | |
142 | ||
143 | /* delete queue (destructor) */ | |
c7e0b5bf | 144 | static void queue_delete(struct snd_seq_queue *q) |
1da177e4 LT |
145 | { |
146 | /* stop and release the timer */ | |
4b9e9796 | 147 | mutex_lock(&q->timer_mutex); |
1da177e4 LT |
148 | snd_seq_timer_stop(q->timer); |
149 | snd_seq_timer_close(q); | |
4b9e9796 | 150 | mutex_unlock(&q->timer_mutex); |
1da177e4 LT |
151 | /* wait until access free */ |
152 | snd_use_lock_sync(&q->use_lock); | |
153 | /* release resources... */ | |
154 | snd_seq_prioq_delete(&q->tickq); | |
155 | snd_seq_prioq_delete(&q->timeq); | |
156 | snd_seq_timer_delete(&q->timer); | |
157 | ||
158 | kfree(q); | |
159 | } | |
160 | ||
161 | ||
162 | /*----------------------------------------------------------------*/ | |
163 | ||
164 | /* setup queues */ | |
165 | int __init snd_seq_queues_init(void) | |
166 | { | |
167 | /* | |
168 | memset(queue_list, 0, sizeof(queue_list)); | |
169 | num_queues = 0; | |
170 | */ | |
171 | return 0; | |
172 | } | |
173 | ||
174 | /* delete all existing queues */ | |
175 | void __exit snd_seq_queues_delete(void) | |
176 | { | |
177 | int i; | |
178 | ||
179 | /* clear list */ | |
180 | for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) { | |
181 | if (queue_list[i]) | |
182 | queue_delete(queue_list[i]); | |
183 | } | |
184 | } | |
185 | ||
186 | /* allocate a new queue - | |
187 | * return queue index value or negative value for error | |
188 | */ | |
189 | int snd_seq_queue_alloc(int client, int locked, unsigned int info_flags) | |
190 | { | |
c7e0b5bf | 191 | struct snd_seq_queue *q; |
1da177e4 LT |
192 | |
193 | q = queue_new(client, locked); | |
194 | if (q == NULL) | |
195 | return -ENOMEM; | |
196 | q->info_flags = info_flags; | |
197 | if (queue_list_add(q) < 0) { | |
198 | queue_delete(q); | |
199 | return -ENOMEM; | |
200 | } | |
201 | snd_seq_queue_use(q->queue, client, 1); /* use this queue */ | |
202 | return q->queue; | |
203 | } | |
204 | ||
205 | /* delete a queue - queue must be owned by the client */ | |
206 | int snd_seq_queue_delete(int client, int queueid) | |
207 | { | |
c7e0b5bf | 208 | struct snd_seq_queue *q; |
1da177e4 LT |
209 | |
210 | if (queueid < 0 || queueid >= SNDRV_SEQ_MAX_QUEUES) | |
211 | return -EINVAL; | |
212 | q = queue_list_remove(queueid, client); | |
213 | if (q == NULL) | |
214 | return -EINVAL; | |
215 | queue_delete(q); | |
216 | ||
217 | return 0; | |
218 | } | |
219 | ||
220 | ||
221 | /* return pointer to queue structure for specified id */ | |
c7e0b5bf | 222 | struct snd_seq_queue *queueptr(int queueid) |
1da177e4 | 223 | { |
c7e0b5bf | 224 | struct snd_seq_queue *q; |
1da177e4 LT |
225 | unsigned long flags; |
226 | ||
227 | if (queueid < 0 || queueid >= SNDRV_SEQ_MAX_QUEUES) | |
228 | return NULL; | |
229 | spin_lock_irqsave(&queue_list_lock, flags); | |
230 | q = queue_list[queueid]; | |
231 | if (q) | |
232 | snd_use_lock_use(&q->use_lock); | |
233 | spin_unlock_irqrestore(&queue_list_lock, flags); | |
234 | return q; | |
235 | } | |
236 | ||
237 | /* return the (first) queue matching with the specified name */ | |
c7e0b5bf | 238 | struct snd_seq_queue *snd_seq_queue_find_name(char *name) |
1da177e4 LT |
239 | { |
240 | int i; | |
c7e0b5bf | 241 | struct snd_seq_queue *q; |
1da177e4 LT |
242 | |
243 | for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) { | |
244 | if ((q = queueptr(i)) != NULL) { | |
245 | if (strncmp(q->name, name, sizeof(q->name)) == 0) | |
246 | return q; | |
247 | queuefree(q); | |
248 | } | |
249 | } | |
250 | return NULL; | |
251 | } | |
252 | ||
253 | ||
254 | /* -------------------------------------------------------- */ | |
255 | ||
c7e0b5bf | 256 | void snd_seq_check_queue(struct snd_seq_queue *q, int atomic, int hop) |
1da177e4 LT |
257 | { |
258 | unsigned long flags; | |
c7e0b5bf | 259 | struct snd_seq_event_cell *cell; |
1da177e4 LT |
260 | |
261 | if (q == NULL) | |
262 | return; | |
263 | ||
264 | /* make this function non-reentrant */ | |
265 | spin_lock_irqsave(&q->check_lock, flags); | |
266 | if (q->check_blocked) { | |
267 | q->check_again = 1; | |
268 | spin_unlock_irqrestore(&q->check_lock, flags); | |
269 | return; /* other thread is already checking queues */ | |
270 | } | |
271 | q->check_blocked = 1; | |
272 | spin_unlock_irqrestore(&q->check_lock, flags); | |
273 | ||
274 | __again: | |
275 | /* Process tick queue... */ | |
276 | while ((cell = snd_seq_prioq_cell_peek(q->tickq)) != NULL) { | |
c7e0b5bf TI |
277 | if (snd_seq_compare_tick_time(&q->timer->tick.cur_tick, |
278 | &cell->event.time.tick)) { | |
1da177e4 LT |
279 | cell = snd_seq_prioq_cell_out(q->tickq); |
280 | if (cell) | |
281 | snd_seq_dispatch_event(cell, atomic, hop); | |
282 | } else { | |
283 | /* event remains in the queue */ | |
284 | break; | |
285 | } | |
286 | } | |
287 | ||
288 | ||
289 | /* Process time queue... */ | |
290 | while ((cell = snd_seq_prioq_cell_peek(q->timeq)) != NULL) { | |
c7e0b5bf TI |
291 | if (snd_seq_compare_real_time(&q->timer->cur_time, |
292 | &cell->event.time.time)) { | |
1da177e4 LT |
293 | cell = snd_seq_prioq_cell_out(q->timeq); |
294 | if (cell) | |
295 | snd_seq_dispatch_event(cell, atomic, hop); | |
296 | } else { | |
297 | /* event remains in the queue */ | |
298 | break; | |
299 | } | |
300 | } | |
301 | ||
302 | /* free lock */ | |
303 | spin_lock_irqsave(&q->check_lock, flags); | |
304 | if (q->check_again) { | |
305 | q->check_again = 0; | |
306 | spin_unlock_irqrestore(&q->check_lock, flags); | |
307 | goto __again; | |
308 | } | |
309 | q->check_blocked = 0; | |
310 | spin_unlock_irqrestore(&q->check_lock, flags); | |
311 | } | |
312 | ||
313 | ||
314 | /* enqueue a event to singe queue */ | |
c7e0b5bf | 315 | int snd_seq_enqueue_event(struct snd_seq_event_cell *cell, int atomic, int hop) |
1da177e4 LT |
316 | { |
317 | int dest, err; | |
c7e0b5bf | 318 | struct snd_seq_queue *q; |
1da177e4 | 319 | |
7eaa943c TI |
320 | if (snd_BUG_ON(!cell)) |
321 | return -EINVAL; | |
1da177e4 LT |
322 | dest = cell->event.queue; /* destination queue */ |
323 | q = queueptr(dest); | |
324 | if (q == NULL) | |
325 | return -EINVAL; | |
326 | /* handle relative time stamps, convert them into absolute */ | |
327 | if ((cell->event.flags & SNDRV_SEQ_TIME_MODE_MASK) == SNDRV_SEQ_TIME_MODE_REL) { | |
328 | switch (cell->event.flags & SNDRV_SEQ_TIME_STAMP_MASK) { | |
329 | case SNDRV_SEQ_TIME_STAMP_TICK: | |
330 | cell->event.time.tick += q->timer->tick.cur_tick; | |
331 | break; | |
332 | ||
333 | case SNDRV_SEQ_TIME_STAMP_REAL: | |
c7e0b5bf TI |
334 | snd_seq_inc_real_time(&cell->event.time.time, |
335 | &q->timer->cur_time); | |
1da177e4 LT |
336 | break; |
337 | } | |
338 | cell->event.flags &= ~SNDRV_SEQ_TIME_MODE_MASK; | |
339 | cell->event.flags |= SNDRV_SEQ_TIME_MODE_ABS; | |
340 | } | |
341 | /* enqueue event in the real-time or midi queue */ | |
342 | switch (cell->event.flags & SNDRV_SEQ_TIME_STAMP_MASK) { | |
343 | case SNDRV_SEQ_TIME_STAMP_TICK: | |
344 | err = snd_seq_prioq_cell_in(q->tickq, cell); | |
345 | break; | |
346 | ||
347 | case SNDRV_SEQ_TIME_STAMP_REAL: | |
348 | default: | |
349 | err = snd_seq_prioq_cell_in(q->timeq, cell); | |
350 | break; | |
351 | } | |
352 | ||
353 | if (err < 0) { | |
354 | queuefree(q); /* unlock */ | |
355 | return err; | |
356 | } | |
357 | ||
358 | /* trigger dispatching */ | |
359 | snd_seq_check_queue(q, atomic, hop); | |
360 | ||
361 | queuefree(q); /* unlock */ | |
362 | ||
363 | return 0; | |
364 | } | |
365 | ||
366 | ||
367 | /*----------------------------------------------------------------*/ | |
368 | ||
c7e0b5bf | 369 | static inline int check_access(struct snd_seq_queue *q, int client) |
1da177e4 LT |
370 | { |
371 | return (q->owner == client) || (!q->locked && !q->klocked); | |
372 | } | |
373 | ||
374 | /* check if the client has permission to modify queue parameters. | |
375 | * if it does, lock the queue | |
376 | */ | |
c7e0b5bf | 377 | static int queue_access_lock(struct snd_seq_queue *q, int client) |
1da177e4 LT |
378 | { |
379 | unsigned long flags; | |
380 | int access_ok; | |
381 | ||
382 | spin_lock_irqsave(&q->owner_lock, flags); | |
383 | access_ok = check_access(q, client); | |
384 | if (access_ok) | |
385 | q->klocked = 1; | |
386 | spin_unlock_irqrestore(&q->owner_lock, flags); | |
387 | return access_ok; | |
388 | } | |
389 | ||
390 | /* unlock the queue */ | |
c7e0b5bf | 391 | static inline void queue_access_unlock(struct snd_seq_queue *q) |
1da177e4 LT |
392 | { |
393 | unsigned long flags; | |
394 | ||
395 | spin_lock_irqsave(&q->owner_lock, flags); | |
396 | q->klocked = 0; | |
397 | spin_unlock_irqrestore(&q->owner_lock, flags); | |
398 | } | |
399 | ||
400 | /* exported - only checking permission */ | |
401 | int snd_seq_queue_check_access(int queueid, int client) | |
402 | { | |
c7e0b5bf | 403 | struct snd_seq_queue *q = queueptr(queueid); |
1da177e4 LT |
404 | int access_ok; |
405 | unsigned long flags; | |
406 | ||
407 | if (! q) | |
408 | return 0; | |
409 | spin_lock_irqsave(&q->owner_lock, flags); | |
410 | access_ok = check_access(q, client); | |
411 | spin_unlock_irqrestore(&q->owner_lock, flags); | |
412 | queuefree(q); | |
413 | return access_ok; | |
414 | } | |
415 | ||
416 | /*----------------------------------------------------------------*/ | |
417 | ||
418 | /* | |
419 | * change queue's owner and permission | |
420 | */ | |
421 | int snd_seq_queue_set_owner(int queueid, int client, int locked) | |
422 | { | |
c7e0b5bf | 423 | struct snd_seq_queue *q = queueptr(queueid); |
1da177e4 LT |
424 | |
425 | if (q == NULL) | |
426 | return -EINVAL; | |
427 | ||
428 | if (! queue_access_lock(q, client)) { | |
429 | queuefree(q); | |
430 | return -EPERM; | |
431 | } | |
432 | ||
433 | q->locked = locked ? 1 : 0; | |
434 | q->owner = client; | |
435 | queue_access_unlock(q); | |
436 | queuefree(q); | |
437 | ||
438 | return 0; | |
439 | } | |
440 | ||
441 | ||
442 | /*----------------------------------------------------------------*/ | |
443 | ||
444 | /* open timer - | |
445 | * q->use mutex should be down before calling this function to avoid | |
446 | * confliction with snd_seq_queue_use() | |
447 | */ | |
448 | int snd_seq_queue_timer_open(int queueid) | |
449 | { | |
450 | int result = 0; | |
c7e0b5bf TI |
451 | struct snd_seq_queue *queue; |
452 | struct snd_seq_timer *tmr; | |
1da177e4 LT |
453 | |
454 | queue = queueptr(queueid); | |
455 | if (queue == NULL) | |
456 | return -EINVAL; | |
457 | tmr = queue->timer; | |
458 | if ((result = snd_seq_timer_open(queue)) < 0) { | |
459 | snd_seq_timer_defaults(tmr); | |
460 | result = snd_seq_timer_open(queue); | |
461 | } | |
462 | queuefree(queue); | |
463 | return result; | |
464 | } | |
465 | ||
466 | /* close timer - | |
467 | * q->use mutex should be down before calling this function | |
468 | */ | |
469 | int snd_seq_queue_timer_close(int queueid) | |
470 | { | |
c7e0b5bf | 471 | struct snd_seq_queue *queue; |
1da177e4 LT |
472 | int result = 0; |
473 | ||
474 | queue = queueptr(queueid); | |
475 | if (queue == NULL) | |
476 | return -EINVAL; | |
1da177e4 LT |
477 | snd_seq_timer_close(queue); |
478 | queuefree(queue); | |
479 | return result; | |
480 | } | |
481 | ||
482 | /* change queue tempo and ppq */ | |
c7e0b5bf TI |
483 | int snd_seq_queue_timer_set_tempo(int queueid, int client, |
484 | struct snd_seq_queue_tempo *info) | |
1da177e4 | 485 | { |
c7e0b5bf | 486 | struct snd_seq_queue *q = queueptr(queueid); |
1da177e4 LT |
487 | int result; |
488 | ||
489 | if (q == NULL) | |
490 | return -EINVAL; | |
491 | if (! queue_access_lock(q, client)) { | |
492 | queuefree(q); | |
493 | return -EPERM; | |
494 | } | |
495 | ||
496 | result = snd_seq_timer_set_tempo(q->timer, info->tempo); | |
497 | if (result >= 0) | |
498 | result = snd_seq_timer_set_ppq(q->timer, info->ppq); | |
499 | if (result >= 0 && info->skew_base > 0) | |
c7e0b5bf TI |
500 | result = snd_seq_timer_set_skew(q->timer, info->skew_value, |
501 | info->skew_base); | |
1da177e4 LT |
502 | queue_access_unlock(q); |
503 | queuefree(q); | |
504 | return result; | |
505 | } | |
506 | ||
507 | ||
508 | /* use or unuse this queue - | |
509 | * if it is the first client, starts the timer. | |
510 | * if it is not longer used by any clients, stop the timer. | |
511 | */ | |
512 | int snd_seq_queue_use(int queueid, int client, int use) | |
513 | { | |
c7e0b5bf | 514 | struct snd_seq_queue *queue; |
1da177e4 LT |
515 | |
516 | queue = queueptr(queueid); | |
517 | if (queue == NULL) | |
518 | return -EINVAL; | |
1a60d4c5 | 519 | mutex_lock(&queue->timer_mutex); |
1da177e4 LT |
520 | if (use) { |
521 | if (!test_and_set_bit(client, queue->clients_bitmap)) | |
522 | queue->clients++; | |
523 | } else { | |
524 | if (test_and_clear_bit(client, queue->clients_bitmap)) | |
525 | queue->clients--; | |
526 | } | |
527 | if (queue->clients) { | |
528 | if (use && queue->clients == 1) | |
529 | snd_seq_timer_defaults(queue->timer); | |
530 | snd_seq_timer_open(queue); | |
531 | } else { | |
532 | snd_seq_timer_close(queue); | |
533 | } | |
1a60d4c5 | 534 | mutex_unlock(&queue->timer_mutex); |
1da177e4 LT |
535 | queuefree(queue); |
536 | return 0; | |
537 | } | |
538 | ||
539 | /* | |
540 | * check if queue is used by the client | |
541 | * return negative value if the queue is invalid. | |
542 | * return 0 if not used, 1 if used. | |
543 | */ | |
544 | int snd_seq_queue_is_used(int queueid, int client) | |
545 | { | |
c7e0b5bf | 546 | struct snd_seq_queue *q; |
1da177e4 LT |
547 | int result; |
548 | ||
549 | q = queueptr(queueid); | |
550 | if (q == NULL) | |
551 | return -EINVAL; /* invalid queue */ | |
552 | result = test_bit(client, q->clients_bitmap) ? 1 : 0; | |
553 | queuefree(q); | |
554 | return result; | |
555 | } | |
556 | ||
557 | ||
558 | /*----------------------------------------------------------------*/ | |
559 | ||
560 | /* notification that client has left the system - | |
561 | * stop the timer on all queues owned by this client | |
562 | */ | |
563 | void snd_seq_queue_client_termination(int client) | |
564 | { | |
565 | unsigned long flags; | |
566 | int i; | |
c7e0b5bf | 567 | struct snd_seq_queue *q; |
1da177e4 LT |
568 | |
569 | for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) { | |
570 | if ((q = queueptr(i)) == NULL) | |
571 | continue; | |
572 | spin_lock_irqsave(&q->owner_lock, flags); | |
573 | if (q->owner == client) | |
574 | q->klocked = 1; | |
575 | spin_unlock_irqrestore(&q->owner_lock, flags); | |
576 | if (q->owner == client) { | |
577 | if (q->timer->running) | |
578 | snd_seq_timer_stop(q->timer); | |
579 | snd_seq_timer_reset(q->timer); | |
580 | } | |
581 | queuefree(q); | |
582 | } | |
583 | } | |
584 | ||
585 | /* final stage notification - | |
586 | * remove cells for no longer exist client (for non-owned queue) | |
587 | * or delete this queue (for owned queue) | |
588 | */ | |
589 | void snd_seq_queue_client_leave(int client) | |
590 | { | |
591 | int i; | |
c7e0b5bf | 592 | struct snd_seq_queue *q; |
1da177e4 LT |
593 | |
594 | /* delete own queues from queue list */ | |
595 | for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) { | |
596 | if ((q = queue_list_remove(i, client)) != NULL) | |
597 | queue_delete(q); | |
598 | } | |
599 | ||
600 | /* remove cells from existing queues - | |
601 | * they are not owned by this client | |
602 | */ | |
603 | for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) { | |
604 | if ((q = queueptr(i)) == NULL) | |
605 | continue; | |
606 | if (test_bit(client, q->clients_bitmap)) { | |
607 | snd_seq_prioq_leave(q->tickq, client, 0); | |
608 | snd_seq_prioq_leave(q->timeq, client, 0); | |
609 | snd_seq_queue_use(q->queue, client, 0); | |
610 | } | |
611 | queuefree(q); | |
612 | } | |
613 | } | |
614 | ||
615 | ||
616 | ||
617 | /*----------------------------------------------------------------*/ | |
618 | ||
619 | /* remove cells from all queues */ | |
620 | void snd_seq_queue_client_leave_cells(int client) | |
621 | { | |
622 | int i; | |
c7e0b5bf | 623 | struct snd_seq_queue *q; |
1da177e4 LT |
624 | |
625 | for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) { | |
626 | if ((q = queueptr(i)) == NULL) | |
627 | continue; | |
628 | snd_seq_prioq_leave(q->tickq, client, 0); | |
629 | snd_seq_prioq_leave(q->timeq, client, 0); | |
630 | queuefree(q); | |
631 | } | |
632 | } | |
633 | ||
634 | /* remove cells based on flush criteria */ | |
c7e0b5bf | 635 | void snd_seq_queue_remove_cells(int client, struct snd_seq_remove_events *info) |
1da177e4 LT |
636 | { |
637 | int i; | |
c7e0b5bf | 638 | struct snd_seq_queue *q; |
1da177e4 LT |
639 | |
640 | for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) { | |
641 | if ((q = queueptr(i)) == NULL) | |
642 | continue; | |
643 | if (test_bit(client, q->clients_bitmap) && | |
644 | (! (info->remove_mode & SNDRV_SEQ_REMOVE_DEST) || | |
645 | q->queue == info->queue)) { | |
646 | snd_seq_prioq_remove_events(q->tickq, client, info); | |
647 | snd_seq_prioq_remove_events(q->timeq, client, info); | |
648 | } | |
649 | queuefree(q); | |
650 | } | |
651 | } | |
652 | ||
653 | /*----------------------------------------------------------------*/ | |
654 | ||
655 | /* | |
656 | * send events to all subscribed ports | |
657 | */ | |
c7e0b5bf TI |
658 | static void queue_broadcast_event(struct snd_seq_queue *q, struct snd_seq_event *ev, |
659 | int atomic, int hop) | |
1da177e4 | 660 | { |
c7e0b5bf | 661 | struct snd_seq_event sev; |
1da177e4 LT |
662 | |
663 | sev = *ev; | |
664 | ||
665 | sev.flags = SNDRV_SEQ_TIME_STAMP_TICK|SNDRV_SEQ_TIME_MODE_ABS; | |
666 | sev.time.tick = q->timer->tick.cur_tick; | |
667 | sev.queue = q->queue; | |
668 | sev.data.queue.queue = q->queue; | |
669 | ||
670 | /* broadcast events from Timer port */ | |
671 | sev.source.client = SNDRV_SEQ_CLIENT_SYSTEM; | |
672 | sev.source.port = SNDRV_SEQ_PORT_SYSTEM_TIMER; | |
673 | sev.dest.client = SNDRV_SEQ_ADDRESS_SUBSCRIBERS; | |
674 | snd_seq_kernel_client_dispatch(SNDRV_SEQ_CLIENT_SYSTEM, &sev, atomic, hop); | |
675 | } | |
676 | ||
677 | /* | |
678 | * process a received queue-control event. | |
679 | * this function is exported for seq_sync.c. | |
680 | */ | |
c7e0b5bf TI |
681 | static void snd_seq_queue_process_event(struct snd_seq_queue *q, |
682 | struct snd_seq_event *ev, | |
123992f7 | 683 | int atomic, int hop) |
1da177e4 LT |
684 | { |
685 | switch (ev->type) { | |
686 | case SNDRV_SEQ_EVENT_START: | |
687 | snd_seq_prioq_leave(q->tickq, ev->source.client, 1); | |
688 | snd_seq_prioq_leave(q->timeq, ev->source.client, 1); | |
689 | if (! snd_seq_timer_start(q->timer)) | |
690 | queue_broadcast_event(q, ev, atomic, hop); | |
691 | break; | |
692 | ||
693 | case SNDRV_SEQ_EVENT_CONTINUE: | |
694 | if (! snd_seq_timer_continue(q->timer)) | |
695 | queue_broadcast_event(q, ev, atomic, hop); | |
696 | break; | |
697 | ||
698 | case SNDRV_SEQ_EVENT_STOP: | |
699 | snd_seq_timer_stop(q->timer); | |
700 | queue_broadcast_event(q, ev, atomic, hop); | |
701 | break; | |
702 | ||
703 | case SNDRV_SEQ_EVENT_TEMPO: | |
704 | snd_seq_timer_set_tempo(q->timer, ev->data.queue.param.value); | |
705 | queue_broadcast_event(q, ev, atomic, hop); | |
706 | break; | |
707 | ||
708 | case SNDRV_SEQ_EVENT_SETPOS_TICK: | |
709 | if (snd_seq_timer_set_position_tick(q->timer, ev->data.queue.param.time.tick) == 0) { | |
710 | queue_broadcast_event(q, ev, atomic, hop); | |
711 | } | |
712 | break; | |
713 | ||
714 | case SNDRV_SEQ_EVENT_SETPOS_TIME: | |
715 | if (snd_seq_timer_set_position_time(q->timer, ev->data.queue.param.time.time) == 0) { | |
716 | queue_broadcast_event(q, ev, atomic, hop); | |
717 | } | |
718 | break; | |
719 | case SNDRV_SEQ_EVENT_QUEUE_SKEW: | |
720 | if (snd_seq_timer_set_skew(q->timer, | |
721 | ev->data.queue.param.skew.value, | |
722 | ev->data.queue.param.skew.base) == 0) { | |
723 | queue_broadcast_event(q, ev, atomic, hop); | |
724 | } | |
725 | break; | |
726 | } | |
727 | } | |
728 | ||
729 | ||
730 | /* | |
731 | * Queue control via timer control port: | |
732 | * this function is exported as a callback of timer port. | |
733 | */ | |
c7e0b5bf | 734 | int snd_seq_control_queue(struct snd_seq_event *ev, int atomic, int hop) |
1da177e4 | 735 | { |
c7e0b5bf | 736 | struct snd_seq_queue *q; |
1da177e4 | 737 | |
7eaa943c TI |
738 | if (snd_BUG_ON(!ev)) |
739 | return -EINVAL; | |
1da177e4 LT |
740 | q = queueptr(ev->data.queue.queue); |
741 | ||
742 | if (q == NULL) | |
743 | return -EINVAL; | |
744 | ||
745 | if (! queue_access_lock(q, ev->source.client)) { | |
746 | queuefree(q); | |
747 | return -EPERM; | |
748 | } | |
749 | ||
750 | snd_seq_queue_process_event(q, ev, atomic, hop); | |
751 | ||
752 | queue_access_unlock(q); | |
753 | queuefree(q); | |
754 | return 0; | |
755 | } | |
756 | ||
757 | ||
758 | /*----------------------------------------------------------------*/ | |
759 | ||
04f141a8 | 760 | #ifdef CONFIG_PROC_FS |
1da177e4 | 761 | /* exported to seq_info.c */ |
c7e0b5bf TI |
762 | void snd_seq_info_queues_read(struct snd_info_entry *entry, |
763 | struct snd_info_buffer *buffer) | |
1da177e4 LT |
764 | { |
765 | int i, bpm; | |
c7e0b5bf TI |
766 | struct snd_seq_queue *q; |
767 | struct snd_seq_timer *tmr; | |
1da177e4 LT |
768 | |
769 | for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) { | |
770 | if ((q = queueptr(i)) == NULL) | |
771 | continue; | |
772 | ||
773 | tmr = q->timer; | |
774 | if (tmr->tempo) | |
775 | bpm = 60000000 / tmr->tempo; | |
776 | else | |
777 | bpm = 0; | |
778 | ||
779 | snd_iprintf(buffer, "queue %d: [%s]\n", q->queue, q->name); | |
780 | snd_iprintf(buffer, "owned by client : %d\n", q->owner); | |
781 | snd_iprintf(buffer, "lock status : %s\n", q->locked ? "Locked" : "Free"); | |
782 | snd_iprintf(buffer, "queued time events : %d\n", snd_seq_prioq_avail(q->timeq)); | |
783 | snd_iprintf(buffer, "queued tick events : %d\n", snd_seq_prioq_avail(q->tickq)); | |
784 | snd_iprintf(buffer, "timer state : %s\n", tmr->running ? "Running" : "Stopped"); | |
785 | snd_iprintf(buffer, "timer PPQ : %d\n", tmr->ppq); | |
786 | snd_iprintf(buffer, "current tempo : %d\n", tmr->tempo); | |
787 | snd_iprintf(buffer, "current BPM : %d\n", bpm); | |
788 | snd_iprintf(buffer, "current time : %d.%09d s\n", tmr->cur_time.tv_sec, tmr->cur_time.tv_nsec); | |
789 | snd_iprintf(buffer, "current tick : %d\n", tmr->tick.cur_tick); | |
790 | snd_iprintf(buffer, "\n"); | |
791 | queuefree(q); | |
792 | } | |
793 | } | |
04f141a8 TI |
794 | #endif /* CONFIG_PROC_FS */ |
795 |