~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~

TOMOYO Linux Cross Reference
Linux/sound/core/seq/seq_queue.c

Version: ~ [ linux-5.9 ] ~ [ linux-5.8.14 ] ~ [ linux-5.7.19 ] ~ [ linux-5.6.19 ] ~ [ linux-5.5.19 ] ~ [ linux-5.4.70 ] ~ [ linux-5.3.18 ] ~ [ linux-5.2.21 ] ~ [ linux-5.1.21 ] ~ [ linux-5.0.21 ] ~ [ linux-4.20.17 ] ~ [ linux-4.19.150 ] ~ [ linux-4.18.20 ] ~ [ linux-4.17.19 ] ~ [ linux-4.16.18 ] ~ [ linux-4.15.18 ] ~ [ linux-4.14.200 ] ~ [ linux-4.13.16 ] ~ [ linux-4.12.14 ] ~ [ linux-4.11.12 ] ~ [ linux-4.10.17 ] ~ [ linux-4.9.238 ] ~ [ linux-4.8.17 ] ~ [ linux-4.7.10 ] ~ [ linux-4.6.7 ] ~ [ linux-4.5.7 ] ~ [ linux-4.4.238 ] ~ [ linux-4.3.6 ] ~ [ linux-4.2.8 ] ~ [ linux-4.1.52 ] ~ [ linux-4.0.9 ] ~ [ linux-3.19.8 ] ~ [ linux-3.18.140 ] ~ [ linux-3.17.8 ] ~ [ linux-3.16.85 ] ~ [ linux-3.15.10 ] ~ [ linux-3.14.79 ] ~ [ linux-3.13.11 ] ~ [ linux-3.12.74 ] ~ [ linux-3.11.10 ] ~ [ linux-3.10.108 ] ~ [ linux-2.6.32.71 ] ~ [ linux-2.6.0 ] ~ [ linux-2.4.37.11 ] ~ [ unix-v6-master ] ~ [ ccs-tools-1.8.5 ] ~ [ policy-sample ] ~
Architecture: ~ [ i386 ] ~ [ alpha ] ~ [ m68k ] ~ [ mips ] ~ [ ppc ] ~ [ sparc ] ~ [ sparc64 ] ~

  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 */
 50 static struct snd_seq_queue *queue_list[SNDRV_SEQ_MAX_QUEUES];
 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 */
 63 static 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 
 82 static 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) */
