Insert a wrapped object into a list specified by a head node node is the inserted dlnode nhead is the new head node ntail is the new tail node.

Loop the list and apply fn on each node head is the head node of a list fn is operation applied to each node during iterating.

linkLocker is the outer locker to guard dlist access.

MB.

MB.

MB.

MB.

A few allocators for TAE.

optimize for saving space.

Doubly sorted linked-list node.

Sorted doubly linked-list.

Sorted doubly linked-list iterator.

ID is the general identifier type shared by different types like table, object, block, etc.

general sampler.

SLLNode represent a single node in linked list.

IRef is the general representation of the resources that should be managed with a reference count.