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

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

Version: ~ [ linux-5.10-rc5 ] ~ [ linux-5.9.10 ] ~ [ linux-5.8.18 ] ~ [ linux-5.7.19 ] ~ [ linux-5.6.19 ] ~ [ linux-5.5.19 ] ~ [ linux-5.4.79 ] ~ [ linux-5.3.18 ] ~ [ linux-5.2.21 ] ~ [ linux-5.1.21 ] ~ [ linux-5.0.21 ] ~ [ linux-4.20.17 ] ~ [ linux-4.19.159 ] ~ [ linux-4.18.20 ] ~ [ linux-4.17.19 ] ~ [ linux-4.16.18 ] ~ [ linux-4.15.18 ] ~ [ linux-4.14.208 ] ~ [ linux-4.13.16 ] ~ [ linux-4.12.14 ] ~ [ linux-4.11.12 ] ~ [ linux-4.10.17 ] ~ [ linux-4.9.245 ] ~ [ linux-4.8.17 ] ~ [ linux-4.7.10 ] ~ [ linux-4.6.7 ] ~ [ linux-4.5.7 ] ~ [ linux-4.4.245 ] ~ [ 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 == 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) */
144 static void queue_delete(struct snd_seq_queue *q)
145 {
146         /* stop and release the timer */
147         mutex_lock(&q->timer_mutex);
148         snd_seq_timer_stop(q->timer);
149         snd_seq_timer_close(q);
150         mutex_unlock(&q->timer_mutex);
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 {
191         struct snd_seq_queue *q;
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 {
208         struct snd_seq_queue *q;
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 */
222 struct snd_seq_queue *queueptr(int queueid)
223 {
224         struct snd_seq_queue *q;
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 */
238 struct snd_seq_queue *snd_seq_queue_find_name(char *name)
239 {
240         int i;
241         struct snd_seq_queue *q;
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 
256 void snd_seq_check_queue(struct snd_seq_queue *q, int atomic, int hop)
257 {
258         unsigned long flags;
259         struct snd_seq_event_cell *cell;
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) {
277                 if (snd_seq_compare_tick_time(&q->timer->tick.cur_tick,
278                                               &cell->event.time.tick)) {
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) {
291                 if (snd_seq_compare_real_time(&q->timer->cur_time,
292                                               &cell->event.time.time)) {
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 */
315 int snd_seq_enqueue_event(struct snd_seq_event_cell *cell, int atomic, int hop)
316 {
317         int dest, err;
318         struct snd_seq_queue *q;
319 
320         if (snd_BUG_ON(!cell))
321                 return -EINVAL;
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:
334                         snd_seq_inc_real_time(&cell->event.time.time,
335                                               &q->timer->cur_time);
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 
369 static inline int check_access(struct snd_seq_queue *q, int client)
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  */
377 static int queue_access_lock(struct snd_seq_queue *q, int client)
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 */
391 static inline void queue_access_unlock(struct snd_seq_queue *q)
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 {
403         struct snd_seq_queue *q = queueptr(queueid);
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 {
423         struct snd_seq_queue *q = queueptr(queueid);
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;
451         struct snd_seq_queue *queue;
452         struct snd_seq_timer *tmr;
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 {
471         struct snd_seq_queue *queue;
472         struct snd_seq_timer *tmr;
473         int result = 0;
474 
475         queue = queueptr(queueid);
476         if (queue == NULL)
477                 return -EINVAL;
478         tmr = queue->timer;
479         snd_seq_timer_close(queue);
480         queuefree(queue);
481         return result;
482 }
483 
484 /* change queue tempo and ppq */
485 int snd_seq_queue_timer_set_tempo(int queueid, int client,
486                                   struct snd_seq_queue_tempo *info)
487 {
488         struct snd_seq_queue *q = queueptr(queueid);
489         int result;
490 
491         if (q == NULL)
492                 return -EINVAL;
493         if (! queue_access_lock(q, client)) {
494                 queuefree(q);
495                 return -EPERM;
496         }
497 
498         result = snd_seq_timer_set_tempo(q->timer, info->tempo);
499         if (result >= 0)
500                 result = snd_seq_timer_set_ppq(q->timer, info->ppq);
501         if (result >= 0 && info->skew_base > 0)
502                 result = snd_seq_timer_set_skew(q->timer, info->skew_value,
503                                                 info->skew_base);
504         queue_access_unlock(q);
505         queuefree(q);
506         return result;
507 }
508 
509 
510 /* use or unuse this queue -
511  * if it is the first client, starts the timer.
512  * if it is not longer used by any clients, stop the timer.
513  */
514 int snd_seq_queue_use(int queueid, int client, int use)
515 {
516         struct snd_seq_queue *queue;
517 
518         queue = queueptr(queueid);
519         if (queue == NULL)
520                 return -EINVAL;
521         mutex_lock(&queue->timer_mutex);
522         if (use) {
523                 if (!test_and_set_bit(client, queue->clients_bitmap))
524                         queue->clients++;
525         } else {
526                 if (test_and_clear_bit(client, queue->clients_bitmap))
527                         queue->clients--;
528         }
529         if (queue->clients) {
530                 if (use && queue->clients == 1)
531                         snd_seq_timer_defaults(queue->timer);
532                 snd_seq_timer_open(queue);
533         } else {
534                 snd_seq_timer_close(queue);
535         }
536         mutex_unlock(&queue->timer_mutex);
537         queuefree(queue);
538         return 0;
539 }
540 
541 /*
542  * check if queue is used by the client
543  * return negative value if the queue is invalid.
544  * return 0 if not used, 1 if used.
545  */
546 int snd_seq_queue_is_used(int queueid, int client)
547 {
548         struct snd_seq_queue *q;
549         int result;
550 
551         q = queueptr(queueid);
552         if (q == NULL)
553                 return -EINVAL; /* invalid queue */
554         result = test_bit(client, q->clients_bitmap) ? 1 : 0;
555         queuefree(q);
556         return result;
557 }
558 
559 
560 /*----------------------------------------------------------------*/
561 
562 /* notification that client has left the system -
563  * stop the timer on all queues owned by this client
564  */
565 void snd_seq_queue_client_termination(int client)
566 {
567         unsigned long flags;
568         int i;
569         struct snd_seq_queue *q;
570 
571         for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) {
572                 if ((q = queueptr(i)) == NULL)
573                         continue;
574                 spin_lock_irqsave(&q->owner_lock, flags);
575                 if (q->owner == client)
576                         q->klocked = 1;
577                 spin_unlock_irqrestore(&q->owner_lock, flags);
578                 if (q->owner == client) {
579                         if (q->timer->running)
580                                 snd_seq_timer_stop(q->timer);
581                         snd_seq_timer_reset(q->timer);
582                 }
583                 queuefree(q);
584         }
585 }
586 
587 /* final stage notification -
588  * remove cells for no longer exist client (for non-owned queue)
589  * or delete this queue (for owned queue)
590  */
591 void snd_seq_queue_client_leave(int client)
592 {
593         int i;
594         struct snd_seq_queue *q;
595 
596         /* delete own queues from queue list */
597         for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) {
598                 if ((q = queue_list_remove(i, client)) != NULL)
599                         queue_delete(q);
600         }
601 
602         /* remove cells from existing queues -
603          * they are not owned by this client
604          */
605         for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) {
606                 if ((q = queueptr(i)) == NULL)
607                         continue;
608                 if (test_bit(client, q->clients_bitmap)) {
609                         snd_seq_prioq_leave(q->tickq, client, 0);
610                         snd_seq_prioq_leave(q->timeq, client, 0);
611                         snd_seq_queue_use(q->queue, client, 0);
612                 }
613                 queuefree(q);
614         }
615 }
616 
617 
618 
619 /*----------------------------------------------------------------*/
620 
621 /* remove cells from all queues */
622 void snd_seq_queue_client_leave_cells(int client)
623 {
624         int i;
625         struct snd_seq_queue *q;
626 
627         for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) {
628                 if ((q = queueptr(i)) == NULL)
629                         continue;
630                 snd_seq_prioq_leave(q->tickq, client, 0);
631                 snd_seq_prioq_leave(q->timeq, client, 0);
632                 queuefree(q);
633         }
634 }
635 
636 /* remove cells based on flush criteria */
637 void snd_seq_queue_remove_cells(int client, struct snd_seq_remove_events *info)
638 {
639         int i;
640         struct snd_seq_queue *q;
641 
642         for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) {
643                 if ((q = queueptr(i)) == NULL)
644                         continue;
645                 if (test_bit(client, q->clients_bitmap) &&
646                     (! (info->remove_mode & SNDRV_SEQ_REMOVE_DEST) ||
647                      q->queue == info->queue)) {
648                         snd_seq_prioq_remove_events(q->tickq, client, info);
649                         snd_seq_prioq_remove_events(q->timeq, client, info);
650                 }
651                 queuefree(q);
652         }
653 }
654 
655 /*----------------------------------------------------------------*/
656 
657 /*
658  * send events to all subscribed ports
659  */
660 static void queue_broadcast_event(struct snd_seq_queue *q, struct snd_seq_event *ev,
661                                   int atomic, int hop)
662 {
663         struct snd_seq_event sev;
664 
665         sev = *ev;
666         
667         sev.flags = SNDRV_SEQ_TIME_STAMP_TICK|SNDRV_SEQ_TIME_MODE_ABS;
668         sev.time.tick = q->timer->tick.cur_tick;
669         sev.queue = q->queue;
670         sev.data.queue.queue = q->queue;
671 
672         /* broadcast events from Timer port */
673         sev.source.client = SNDRV_SEQ_CLIENT_SYSTEM;
674         sev.source.port = SNDRV_SEQ_PORT_SYSTEM_TIMER;
675         sev.dest.client = SNDRV_SEQ_ADDRESS_SUBSCRIBERS;
676         snd_seq_kernel_client_dispatch(SNDRV_SEQ_CLIENT_SYSTEM, &sev, atomic, hop);
677 }
678 
679 /*
680  * process a received queue-control event.
681  * this function is exported for seq_sync.c.
682  */
683 static void snd_seq_queue_process_event(struct snd_seq_queue *q,
684                                         struct snd_seq_event *ev,
685                                         int atomic, int hop)
686 {
687         switch (ev->type) {
688         case SNDRV_SEQ_EVENT_START:
689                 snd_seq_prioq_leave(q->tickq, ev->source.client, 1);
690                 snd_seq_prioq_leave(q->timeq, ev->source.client, 1);
691                 if (! snd_seq_timer_start(q->timer))
692                         queue_broadcast_event(q, ev, atomic, hop);
693                 break;
694 
695         case SNDRV_SEQ_EVENT_CONTINUE:
696                 if (! snd_seq_timer_continue(q->timer))
697                         queue_broadcast_event(q, ev, atomic, hop);
698                 break;
699 
700         case SNDRV_SEQ_EVENT_STOP:
701                 snd_seq_timer_stop(q->timer);
702                 queue_broadcast_event(q, ev, atomic, hop);
703                 break;
704 
705         case SNDRV_SEQ_EVENT_TEMPO:
706                 snd_seq_timer_set_tempo(q->timer, ev->data.queue.param.value);
707                 queue_broadcast_event(q, ev, atomic, hop);
708                 break;
709 
710         case SNDRV_SEQ_EVENT_SETPOS_TICK:
711                 if (snd_seq_timer_set_position_tick(q->timer, ev->data.queue.param.time.tick) == 0) {
712                         queue_broadcast_event(q, ev, atomic, hop);
713                 }
714                 break;
715 
716         case SNDRV_SEQ_EVENT_SETPOS_TIME:
717                 if (snd_seq_timer_set_position_time(q->timer, ev->data.queue.param.time.time) == 0) {
718                         queue_broadcast_event(q, ev, atomic, hop);
719                 }
720                 break;
721         case SNDRV_SEQ_EVENT_QUEUE_SKEW:
722                 if (snd_seq_timer_set_skew(q->timer,
723                                            ev->data.queue.param.skew.value,
724                                            ev->data.queue.param.skew.base) == 0) {
725                         queue_broadcast_event(q, ev, atomic, hop);
726                 }
727                 break;
728         }
729 }
730 
731 
732 /*
733  * Queue control via timer control port:
734  * this function is exported as a callback of timer port.
735  */
736 int snd_seq_control_queue(struct snd_seq_event *ev, int atomic, int hop)
737 {
738         struct snd_seq_queue *q;
739 
740         if (snd_BUG_ON(!ev))
741                 return -EINVAL;
742         q = queueptr(ev->data.queue.queue);
743 
744         if (q == NULL)
745                 return -EINVAL;
746 
747         if (! queue_access_lock(q, ev->source.client)) {
748                 queuefree(q);
749                 return -EPERM;
750         }
751 
752         snd_seq_queue_process_event(q, ev, atomic, hop);
753 
754         queue_access_unlock(q);
755         queuefree(q);
756         return 0;
757 }
758 
759 
760 /*----------------------------------------------------------------*/
761 
762 #ifdef CONFIG_PROC_FS
763 /* exported to seq_info.c */
764 void snd_seq_info_queues_read(struct snd_info_entry *entry, 
765                               struct snd_info_buffer *buffer)
766 {
767         int i, bpm;
768         struct snd_seq_queue *q;
769         struct snd_seq_timer *tmr;
770 
771         for (i = 0; i < SNDRV_SEQ_MAX_QUEUES; i++) {
772                 if ((q = queueptr(i)) == NULL)
773                         continue;
774 
775                 tmr = q->timer;
776                 if (tmr->tempo)
777                         bpm = 60000000 / tmr->tempo;
778                 else
779                         bpm = 0;
780 
781                 snd_iprintf(buffer, "queue %d: [%s]\n", q->queue, q->name);
782                 snd_iprintf(buffer, "owned by client    : %d\n", q->owner);
783                 snd_iprintf(buffer, "lock status        : %s\n", q->locked ? "Locked" : "Free");
784                 snd_iprintf(buffer, "queued time events : %d\n", snd_seq_prioq_avail(q->timeq));
785                 snd_iprintf(buffer, "queued tick events : %d\n", snd_seq_prioq_avail(q->tickq));
786                 snd_iprintf(buffer, "timer state        : %s\n", tmr->running ? "Running" : "Stopped");
787                 snd_iprintf(buffer, "timer PPQ          : %d\n", tmr->ppq);
788                 snd_iprintf(buffer, "current tempo      : %d\n", tmr->tempo);
789                 snd_iprintf(buffer, "current BPM        : %d\n", bpm);
790                 snd_iprintf(buffer, "current time       : %d.%09d s\n", tmr->cur_time.tv_sec, tmr->cur_time.tv_nsec);
791                 snd_iprintf(buffer, "current tick       : %d\n", tmr->tick.cur_tick);
792                 snd_iprintf(buffer, "\n");
793                 queuefree(q);
794         }
795 }
796 #endif /* CONFIG_PROC_FS */
797 
798 

~ [ 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