1 /* 2 * ALSA sequencer Priority Queue 3 * Copyright (c) 1998 by Frank van de Pol <fvdpol@coil.demon.nl> 4 * 5 * 6 * This program is free software; you can redistribute it and/or modify 7 * it under the terms of the GNU General Public License as published by 8 * the Free Software Foundation; either version 2 of the License, or 9 * (at your option) any later version. 10 * 11 * This program is distributed in the hope that it will be useful, 12 * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 * GNU General Public License for more details. 15 * 16 * You should have received a copy of the GNU General Public License 17 * along with this program; if not, write to the Free Software 18 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA 19 * 20 */ 21 #ifndef __SND_SEQ_PRIOQ_H 22 #define __SND_SEQ_PRIOQ_H 23 24 #include "seq_memory.h" 25 26 27 /* === PRIOQ === */ 28 29 struct snd_seq_prioq { 30 struct snd_seq_event_cell *head; /* pointer to head of prioq */ 31 struct snd_seq_event_cell *tail; /* pointer to tail of prioq */ 32 int cells; 33 spinlock_t lock; 34 }; 35 36 37 /* create new prioq (constructor) */ 38 struct snd_seq_prioq *snd_seq_prioq_new(void); 39 40 /* delete prioq (destructor) */ 41 void snd_seq_prioq_delete(struct snd_seq_prioq **fifo); 42 43 /* enqueue cell to prioq */ 44 int snd_seq_prioq_cell_in(struct snd_seq_prioq *f, struct snd_seq_event_cell *cell); 45 46 /* dequeue cell from prioq */ 47 struct snd_seq_event_cell *snd_seq_prioq_cell_out(struct snd_seq_prioq *f, 48 void *current_time); 49 50 /* return number of events available in prioq */ 51 int snd_seq_prioq_avail(struct snd_seq_prioq *f); 52 53 /* client left queue */ 54 void snd_seq_prioq_leave(struct snd_seq_prioq *f, int client, int timestamp); 55 56 /* Remove events */ 57 void snd_seq_prioq_remove_events(struct snd_seq_prioq *f, int client, 58 struct snd_seq_remove_events *info); 59 60 #endif 61