hollalinux
/
linux-sg2042
mirror of https://github.com/sophgo/linux-riscv.git
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

list: introduce list_last_entry(), use list_{first,last}_entry() 

We already have list_first_entry(), it makes sense to also add
list_last_entry() for consistency.  And we use both helpers in
list_for_each_*().

Signed-off-by: Oleg Nesterov <oleg@redhat.com>
Cc: Eilon Greenstein <eilong@broadcom.com>
Cc: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
Cc: Peter Zijlstra <a.p.zijlstra@chello.nl>
Signed-off-by: Andrew Morton <akpm@linux-foundation.org>
Signed-off-by: Linus Torvalds <torvalds@linux-foundation.org>
This commit is contained in:
Oleg Nesterov 2013-11-12 15:10:03 -08:00 committed by Linus Torvalds
parent 8120e2e514
commit 93be3c2eb3
1 changed files with 15 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

19
include/linux/list.h
View File

@ -361,6 +361,17 @@ static inline void list_splice_tail_init(struct list_head *list,
#define list_first_entry(ptr, type, member) \ #define list_first_entry(ptr, type, member) \
list_entry((ptr)->next, type, member) list_entry((ptr)->next, type, member)
/**
* list_last_entry - get the last element from a list
* @ptr: the list head to take the element from.
* @type: the type of the struct this is embedded in.
* @member: the name of the list_struct within the struct.
*
* Note, that list is expected to be not empty.
*/
#define list_last_entry(ptr, type, member) \
list_entry((ptr)->prev, type, member)
/** /**
* list_first_entry_or_null - get the first element from a list * list_first_entry_or_null - get the first element from a list
* @ptr: the list head to take the element from. * @ptr: the list head to take the element from.
@ -432,7 +443,7 @@ static inline void list_splice_tail_init(struct list_head *list,
* @member: the name of the list_struct within the struct. * @member: the name of the list_struct within the struct.
*/ */
#define list_for_each_entry(pos, head, member) \ #define list_for_each_entry(pos, head, member) \
for (pos = list_entry((head)->next, typeof(*pos), member); \ for (pos = list_first_entry(head, typeof(*pos), member); \
&pos->member != (head); \ &pos->member != (head); \
pos = list_next_entry(pos, member)) pos = list_next_entry(pos, member))
@ -443,7 +454,7 @@ static inline void list_splice_tail_init(struct list_head *list,
* @member: the name of the list_struct within the struct. * @member: the name of the list_struct within the struct.
*/ */
#define list_for_each_entry_reverse(pos, head, member) \ #define list_for_each_entry_reverse(pos, head, member) \
for (pos = list_entry((head)->prev, typeof(*pos), member); \ for (pos = list_last_entry(head, typeof(*pos), member); \
&pos->member != (head); \ &pos->member != (head); \
pos = list_prev_entry(pos, member)) pos = list_prev_entry(pos, member))
@ -506,7 +517,7 @@ static inline void list_splice_tail_init(struct list_head *list,
* @member: the name of the list_struct within the struct. * @member: the name of the list_struct within the struct.
*/ */
#define list_for_each_entry_safe(pos, n, head, member) \ #define list_for_each_entry_safe(pos, n, head, member) \
for (pos = list_entry((head)->next, typeof(*pos), member), \ for (pos = list_first_entry(head, typeof(*pos), member), \
n = list_next_entry(pos, member); \ n = list_next_entry(pos, member); \
&pos->member != (head); \ &pos->member != (head); \
pos = n, n = list_next_entry(n, member)) pos = n, n = list_next_entry(n, member))
@ -553,7 +564,7 @@ static inline void list_splice_tail_init(struct list_head *list,
* of list entry. * of list entry.
*/ */
#define list_for_each_entry_safe_reverse(pos, n, head, member) \ #define list_for_each_entry_safe_reverse(pos, n, head, member) \
for (pos = list_entry((head)->prev, typeof(*pos), member), \ for (pos = list_last_entry(head, typeof(*pos), member), \
n = list_prev_entry(pos, member); \ n = list_prev_entry(pos, member); \
&pos->member != (head); \ &pos->member != (head); \
pos = n, n = list_prev_entry(n, member)) pos = n, n = list_prev_entry(n, member))