[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <20071106180100.GJ8181@ftp.linux.org.uk>
Date: Tue, 6 Nov 2007 18:01:00 +0000
From: Al Viro <viro@....linux.org.uk>
To: Jan Kara <jack@...e.cz>
Cc: linux-kernel@...r.kernel.org, linux-ext4@...r.kernel.org
Subject: Re: [RFC] [PATCH 3/3] Recursive mtime for ext3
On Tue, Nov 06, 2007 at 06:19:45PM +0100, Jan Kara wrote:
> Implement recursive mtime (rtime) feature for ext3. The feature works as
> follows: In each directory we keep a flag EXT3_RTIME_FL (modifiable by a user)
> whether rtime should be updated. In case a directory or a file in it is
> modified and when the flag is set, directory's rtime is updated, the flag is
> cleared, and we move to the parent. If the flag is set there, we clear it,
> update rtime and continue upwards upto the root of the filesystem. In case a
> regular file or symlink is modified, we pick arbitrary of its parents (actually
> the one that happens to be at the head of i_dentry list) and start the rtime
> update algorith there.
*ewwww*
Nothing like undeterministic behaviour, is there?
> Intended use case is that application which wants to watch any modification in
> a subtree scans the subtree and sets flags for all inodes there. Next time, it
> just needs to recurse in directories having rtime newer than the start of the
> previous scan. There it can handle modifications and set the flag again. It is
> up to application to watch out for hardlinked files. It can e.g. build their
> list and check their mtime separately (when a hardlink to a file is created its
> inode is modified and rtimes properly updated and thus any application has an
> effective way of finding new hardlinked files).
You know, you can do that with aush^H^Hdit right now...
-
To unsubscribe from this list: send the line "unsubscribe linux-ext4" in
the body of a message to majordomo@...r.kernel.org
More majordomo info at http://vger.kernel.org/majordomo-info.html
Powered by blists - more mailing lists