# InsertNodeFromTail

Inserts a node into a list.

### Synopsis

`void InsertNodeFromTail( List *l, Node *n )`

### Description

This procedure inserts a new node into a list. The order of nodes in a list is 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 tail of the list, and inserts the new node immediately before the nodes whose priority is lower. If there are no nodes in the list whose priority is lower, the node is added at the head of the list.

### Arguments

l
  A pointer to the list into which to insert the node.

n
  A pointer to the node to insert.

### Implementation

Folio call implemented in kernel folio V20.

### Associated Files

list.h
  ANSI C Prototype

clib.lib
  ARM Link Library

### Notes

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.

### See Also

``AddHead`(), AddTail(), RemHead(), RemNode(), RemTail(), InsertNodeFromHead(), UniversalInsertNode()`

#