factor/basis/compiler/tree/propagation
Slava Pestov bbca00e2ae Fix conflicts 2009-09-07 23:51:25 -05:00
..
branches
call-effect compiler.tree.propagation.call-effect: stronger call( inlining; now can inline 'a [ b ] curry call(' where 'a' is literal, [ b ] doesn't infer, but [ a b ] does infer. This simplifies classes.struct:memory>struct 2009-09-07 17:45:03 -05:00
constraints
copy 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
info
inlining compiler.tree.propagation.call-effect: stronger call( inlining; now can inline 'a [ b ] curry call(' where 'a' is literal, [ b ] doesn't infer, but [ a b ] does infer. This simplifies classes.struct:memory>struct 2009-09-07 17:45:03 -05:00
known-words compiler: clean up code generation for alien boxing/unboxing a bit 2009-09-03 21:22:43 -05:00
nodes
recursive 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
simd More SIMD work 2009-09-03 20:58:56 -05:00
simple compiler.tree.propagation: type check inputs to unsafe foldable words manually, so that stuff like [ "Hi" { } fixnum+fast ] doesn't crash in the compiler 2009-09-07 23:40:23 -05:00
slots 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
transforms compiler: add fixnum-min/max intrinsics; ~10% speedup on benchmark.yuv-to-rgb 2009-08-28 19:02:59 -05:00
authors.txt
propagation-tests.factor Fix conflicts 2009-09-07 23:51:25 -05:00
propagation.factor compiler.tree.propagation: remove method inlining heuristic 2009-08-17 22:29:05 -05:00
summary.txt