-! Copyright (C) 2009, 2010 Slava Pestov.
-! See http://factorcode.org/license.txt for BSD license.
-USING: accessors arrays assocs fry locals kernel namespaces
-sequences sequences.deep
-sets vectors
-cpu.architecture
-compiler.cfg.rpo
-compiler.cfg.def-use
-compiler.cfg.registers
-compiler.cfg.dominance
-compiler.cfg.instructions
-compiler.cfg.liveness.ssa
-compiler.cfg.ssa.cssa
-compiler.cfg.ssa.interference
-compiler.cfg.ssa.interference.live-ranges
-compiler.cfg.utilities
-compiler.utilities ;
-FROM: namespaces => set ;
+! Copyright (C) 2009, 2011 Slava Pestov.
+! See https://factorcode.org/license.txt for BSD license.
+USING: accessors assocs compiler.cfg.def-use compiler.cfg.dominance
+compiler.cfg.instructions compiler.cfg.liveness
+compiler.cfg.parallel-copy compiler.cfg.rpo compiler.cfg.ssa.cssa
+compiler.cfg.ssa.destruction.coalescing compiler.cfg.ssa.destruction.leaders
+compiler.cfg.ssa.interference.live-ranges compiler.cfg.utilities
+kernel make sequences namespaces ;
IN: compiler.cfg.ssa.destruction
-! Because of the design of the register allocator, this pass
-! has three peculiar properties.
-!
-! 1) Instead of renaming vreg usages in the CFG, a map from
-! vregs to canonical representatives is computed. This allows
-! the register allocator to use the original SSA names to get
-! reaching definitions.
-! 2) Useless ##copy instructions, and all ##phi instructions,
-! are eliminated, so the register allocator does not have to
-! remove any redundant operations.
-! 3) A side effect of running this pass is that SSA liveness
-! information is computed, so the register allocator does not
-! need to compute it again.
-
-SYMBOL: leader-map
-
-: leader ( vreg -- vreg' ) leader-map get compress-path ;
-
-! Maps leaders to equivalence class elements.
-SYMBOL: class-element-map
-
-: class-elements ( vreg -- elts ) class-element-map get at ;
-
<PRIVATE
-! Sequence of vreg pairs
-SYMBOL: copies
-
-: value-of ( vreg -- value )
- insn-of dup ##tagged>integer? [ src>> ] [ dst>> ] if ;
-
-: init-coalescing ( -- )
- defs get
- [ [ drop dup ] assoc-map leader-map set ]
- [ [ [ dup dup value-of ] dip <vreg-info> 1array ] assoc-map class-element-map set ] bi
- V{ } clone copies set ;
-
-: coalesce-leaders ( vreg1 vreg2 -- )
- ! leader2 becomes the leader.
- swap leader-map get set-at ;
-
-: coalesce-elements ( merged vreg1 vreg2 -- )
- ! delete leader1's class, and set leader2's class to merged.
- class-element-map get [ delete-at ] [ set-at ] bi-curry bi* ;
-
-: coalesce-vregs ( merged leader1 leader2 -- )
- [ coalesce-leaders ] [ coalesce-elements ] 2bi ;
-
-:: maybe-eliminate-copy ( vreg1 vreg2 -- )
- ! Eliminate a copy of possible.
- vreg1 leader :> vreg1
- vreg2 leader :> vreg2
- vreg1 vreg2 eq? [
- vreg1 class-elements vreg2 class-elements sets-interfere?
- [ drop ] [ vreg1 vreg2 coalesce-vregs ] if
- ] unless ;
-
-GENERIC: prepare-insn ( insn -- )
-
-: maybe-eliminate-copy-later ( dst src -- )
- 2array copies get push ;
-
-M: insn prepare-insn drop ;
-
-M: vreg-insn prepare-insn
- [ temp-vregs [ leader-map get conjoin ] each ]
- [
- [ defs-vreg ] [ uses-vregs ] bi
- 2dup empty? not and [
- first
- 2dup [ rep-of reg-class-of ] bi@ eq?
- [ maybe-eliminate-copy-later ] [ 2drop ] if
- ] [ 2drop ] if
- ] bi ;
-
-M: ##copy prepare-insn
- [ dst>> ] [ src>> ] bi maybe-eliminate-copy-later ;
-
-M: ##tagged>integer prepare-insn
- [ dst>> ] [ src>> ] bi maybe-eliminate-copy ;
-
-M: ##phi prepare-insn
- [ dst>> ] [ inputs>> values ] bi
- [ maybe-eliminate-copy ] with each ;
-
-: prepare-block ( bb -- )
- instructions>> [ prepare-insn ] each ;
-
-: prepare-coalescing ( cfg -- )
- init-coalescing
- [ prepare-block ] each-basic-block ;
-
-: process-copies ( -- )
- copies get [ maybe-eliminate-copy ] assoc-each ;
-
-GENERIC: useful-insn? ( insn -- ? )
+GENERIC: cleanup-insn ( insn -- )
: useful-copy? ( insn -- ? )
- [ dst>> leader ] [ src>> leader ] bi eq? not ; inline
+ [ dst>> ] [ src>> ] bi leaders = not ; inline
+
+M: ##copy cleanup-insn
+ dup useful-copy? [ , ] [ drop ] if ;
-M: ##copy useful-insn? useful-copy? ;
+M: ##parallel-copy cleanup-insn
+ values>> [ leaders ] assoc-map [ first2 = ] reject
+ parallel-copy-rep % ;
-M: ##tagged>integer useful-insn? useful-copy? ;
+M: ##tagged>integer cleanup-insn
+ dup useful-copy? [ , ] [ drop ] if ;
-M: ##phi useful-insn? drop f ;
+M: ##phi cleanup-insn drop ;
-M: insn useful-insn? drop t ;
+M: insn cleanup-insn , ;
: cleanup-cfg ( cfg -- )
- [ [ useful-insn? ] filter! ] simple-optimization ;
+ [ [ [ cleanup-insn ] each ] V{ } make ] simple-optimization ;
PRIVATE>
-: destruct-ssa ( cfg -- cfg' )
- needs-dominance
-
- dup construct-cssa
- dup compute-defs
- dup compute-insns
- dup compute-ssa-live-sets
- dup compute-live-ranges
- dup prepare-coalescing
- process-copies
- dup cleanup-cfg ;
+: destruct-ssa ( cfg -- )
+ f leader-map set
+ {
+ needs-dominance
+ construct-cssa
+ compute-defs
+ compute-insns
+ compute-live-sets
+ compute-live-ranges
+ coalesce-cfg
+ cleanup-cfg
+ compute-live-sets
+ } apply-passes ;