2004-11-27 00:33:17 -05:00
|
|
|
! :folding=indent:collapseFolds=1:
|
|
|
|
|
|
|
|
! $Id$
|
|
|
|
!
|
|
|
|
! Copyright (C) 2004 Slava Pestov.
|
|
|
|
!
|
|
|
|
! Redistribution and use in source and binary forms, with or without
|
|
|
|
! modification, are permitted provided that the following conditions are met:
|
|
|
|
!
|
|
|
|
! 1. Redistributions of source code must retain the above copyright notice,
|
|
|
|
! this list of conditions and the following disclaimer.
|
|
|
|
!
|
|
|
|
! 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
|
|
! this list of conditions and the following disclaimer in the documentation
|
|
|
|
! and/or other materials provided with the distribution.
|
|
|
|
!
|
|
|
|
! THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES,
|
|
|
|
! INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND
|
|
|
|
! FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
|
|
|
|
! DEVELOPERS AND CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
! SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
|
|
! PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
|
|
|
|
! OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
|
|
|
! WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
|
|
|
|
! OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
|
|
|
! ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
2004-11-28 19:07:24 -05:00
|
|
|
IN: dataflow
|
|
|
|
USE: inference
|
2004-11-27 22:26:05 -05:00
|
|
|
USE: interpreter
|
2004-11-27 00:33:17 -05:00
|
|
|
USE: lists
|
2004-11-27 22:26:05 -05:00
|
|
|
USE: math
|
2004-11-27 00:33:17 -05:00
|
|
|
USE: namespaces
|
|
|
|
USE: stack
|
2004-11-27 22:26:05 -05:00
|
|
|
USE: words
|
|
|
|
USE: combinators
|
|
|
|
USE: vectors
|
2004-11-27 00:33:17 -05:00
|
|
|
|
|
|
|
! We build a dataflow graph for the compiler.
|
|
|
|
SYMBOL: dataflow-graph
|
|
|
|
|
|
|
|
SYMBOL: CALL ( non-tail call )
|
|
|
|
SYMBOL: JUMP ( tail-call )
|
|
|
|
SYMBOL: PUSH ( literal )
|
|
|
|
|
|
|
|
SYMBOL: IFTE
|
|
|
|
SYMBOL: GENERIC
|
|
|
|
SYMBOL: 2GENERIC
|
|
|
|
|
2004-11-28 19:07:24 -05:00
|
|
|
SYMBOL: node-consume-d
|
|
|
|
SYMBOL: node-produce-d
|
|
|
|
SYMBOL: node-consume-r
|
|
|
|
SYMBOL: node-produce-r
|
|
|
|
SYMBOL: node-op
|
|
|
|
|
|
|
|
! PUSH nodes have this field set to the value being pushed.
|
|
|
|
! CALL nodes have this as the word being called
|
|
|
|
SYMBOL: node-param
|
|
|
|
|
|
|
|
: <dataflow-node> ( param op -- node )
|
|
|
|
<namespace> [
|
|
|
|
node-op set
|
|
|
|
node-param set
|
|
|
|
{ } node-consume-d set
|
|
|
|
{ } node-produce-d set
|
|
|
|
{ } node-consume-r set
|
|
|
|
{ } node-produce-r set
|
|
|
|
] extend ;
|
2004-11-27 00:33:17 -05:00
|
|
|
|
2004-11-28 19:07:24 -05:00
|
|
|
: node-inputs ( d-count r-count -- )
|
|
|
|
#! Execute in the node's namespace.
|
|
|
|
meta-r get vector-tail* node-consume-r set
|
|
|
|
meta-d get vector-tail* node-consume-d set ;
|
2004-11-27 23:09:32 -05:00
|
|
|
|
2004-11-28 19:07:24 -05:00
|
|
|
: dataflow-inputs ( [ in | out ] node -- )
|
|
|
|
[ car 0 node-inputs ] bind ;
|
2004-11-27 00:33:17 -05:00
|
|
|
|
2004-11-28 19:07:24 -05:00
|
|
|
: node-outputs ( d-count r-count -- )
|
|
|
|
#! Execute in the node's namespace.
|
|
|
|
meta-r get vector-tail* node-produce-r set
|
|
|
|
meta-d get vector-tail* node-produce-d set ;
|
|
|
|
|
|
|
|
: dataflow-outputs ( [ in | out ] node -- )
|
|
|
|
[ cdr 0 node-outputs ] bind ;
|
|
|
|
|
|
|
|
: get-dataflow ( -- IR )
|
|
|
|
dataflow-graph get reverse ;
|
2004-11-27 22:26:05 -05:00
|
|
|
|
2004-11-28 19:07:24 -05:00
|
|
|
: dataflow, ( param op -- node )
|
|
|
|
#! Add a node to the dataflow IR.
|
|
|
|
<dataflow-node> dup dataflow-graph cons@ ;
|