[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <alpine.LRH.2.02.2101200951070.24430@file01.intranet.prod.int.rdu2.redhat.com>
Date: Wed, 20 Jan 2021 10:12:01 -0500 (EST)
From: Mikulas Patocka <mpatocka@...hat.com>
To: Jan Kara <jack@...e.cz>
cc: Dave Chinner <david@...morbit.com>,
Zhongwei Cai <sunrise_l@...u.edu.cn>,
"Theodore Ts'o" <tytso@....edu>,
Matthew Wilcox <willy@...radead.org>,
David Laight <David.Laight@...lab.com>,
Mingkai Dong <mingkaidong@...il.com>,
Andrew Morton <akpm@...ux-foundation.org>,
Steven Whitehouse <swhiteho@...hat.com>,
Eric Sandeen <esandeen@...hat.com>,
Dave Chinner <dchinner@...hat.com>,
Wang Jianchao <jianchao.wan9@...il.com>,
Rajesh Tadakamadla <rajesh.tadakamadla@....com>,
linux-kernel <linux-kernel@...r.kernel.org>,
linux-fsdevel <linux-fsdevel@...r.kernel.org>,
linux-nvdimm <linux-nvdimm@...ts.01.org>
Subject: Re: Expense of read_iter
On Wed, 20 Jan 2021, Jan Kara wrote:
> Yeah, I agree. I'm against ext4 private solution for this read problem. And
> I'm also against duplicating ->read_iter functionatily in ->read handler.
> The maintenance burden of this code duplication is IMHO just too big. We
> rather need to improve the generic code so that the fast path is faster.
> And every filesystem will benefit because this is not ext4 specific
> problem.
>
> Honza
Do you have some idea how to optimize the generic code that calls
->read_iter?
vfs_read calls ->read if it is present. If not, it calls new_sync_read.
new_sync_read's frame size is 128 bytes - it holds the structures iovec,
kiocb and iov_iter. new_sync_read calls ->read_iter.
I have found out that the cost of calling new_sync_read is 3.3%, Zhongwei
found out 3.9%. (the benchmark repeatedy reads the same 4k page)
I don't see any way how to optimize new_sync_read or how to reduce its
frame size. Do you?
Mikulas
Powered by blists - more mailing lists