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