aboutsummaryrefslogtreecommitdiffstats
path: root/sound/core/seq/seq_prioq.h
diff options
context:
space:
mode:
authorLinus Torvalds <torvalds@ppc970.osdl.org>2005-04-16 18:20:36 -0400
committerLinus Torvalds <torvalds@ppc970.osdl.org>2005-04-16 18:20:36 -0400
commit1da177e4c3f41524e886b7f1b8a0c1fc7321cac2 (patch)
tree0bba044c4ce775e45a88a51686b5d9f90697ea9d /sound/core/seq/seq_prioq.h
Linux-2.6.12-rc2
Initial git repository build. I'm not bothering with the full history, even though we have it. We can create a separate "historical" git archive of that later if we want to, and in the meantime it's about 3.2GB when imported into git - space that would just make the early git days unnecessarily complicated, when we don't have a lot of good infrastructure for it. Let it rip!
Diffstat (limited to 'sound/core/seq/seq_prioq.h')
-rw-r--r--sound/core/seq/seq_prioq.h62
1 files changed, 62 insertions, 0 deletions
diff --git a/sound/core/seq/seq_prioq.h b/sound/core/seq/seq_prioq.h
new file mode 100644
index 00000000000..f12af79308b
--- /dev/null
+++ b/sound/core/seq/seq_prioq.h
@@ -0,0 +1,62 @@
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
29typedef struct {
30 snd_seq_event_cell_t* head; /* pointer to head of prioq */
31 snd_seq_event_cell_t* tail; /* pointer to tail of prioq */
32 int cells;
33 spinlock_t lock;
34} prioq_t;
35
36
37/* create new prioq (constructor) */
38extern prioq_t *snd_seq_prioq_new(void);
39
40/* delete prioq (destructor) */
41extern void snd_seq_prioq_delete(prioq_t **fifo);
42
43/* enqueue cell to prioq */
44extern int snd_seq_prioq_cell_in(prioq_t *f, snd_seq_event_cell_t *cell);
45
46/* dequeue cell from prioq */
47extern snd_seq_event_cell_t *snd_seq_prioq_cell_out(prioq_t *f);
48
49/* return number of events available in prioq */
50extern int snd_seq_prioq_avail(prioq_t *f);
51
52/* peek at cell at the head of the prioq */
53extern snd_seq_event_cell_t *snd_seq_prioq_cell_peek(prioq_t *f);
54
55/* client left queue */
56extern void snd_seq_prioq_leave(prioq_t *f, int client, int timestamp);
57
58/* Remove events */
59void snd_seq_prioq_remove_events(prioq_t * f, int client,
60 snd_seq_remove_events_t *info);
61
62#endif