Lines Matching full:priority

3  * Descending-priority-sorted double-linked list
18  * This is a priority-sorted list of nodes; each node has a
19  * priority from INT_MIN (highest) to INT_MAX (lowest).
21  * Addition is O(K), removal is O(1), change of priority of a node is
22  * O(K) and K is the number of RT priority levels used in the system.
27  *  - The tier 1 list is the prio_list, different priority nodes.
45  * The nodes on the prio_list list are sorted by priority to simplify
49  * The nodes on the node_list are ordered by priority and can contain
50  * entries which have the same priority. Those entries are ordered
54  * for the priority of the node and insert it before the node_list
56  * that priority, add it to the prio_list in the right position and
62  * entries of the same priority are on the list or not. If there
63  * is another entry of the same priority then this entry has to
65  * is removed is the only entry of this priority then a simple
68  * INT_MIN is the highest priority, 0 is the medium highest, INT_MAX
69  * is lowest priority.
101  * @__prio:	initial node priority
123  * @prio:	initial node priority
268  * plist_first - return the first node (and thus, highest priority)
280  * plist_last - return the last node (and thus, lowest priority)