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