factor/basis/stack-checker/branches/branches.factor

123 lines
3.3 KiB
Factor

! Copyright (C) 2008 Slava Pestov.
! See http://factorcode.org/license.txt for BSD license.
USING: fry vectors sequences assocs math accessors kernel
combinators quotations namespaces grouping stack-checker.state
stack-checker.backend stack-checker.errors stack-checker.visitor
stack-checker.values stack-checker.recursive-state ;
IN: stack-checker.branches
: balanced? ( pairs -- ? )
[ second ] filter [ first2 length - ] map all-equal? ;
SYMBOL: +bottom+
: unify-inputs ( max-d-in d-in meta-d -- new-meta-d )
dup [ [ - +bottom+ <repetition> ] dip append ] [ 3drop f ] if ;
: pad-with-bottom ( seq -- newseq )
dup empty? [
dup [ length ] map supremum
'[ _ +bottom+ pad-left ] map
] unless ;
: phi-inputs ( max-d-in pairs -- newseq )
dup empty? [ nip ] [
swap '[ [ _ ] dip first2 unify-inputs ] map
pad-with-bottom
] if ;
: remove-bottom ( seq -- seq' )
+bottom+ swap remove ;
: unify-values ( values -- phi-out )
remove-bottom
[ <value> ] [
[ known ] map dup all-eq?
[ first make-known ] [ drop <value> ] if
] if-empty ;
: phi-outputs ( phi-in -- stack )
flip [ unify-values ] map ;
SYMBOL: quotations
: unify-branches ( ins stacks -- in phi-in phi-out )
zip [ 0 { } { } ] [
[ keys supremum ] [ ] [ balanced? ] tri
[ dupd phi-inputs dup phi-outputs ]
[ quotations get unbalanced-branches-error ]
if
] if-empty ;
: branch-variable ( seq symbol -- seq )
'[ [ _ ] dip at ] map ;
: active-variable ( seq symbol -- seq )
[ [ terminated? over at [ drop f ] when ] map ] dip
branch-variable ;
: datastack-phi ( seq -- phi-in phi-out )
[ d-in branch-variable ] [ \ meta-d active-variable ] bi
unify-branches
[ d-in set ] [ ] [ dup >vector \ meta-d set ] tri* ;
: terminated-phi ( seq -- terminated )
terminated? branch-variable ;
: terminate-branches ( seq -- )
[ terminated? swap at ] all? [ terminate ] when ;
: compute-phi-function ( seq -- )
[ quotation active-variable sift quotations set ]
[ [ datastack-phi ] [ terminated-phi ] bi #phi, ]
[ terminate-branches ]
tri ;
: copy-inference ( -- )
\ meta-d [ clone ] change
literals [ clone ] change
d-in [ ] change ;
GENERIC: infer-branch ( literal -- namespace )
M: literal infer-branch
[
copy-inference
nest-visitor
[ value>> quotation set ] [ infer-literal-quot ] bi
] H{ } make-assoc ;
M: callable infer-branch
[
copy-inference
nest-visitor
[ quotation set ] [ infer-quot-here ] bi
] H{ } make-assoc ;
: infer-branches ( branches -- input children data )
[ pop-d ] dip
[ infer-branch ] map
[ stack-visitor branch-variable ] keep ; inline
: (infer-if) ( branches -- )
infer-branches
[ first2 #if, ] dip compute-phi-function ;
: infer-if ( -- )
2 literals-available? [
(infer-if)
] [
drop 2 consume-d
dup [ known [ curried? ] [ composed? ] bi or ] contains? [
output-d
[ rot [ drop call ] [ nip call ] if ]
infer-quot-here
] [
[ #drop, ] [ [ literal ] map (infer-if) ] bi
] if
] if ;
: infer-dispatch ( -- )
pop-literal nip infer-branches
[ #dispatch, ] dip compute-phi-function ;