60 lines
1.7 KiB
Factor
60 lines
1.7 KiB
Factor
! Copyright (C) 2008 Slava Pestov.
|
|
! See http://factorcode.org/license.txt for BSD license.
|
|
USING: namespaces sequences assocs math kernel accessors fry
|
|
combinators sets locals columns
|
|
stack-checker.branches
|
|
compiler.tree
|
|
compiler.tree.def-use
|
|
compiler.tree.combinators ;
|
|
IN: compiler.tree.propagation.copy
|
|
|
|
! Two values are copy-equivalent if they are always identical
|
|
! at run-time ("DS" relation). This is just a weak form of
|
|
! value numbering.
|
|
|
|
! Mapping from values to their canonical leader
|
|
SYMBOL: copies
|
|
|
|
:: compress-path ( source assoc -- destination )
|
|
[let | destination [ source assoc at ] |
|
|
source destination = [ source ] [
|
|
[let | destination' [ destination assoc compress-path ] |
|
|
destination' destination = [
|
|
destination' source assoc set-at
|
|
] unless
|
|
destination'
|
|
]
|
|
] if
|
|
] ;
|
|
|
|
: resolve-copy ( copy -- val ) copies get compress-path ;
|
|
|
|
: is-copy-of ( val copy -- ) copies get set-at ;
|
|
|
|
: are-copies-of ( vals copies -- ) [ is-copy-of ] 2each ;
|
|
|
|
: introduce-value ( val -- ) copies get conjoin ;
|
|
|
|
GENERIC: compute-copy-equiv* ( node -- )
|
|
|
|
M: #renaming compute-copy-equiv* inputs/outputs are-copies-of ;
|
|
|
|
: compute-phi-equiv ( inputs outputs -- )
|
|
#! An output is a copy of every input if all inputs are
|
|
#! copies of the same original value.
|
|
[
|
|
swap remove-bottom [ resolve-copy ] map
|
|
dup [ all-equal? ] [ empty? not ] bi and
|
|
[ first swap is-copy-of ] [ 2drop ] if
|
|
] 2each ;
|
|
|
|
M: #phi compute-copy-equiv*
|
|
[ phi-in-d>> <flipped> ] [ out-d>> ] bi compute-phi-equiv ;
|
|
|
|
M: node compute-copy-equiv* drop ;
|
|
|
|
: compute-copy-equiv ( node -- )
|
|
[ node-defs-values [ introduce-value ] each ]
|
|
[ compute-copy-equiv* ]
|
|
bi ;
|