85 	struct snd_seq_event_cell *cell;  in snd_seq_fifo_clear()  local
93 	while ((cell = fifo_cell_out(f)) != NULL) {  in snd_seq_fifo_clear()
94 		snd_seq_cell_free(cell);  in snd_seq_fifo_clear()
103 	struct snd_seq_event_cell *cell;  in snd_seq_fifo_event_in()  local
110 	err = snd_seq_event_dup(f->pool, event, &cell, 1, NULL, NULL); /* always non-blocking */  in snd_seq_fifo_event_in()
121 			f->tail->next = cell;  in snd_seq_fifo_event_in()
122 		f->tail = cell;  in snd_seq_fifo_event_in()
124 			f->head = cell;  in snd_seq_fifo_event_in()
125 		cell->next = NULL;  in snd_seq_fifo_event_in()
139 /* dequeue cell from fifo */
142 	struct snd_seq_event_cell *cell;  in fifo_cell_out()  local
144 	cell = f->head;  in fifo_cell_out()
145 	if (cell) {  in fifo_cell_out()
146 		f->head = cell->next;  in fifo_cell_out()
149 		if (f->tail == cell)  in fifo_cell_out()
152 		cell->next = NULL;  in fifo_cell_out()
156 	return cell;  in fifo_cell_out()
159 /* dequeue cell from fifo and copy on user space */
163 	struct snd_seq_event_cell *cell;  in snd_seq_fifo_cell_out()  local
173 	while ((cell = fifo_cell_out(f)) == NULL) {  in snd_seq_fifo_cell_out()
191 	*cellp = cell;  in snd_seq_fifo_cell_out()
198 			       struct snd_seq_event_cell *cell)  in snd_seq_fifo_cell_putback()  argument
200 	if (cell) {  in snd_seq_fifo_cell_putback()
202 		cell->next = f->head;  in snd_seq_fifo_cell_putback()
203 		f->head = cell;  in snd_seq_fifo_cell_putback()
205 			f->tail = cell;  in snd_seq_fifo_cell_putback()
223 	struct snd_seq_event_cell *cell, *next, *oldhead;  in snd_seq_fifo_resize()  local
254 	for (cell = oldhead; cell; cell = next) {  in snd_seq_fifo_resize()
255 		next = cell->next;  in snd_seq_fifo_resize()
256 		snd_seq_cell_free(cell);  in snd_seq_fifo_resize()