Slava Pestov e01fc93812 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
..
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	Add summary for heaps more vocabs	2009-02-16 21:05:13 -06:00
info	compiler.tree.propagation.info: fix load error	2009-07-27 00:30:24 -05:00
inlining	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
known-words	define-partial-eval framework in propagation pass makes it easy to add transforms; moving some transforms from stack checker to propagation, making them stronger	2009-07-16 00:34:50 -05:00
nodes	Cleaning up USING: lists for new strict semantics	2009-05-14 16:54:16 -05:00
recursive	Fix for math.parser syntax change	2009-04-13 14:47:39 -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	New front-end and high-level optimizer lands	2008-08-12 03:22:45 -05:00
propagation-tests.factor	Improve code generation for shift word: add intrinsics for fixnum-shift-fast in the case where the shift count is not constant, transform 1 swap shift into a more overflow check with open-coded fast case, transform bitand into fixnum-bitand in more cases	2009-07-16 23:50:48 -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	New front-end and high-level optimizer lands	2008-08-12 03:22:45 -05:00