ReactOS 0.4.15-dev-8428-g6910fa6
context.c
Go to the documentation of this file.
1/*
2 * COPYRIGHT: See COPYING in the top level directory
3 * PROJECT: ReactOS WinSock 2 DLL
4 * FILE: dll/win32/ws2help/context.c
5 * PURPOSE: WinSock 2 DLL header
6 */
7
8/* INCLUDES ******************************************************************/
9
10#include "precomp.h"
11
12#include <ws2help.h>
13
14/* DATA **********************************************************************/
15
20
22{
23 31, 61, 127, 257, 521, 1031, 2053,
24 4099, 8191, 16381, 32749, 65537, 131071, 261983,
25 -1
26};
27
28typedef volatile LONG VLONG;
29typedef VLONG *PVLONG;
30
31/* DEFINES *******************************************************************/
32
33/* Yes, we "abuse" the lower bits */
34#define WSH_SEARCH_TABLE_FROM_HANDLE(h, t) \
35 (&t->SearchTables[(((ULONG_PTR)h >> 2) & t->Mask)])
36
37#define WSH_HASH_FROM_HANDLE(h, hs) \
38 (hs->Handles[((ULONG_PTR)h % hs->Size)])
39
40#define AcquireWriteLock(t) \
41 EnterCriticalSection(&t->Lock);
42
43#define ReleaseWriteLock(t) \
44 LeaveCriticalSection(&t->Lock);
45
46/* FUNCTIONS *****************************************************************/
47
48static __inline
49VOID
52{
53 LONG OldCount;
54
55 /* Start acquire loop */
56 do
57 {
58 /* Write and save count value */
59 *Count = Table->CurrentCount;
60 OldCount = **Count;
61
62 /* Check if it's valid and try to increment it */
63 if ((OldCount > 0) && (InterlockedCompareExchange(*Count,
64 OldCount + 1,
65 OldCount) == OldCount))
66 {
67 /* Everything went OK */
68 break;
69 }
70 } while (TRUE);
71}
72
73static __inline
74VOID
77{
78 /* Decrement the count. If we went below 0, someone is waiting... */
80 {
81 /* We use pulse since this is a shared event */
83 }
84}
85
86VOID
90{
92
93 /* Do a context switch */
95
96 /* Check if the counter is above one */
97 if (*Counter > 0)
98 {
99 /*
100 * This shouldn't happen unless priorities are messed up. Do a wait so
101 * that the threads with lower priority will get their chance now.
102 */
103 if (!ghWriterEvent)
104 {
105 /* We don't even have an event! Allocate one manually... */
107 if (EventHandle)
108 {
109 /* Save the event handle atomically */
112 NULL)))
113 {
114 /* Someone beat us to it, close ours */
116 }
117 }
118 else
119 {
120 /* Things couldn't get worse for us. Do a last-resort hack */
121 while (*Counter > 0) Sleep(10);
122 }
123 }
124
125 /*
126 * Our event is ready. Tell the others to signal us by making sure
127 * that the last counter will be -1, notifying the last thread of our
128 * request.
129 */
131 {
132 /* Keep looping */
133 do
134 {
135 /* Wait in tiny bursts, so we can catch the PulseEvent */
137 } while (*Counter >= 0);
138 }
139 }
140}
141
142static __inline
143VOID
145{
146 PVLONG OldCount = Table->CurrentCount;
147 LONG SpinCount;
148
149 /* See which counter is being used */
150 if (OldCount == &Table->Count1)
151 {
152 /* Use counter 2 now */
153 Table->Count2 = 1;
154 Table->CurrentCount = &Table->Count2;
155 }
156 else
157 {
158 /* Use counter 1 now */
159 Table->Count1 = 1;
160 Table->CurrentCount = &Table->Count1;
161 }
162
163 /* Decrease the old count to block new readers */
164 if (InterlockedDecrement(OldCount) > 0)
165 {
166 /* On an MP machine, spin a bit first */
167 if (Table->SpinCount)
168 {
169 /* Get the spincount and loop it */
170 SpinCount = Table->SpinCount;
171 while (*OldCount > 0)
172 {
173 /* Check if the spin failed */
174 if (--SpinCount <= 0) break;
175 }
176 }
177
178 /* Check one last time if someone is still active */
179 if (*OldCount > 0)
180 {
181 /* Yep, we'll have to do a blocking (slow) wait */
182 DoWaitForReaders(Table, OldCount);
183 }
184 }
185}
186
187DWORD
188WINAPI
190{
192 PWAH_HANDLE_TABLE LocalTable;
193 DWORD i;
194
195 /* Enter the prolog, make sure we're initialized */
197 if (ErrorCode != ERROR_SUCCESS) return ErrorCode;
198
199 /* Assume NULL */
200 *Table = NULL;
201
202 /* Allocate enough tables */
203 LocalTable = HeapAlloc(GlobalHeap,
204 0,
206 SearchTables[gHandleToIndexMask + 1]));
207
208 /* Make sure it was allocated */
209 if (!LocalTable) return WSA_NOT_ENOUGH_MEMORY;
210
211 /* Set the mask for the table */
212 LocalTable->Mask = gHandleToIndexMask;
213
214 /* Now initialize every table */
215 for (i = 0; i <= gHandleToIndexMask; i++)
216 {
217 /* No hash table yet */
218 LocalTable->SearchTables[i].HashTable = NULL;
219
220 /* Set the current count */
221 LocalTable->SearchTables[i].CurrentCount = &LocalTable->SearchTables[i].Count1;
222
223 /* Initialize the counts */
224 LocalTable->SearchTables[i].Count1 = 1;
225 LocalTable->SearchTables[i].Count2 = 0;
226
227 /* Set expanding state and spin count */
228 LocalTable->SearchTables[i].Expanding = FALSE;
229 LocalTable->SearchTables[i].SpinCount = gdwSpinCount;
230
231 /* Initialize the lock */
233 SearchTables[i].Lock,
235 }
236
237 /* Return pointer */
238 *Table = LocalTable;
239
240 /* Return success */
241 return ERROR_SUCCESS;
242}
243
244DWORD
245WINAPI
247{
248 DWORD i;
249
250 /* Make sure the table is valid */
251 if (!Table)
252 {
253 /* No valid table */
255 }
256
257 /* Loop each search table */
258 for (i = 0; i <= Table->Mask; i++)
259 {
260 /* Check if there's a table here */
261 if (Table->SearchTables[i].HashTable)
262 {
263 /* Free it */
264 HeapFree(GlobalHeap, 0, Table->SearchTables[i].HashTable);
265 }
266
267 /* Delete the lock */
268 DeleteCriticalSection(&Table->SearchTables[i].Lock);
269 }
270
271 /* Delete the table */
273
274 /* Return success */
275 return ERROR_SUCCESS;
276}
277
278BOOL
279WINAPI
283{
284 DWORD i, j;
285 PWAH_SEARCH_TABLE SearchTable;
288 BOOL GoOn = TRUE;
289
290 /* Loop the table */
291 for (i = 0; i <= Table->Mask; i++)
292 {
293 /* Get the Search table */
294 SearchTable = &Table->SearchTables[i];
295
296 /* Lock it */
297 AcquireWriteLock(SearchTable);
298
299 /* Mark us as expanding and wait for everyone */
300 SearchTable->Expanding = TRUE;
301 TryWaitForReaders(SearchTable);
302
303 /* Get the hash table */
304 HashTable = SearchTable->HashTable;
305
306 /* Make sure it exists */
307 if (HashTable)
308 {
309 /* Loop every handle in it */
310 for (j = 0; j < HashTable->Size; j++)
311 {
312 /* Get this handle */
313 Handle = HashTable->Handles[j];
314 if (!Handle) continue;
315
316 /* Call the callback proc */
317 GoOn = Callback(Context, Handle);
318 if (!GoOn) break;
319 }
320 }
321
322 /* Disable the expansion bit and release the lock */
323 SearchTable->Expanding = FALSE;
324 ReleaseWriteLock(SearchTable);
325
326 /* Check again if we should leave */
327 if (!GoOn) break;
328 }
329
330 /* return */
331 return GoOn;
332}
333
335WINAPI
338{
339 PWAH_HANDLE *HashHandle, OldHandle;
342 DWORD HandleCount, i;
343 PWAH_SEARCH_TABLE SearchTable;
344
345 /* Get the current Search Table */
346 SearchTable = WSH_SEARCH_TABLE_FROM_HANDLE(Handle->Handle, Table);
347
348 /* Start loop */
349 do
350 {
351 /* Get reader lock */
352 AcquireReadLock(SearchTable, &Count);
353
354 /* Get the hash table */
355 HashTable = SearchTable->HashTable;
356
357 /* Make sure we are not expanding, and that the table is there */
358 if (!(SearchTable->Expanding) && (HashTable))
359 {
360 /* Get the hash handle */
361 HashHandle = &WSH_HASH_FROM_HANDLE(Handle->Handle, HashTable);
362
363 /* Do the insert */
365 Handle,
366 NULL) == NULL)
367 {
368 /* Success, release the reader lock */
369 ReleaseReadLock(SearchTable, Count);
370
371 /* Save old handle */
372 OldHandle = Handle;
373 break;
374 }
375 }
376
377 /* Release the read lock since we're done with it now */
378 ReleaseReadLock(SearchTable, Count);
379
380 /* We need the writer lock to expand/create the table */
381 AcquireWriteLock(SearchTable);
382
383 /* Mark the table in use */
384 SearchTable->Expanding = TRUE;
385
386 /* Wait for all the readers to finish */
387 TryWaitForReaders(SearchTable);
388
389 /* Start loop */
390 do
391 {
392 /* Get the hash table again */
393 HashTable = SearchTable->HashTable;
394
395 /* Check if exists now */
396 if (HashTable)
397 {
398 /* It does! Do what we wanted to do earlier. Get the hash... */
399 HashHandle = &WSH_HASH_FROM_HANDLE(Handle->Handle, HashTable);
400
401 /* Check if it doesn't exist */
402 if (!(*HashHandle))
403 {
404 /* Write it (no need for interlock, we have the RW lock) */
405 OldHandle = Handle;
406 *HashHandle = Handle;
407 break;
408 }
409 else if ((*HashHandle)->Handle == Handle->Handle)
410 {
411 /* Handle matches, write it (see comment above) */
412 OldHandle = *HashHandle;
413 *HashHandle = Handle;
414 break;
415 }
416
417 /* No go, we need to expand the table. Remember the size now */
418 HandleCount = HashTable->Size;
419 }
420 else
421 {
422 /* Table is empty, we have to create it */
423 HandleCount = 0;
424 }
425
426ExpandTable:
427 /* Find a free prime */
428 for (i = 0; HandleCount >= SockPrimes[i]; i++);
429
430 /* Check if we found one */
431 if (SockPrimes[i] != 0xFFFFFFFF)
432 {
433 /* Use the prime */
434 HandleCount = SockPrimes[i];
435 }
436 else
437 {
438 /* No primes left. Table is quite large, so simply double it */
439 HandleCount *= 2;
440 }
441
442 /* Allocate the table */
444 0,
446 Handles[HandleCount]));
447
448 /* Hopefully we have one now */
449 if (NewHashTable)
450 {
451 /* Set its size */
452 NewHashTable->Size = HandleCount;
453
454 /* Initialize it */
455 RtlZeroMemory(NewHashTable->Handles, HandleCount * sizeof(PVOID));
456
457 /* Insert us first */
459
460 /* Now check if our old table had entries in it */
461 if (HashTable)
462 {
463 /* We need to move them */
464 for (i = 0; i < HashTable->Size; i++)
465 {
466 /* Make sure the hash handle exists */
467 if (HashTable->Handles[i])
468 {
469 /* Get it */
470 HashHandle = &WSH_HASH_FROM_HANDLE(HashTable->
471 Handles[i]->Handle,
473
474 /* Check if it has a value */
475 if (!(*HashHandle))
476 {
477 /* It's empty, so just write the handle */
478 *HashHandle = HashTable->Handles[i];
479 }
480 else
481 {
482 /* Not empty :/... that implies a collision */
484 goto ExpandTable;
485 }
486 }
487 }
488
489 /* Write the new hash table */
490 SearchTable->HashTable = NewHashTable;
491
492 /* Wait for everyone to be done with it, then free it */
493 TryWaitForReaders(SearchTable);
495 }
496 else
497 {
498 /* It was empty, nothing to worry about */
499 SearchTable->HashTable = NewHashTable;
500 }
501
502 /* Save the old handle */
503 OldHandle = Handle;
504 }
505 else
506 {
507 /* There was no old handle */
508 OldHandle = Handle;
509 }
510 } while (0);
511
512 /* Mark us as free, and release the write lock */
513 SearchTable->Expanding = FALSE;
514 ReleaseWriteLock(SearchTable);
515 break;
516 } while (1);
517
518 /* Return the old handle */
519 return OldHandle;
520}
521
523WINAPI
526{
527 PWAH_HANDLE HashHandle;
528 PWAH_SEARCH_TABLE SearchTable;
531
532 /* Get the current Search Table */
534
535 /* Lock it */
536 AcquireReadLock(SearchTable, &Count);
537
538 /* Get the hash table and handle */
539 HashTable = SearchTable->HashTable;
540
541 /* Check if it's valid, and if it's the one we want */
542 if ((HashTable) &&
543 (HashHandle = WSH_HASH_FROM_HANDLE(Handle, HashTable)) &&
544 (HashHandle->Handle == Handle))
545 {
546 /* Reference the handle */
547 InterlockedIncrement(&HashHandle->RefCount);
548 }
549 else
550 {
551 /* Invalid handle */
552 HashHandle = NULL;
553 }
554
555 /* Release the lock */
556 ReleaseReadLock(SearchTable, Count);
557
558 /* Return */
559 return HashHandle;
560}
561
562DWORD
563WINAPI
566{
567 PWAH_HANDLE *HashHandle;
568 PWAH_SEARCH_TABLE SearchTable;
571
572 /* Get the current Search Table */
573 SearchTable = WSH_SEARCH_TABLE_FROM_HANDLE(Handle->Handle, Table);
574
575 /* Lock it */
576 AcquireWriteLock(SearchTable);
577
578 /* Get the hash table and handle */
579 HashTable = SearchTable->HashTable;
580 HashHandle = &WSH_HASH_FROM_HANDLE(Handle->Handle, HashTable);
581
582 /* Make sure we have a handle, and write the new pointer */
583 if (HashHandle && (InterlockedCompareExchangePointer((PVOID*)HashHandle,
584 NULL,
585 Handle) == Handle))
586 {
587 /* Wait for everyone to be done with it */
588 TryWaitForReaders(SearchTable);
589 }
590 else
591 {
592 /* Invalid handle */
594 }
595
596 /* Release the lock */
597 ReleaseWriteLock(SearchTable);
598
599 /* Return */
600 return ErrorCode;
601}
602
603/* EOF */
#define VOID
Definition: acefi.h:82
#define InterlockedIncrement
Definition: armddk.h:53
#define InterlockedDecrement
Definition: armddk.h:52
#define ERROR_SUCCESS
Definition: deptool.c:10
#define NULL
Definition: types.h:112
#define TRUE
Definition: types.h:120
#define FALSE
Definition: types.h:117
struct HashTable * NewHashTable(void)
Definition: hash.c:77
#define CloseHandle
Definition: compat.h:739
#define ERROR_INVALID_PARAMETER
Definition: compat.h:101
#define HeapAlloc
Definition: compat.h:733
#define HeapFree(x, y, z)
Definition: compat.h:735
HANDLE GlobalHeap
Definition: dllmain.c:19
BOOL WINAPI WahEnumerateHandleContexts(IN PWAH_HANDLE_TABLE Table, IN PWAH_HANDLE_ENUMERATE_PROC Callback, IN PVOID Context)
Definition: context.c:280
VOID WINAPI DoWaitForReaders(IN PWAH_SEARCH_TABLE Table, IN PVLONG Counter)
Definition: context.c:88
HANDLE ghWriterEvent
Definition: context.c:17
static __inline VOID ReleaseReadLock(IN PWAH_SEARCH_TABLE Table, IN PVLONG Count)
Definition: context.c:75
VLONG * PVLONG
Definition: context.c:29
#define WSH_HASH_FROM_HANDLE(h, hs)
Definition: context.c:37
CRITICAL_SECTION WshHandleTableLock
Definition: context.c:16
static __inline VOID TryWaitForReaders(IN PWAH_SEARCH_TABLE Table)
Definition: context.c:144
DWORD gdwSpinCount
Definition: context.c:18
static __inline VOID AcquireReadLock(IN PWAH_SEARCH_TABLE Table, IN PVLONG *Count)
Definition: context.c:50
DWORD WINAPI WahCreateHandleContextTable(OUT PWAH_HANDLE_TABLE *Table)
Definition: context.c:189
CONST DWORD SockPrimes[]
Definition: context.c:21
DWORD WINAPI WahRemoveHandleContext(IN PWAH_HANDLE_TABLE Table, IN PWAH_HANDLE Handle)
Definition: context.c:564
PWAH_HANDLE WINAPI WahInsertHandleContext(IN PWAH_HANDLE_TABLE Table, IN PWAH_HANDLE Handle)
Definition: context.c:336
#define WSH_SEARCH_TABLE_FROM_HANDLE(h, t)
Definition: context.c:34
DWORD WINAPI WahDestroyHandleContextTable(IN PWAH_HANDLE_TABLE Table)
Definition: context.c:246
DWORD gHandleToIndexMask
Definition: context.c:19
PWAH_HANDLE WINAPI WahReferenceContextByHandle(IN PWAH_HANDLE_TABLE Table, IN HANDLE Handle)
Definition: context.c:524
#define ReleaseWriteLock(t)
Definition: context.c:43
volatile LONG VLONG
Definition: context.c:28
#define AcquireWriteLock(t)
Definition: context.c:40
#define WS2HELP_PROLOG()
Definition: precomp.h:47
unsigned int BOOL
Definition: ntddk_ex.h:94
unsigned long DWORD
Definition: ntddk_ex.h:95
ULONG Handle
Definition: gdb_input.c:15
ASMGENDATA Table[]
Definition: genincdata.c:61
GLsizei GLenum const GLvoid GLsizei GLenum GLbyte GLbyte GLbyte GLdouble GLdouble GLdouble GLfloat GLfloat GLfloat GLint GLint GLint GLshort GLshort GLshort GLubyte GLubyte GLubyte GLuint GLuint GLuint GLushort GLushort GLushort GLbyte GLbyte GLbyte GLbyte GLdouble GLdouble GLdouble GLdouble GLfloat GLfloat GLfloat GLfloat GLint GLint GLint GLint GLshort GLshort GLshort GLshort GLubyte GLubyte GLubyte GLubyte GLuint GLuint GLuint GLuint GLushort GLushort GLushort GLushort GLboolean const GLdouble const GLfloat const GLint const GLshort const GLbyte const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLdouble const GLfloat const GLfloat const GLint const GLint const GLshort const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort GLenum GLenum GLenum GLfloat GLenum GLint GLenum GLenum GLenum GLfloat GLenum GLenum GLint GLenum GLfloat GLenum GLint GLint GLushort GLenum GLenum GLfloat GLenum GLenum GLint GLfloat const GLubyte GLenum GLenum GLenum const GLfloat GLenum GLenum const GLint GLenum GLint GLint GLsizei GLsizei GLint GLenum GLenum const GLvoid GLenum GLenum const GLfloat GLenum GLenum const GLint GLenum GLenum const GLdouble GLenum GLenum const GLfloat GLenum GLenum const GLint GLsizei GLuint GLfloat GLuint GLbitfield GLfloat GLint GLuint GLboolean GLenum GLfloat GLenum GLbitfield GLenum GLfloat GLfloat GLint GLint const GLfloat GLenum GLfloat GLfloat GLint GLint GLfloat GLfloat GLint GLint const GLfloat GLint GLfloat GLfloat GLint GLfloat GLfloat GLint GLfloat GLfloat const GLdouble const GLfloat const GLdouble const GLfloat GLint i
Definition: glfuncs.h:248
GLsizei GLenum const GLvoid GLsizei GLenum GLbyte GLbyte GLbyte GLdouble GLdouble GLdouble GLfloat GLfloat GLfloat GLint GLint GLint GLshort GLshort GLshort GLubyte GLubyte GLubyte GLuint GLuint GLuint GLushort GLushort GLushort GLbyte GLbyte GLbyte GLbyte GLdouble GLdouble GLdouble GLdouble GLfloat GLfloat GLfloat GLfloat GLint GLint GLint GLint GLshort GLshort GLshort GLshort GLubyte GLubyte GLubyte GLubyte GLuint GLuint GLuint GLuint GLushort GLushort GLushort GLushort GLboolean const GLdouble const GLfloat const GLint const GLshort const GLbyte const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLdouble const GLfloat const GLfloat const GLint const GLint const GLshort const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort const GLdouble const GLfloat const GLint const GLshort GLenum GLenum GLenum GLfloat GLenum GLint GLenum GLenum GLenum GLfloat GLenum GLenum GLint GLenum GLfloat GLenum GLint GLint GLushort GLenum GLenum GLfloat GLenum GLenum GLint GLfloat const GLubyte GLenum GLenum GLenum const GLfloat GLenum GLenum const GLint GLenum GLint GLint GLsizei GLsizei GLint GLenum GLenum const GLvoid GLenum GLenum const GLfloat GLenum GLenum const GLint GLenum GLenum const GLdouble GLenum GLenum const GLfloat GLenum GLenum const GLint GLsizei GLuint GLfloat GLuint GLbitfield GLfloat GLint GLuint GLboolean GLenum GLfloat GLenum GLbitfield GLenum GLfloat GLfloat GLint GLint const GLfloat GLenum GLfloat GLfloat GLint GLint GLfloat GLfloat GLint GLint const GLfloat GLint GLfloat GLfloat GLint GLfloat GLfloat GLint GLfloat GLfloat const GLdouble const GLfloat const GLdouble const GLfloat GLint GLint GLint j
Definition: glfuncs.h:250
#define InterlockedCompareExchangePointer
Definition: interlocked.h:129
#define InterlockedCompareExchange
Definition: interlocked.h:104
_In_ NDIS_ERROR_CODE ErrorCode
Definition: ndis.h:4436
int Count
Definition: noreturn.cpp:7
#define CONST
Definition: pedump.c:81
long LONG
Definition: pedump.c:60
Definition: hash.c:67
WSH_SEARCH_TABLE SearchTables[1]
Definition: ws2help.h:38
LONG RefCount
Definition: ws2help.h:14
HANDLE Handle
Definition: ws2help.h:15
volatile PWAH_HASH_TABLE HashTable
Definition: ws2help.h:26
volatile PLONG CurrentCount
Definition: ws2help.h:27
static LARGE_INTEGER Counter
Definition: clock.c:43
DWORD WINAPI WaitForSingleObject(IN HANDLE hHandle, IN DWORD dwMilliseconds)
Definition: synch.c:82
VOID WINAPI DECLSPEC_HOTPATCH Sleep(IN DWORD dwMilliseconds)
Definition: synch.c:790
BOOL WINAPI InitializeCriticalSectionAndSpinCount(OUT LPCRITICAL_SECTION lpCriticalSection, IN DWORD dwSpinCount)
Definition: synch.c:765
BOOL WINAPI DECLSPEC_HOTPATCH PulseEvent(IN HANDLE hEvent)
Definition: synch.c:695
#define FIELD_OFFSET(t, f)
Definition: typedefs.h:255
#define RtlZeroMemory(Destination, Length)
Definition: typedefs.h:262
#define IN
Definition: typedefs.h:39
#define OUT
Definition: typedefs.h:40
_In_ WDFINTERRUPT _In_ PFN_WDF_INTERRUPT_SYNCHRONIZE Callback
Definition: wdfinterrupt.h:458
#define CreateEvent
Definition: winbase.h:3748
BOOL WINAPI SwitchToThread(void)
Definition: thread.c:448
void WINAPI DeleteCriticalSection(PCRITICAL_SECTION)
#define WINAPI
Definition: msvc.h:6
#define WSA_NOT_ENOUGH_MEMORY
Definition: winsock2.h:620
BOOL(WINAPI * PWAH_HANDLE_ENUMERATE_PROC)(IN PVOID Context, IN PWAH_HANDLE Handle)
Definition: ws2help.h:44
_Out_ PHANDLE EventHandle
Definition: iofuncs.h:857