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