Returns a pointer to a node appearing at a given ordinal position from the tail of the list.

Node *FindNodeFromTail(const List *l, uint32 position);

This function scans the supplied list and returns a pointer to the node appearing in the list at the given ordinal position counting from the end of the list. NULL is returned if the list doesn't contain that many items.

• l A pointer to the list to scan for the node.

• position The node position to look for, relative to the end of the list.

A pointer to the node found, or NULL if the list doesn't contain enough nodes.

Convenience call implemented in clib.lib V24.

• list.h ANSI C Prototype

• clib.lib ARM Link Library

GIGO (garbage in, garbage out)

AddHead(), AddTail(), InsertNodeFromHead(), InsertNodeFromTail(), RemHead(), RemNode(), RemTail()