node
High-level optimizer operating on lexical tree SSA IR

Next:

#declare

Vocabulary
compiler.tree

Class description
Base class for all SSA tree nodes. The node is an identity-tuple which means that two different node instances with the same attributes are not equal.

Definition

USING: kernel ;

IN: compiler.tree

TUPLE: node < identity-tuple ;

Methods

USING: compiler.tree compiler.tree.def-use.simplified
compiler.tree.def-use.simplified.private kernel namespaces sets
;

M: node actually-defined-by* real-usage boa accum get adjoin ;


USING: compiler.tree compiler.tree.def-use.simplified
compiler.tree.def-use.simplified.private kernel namespaces sets
;

M: node actually-used-by* real-usage boa accum get adjoin ;


USING: compiler.tree compiler.tree.propagation.nodes kernel ;

M: node annotate-node drop ;


USING: compiler.tree compiler.tree.identities ;

M: node apply-identities* ;


USING: compiler.tree compiler.tree.checker kernel ;

M: node check-node* drop ;


USING: compiler.tree compiler.tree.cleanup ;

M: node cleanup-tree* ;


USING: compiler.tree compiler.tree.propagation.copy kernel ;

M: node compute-copy-equiv* drop ;


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

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


USING: compiler.tree compiler.tree.modular-arithmetic kernel ;

M: node compute-modular-candidates* drop ;


USING: compiler.tree compiler.tree.normalization.introductions
kernel ;

M: node count-introductions* drop ;


USING: compiler.tree compiler.tree.cleanup kernel ;

M: node delete-node drop ;


USING: compiler.tree compiler.tree.finalization ;

M: node finalize* ;


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

M: node mark-live-values* drop ;


USING: compiler.tree compiler.tree.recursive.private kernel ;

M: node node-call-graph 2drop ;


USING: accessors compiler.tree compiler.tree.def-use ;

M: node node-defs-values out-d>> ;


USING: accessors compiler.tree compiler.tree.def-use ;

M: node node-uses-values in-d>> ;


USING: compiler.tree compiler.tree.debugger kernel ;

M: node node>quot drop ;


USING: compiler.tree compiler.tree.normalization ;

M: node normalize* ;


USING: compiler.tree compiler.tree.modular-arithmetic kernel ;

M: node only-reads-low-order? drop f ;


USING: compiler.tree compiler.tree.modular-arithmetic ;

M: node optimize-modular-arithmetic* ;


USING: compiler.tree compiler.tree.propagation.nodes kernel ;

M: node propagate-after drop ;


USING: compiler.tree compiler.tree.propagation.nodes kernel ;

M: node propagate-around
    [ propagate-before ] [ annotate-node ] [ propagate-after ]
    tri ;


USING: compiler.tree compiler.tree.propagation.nodes kernel ;

M: node propagate-before drop ;


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

M: node remove-dead-code* ;


USING: accessors compiler.tree
compiler.tree.normalization.renaming ;

M: node rename-node-values* [ rename-values ] change-in-d ;


USING: compiler.tree compiler.tree.escape-analysis.check kernel
;

M: node run-escape-analysis* drop f ;