linux-fsdevel.vger.kernel.org archive mirror
 help / color / mirror / Atom feed
From: Brian Foster <bfoster@redhat.com>
To: "Darrick J. Wong" <djwong@kernel.org>
Cc: linux-fsdevel@vger.kernel.org, linux-xfs@vger.kernel.org,
	Christoph Hellwig <hch@infradead.org>
Subject: Re: [PATCH v5 09/10] iomap: advance the iter directly on unshare range
Date: Wed, 5 Feb 2025 15:27:31 -0500	[thread overview]
Message-ID: <Z6PJs8RvbcfNJNcC@bfoster> (raw)
In-Reply-To: <20250205191610.GS21808@frogsfrogsfrogs>

On Wed, Feb 05, 2025 at 11:16:10AM -0800, Darrick J. Wong wrote:
> On Wed, Feb 05, 2025 at 08:58:20AM -0500, Brian Foster wrote:
> > Modify unshare range to advance the iter directly. Replace the local
> > pos and length calculations with direct advances and loop based on
> > iter state instead.
> > 
> > Signed-off-by: Brian Foster <bfoster@redhat.com>
> > Reviewed-by: Christoph Hellwig <hch@lst.de>
> > ---
> >  fs/iomap/buffered-io.c | 23 +++++++++++------------
> >  1 file changed, 11 insertions(+), 12 deletions(-)
> > 
> > diff --git a/fs/iomap/buffered-io.c b/fs/iomap/buffered-io.c
> > index 678c189faa58..f953bf66beb1 100644
> > --- a/fs/iomap/buffered-io.c
> > +++ b/fs/iomap/buffered-io.c
> > @@ -1267,20 +1267,19 @@ EXPORT_SYMBOL_GPL(iomap_write_delalloc_release);
> >  static loff_t iomap_unshare_iter(struct iomap_iter *iter)
> >  {
> >  	struct iomap *iomap = &iter->iomap;
> > -	loff_t pos = iter->pos;
> > -	loff_t length = iomap_length(iter);
> > -	loff_t written = 0;
> > +	u64 bytes = iomap_length(iter);
> > +	int status;
> >  
> >  	if (!iomap_want_unshare_iter(iter))
> > -		return length;
> > +		return iomap_iter_advance(iter, &bytes);
> >  
> >  	do {
> >  		struct folio *folio;
> > -		int status;
> >  		size_t offset;
> > -		size_t bytes = min_t(u64, SIZE_MAX, length);
> > +		loff_t pos = iter->pos;
> 
> Do we still need the local variable here?
> 

Technically no.. Christoph brought up something similar in earlier
versions re: the pos/len variables (here and in subsequent patches) but
I'm leaving it like this for now because the folio batch work (which is
the impetus for this series) further refactors and removes much of this.

For example, pos gets pushed down into the write begin path so it can
manage state between the next folio in a provided batch and the current
position of the iter itself. So this pos code goes away from
unshare_iter() completely and this patch is just moving things one step
in that direction.

> Otherwise looks right to me, so
> Reviewed-by: "Darrick J. Wong" <djwong@kernel.org>
> 

Thanks.

Brian

> --D
> 
> >  		bool ret;
> >  
> > +		bytes = min_t(u64, SIZE_MAX, bytes);
> >  		status = iomap_write_begin(iter, pos, bytes, &folio);
> >  		if (unlikely(status))
> >  			return status;
> > @@ -1298,14 +1297,14 @@ static loff_t iomap_unshare_iter(struct iomap_iter *iter)
> >  
> >  		cond_resched();
> >  
> > -		pos += bytes;
> > -		written += bytes;
> > -		length -= bytes;
> > -
> >  		balance_dirty_pages_ratelimited(iter->inode->i_mapping);
> > -	} while (length > 0);
> >  
> > -	return written;
> > +		status = iomap_iter_advance(iter, &bytes);
> > +		if (status)
> > +			break;
> > +	} while (bytes > 0);
> > +
> > +	return status;
> >  }
> >  
> >  int
> > -- 
> > 2.48.1
> > 
> > 
> 


  reply	other threads:[~2025-02-05 20:25 UTC|newest]

Thread overview: 25+ messages / expand[flat|nested]  mbox.gz  Atom feed  top
2025-02-05 13:58 [PATCH v5 00/10] iomap: incremental per-operation iter advance Brian Foster
2025-02-05 13:58 ` [PATCH v5 01/10] iomap: factor out iomap length helper Brian Foster
2025-02-05 18:49   ` Darrick J. Wong
2025-02-05 13:58 ` [PATCH v5 02/10] iomap: split out iomap check and reset logic from iter advance Brian Foster
2025-02-05 13:58 ` [PATCH v5 03/10] iomap: refactor iomap_iter() length check and tracepoint Brian Foster
2025-02-05 18:50   ` Darrick J. Wong
2025-02-05 13:58 ` [PATCH v5 04/10] iomap: lift error code check out of iomap_iter_advance() Brian Foster
2025-02-05 18:51   ` Darrick J. Wong
2025-02-05 13:58 ` [PATCH v5 05/10] iomap: lift iter termination logic from iomap_iter_advance() Brian Foster
2025-02-05 19:00   ` Darrick J. Wong
2025-02-05 20:25     ` Brian Foster
2025-02-05 13:58 ` [PATCH v5 06/10] iomap: export iomap_iter_advance() and return remaining length Brian Foster
2025-02-05 18:58   ` Darrick J. Wong
2025-02-05 20:25     ` Brian Foster
2025-02-05 13:58 ` [PATCH v5 07/10] iomap: support incremental iomap_iter advances Brian Foster
2025-02-05 19:10   ` Darrick J. Wong
2025-02-05 20:26     ` Brian Foster
2025-02-05 13:58 ` [PATCH v5 08/10] iomap: advance the iter directly on buffered writes Brian Foster
2025-02-05 19:17   ` Darrick J. Wong
2025-02-05 13:58 ` [PATCH v5 09/10] iomap: advance the iter directly on unshare range Brian Foster
2025-02-05 19:16   ` Darrick J. Wong
2025-02-05 20:27     ` Brian Foster [this message]
2025-02-05 20:44       ` Darrick J. Wong
2025-02-05 13:58 ` [PATCH v5 10/10] iomap: advance the iter directly on zero range Brian Foster
2025-02-05 19:15   ` Darrick J. Wong

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=Z6PJs8RvbcfNJNcC@bfoster \
    --to=bfoster@redhat.com \
    --cc=djwong@kernel.org \
    --cc=hch@infradead.org \
    --cc=linux-fsdevel@vger.kernel.org \
    --cc=linux-xfs@vger.kernel.org \
    /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;
as well as URLs for NNTP newsgroup(s).