From 98efdedc23f22a14dc0f908ad6ebe241013383db Mon Sep 17 00:00:00 2001 From: Andre Noll Date: Sat, 15 May 2021 15:56:06 +0200 Subject: [PATCH 1/1] list.h: Remove unused list_for_each_entry_safe_reverse. --- list.h | 12 ------------ 1 file changed, 12 deletions(-) diff --git a/list.h b/list.h index 66c6d915..fec9249d 100644 --- a/list.h +++ b/list.h @@ -181,18 +181,6 @@ static inline int list_empty(const struct list_head *head) n = list_entry(pos->member.next, typeof(*pos), member); \ &pos->member != (head); \ pos = n, n = list_entry(n->member.next, typeof(*n), member)) -/** - * iterate backwards over list of given type safe against removal of list entry - * \param pos the type * to use as a loop counter. - * \param n another type * to use as temporary storage - * \param head the head for your list. - * \param member the name of the list_struct within the struct. - */ -#define list_for_each_entry_safe_reverse(pos, n, head, member) \ - for (pos = list_entry((head)->prev, typeof(*pos), member), \ - n = list_entry(pos->member.prev, typeof(*pos), member); \ - &pos->member != (head); \ - pos = n, n = list_entry(n->member.prev, typeof(*n), member)) /** * Get the first element from a list -- 2.39.2