Go to the source code of this file.
◆ InsertAscendingList
#define InsertAscendingList |
( |
|
ListHead, |
|
|
|
NewEntry, |
|
|
|
Type, |
|
|
|
ListEntryField, |
|
|
|
SortField |
|
) |
| |
Value:do { \
PLIST_ENTRY
current = (ListHead)->Flink; \
{ \
(NewEntry)->SortField) \
{ \
break; \
} \
} while (0)
#define InsertTailList(ListHead, Entry)
PFLT_MESSAGE_WAITER_QUEUE CONTAINING_RECORD(Csq, DEVICE_EXTENSION, IrpQueue)) -> WaiterQ.mLock) _IRQL_raises_(DISPATCH_LEVEL) VOID NTAPI FltpAcquireMessageWaiterLock(_In_ PIO_CSQ Csq, _Out_ PKIRQL Irql)
struct task_struct * current
Definition at line 10 of file linklist.h.