Commit 5908cdc8 authored by Frederic Weisbecker's avatar Frederic Weisbecker
Browse files

list: Introduce list_rotate_left()

Bring a new list_rotate_left() helper that rotates a list to
the left. This is useful for codes that need to round roubin
elements which queue priority increases from tail to head.
Signed-off-by: default avatarFrederic Weisbecker <>
Acked-by: default avatarPeter Zijlstra <>
Cc: Paul Mackerras <>
Cc: Ingo Molnar <>
Cc: Arnaldo Carvalho de Melo <>
parent 889ff015
......@@ -205,6 +205,20 @@ static inline int list_empty_careful(const struct list_head *head)
return (next == head) && (next == head->prev);
* list_rotate_left - rotate the list to the left
* @head: the head of the list
static inline void list_rotate_left(struct list_head *head)
struct list_head *first;
if (!list_empty(head)) {
first = head->next;
list_move_tail(first, head);
* list_is_singular - tests whether a list has just one entry.
* @head: the list to test.
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment