mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-02-15 02:37:55 +00:00
ae5d06dc53
- 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
|
||
|---|---|---|
| .. | ||
| lib | ||
| plinko.c | ||
| plinko.mk | ||
| README.txt | ||
DESCRIPTION
plinko is a simple lisp interpreter that takes advantage of advanced
operating system features irrespective of their practicality such as
using the nsa instruction popcount for mark sweep garbage collection
overcommit memory, segment registers, and other dirty hacks that the
popular interpreters cannot do; this lets plinko gain a considerable
performance edge while retaining an event greater edge in simplicity
We hope you find these sources informative, educational, and possibly
useful too. Lisp source code, written in its dialect is included too
under //tool/plinko/lib and unit tests which clarify their usage can
be found in //test/tool/plinko.
BENCHMARK
binary trees (n=21)
- sbcl: 200 ms (native jit; simulated arithmetic)
- plinko: 400 ms (interpreted; simulated arithmetic)
- python3: 800 ms (interpreted; native arithmetic)
- racket: 1200 ms (interpreted; simulated arithmetic)
AUTHOR
Justine Alexandra Roberts Tunney <jtunney@gmail.com>
LICENSE
ISC
SEE ALSO
SectorLISP
SectorLambda