Lines Matching full:priority
2 * Descending-priority-sorted double-linked list
19 * This is a priority-sorted list of nodes; each node has a
20 * priority from INT_MIN (highest) to INT_MAX (lowest).
22 * Addition is O(K), removal is O(1), change of priority of a node is
23 * O(K) and K is the number of RT priority levels used in the system.
28 * - The tier 1 list is the prio_list, different priority nodes.
44 * The nodes on the prio_list list are sorted by priority to simplify
48 * The nodes on the node_list is ordered by priority and can contain
49 * entries which have the same priority. Those entries are ordered
53 * for the priority of the node and insert it before the node_list
55 * that priority, add it to the prio_list in the right position and
61 * entries of the same priority are on the list or not. If there
62 * is another entry of the same priority then this entry has to
64 * is removed is the only entry of this priority then a simple
67 * INT_MIN is the highest priority, 0 is the medium highest, INT_MAX
68 * is lowest priority.
115 * @__prio: initial node priority
142 * @prio: initial node priority
236 * plist_first - return the first node (and thus, highest priority)
