| 
									
										
										
										
											2008-08-11 00:37:12 -04:00
										 |  |  | ! Copyright (C) 2006, 2008 Slava Pestov. | 
					
						
							|  |  |  | ! See http://factorcode.org/license.txt for BSD license. | 
					
						
							|  |  |  | USING: kernel assocs fry match accessors namespaces effects | 
					
						
							|  |  |  | sequences sequences.private quotations generic macros arrays | 
					
						
							|  |  |  | prettyprint prettyprint.backend prettyprint.sections math words | 
					
						
							|  |  |  | combinators io sorting | 
					
						
							|  |  |  | compiler.tree | 
					
						
							|  |  |  | compiler.tree.builder | 
					
						
							|  |  |  | compiler.tree.optimizer | 
					
						
							|  |  |  | compiler.tree.combinators | 
					
						
							|  |  |  | compiler.tree.propagation.info ;
 | 
					
						
							|  |  |  | IN: compiler.tree.debugger | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | ! A simple tool for turning tree IR into quotations and | 
					
						
							|  |  |  | ! printing reports, for debugging purposes. | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | GENERIC: node>quot ( node -- )
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | MACRO: match-choose ( alist -- )
 | 
					
						
							|  |  |  |     [ '[ , ] ] assoc-map '[ , match-cond ] ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | MATCH-VARS: ?a ?b ?c ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2008-08-12 00:30:18 -04:00
										 |  |  | : pretty-shuffle ( effect -- word/f )
 | 
					
						
							| 
									
										
										
										
											2008-08-12 03:41:18 -04:00
										 |  |  |     [ in>> ] [ out>> ] bi 2array { | 
					
						
							| 
									
										
										
										
											2008-08-11 03:49:37 -04:00
										 |  |  |         { { { } { } } [ ] } | 
					
						
							| 
									
										
										
										
											2008-08-11 00:37:12 -04:00
										 |  |  |         { { { ?a } { ?a } } [ ] } | 
					
						
							|  |  |  |         { { { ?a ?b } { ?a ?b } } [ ] } | 
					
						
							|  |  |  |         { { { ?a ?b ?c } { ?a ?b ?c } } [ ] } | 
					
						
							|  |  |  |         { { { ?a } { } } [ drop ] } | 
					
						
							|  |  |  |         { { { ?a ?b } { } } [ 2drop ] } | 
					
						
							|  |  |  |         { { { ?a ?b ?c } { } } [ 3drop ] } | 
					
						
							|  |  |  |         { { { ?a } { ?a ?a } } [ dup ] } | 
					
						
							|  |  |  |         { { { ?a ?b } { ?a ?b ?a ?b } } [ 2dup ] } | 
					
						
							|  |  |  |         { { { ?a ?b ?c } { ?a ?b ?c ?a ?b ?c } } [ 3dup ] } | 
					
						
							|  |  |  |         { { { ?a ?b } { ?a ?b ?a } } [ over ] } | 
					
						
							|  |  |  |         { { { ?b ?a } { ?a ?b } } [ swap ] } | 
					
						
							| 
									
										
										
										
											2008-08-11 03:49:37 -04:00
										 |  |  |         { { { ?b ?a ?c } { ?a ?b ?c } } [ swapd ] } | 
					
						
							|  |  |  |         { { { ?a ?b } { ?a ?a ?b } } [ dupd ] } | 
					
						
							| 
									
										
										
										
											2008-08-11 00:37:12 -04:00
										 |  |  |         { { { ?a ?b } { ?b ?a ?b } } [ tuck ] } | 
					
						
							|  |  |  |         { { { ?a ?b ?c } { ?a ?b ?c ?a } } [ pick ] } | 
					
						
							|  |  |  |         { { { ?a ?b ?c } { ?c ?a ?b } } [ -rot ] } | 
					
						
							|  |  |  |         { { { ?a ?b ?c } { ?b ?c ?a } } [ rot ] } | 
					
						
							|  |  |  |         { { { ?a ?b } { ?b } } [ nip ] } | 
					
						
							|  |  |  |         { { { ?a ?b ?c } { ?c } } [ 2nip ] } | 
					
						
							|  |  |  |         { _ f } | 
					
						
							|  |  |  |     } match-choose ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | TUPLE: shuffle effect ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | M: shuffle pprint* effect>> effect>string text ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | M: #shuffle node>quot | 
					
						
							| 
									
										
										
										
											2008-08-12 00:30:18 -04:00
										 |  |  |     shuffle-effect dup pretty-shuffle | 
					
						
							|  |  |  |     [ % ] [ shuffle boa , ] ?if ;
 | 
					
						
							| 
									
										
										
										
											2008-08-11 00:37:12 -04:00
										 |  |  | 
 | 
					
						
							|  |  |  | : pushed-literals ( node -- seq )
 | 
					
						
							|  |  |  |     dup out-d>> [ node-value-info literal>> literalize ] with map ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | M: #push node>quot pushed-literals % ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | M: #call node>quot word>> , ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | M: #call-recursive node>quot label>> id>> , ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | DEFER: nodes>quot | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | DEFER: label | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | M: #recursive node>quot | 
					
						
							|  |  |  |     [ label>> id>> literalize , ] | 
					
						
							|  |  |  |     [ child>> nodes>quot , \ label , ] | 
					
						
							|  |  |  |     bi ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | M: #if node>quot | 
					
						
							|  |  |  |     children>> [ nodes>quot ] map % \ if , ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | M: #dispatch node>quot | 
					
						
							|  |  |  |     children>> [ nodes>quot ] map , \ dispatch , ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | M: #>r node>quot in-d>> length \ >r <repetition> % ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | M: #r> node>quot out-d>> length \ r> <repetition> % ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | M: node node>quot drop ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | : nodes>quot ( node -- quot )
 | 
					
						
							|  |  |  |     [ [ node>quot ] each ] [ ] make ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2008-08-11 03:49:37 -04:00
										 |  |  | : optimized. ( quot/word -- )
 | 
					
						
							| 
									
										
										
										
											2008-08-11 00:37:12 -04:00
										 |  |  |     dup word? [ specialized-def ] when
 | 
					
						
							|  |  |  |     build-tree optimize-tree nodes>quot . ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | SYMBOL: words-called | 
					
						
							|  |  |  | SYMBOL: generics-called | 
					
						
							|  |  |  | SYMBOL: methods-called | 
					
						
							|  |  |  | SYMBOL: intrinsics-called | 
					
						
							|  |  |  | SYMBOL: node-count | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | : make-report ( word/quot -- assoc )
 | 
					
						
							|  |  |  |     [ | 
					
						
							|  |  |  |         dup word? [ build-tree-from-word nip ] [ build-tree ] if
 | 
					
						
							|  |  |  |         optimize-tree | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  |         H{ } clone words-called set
 | 
					
						
							|  |  |  |         H{ } clone generics-called set
 | 
					
						
							|  |  |  |         H{ } clone methods-called set
 | 
					
						
							|  |  |  |         H{ } clone intrinsics-called set
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  |         0 swap [ | 
					
						
							|  |  |  |             >r 1+ r> | 
					
						
							|  |  |  |             dup #call? [ | 
					
						
							|  |  |  |                 word>> { | 
					
						
							|  |  |  |                     { [ dup "intrinsics" word-prop over "if-intrinsics" word-prop or ] [ intrinsics-called ] } | 
					
						
							|  |  |  |                     { [ dup generic? ] [ generics-called ] } | 
					
						
							|  |  |  |                     { [ dup method-body? ] [ methods-called ] } | 
					
						
							|  |  |  |                     [ words-called ] | 
					
						
							|  |  |  |                 } cond 1 -rot get at+
 | 
					
						
							|  |  |  |             ] [ drop ] if
 | 
					
						
							|  |  |  |         ] each-node | 
					
						
							|  |  |  |         node-count set
 | 
					
						
							|  |  |  |     ] H{ } make-assoc ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | : report. ( report -- )
 | 
					
						
							|  |  |  |     [ | 
					
						
							|  |  |  |         "==== Total number of IR nodes:" print
 | 
					
						
							|  |  |  |         node-count get .
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  |         { | 
					
						
							|  |  |  |             { generics-called "==== Generic word calls:" } | 
					
						
							|  |  |  |             { words-called "==== Ordinary word calls:" } | 
					
						
							|  |  |  |             { methods-called "==== Non-inlined method calls:" } | 
					
						
							|  |  |  |             { intrinsics-called "==== Open-coded intrinsic calls:" } | 
					
						
							|  |  |  |         } [ | 
					
						
							|  |  |  |             nl print get keys natural-sort stack. | 
					
						
							|  |  |  |         ] assoc-each
 | 
					
						
							|  |  |  |     ] bind ;
 | 
					
						
							|  |  |  | 
 | 
					
						
							|  |  |  | : optimizer-report. ( word -- )
 | 
					
						
							|  |  |  |     make-report report. ;
 |