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
|
/*
DeaDBeeF - ultimate music player for GNU/Linux systems with X11
Copyright (C) 2009 Alexey Yakovenko
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include <stdio.h>
#include <string.h>
#include "messagepump.h"
#include "threading.h"
typedef struct message_s {
uint32_t id;
uintptr_t ctx;
uint32_t p1;
uint32_t p2;
struct message_s *next;
} message_t;
enum { MAX_MESSAGES = 100 };
static message_t pool[MAX_MESSAGES];
static message_t *mfree;
static message_t *mqueue;
static message_t *mqtail;
static uintptr_t mutex;
static void
messagepump_reset (void);
int
messagepump_init (void) {
messagepump_reset ();
mutex = mutex_create ();
}
void
messagepump_free () {
mutex_lock (mutex);
messagepump_reset ();
mutex_unlock (mutex);
mutex_free (mutex);
}
static void
messagepump_reset (void) {
mqueue = NULL;
mfree = NULL;
mqtail = NULL;
memset (pool, 0, sizeof (pool));
for (int i = 0; i < MAX_MESSAGES; i++) {
pool[i].next = mfree;
mfree = &pool[i];
}
}
int
messagepump_push (uint32_t id, uintptr_t ctx, uint32_t p1, uint32_t p2) {
if (!mfree) {
printf ("WARNING: message queue is full! message ignored (%d %p %d %d)\n", id, ctx, p1, p2);
return -1;
}
mutex_lock (mutex);
message_t *msg = mfree;
mfree = mfree->next;
if (mqtail) {
mqtail->next = msg;
}
mqtail = msg;
if (!mqueue) {
mqueue = msg;
}
msg->next = NULL;
msg->id = id;
msg->ctx = ctx;
msg->p1 = p1;
msg->p2 = p2;
mutex_unlock (mutex);
return 0;
}
int
messagepump_pop (uint32_t *id, uintptr_t *ctx, uint32_t *p1, uint32_t *p2) {
if (!mqueue) {
return -1;
}
mutex_lock (mutex);
*id = mqueue->id;
*ctx = mqueue->ctx;
*p1 = mqueue->p1;
*p2 = mqueue->p2;
message_t *next = mqueue->next;
mqueue->next = mfree;
mfree = mqueue;
mqueue = next;
if (!mqueue) {
mqtail = NULL;
}
mutex_unlock (mutex);
return 0;
}
int
messagepump_hasmessages (void) {
return mqueue ? 1 : 0;
}
|
