Doug Coleman
9b6133d081
file-picker.windows: Basic file-picker works!
2014-12-16 13:45:31 -08:00
John Benediktsson
2d5358d713
macros: some cleanup.
2014-12-16 11:09:47 -08:00
John Benediktsson
2e56a3251a
bitstreams: cleanup and fix bug in bit-writer-bytes.
2014-12-15 19:28:24 -08:00
John Benediktsson
c01267d467
cocoa.dialogs: document save-panel stack effect better.
2014-12-15 19:24:57 -08:00
John Benediktsson
defd931d21
file-picker.windows: mock up some code for windows.
2014-12-15 15:36:03 -08:00
John Benediktsson
0edddbafd2
file-picker: adding start of cross-platform file-picker.
2014-12-15 15:16:41 -08:00
John Benediktsson
c2c722891e
compiler.cfg.save-contexts: fix help-lint.
2014-12-15 15:11:06 -08:00
John Benediktsson
c6ee627e1b
heaps: correctly size the data vector for >min-heap and >max-heap.
2014-12-15 13:29:01 -08:00
John Benediktsson
2a893a110a
compiler.cfg.linear-scan.allocation.state: don't use slot.syntax.
2014-12-15 13:10:59 -08:00
Björn Lindqvist
aee55f1b83
compiler.cfg.linear-scan.assignment: forgot that i removed live-intervals>min-heap
2014-12-15 21:04:53 +01:00
Björn Lindqvist
d6c1c075ff
compiler.cfg.linear-scan.allocation: using slurp-heap
2014-12-15 20:48:34 +01:00
Björn Lindqvist
84f8f26ce8
compiler.cfg.linear-scan.allocation.state: doc fixing
2014-12-15 20:44:53 +01:00
Björn Lindqvist
35d00da765
compiler.cfg.linear-scan.allocation.*: maybe a fix for #1227
...
The register allocator pops from the unhandled-intervals and
unhandled-sync-points heaps. If two live intervals share the same
start slot, then they can be popped in either order leading to
differently generated code. So instead use one
heap (unhandled-min-heap) and both the start and end slot as the heap
key to resolve tie-breakers
2014-12-15 20:44:53 +01:00
Björn Lindqvist
fd0b0cbf9e
tools.gc-decode.tests: another tough test
2014-12-15 20:44:07 +01:00
Björn Lindqvist
173f7c0869
compiler.cfg.scheduling: refactoring to use the simple-optimization combinator
2014-12-15 20:44:07 +01:00
Björn Lindqvist
8a011c8366
compiler.cfg.*: more docs
2014-12-15 20:44:07 +01:00
Björn Lindqvist
c810677b47
compiler.cfg.linear-scan.*: refactoring to simplify init-allocator and get rid of init-unhandled
2014-12-15 20:44:06 +01:00
Björn Lindqvist
fab478482e
compiler.cfg.linear-scan.allocation: refactoring to simplify the (allocate-registers) recursion
2014-12-15 20:44:06 +01:00
Björn Lindqvist
52c6009aeb
compiler.cfg.linear-scan.assignment: utility word heap-pop-while which lets you express expire-old-intervals and activate-new-intervals more nicely + tests
2014-12-15 20:40:49 +01:00
Björn Lindqvist
0af46ac4de
compiler.cfg.linear-scan.assignment: more docs and refactoring of the init-unhandled and assign-registers-in-block words
2014-12-15 20:40:49 +01:00
Björn Lindqvist
a7137f32ff
compiler.cfg.save-contexts: refactoring of the vocab, using the simple-optimization combinator and union classes you can shorten it a lot
2014-12-15 20:36:27 +01:00
John Benediktsson
52e7538869
ui: specify two places where image-name tuples are expected.
2014-12-15 09:56:03 -08:00
John Benediktsson
768ad8abb9
heaps: fix docs for slurp-heap.
2014-12-15 08:56:24 -08:00
John Benediktsson
fe377ba02a
heaps: fix slurp-heap to allow modifying the heap while slurping.
2014-12-15 08:53:48 -08:00
hyphz
fb9cf1219f
Create bitstreams-docs.factor
2014-12-14 16:02:42 -08:00
John Benediktsson
e5c69d3e9b
compiler: try this for compiler.cfg.builder.alien.
2014-12-13 18:44:35 -08:00
John Benediktsson
a689211ae1
compiler.cfg.builder: use compiler.cfg.builder.alien.
2014-12-13 18:08:50 -08:00
John Benediktsson
24263299fa
math.primes.solovay-strassen: adding Solovay-Strassen primality test.
2014-12-13 16:52:28 -08:00
John Benediktsson
1030f592e0
core-graphics: cleanup usings.
2014-12-13 16:26:15 -08:00
John Benediktsson
c63a106e1d
core-text: cleanup usings.
2014-12-13 16:26:09 -08:00
John Benediktsson
be64b40b7f
core-foundation: cleanup usings.
2014-12-13 16:25:59 -08:00
John Benediktsson
4a13633e5d
cocoa: cleanup usings.
2014-12-13 16:25:48 -08:00
John Benediktsson
c65877104e
compiler: cleanup usings.
2014-12-13 16:10:21 -08:00
John Benediktsson
68b662c44c
heaps: make data-first throw on empty.
2014-12-13 16:01:20 -08:00
John Benediktsson
46e0426795
compiler.cfg.stack-frame: fix tests.
2014-12-12 17:14:39 -08:00
John Benediktsson
1911b183a0
compiler.cfg.build-stack-frame: fix tests.
2014-12-12 15:22:22 -08:00
John Benediktsson
e576fb5fec
peg: some cleanup.
2014-12-12 14:19:39 -08:00
John Benediktsson
f562bc3385
space-invaders: add back run-rom for code reuse.
2014-12-12 14:01:13 -08:00
John Benediktsson
729ad520a8
fix for space-invaders changes.
2014-12-12 13:24:22 -08:00
John Benediktsson
8f4c4ea2e1
compiler.cfg.build-stack-frame: some cleanup.
2014-12-12 11:59:23 -08:00
John Benediktsson
b477611142
space-invaders: some cleanup.
2014-12-12 11:00:16 -08:00
John Benediktsson
b50286f137
cpu.8080: some cleanup.
2014-12-12 10:59:20 -08:00
John Benediktsson
b76503a718
use ">>foo" instead of "over foo<<".
2014-12-11 20:55:04 -08:00
John Benediktsson
26583dbbaa
trees: some cleanup.
2014-12-11 20:33:18 -08:00
John Benediktsson
028b50fd19
dlists: some cleanup.
2014-12-11 17:33:31 -08:00
John Benediktsson
b9dc159949
deques: enhance slurp-deque stack effect.
2014-12-11 15:59:33 -08:00
John Benediktsson
d52f55f508
deques: enhance slurp-deque stack effect.
2014-12-11 15:57:48 -08:00
Doug Coleman
7e35c28bc6
forestdb.lib: fdb_iterator_get() actually calls create_doc and mallocs the memory for you. We use fdb_doc_free to free() it in with-doc later.
2014-12-11 15:28:13 -08:00
Doug Coleman
c1e9993665
forestdb.lib: Add back the forestdb each test.
2014-12-11 15:04:18 -08:00
John Benediktsson
4d5f243fd6
compiler.cfg.gvn: fix tests for recent refactor.
2014-12-11 14:56:58 -08:00