Expand Minimize

RemoveTailList routine

The RemoveTailList routine removes an entry from the end of a doubly linked list of LIST_ENTRY structures.

Syntax


PLIST_ENTRY RemoveTailList(
  _Inout_  PLIST_ENTRY ListHead
);

Parameters

ListHead [in, out]

Pointer to the LIST_ENTRY structure that serves as the list header.

Return value

RemoveTailList returns a pointer to the entry that was at the tail of the list. If the list is empty, RemoveTailList returns ListHead.

Remarks

RemoveTailList removes the last entry from the list by setting ListHead->Blink to point to the second-to-last entry in the list. The routine sets the Flink member of the new first entry to ListHead. In the event the list is empty, this is effectively a no-op.

For information about using this routine when implementing a doubly linked list, see Singly and Doubly Linked Lists.

Callers of InsertHeadList can be running at any IRQL. If InsertHeadList is called at IRQL >= DISPATCH_LEVEL, the storage for ListHead and the list entries must be resident.

Requirements

Version

Available starting with Windows 2000.

Header

Wdm.h (include Wdm.h, Ntddk.h, or Ntifs.h)

IRQL

Any level (See Remarks section)

See also

InitializeListHead
IsListEmpty
RemoveHeadList
RemoveEntryList

 

 

Send comments about this topic to Microsoft

Show:
© 2014 Microsoft