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
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
|
/*
This file is part of Deadbeef Player source code
http://deadbeef.sourceforge.net
message pump implementation
Copyright (C) 2009-2012 Alexey Yakovenko
This software is provided 'as-is', without any express or implied
warranty. In no event will the authors be held liable for any damages
arising from the use of this software.
Permission is granted to anyone to use this software for any purpose,
including commercial applications, and to alter it and redistribute it
freely, subject to the following restrictions:
1. The origin of this software must not be misrepresented; you must not
claim that you wrote the original software. If you use this software
in a product, an acknowledgment in the product documentation would be
appreciated but is not required.
2. Altered source versions must be plainly marked as such, and must not be
misrepresented as being the original software.
3. This notice may not be removed or altered from any source distribution.
Alexey Yakovenko waker@users.sourceforge.net
*/
#include <stdio.h>
#include <string.h>
#include <assert.h>
#include <stdlib.h>
#include "messagepump.h"
#include "threading.h"
#include "playlist.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 uintptr_t cond;
static void
messagepump_reset (void);
int
messagepump_init (void) {
messagepump_reset ();
mutex = mutex_create ();
cond = cond_create ();
return 0;
}
void
messagepump_free () {
mutex_lock (mutex);
messagepump_reset ();
mutex_unlock (mutex);
mutex_free (mutex);
cond_free (cond);
}
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) {
//fprintf (stderr, "WARNING: message queue is full! message ignored (%d %p %d %d)\n", id, (void*)ctx, p1, p2);
if (id >= DB_EV_FIRST && ctx) {
messagepump_event_free ((ddb_event_t *)ctx);
}
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);
cond_signal (cond);
return 0;
}
void
messagepump_wait (void) {
cond_wait (cond, mutex);
mutex_unlock (mutex);
}
int
messagepump_pop (uint32_t *id, uintptr_t *ctx, uint32_t *p1, uint32_t *p2) {
mutex_lock (mutex);
if (!mqueue) {
mutex_unlock (mutex);
return -1;
}
*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;
}
ddb_event_t *
messagepump_event_alloc (uint32_t id) {
int sz = 0;
ddb_event_t *ev;
switch (id) {
case DB_EV_SONGCHANGED:
sz = sizeof (ddb_event_trackchange_t);
break;
case DB_EV_SONGSTARTED:
case DB_EV_SONGFINISHED:
case DB_EV_TRACKINFOCHANGED:
sz = sizeof (ddb_event_track_t);
break;
case DB_EV_SEEKED:
sz = sizeof (ddb_event_playpos_t);
break;
}
assert (("Invalid event %d to use with messagepump_event_alloc, use sendmessage instead\n", id));
ev = malloc (sz);
memset (ev, 0, sz);
ev->event = id;
ev->size = sz;
return ev;
}
void
messagepump_event_free (ddb_event_t *ev) {
switch (ev->event) {
case DB_EV_SONGCHANGED:
{
ddb_event_trackchange_t *tc = (ddb_event_trackchange_t*)ev;
if (tc->from) {
pl_item_unref ((playItem_t *)tc->from);
}
if (tc->to) {
pl_item_unref ((playItem_t *)tc->to);
}
}
break;
case DB_EV_SONGSTARTED:
case DB_EV_SONGFINISHED:
case DB_EV_TRACKINFOCHANGED:
{
ddb_event_track_t *tc = (ddb_event_track_t*)ev;
if (tc->track) {
pl_item_unref ((playItem_t *)tc->track);
}
}
break;
case DB_EV_SEEKED:
{
ddb_event_playpos_t *tc = (ddb_event_playpos_t*)ev;
if (tc->track) {
pl_item_unref ((playItem_t *)tc->track);
}
}
break;
}
free (ev);
}
int
messagepump_push_event (ddb_event_t *ev, uint32_t p1, uint32_t p2) {
return messagepump_push (ev->event, (uintptr_t)ev, p1, p2);
}
|
