X-Git-Url: https://git.whamcloud.com/?a=blobdiff_plain;f=lnet%2Finclude%2Flnet%2Flist.h;h=37d995265abd8c93d451945f9b12448ebc787ee3;hb=64cd6738edccfefb928825112da62b2a44db284e;hp=57713cb637ed3c725954ef16a7793a073966d4cf;hpb=c5050e412572b00cbe93d8517d2d1f767bebfa92;p=fs%2Flustre-release.git diff --git a/lnet/include/lnet/list.h b/lnet/include/lnet/list.h index 57713cb..37d9952 100644 --- a/lnet/include/lnet/list.h +++ b/lnet/include/lnet/list.h @@ -1,5 +1,4 @@ #ifndef _LINUX_LIST_H - /* * Simple doubly linked list implementation. * @@ -10,8 +9,6 @@ * using the generic single-entry routines. */ -#define prefetch(a) ((void)a) - struct list_head { struct list_head *next, *prev; }; @@ -195,8 +192,7 @@ static inline void list_splice_init(struct list_head *list, * @head: the head for your list. */ #define list_for_each(pos, head) \ - for (pos = (head)->next, prefetch(pos->next); pos != (head); \ - pos = pos->next, prefetch(pos->next)) + for (pos = (head)->next ; pos != (head); pos = pos->next ) /** * list_for_each_prev - iterate over a list in reverse order @@ -204,8 +200,7 @@ static inline void list_splice_init(struct list_head *list, * @head: the head for your list. */ #define list_for_each_prev(pos, head) \ - for (pos = (head)->prev, prefetch(pos->prev); pos != (head); \ - pos = pos->prev, prefetch(pos->prev)) + for (pos = (head)->prev ; pos != (head); pos = pos->prev) /** * list_for_each_safe - iterate over a list safe against removal of list entry @@ -227,11 +222,9 @@ static inline void list_splice_init(struct list_head *list, * @member: the name of the list_struct within the struct. */ #define list_for_each_entry(pos, head, member) \ - for (pos = list_entry((head)->next, typeof(*pos), member), \ - prefetch(pos->member.next); \ + for (pos = list_entry((head)->next, typeof(*pos), member); \ &pos->member != (head); \ - pos = list_entry(pos->member.next, typeof(*pos), member), \ - prefetch(pos->member.next)) + pos = list_entry(pos->member.next, typeof(*pos), member)) #endif #ifndef list_for_each_entry_safe