1 ! Copyright (C) 2008, 2009 Slava Pestov.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: namespaces kernel assocs accessors sequences math math.order fry
4 combinators binary-search compiler.cfg.instructions compiler.cfg.registers
5 compiler.cfg.def-use compiler.cfg.liveness compiler.cfg.linearization.order
7 IN: compiler.cfg.linear-scan.live-intervals
9 TUPLE: live-range from to ;
11 C: <live-range> live-range
15 reg spill-to reload-from
16 start end ranges uses ;
18 GENERIC: covers? ( insn# obj -- ? )
20 M: f covers? 2drop f ;
22 M: live-range covers? [ from>> ] [ to>> ] bi between? ;
24 M: live-interval covers? ( insn# live-interval -- ? )
29 [ drop ] [ [ from>> <=> ] with search nip ] 2bi
33 ERROR: dead-value-error vreg ;
35 : shorten-range ( n live-interval -- )
37 [ vreg>> dead-value-error ] [ ranges>> last (>>from) ] if ;
39 : extend-range ( from to live-range -- )
45 : add-new-range ( from to live-interval -- )
46 [ <live-range> ] dip ranges>> push ;
48 : extend-range? ( to live-interval -- ? )
49 ranges>> [ drop f ] [ last from>> >= ] if-empty ;
51 : add-range ( from to live-interval -- )
53 [ extend-range ] [ add-new-range ] if ;
55 : add-use ( n live-interval -- )
58 : <live-interval> ( vreg -- live-interval )
64 : block-from ( bb -- n ) instructions>> first insn#>> 1 - ;
66 : block-to ( bb -- n ) instructions>> last insn#>> ;
68 M: live-interval hashcode*
69 nip [ start>> ] [ end>> 1000 * ] bi + ;
71 M: live-interval clone
72 call-next-method [ clone ] change-uses ;
74 ! Mapping from vreg to live-interval
75 SYMBOL: live-intervals
77 : live-interval ( vreg live-intervals -- live-interval )
78 [ <live-interval> ] cache ;
80 GENERIC: compute-live-intervals* ( insn -- )
82 M: insn compute-live-intervals* drop ;
84 : handle-output ( n vreg live-intervals -- )
86 [ add-use ] [ shorten-range ] 2bi ;
88 : handle-input ( n vreg live-intervals -- )
90 [ [ basic-block get block-from ] 2dip add-range ] [ add-use ] 2bi ;
92 : handle-temp ( n vreg live-intervals -- )
94 [ dupd add-range ] [ add-use ] 2bi ;
96 M: vreg-insn compute-live-intervals*
99 [ [ defs-vreg ] 2dip '[ [ _ ] dip _ handle-output ] when* ]
100 [ [ uses-vregs ] 2dip '[ [ _ ] dip _ handle-input ] each ]
101 [ [ temp-vregs ] 2dip '[ [ _ ] dip _ handle-temp ] each ]
104 : handle-live-out ( bb -- )
106 basic-block get [ block-from ] [ block-to ] bi
107 live-intervals get '[
108 [ _ _ ] dip _ live-interval add-range
111 : compute-live-intervals-step ( bb -- )
114 [ instructions>> <reversed> [ compute-live-intervals* ] each ] tri ;
116 : compute-start/end ( live-interval -- )
117 dup ranges>> [ first from>> ] [ last to>> ] bi
118 [ >>start ] [ >>end ] bi* drop ;
120 ERROR: bad-live-interval live-interval ;
122 : check-start ( live-interval -- )
123 dup start>> -1 = [ bad-live-interval ] [ drop ] if ;
125 : finish-live-intervals ( live-intervals -- )
126 ! Since live intervals are computed in a backward order, we have
127 ! to reverse some sequences, and compute the start and end.
130 [ ranges>> reverse-here ]
131 [ uses>> reverse-here ]
132 [ compute-start/end ]
137 : compute-live-intervals ( cfg -- live-intervals )
140 linearization-order <reversed>
141 [ compute-live-intervals-step ] each
142 ] keep values dup finish-live-intervals ;
144 : relevant-ranges ( interval1 interval2 -- ranges1 ranges2 )
145 [ [ ranges>> ] bi@ ] [ nip start>> ] 2bi '[ to>> _ >= ] filter ;
147 : intersect-live-range ( range1 range2 -- n/f )
148 2dup [ from>> ] bi@ > [ swap ] when
149 2dup [ to>> ] [ from>> ] bi* >= [ nip from>> ] [ 2drop f ] if ;
151 : intersect-live-ranges ( ranges1 ranges2 -- n )
153 { [ over empty? ] [ 2drop f ] }
154 { [ dup empty? ] [ 2drop f ] }
156 2dup [ first ] bi@ intersect-live-range dup [ 2nip ] [
158 2dup [ first from>> ] bi@ <
159 [ [ rest-slice ] dip ] [ rest-slice ] if
160 intersect-live-ranges
165 : intervals-intersect? ( interval1 interval2 -- ? )
166 relevant-ranges intersect-live-ranges >boolean ; inline