Re: [PATCH v3 01/20] scripts: import more list macros

[Masahiro Yamada]

On Tue, Sep 24, 2024 at 3:19 AM Sami Tolvanen <samitolvanen@xxxxxxxxxx> wrote:
>
> Import list_is_first, list_is_last, list_replace, and list_replace_init.
>
> Signed-off-by: Sami Tolvanen <samitolvanen@xxxxxxxxxx>


This one was applied to linux-kbuild.
Thanks.


> ---
>  scripts/include/list.h | 50 ++++++++++++++++++++++++++++++++++++++++++
>  1 file changed, 50 insertions(+)
>
> diff --git a/scripts/include/list.h b/scripts/include/list.h
> index fea1e2b79063..8bdcaadca709 100644
> --- a/scripts/include/list.h
> +++ b/scripts/include/list.h
> @@ -127,6 +127,36 @@ static inline void list_del(struct list_head *entry)
>         entry->prev = LIST_POISON2;
>  }
>
> +/**
> + * list_replace - replace old entry by new one
> + * @old : the element to be replaced
> + * @new : the new element to insert
> + *
> + * If @old was empty, it will be overwritten.
> + */
> +static inline void list_replace(struct list_head *old,
> +                               struct list_head *new)
> +{
> +       new->next = old->next;
> +       new->next->prev = new;
> +       new->prev = old->prev;
> +       new->prev->next = new;
> +}
> +
> +/**
> + * list_replace_init - replace old entry by new one and initialize the old one
> + * @old : the element to be replaced
> + * @new : the new element to insert
> + *
> + * If @old was empty, it will be overwritten.
> + */
> +static inline void list_replace_init(struct list_head *old,
> +                                    struct list_head *new)
> +{
> +       list_replace(old, new);
> +       INIT_LIST_HEAD(old);
> +}
> +
>  /**
>   * list_move - delete from one list and add as another's head
>   * @list: the entry to move
> @@ -150,6 +180,26 @@ static inline void list_move_tail(struct list_head *list,
>         list_add_tail(list, head);
>  }
>
> +/**
> + * list_is_first -- tests whether @list is the first entry in list @head
> + * @list: the entry to test
> + * @head: the head of the list
> + */
> +static inline int list_is_first(const struct list_head *list, const struct list_head *head)
> +{
> +       return list->prev == head;
> +}
> +
> +/**
> + * list_is_last - tests whether @list is the last entry in list @head
> + * @list: the entry to test
> + * @head: the head of the list
> + */
> +static inline int list_is_last(const struct list_head *list, const struct list_head *head)
> +{
> +       return list->next == head;
> +}
> +
>  /**
>   * list_is_head - tests whether @list is the list @head
>   * @list: the entry to test
> --
> 2.46.0.792.g87dc391469-goog
>


-- 
Best Regards
Masahiro Yamada