ca51a72133
The old doubly-linked list implementation had only support for very basic operations, i.e. add at head and remove. The new implementation is highly enhanced, allowing these operations: - initialize list - check if a node is the list's head - check if a node is the list's tail - check if the list is empty - get a reference to the head item in the list - get a reference to the next item in the list - add node to tail of list - add node to head of list - insert node after a node - insert node before a node - insert node at position based on condition - remove a specific node from a list - get the first node in a list The implementation is completely inline, since the operations are rather simple and do not warrant a function call. Change-Id: Id85c04e67f6a88b005390172f1276daa12bcf8ce Signed-off-by: Benjamin Walsh <benjamin.walsh@windriver.com> |
||
|---|---|---|
| .. | ||
| __assert.h | ||
| byteorder.h | ||
| dlist.h | ||
| lists.h | ||
| lists_c.h | ||
| printk.h | ||
| util.h | ||