factor/basis/compiler/tree
Slava Pestov e4f8448eb1 Fix some problems with arithmetic type inference, exposed by recent changes to log2 word
- declared input type for bignum-shift was stricter than the runtime behavior, leading to bad propagation of type info if shift count was a bignum
- types inferred for type functions which used number-valued/integer-valued/real-valued were not always precise, eg bignum bignum bitxor => integer
- add interval-log2, type function for (log2)
- remove math-class-min, it was useless
2008-12-07 19:44:49 -06:00
..
builder Local DCE 2008-12-04 06:02:49 -06:00
checker Trying to make PEGs compile faster by reducing the number of low level IR nodes: merge functionality of #>r and #r> into #shuffle, and generate 1 node instead of 3 for calls to get-local 2008-11-11 18:46:31 -06:00
cleanup More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser 2008-12-06 11:17:19 -06:00
combinators More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser 2008-12-06 11:17:19 -06:00
comparisons New front-end and high-level optimizer lands 2008-08-12 03:22:45 -05:00
dead-code More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser 2008-12-06 11:17:19 -06:00
debugger optimized. now accepts method-specs 2008-12-03 10:44:21 -06:00
def-use More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser 2008-12-06 11:17:19 -06:00
escape-analysis More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser 2008-12-06 11:17:19 -06:00
finalization Various optimizations leading to a 10% speedup on compiling empty EBNF parser: 2008-12-06 09:16:29 -06:00
identities Trying to make PEGs compile faster by reducing the number of low level IR nodes: merge functionality of #>r and #r> into #shuffle, and generate 1 node instead of 3 for calls to get-local 2008-11-11 18:46:31 -06:00
late-optimizations New modular arithmetic optimization pass 2008-09-12 18:08:38 -05:00
modular-arithmetic Cleanup 2008-11-03 00:03:22 -06:00
normalization More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser 2008-12-06 11:17:19 -06:00
optimizer More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser 2008-12-06 11:17:19 -06:00
propagation Fix some problems with arithmetic type inference, exposed by recent changes to log2 word 2008-12-07 19:44:49 -06:00
recursive dlists no longer have a length slot; tweak dlist code so that types infer better 2008-11-16 05:53:25 -06:00
tuple-unboxing More optimization intended to reduce compile time. Another 10% speedup on compiling empty PEG parser 2008-12-06 11:17:19 -06: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 Trying to make PEGs compile faster by reducing the number of low level IR nodes: merge functionality of #>r and #r> into #shuffle, and generate 1 node instead of 3 for calls to get-local 2008-11-11 18:46:31 -06:00