Slava Pestov 55d1b76ad7 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
..
branches	Add summary for heaps more vocabs	2009-02-16 21:05:13 -06:00
call-effect	compiler.tree.propagation.call-effect: fix case where quotation inlining could enter an infinite loop: [ dup call( quot -- ) ] dup call( quot -- ) etc	2009-08-01 23:34:14 -05:00
constraints	rename peek -> last and update all usages	2009-05-25 16:38:33 -05:00
copy	compiler.cfg.ssa.destruction: new implementation: simpler and more correct	2009-08-02 10:26:52 -05:00
info	More accurate interval inference for mod, rem, and propagation can now infer intervals in the case where a value might be f. so, [ [ 127 bitand ] [ drop f ] if dup [ 0 >= ] [ not ] if ] now constant-folds down to 't'!	2009-08-08 23:03:45 -05:00
inlining	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
known-words	More accurate interval inference for mod, rem, and propagation can now infer intervals in the case where a value might be f. so, [ [ 127 bitand ] [ drop f ] if dup [ 0 >= ] [ not ] if ] now constant-folds down to 't'!	2009-08-08 23:03:45 -05:00
nodes	Cleaning up USING: lists for new strict semantics	2009-05-14 16:54:16 -05:00
recursive	compiler.tree.recursive: more accurate loop detection	2009-08-04 19:18:40 -05:00
simple	Replace ratio and complex built-in types with tuples defined in the library. This frees up two lo-tags, so move array and quotation over to these tags and update compiler for new tags	2009-04-30 00:27:35 -05:00
slots	Fix infinite loop when compiling a word containing a tuple literal with circular structure in it. This was triggered by call( inline caching in core-foundation.fsevents on Mac OS X	2009-05-01 09:36:53 -05:00
transforms	compiler.tree.propagation.transforms: fix shift transform	2009-07-17 00:02:57 -05:00
authors.txt	…
propagation-tests.factor	More accurate interval inference for mod, rem, and propagation can now infer intervals in the case where a value might be f. so, [ [ 127 bitand ] [ drop f ] if dup [ 0 >= ] [ not ] if ] now constant-folds down to 't'!	2009-08-08 23:03:45 -05:00
propagation.factor	Propagation pass: add inlined node counts to total node count, so that the more we inline the less we are eager to inline more	2009-03-06 23:34:01 -06:00
summary.txt	…