This procedure changes the priority of a node in a list. The kernel arranges lists by priority, with higher-priority nodes coming before lower-priority nodes. When the priority of a node changes, the kernel automatically rearranges the list to reflect the new priority. The node is moved immediately before the first node whose priority is lower.
Arguments
n
A pointer to the node whose priority to change.
newpri
The new priority for the node. This can be a value from 0 to 255.
Return Value
The procedure returns the previous priority of the node.