1 /* SPDX-License-Identifier: GPL-2.0-or-later */
4 * Copyright (c) 1998 by Frank van de Pol <fvdpol@coil.demon.nl>
6 #ifndef __SND_SEQ_FIFO_H
7 #define __SND_SEQ_FIFO_H
9 #include "seq_memory.h"
16 struct snd_seq_pool *pool; /* FIFO pool */
17 struct snd_seq_event_cell *head; /* pointer to head of fifo */
18 struct snd_seq_event_cell *tail; /* pointer to tail of fifo */
21 snd_use_lock_t use_lock;
22 wait_queue_head_t input_sleep;
27 /* create new fifo (constructor) */
28 struct snd_seq_fifo *snd_seq_fifo_new(int poolsize);
30 /* delete fifo (destructor) */
31 void snd_seq_fifo_delete(struct snd_seq_fifo **f);
34 /* enqueue event to fifo */
35 int snd_seq_fifo_event_in(struct snd_seq_fifo *f, struct snd_seq_event *event);
37 /* lock fifo from release */
38 #define snd_seq_fifo_lock(fifo) snd_use_lock_use(&(fifo)->use_lock)
39 #define snd_seq_fifo_unlock(fifo) snd_use_lock_free(&(fifo)->use_lock)
41 /* get a cell from fifo - fifo should be locked */
42 int snd_seq_fifo_cell_out(struct snd_seq_fifo *f, struct snd_seq_event_cell **cellp, int nonblock);
44 /* free dequeued cell - fifo should be locked */
45 void snd_seq_fifo_cell_putback(struct snd_seq_fifo *f, struct snd_seq_event_cell *cell);
48 void snd_seq_fifo_clear(struct snd_seq_fifo *f);
51 int snd_seq_fifo_poll_wait(struct snd_seq_fifo *f, struct file *file, poll_table *wait);
53 /* resize pool in fifo */
54 int snd_seq_fifo_resize(struct snd_seq_fifo *f, int poolsize);
56 /* get the number of unused cells safely */
57 int snd_seq_fifo_unused_cells(struct snd_seq_fifo *f);