sound/core/seq/seq_queue.c

   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         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 */
 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 /* allocate a new queue -
 185  * return queue index value or negative value for error
 186  */
 187 int 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 */
 204 int 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 */
 220 struct 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 */
 236 struct 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
 254 void 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 */
 313 int 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         snd_assert(cell != NULL, return -EINVAL);
 319         dest = cell->event.queue;       /* destination queue */
 320         q = queueptr(dest);
 321         if (q == NULL)
 322                 return -EINVAL;
 323         /* handle relative time stamps, convert them into absolute */
 324         if ((cell->event.flags & SNDRV_SEQ_TIME_MODE_MASK) == SNDRV_SEQ_TIME_MODE_REL) {
 325                 switch (cell->event.flags & SNDRV_SEQ_TIME_STAMP_MASK) {
 326                 case SNDRV_SEQ_TIME_STAMP_TICK:
 327                         cell->event.time.tick += q->timer->tick.cur_tick;
 328                         break;
 329
 330                 case SNDRV_SEQ_TIME_STAMP_REAL:
 331                         snd_seq_inc_real_time(&cell->event.time.time,
 332                                               &q->timer->cur_time);
 333                         break;
 334                 }
 335                 cell->event.flags &= ~SNDRV_SEQ_TIME_MODE_MASK;
 336                 cell->event.flags |= SNDRV_SEQ_TIME_MODE_ABS;
 337         }
 338         /* enqueue event in the real-time or midi queue */
 339         switch (cell->event.flags & SNDRV_SEQ_TIME_STAMP_MASK) {
 340         case SNDRV_SEQ_TIME_STAMP_TICK:
 341                 err = snd_seq_prioq_cell_in(q->tickq, cell);
 342                 break;
 343
 344         case SNDRV_SEQ_TIME_STAMP_REAL:
 345         default:
 346                 err = snd_seq_prioq_cell_in(q->timeq, cell);
 347                 break;
 348         }
 349
 350         if (err < 0) {
 351                 queuefree(q); /* unlock */
 352                 return err;
 353         }
 354
 355         /* trigger dispatching */
 356         snd_seq_check_queue(q, atomic, hop);
 357
 358         queuefree(q); /* unlock */
 359
 360         return 0;
 361 }
 362
 363
 364 /*----------------------------------------------------------------*/
 365
 366 static inline int check_access(struct snd_seq_queue *q, int client)
 367 {
 368         return (q->owner == client) || (!q->locked && !q->klocked);
 369 }
 370
 371 /* check if the client has permission to modify queue parameters.
 372  * if it does, lock the queue
 373  */
 374 static int queue_access_lock(struct snd_seq_queue *q, int client)
 375 {
 376         unsigned long flags;
 377         int access_ok;
 378
 379         spin_lock_irqsave(&q->owner_lock, flags);
 380         access_ok = check_access(q, client);
 381         if (access_ok)
 382                 q->klocked = 1;
 383         spin_unlock_irqrestore(&q->owner_lock, flags);
 384         return access_ok;
 385 }
 386
 387 /* unlock the queue */
 388 static inline void queue_access_unlock(struct snd_seq_queue *q)
 389 {
 390         unsigned long flags;
 391
 392         spin_lock_irqsave(&q->owner_lock, flags);
 393         q->klocked = 0;
 394         spin_unlock_irqrestore(&q->owner_lock, flags);
 395 }
 396
 397 /* exported - only checking permission */
 398 int snd_seq_queue_check_access(int queueid, int client)
 399 {
 400         struct snd_seq_queue *q = queueptr(queueid);
 401         int access_ok;
 402         unsigned long flags;
 403
 404         if (! q)
 405                 return 0;
 406         spin_lock_irqsave(&q->owner_lock, flags);
 407         access_ok = check_access(q, client);
 408         spin_unlock_irqrestore(&q->owner_lock, flags);
 409         queuefree(q);
 410         return access_ok;
 411 }
 412
 413 /*----------------------------------------------------------------*/
 414
 415 /*
 416  * change queue's owner and permission
 417  */
 418 int snd_seq_queue_set_owner(int queueid, int client, int locked)
 419 {
 420         struct snd_seq_queue *q = queueptr(queueid);
 421
 422         if (q == NULL)
 423                 return -EINVAL;
 424
 425         if (! queue_access_lock(q, client)) {
 426                 queuefree(q);
 427                 return -EPERM;
 428         }
 429
 430         q->locked = locked ? 1 : 0;
 431         q->owner = client;
 432         queue_access_unlock(q);
 433         queuefree(q);
 434
 435         return 0;
 436 }
 437
 438
 439 /*----------------------------------------------------------------*/
 440
 441 /* open timer -
 442  * q->use mutex should be down before calling this function to avoid
 443  * confliction with snd_seq_queue_use()
 444  */
 445 int snd_seq_queue_timer_open(int queueid)
 446 {
 447         int result = 0;
 448         struct snd_seq_queue *queue;
 449         struct snd_seq_timer *tmr;
 450
 451         queue = queueptr(queueid);
 452         if (queue == NULL)
 453                 return -EINVAL;
 454         tmr = queue->timer;
 455         if ((result = snd_seq_timer_open(queue)) < 0) {
 456                 snd_seq_timer_defaults(tmr);
 457                 result = snd_seq_timer_open(queue);
 458         }
 459         queuefree(queue);
 460         return result;
 461 }
 462
 463 /* close timer -
 464  * q->use mutex should be down before calling this function
 465  */
 466 int snd_seq_queue_timer_close(int queueid)
 467 {
 468         struct snd_seq_queue *queue;
 469         struct snd_seq_timer *tmr;
 470         int result = 0;
 471
 472         queue = queueptr(queueid);
 473         if (queue == NULL)
 474                 return -EINVAL;
 475         tmr = queue->timer;
 476         snd_seq_timer_close(queue);
 477         queuefree(queue);
 478         return result;
 479 }
 480
 481 /* change queue tempo and ppq */
 482 int snd_seq_queue_timer_set_tempo(int queueid, int client,
 483                                   struct snd_seq_queue_tempo *info)
 484 {
 485         struct snd_seq_queue *q = queueptr(queueid);
 486         int result;
 487
 488         if (q == NULL)
 489                 return -EINVAL;
 490         if (! queue_access_lock(q, client)) {
 491                 queuefree(q);
 492                 return -EPERM;
 493         }
 494
 495         result = snd_seq_timer_set_tempo(q->timer, info->tempo);
 496         if (result >= 0)
 497                 result = snd_seq_timer_set_ppq(q->timer, info->ppq);
 498         if (result >= 0 && info->skew_base > 0)
 499                 result = snd_seq_timer_set_skew(q->timer, info->skew_value,
 500                                                 info->skew_base);
 501         queue_access_unlock(q);
 502         queuefree(q);
 503         return result;
 504 }
 505
 506
 507 /* use or unuse this queue -
 508  * if it is the first client, starts the timer.
 509  * if it is not longer used by any clients, stop the timer.
 510  */
 511 int snd_seq_queue_use(int queueid, int client, int use)
 512 {
 513         struct snd_seq_queue *queue;
 514
 515         queue = queueptr(queueid);
 516         if (queue == NULL)
 517                 return -EINVAL;
 518         mutex_lock(&queue->timer_mutex);
 519         if (use) {
 520                 if (!test_and_set_bit(client, queue->clients_bitmap))
 521                         queue->clients++;
 522         } else {
 523                 if (test_and_clear_bit(client, queue->clients_bitmap))
 524                         queue->clients--;
 525         }
 526         if (queue->clients) {
 527                 if (use && queue->clients == 1)
 528                         snd_seq_timer_defaults(queue->timer);
 529                 snd_seq_timer_open(queue);
 530         } else {
 531                 snd_seq_timer_close(queue);
 532         }
 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         snd_assert(ev != NULL, 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 */
 760 void 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