58d035f1c7
Fix two problems with recompilation: predicate constant folding was recording unsatisfied dependencies in some cases, and literal tuple instances of forgotten classes would cause problems for method inlining
2010-02-20 12:01:47 +13:00
13f920babb
Add some utility words to stack-checker.dependencies in preparation for a refactoring
2010-01-30 09:28:59 +13:00
2138b55708
New 'conditional dependency' mechanism for more accurate recording of recompilation information
2010-01-30 09:28:57 +13:00
0738e85df1
Work in progress: record constant-folds of predicate words, and call-next-method invocations, in the same way that method inlining are recorded, for greater recompilation accuracy
2010-01-30 09:28:56 +13:00
880fb747fc
Removing integers-as-sequences
2010-01-15 07:15:33 +13:00
08b6ebc7fa
Factor source files should not be executable
2009-11-21 17:50:43 -06:00
8f9d4e3d2c
stack-checker: split off stack-checker.dependencies from stack-checker.state
2009-11-08 20:34:46 -06:00
ba37429563
filter-here -> filter!
2009-10-28 00:44:05 -05:00
9ea0ce5c40
update compiler.tree.cleanup test
2009-10-26 23:01:35 -05:00
ac5ea1769b
get compiler tests loading
2009-09-16 09:20:47 -05:00
b3693e3c3b
compiler.tree.propagation: remove method inlining heuristic
2009-08-17 22:29:05 -05:00
7c3824639e
move if-zero etc to math, remove 1-/1+ from math
2009-08-14 14:27:23 -05:00
d1ce837569
Delete empty unit tests files, remove 1- and 1+, reorder IN: lines in a lot of places, minor refactoring
2009-08-13 19:21:44 -05:00
55d1b76ad7
compiler.tree.escape-analysis: if the output of an #introduce node has an immutable tuple class type declaration, and it is not passed to any subroutine calls, or returned from the word, then unbox it. This speeds up vector arithmetic words on specialized arrays, because the specialized array is unboxed up-front, eliminating an indirection on every loop iteration
2009-08-09 16:29:21 -05:00
a2f52c1e41
compiler.tree.recursive: more accurate loop detection
2009-08-04 19:18:40 -05:00
39a70db831
Improve code generation for shift word: add intrinsics for fixnum-shift-fast in the case where the shift count is not constant, transform 1 swap shift into a more overflow check with open-coded fast case, transform bitand into fixnum-bitand in more cases
2009-07-16 23:50:48 -05:00
e21cf72927
compiler.tree.dead-code: methods on flushable generics should be flushable
2009-07-03 21:31:26 -05:00
483c936eb3
get rid of useless test
2009-05-21 20:56:57 -05:00
332bde4173
use iota in a few places
2009-04-17 16:17:11 -05:00
dba4c0d589
fixing compiler errors in basis
2009-04-17 12:46:04 -05:00
6080c6e734
Fix stack effect redefinition
2009-03-22 20:16:31 -05:00
2f4e2735ea
Fix compile errors in compiler tests so that they actually test the compiler instead of being useless
2009-03-22 17:50:53 -05:00
b6f6e880bf
Make partially dispatched integer ops foldable
2009-03-11 13:57:13 -05:00
bda8b2dda6
Better inlining for both-fixnums?
2009-02-26 14:11:26 -06:00
901bcccc1c
Fix remaining text failures
2009-02-23 23:25:13 -06:00
6b25e99470
Add summary for heaps more vocabs
2009-02-16 21:05:13 -06:00
3c408342ef
renaming: contain? -> any?, deep-contains? -> deep-any?, pad-left -> pad-head, pad-right -> pad-tail, trim-left -> trim-head, trim-right -> trim-tail
2009-01-29 22:19:07 -06:00
145b635eb6
More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser
...
- new map-flat combinator replaces usages of 'map flatten' in compiler
- compiler.tree.def-use.simplified uses an explicit accumulator instead of flatten
- compiler.tree.tuple-unboxing uses an explicit accumulator instead of flatten
- fix inlining regression from last time: custom inlining results would sometimes be discarded
- compiler.tree's 3each and 3map combinators rewritten to not use flip
- rewrite math.partial-dispatch without locals (purely stylistic, no performance increase)
- hand-optimize flip for common arrays-of-arrays case
- don't run escape analysis and tuple unboxing if there are no allocations in the IR
2008-12-06 11:17:19 -06:00
e5ed7447ed
Removing more >r/r> usages
2008-12-03 08:46:16 -06:00
a32acdcff0
Tweak grouping code for better method inlining
2008-11-11 12:11:13 -06:00
7f9fbdaa4e
cleanup pass didn't properly handle conditionals where both branches were dead
2008-11-11 08:38:03 -06:00
0d83873174
Fix regression
2008-11-03 00:03:15 -06:00
0cc0a41e57
Update for compiler.intrinsics removal
2008-10-20 20:40:36 -05:00
10c68ebb21
New modular arithmetic optimization pass
2008-09-12 18:08:38 -05:00
40da49bef5
Perform loop detection before normalization, clean up normalization pass, more aggressive recursive return value propagation. Fixes regression on nsieve benchmark
2008-09-12 05:17:27 -05:00
f2721e0608
Help lint fixes
2008-09-11 05:04:49 -05:00
cf80dd122a
Updating code for make and fry changes
2008-09-10 22:11:40 -05:00
44f53de164
Move make to its own vocabulary, remove fry _ feature
2008-09-10 20:07:00 -05:00
8a921c791c
if-empty changes
2008-09-06 19:13:59 -05:00
a4a00f6e40
Adding missing optimizations to finalization pass
2008-09-02 22:59:49 -05:00
110a5e5162
Change equality semantics
2008-09-02 02:02:05 -05:00
f5fbd94a4c
New compiled crossref implementation
2008-08-31 01:34:00 -05:00
3cef7c9992
Smarter usage tracking system
2008-08-30 02:31:27 -05:00
c674dd9101
Regression: insufficient compiled usage recorded
2008-08-29 17:52:43 -05:00
783d0fcabf
Fix cleanup of conditionals with no live branches
2008-08-29 04:40:53 -05:00
6ead724b25
Fixing bugs
2008-08-29 04:23:39 -05:00
1fcbdf9d52
Fix more compiler bugs
2008-08-29 00:26:47 -05:00
74dccc7fbf
Debugging compiler
2008-08-28 22:28:34 -05:00
7359873b60
Minor compiler tweaks
2008-08-24 01:21:23 -05:00
fd8136786b
Cleaning up DCE
2008-08-22 18:09:48 -05:00
Slava Pestov
Slava Pestov
Joe Groff
Doug Coleman
Doug Coleman