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
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
|
/*
Copyright (c) 2013 Martin Sustrik All rights reserved.
Copyright (c) 2013 GoPivotal, Inc. All rights reserved.
Copyright 2018 Staysail Systems, Inc. <info@staysail.tech>
Copyright 2018 Capitar IT Group BV <info@capitar.com>
Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"),
to deal in the Software without restriction, including without limitation
the rights to use, copy, modify, merge, publish, distribute, sublicense,
and/or sell copies of the Software, and to permit persons to whom
the Software is furnished to do so, subject to the following conditions:
The above copyright notice and this permission notice shall be included
in all copies or substantial portions of the Software.
THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
IN THE SOFTWARE.
*/
#include "ctx.h"
#include "usock.h"
#include "../utils/err.h"
#include "../utils/cont.h"
#include "../utils/fast.h"
#define NN_WORKER_MAX_EVENTS 32
#define NN_WORKER_OP_STATE_IDLE 1
#define NN_WORKER_OP_STATE_ACTIVE 2
/* The value of this variable is irrelevant. It's used only as a placeholder
for the address that is used as the 'stop' event ID. */
const int nn_worker_stop = 0;
/* Private functions. */
static void nn_worker_routine (void *arg);
void nn_worker_task_init (struct nn_worker_task *self, int src,
struct nn_fsm *owner)
{
self->src = src;
self->owner = owner;
}
void nn_worker_task_term (struct nn_worker_task *self)
{
}
void nn_worker_op_init (struct nn_worker_op *self, int src,
struct nn_fsm *owner)
{
self->src = src;
self->owner = owner;
self->state = NN_WORKER_OP_STATE_IDLE;
self->start = NULL;
self->buf = NULL;
self->resid = 0;
self->zero_is_error = 0;
}
void nn_worker_op_term (struct nn_worker_op *self)
{
nn_assert_state (self, NN_WORKER_OP_STATE_IDLE);
}
void nn_worker_op_start (struct nn_worker_op *self)
{
self->state = NN_WORKER_OP_STATE_ACTIVE;
}
int nn_worker_op_isidle (struct nn_worker_op *self)
{
return self->state == NN_WORKER_OP_STATE_IDLE ? 1 : 0;
}
int nn_worker_init (struct nn_worker *self)
{
self->cp = CreateIoCompletionPort (INVALID_HANDLE_VALUE, NULL, 0, 0);
win_assert (self->cp);
nn_timerset_init (&self->timerset);
nn_thread_init (&self->thread, nn_worker_routine, self);
return 0;
}
void nn_worker_term (struct nn_worker *self)
{
BOOL brc;
/* Ask worker thread to terminate. */
brc = PostQueuedCompletionStatus (self->cp, 0,
(ULONG_PTR) &nn_worker_stop, NULL);
win_assert (brc);
/* Wait till worker thread terminates. */
nn_thread_term (&self->thread);
nn_timerset_term (&self->timerset);
brc = CloseHandle (self->cp);
win_assert (brc);
}
void nn_worker_execute (struct nn_worker *self, struct nn_worker_task *task)
{
BOOL brc;
brc = PostQueuedCompletionStatus (self->cp, 0, (ULONG_PTR) task, NULL);
win_assert (brc);
}
void nn_worker_add_timer (struct nn_worker *self, int timeout,
struct nn_worker_timer *timer)
{
nn_timerset_add (&((struct nn_worker*) self)->timerset, timeout,
&timer->hndl);
}
void nn_worker_rm_timer (struct nn_worker *self, struct nn_worker_timer *timer)
{
nn_timerset_rm (&((struct nn_worker*) self)->timerset, &timer->hndl);
}
HANDLE nn_worker_getcp (struct nn_worker *self)
{
return self->cp;
}
static void nn_worker_routine (void *arg)
{
int rc;
BOOL brc;
struct nn_worker *self;
int timeout;
ULONG count;
ULONG i;
struct nn_timerset_hndl *thndl;
struct nn_worker_timer *timer;
struct nn_worker_task *task;
struct nn_worker_op *op;
OVERLAPPED_ENTRY entries [NN_WORKER_MAX_EVENTS];
self = (struct nn_worker*) arg;
while (1) {
/* Process all expired timers. */
while (1) {
rc = nn_timerset_event (&self->timerset, &thndl);
if (nn_fast (rc == -EAGAIN))
break;
errnum_assert (rc == 0, -rc);
timer = nn_cont (thndl, struct nn_worker_timer, hndl);
nn_ctx_enter (timer->owner->ctx);
nn_fsm_feed (timer->owner, -1, NN_WORKER_TIMER_TIMEOUT, timer);
nn_ctx_leave (timer->owner->ctx);
}
/* Compute the time interval till next timer expiration. */
timeout = nn_timerset_timeout (&self->timerset);
/* Wait for new events and/or timeouts. */
brc = GetQueuedCompletionStatusEx (self->cp, entries,
NN_WORKER_MAX_EVENTS, &count, timeout < 0 ? INFINITE : timeout,
FALSE);
if (nn_slow (!brc && GetLastError () == WAIT_TIMEOUT))
continue;
win_assert (brc);
for (i = 0; i != count; ++i) {
/* Process I/O completion events. */
if (nn_fast (entries [i].lpOverlapped != NULL)) {
DWORD nxfer;
op = nn_cont (entries [i].lpOverlapped,
struct nn_worker_op, olpd);
/* The 'Internal' field is actually an NTSTATUS. Report
success and error. Ignore warnings and informational
messages.*/
rc = entries [i].Internal & 0xc0000000;
switch (rc) {
case 0x00000000:
nxfer = entries[i].dwNumberOfBytesTransferred;
if ((nxfer == 0) && (op->zero_is_error != 0)) {
rc = NN_WORKER_OP_ERROR;
break;
}
if (op->start != NULL) {
if (nxfer > op->resid) {
rc = NN_WORKER_OP_ERROR;
break;
}
op->resid -= nxfer;
op->buf += nxfer;
/* If we still have more to transfer, keep going. */
if (op->resid != 0) {
op->start (op->arg);
continue;
}
}
rc = NN_WORKER_OP_DONE;
break;
case 0xc0000000:
nxfer = 0;
rc = NN_WORKER_OP_ERROR;
break;
default:
continue;
}
/* Raise the completion event. */
nn_ctx_enter (op->owner->ctx);
nn_assert (op->state != NN_WORKER_OP_STATE_IDLE);
op->state = NN_WORKER_OP_STATE_IDLE;
nn_fsm_feed (op->owner, op->src, rc, op);
nn_ctx_leave (op->owner->ctx);
continue;
}
/* Worker thread shutdown is requested. */
if (nn_slow (entries [i].lpCompletionKey ==
(ULONG_PTR) &nn_worker_stop))
return;
/* Process tasks. */
task = (struct nn_worker_task*) entries [i].lpCompletionKey;
nn_ctx_enter (task->owner->ctx);
nn_fsm_feed (task->owner, task->src,
NN_WORKER_TASK_EXECUTE, task);
nn_ctx_leave (task->owner->ctx);
}
}
}
|
