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
..
blocks	compiler.cfg: introduce less temporaries when building CFG	2009-07-24 03:37:18 -05:00
authors.txt	Merging in new codegen	2008-10-07 16:16:50 -05:00
builder-tests.factor	compiler.cfg: new system to track when results of analyses need to be recomputed (reverse post order, linear order, predecessors, dominance, loops). Passes can now call needs-predecessors, needs-dominance, needs-loops at the beginning, and cfg-changed, predecessors-changd at the end. Linearization order now takes loop nesting into account, and linear scan now uses linearization order instead of RPO.	2009-08-08 20:02:56 -05:00
builder.factor	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
summary.txt	Merging in new codegen	2008-10-07 16:16:50 -05:00
tags.txt	Merging in new codegen	2008-10-07 16:16:50 -05:00