Re: [RFC PATCH 8/8] f2fs-tools: remove unused list.h

[Chao Yu <yuchao0@huawei.com>]

On 2017/10/31 9:38, Sheng Yong wrote:
> Commit 7d96d138a378 ("fsck.f2fs: remove list.h") has already the usage
> of list.h. So let's remove list.h itself.
> 
> Signed-off-by: Sheng Yong <shengyong1@huawei.com>

Reviewed-by: Chao Yu <yuchao0@huawei.com>

Thanks,

> ---
>  include/list.h | 88 ----------------------------------------------------------
>  1 file changed, 88 deletions(-)
>  delete mode 100644 include/list.h
> 
> diff --git a/include/list.h b/include/list.h
> deleted file mode 100644
> index 571cd5c..0000000
> --- a/include/list.h
> +++ /dev/null
> @@ -1,88 +0,0 @@
> -
> -#define POISON_POINTER_DELTA 0
> -#define LIST_POISON1  ((void *) (0x00100100 + POISON_POINTER_DELTA))
> -#define LIST_POISON2  ((void *) (0x00200200 + POISON_POINTER_DELTA))
> -
> -#if !defined(offsetof)
> -#define offsetof(TYPE, MEMBER) ((size_t) &((TYPE *)0)->MEMBER)
> -#endif
> -#define container_of(ptr, type, member) ({                      \
> -		const typeof( ((type *)0)->member ) *__mptr = (ptr);    \
> -		(type *)( (char *)__mptr - offsetof(type,member) );})
> -
> -struct list_head {
> -	struct list_head *next, *prev;
> -};
> -
> -#define LIST_HEAD_INIT(name) { &(name), &(name) }
> -
> -#define LIST_HEAD(name) \
> -	struct list_head name = LIST_HEAD_INIT(name)
> -
> -static inline void INIT_LIST_HEAD(struct list_head *list)
> -{
> -	list->next = list;
> -	list->prev = list;
> -}
> -
> -static inline void __list_add(struct list_head *new,
> -		struct list_head *prev,
> -		struct list_head *next)
> -{
> -	next->prev = new;
> -	new->next = next;
> -	new->prev = prev;
> -	prev->next = new;
> -}
> -
> -static inline void list_add(struct list_head *new, struct list_head *head)
> -{
> -	__list_add(new, head, head->next);
> -}
> -
> -static inline void list_add_tail(struct list_head *new, struct list_head *head)
> -{
> -	__list_add(new, head->prev, head);
> -}
> -
> -static inline void __list_del(struct list_head * prev, struct list_head * next)
> -{
> -	next->prev = prev;
> -	prev->next = next;
> -}
> -
> -static inline void __list_del_entry(struct list_head *entry)
> -{
> -	__list_del(entry->prev, entry->next);
> -}
> -
> -static inline void list_del(struct list_head *entry)
> -{
> -	__list_del(entry->prev, entry->next);
> -	entry->next = LIST_POISON1;
> -	entry->prev = LIST_POISON2;
> -}
> -
> -static inline int list_empty(const struct list_head *head)
> -{
> -	return head->next == head;
> -}
> -
> -#define list_entry(ptr, type, member) \
> -	container_of(ptr, type, member)
> -
> -#define list_for_each(pos, head) \
> -	for (pos = (head)->next; pos != (head); pos = pos->next)
> -
> -#define list_for_each_safe(pos, n, head) \
> -	for (pos = (head)->next, n = pos->next; pos != (head); \
> -			pos = n, n = pos->next)
> -#define list_for_each_entry(pos, head, member)                          \
> -	for (pos = list_entry((head)->next, typeof(*pos), member);      \
> -			&pos->member != (head);    \
> -			pos = list_entry(pos->member.next, typeof(*pos), member))
> -#define list_for_each_entry_safe(pos, n, head, member)                  \
> -	for (pos = list_entry((head)->next, typeof(*pos), member),      \
> -			n = list_entry(pos->member.next, typeof(*pos), member); \
> -			&pos->member != (head);                                    \
> -			pos = n, n = list_entry(n->member.next, typeof(*n), member))
> 


------------------------------------------------------------------------------
Check out the vibrant tech community on one of the world's most
engaging tech sites, Slashdot.org! http://sdm.link/slashdot