1 ! Copyright (C) 2004, 2010 Slava Pestov.
2 ! See https://factorcode.org/license.txt for BSD license.
3 USING: accessors arrays assocs kernel namespaces sequences
4 stack-checker.visitor vectors ;
7 TUPLE: node < identity-tuple ;
9 TUPLE: #introduce < node out-d ;
11 : <#introduce> ( out-d -- node )
12 #introduce new swap >>out-d ;
14 TUPLE: #call < node word in-d out-d body method class info ;
16 : <#call> ( inputs outputs word -- node )
22 TUPLE: #call-recursive < node label in-d out-d info ;
24 : <#call-recursive> ( inputs outputs label -- node )
30 TUPLE: #push < node literal out-d ;
32 : <#push> ( literal value -- node )
37 TUPLE: #renaming < node ;
39 TUPLE: #shuffle < #renaming mapping in-d out-d in-r out-r ;
41 : <#shuffle> ( in-d out-d in-r out-r mapping -- node )
49 : <#data-shuffle> ( in-d out-d mapping -- node )
50 [ f f ] dip <#shuffle> ; inline
52 : <#drop> ( inputs -- node )
53 { } { } <#data-shuffle> ;
55 TUPLE: #terminate < node in-d in-r ;
57 TUPLE: #branch < node in-d children live-branches ;
59 : new-branch ( value children class -- node )
62 swap 1array >>in-d ; inline
64 TUPLE: #if < #branch ;
66 : <#if> ( ? true false -- node )
67 2array #if new-branch ;
69 TUPLE: #dispatch < #branch ;
71 : <#dispatch> ( n branches -- node )
72 #dispatch new-branch ;
74 TUPLE: #phi < node phi-in-d phi-info-d out-d terminated ;
76 : <#phi> ( d-phi-in d-phi-out terminated -- node )
82 TUPLE: #declare < node declaration ;
84 : <#declare> ( declaration -- node )
88 TUPLE: #return < node in-d info ;
90 : <#return> ( stack -- node )
94 TUPLE: #recursive < node in-d word label loop? child ;
96 : <#recursive> ( label inputs child -- node )
102 TUPLE: #enter-recursive < node in-d out-d label info ;
104 : <#enter-recursive> ( label inputs outputs -- node )
110 TUPLE: #return-recursive < #renaming in-d out-d label info ;
112 : <#return-recursive> ( label inputs outputs -- node )
113 #return-recursive new
118 TUPLE: #copy < #renaming in-d out-d ;
120 : <#copy> ( inputs outputs -- node )
125 TUPLE: #alien-node < node params in-d out-d ;
127 TUPLE: #alien-invoke < #alien-node ;
129 TUPLE: #alien-indirect < #alien-node ;
131 TUPLE: #alien-assembly < #alien-node ;
133 TUPLE: #alien-callback < node params child ;
135 : node, ( node -- ) stack-visitor get push ;
137 GENERIC: inputs/outputs ( #renaming -- inputs outputs )
139 M: #shuffle inputs/outputs mapping>> unzip swap ;
140 M: #copy inputs/outputs [ in-d>> ] [ out-d>> ] bi ;
141 M: #return-recursive inputs/outputs [ in-d>> ] [ out-d>> ] bi ;
143 : ends-with-terminate? ( nodes -- ? )
144 [ f ] [ last #terminate? ] if-empty ;
146 M: vector child-visitor V{ } clone ;
147 M: vector #introduce, <#introduce> node, ;
148 M: vector #call, <#call> node, ;
149 M: vector #push, <#push> node, ;
150 M: vector #shuffle, <#shuffle> node, ;
151 M: vector #drop, <#drop> node, ;
152 M: vector #>r, [ [ f f ] dip ] [ swap zip ] 2bi #shuffle, ;
153 M: vector #r>, [ swap [ f swap ] dip f ] [ swap zip ] 2bi #shuffle, ;
154 M: vector #return, <#return> node, ;
155 M: vector #enter-recursive, <#enter-recursive> node, ;
156 M: vector #return-recursive, <#return-recursive> node, ;
157 M: vector #call-recursive, <#call-recursive> node, ;
158 M: vector #terminate, #terminate boa node, ;
159 M: vector #if, <#if> node, ;
160 M: vector #dispatch, <#dispatch> node, ;
161 M: vector #phi, <#phi> node, ;
162 M: vector #declare, <#declare> node, ;
163 M: vector #recursive, <#recursive> node, ;
164 M: vector #copy, <#copy> node, ;
165 M: vector #alien-invoke, #alien-invoke boa node, ;
166 M: vector #alien-indirect, #alien-indirect boa node, ;
167 M: vector #alien-assembly, #alien-assembly boa node, ;
168 M: vector #alien-callback, #alien-callback boa node, ;