1 ! Copyright (C) 2009, 2010 Slava Pestov.
2 ! See http://factorcode.org/license.txt for BSD license.
3 USING: accessors compiler.cfg.linear-scan.allocation.state
4 compiler.cfg.linear-scan.live-intervals
5 compiler.cfg.linear-scan.ranges hints kernel math namespaces
7 IN: compiler.cfg.linear-scan.allocation.splitting
9 : split-uses ( uses n -- before after )
10 [ '[ n>> _ < ] filter ] [ '[ n>> _ > ] filter ] 2bi ;
12 ERROR: splitting-too-early ;
14 ERROR: splitting-too-late ;
16 ERROR: splitting-atomic-interval ;
18 : check-split ( live-interval n -- )
19 check-allocation? get [
20 [ [ live-interval-start ] dip > [ splitting-too-early ] when ]
21 [ [ live-interval-end ] dip < [ splitting-too-late ] when ]
23 drop ranges>> ranges-endpoints =
24 [ splitting-atomic-interval ] when
26 ] [ 2drop ] if ; inline
28 : split-before ( before -- before' )
31 : split-after ( after -- after' )
32 f >>reg f >>reload-from ; inline
34 :: split-interval ( live-interval n -- before after )
35 live-interval n check-split
36 live-interval clone :> before
37 live-interval clone :> after
38 live-interval uses>> n split-uses before after [ uses<< ] bi-curry@ bi*
39 live-interval ranges>> n split-ranges before after [ ranges<< ] bi-curry@ bi*
43 HINTS: split-interval live-interval-state object ;