factor/basis/compiler/tree
Slava Pestov eed4f4dcfc compiler.tree.recursive: add some more more loop detection tests 2009-08-04 16:23:14 -05:00
..
builder
checker
cleanup 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
combinators
comparisons
dead-code compiler.tree.dead-code: methods on flushable generics should be flushable 2009-07-03 21:31:26 -05:00
debugger Overflowing fixnum intrinsics now expand into several CFG nodes. This speeds up the common case since only the uncommon case is now a stack syncpoint 2009-07-16 18:29:40 -05:00
def-use
escape-analysis Remove initial-quot feature 2009-06-15 13:07:15 -05:00
finalization compiler.tree.finalization: undo a change that resulted in a compile time regression 2009-07-18 03:33:24 -05:00
identities
late-optimizations
modular-arithmetic Overflowing fixnum intrinsics now expand into several CFG nodes. This speeds up the common case since only the uncommon case is now a stack syncpoint 2009-07-16 18:29:40 -05:00
normalization
optimizer compiler.tree.optimizer: Remove redundant call to compute-def-use 2009-07-01 17:41:20 -05:00
propagation compiler.cfg.ssa.destruction: new implementation: simpler and more correct 2009-08-02 10:26:52 -05:00
recursive compiler.tree.recursive: add some more more loop detection tests 2009-08-04 16:23:14 -05:00
tuple-unboxing
authors.txt
summary.txt
tree.factor