build-sub-tree ( in-d out-d word/quot -- nodes/f )

Vocabulary

compiler.tree.builder

Inputs

in-d	a sequence of values
out-d	a sequence of values
word/quot	a word or a quotation

Outputs

nodes/f

a sequence of nodes or f

Word description

Attempts to construct tree SSA IR from a quotation, starting with an initial data stack of values from the call site. Outputs f if stack effect inference fails.

Examples

USING: compiler.tree.builder math prettyprint ; { "x" } { "y" } [ 4 * ] build-sub-tree .
V{ T{ #push { literal 4 } { out-d { 1 } } } T{ #call { word * } { in-d V{ "x" 1 } } { out-d { 2 } } } T{ #copy { in-d V{ 2 } } { out-d { "y" } } } }

Definition

USING: accessors combinators compiler.tree
compiler.tree.builder.private continuations kernel sequences
stack-checker.errors ;

IN: compiler.tree.builder

:: build-sub-tree ( in-d out-d word/quot -- nodes/f )
    [
        in-d word/quot build-tree-with
        unclip-last in-d>> :> in-d' {
            { [ dup not ] [ ] }
            {
                [ dup ends-with-terminate? ]
                [ out-d [ f swap <#push> ] map append ]
            }
            [
                in-d' out-d
                [ 2length assert= ] [ <#copy> suffix ] 2bi
            ]
        } cond
    ] [ inference-error? ] ignore-error/f ;