1/* SPDX-License-Identifier: GPL-2.0-or-later */
 2/*
 3 *   ALSA sequencer Priority Queue
 4 *   Copyright (c) 1998 by Frank van de Pol <fvdpol@coil.demon.nl>
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 5 */
 6#ifndef __SND_SEQ_PRIOQ_H
 7#define __SND_SEQ_PRIOQ_H
 8
 9#include "seq_memory.h"
10
11
12/* === PRIOQ === */
13
14struct snd_seq_prioq {
15	struct snd_seq_event_cell *head;      /* pointer to head of prioq */
16	struct snd_seq_event_cell *tail;      /* pointer to tail of prioq */
17	int cells;
18	spinlock_t lock;
19};
20
21
22/* create new prioq (constructor) */
23struct snd_seq_prioq *snd_seq_prioq_new(void);
24
25/* delete prioq (destructor) */
26void snd_seq_prioq_delete(struct snd_seq_prioq **fifo);
27
28/* enqueue cell to prioq */
29int snd_seq_prioq_cell_in(struct snd_seq_prioq *f, struct snd_seq_event_cell *cell);
30
31/* dequeue cell from prioq */ 
32struct snd_seq_event_cell *snd_seq_prioq_cell_out(struct snd_seq_prioq *f,
33						  void *current_time);
34
35/* return number of events available in prioq */
36int snd_seq_prioq_avail(struct snd_seq_prioq *f);
37
38/* client left queue */
39void snd_seq_prioq_leave(struct snd_seq_prioq *f, int client, int timestamp);        
40
41/* Remove events */
42void snd_seq_prioq_remove_events(struct snd_seq_prioq *f, int client,
43				 struct snd_seq_remove_events *info);
44
45#endif

 
 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
29struct 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) */
38struct snd_seq_prioq *snd_seq_prioq_new(void);
39
40/* delete prioq (destructor) */
41void snd_seq_prioq_delete(struct snd_seq_prioq **fifo);
42
43/* enqueue cell to prioq */
44int snd_seq_prioq_cell_in(struct snd_seq_prioq *f, struct snd_seq_event_cell *cell);
45
46/* dequeue cell from prioq */ 
47struct 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 */
51int snd_seq_prioq_avail(struct snd_seq_prioq *f);
52
53/* client left queue */
54void snd_seq_prioq_leave(struct snd_seq_prioq *f, int client, int timestamp);        
55
56/* Remove events */
57void snd_seq_prioq_remove_events(struct snd_seq_prioq *f, int client,
58				 struct snd_seq_remove_events *info);
59
60#endif