| .. |
|
builder
|
Factor source files should not be executable
|
2009-11-21 17:50:43 -06:00 |
|
checker
|
compiler.tree: remove some code duplication concerning #alien nodes
|
2010-01-07 16:06:07 +13:00 |
|
cleanup
|
Removing integers-as-sequences
|
2010-01-15 07:15:33 +13:00 |
|
combinators
|
Factor source files should not be executable
|
2009-11-21 17:50:43 -06:00 |
|
comparisons
|
math: add unordered comparison operators u< u<= u> u>= which behave exactly like < <= > >= except no floating point exceptions are set if one or both inputs are NaNs; also add efficient intrinsic for unordered? predicate, and fix propagation type functions for abs, absq, and bitnot
|
2009-09-12 22:20:13 -05:00 |
|
dead-code
|
Removing integers-as-sequences
|
2010-01-15 07:15:33 +13:00 |
|
debugger
|
Removing integers-as-sequences
|
2010-01-15 07:15:33 +13:00 |
|
def-use
|
compiler.tree.modular-arithmetic: stronger optimization handles > 1 usages case as well as values defined and used in loops. Eliminates 5 out of 8 >fixnum calls in benchmark.yuv-to-rgb
|
2009-08-15 18:42:41 -05:00 |
|
escape-analysis
|
compiler.tree.escape-analysis: make tests a bit more robust; a change to boa constructors recently meant dead curries were showing up on certain expansions, this was throwing off the escape-analysis test's unboxed allocation counting. Fix this by having the test run DCE first, and remove a few tests that no longer make sense now
|
2010-01-18 23:32:34 +13:00 |
|
finalization
|
Factor source files should not be executable
|
2009-11-21 17:50:43 -06:00 |
|
identities
|
Add summary for heaps more vocabs
|
2009-02-16 21:05:13 -06:00 |
|
late-optimizations
|
Add summary for heaps more vocabs
|
2009-02-16 21:05:13 -06:00 |
|
modular-arithmetic
|
Removing integers-as-sequences
|
2010-01-15 07:15:33 +13:00 |
|
normalization
|
Removing integers-as-sequences
|
2010-01-15 07:15:33 +13:00 |
|
optimizer
|
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 |
|
propagation
|
compiler.tree.propagation: ensure that we don't call 'equal?' or 'hashcode' on literals in words being compiled
|
2010-01-16 20:00:48 +13:00 |
|
recursive
|
move if-zero etc to math, remove 1-/1+ from math
|
2009-08-14 14:27:23 -05:00 |
|
tuple-unboxing
|
compiler.tree: remove some code duplication concerning #alien nodes
|
2010-01-07 16:06:07 +13:00 |
|
authors.txt
|
New front-end and high-level optimizer lands
|
2008-08-12 03:22:45 -05:00 |
|
summary.txt
|
New front-end and high-level optimizer lands
|
2008-08-12 03:22:45 -05:00 |
|
tree.factor
|
Add alien-assembly form for inline assembler, works like alien-invoke except calls a user-supplied quotation instead of generating a subroutine call. Replaces FPU status control, SSE detection and read timestamp routines in vm/cpu-x86.*S
|
2010-01-07 17:39:22 +13:00 |
ac800e2396