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