int reverse_sorting = 0; /* 1 means to show the large ones first */
+int show_top = 0; /* 1 means to show the top of the sorted list
+ instead of the bottom */
+
/********************************************************************/
int ignore_entry(const char *name) {
void print_sorted(struct file_with_size *root, int height) {
struct file_with_size *node;
struct file_with_size **nodes;
- int nb, n, first;
+ int nb, n, first, last;
nb = 0;
for(node = root; node; node = node->next) {
qsort(nodes, nb, sizeof(struct file_with_size *), compare_files);
first = 0;
+ last = nb;
if(forced_height) {
height = forced_height;
first = nb - height;
}
+ if(show_top) {
+ n = last;
+ last = nb - first;
+ first = nb - n;
+ }
+
if(fancy_size_display) {
- for(n = first; n < nb; n++) {
+ for(n = first; n < last; n++) {
if(nodes[n]->size < 1024) {
printf("% 7d %s\n",
((int) nodes[n]->size),
}
}
} else {
- for(n = first; n < nb; n++) {
+ for(n = first; n < last; n++) {
print_size_sum(nodes[n]->size);
printf(" %s\n", nodes[n]->filename);
}
setlocale (LC_ALL, "");
while (1) {
- c = getopt(argc, argv, "dfrl:hdu");
+ c = getopt(argc, argv, "dfrtl:hdu");
if (c == -1)
break;
reverse_sorting = 1;
break;
+ case 't':
+ show_top = 1;
+ break;
+
case 'l':
forced_height = atoi(optarg);
break;
printf(" -d ignore files and directories starting with a '.'\n");
printf(" -f display size with float values and K, M and G units.\n");
printf(" -r reverse the sorting order.\n");
+ printf(" -t show the top of the list.\n");
printf(" -l <lines> specificy the number of lines to display. The value -1\n");
printf(" corresponds to all the lines. By default the command\n");
printf(" shows one line less than the height the tty, or all the\n");