mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-03-03 15:38:22 +00:00
- Introduce fast spinlock API - Double rand64() perf w/ spinlock - Improve raise() on New Technology - Support gettid() across platforms - Implement SA_NODEFER on New Technology - Move the lock intrinsics into LIBC_INTRIN - Make SIGTRAP recoverable on New Technology - Block SIGCHLD in wait4() on New Technology - Add threading prototypes for XNU and FreeBSD - Rewrite abort() fixing its minor bugs on XNU/NT - Shave down a lot of the content in libc/bits/bits.h - Let signal handlers modify CPU registers on New Technology |
||
---|---|---|
.. | ||
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, eductional, 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