aboutsummaryrefslogtreecommitdiffstats
path: root/sound/core/seq/seq_fifo.h
diff options
context:
space:
mode:
authorTakashi Iwai <tiwai@suse.de>2005-11-17 08:04:02 -0500
committerJaroslav Kysela <perex@suse.cz>2006-01-03 06:17:52 -0500
commitc7e0b5bf9fff1b726495081447c107a2333fb82c (patch)
treef4d9ec9a6446f8e2afde4c94e10a39f2b86a0bc9 /sound/core/seq/seq_fifo.h
parent6ac77bc180fbd985988015020c2e2347e802959d (diff)
[ALSA] Remove xxx_t typedefs: Sequencer
Modules: ALSA sequencer Remove xxx_t typedefs from the core sequencer codes. Signed-off-by: Takashi Iwai <tiwai@suse.de>
Diffstat (limited to 'sound/core/seq/seq_fifo.h')
-rw-r--r--sound/core/seq/seq_fifo.h26
1 files changed, 13 insertions, 13 deletions
diff --git a/sound/core/seq/seq_fifo.h b/sound/core/seq/seq_fifo.h
index d677c261b0a4..062c446e7867 100644
--- a/sound/core/seq/seq_fifo.h
+++ b/sound/core/seq/seq_fifo.h
@@ -27,46 +27,46 @@
27 27
28/* === FIFO === */ 28/* === FIFO === */
29 29
30typedef struct { 30struct snd_seq_fifo {
31 pool_t *pool; /* FIFO pool */ 31 struct snd_seq_pool *pool; /* FIFO pool */
32 snd_seq_event_cell_t* head; /* pointer to head of fifo */ 32 struct snd_seq_event_cell *head; /* pointer to head of fifo */
33 snd_seq_event_cell_t* tail; /* pointer to tail of fifo */ 33 struct snd_seq_event_cell *tail; /* pointer to tail of fifo */
34 int cells; 34 int cells;
35 spinlock_t lock; 35 spinlock_t lock;
36 snd_use_lock_t use_lock; 36 snd_use_lock_t use_lock;
37 wait_queue_head_t input_sleep; 37 wait_queue_head_t input_sleep;
38 atomic_t overflow; 38 atomic_t overflow;
39 39
40} fifo_t; 40};
41 41
42/* create new fifo (constructor) */ 42/* create new fifo (constructor) */
43extern fifo_t *snd_seq_fifo_new(int poolsize); 43struct snd_seq_fifo *snd_seq_fifo_new(int poolsize);
44 44
45/* delete fifo (destructor) */ 45/* delete fifo (destructor) */
46extern void snd_seq_fifo_delete(fifo_t **f); 46void snd_seq_fifo_delete(struct snd_seq_fifo **f);
47 47
48 48
49/* enqueue event to fifo */ 49/* enqueue event to fifo */
50extern int snd_seq_fifo_event_in(fifo_t *f, snd_seq_event_t *event); 50int snd_seq_fifo_event_in(struct snd_seq_fifo *f, struct snd_seq_event *event);
51 51
52/* lock fifo from release */ 52/* lock fifo from release */
53#define snd_seq_fifo_lock(fifo) snd_use_lock_use(&(fifo)->use_lock) 53#define snd_seq_fifo_lock(fifo) snd_use_lock_use(&(fifo)->use_lock)
54#define snd_seq_fifo_unlock(fifo) snd_use_lock_free(&(fifo)->use_lock) 54#define snd_seq_fifo_unlock(fifo) snd_use_lock_free(&(fifo)->use_lock)
55 55
56/* get a cell from fifo - fifo should be locked */ 56/* get a cell from fifo - fifo should be locked */
57int snd_seq_fifo_cell_out(fifo_t *f, snd_seq_event_cell_t **cellp, int nonblock); 57int snd_seq_fifo_cell_out(struct snd_seq_fifo *f, struct snd_seq_event_cell **cellp, int nonblock);
58 58
59/* free dequeued cell - fifo should be locked */ 59/* free dequeued cell - fifo should be locked */
60extern void snd_seq_fifo_cell_putback(fifo_t *f, snd_seq_event_cell_t *cell); 60void snd_seq_fifo_cell_putback(struct snd_seq_fifo *f, struct snd_seq_event_cell *cell);
61 61
62/* clean up queue */ 62/* clean up queue */
63extern void snd_seq_fifo_clear(fifo_t *f); 63void snd_seq_fifo_clear(struct snd_seq_fifo *f);
64 64
65/* polling */ 65/* polling */
66extern int snd_seq_fifo_poll_wait(fifo_t *f, struct file *file, poll_table *wait); 66int snd_seq_fifo_poll_wait(struct snd_seq_fifo *f, struct file *file, poll_table *wait);
67 67
68/* resize pool in fifo */ 68/* resize pool in fifo */
69int snd_seq_fifo_resize(fifo_t *f, int poolsize); 69int snd_seq_fifo_resize(struct snd_seq_fifo *f, int poolsize);
70 70
71 71
72#endif 72#endif