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
|
/*
From https://github.com/thekvs/esnappy:
Copyright (c) 2011 Konstantin V. Sorokin
All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions
are met:
1. Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
2. Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
3. Neither the name of the copyright holder nor the names of contributors
may be used to endorse or promote products derived from this software
without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTOR(S) ``AS IS'' AND
ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTOR(S) BE LIABLE
FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
SUCH DAMAGE.
*/
// vim: shiftwidth=4 expandtab
#include "async_queue.h"
async_queue_t*
async_queue_create(char* mutex_name, char* condvar_name)
{
async_queue_t *aq;
aq = ALLOC(sizeof(*aq));
if (!aq) {
errx(1, "enif_alloc() failed");
}
aq->q = ALLOC(sizeof(*(aq->q)));
if (!(aq->q)) {
errx(1, "enif_alloc() failed");
}
TAILQ_INIT(aq->q);
aq->waiting_threads = aq->len = 0;
aq->mutex = enif_mutex_create(mutex_name);
if (!aq->mutex) {
errx(1, "enif_mutex_create() failed");
}
aq->cond = enif_cond_create(condvar_name);
if (!aq->cond) {
errx(1, "enif_cond_create() failed");
}
return aq;
}
int
async_queue_length(async_queue_t *aq)
{
int length;
MUTEX_LOCK(aq->mutex);
length = aq->len - aq->waiting_threads;
MUTEX_UNLOCK(aq->mutex);
return length;
}
void *
async_queue_pop(async_queue_t *aq)
{
struct async_queue_entry *en;
void *d;
MUTEX_LOCK(aq->mutex);
d = NULL;
aq->waiting_threads++;
while (TAILQ_EMPTY(aq->q)) {
enif_cond_wait(aq->cond, aq->mutex);
}
aq->waiting_threads--;
en = TAILQ_FIRST(aq->q);
TAILQ_REMOVE(aq->q, en, entries);
d = en->data;
aq->len--;
enif_free(en);
MUTEX_UNLOCK(aq->mutex);
return d;
}
void
async_queue_push(async_queue_t *aq, void *data)
{
struct async_queue_entry *en;
MUTEX_LOCK(aq->mutex);
en = ALLOC(sizeof(*en));
en->data = data;
TAILQ_INSERT_TAIL(aq->q, en, entries);
aq->len++;
COND_SIGNAL(aq->cond);
MUTEX_UNLOCK(aq->mutex);
}
void
async_queue_destroy(async_queue_t *aq)
{
struct async_queue_entry *en;
while (!TAILQ_EMPTY(aq->q)) {
en = TAILQ_FIRST(aq->q);
TAILQ_REMOVE(aq->q, en, entries);
enif_free(en);
}
COND_DESTROY(aq->cond);
MUTEX_DESTROY(aq->mutex);
enif_free(aq->q);
enif_free(aq);
}
|
