mirrors/cosmopolitan
1
0
Fork 0
mirror of https://github.com/jart/cosmopolitan.git synced 2025-01-31 11:37:35 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions
cosmopolitan/tool/plinko
History
Justine Tunney c3440d040c
Make improvements 
- More timspec_*() and timeval_*() APIs have been introduced.
- The copyfd() function is now simplified thanks to POSIX rules.
- More Cosmo-specific APIs have been moved behind the COSMO define.
- The setitimer() polyfill for Windows NT is now much higher quality.
- Fixed build error for MODE=aarch64 due to -mstringop-strategy=loop.
- This change introduces `make MODE=nox87 toolchain` which makes it
  possible to build programs using your cosmocc toolchain that don't
  have legacy fpu instructions. This is useful, for example, if you
  want to have a ~22kb tinier blink virtual machine.
2023-06-15 14:50:53 -07:00
..
lib Make improvements 2023-06-15 14:50:53 -07:00
plinko.c Run clang-format on most sources 2023-04-27 05:44:32 -07:00
plinko.mk Port a lot more code to AARCH64 2023-05-14 09:37:26 -07:00
README.txt WIP: Correct all typos (#498) 2022-07-20 14:01:15 -07:00

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