factor/library/inference/optimizer.factor

59 lines
1.6 KiB
Factor

! Copyright (C) 2004, 2006 Slava Pestov.
! See http://factorcode.org/license.txt for BSD license.
IN: optimizer
USING: compiler-backend generic hashtables inference io kernel
lists math namespaces sequences vectors ;
SYMBOL: optimizer-changed
GENERIC: optimize-node* ( node -- node/t )
: keep-optimizing ( node -- node ? )
dup optimize-node* dup t =
[ drop f ] [ nip keep-optimizing t or ] if ;
: optimize-node ( node -- node )
[
keep-optimizing [ optimizer-changed on ] when
] map-nodes ;
: optimize ( node -- node )
dup kill-values dup infer-classes [
optimizer-changed off
optimize-node
optimizer-changed get
] with-node-iterator [ optimize ] when ;
: prune-if ( node quot -- successor/t )
over >r call [ r> node-successor ] [ r> drop t ] if ;
inline
! Generic nodes
M: f optimize-node* drop t ;
M: node optimize-node* ( node -- t ) drop t ;
! #shuffle
: can-compose? ( shuffle -- ? )
dup shuffle-in-d length swap shuffle-in-r length +
vregs length <= ;
: compose-shuffle-nodes ( #shuffle #shuffle -- #shuffle/t )
[ [ node-shuffle ] 2apply compose-shuffle ] keep
over can-compose?
[ [ set-node-shuffle ] keep ] [ 2drop t ] if ;
M: #shuffle optimize-node* ( node -- node/t )
dup node-successor dup #shuffle? [
compose-shuffle-nodes
] [
drop [
dup node-in-d over node-out-d sequence=
>r dup node-in-r swap node-out-r sequence= r> and
] prune-if
] if ;
! #return
M: #return optimize-node* ( node -- node/t )
node-successor [ node-successor ] [ t ] if* ;