lists.openwall.net   lists  /  announce  owl-users  owl-dev  john-users  john-dev  passwdqc-users  yescrypt  popa3d-users  /  oss-security  kernel-hardening  musl  sabotage  tlsify  passwords  /  crypt-dev  xvendor  /  Bugtraq  Full-Disclosure  linux-kernel  linux-netdev  linux-ext4  linux-hardening  linux-cve-announce  PHC 
Open Source and information security mailing list archives
 
Hash Suite: Windows password security audit tool. GUI, reports in PDF.
[<prev] [next>] [<thread-prev] [day] [month] [year] [list]
Date:	Mon, 6 Dec 2010 08:50:49 -0500
From:	Ted Ts'o <tytso@....edu>
To:	Avery Pennarun <apenwarr@...il.com>
Cc:	linux-kernel@...r.kernel.org
Subject: Re: posix_fadvise(POSIX_FADV_WILLNEED) waits before returning?

On Mon, Dec 06, 2010 at 05:17:24AM -0800, Avery Pennarun wrote:
> 
> My understanding is that readahead() is synchronous (it reads the
> pages, then it returns), but posix_fadvise(POSIX_FADV_WILLNEED) is
> asynchronous (it enqueues the pages for reading, but returns
> immediately).  The latter is the behaviour I want.  However, AFAICT
> the latter function is running synchronously - it does exactly the
> same thing as readahead() - which kind of defeats the point.  I've
> searched around in Google and everybody seems to claim that this
> function really does work in the background as it should, so I'm
> mystified.

readahead and posix_fadvise(POSIX_FADV_WILLNEED) work exactly the same
way, and in fact share mostly the same code path (see
force_page_cache_readahead() in mm/readahead.c).

They are asynchronous in that there is no guarantee the pages will be
in the page cache by the time they return.  But at the same time, they
are not guaranteed to be non-blocking.  That is, the work of doing the
readahead does not take place in a kernel thread.  So if you try to
request I/O than will fit in the request queue, the system call will
block until some I/O is completed so that more I/O requested cam be
loaded onto the request queue.

The only way to fix this would be to either put the work on a kernel
thread (i.e., some kind of workqueue) or in a userspace thread.  For
an application programmer wondering what to do today, I'd suggest the
latter since it will be more portable across various kernel versions.

This does leave the question about whether we should change the kernel
to allow readahead() and posix_fadvise(POSIX_FADV_WILLNEED) to be
non-blocking and do this work in a workqueue (or via some kind of
callback/continuation scheme).  My worry is just doing this if a user
application does something crazy, like request gigabytes and gigabytes
of readahead, and then repents of their craziness, there should be a
way of cancelling the readahead request.  Today, the user can just
kill the application.  But if we simply shove the work to a kernel
thread, it becomes a lot harder to cancel the readahead request.  We'd
have to invent a new API, and then have a way to know whether the user
has access to kill a particular readahead request, etc.

							- Ted

P.S.  Yes, I know force_page_cache_readahead() doesn't currently have
a check for signal_pending(current) to break out of its loop.  But it
should, and that's a fixable problem.  The problem with pushing
readahead work into kernel thread is a conceptual one; our current
API's give no way cancelling the readahead request today.

--
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/

Powered by blists - more mailing lists

Powered by Openwall GNU/*/Linux Powered by OpenVZ