blob: 1178b80b93e6ce573b151054537b071f75dbb4c7 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
|
/* pmutil.c -- some helpful utilities for building midi
applications that use PortMidi
*/
#include "stdlib.h"
#include "memory.h"
#include "portmidi.h"
#include "pmutil.h"
#include "pminternal.h"
PmQueue *Pm_QueueCreate(long num_msgs, long bytes_per_msg)
{
PmQueueRep *queue = (PmQueueRep *) pm_alloc(sizeof(PmQueueRep));
/* arg checking */
if (!queue)
return NULL;
queue->len = num_msgs * bytes_per_msg;
queue->buffer = pm_alloc(queue->len);
if (!queue->buffer) {
pm_free(queue);
return NULL;
}
queue->head = 0;
queue->tail = 0;
queue->msg_size = bytes_per_msg;
queue->overflow = FALSE;
return queue;
}
PmError Pm_QueueDestroy(PmQueue *q)
{
PmQueueRep *queue = (PmQueueRep *) q;
/* arg checking */
if (!queue || !queue->buffer)
return pmBadPtr;
pm_free(queue->buffer);
pm_free(queue);
return pmNoError;
}
PmError Pm_Dequeue(PmQueue *q, void *msg)
{
long head;
PmQueueRep *queue = (PmQueueRep *) q;
/* arg checking */
if(!queue)
return pmBadPtr;
if (queue->overflow) {
queue->overflow = FALSE;
return pmBufferOverflow;
}
head = queue->head; /* make sure this is written after access */
if (head == queue->tail) return 0;
memcpy(msg, queue->buffer + head, queue->msg_size);
head += queue->msg_size;
if (head == queue->len) head = 0;
queue->head = head;
return 1; /* success */
}
/* source should not enqueue data if overflow is set */
/**/
PmError Pm_Enqueue(PmQueue *q, void *msg)
{
PmQueueRep *queue = (PmQueueRep *) q;
long tail;
/* arg checking */
if (!queue)
return pmBadPtr;
tail = queue->tail;
memcpy(queue->buffer + tail, msg, queue->msg_size);
tail += queue->msg_size;
if (tail == queue->len) tail = 0;
if (tail == queue->head) {
queue->overflow = TRUE;
/* do not update tail, so message is lost */
return pmBufferOverflow;
}
queue->tail = tail;
return pmNoError;
}
int Pm_QueueEmpty(PmQueue *q)
{
PmQueueRep *queue = (PmQueueRep *) q;
if (!queue) return TRUE;
return (queue->head == queue->tail);
}
int Pm_QueueFull(PmQueue *q)
{
PmQueueRep *queue = (PmQueueRep *) q;
long tail;
/* arg checking */
if(!queue)
return pmBadPtr;
tail = queue->tail;
tail += queue->msg_size;
if (tail == queue->len) {
tail = 0;
}
return (tail == queue->head);
}
void *Pm_QueuePeek(PmQueue *q)
{
long head;
PmQueueRep *queue = (PmQueueRep *) q;
/* arg checking */
if(!queue)
return NULL;
head = queue->head; /* make sure this is written after access */
if (head == queue->tail) return NULL;
return queue->buffer + head;
}
|
