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
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
|
/* AsyncIO.h
*
* Integrating Win32 asynchronous IOCP with the GHC RTS.
*
* (c) Tamar Christina, 2018 - 2019
*
* NOTE: This is the WinIO manager, only used for --io-manager=native.
* For the MIO manager see AsyncIO.h.
*/
#include "Rts.h"
#include <rts/IOInterface.h>
#include "ThrIOManager.h"
#include "AsyncWinIO.h"
#include "Prelude.h"
#include "Capability.h"
#include "Schedule.h"
#include "Rts.h"
#include "ThreadLabels.h"
#include <stdbool.h>
#include <windows.h>
#include <stdint.h>
#include <stdio.h>
/* Note [Non-Threaded WINIO design]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Compared to Async MIO, Async WINIO does all of the heavy processing at the
Haskell side of things. The same code as the threaded WINIO is re-used for
the Non-threaded version. Of course since we are in a non-threaded rts we
can't block on foreign calls without hanging the application.
This file thus serves as a back-end service that continuously reads pending
events from the given I/O completion port and notifies the Haskell I/O manager
of work that has been completed. This does incur a slight cost in that the
rts has to actually schedule the Haskell thread to do the work, however this
shouldn't be a problem for performance.
It is however a problem for the workload buffer we use as we are not allowed
to service new requests until the old ones have actually been read and
processes by the Haskell I/O side.
To account for this the I/O manager works in two stages.
1) Like the threaded version, any long wait we do, we prefer to do it in an
alterable state so that we can respond immediately to new requests. Note
that once we know which completion port handle we are bound to we no longer
need the Haskell side to tell us of new work. We can simply handle any new
work pre-emptively.
2) We block in a non-alertable state whenever
a) The Completion port handle is yet unknown.
b) The RTS requested the I/O manager be shutdown via an event --TODO: Remove?
c) We are waiting on the Haskell I/O manager to service a previous
request as to allow us to re-use the buffer.
We would ideally like to spend as little time as possible in 2).
The workflow for this I/O manager is as follows:
+------------------------+
| Worker thread creation |
+-----------+------------+
|
|
+-------------v---------------+
+------> Block in unalertable wait +-----+
| +-------------+---------------+ |
| | |
| | |
| +-----------v------------+ |
| |Init by Haskell I/O call| | If init already
wait for I/O | +-----------+------------+ |
processing in | | |
Haskell side | | |
| +--------v---------+ |
Also process | | alertable wait <-----------+
events like | +--------+---------+
shutdown | |
| |
| +-------v--------+
+------------+process response|
+----------------+
The non-alertable wait itself is split into two phases during regular
execution:
1.) canQueueIOThread == true
2.) canQueueIOThread == false, outstanding_service_requests == true
`notifyScheduler` puts us into the first phase. During which we wait
for the scheduler to call `queueIOThread`.
During the second phase we wait for the queued haskell thread to run.
The alertable wait is done by calling into GetQueuedCompletionStatusEx.
After we return from the call we notify the haskell side of new events
via `notifyScheduler`.
notifyScheduler set's flags to indicate to the scheduler that new IO work
needs to be processed. At this point the next call to `schedule` will
check the flag and schedule execution of a haskell thread executing
processRemoteCompletion.
`processRemoteCompletion` will process IO results invoking call backs and
processing timer events. Once done it resets `outstanding_service_requests`
and wakes up the IOManager thread. Which at this point becomes unblocked
and reenters the altertable wait state. This is done by calling into
registerAlterableWait.
As a design decision to keep this side as light as possible no bookkeeping
is done here to track requests. That is, this file has no way of knowing
of the remaining outstanding I/O requests, how many it actually completed
in the last call as that list may contain spurious events.
It works around this by having the Haskell side tell it how much work it
still has left to do.
Unlike the Threaded version we use a single worker thread to handle
completions and so it won't scale as well. But if high scalability is needed
then use the threaded runtime. This would have to become threadsafe
in order to use multiple threads, but this is non-trivial as the non-threaded
rts has no locks around any of the key parts.
See also Note [WINIO Manager design].
Note [Notifying the RTS/Haskell of completed events]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
The C side runner can't directly create a haskell thread.
With the current API of the haskell runtime this would be terrible
unsound. In particular the GC assumes no heap objects are generated,
and no heap memory is requested while it is running.
To work around this the scheduler invokes queueIOThread which checks
if a (haskell) thread should be created to process IO requests.
Since we only use this code path in the non-threaded runtime this
ensures there is only one OS thread at a time making use of the haskell
heap.
Note [Non-Threaded IO Manager startup sequence]
~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
Under the new IO Manager we run a bit of initialization under
hs_init(). The first call into actual IO manager code is a
invocation of startupAsyncWinIO();
There we initialize IO manager locale variables and.
* call ioManagerStart()
* Create a thread to execute "runner"
We never truly shut down the IO Manager. While this means we
might block forever on the IOPort if the IO Manager is no longer
needed we consider this cheap compared to the complexity of
properly handling pausing and resuming of the manager.
*/
/* The IOCP Handle all I/O requests are associated with for this RTS. */
static HANDLE completionPortHandle = INVALID_HANDLE_VALUE;
/* Boolean controlling if the I/O manager is/should still be running. */
static bool running = false;
/* Boolean to indicate whether we have outstanding I/O requests that still need
to be processed by the I/O manager on the Haskell side.
Set by:
notifyScheduler (true)
registerAlertableWait (false)
Read by:
runner
*/
volatile bool outstanding_service_requests = false;
/* Indicates wether we have hit one case where we serviced as much requests as
we could because the buffer got full. In such cases for the next requests
we expand the buffers so we have room to process requests in bigger
batches.
Set by:
runner
Read by:
registerAlertableWait
*/
static bool queue_full = false;
/* Timeout to use for the next alertable wait. INFINITE means never timeout.
Also see note [WINIO Timer management]. */
static DWORD timeout = INFINITE;
static HANDLE workerThread = NULL;
static DWORD workerThreadId = 0;
/* Synchronization mutex for modifying the above state variables in a thread
safe way. */
static SRWLOCK wio_runner_lock;
/* Conditional variable to wake the I/O manager up from a non-alertable waiting
state. */
static CONDITION_VARIABLE wakeEvent;
/* Conditional variable to force the system (haskell) thread to wait for a request to
complete. */
static CONDITION_VARIABLE threadIOWait;
/* Number of callbacks to reserve slots for in ENTRIES. This is also the
total number of concurrent I/O requests we can handle in one go. */
static uint32_t num_callbacks = 32;
/* Buffer for I/O request information. */
static OVERLAPPED_ENTRY *entries;
/* Notify the Haskell side of this many new finished requests */
static uint32_t num_notify;
/* Indicates to the scheduler that new work is available for processing.
Set by:
runner
queueIOThread
Read by
queueIOThread
*/
static volatile bool canQueueIOThread;
static void notifyScheduler(uint32_t num);
static DWORD WINAPI runner (LPVOID lpParam);
/* Create and initialize the non-threaded I/O manager.
Called just once from hs_init. */
bool startupAsyncWinIO(void)
{
ASSERT(!running);
running = true;
outstanding_service_requests = false;
completionPortHandle = INVALID_HANDLE_VALUE;
InitializeSRWLock (&wio_runner_lock);
InitializeConditionVariable (&wakeEvent);
InitializeConditionVariable (&threadIOWait);
entries = calloc (sizeof (OVERLAPPED_ENTRY), num_callbacks);
/* Start the I/O manager before creating the worker thread to prevent a busy
wait or spin-lock, this will call registerIOCPHandle allowing us to
skip the initial un-alertable wait. */
ioManagerStart ();
workerThread = CreateThread (NULL, 0, runner, NULL, 0, &workerThreadId);
if (!workerThread)
{
barf ("could not create I/O manager thread.");
return false;
}
return true;
}
/* Terminate the I/O manager, if WAIT_THREADS then the call will block until
all helper threads are finished. */
void shutdownAsyncWinIO(bool wait_threads)
{
if (workerThread != NULL)
{
if (wait_threads)
{
AcquireSRWLockExclusive (&wio_runner_lock);
running = false;
ioManagerWakeup ();
PostQueuedCompletionStatus (completionPortHandle, 0, 0, NULL);
WakeConditionVariable (&wakeEvent);
WakeConditionVariable (&threadIOWait);
ReleaseSRWLockExclusive (&wio_runner_lock);
/* Now wait for the thread to actually finish. */
WaitForSingleObject (workerThread, INFINITE);
}
completionPortHandle = INVALID_HANDLE_VALUE;
CloseHandle (workerThread);
workerThread = NULL;
workerThreadId = 0;
free (entries);
entries = NULL;
}
/* Call back into the Haskell side to terminate things there too. */
ioManagerDie ();
}
/* Register the I/O completion port handle PORT that the I/O manager will be
monitoring. All handles are expected to be associated with this handle. */
void registerIOCPHandle (HANDLE port)
{
AcquireSRWLockExclusive (&wio_runner_lock);
completionPortHandle = port;
ReleaseSRWLockExclusive (&wio_runner_lock);
}
/* Callback hook so the Haskell part of the I/O manager can notify this manager
that a request someone is waiting on was completed synchronously. This means
we need to wake up the scheduler as there is work to be done. */
void completeSynchronousRequest (void)
{
AcquireSRWLockExclusive (&wio_runner_lock);
WakeConditionVariable (&threadIOWait);
ReleaseSRWLockExclusive (&wio_runner_lock);
}
/* Register outstanding I/O requests that the I/O manager should handle.
This function will unblock the runner if it has been blocked in an
non-alertable wait. It might end an alertable wait as well but this
depends on the exact parameters provided.
The haskell side will call this to inform the runner either about new
I/O requests or to update the number of outstanding requests after
processing a bundle.
* has_timeout tells us if the mssec parameter is valid.
* MSSEC is the maximum amount of time in milliseconds that an alertable wait
should be done for before the haskell side requested to be notified of progress.
* NUM_REQ is the total overall number of outstanding I/O requests.
*/
void registerAlertableWait (bool has_timeout, DWORD mssec)
{
ASSERT(completionPortHandle != INVALID_HANDLE_VALUE);
AcquireSRWLockExclusive (&wio_runner_lock);
bool interrupt = false;
if (mssec == 0 && !has_timeout) {
timeout = INFINITE;
}
else if(has_timeout) {
timeout = mssec;
}
outstanding_service_requests = false;
/* Resize queue if required. */
if (queue_full)
{
num_callbacks *= 2;
OVERLAPPED_ENTRY *new
= realloc (entries,
sizeof (OVERLAPPED_ENTRY) * num_callbacks);
if (new)
entries = new;
queue_full = false;
}
/* If the new timeout is earlier than the old one we have to reschedule the
wait. Do this by interrupting the current operation and setting the new
timeout, since it must be the shortest one in the queue. */
if (timeout > mssec && mssec > 0)
{
timeout = mssec;
interrupt = true;
}
ReleaseSRWLockExclusive (&wio_runner_lock);
/* Since we call registerAlertableWait only after
processing I/O requests it's always desirable to wake
up the runner here. */
WakeConditionVariable (&wakeEvent);
if (interrupt) {
PostQueuedCompletionStatus (completionPortHandle, 0, 0, NULL);
}
}
/* Exported callback function that will be called by the RTS to collect the
finished overlapped entried belonging to the completed I/O requests. The
number of read entries will be returned in NUM.
NOTE: This function isn't thread safe, but is intended to be called only
when requested by the I/O manager via notifyScheduler. In
that context it is thread safe as we're guaranteeing that the I/O
manager is blocked waiting for the read to happen followed by a
registerAlertableWait call. */
OVERLAPPED_ENTRY* getOverlappedEntries (uint32_t *num)
{
*num = num_notify;
return entries;
}
/* Called by the scheduler when we have ran out of work to do and we have at
least one thread blocked on an I/O Port. When WAIT then if this function
returns you will have at least one action to service, though this may be a
wake-up action. */
void awaitAsyncRequests (bool wait)
{
if(queueIOThread()) {
return;
}
AcquireSRWLockExclusive (&wio_runner_lock);
/* We don't deal with spurious requests here, that's left up to AwaitEvent.c
because in principle we need to check if the capability work queue is now
not empty but we can't do that here. Also these locks don't guarantee
fairness, as such a request may have completed without us seeing a
timeslice in between. */
if (wait && outstanding_service_requests)
SleepConditionVariableSRW (&threadIOWait, &wio_runner_lock, INFINITE, 0);
ReleaseSRWLockExclusive (&wio_runner_lock);
}
/* Sets `canQueueIOThread` to indicate to the scheduler that it should
queue a new haskell thread to process IO events. */
static void notifyScheduler(uint32_t num) {
AcquireSRWLockExclusive (&wio_runner_lock);
ASSERT(!canQueueIOThread);
num_notify = num;
canQueueIOThread = true;
WakeConditionVariable(&threadIOWait);
ReleaseSRWLockExclusive (&wio_runner_lock);
}
/* Queues a new haskell thread to process IO events
if there is work to do.
Returns true if a thread/work was queued.
Precond:
Not already waiting on service requests.
Postcond:
outstanding_service_requests = true
processRemoteCompletion queued.
IO runner thread blocked until processRemoteCompletion has run.
*/
bool queueIOThread()
{
bool result = false;
#if !defined(THREADED_RTS)
AcquireSRWLockExclusive (&wio_runner_lock);
if(canQueueIOThread)
{
ASSERT(!outstanding_service_requests);
outstanding_service_requests = true;
canQueueIOThread = false;
Capability *cap = &MainCapability;
StgTSO * tso = createStrictIOThread (cap, RtsFlags.GcFlags.initialStkSize,
processRemoteCompletion_closure);
labelThread(cap, tso, "ProcessIOThread");
ASSERT(tso);
scheduleThreadNow (cap, tso);
result = true;
}
ReleaseSRWLockExclusive (&wio_runner_lock);
#endif
return result;
}
/* Main thread runner for the non-threaded I/O Manager. */
static DWORD WINAPI runner (LPVOID lpParam STG_UNUSED)
{
/* The last event that was sent to the I/O manager. */
HsWord32 lastEvent = 0;
while (running)
{
AcquireSRWLockExclusive (&wio_runner_lock);
lastEvent = readIOManagerEvent ();
/* Non-alertable wait. While here we can't server any I/O requests so we
would ideally like to spent as little time here as possible. As such
there are only 3 reasons to enter this state:
1) I/O manager hasn't been fully initialized yet.
2) I/O manager was told to shutdown, instead of doing that we just
block indefinitely so we don't have to recreate the thread to start
back up.
3) We are waiting for the RTS to service the last round of requests. */
while (completionPortHandle == INVALID_HANDLE_VALUE
|| lastEvent == IO_MANAGER_DIE
|| outstanding_service_requests
|| canQueueIOThread)
{
// fprintf(stderr, "NonAlert sleep:(%x, %i, %i)\n",
// lastEvent, outstanding_service_requests, canQueueIOThread);
// fflush(stderr);
SleepConditionVariableSRW (&wakeEvent, &wio_runner_lock, INFINITE, 0);
HsWord32 nextEvent = readIOManagerEvent ();
lastEvent = nextEvent ? nextEvent : lastEvent;
}
ReleaseSRWLockExclusive (&wio_runner_lock);
ULONG num_removed = 0;
ZeroMemory (entries, sizeof (entries[0]) * num_callbacks);
if (GetQueuedCompletionStatusEx (completionPortHandle, entries,
num_callbacks, &num_removed, timeout,
false))
{
if (num_removed > 0)
{
queue_full = num_removed == num_callbacks;
}
}
else if (WAIT_TIMEOUT == GetLastError ())
{
num_removed = 0;
}
// We always queue a haskell thread upon returning from GetQueuedCompletionStatusEx.
// We only return from GetQueuedCompletionStatusEx if:
// * IO was processed, in which case we need to process the events.
// * A timer event was registered/timed out. We need the process expired timers
// and update the timeout.
// * We woke up spuriously, which is quite rare.
// This simplifies the logic in exchange for a *very* small chance of redundant
// haskell threads. A redundant thread would be queued if:
// * We wake up spuriously
// * All returned results have been canceled already.
// It's not realistic nor worthwhile to check for these edge cases so we don't.
notifyScheduler (num_removed);
AcquireSRWLockExclusive (&wio_runner_lock);
if (!running)
ExitThread (0);
ReleaseSRWLockExclusive (&wio_runner_lock);
}
return 0;
}
|