Lines Matching defs:cell
61 * ext.data.ptr = the additiona cell head
62 * -> cell.next -> cell.next -> ..
82 struct snd_seq_event_cell *cell;
107 cell = (struct snd_seq_event_cell *)event->data.ext.ptr;
108 for (; len > 0 && cell; cell = cell->next) {
112 err = func(private_data, &cell->event, size);
174 * release this cell, free extended data if available
178 struct snd_seq_event_cell *cell)
180 cell->next = pool->free;
181 pool->free = cell;
185 void snd_seq_cell_free(struct snd_seq_event_cell * cell)
190 if (snd_BUG_ON(!cell))
192 pool = cell->pool;
197 free_cell(pool, cell);
198 if (snd_seq_ev_is_variable(&cell->event)) {
199 if (cell->event.data.ext.len & SNDRV_SEQ_EXT_CHAINED) {
201 curp = cell->event.data.ext.ptr;
219 * allocate an event cell.
225 struct snd_seq_event_cell *cell;
261 cell = pool->free;
262 if (cell) {
264 pool->free = cell->next;
270 /* clear cell pointers */
271 cell->next = NULL;
275 *cellp = cell;
284 * duplicate the event to a cell.
294 struct snd_seq_event_cell *cell;
307 err = snd_seq_cell_alloc(pool, &cell, nonblock, file);
312 cell->event = *event;
322 cell->event.data.ext.len = extlen | SNDRV_SEQ_EXT_CHAINED;
323 cell->event.data.ext.ptr = NULL;
336 if (cell->event.data.ext.ptr == NULL)
337 cell->event.data.ext.ptr = tmp;
358 *cellp = cell;
362 snd_seq_cell_free(cell);
379 int cell;
394 /* add new cells to the free cell list */
398 for (cell = 0; cell < pool->size; cell++) {
399 cellptr = pool->ptr + cell;