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
|
/*
Unix SMB/CIFS implementation.
Implement a barrier
Copyright (C) Volker Lendecke 2012
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 "replace.h"
#include "tevent_barrier.h"
#include "lib/util/tevent_unix.h"
struct tevent_barrier_waiter {
struct tevent_immediate *im;
struct tevent_context *ev;
struct tevent_req *req;
};
struct tevent_barrier {
unsigned count;
struct tevent_barrier_waiter *waiters;
void (*trigger_cb)(void *private_data);
void *private_data;
};
static int tevent_barrier_destructor(struct tevent_barrier *b);
static void tevent_barrier_release(struct tevent_barrier *b);
static void tevent_barrier_release_one(struct tevent_context *ctx,
struct tevent_immediate *im,
void *private_data);
static void tevent_barrier_release_trigger(struct tevent_context *ctx,
struct tevent_immediate *im,
void *private_data);
struct tevent_barrier *tevent_barrier_init(
TALLOC_CTX *mem_ctx, unsigned count,
void (*trigger_cb)(void *private_data), void *private_data)
{
struct tevent_barrier *b;
unsigned i;
if (count == 0) {
return NULL;
}
b = talloc(mem_ctx, struct tevent_barrier);
if (b == NULL) {
return NULL;
}
b->count = 0;
b->trigger_cb = trigger_cb;
b->private_data = private_data;
b->waiters = talloc_array(b, struct tevent_barrier_waiter, count);
if (b->waiters == NULL) {
goto fail;
}
for (i=0; i<count; i++) {
struct tevent_barrier_waiter *w = &b->waiters[i];
w->im = tevent_create_immediate(b->waiters);
if (w->im == NULL) {
goto fail;
}
w->req = NULL;
}
talloc_set_destructor(b, tevent_barrier_destructor);
return b;
fail:
TALLOC_FREE(b);
return NULL;
}
static int tevent_barrier_destructor(struct tevent_barrier *b)
{
tevent_barrier_release(b);
return 0;
}
struct tevent_barrier_wait_state {
struct tevent_barrier *b;
int index;
};
static void tevent_barrier_release(struct tevent_barrier *b)
{
unsigned i;
for (i=0; i<b->count; i++) {
struct tevent_barrier_waiter *w = &b->waiters[i];
struct tevent_barrier_wait_state *state;
if (w->req == NULL) {
continue;
}
tevent_schedule_immediate(
w->im, w->ev, tevent_barrier_release_one, w->req);
state = tevent_req_data(
w->req, struct tevent_barrier_wait_state);
talloc_set_destructor(state, NULL);
w->req = NULL;
w->ev = NULL;
}
b->count = 0;
if (b->trigger_cb != NULL) {
b->trigger_cb(b->private_data);
}
}
static void tevent_barrier_release_one(struct tevent_context *ctx,
struct tevent_immediate *im,
void *private_data)
{
struct tevent_req *req = talloc_get_type_abort(
private_data, struct tevent_req);
tevent_req_done(req);
}
static int tevent_barrier_wait_state_destructor(
struct tevent_barrier_wait_state *s);
struct tevent_req *tevent_barrier_wait_send(TALLOC_CTX *mem_ctx,
struct tevent_context *ev,
struct tevent_barrier *b)
{
struct tevent_req *req;
struct tevent_barrier_wait_state *state;
struct tevent_barrier_waiter *w;
struct tevent_immediate *im;
req = tevent_req_create(mem_ctx, &state,
struct tevent_barrier_wait_state);
if (req == NULL) {
return NULL;
}
state->b = b;
state->index = b->count;
w = &b->waiters[b->count];
w->ev = ev;
w->req = req;
b->count += 1;
talloc_set_destructor(state, tevent_barrier_wait_state_destructor);
if (b->count < talloc_array_length(b->waiters)) {
return req;
}
im = tevent_create_immediate(req);
if (tevent_req_nomem(im, req)) {
return tevent_req_post(req, ev);
}
tevent_schedule_immediate(im, ev, tevent_barrier_release_trigger, b);
return req;
}
static int tevent_barrier_wait_state_destructor(
struct tevent_barrier_wait_state *s)
{
struct tevent_barrier *b = s->b;
b->waiters[s->index].req = b->waiters[b->count-1].req;
b->count -= 1;
return 0;
}
static void tevent_barrier_release_trigger(struct tevent_context *ctx,
struct tevent_immediate *im,
void *private_data)
{
struct tevent_barrier *b = talloc_get_type_abort(
private_data, struct tevent_barrier);
tevent_barrier_release(b);
}
int tevent_barrier_wait_recv(struct tevent_req *req)
{
return tevent_req_simple_recv_unix(req);
}
|
