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

Prev:	#branch
Next:	#dispatch

Vocabulary
compiler.tree

Class description
SSA tree node that implements conditional branching. It has the following slots:

children

A two item sequence. The first item holds the instructions executed if the condition is true and the second those that are executed if it is not true.

Definition

IN: compiler.tree

TUPLE: #if < #branch ;

Methods

USING: accessors arrays compiler.tree
compiler.tree.propagation.branches
compiler.tree.propagation.constraints kernel sequences ;

M: #if child-constraints in-d>> first [ =t ] [ =f ] bi 2array ;


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

M: #if emit-node
    {
        { [ dup trivial-if? ] [ drop emit-trivial-if ] }
        { [ dup trivial-not-if? ] [ drop emit-trivial-not-if ] }
        [ emit-actual-if ]
    } cond ;


USING: accessors combinators compiler.tree
compiler.tree.propagation.branches
compiler.tree.propagation.info kernel sequences ;

M: #if live-branches
    in-d>> first value-info class>> {
        { [ dup null-class? ] [ { f f } ] }
        { [ dup true-class? ] [ { t f } ] }
        { [ dup false-class? ] [ { f t } ] }
        [ { t t } ]
    } cond nip ;


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

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


USING: accessors compiler.tree compiler.tree.debugger kernel
make sequences ;

M: #if node>quot children>> [ nodes>quot ] map % \ if , ;


USING: accessors compiler.tree
compiler.tree.propagation.branches
compiler.tree.propagation.nodes generic kernel namespaces
sequences ;

M: #if propagate-around
    [ in-d>> first condition-value set ]
    [ M\ #if propagate-around (call-next-method) ] bi ;