llist: Add llist_next()

So we don't have to expose the struct list_node member.

Cc: Huang Ying <[email protected]>
Cc: Andrew Morton <[email protected]>
Signed-off-by: Peter Zijlstra <[email protected]>
Link: http://lkml.kernel.org/r/1315836348.26517.41.camel@twins
Signed-off-by: Ingo Molnar <[email protected]>
This commit is contained in:
Peter Zijlstra authored and Ingo Molnar committed 2011-10-04 12:43:53 +02:00
1 parent 38aaf8090d
commit 924f8f5af3
2 files changed
+6 -1

No files matched your search

+5
View File
@@ -138,6 +138,11 @@ static inline bool llist_empty(const struct llist_head *head)
return ACCESS_ONCE(head->first) == NULL;
}
static inline struct llist_node *llist_next(struct llist_node *node)
{
return node->next;
}
/**
* llist_add - add a new entry
* @new: new entry to be added
+1 -1
View File
@@ -110,7 +110,7 @@ void irq_work_run(void)
while (llnode != NULL) {
work = llist_entry(llnode, struct irq_work, llnode);
llnode = llnode->next;
llnode = llist_next(llnode);
/*
* Clear the PENDING bit, after this point the @work