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
|
/***
This file is part of PulseAudio.
Copyright 2006 Pierre Ossman <ossman@cendio.se> for Cendio AB
PulseAudio is free software; you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published
by the Free Software Foundation; either version 2.1 of the License,
or (at your option) any later version.
PulseAudio 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 Lesser General Public License
along with PulseAudio; if not, see <http://www.gnu.org/licenses/>.
***/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
#include <windows.h>
#include <pulse/xmalloc.h>
#include <pulsecore/hashmap.h>
#include "mutex.h"
struct pa_mutex {
CRITICAL_SECTION mutex;
};
struct pa_cond {
pa_hashmap *wait_events;
};
pa_mutex* pa_mutex_new(bool recursive, bool inherit_priority) {
pa_mutex *m;
m = pa_xnew(pa_mutex, 1);
InitializeCriticalSection(&m->mutex);
return m;
}
void pa_mutex_free(pa_mutex *m) {
assert(m);
DeleteCriticalSection(&m->mutex);
pa_xfree(m);
}
void pa_mutex_lock(pa_mutex *m) {
assert(m);
EnterCriticalSection(&m->mutex);
}
void pa_mutex_unlock(pa_mutex *m) {
assert(m);
LeaveCriticalSection(&m->mutex);
}
pa_cond *pa_cond_new(void) {
pa_cond *c;
c = pa_xnew(pa_cond, 1);
c->wait_events = pa_hashmap_new(NULL, NULL);
assert(c->wait_events);
return c;
}
void pa_cond_free(pa_cond *c) {
assert(c);
pa_hashmap_free(c->wait_events);
pa_xfree(c);
}
void pa_cond_signal(pa_cond *c, int broadcast) {
assert(c);
if (pa_hashmap_size(c->wait_events) == 0)
return;
if (broadcast)
SetEvent(pa_hashmap_first(c->wait_events));
else {
void *iter;
const void *key;
HANDLE event;
iter = NULL;
while (1) {
pa_hashmap_iterate(c->wait_events, &iter, &key);
if (key == NULL)
break;
event = (HANDLE)pa_hashmap_get(c->wait_events, key);
SetEvent(event);
}
}
}
int pa_cond_wait(pa_cond *c, pa_mutex *m) {
HANDLE event;
assert(c);
assert(m);
event = CreateEvent(NULL, FALSE, FALSE, NULL);
assert(event);
pa_hashmap_put(c->wait_events, event, event);
pa_mutex_unlock(m);
WaitForSingleObject(event, INFINITE);
pa_mutex_lock(m);
pa_hashmap_remove(c->wait_events, event);
CloseHandle(event);
return 0;
}
/* This is a copy of the function in mutex-posix.c */
pa_mutex* pa_static_mutex_get(pa_static_mutex *s, bool recursive, bool inherit_priority) {
pa_mutex *m;
pa_assert(s);
/* First, check if already initialized and short cut */
if ((m = pa_atomic_ptr_load(&s->ptr)))
return m;
/* OK, not initialized, so let's allocate, and fill in */
m = pa_mutex_new(recursive, inherit_priority);
if ((pa_atomic_ptr_cmpxchg(&s->ptr, NULL, m)))
return m;
pa_mutex_free(m);
/* Him, filling in failed, so someone else must have filled in
* already */
pa_assert_se(m = pa_atomic_ptr_load(&s->ptr));
return m;
}
|
