I like this script a lot; very handy. It was taking too
long on some of my larger directory trees, though,
so I took the
liberty of
speeding it up. The following does the sorting in
Perl, and also calculates the sum internally to eliminate
the '.' from the du call. This saves du from having to
walk the directory tree twice (once for '.' and once for
the individual '*' arguments) and sped things up a lot for me.
#! /usr/bin/env perl
open(DU, "du -sk *|") || die "Can't exec du: $!\n";
while (<DU>) {
($size, $inode)=split;
chop($size);
$sum += $size;
push @entries, { size => $size, inode => $inode };
}
close(DU);
@entries = sort { $b->{size} <=> $a->{size} } @entries;
foreach $e (@entries[0 .. 10]) {
printf("%30s | %5d | %2.2f%%\n",$e->{inode},$e->{size},$e->{siz
+e}/$sum*1000);
}
Thanks for a cool script!