factor/library/compiler/optimizer/optimizer.factor

47 lines
1.2 KiB
Factor
Raw Normal View History

2006-03-02 01:12:32 -05:00
! Copyright (C) 2004, 2006 Slava Pestov.
! See http://factorcode.org/license.txt for BSD license.
2005-09-09 00:17:19 -04:00
IN: optimizer
2006-04-28 19:04:04 -04:00
USING: generic hashtables inference io kernel
lists math namespaces sequences vectors ;
2006-03-06 19:19:20 -05:00
SYMBOL: optimizer-changed
GENERIC: optimize-node* ( node -- node/t )
2005-05-21 16:05:39 -04:00
: keep-optimizing ( node -- node ? )
2005-07-27 01:46:06 -04:00
dup optimize-node* dup t =
2005-09-24 15:21:17 -04:00
[ drop f ] [ nip keep-optimizing t or ] if ;
2005-05-22 02:35:38 -04:00
2006-03-06 19:19:20 -05:00
: 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 ;
2005-07-27 01:46:06 -04:00
: prune-if ( node quot -- successor/t )
over >r call [ r> node-successor ] [ r> drop t ] if ;
inline
2005-05-22 02:35:38 -04:00
! Generic nodes
2005-07-27 01:46:06 -04:00
M: f optimize-node* drop t ;
2005-05-21 16:05:39 -04:00
2006-03-05 19:42:14 -05:00
M: node optimize-node* ( node -- t ) drop t ;
2005-05-21 16:05:39 -04:00
! #shuffle
M: #shuffle optimize-node* ( node -- node/t )
[ node-values empty? ] prune-if ;
2006-04-17 17:17:34 -04:00
! #push
M: #push optimize-node* ( node -- node/t )
[ node-out-d empty? ] prune-if ;
2006-04-17 17:17:34 -04:00
2005-08-13 04:01:21 -04:00
! #return
M: #return optimize-node* ( node -- node/t )
node-successor [ node-successor ] [ t ] if* ;