lkml.org 
[lkml]   [2005]   [Aug]   [25]   [last100]   RSS Feed
Views: [wrap][no wrap]   [headers]  [forward] 
 
Messages in this thread
/
Date
From
SubjectRe: dnotify/inotify and vfs questions
Ian Campbell wrote:
> On Tue, 2005-08-23 at 16:23 +0100, Jamie Lokier wrote:
> > <receive some request>...
> > if (any_dnotify_or_inotify_events_pending) {
> > read_dnotify_or_inotify_events();
> > if (any_events_related_to(file)) {
> > store_in_userspace_stat_cache(file, stat(file));
> > }
> > }
> > stat_info = lookup_userspace_stat_cache(file);
> >
> > Now that's a silly way to save one system call in the fast path by itself.
>
> I'm not that familiar with inotify internals but doesn't
> read_dnotify_or_inotify_events() or
> any_dnotify_or_inotify_events_pending() involve a syscall?

The fast path is just any_dnotify_or_inotify_events_pending: there
aren't any relevant events pending in the fast path.

There's a few methods of doing this for free per individual stat cache check.

1. Signal handler.

dnotify: Check a variable set by the signal handler.

[ There's a small time window between dnotify sending the
signal and the receiving thread noticing on an SMP system due
to the IPI, during which the sending task might have another
way to signal the recieving task that it's finished some
operation, so this method of using dnotify to invalidate a
stat cache only has the correct ordering properties on UP systems. ]

This works because dnotify signals are thread-specific,
so the checking thread will definitely have received the
signal after the time another process modifies the file.

inotify: Disappointingly inotify doesn't support SIGIO readiness :(

2. If you have to mix the test with a poll/select/epoll/rtsig fd waiting
for some other purpose. For example: a file/web/local server, where the
constraint is only that each stat() to revalidate a cached response
appears to happen any time after the beginning of receiving the
network request is known.

dnotify: It's free if you were using sigtimedwait anyway for I/O events,
provided you completely read the queue, or get the signal
priority right.

inotify: It's free if you were using poll/select/epoll anyway for I/O
events, provided in the case of epoll that you completely
read the queue, or use a two-level queue.

3. Amortising the test over many stat cache checks.

Even if you must use a system call to check for any pending events,
for revalidating an object which depends on multiple files, only
one call is needed for all of the stat cache checks.

More generally (this is more flexible), you can separate the notion
of "cache time checkpoint" from "cache validation". It's enough to
know that a stat result was valid any time between the checkpoint
time, and the current time. That's how I'm implementing the
file/web/local server case described above in step 2. Then the
events only need to be checked once during that time interval, no
matter how many complex objects are being revalidated.

It gets slightly more efficient when you have multiple, overlapping
checkpoint->validation time intervals due to multiple outstanding
requests being processed concurrently.

As I explained in the previous mail, all this is absolutely pointless
to save one system call. It's a lot of work for negligable gain.

The point is when it saves lots of calls and userspace logic together,
for things like web page templates and compiled programs, which depend
on many files which can be revalidated in a small number of operations.

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

\
 
 \ /
  Last update: 2005-08-25 17:00    [W:0.116 / U:1.020 seconds]
©2003-2017 Jasper Spaans. hosted at Digital OceanAdvertise on this site