factor/unfinished/compiler/tree/escape-analysis/simple/simple.factor

87 lines
2.6 KiB
Factor
Raw Normal View History

2008-08-02 00:31:43 -04:00
! Copyright (C) 2008 Slava Pestov.
! See http://factorcode.org/license.txt for BSD license.
USING: kernel accessors sequences classes.tuple
2008-08-07 07:34:28 -04:00
classes.tuple.private arrays math math.private slots.private
2008-08-03 22:32:12 -04:00
combinators dequeues search-dequeues namespaces fry classes
2008-08-07 07:34:28 -04:00
classes.algebra stack-checker.state
2008-08-02 00:31:43 -04:00
compiler.tree
compiler.tree.propagation.info
compiler.tree.escape-analysis.nodes
compiler.tree.escape-analysis.allocations ;
IN: compiler.tree.escape-analysis.simple
2008-08-07 07:34:28 -04:00
M: #declare escape-analysis* drop ;
M: #terminate escape-analysis* drop ;
M: #renaming escape-analysis* inputs/outputs [ copy-value ] 2each ;
M: #introduce escape-analysis* value>> unknown-allocation ;
DEFER: record-literal-allocation
: make-literal-slots ( seq -- values )
[ <slot-value> [ swap record-literal-allocation ] keep ] map ;
: record-literal-tuple-allocation ( value object -- )
tuple-slots rest-slice
make-literal-slots
swap record-allocation ;
: record-literal-complex-allocation ( value object -- )
[ real-part ] [ imaginary-part ] bi 2array make-literal-slots
swap record-allocation ;
2008-08-04 05:35:31 -04:00
: record-literal-allocation ( value object -- )
2008-08-07 07:34:28 -04:00
{
{ [ dup class immutable-tuple-class? ] [ record-literal-tuple-allocation ] }
{ [ dup complex? ] [ record-literal-complex-allocation ] }
[ drop unknown-allocation ]
} cond ;
2008-08-04 05:35:31 -04:00
2008-08-03 22:32:12 -04:00
M: #push escape-analysis*
#! Delegation.
2008-08-04 05:35:31 -04:00
[ out-d>> first ] [ literal>> ] bi record-literal-allocation ;
2008-08-03 22:32:12 -04:00
2008-08-02 00:31:43 -04:00
: record-tuple-allocation ( #call -- )
#! Delegation.
dup dup in-d>> peek node-value-info literal>>
2008-08-03 22:32:12 -04:00
class>> immutable-tuple-class? [
2008-08-02 00:31:43 -04:00
[ in-d>> but-last ] [ out-d>> first ] bi
record-allocation
2008-08-04 05:35:31 -04:00
] [ out-d>> unknown-allocations ] if ;
2008-08-02 00:31:43 -04:00
2008-08-07 07:34:28 -04:00
: record-complex-allocation ( #call -- )
[ in-d>> ] [ out-d>> first ] bi record-allocation ;
: slot-offset ( #call -- n/f )
dup in-d>>
[ first node-value-info class>> ]
[ second node-value-info literal>> ] 2bi
dup fixnum? [
{
{ [ over tuple class<= ] [ 3 - ] }
{ [ over complex class<= ] [ 1 - ] }
[ drop f ]
} cond nip
] [ 2drop f ] if ;
2008-08-02 00:31:43 -04:00
: record-slot-call ( #call -- )
2008-08-07 07:34:28 -04:00
[ out-d>> first ] [ slot-offset ] [ in-d>> first ] tri
over [ record-slot-access ] [ 2drop unknown-allocation ] if ;
2008-08-02 00:31:43 -04:00
M: #call escape-analysis*
dup word>> {
{ \ <tuple-boa> [ record-tuple-allocation ] }
2008-08-07 07:34:28 -04:00
{ \ <complex> [ record-complex-allocation ] }
2008-08-02 00:31:43 -04:00
{ \ slot [ record-slot-call ] }
2008-08-04 05:35:31 -04:00
[
drop
[ in-d>> add-escaping-values ]
[ out-d>> unknown-allocations ] bi
]
2008-08-02 00:31:43 -04:00
} case ;
M: #return escape-analysis*
in-d>> add-escaping-values ;