| 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
| ||
|
Date: Tue, 25 Aug 2009 14:13:56 +0200 From: Pavel Machek <pavel@....cz> To: Jeff Shanab <jshanab@...thlink.net> Cc: linux-kernel@...r.kernel.org, jack@...e.cz Subject: Re: Starting a grad project that may change kernel VFS. Early research > 2) Second Question. The two part idea. > I was thinking that a good way to handle this is that it starts with > a file change in a directory. The directory entry contains a sum already > for itself and all the subdirs and an adjustment is made immediately to > that, it should be in the cache. Then we queue up the change to be sent > to the parent(s?). These queued up events should be a low priority at a > more human time like 1 second. If a large number of changes come to a > directory, multiple adjustments hit the queue with the same (directory > name, inode #?) and early ones are thrown out. So levels above would see > at most a 1 per second low priority update. > > So when you issue a 'du -sh' or use anything that uses stat like > filelight, it can get the size of all the subdirs without actually > recursing through them, they have been built up over time. I'd suggest you look at jack's recursive mtime idea, and then implement your features on top of that, in userland. -- (english) http://www.livejournal.com/~pavelmachek (cesky, pictures) http://atrey.karlin.mff.cuni.cz/~pavel/picture/horses/blog.html -- 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