Commit ee29e620 authored by Masahiro Yamada's avatar Masahiro Yamada
Browse files

kconfig: import list_move(_tail) and list_for_each_entry_reverse macros 



Import more macros from include/linux/list.h.

These will be used in the next commit.

Signed-off-by: default avatarMasahiro Yamada <masahiroy@kernel.org>
parent 17c31ade

scripts/kconfig/list.h

+53 −0
Original line number Diff line number Diff line
@@ -127,6 +127,29 @@ static inline void list_del(struct list_head *entry) 
	entry->prev = LIST_POISON2;

}



/**

 * list_move - delete from one list and add as another's head

 * @list: the entry to move

 * @head: the head that will precede our entry

 */

static inline void list_move(struct list_head *list, struct list_head *head)

{

	__list_del_entry(list);

	list_add(list, head);

}



/**

 * list_move_tail - delete from one list and add as another's tail

 * @list: the entry to move

 * @head: the head that will follow our entry

 */

static inline void list_move_tail(struct list_head *list,

				  struct list_head *head)

{

	__list_del_entry(list);

	list_add_tail(list, head);

}



/**

 * list_is_head - tests whether @list is the list @head

 * @list: the entry to test
@@ -166,6 +189,17 @@ static inline int list_empty(const struct list_head *head) 
#define list_first_entry(ptr, 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_head 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_next_entry - get the next element in list

 * @pos:	the type * to cursor
@@ -174,6 +208,14 @@ static inline int list_empty(const struct list_head *head) 
#define list_next_entry(pos, member) \

	list_entry((pos)->member.next, typeof(*(pos)), member)



/**

 * list_prev_entry - get the prev element in list

 * @pos:	the type * to cursor

 * @member:	the name of the list_head within the struct.

 */

#define list_prev_entry(pos, member) \

	list_entry((pos)->member.prev, typeof(*(pos)), member)



/**

 * list_entry_is_head - test if the entry points to the head of the list

 * @pos:	the type * to cursor
@@ -194,6 +236,17 @@ static inline int list_empty(const struct list_head *head) 
	     !list_entry_is_head(pos, head, member);			\

	     pos = list_next_entry(pos, member))



/**

 * list_for_each_entry_reverse - iterate backwards over list of given type.

 * @pos:	the type * to use as a loop cursor.

 * @head:	the head for your list.

 * @member:	the name of the list_head within the struct.

 */

#define list_for_each_entry_reverse(pos, head, member)			\

	for (pos = list_last_entry(head, typeof(*pos), member);		\

	     !list_entry_is_head(pos, head, member); 			\

	     pos = list_prev_entry(pos, member))



/**

 * list_for_each_entry_safe - iterate over list of given type. Safe against removal of list entry

 * @pos:	the type * to use as a loop cursor.