#return
High-level optimizer operating on lexical tree SSA IR

Prev:	#recursive
Next:	#return-recursive

Vocabulary
compiler.tree

Definition

IN: compiler.tree

TUPLE: #return < node in-d info ;

Methods

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

M: #return annotate-node dup in-d>> (annotate-node) ;


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

M: #return check-stack-flow*
    check-in-d assert-datastack-empty terminated? get
    [ assert-retainstack-empty ] unless ;


USING: compiler.cfg.builder compiler.tree kernel ;

M: #return emit-node drop end-word ;


USING: accessors compiler.tree
compiler.tree.escape-analysis.allocations
compiler.tree.escape-analysis.nodes ;

M: #return escape-analysis* in-d>> add-escaping-values ;


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

M: #return mark-live-values* look-at-inputs ;


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

M: #return node-defs-values drop f ;


USING: accessors compiler.tree compiler.tree.tuple-unboxing
kernel ;

M: #return unbox-tuples* dup in-d>> assert-not-unboxed ;