From: Byungchul Park <byungchul.park@lge.com>
To: peterz@infradead.org
Cc: linux-kernel@vger.kernel.org, kernel-team@lge.com,
viro@zeniv.linux.org.uk
Subject: Re: [RESEND PATCH] llist: Provide a safe version for llist_for_each
Date: Thu, 18 May 2017 10:58:11 +0900 [thread overview]
Message-ID: <20170518015811.GA28017@X58A-UD3R> (raw)
In-Reply-To: <1494549416-10539-1-git-send-email-byungchul.park@lge.com>
On Fri, May 12, 2017 at 09:36:56AM +0900, Byungchul Park wrote:
> Sometimes we have to dereference next field of llist node before entering
> loop becasue the node might be deleted or the next field might be
> modified within the loop. So this adds the safe version of llist_for_each,
> that is, llist_for_each_safe.
+cc viro@zeniv.linux.org.uk
>
> Signed-off-by: Byungchul Park <byungchul.park@lge.com>
> Reviewed-by: "Huang, Ying" <ying.huang@intel.com>
> ---
> include/linux/llist.h | 19 +++++++++++++++++++
> 1 file changed, 19 insertions(+)
>
> diff --git a/include/linux/llist.h b/include/linux/llist.h
> index fd4ca0b..b90c9f2 100644
> --- a/include/linux/llist.h
> +++ b/include/linux/llist.h
> @@ -105,6 +105,25 @@ static inline void init_llist_head(struct llist_head *list)
> for ((pos) = (node); pos; (pos) = (pos)->next)
>
> /**
> + * llist_for_each_safe - iterate over some deleted entries of a lock-less list
> + * safe against removal of list entry
> + * @pos: the &struct llist_node to use as a loop cursor
> + * @n: another &struct llist_node to use as temporary storage
> + * @node: the first entry of deleted list entries
> + *
> + * In general, some entries of the lock-less list can be traversed
> + * safely only after being deleted from list, so start with an entry
> + * instead of list head.
> + *
> + * If being used on entries deleted from lock-less list directly, the
> + * traverse order is from the newest to the oldest added entry. If
> + * you want to traverse from the oldest to the newest, you must
> + * reverse the order by yourself before traversing.
> + */
> +#define llist_for_each_safe(pos, n, node) \
> + for ((pos) = (node); (pos) && ((n) = (pos)->next, true); (pos) = (n))
> +
> +/**
> * llist_for_each_entry - iterate over some deleted entries of lock-less list of given type
> * @pos: the type * to use as a loop cursor.
> * @node: the fist entry of deleted list entries.
> --
> 1.9.1
next prev parent reply other threads:[~2017-05-18 1:58 UTC|newest]
Thread overview: 6+ messages / expand[flat|nested] mbox.gz Atom feed top
2017-05-12 0:36 Byungchul Park
2017-05-12 5:55 ` [RESEND PATCH] mm: Don't reinvent the wheel but use existing llist API Byungchul Park
2017-05-18 1:58 ` Byungchul Park [this message]
2017-05-18 2:03 ` [RESEND PATCH] llist: Provide a safe version for llist_for_each Byungchul Park
2017-05-18 8:36 ` Peter Zijlstra
2017-05-23 8:43 ` [tip:sched/core] llist: Provide a safe version for llist_for_each() tip-bot for Byungchul Park
Reply instructions:
You may reply publicly to this message via plain-text email
using any one of the following methods:
* Save the following mbox file, import it into your mail client,
and reply-to-all from there: mbox
Avoid top-posting and favor interleaved quoting:
https://en.wikipedia.org/wiki/Posting_style#Interleaved_style
* Reply using the --to, --cc, and --in-reply-to
switches of git-send-email(1):
git send-email \
--in-reply-to=20170518015811.GA28017@X58A-UD3R \
--to=byungchul.park@lge.com \
--cc=kernel-team@lge.com \
--cc=linux-kernel@vger.kernel.org \
--cc=peterz@infradead.org \
--cc=viro@zeniv.linux.org.uk \
/path/to/YOUR_REPLY
https://kernel.org/pub/software/scm/git/docs/git-send-email.html
* If your mail client supports setting the In-Reply-To header
via mailto: links, try the mailto: link
Be sure your reply has a Subject: header at the top and a blank line
before the message body.
This is a public inbox, see mirroring instructions
for how to clone and mirror all data and code used for this inbox
Powered by JetHome