17 	struct snd_seq_pool *pool;				/* used pool */  member
21 /* design note: the pool is a contiguous block of memory, if we dynamicly
22    want to add additional cells to the pool be better store this in another
23    pool as we need to know the base address of the pool when releasing
30 	int total_elements;	/* pool size actually allocated */
33 	int size;		/* pool size to be allocated */
47 	/* Pool lock */
53 int snd_seq_event_dup(struct snd_seq_pool *pool, struct snd_seq_event *event,
58 static inline int snd_seq_unused_cells(struct snd_seq_pool *pool)  in snd_seq_unused_cells()  argument
60 	return pool ? pool->total_elements - atomic_read(&pool->counter) : 0;  in snd_seq_unused_cells()
64 static inline int snd_seq_total_cells(struct snd_seq_pool *pool)  in snd_seq_total_cells()  argument
66 	return pool ? pool->total_elements : 0;  in snd_seq_total_cells()
69 /* init pool - allocate events */
70 int snd_seq_pool_init(struct snd_seq_pool *pool);
72 /* done pool - free events */
73 void snd_seq_pool_mark_closing(struct snd_seq_pool *pool);
74 int snd_seq_pool_done(struct snd_seq_pool *pool);
76 /* create pool */
79 /* remove pool */
80 int snd_seq_pool_delete(struct snd_seq_pool **pool);
83 int snd_seq_pool_poll_wait(struct snd_seq_pool *pool, struct file *file, poll_table *wait);
86 		       struct snd_seq_pool *pool, char *space);