factor/library/inference/words.factor

152 lines
4.1 KiB
Factor

! Copyright (C) 2004, 2005 Slava Pestov.
! See http://factor.sf.net/license.txt for BSD license.
IN: inference
USING: errors generic interpreter kernel lists math
math-internals namespaces sequences strings vectors words
hashtables parser prettyprint ;
: consume-d ( typelist -- )
[ pop-d 2drop ] each ;
: produce-d ( typelist -- )
[ drop <computed> push-d ] each ;
: consume/produce ( word effect -- )
#! Add a node to the dataflow graph that consumes and
#! produces a number of values.
swap #call [
over [
2unseq swap consume-d produce-d
] hairy-node
] keep node, ;
: no-effect ( word -- )
"Stack effect inference of the word " swap word-name
" was already attempted, and failed" append3
inference-error ;
: recursive? ( word -- ? )
f swap dup word-def [ = or ] tree-each-with ;
: with-block ( word [[ label quot ]] quot -- block-node )
#! Execute a quotation with the word on the stack, and add
#! its dataflow contribution to a new #label node in the IR.
>r 2dup cons recursive-state [ cons ] change r>
[ swap car #label slip ] with-nesting
recursive-state [ cdr ] change ; inline
: inline-block ( word -- node-block )
gensym over word-def cons [
#entry node, word-def infer-quot #return node,
] with-block ;
: inline-compound ( word -- )
#! Infer the stack effect of a compound word in the current
#! inferencer instance. If the word in question is recursive
#! we infer its stack effect inside a new block.
dup recursive? [
inline-block node,
] [
word-def infer-quot
] ifte ;
: infer-compound ( word base-case -- effect )
#! Infer a word's stack effect in a separate inferencer
#! instance.
[
inferring-base-case set
recursive-state get init-inference
dup inline-block drop
effect
] with-scope [ consume/produce ] keep ;
GENERIC: apply-word
M: object apply-word ( word -- )
#! A primitive with an unknown stack effect.
no-effect ;
M: compound apply-word ( word -- )
#! Infer a compound word's stack effect.
[
dup f infer-compound "infer-effect" set-word-prop
] [
[ swap t "no-effect" set-word-prop rethrow ] when*
] catch ;
: apply-default ( word -- )
dup "no-effect" word-prop [
no-effect
] [
dup "infer-effect" word-prop [
over "infer" word-prop [
swap car ensure-d call drop
] [
consume/produce
] ifte*
] [
apply-word
] ifte*
] ifte ;
M: word apply-object ( word -- )
apply-default ;
M: symbol apply-object ( word -- )
apply-literal ;
: (base-case) ( word label -- )
over "inline" word-prop [
meta-d get clone >r
over inline-block drop
[ #call-label ] [ #call ] ?ifte
r> over set-node-in-d node,
] [
drop dup t infer-compound "base-case" set-word-prop
] ifte ;
: base-case ( word label -- )
[
inferring-base-case on
(base-case)
] [
inferring-base-case off
rethrow
] catch ;
: recursive-word ( word [[ label quot ]] -- )
#! Handle a recursive call, by either applying a previously
#! inferred base case, or raising an error. If the recursive
#! call is to a local block, emit a label call node.
over "infer-effect" word-prop [
nip consume/produce
] [
over "base-case" word-prop [
nip consume/produce
] [
inferring-base-case get [
2drop terminate
] [
car base-case
] ifte
] ifte*
] ifte* ;
M: compound apply-object ( word -- )
#! Apply the word's stack effect to the inferencer state.
dup recursive-state get assoc [
recursive-word
] [
dup "inline" word-prop [
inline-compound
] [
apply-default
] ifte
] ifte* ;
: infer-shuffle ( word -- )
dup #call [
over "infer-effect" word-prop
[ meta-d [ swap with-datastack ] change ] hairy-node
] keep node, ;