mirrors/cosmopolitan
1
0
Fork 0
mirror of https://github.com/jart/cosmopolitan.git synced 2025-01-31 03:27:39 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions
cosmopolitan/tool/plinko
History
Justine Tunney 6ffed14b9c
Rewrite memory manager 
Actually Portable Executable now supports Android. Cosmo's old mmap code
required a 47 bit address space. The new implementation is very agnostic
and supports both smaller address spaces (e.g. embedded) and even modern
56-bit PML5T paging for x86 which finally came true on Zen4 Threadripper

Cosmopolitan no longer requires UNIX systems to observe the Windows 64kb
granularity; i.e. sysconf(_SC_PAGE_SIZE) will now report the host native
page size. This fixes a longstanding POSIX conformance issue, concerning
file mappings that overlap the end of file. Other aspects of conformance
have been improved too, such as the subtleties of address assignment and
and the various subtleties surrounding MAP_FIXED and MAP_FIXED_NOREPLACE

On Windows, mappings larger than 100 megabytes won't be broken down into
thousands of independent 64kb mappings. Support for MAP_STACK is removed
by this change; please use NewCosmoStack() instead.

Stack overflow avoidance is now being implemented using the POSIX thread
APIs. Please use GetStackBottom() and GetStackAddr(), instead of the old
error-prone GetStackAddr() and HaveStackMemory() APIs which are removed.
2024-06-22 05:45:11 -07:00
..
lib Rewrite memory manager 2024-06-22 05:45:11 -07:00
BUILD.mk Stop using .com extension in monorepo 2024-03-03 03:12:19 -08:00
plinko.c flip et / noet in modelines 2023-12-07 22:17:11 -05: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