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] [thread-next>] [day] [month] [year] [list]
Message-ID: <20090918221658.GB28781@mit.edu>
Date:	Fri, 18 Sep 2009 18:16:58 -0400
From:	Theodore Tso <tytso@....edu>
To:	Jim Meyering <jim@...ering.net>
Cc:	Linux Kernel Mailing List <linux-kernel@...r.kernel.org>
Subject: Re: efficient access to "rotational";  new fcntl?

On Fri, Sep 18, 2009 at 09:31:50PM +0200, Jim Meyering wrote:
>     chgrp, chmod, chown, chcon, du, rm: now all display linear performance,
>     even when operating on million-entry directories on ext3 and ext4 file
>     systems.  Before, they would exhibit O(N^2) performance, due to linear
>     per-entry seek time cost when operating on entries in readdir order.
>     Rm was improved directly, while the others inherit the improvement
>     from the newer version of fts in gnulib.

Excellent!  I didn't know that (since my userspace is still Ubuntu
9.04, which is still using coreutils 6.10).

> However, with e.g., an ext4 partition on non-rotational hardware like
> an SSD, that preprocessing is unnecessary and in fact wasted effort.
> I'd like to avoid the waste by querying the equivalent of
> /sys/.../rotational, via a syscall like fcntl or statvfs,
> given a file descriptor.

Have you benchmarked it both ways?  The preprocessing will cost some
extra CPU time, sure, but for a sufficiently large directory, or if
the user is deleting a very large directory hierarchy, such that "rm
-rf" spans multiple journal transactions, deleting the files in inode
order will still avoid some filesystem metadata blocks getting written
multiple times (which for SSD's, especially the crappier ones with
nasty write amplification factors) could show a performance impact.

> Is there an efficient way to get that single bit?

Not today; if it's really useful, we could add it, of course.  But how
much overhead are you trying to avoid by avoiding the pre-processing
before unlinking the files?

Regards,

						- Ted
--
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