Partager via


NdisInterlockedInsertHeadList (Windows CE 5.0)

Send Feedback

This function inserts an entry, usually a packet, at the head of a doubly linked list so that access to the list is synchronized.

PLIST_ENTRY NdisInterlockedInsertHeadList(PLIST_ENTRYListHead,PLIST_ENTRYListEntry,PNDIS_SPIN_LOCKSpinLock);

Parameters

  • ListHead
    [in] Pointer to the head of the doubly linked list into which an entry is to be inserted.
  • ListEntry
    [in] Pointer to the entry to be inserted at the head of the list.
  • SpinLock
    [in] Pointer to a caller-supplied spin lock used to synchronize access to the list.

Return Values

Returns a pointer to the entry that was at the head of the queue before the specified entry was inserted. If the queue was empty, it returns NULL.

Remarks

Before calling this function, a driver must initialize the variable at ListHead with the NdisInitializeListHead function and the variable at SpinLock with the NdisAllocateSpinLock function. The driver must also provide resident storage for these variables and for its internal queue.

The caller-supplied spin lock prevents any other function from accessing the driver's internal queue while this function is inserting the specified entry, even when the driver is running on a multiprocessor machine.

Most NDIS drivers process packets in first-in, first-out (FIFO) order, so any driver that uses an interlocked queue tends to call the NdisInterlockedInsertTailList function far more frequently than this function. Such a driver usually calls this function only to re-queue a packet for a retry operation.

To convert a returned value back to the address of the inserted entry, a driver can use the CONTAINING_RECORD macro.

Requirements

OS Versions: Windows CE .NET 4.0 and later.
Header: Ndis.h.
Link Library: Ndis.lib

See Also

CONTAINING_RECORD | NdisAllocateSpinLock | NdisInitializeListHead | NdisInterlockedInsertTailList | NdisInterlockedRemoveHeadList

Send Feedback on this topic to the authors

Feedback FAQs

© 2006 Microsoft Corporation. All rights reserved.