This makes rm -rf significantly faster (400-500%) in some pathological
cases, and slightly slower (20%) in at least one pathological case.
+ rm -r deletes deep hierarchies more efficiently. Before, it took O(N^2)
+ time, now it takes O(N). However, this improvement is not as pronounced
+ as might be expected for very deep trees, because prior to this change, for
+ any relative name length longer than 8KiB, rm -r would sacrifice official
+ conformance to avoid the disproportionate O(N^2) performance penalty.
+ Leading to another improvement:
+
+ rm -r is now slightly more standards-conformant when operating on
+ write-protected relative file names longer than 8KiB.
+
* Noteworthy changes in release 7.6 (2009-09-11) [stable]
# for cp.c
AC_CHECK_FUNCS_ONCE([utimensat])
+ # for remove.c
+ AC_CHECK_FUNCS_ONCE([faccessat])
+
dnl This can't use AC_REQUIRE; I'm not quite sure why.
cu_PREREQ_STAT_PROG
mess up with long file names). */
{
+ /* Use faccessat if possible, so as to avoid the expense
+ of processing an N-component name. */
+#if HAVE_FACCESSAT && AT_EACCESS
+ if (faccessat (fd_cwd, file, W_OK, AT_EACCESS) == 0)
+ return 0;
+#endif
+
/* This implements #5: */
size_t file_name_len = strlen (full_name);