Hello,
On Wed, Jun 01, 2022 at 02:15:46PM -0400, Waiman Long wrote:
It was mentioned in the commit log, but I will add a comment to repeat that.Oh yeah, I noticed that in the commit log, but I think it really warrants an
It is because lnode.next is used as a flag to indicate its presence in the
lockless list. By default, the first one that go into the lockless list will
have a NULL value in its next pointer. So I have to put a sentinel node that
to make sure that the next pointer is always non-NULL.
inline comment.
I don't have too strong an opinion. It just felt a bit disproportionate forThat is true. I was about thinking what race conditions can happen with+ * The retrieved blkg_iostat_set is immediately marked as not in theIsn't the above true for any sort of mechanism which tracking pending state?
+ * lockless list by clearing its node->next pointer. It could be put
+ * back into the list by a parallel update before the iostat's are
+ * finally flushed. So being in the list doesn't always mean it has new
+ * iostat's to be flushed.
+ */
You gotta clear the pending state before consuming so that you don't miss
the events which happen while data is being consumed.
these changes. The above comment is for the race that can happen which is
benign. I am remove it if you think it is necessary.
it to be sticking out like that. Maybe toning it down a little bit would
help?
Maybe we just need an rcu_read_lock_held() - does that cover irq beingYou are right that the comment is probably not quite right. I will put the+ /*Can you please elaborate on why this is safe?
+ * No RCU protection is needed as it is assumed that blkg_iostat_set's
+ * in the percpu lockless list won't go away until the flush is done.
+ */
rcu_read_lock/unlock() back in. However, we don't have a rcu iterator for
the lockless list. On the other hand, blkcg_rstat_flush() is now called with
irq disabled. So rcu_read_lock() is not technically needed.
disabled? I'm not sure what the rules are since the different rcu variants
got merged. Anyways, the right thing to do would be asserting and
documenting that the section is RCU protected.
As for llist not having rcu iterators. The llists aren't RCU protected or
assigned. What's RCU protected is the lifetime of the elements. That said,
we'd need an rmb after fetching llist_head to guarantee that the flusher
sees all the updates which took place before the node got added to the
llist, right?
Can you also add an explanation on how the pending llist is synchronized
against blkg destructions?