factor/basis/compiler/tree
Joe Groff 104c29aabc simd intrinsic implementation for v*high, v*hs+, vavg, and vsad 2009-12-05 14:52:18 -08:00
..
builder Factor source files should not be executable 2009-11-21 17:50:43 -06:00
checker Factor source files should not be executable 2009-11-21 17:50:43 -06:00
cleanup Factor source files should not be executable 2009-11-21 17:50:43 -06: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 Factor source files should not be executable 2009-11-21 17:50:43 -06:00
debugger deprimitivize tuck and put it to pasture 2009-11-05 22:47:05 -06: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
finalization Factor source files should not be executable 2009-11-21 17:50:43 -06:00
identities
late-optimizations
modular-arithmetic memq? -> member-eq?, sorted-memq? -> sorted-member-eq? 2009-10-28 15:02:00 -05:00
normalization
optimizer
propagation simd intrinsic implementation for v*high, v*hs+, vavg, and vsad 2009-12-05 14:52:18 -08:00
recursive
tuple-unboxing Factor source files should not be executable 2009-11-21 17:50:43 -06:00
authors.txt
summary.txt
tree.factor New identity-hashcode primitive 2009-11-10 21:18:54 -06:00