Lines Matching full:cell
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()
104 struct snd_seq_event_cell *cell; in snd_seq_fifo_event_in() local
112 err = snd_seq_event_dup(f->pool, event, &cell, 1, NULL, NULL); /* always non-blocking */ in snd_seq_fifo_event_in()
123 f->tail->next = cell; in snd_seq_fifo_event_in()
124 f->tail = cell; in snd_seq_fifo_event_in()
126 f->head = cell; in snd_seq_fifo_event_in()
127 cell->next = NULL; in snd_seq_fifo_event_in()
141 /* dequeue cell from fifo */
144 struct snd_seq_event_cell *cell; in fifo_cell_out() local
146 if ((cell = f->head) != NULL) { in fifo_cell_out()
147 f->head = cell->next; in fifo_cell_out()
150 if (f->tail == cell) in fifo_cell_out()
153 cell->next = NULL; in fifo_cell_out()
157 return cell; in fifo_cell_out()
160 /* dequeue cell from fifo and copy on user space */
164 struct snd_seq_event_cell *cell; in snd_seq_fifo_cell_out() local
174 while ((cell = fifo_cell_out(f)) == NULL) { in snd_seq_fifo_cell_out()
192 *cellp = cell; in snd_seq_fifo_cell_out()
199 struct snd_seq_event_cell *cell) in snd_seq_fifo_cell_putback() argument
203 if (cell) { in snd_seq_fifo_cell_putback()
205 cell->next = f->head; in snd_seq_fifo_cell_putback()
206 f->head = cell; in snd_seq_fifo_cell_putback()
208 f->tail = cell; in snd_seq_fifo_cell_putback()
227 struct snd_seq_event_cell *cell, *next, *oldhead; in snd_seq_fifo_resize() local
258 for (cell = oldhead; cell; cell = next) { in snd_seq_fifo_resize()
259 next = cell->next; in snd_seq_fifo_resize()
260 snd_seq_cell_free(cell); in snd_seq_fifo_resize()