compute-live-values* ( value node -- )

Vocabulary

compiler.tree.dead-code.liveness

Inputs

value	an object
node	an object

Outputs

None

Definition

IN: compiler.tree.dead-code.liveness

GENERIC: compute-live-values* ( value node -- )

Methods

USING: compiler.tree compiler.tree.dead-code.liveness kernel ;

M: #alien-node compute-live-values* nip look-at-inputs ;


USING: accessors compiler.tree compiler.tree.dead-code.liveness
compiler.tree.dead-code.simple kernel ;

M: #call-recursive compute-live-values*
    [ out-d>> ] [ label>> return>> in-d>> ] bi look-at-mapping ;


USING: compiler.tree compiler.tree.dead-code.liveness kernel ;

M: #call compute-live-values* nip look-at-inputs ;


USING: accessors compiler.tree compiler.tree.dead-code.liveness
compiler.tree.dead-code.simple kernel ;

M: #copy compute-live-values*
    [ out-d>> ] [ in-d>> ] bi look-at-mapping ;


USING: accessors compiler.tree compiler.tree.dead-code.branches
compiler.tree.dead-code.liveness compiler.tree.recursive kernel
;

M: #enter-recursive compute-live-values*
    [ out-d>> ] [ recursive-phi-in ] bi look-at-phi ;


USING: accessors compiler.tree compiler.tree.dead-code.branches
compiler.tree.dead-code.liveness kernel ;

M: #phi compute-live-values*
    [ out-d>> ] [ phi-in-d>> ] bi look-at-phi ;


USING: accessors compiler.tree compiler.tree.dead-code.liveness
compiler.tree.dead-code.simple kernel ;

M: #return-recursive compute-live-values*
    [ out-d>> ] [ in-d>> ] bi look-at-mapping ;


USING: accessors assocs compiler.tree
compiler.tree.dead-code.liveness ;

M: #shuffle compute-live-values* mapping>> at look-at-value ;


USING: compiler.tree compiler.tree.dead-code.liveness kernel ;

M: node compute-live-values* 2drop ;