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 == NULL) {  in snd_seq_fifo_new()
41 	f->pool = snd_seq_pool_new(poolsize);  in snd_seq_fifo_new()
42 	if (f->pool == NULL) {  in snd_seq_fifo_new()
43 		kfree(f);  in snd_seq_fifo_new()
46 	if (snd_seq_pool_init(f->pool) < 0) {  in snd_seq_fifo_new()
47 		snd_seq_pool_delete(&f->pool);  in snd_seq_fifo_new()
48 		kfree(f);  in snd_seq_fifo_new()
52 	spin_lock_init(&f->lock);  in snd_seq_fifo_new()
53 	snd_use_lock_init(&f->use_lock);  in snd_seq_fifo_new()
54 	init_waitqueue_head(&f->input_sleep);  in snd_seq_fifo_new()
55 	atomic_set(&f->overflow, 0);  in snd_seq_fifo_new()
57 	f->head = NULL;  in snd_seq_fifo_new()
58 	f->tail = NULL;  in snd_seq_fifo_new()
59 	f->cells = 0;  in snd_seq_fifo_new()
61 	return f;  in snd_seq_fifo_new()
66 	struct snd_seq_fifo *f;  in snd_seq_fifo_delete()  local
70 	f = *fifo;  in snd_seq_fifo_delete()
71 	if (snd_BUG_ON(!f))  in snd_seq_fifo_delete()
75 	snd_seq_fifo_clear(f);  in snd_seq_fifo_delete()
78 	if (waitqueue_active(&f->input_sleep))  in snd_seq_fifo_delete()
79 		wake_up(&f->input_sleep);  in snd_seq_fifo_delete()
84 	if (f->pool) {  in snd_seq_fifo_delete()
85 		snd_seq_pool_done(f->pool);  in snd_seq_fifo_delete()
86 		snd_seq_pool_delete(&f->pool);  in snd_seq_fifo_delete()
89 	kfree(f);  in snd_seq_fifo_delete()
92 static struct snd_seq_event_cell *fifo_cell_out(struct snd_seq_fifo *f);
95 void snd_seq_fifo_clear(struct snd_seq_fifo *f)  in snd_seq_fifo_clear()  argument
101 	atomic_set(&f->overflow, 0);  in snd_seq_fifo_clear()
103 	snd_use_lock_sync(&f->use_lock);  in snd_seq_fifo_clear()
104 	spin_lock_irqsave(&f->lock, flags);  in snd_seq_fifo_clear()
106 	while ((cell = fifo_cell_out(f)) != NULL) {  in snd_seq_fifo_clear()
109 	spin_unlock_irqrestore(&f->lock, flags);  in snd_seq_fifo_clear()
114 int snd_seq_fifo_event_in(struct snd_seq_fifo *f,  in snd_seq_fifo_event_in()  argument
121 	if (snd_BUG_ON(!f))  in snd_seq_fifo_event_in()
124 	snd_use_lock_use(&f->use_lock);  in snd_seq_fifo_event_in()
125 	err = snd_seq_event_dup(f->pool, event, &cell, 1, NULL); /* always non-blocking */  in snd_seq_fifo_event_in()
128 			atomic_inc(&f->overflow);  in snd_seq_fifo_event_in()
129 		snd_use_lock_free(&f->use_lock);  in snd_seq_fifo_event_in()
134 	spin_lock_irqsave(&f->lock, flags);  in snd_seq_fifo_event_in()
135 	if (f->tail != NULL)  in snd_seq_fifo_event_in()
136 		f->tail->next = cell;  in snd_seq_fifo_event_in()
137 	f->tail = cell;  in snd_seq_fifo_event_in()
138 	if (f->head == NULL)  in snd_seq_fifo_event_in()
139 		f->head = cell;  in snd_seq_fifo_event_in()
140 	f->cells++;  in snd_seq_fifo_event_in()
141 	spin_unlock_irqrestore(&f->lock, flags);  in snd_seq_fifo_event_in()
144 	if (waitqueue_active(&f->input_sleep))  in snd_seq_fifo_event_in()
145 		wake_up(&f->input_sleep);  in snd_seq_fifo_event_in()
147 	snd_use_lock_free(&f->use_lock);  in snd_seq_fifo_event_in()
154 static struct snd_seq_event_cell *fifo_cell_out(struct snd_seq_fifo *f)  in fifo_cell_out()  argument
158 	if ((cell = f->head) != NULL) {  in fifo_cell_out()
159 		f->head = cell->next;  in fifo_cell_out()
162 		if (f->tail == cell)  in fifo_cell_out()
163 			f->tail = NULL;  in fifo_cell_out()
166 		f->cells--;  in fifo_cell_out()
173 int snd_seq_fifo_cell_out(struct snd_seq_fifo *f,  in snd_seq_fifo_cell_out()  argument
180 	if (snd_BUG_ON(!f))  in snd_seq_fifo_cell_out()
185 	spin_lock_irqsave(&f->lock, flags);  in snd_seq_fifo_cell_out()
186 	while ((cell = fifo_cell_out(f)) == NULL) {  in snd_seq_fifo_cell_out()
189 			spin_unlock_irqrestore(&f->lock, flags);  in snd_seq_fifo_cell_out()
193 		add_wait_queue(&f->input_sleep, &wait);  in snd_seq_fifo_cell_out()
194 		spin_unlock_irq(&f->lock);  in snd_seq_fifo_cell_out()
196 		spin_lock_irq(&f->lock);  in snd_seq_fifo_cell_out()
197 		remove_wait_queue(&f->input_sleep, &wait);  in snd_seq_fifo_cell_out()
199 			spin_unlock_irqrestore(&f->lock, flags);  in snd_seq_fifo_cell_out()
203 	spin_unlock_irqrestore(&f->lock, flags);  in snd_seq_fifo_cell_out()
210 void snd_seq_fifo_cell_putback(struct snd_seq_fifo *f,  in snd_seq_fifo_cell_putback()  argument
216 		spin_lock_irqsave(&f->lock, flags);  in snd_seq_fifo_cell_putback()
217 		cell->next = f->head;  in snd_seq_fifo_cell_putback()
218 		f->head = cell;  in snd_seq_fifo_cell_putback()
219 		f->cells++;  in snd_seq_fifo_cell_putback()
220 		spin_unlock_irqrestore(&f->lock, flags);  in snd_seq_fifo_cell_putback()
226 int snd_seq_fifo_poll_wait(struct snd_seq_fifo *f, struct file *file,  in snd_seq_fifo_poll_wait()  argument
229 	poll_wait(file, &f->input_sleep, wait);  in snd_seq_fifo_poll_wait()
230 	return (f->cells > 0);  in snd_seq_fifo_poll_wait()
234 int snd_seq_fifo_resize(struct snd_seq_fifo *f, int poolsize)  in snd_seq_fifo_resize()  argument
240 	if (snd_BUG_ON(!f || !f->pool))  in snd_seq_fifo_resize()
252 	spin_lock_irqsave(&f->lock, flags);  in snd_seq_fifo_resize()
254 	oldpool = f->pool;  in snd_seq_fifo_resize()
255 	oldhead = f->head;  in snd_seq_fifo_resize()
257 	f->pool = newpool;  in snd_seq_fifo_resize()
258 	f->head = NULL;  in snd_seq_fifo_resize()
259 	f->tail = NULL;  in snd_seq_fifo_resize()
260 	f->cells = 0;  in snd_seq_fifo_resize()
262 	spin_unlock_irqrestore(&f->lock, flags);  in snd_seq_fifo_resize()