Make important improvements

- Fix preadv() and pwritev() for old distros
- Introduce _npassert() and _unassert() macros
- Prove that file locks work properly on Windows
- Support fcntl(F_DUPFD_CLOEXEC) on more systems

libc/str/djbsort.c

@@ -18,40 +18,11 @@
 ╚─────────────────────────────────────────────────────────────────────────────*/
 #include "libc/dce.h"
 #include "libc/intrin/asan.internal.h"
-#include "libc/intrin/bsr.h"
-#include "libc/mem/alg.h"
-#include "libc/nexgen32e/nexgen32e.h"
 #include "libc/nexgen32e/x86feature.h"
+#include "libc/runtime/runtime.h"
 
 void djbsort_avx2(int32_t *, long);
 
-static dontinline void intsort(int *x, size_t n, size_t t) {
-  int a, b, c;
-  size_t i, p, q;
-  for (p = t; p > 0; p >>= 1) {
-    for (i = 0; i < n - p; ++i) {
-      if (!(i & p)) {
-        a = x[i + 0];
-        b = x[i + p];
-        if (a > b) c = a, a = b, b = c;
-        x[i + 0] = a;
-        x[i + p] = b;
-      }
-    }
-    for (q = t; q > p; q >>= 1) {
-      for (i = 0; i < n - q; ++i) {
-        if (!(i & p)) {
-          a = x[i + p];
-          b = x[i + q];
-          if (a > b) c = a, a = b, b = c;
-          x[i + p] = a;
-          x[i + q] = b;
-        }
-      }
-    }
-  }
-}
-
 /**
  * D.J. Bernstein's outrageously fast integer sorting algorithm.
  */
@@ -65,7 +36,7 @@ void djbsort(int32_t *a, size_t n) {
     if (X86_HAVE(AVX2)) {
       djbsort_avx2(a, n);
     } else {
-      intsort(a, n, 1ul << _bsrl(n - 1));
+      _intsort(a, n);
     }
   }
 }