Slava Pestov 8a9c15ab0b 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
..
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	Add summary for heaps more vocabs	2009-02-16 21:05:13 -06:00
comparisons	Stack effect declarations are mandatory on all words now	2009-02-23 20:27:05 -06:00
dead-code	compiler.tree.recursive: more accurate loop detection	2009-08-04 19:18:40 -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	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	Add summary for heaps more vocabs	2009-02-16 21:05:13 -06:00
late-optimizations	Add summary for heaps more vocabs	2009-02-16 21:05:13 -06:00
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	stack-checker: fix case where invalid code could infer	2009-05-23 15:50:35 -05:00
optimizer	compiler.tree.optimizer: Remove redundant call to compute-def-use	2009-07-01 17:41:20 -05:00
propagation	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
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	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	compiler.tree.recursive: more accurate loop detection	2009-08-04 19:18:40 -05:00