Inserts a node into a list.
void InsertNodeFromHead( List *l, Node *n )
This procedure inserts a new node into a list. The order of nodes in a list is normally determined by their priority. The procedure compares the priority of the new node to the priorities of nodes currently in the list, beginning at the head of the list, and inserts the new node immediately after all nodes whose priority is higher. If the priorities of all the nodes in the list are higher, the node is added at the end of the list.
Folio call implemented in kernel folio V20.
To arrange the nodes in a list by a value or values other than priority, use UniversalInsertNode()
.
A node can only be included in one list.
AddHead
(), AddTail(), RemHead(), RemNode(), RemTail(), InsertNodeFromTail(), UniversalInsertNode()