Slava Pestov 7e35723db0 compiler.tree.propagation: be more careful with intervals, ensuring that the inferred interval of a value is a subset of the value class's interval. This improves accuracy, for example [ >fixnum 1 + >fixnum most-positive-fixnum <= ] constant-folds to true		2009-08-10 01:16:49 -05:00
..
builder	compiler.tree.escape-analysis: if the output of an #introduce node has an immutable tuple class type declaration, and it is not passed to any subroutine calls, or returned from the word, then unbox it. This speeds up vector arithmetic words on specialized arrays, because the specialized array is unboxed up-front, eliminating an indirection on every loop iteration	2009-08-09 16:29:21 -05:00
checker	compiler.tree.recursive: more accurate loop detection	2009-08-04 19:18:40 -05:00
cleanup	compiler.tree.escape-analysis: if the output of an #introduce node has an immutable tuple class type declaration, and it is not passed to any subroutine calls, or returned from the word, then unbox it. This speeds up vector arithmetic words on specialized arrays, because the specialized array is unboxed up-front, eliminating an indirection on every loop iteration	2009-08-09 16:29:21 -05:00
combinators	…
comparisons	…
dead-code	compiler.tree.recursive: more accurate loop detection	2009-08-04 19:18:40 -05:00
debugger	compiler.tree.propagation: be more careful with intervals, ensuring that the inferred interval of a value is a subset of the value class's interval. This improves accuracy, for example [ >fixnum 1 + >fixnum most-positive-fixnum <= ] constant-folds to true	2009-08-10 01:16:49 -05:00
def-use	compiler.tree.escape-analysis: if the output of an #introduce node has an immutable tuple class type declaration, and it is not passed to any subroutine calls, or returned from the word, then unbox it. This speeds up vector arithmetic words on specialized arrays, because the specialized array is unboxed up-front, eliminating an indirection on every loop iteration	2009-08-09 16:29:21 -05:00
escape-analysis	compiler.tree.escape-analysis: if the output of an #introduce node has an immutable tuple class type declaration, and it is not passed to any subroutine calls, or returned from the word, then unbox it. This speeds up vector arithmetic words on specialized arrays, because the specialized array is unboxed up-front, eliminating an indirection on every loop iteration	2009-08-09 16:29:21 -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	compiler.tree.propagation: be more careful with intervals, ensuring that the inferred interval of a value is a subset of the value class's interval. This improves accuracy, for example [ >fixnum 1 + >fixnum most-positive-fixnum <= ] constant-folds to true	2009-08-10 01:16:49 -05:00
normalization	…
optimizer	…
propagation	compiler.tree.propagation: be more careful with intervals, ensuring that the inferred interval of a value is a subset of the value class's interval. This improves accuracy, for example [ >fixnum 1 + >fixnum most-positive-fixnum <= ] constant-folds to true	2009-08-10 01:16:49 -05:00
recursive	compiler.graphviz: add high-level IR call graph rendering	2009-08-05 03:33:06 -05:00
tuple-unboxing	compiler.tree.escape-analysis: if the output of an #introduce node has an immutable tuple class type declaration, and it is not passed to any subroutine calls, or returned from the word, then unbox it. This speeds up vector arithmetic words on specialized arrays, because the specialized array is unboxed up-front, eliminating an indirection on every loop iteration	2009-08-09 16:29:21 -05:00
authors.txt	…
summary.txt	…
tree.factor	compiler.tree.recursive: more accurate loop detection	2009-08-04 19:18:40 -05:00