mirror of https://github.com/vitalif/e2fsprogs
e2fsck/rehash.c (name_cmp): Sort the deleted inodes to the end
of the list, for portability to systems that whose qsort does not perform a stable sort.bitmap-optimize
parent
2ecaaf6557
commit
12dd69f5ff
|
@ -1,3 +1,9 @@
|
||||||
|
2003-04-17 Theodore Ts'o <tytso@mit.edu>
|
||||||
|
|
||||||
|
* rehash.c (name_cmp): Sort the deleted inodes to the end of the
|
||||||
|
list, for portability to systems that whose qsort does not
|
||||||
|
perform a stable sort.
|
||||||
|
|
||||||
2003-04-16 Theodore Ts'o <tytso@mit.edu>
|
2003-04-16 Theodore Ts'o <tytso@mit.edu>
|
||||||
|
|
||||||
* unix.c: Bracket progress bar output with control-A and control-B
|
* unix.c: Bracket progress bar output with control-A and control-B
|
||||||
|
@ -6,7 +12,8 @@
|
||||||
progress bar.
|
progress bar.
|
||||||
(PRS): Use setvbuf instead of setbuf to force stdout and
|
(PRS): Use setvbuf instead of setbuf to force stdout and
|
||||||
stderr to be non-buffered when the stdout/stderr are a pipe.
|
stderr to be non-buffered when the stdout/stderr are a pipe.
|
||||||
This fixes a cosmetic problem when using e2fsck under logsave.
|
This fixes a cosmetic problem when using e2fsck under
|
||||||
|
logsave.
|
||||||
|
|
||||||
2003-04-12 Theodore Ts'o <tytso@mit.edu>
|
2003-04-12 Theodore Ts'o <tytso@mit.edu>
|
||||||
|
|
||||||
|
@ -35,7 +42,8 @@
|
||||||
|
|
||||||
2003-03-14 Theodore Ts'o <tytso@mit.edu>
|
2003-03-14 Theodore Ts'o <tytso@mit.edu>
|
||||||
|
|
||||||
* problem.c, problem.h (PR_2_REPORT_DUP_DIRENT): Add new problem code.
|
* problem.c, problem.h (PR_2_REPORT_DUP_DIRENT): Add new problem
|
||||||
|
code.
|
||||||
|
|
||||||
* pass2.c (check_dir_block): Check for duplicate filenames within
|
* pass2.c (check_dir_block): Check for duplicate filenames within
|
||||||
a single directory block (because this is the easy case;
|
a single directory block (because this is the easy case;
|
||||||
|
|
|
@ -175,7 +175,7 @@ static EXT2_QSORT_TYPE name_cmp(const void *a, const void *b)
|
||||||
else if (he_a->dir->name_len < he_b->dir->name_len)
|
else if (he_a->dir->name_len < he_b->dir->name_len)
|
||||||
ret = -1;
|
ret = -1;
|
||||||
else
|
else
|
||||||
ret = 0;
|
ret = he_b->dir->inode - he_a->dir->inode;
|
||||||
}
|
}
|
||||||
return ret;
|
return ret;
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in New Issue