On Mon, Nov 16, 2020 at 11:18:16AM +0100, Mauro Carvalho Chehab wrote:
> hlist_add_behing -> hlist_add_behind
>
> Signed-off-by: Mauro Carvalho Chehab <mchehab+huawei@xxxxxxxxxx>
Queued, thank you!
Or if you would prefer pushing it yourself:
Reviewed-by: Paul E. McKenney <paulmck@xxxxxxxxxx>
Either way, please let me know.
Thanx, Paul
> ---
> include/linux/list.h | 2 +-
> 1 file changed, 1 insertion(+), 1 deletion(-)
>
> diff --git a/include/linux/list.h b/include/linux/list.h
> index 89bdc92e75c3..f2af4b4aa4e9 100644
> --- a/include/linux/list.h
> +++ b/include/linux/list.h
> @@ -884,41 +884,41 @@ static inline void hlist_add_head(struct hlist_node *n, struct hlist_head *h)
> WRITE_ONCE(first->pprev, &n->next);
> WRITE_ONCE(h->first, n);
> WRITE_ONCE(n->pprev, &h->first);
> }
>
> /**
> * hlist_add_before - add a new entry before the one specified
> * @n: new entry to be added
> * @next: hlist node to add it before, which must be non-NULL
> */
> static inline void hlist_add_before(struct hlist_node *n,
> struct hlist_node *next)
> {
> WRITE_ONCE(n->pprev, next->pprev);
> WRITE_ONCE(n->next, next);
> WRITE_ONCE(next->pprev, &n->next);
> WRITE_ONCE(*(n->pprev), n);
> }
>
> /**
> - * hlist_add_behing - add a new entry after the one specified
> + * hlist_add_behind - add a new entry after the one specified
> * @n: new entry to be added
> * @prev: hlist node to add it after, which must be non-NULL
> */
> static inline void hlist_add_behind(struct hlist_node *n,
> struct hlist_node *prev)
> {
> WRITE_ONCE(n->next, prev->next);
> WRITE_ONCE(prev->next, n);
> WRITE_ONCE(n->pprev, &prev->next);
>
> if (n->next)
> WRITE_ONCE(n->next->pprev, &n->next);
> }
>
> /**
> * hlist_add_fake - create a fake hlist consisting of a single headless node
> * @n: Node to make a fake list out of
> *
> * This makes @n appear to be its own predecessor on a headless hlist.
> * The point of this is to allow things like hlist_del() to work correctly
> --
> 2.28.0
>
