3 * Copyright (c) 1998 by Frank van de Pol <fvdpol@coil.demon.nl>
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
22 #include <sound/core.h>
23 #include <linux/slab.h>
31 struct snd_seq_fifo *snd_seq_fifo_new(int poolsize)
33 struct snd_seq_fifo *f;
35 f = kzalloc(sizeof(*f), GFP_KERNEL);
39 f->pool = snd_seq_pool_new(poolsize);
40 if (f->pool == NULL) {
44 if (snd_seq_pool_init(f->pool) < 0) {
45 snd_seq_pool_delete(&f->pool);
50 spin_lock_init(&f->lock);
51 snd_use_lock_init(&f->use_lock);
52 init_waitqueue_head(&f->input_sleep);
53 atomic_set(&f->overflow, 0);
62 void snd_seq_fifo_delete(struct snd_seq_fifo **fifo)
64 struct snd_seq_fifo *f;
66 if (snd_BUG_ON(!fifo))
73 snd_seq_fifo_clear(f);
75 /* wake up clients if any */
76 if (waitqueue_active(&f->input_sleep))
77 wake_up(&f->input_sleep);
79 /* release resources...*/
80 /*....................*/
83 snd_seq_pool_done(f->pool);
84 snd_seq_pool_delete(&f->pool);
90 static struct snd_seq_event_cell *fifo_cell_out(struct snd_seq_fifo *f);
93 void snd_seq_fifo_clear(struct snd_seq_fifo *f)
95 struct snd_seq_event_cell *cell;
98 /* clear overflow flag */
99 atomic_set(&f->overflow, 0);
101 snd_use_lock_sync(&f->use_lock);
102 spin_lock_irqsave(&f->lock, flags);
104 while ((cell = fifo_cell_out(f)) != NULL) {
105 snd_seq_cell_free(cell);
107 spin_unlock_irqrestore(&f->lock, flags);
111 /* enqueue event to fifo */
112 int snd_seq_fifo_event_in(struct snd_seq_fifo *f,
113 struct snd_seq_event *event)
115 struct snd_seq_event_cell *cell;
122 snd_use_lock_use(&f->use_lock);
123 err = snd_seq_event_dup(f->pool, event, &cell, 1, NULL); /* always non-blocking */
125 if ((err == -ENOMEM) || (err == -EAGAIN))
126 atomic_inc(&f->overflow);
127 snd_use_lock_free(&f->use_lock);
131 /* append new cells to fifo */
132 spin_lock_irqsave(&f->lock, flags);
134 f->tail->next = cell;
139 spin_unlock_irqrestore(&f->lock, flags);
142 if (waitqueue_active(&f->input_sleep))
143 wake_up(&f->input_sleep);
145 snd_use_lock_free(&f->use_lock);
147 return 0; /* success */
151 /* dequeue cell from fifo */
152 static struct snd_seq_event_cell *fifo_cell_out(struct snd_seq_fifo *f)
154 struct snd_seq_event_cell *cell;
156 if ((cell = f->head) != NULL) {
157 f->head = cell->next;
159 /* reset tail if this was the last element */
170 /* dequeue cell from fifo and copy on user space */
171 int snd_seq_fifo_cell_out(struct snd_seq_fifo *f,
172 struct snd_seq_event_cell **cellp, int nonblock)
174 struct snd_seq_event_cell *cell;
182 init_waitqueue_entry(&wait, current);
183 spin_lock_irqsave(&f->lock, flags);
184 while ((cell = fifo_cell_out(f)) == NULL) {
186 /* non-blocking - return immediately */
187 spin_unlock_irqrestore(&f->lock, flags);
190 set_current_state(TASK_INTERRUPTIBLE);
191 add_wait_queue(&f->input_sleep, &wait);
192 spin_unlock_irq(&f->lock);
194 spin_lock_irq(&f->lock);
195 remove_wait_queue(&f->input_sleep, &wait);
196 if (signal_pending(current)) {
197 spin_unlock_irqrestore(&f->lock, flags);
201 spin_unlock_irqrestore(&f->lock, flags);
208 void snd_seq_fifo_cell_putback(struct snd_seq_fifo *f,
209 struct snd_seq_event_cell *cell)
214 spin_lock_irqsave(&f->lock, flags);
215 cell->next = f->head;
218 spin_unlock_irqrestore(&f->lock, flags);
223 /* polling; return non-zero if queue is available */
224 int snd_seq_fifo_poll_wait(struct snd_seq_fifo *f, struct file *file,
227 poll_wait(file, &f->input_sleep, wait);
228 return (f->cells > 0);
231 /* change the size of pool; all old events are removed */
232 int snd_seq_fifo_resize(struct snd_seq_fifo *f, int poolsize)
235 struct snd_seq_pool *newpool, *oldpool;
236 struct snd_seq_event_cell *cell, *next, *oldhead;
238 if (snd_BUG_ON(!f || !f->pool))
241 /* allocate new pool */
242 newpool = snd_seq_pool_new(poolsize);
245 if (snd_seq_pool_init(newpool) < 0) {
246 snd_seq_pool_delete(&newpool);
250 spin_lock_irqsave(&f->lock, flags);
251 /* remember old pool */
259 /* NOTE: overflow flag is not cleared */
260 spin_unlock_irqrestore(&f->lock, flags);
262 /* release cells in old pool */
263 for (cell = oldhead; cell; cell = next) {
265 snd_seq_cell_free(cell);
267 snd_seq_pool_delete(&oldpool);