109 static 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)
115                 return NULL;
116 
117         spin_lock_init(&q->owner_lock);
118         spin_lock_init(&q->check_lock);
119         mutex_init(&q->timer_mutex);
120         snd_use_lock_init(&q->use_lock);
121         q->queue = -1;
122 
123         q->tickq = snd_seq_prioq_new();
124         q->timeq = snd_seq_prioq_new();
125         q->timer = snd_seq_timer_new();
126         if (q->tickq == NULL || q->timeq == NULL || q->timer == NULL) {
127                 snd_seq_prioq_delete(&q->tickq);
128                 snd_seq_prioq_delete(&q->timeq);
129                 snd_seq_timer_delete(&q->timer);
130                 kfree(q);
131                 return NULL;
132         }
133 
134         q->owner = owner;
135         q->locked = locked;
136         q->klocked = 0;
137 
138         return q;
139 }
140 
141 /* delete queue (destructor) */
142 static void queue_delete(struct snd_seq_queue *q)
143 {
144         /* stop and release the timer */
145         mutex_lock(&q->timer_mutex);
146         snd_seq_timer_stop(q->timer);
147         snd_seq_timer_close(q);
148         mutex_unlock(&q->timer_mutex);
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 */
163 int __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 */
173 void __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 static void queue_use(struct snd_seq_queue *queue, int client, int use);
185 
186 /* allocate a new queue -
187  * return pointer to new queue or ERR_PTR(-errno) for error
188  * The new queue's use_lock is set to 1. It is the caller's responsibility to
189  * call snd_use_lock_free(&q->use_lock).
190  */
191 struct snd_seq_queue *snd_seq_queue_alloc(int client, int locked, unsigned int info_flags)
192 {
193         struct snd_seq_queue *q;
194 
195         q = queue_new(client, locked);
196         if (q == NULL)
197                 return ERR_PTR(-ENOMEM);
198         q->info_flags = info_flags;
199         queue_use(q, client, 1);
200         snd_use_lock_use(&q->use_lock);
201         if (queue_list_add(q) < 0) {
202                 snd_use_lock_free(&q->use_lock);
203                 queue_delete(q);
204                 return ERR_PTR(-ENOMEM);
205         }
206         return q;
207 }
208 
209 /* delete a queue - queue must be owned by the client */
210 int snd_seq_queue_delete(int client, int queueid)
211 {
212         struct snd_seq_queue *q;
213 
214         if (queueid < 0 || queueid >= SNDRV_SEQ_MAX_QUEUES)
215                 return -EINVAL;
216         q = queue_list_remove(queueid, client);
217         if (q == NULL)
218                 return -EINVAL;
219         queue_delete(q);
220 
221         return 0;
222 }
223 
224 
225 /* return pointer to queue structure for specified id */
226 struct snd_seq_queue *queueptr(int queueid)
227 {
228         struct snd_seq_queue *q;
229         unsigned long flags;
230 
231         if (queueid < 0 || queueid >= SNDRV_SEQ_MAX_QUEUES)
232                 return NULL;
233         spin_lock_irqsave(&queue_list_lock, flags);
234         q = queue_list[queueid];
235         if (q)
236                 snd_use_lock_use(&q->use_lock);
237         spin_unlock_irqrestore(&queue_list_lock, flags);
238         return q;
239 }
240 
241 /* return the (first) queue matching with the specified name */
242 struct snd_seq_queue *snd_seq_queue_find_name(char *name)
243 {
244         int i;
245         struct snd_seq_queue *q;
246 
247         for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) {
248                 if ((q = queueptr(i)) != NULL) {
249                         if (strncmp(q->name, name, sizeof(q->name)) == 0)
250                                 return q;
251                         queuefree(q);
252                 }
253         }
254         return NULL;
255 }
256 
257 
258 /* -------------------------------------------------------- */
259 
260 void snd_seq_check_queue(struct snd_seq_queue *q, int atomic, int hop)
261 {
262         unsigned long flags;
263         struct snd_seq_event_cell *cell;
264 
265         if (q == NULL)
266                 return;
267 
268         /* make this function non-reentrant */
269         spin_lock_irqsave(&q->check_lock, flags);
270         if (q->check_blocked) {
271                 q->check_again = 1;
272                 spin_unlock_irqrestore(&q->check_lock, flags);
273                 return;         /* other thread is already checking queues */
274         }
275         q->check_blocked = 1;
276         spin_unlock_irqrestore(&q->check_lock, flags);
277 
278       __again:
279         /* Process tick queue... */
280         for (;;) {
281                 cell = snd_seq_prioq_cell_out(q->tickq,
282                                               &q->timer->tick.cur_tick);
283                 if (!cell)
284                         break;
285                 snd_seq_dispatch_event(cell, atomic, hop);
286         }
287 
288         /* Process time queue... */
289         for (;;) {
290                 cell = snd_seq_prioq_cell_out(q->timeq, &q->timer->cur_time);
291                 if (!cell)
292                         break;
293                 snd_seq_dispatch_event(cell, atomic, hop);
294         }
295 
296         /* free lock */
297         spin_lock_irqsave(&q->check_lock, flags);
298         if (q->check_again) {
299                 q->check_again = 0;
300                 spin_unlock_irqrestore(&q->check_lock, flags);
301                 goto __again;
302         }
303         q->check_blocked = 0;
304         spin_unlock_irqrestore(&q->check_lock, flags);
305 }
306 
307 
308 /* enqueue a event to singe queue */
309 int snd_seq_enqueue_event(struct snd_seq_event_cell *cell, int atomic, int hop)
310 {
311         int dest, err;
312         struct snd_seq_queue *q;
313 
314         if (snd_BUG_ON(!cell))
315                 return -EINVAL;
316         dest = cell->event.queue;       /* destination queue */
317         q = queueptr(dest);
318         if (q == NULL)
319                 return -EINVAL;
320         /* handle relative time stamps, convert them into absolute */
321         if ((cell->event.flags & SNDRV_SEQ_TIME_MODE_MASK) == SNDRV_SEQ_TIME_MODE_REL) {
322                 switch (cell->event.flags & SNDRV_SEQ_TIME_STAMP_MASK) {
323                 case SNDRV_SEQ_TIME_STAMP_TICK:
324                         cell->event.time.tick += q->timer->tick.cur_tick;
325                         break;
326 
327                 case SNDRV_SEQ_TIME_STAMP_REAL:
328                         snd_seq_inc_real_time(&cell->event.time.time,
329                                               &q->timer->cur_time);
330                         break;
331                 }
332                 cell->event.flags &= ~SNDRV_SEQ_TIME_MODE_MASK;
333                 cell->event.flags |= SNDRV_SEQ_TIME_MODE_ABS;
334         }
335         /* enqueue event in the real-time or midi queue */
336         switch (cell->event.flags & SNDRV_SEQ_TIME_STAMP_MASK) {
337         case SNDRV_SEQ_TIME_STAMP_TICK:
338                 err = snd_seq_prioq_cell_in(q->tickq, cell);
339                 break;
340 
341         case SNDRV_SEQ_TIME_STAMP_REAL:
342         default:
343                 err = snd_seq_prioq_cell_in(q->timeq, cell);
344                 break;
345         }
346 
347         if (err < 0) {
348                 queuefree(q); /* unlock */
349                 return err;
350         }
351 
352         /* trigger dispatching */
353         snd_seq_check_queue(q, atomic, hop);
354 
355         queuefree(q); /* unlock */
356 
357         return 0;
358 }
359 
360 
361 /*----------------------------------------------------------------*/
362 
363 static inline int check_access(struct snd_seq_queue *q, int client)
364 {
365         return (q->owner == client) || (!q->locked && !q->klocked);
366 }
367 
368 /* check if the client has permission to modify queue parameters.
369  * if it does, lock the queue
370  */
371 static int queue_access_lock(struct snd_seq_queue *q, int client)
372 {
373         unsigned long flags;
374         int access_ok;
375         
376         spin_lock_irqsave(&q->owner_lock, flags);
377         access_ok = check_access(q, client);
378         if (access_ok)
379                 q->klocked = 1;
380         spin_unlock_irqrestore(&q->owner_lock, flags);
381         return access_ok;
382 }
383 
384 /* unlock the queue */
385 static inline void queue_access_unlock(struct snd_seq_queue *q)
386 {
387         unsigned long flags;
388 
389         spin_lock_irqsave(&q->owner_lock, flags);
390         q->klocked = 0;
391         spin_unlock_irqrestore(&q->owner_lock, flags);
392 }
393 
394 /* exported - only checking permission */
395 int snd_seq_queue_check_access(int queueid, int client)
396 {
397         struct snd_seq_queue *q = queueptr(queueid);
398         int access_ok;
399         unsigned long flags;
400 
401         if (! q)
402                 return 0;
403         spin_lock_irqsave(&q->owner_lock, flags);
404         access_ok = check_access(q, client);
405         spin_unlock_irqrestore(&q->owner_lock, flags);
406         queuefree(q);
407         return access_ok;
408 }
409 
410 /*----------------------------------------------------------------*/
411 
412 /*
413  * change queue's owner and permission
414  */
415 int snd_seq_queue_set_owner(int queueid, int client, int locked)
416 {
417         struct snd_seq_queue *q = queueptr(queueid);
418 
419         if (q == NULL)
420                 return -EINVAL;
421 
422         if (! queue_access_lock(q, client)) {
423                 queuefree(q);
424                 return -EPERM;
425         }
426 
427         q->locked = locked ? 1 : 0;
428         q->owner = client;
429         queue_access_unlock(q);
430         queuefree(q);
431 
432         return 0;
433 }
434 
435 
436 /*----------------------------------------------------------------*/
437 
438 /* open timer -
439  * q->use mutex should be down before calling this function to avoid
440  * confliction with snd_seq_queue_use()
441  */
442 int snd_seq_queue_timer_open(int queueid)
443 {
444         int result = 0;
445         struct snd_seq_queue *queue;
446         struct snd_seq_timer *tmr;
447 
448         queue = queueptr(queueid);
449         if (queue == NULL)
450                 return -EINVAL;
451         tmr = queue->timer;
452         if ((result = snd_seq_timer_open(queue)) < 0) {
453                 snd_seq_timer_defaults(tmr);
454                 result = snd_seq_timer_open(queue);
455         }
456         queuefree(queue);
457         return result;
458 }
459 
460 /* close timer -
461  * q->use mutex should be down before calling this function
462  */
463 int snd_seq_queue_timer_close(int queueid)
464 {
465         struct snd_seq_queue *queue;
466         int result = 0;
467 
468         queue = queueptr(queueid);
469         if (queue == NULL)
470                 return -EINVAL;
471         snd_seq_timer_close(queue);
472         queuefree(queue);
473         return result;
474 }
475 
476 /* change queue tempo and ppq */
477 int snd_seq_queue_timer_set_tempo(int queueid, int client,
478                                   struct snd_seq_queue_tempo *info)
479 {
480         struct snd_seq_queue *q = queueptr(queueid);
481         int result;
482 
483         if (q == NULL)
484                 return -EINVAL;
485         if (! queue_access_lock(q, client)) {
486                 queuefree(q);
487                 return -EPERM;
488         }
489 
490         result = snd_seq_timer_set_tempo(q->timer, info->tempo);
491         if (result >= 0)
492                 result = snd_seq_timer_set_ppq(q->timer, info->ppq);
493         if (result >= 0 && info->skew_base > 0)
494                 result = snd_seq_timer_set_skew(q->timer, info->skew_value,
495                                                 info->skew_base);
496         queue_access_unlock(q);
497         queuefree(q);
498         return result;
499 }
500 
501 /* use or unuse this queue */
502 static void queue_use(struct snd_seq_queue *queue, int client, int use)
503 {
504         if (use) {
505                 if (!test_and_set_bit(client, queue->clients_bitmap))
506                         queue->clients++;
507         } else {
508                 if (test_and_clear_bit(client, queue->clients_bitmap))
509                         queue->clients--;
510         }
511         if (queue->clients) {
512                 if (use && queue->clients == 1)
513                         snd_seq_timer_defaults(queue->timer);
514                 snd_seq_timer_open(queue);
515         } else {
516                 snd_seq_timer_close(queue);
517         }
518 }
519 
520 /* use or unuse this queue -
521  * if it is the first client, starts the timer.
522  * if it is not longer used by any clients, stop the timer.
523  */
524 int snd_seq_queue_use(int queueid, int client, int use)
525 {
526         struct snd_seq_queue *queue;
527 
528         queue = queueptr(queueid);
529         if (queue == NULL)
530                 return -EINVAL;
531         mutex_lock(&queue->timer_mutex);
532         queue_use(queue, client, use);
533         mutex_unlock(&queue->timer_mutex);
534         queuefree(queue);
535         return 0;
536 }
537 
538 /*
539  * check if queue is used by the client
540  * return negative value if the queue is invalid.
541  * return 0 if not used, 1 if used.
542  */
543 int snd_seq_queue_is_used(int queueid, int client)
544 {
545         struct snd_seq_queue *q;
546         int result;
547 
548         q = queueptr(queueid);
549         if (q == NULL)
550                 return -EINVAL; /* invalid queue */
551         result = test_bit(client, q->clients_bitmap) ? 1 : 0;
552         queuefree(q);
553         return result;
554 }
555 
556 
557 /*----------------------------------------------------------------*/
558 
559 /* notification that client has left the system -
560  * stop the timer on all queues owned by this client
561  */
562 void snd_seq_queue_client_termination(int client)
563 {
564         unsigned long flags;
565         int i;
566         struct snd_seq_queue *q;
567 
568         for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) {
569                 if ((q = queueptr(i)) == NULL)
570                         continue;
571                 spin_lock_irqsave(&q->owner_lock, flags);
572                 if (q->owner == client)
573                         q->klocked = 1;
574                 spin_unlock_irqrestore(&q->owner_lock, flags);
575                 if (q->owner == client) {
576                         if (q->timer->running)
577                                 snd_seq_timer_stop(q->timer);
578                         snd_seq_timer_reset(q->timer);
579                 }
580                 queuefree(q);
581         }
582 }
583 
584 /* final stage notification -
585  * remove cells for no longer exist client (for non-owned queue)
586  * or delete this queue (for owned queue)
587  */
588 void snd_seq_queue_client_leave(int client)
589 {
590         int i;
591         struct snd_seq_queue *q;
592 
593         /* delete own queues from queue list */
594         for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) {
595                 if ((q = queue_list_remove(i, client)) != NULL)
596                         queue_delete(q);
597         }
598 
599         /* remove cells from existing queues -
600          * they are not owned by this client
601          */
602         for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) {
603                 if ((q = queueptr(i)) == NULL)
604                         continue;
605                 if (test_bit(client, q->clients_bitmap)) {
606                         snd_seq_prioq_leave(q->tickq, client, 0);
607                         snd_seq_prioq_leave(q->timeq, client, 0);
608                         snd_seq_queue_use(q->queue, client, 0);
609                 }
610                 queuefree(q);
611         }
612 }
613 
614 
615 
616 /*----------------------------------------------------------------*/
617 
618 /* remove cells from all queues */
619 void snd_seq_queue_client_leave_cells(int client)
620 {
621         int i;
622         struct snd_seq_queue *q;
623 
624         for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) {
625                 if ((q = queueptr(i)) == NULL)
626                         continue;
627                 snd_seq_prioq_leave(q->tickq, client, 0);
628                 snd_seq_prioq_leave(q->timeq, client, 0);
629                 queuefree(q);
630         }
631 }
632 
633 /* remove cells based on flush criteria */
634 void snd_seq_queue_remove_cells(int client, struct snd_seq_remove_events *info)
635 {
636         int i;
637         struct snd_seq_queue *q;
638 
639         for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) {
640                 if ((q = queueptr(i)) == NULL)
641                         continue;
642                 if (test_bit(client, q->clients_bitmap) &&
643                     (! (info->remove_mode & SNDRV_SEQ_REMOVE_DEST) ||
644                      q->queue == info->queue)) {
645                         snd_seq_prioq_remove_events(q->tickq, client, info);
646                         snd_seq_prioq_remove_events(q->timeq, client, info);
647                 }
648                 queuefree(q);
649         }
650 }
651 
652 /*----------------------------------------------------------------*/
653 
654 /*
655  * send events to all subscribed ports
656  */
657 static void queue_broadcast_event(struct snd_seq_queue *q, struct snd_seq_event *ev,
658                                   int atomic, int hop)
659 {
660         struct snd_seq_event sev;
661 
662         sev = *ev;
663         
664         sev.flags = SNDRV_SEQ_TIME_STAMP_TICK|SNDRV_SEQ_TIME_MODE_ABS;
665         sev.time.tick = q->timer->tick.cur_tick;
666         sev.queue = q->queue;
667         sev.data.queue.queue = q->queue;
668 
669         /* broadcast events from Timer port */
670         sev.source.client = SNDRV_SEQ_CLIENT_SYSTEM;
671         sev.source.port = SNDRV_SEQ_PORT_SYSTEM_TIMER;
672         sev.dest.client = SNDRV_SEQ_ADDRESS_SUBSCRIBERS;
673         snd_seq_kernel_client_dispatch(SNDRV_SEQ_CLIENT_SYSTEM, &sev, atomic, hop);
674 }
675 
676 /*
677  * process a received queue-control event.
678  * this function is exported for seq_sync.c.
679  */
680 static void snd_seq_queue_process_event(struct snd_seq_queue *q,
681                                         struct snd_seq_event *ev,
682                                         int atomic, int hop)
683 {
684         switch (ev->type) {
685         case SNDRV_SEQ_EVENT_START:
686                 snd_seq_prioq_leave(q->tickq, ev->source.client, 1);
687                 snd_seq_prioq_leave(q->timeq, ev->source.client, 1);
688                 if (! snd_seq_timer_start(q->timer))
689                         queue_broadcast_event(q, ev, atomic, hop);
690                 break;
691 
692         case SNDRV_SEQ_EVENT_CONTINUE:
693                 if (! snd_seq_timer_continue(q->timer))
694                         queue_broadcast_event(q, ev, atomic, hop);
695                 break;
696 
697         case SNDRV_SEQ_EVENT_STOP:
698                 snd_seq_timer_stop(q->timer);
699                 queue_broadcast_event(q, ev, atomic, hop);
700                 break;
701 
702         case SNDRV_SEQ_EVENT_TEMPO:
703                 snd_seq_timer_set_tempo(q->timer, ev->data.queue.param.value);
704                 queue_broadcast_event(q, ev, atomic, hop);
705                 break;
706 
707         case SNDRV_SEQ_EVENT_SETPOS_TICK:
708                 if (snd_seq_timer_set_position_tick(q->timer, ev->data.queue.param.time.tick) == 0) {
709                         queue_broadcast_event(q, ev, atomic, hop);
710                 }
711                 break;
712 
713         case SNDRV_SEQ_EVENT_SETPOS_TIME:
714                 if (snd_seq_timer_set_position_time(q->timer, ev->data.queue.param.time.time) == 0) {
715                         queue_broadcast_event(q, ev, atomic, hop);
716                 }
717                 break;
718         case SNDRV_SEQ_EVENT_QUEUE_SKEW:
719                 if (snd_seq_timer_set_skew(q->timer,
720                                            ev->data.queue.param.skew.value,
721                                            ev->data.queue.param.skew.base) == 0) {
722                         queue_broadcast_event(q, ev, atomic, hop);
723                 }
724                 break;
725         }
726 }
727 
728 
729 /*
730  * Queue control via timer control port:
731  * this function is exported as a callback of timer port.
732  */
733 int snd_seq_control_queue(struct snd_seq_event *ev, int atomic, int hop)
734 {
735         struct snd_seq_queue *q;
736 
737         if (snd_BUG_ON(!ev))
738                 return -EINVAL;
739         q = queueptr(ev->data.queue.queue);
740 
741         if (q == NULL)
742                 return -EINVAL;
743 
744         if (! queue_access_lock(q, ev->source.client)) {
745                 queuefree(q);
746                 return -EPERM;
747         }
748 
749         snd_seq_queue_process_event(q, ev, atomic, hop);
750 
751         queue_access_unlock(q);
752         queuefree(q);
753         return 0;
754 }
755 
756 
757 /*----------------------------------------------------------------*/
758 
759 #ifdef CONFIG_SND_PROC_FS
760 /* exported to seq_info.c */
761 void snd_seq_info_queues_read(struct snd_info_entry *entry, 
762                               struct snd_info_buffer *buffer)
763 {
764         int i, bpm;
765         struct snd_seq_queue *q;
766         struct snd_seq_timer *tmr;
767 
768         for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) {
769                 if ((q = queueptr(i)) == NULL)
770                         continue;
771 
772                 tmr = q->timer;
773                 if (tmr->tempo)
774                         bpm = 60000000 / tmr->tempo;
775                 else
776                         bpm = 0;
777 
778                 snd_iprintf(buffer, "queue %d: [%s]\n", q->queue, q->name);
779                 snd_iprintf(buffer, "owned by client    : %d\n", q->owner);
780                 snd_iprintf(buffer, "lock status        : %s\n", q->locked ? "Locked" : "Free");
781                 snd_iprintf(buffer, "queued time events : %d\n", snd_seq_prioq_avail(q->timeq));
782                 snd_iprintf(buffer, "queued tick events : %d\n", snd_seq_prioq_avail(q->tickq));
783                 snd_iprintf(buffer, "timer state        : %s\n", tmr->running ? "Running" : "Stopped");
784                 snd_iprintf(buffer, "timer PPQ          : %d\n", tmr->ppq);
785                 snd_iprintf(buffer, "current tempo      : %d\n", tmr->tempo);
786                 snd_iprintf(buffer, "current BPM        : %d\n", bpm);
787                 snd_iprintf(buffer, "current time       : %d.%09d s\n", tmr->cur_time.tv_sec, tmr->cur_time.tv_nsec);
788                 snd_iprintf(buffer, "current tick       : %d\n", tmr->tick.cur_tick);
789                 snd_iprintf(buffer, "\n");
790                 queuefree(q);
791         }
792 }
793 #endif /* CONFIG_SND_PROC_FS */
794 
795 

~ [ source navigation ] ~ [ diff markup ] ~ [ identifier search ] ~

kernel.org | git.kernel.org | LWN.net | Project Home | Wiki (Japanese) | Wiki (English) | SVN repository | Mail admin

Linux® is a registered trademark of Linus Torvalds in the United States and other countries.
TOMOYO® is a registered trademark of NTT DATA CORPORATION.

osdn.jp