33 	struct snd_seq_fifo *f;  in snd_seq_fifo_new()  local
35 	f = kzalloc(sizeof(*f), GFP_KERNEL);  in snd_seq_fifo_new()
36 	if (!f)  in snd_seq_fifo_new()
39 	f->pool = snd_seq_pool_new(poolsize);  in snd_seq_fifo_new()
40 	if (f->pool == NULL) {  in snd_seq_fifo_new()
41 		kfree(f);  in snd_seq_fifo_new()
44 	if (snd_seq_pool_init(f->pool) < 0) {  in snd_seq_fifo_new()
45 		snd_seq_pool_delete(&f->pool);  in snd_seq_fifo_new()
46 		kfree(f);  in snd_seq_fifo_new()
50 	spin_lock_init(&f->lock);  in snd_seq_fifo_new()
51 	snd_use_lock_init(&f->use_lock);  in snd_seq_fifo_new()
52 	init_waitqueue_head(&f->input_sleep);  in snd_seq_fifo_new()
53 	atomic_set(&f->overflow, 0);  in snd_seq_fifo_new()
55 	f->head = NULL;  in snd_seq_fifo_new()
56 	f->tail = NULL;  in snd_seq_fifo_new()
57 	f->cells = 0;  in snd_seq_fifo_new()
59 	return f;  in snd_seq_fifo_new()
64 	struct snd_seq_fifo *f;  in snd_seq_fifo_delete()  local
68 	f = *fifo;  in snd_seq_fifo_delete()
69 	if (snd_BUG_ON(!f))  in snd_seq_fifo_delete()
73 	snd_seq_fifo_clear(f);  in snd_seq_fifo_delete()
76 	if (waitqueue_active(&f->input_sleep))  in snd_seq_fifo_delete()
77 		wake_up(&f->input_sleep);  in snd_seq_fifo_delete()
82 	if (f->pool) {  in snd_seq_fifo_delete()
83 		snd_seq_pool_done(f->pool);  in snd_seq_fifo_delete()
84 		snd_seq_pool_delete(&f->pool);  in snd_seq_fifo_delete()
87 	kfree(f);  in snd_seq_fifo_delete()
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)  in snd_seq_fifo_clear()  argument
99 	atomic_set(&f->overflow, 0);  in snd_seq_fifo_clear()
101 	snd_use_lock_sync(&f->use_lock);  in snd_seq_fifo_clear()
102 	spin_lock_irqsave(&f->lock, flags);  in snd_seq_fifo_clear()
104 	while ((cell = fifo_cell_out(f)) != NULL) {  in snd_seq_fifo_clear()
107 	spin_unlock_irqrestore(&f->lock, flags);  in snd_seq_fifo_clear()
112 int snd_seq_fifo_event_in(struct snd_seq_fifo *f,  in snd_seq_fifo_event_in()  argument
119 	if (snd_BUG_ON(!f))  in snd_seq_fifo_event_in()
122 	snd_use_lock_use(&f->use_lock);  in snd_seq_fifo_event_in()
123 	err = snd_seq_event_dup(f->pool, event, &cell, 1, NULL); /* always non-blocking */  in snd_seq_fifo_event_in()
126 			atomic_inc(&f->overflow);  in snd_seq_fifo_event_in()
127 		snd_use_lock_free(&f->use_lock);  in snd_seq_fifo_event_in()
132 	spin_lock_irqsave(&f->lock, flags);  in snd_seq_fifo_event_in()
133 	if (f->tail != NULL)  in snd_seq_fifo_event_in()
134 		f->tail->next = cell;  in snd_seq_fifo_event_in()
135 	f->tail = cell;  in snd_seq_fifo_event_in()
136 	if (f->head == NULL)  in snd_seq_fifo_event_in()
137 		f->head = cell;  in snd_seq_fifo_event_in()
138 	f->cells++;  in snd_seq_fifo_event_in()
139 	spin_unlock_irqrestore(&f->lock, flags);  in snd_seq_fifo_event_in()
142 	if (waitqueue_active(&f->input_sleep))  in snd_seq_fifo_event_in()
143 		wake_up(&f->input_sleep);  in snd_seq_fifo_event_in()
145 	snd_use_lock_free(&f->use_lock);  in snd_seq_fifo_event_in()
152 static struct snd_seq_event_cell *fifo_cell_out(struct snd_seq_fifo *f)  in fifo_cell_out()  argument
156 	if ((cell = f->head) != NULL) {  in fifo_cell_out()
157 		f->head = cell->next;  in fifo_cell_out()
160 		if (f->tail == cell)  in fifo_cell_out()
161 			f->tail = NULL;  in fifo_cell_out()
164 		f->cells--;  in fifo_cell_out()
171 int snd_seq_fifo_cell_out(struct snd_seq_fifo *f,  in snd_seq_fifo_cell_out()  argument
178 	if (snd_BUG_ON(!f))  in snd_seq_fifo_cell_out()
183 	spin_lock_irqsave(&f->lock, flags);  in snd_seq_fifo_cell_out()
184 	while ((cell = fifo_cell_out(f)) == NULL) {  in snd_seq_fifo_cell_out()
187 			spin_unlock_irqrestore(&f->lock, flags);  in snd_seq_fifo_cell_out()
191 		add_wait_queue(&f->input_sleep, &wait);  in snd_seq_fifo_cell_out()
192 		spin_unlock_irq(&f->lock);  in snd_seq_fifo_cell_out()
194 		spin_lock_irq(&f->lock);  in snd_seq_fifo_cell_out()
195 		remove_wait_queue(&f->input_sleep, &wait);  in snd_seq_fifo_cell_out()
197 			spin_unlock_irqrestore(&f->lock, flags);  in snd_seq_fifo_cell_out()
201 	spin_unlock_irqrestore(&f->lock, flags);  in snd_seq_fifo_cell_out()
208 void snd_seq_fifo_cell_putback(struct snd_seq_fifo *f,  in snd_seq_fifo_cell_putback()  argument
214 		spin_lock_irqsave(&f->lock, flags);  in snd_seq_fifo_cell_putback()
215 		cell->next = f->head;  in snd_seq_fifo_cell_putback()
216 		f->head = cell;  in snd_seq_fifo_cell_putback()
217 		f->cells++;  in snd_seq_fifo_cell_putback()
218 		spin_unlock_irqrestore(&f->lock, flags);  in snd_seq_fifo_cell_putback()
224 int snd_seq_fifo_poll_wait(struct snd_seq_fifo *f, struct file *file,  in snd_seq_fifo_poll_wait()  argument
227 	poll_wait(file, &f->input_sleep, wait);  in snd_seq_fifo_poll_wait()
228 	return (f->cells > 0);  in snd_seq_fifo_poll_wait()
232 int snd_seq_fifo_resize(struct snd_seq_fifo *f, int poolsize)  in snd_seq_fifo_resize()  argument
238 	if (snd_BUG_ON(!f || !f->pool))  in snd_seq_fifo_resize()
250 	spin_lock_irqsave(&f->lock, flags);  in snd_seq_fifo_resize()
252 	oldpool = f->pool;  in snd_seq_fifo_resize()
253 	oldhead = f->head;  in snd_seq_fifo_resize()
255 	f->pool = newpool;  in snd_seq_fifo_resize()
256 	f->head = NULL;  in snd_seq_fifo_resize()
257 	f->tail = NULL;  in snd_seq_fifo_resize()
258 	f->cells = 0;  in snd_seq_fifo_resize()
260 	spin_unlock_irqrestore(&f->lock, flags);  in snd_seq_fifo_resize()