Unbloat build config

- 10.5% reduction of o//depend dependency graph
- 8.8% reduction in latency of make command
- Fix issue with temporary file cleanup

There's a new -w option in compile.com that turns off the recent
Landlock output path workaround for "good commands" which do not
unlink() the output file like GNU tooling does.

Our new GNU Make unveil sandboxing appears to have zero overhead
in the grand scheme of things. Full builds are pretty fast since
the only thing that's actually slowed us down is probably libcxx

    make -j16 MODE=rel
    RL: took 85,732,063µs wall time
    RL: ballooned to 323,612kb in size
    RL: needed 828,560,521µs cpu (11% kernel)
    RL: caused 39,080,670 page faults (99% memcpy)
    RL: 350,073 context switches (72% consensual)
    RL: performed 0 reads and 11,494,960 write i/o operations

pledge() and unveil() no longer consider ENOSYS to be an error.
These functions have also been added to Python's cosmo module.

This change also removes some WIN32 APIs and System Five magnums
which we're not using and it's doubtful anyone else would be too

third_party/make/hash.c

@@ -414,24 +414,6 @@ jhash(unsigned const char *k, int length)
 
 #define UINTSZ sizeof (unsigned int)
 
-#ifdef WORDS_BIGENDIAN
-/* The ifs are ordered from the first byte in memory to the last.  */
-#define sum_up_to_nul(r, p, plen, flag)   \
-  do {                                    \
-    unsigned int val = 0;                 \
-    size_t pn = (plen);                   \
-    size_t n = pn < UINTSZ ? pn : UINTSZ; \
-    memcpy (&val, (p), n);                \
-    if ((val & 0xFF000000) == 0)          \
-      flag = 1;                           \
-    else if ((val & 0xFF0000) == 0)       \
-      r += val & ~0xFFFF, flag = 1;       \
-    else if ((val & 0xFF00) == 0)         \
-      r += val & ~0xFF, flag = 1;         \
-    else                                  \
-      r += val, flag = (val & 0xFF) == 0; \
-  } while (0)
-#else
 /* First detect the presence of zeroes.  If there is none, we can
    sum the 4 bytes directly.  Otherwise, the ifs are ordered as in the
    big endian case, from the first byte in memory to the last.  */
@@ -454,7 +436,6 @@ jhash(unsigned const char *k, int length)
           r += val;                                  \
       }                                              \
   } while (0)
-#endif
 
 unsigned int
 jhash_string(unsigned const char *k)