factor/library/compiler/optimizer/call-optimizers.factor

183 lines
4.7 KiB
Factor
Raw Normal View History

2006-05-02 03:05:57 -04:00
! Copyright (C) 2005, 2006 Slava Pestov.
! See http://factorcode.org/license.txt for BSD license.
2005-09-09 00:17:19 -04:00
IN: optimizer
2006-05-15 01:01:47 -04:00
USING: arrays errors generic hashtables inference kernel
math math-internals sequences words parser ;
2005-08-08 15:21:14 -04:00
! A system for associating dataflow optimizers with words.
: optimizer-hooks ( node -- conditions )
node-param "optimizer-hooks" word-prop ;
: optimize-hooks ( node -- node/t )
dup optimizer-hooks cond ;
: define-optimizers ( word optimizers -- )
{ [ t ] [ drop t ] } add "optimizer-hooks" set-word-prop ;
2005-08-08 15:21:14 -04:00
: partial-eval? ( #call -- ? )
dup node-param "foldable" word-prop [
2006-08-06 22:30:52 -04:00
dup node-in-d [ node-literal? ] all-with?
2005-08-08 15:21:14 -04:00
] [
drop f
2005-09-24 15:21:17 -04:00
] if ;
2005-08-08 15:21:14 -04:00
: literal-in-d ( #call -- inputs )
2006-08-07 01:17:04 -04:00
dup node-in-d [ node-literal ] map-with ;
2005-08-08 15:21:14 -04:00
: partial-eval ( #call -- node )
dup literal-in-d over node-param
[ with-datastack ] catch
2005-09-24 15:21:17 -04:00
[ 3drop t ] [ inline-literals ] if ;
2005-08-08 15:21:14 -04:00
: call>no-op ( not -- )
2005-09-03 22:28:46 -04:00
#! Note: cloning the vectors, since subst-values will modify
#! them.
[ node-in-d clone ] keep
[ node-out-d clone ] keep
[ subst-values ] keep node-successor ;
2005-09-03 22:28:46 -04:00
2005-09-24 15:21:17 -04:00
: flip-branches ( not -- #if )
#! If a not is followed by an #if, flip branches and
2006-02-28 00:26:45 -05:00
#! remove the not.
call>no-op dup
dup node-children reverse swap set-node-children ;
\ not {
{ [ dup node-successor #if? ] [ flip-branches ] }
} define-optimizers
2005-08-14 01:17:25 -04:00
: disjoint-eq? ( node -- ? )
2005-08-14 17:33:45 -04:00
dup node-classes swap node-in-d
2005-09-23 01:22:04 -04:00
[ swap ?hash ] map-with
2005-09-24 15:21:17 -04:00
first2 2dup and [ classes-intersect? not ] [ 2drop f ] if ;
2005-08-14 01:17:25 -04:00
\ eq? {
{ [ dup disjoint-eq? ] [ [ f ] inline-literals ] }
} define-optimizers
: useless-coerce? ( node -- )
dup 0 node-class#
swap node-param "infer-effect" word-prop effect-out first
eq? ;
{ >fixnum >bignum >float } [
{
{ [ dup useless-coerce? ] [ call>no-op ] }
} define-optimizers
] each
! Arithmetic identities
SYMBOL: @
: define-identities ( words identities -- )
swap [ swap "identities" set-word-prop ] each-with ;
: literals-match? ( values template -- ? )
[
over value? [ >r value-literal r> ] [ nip @ ] if =
] 2map [ ] all? ;
: values-match? ( values template -- ? )
2005-09-18 01:37:28 -04:00
[ @ = [ drop f ] unless ] 2map [ ] subset all-eq? ;
: apply-identity? ( values identity -- ? )
first 2dup literals-match? >r values-match? r> and ;
2005-08-14 01:17:25 -04:00
: find-identity ( node -- values identity )
dup node-in-d swap node-param "identities" word-prop
[ dupd apply-identity? ] find nip ;
: apply-identities ( node -- node/f )
dup find-identity dup [
second swap dataflow-with [ subst-node ] keep
] [
3drop f
2005-09-24 15:21:17 -04:00
] if ;
[ + fixnum+ bignum+ float+ ] {
{ { @ 0 } [ drop ] }
{ { 0 @ } [ nip ] }
} define-identities
[ - fixnum- bignum- float- ] {
{ { @ 0 } [ drop ] }
{ { @ @ } [ 2drop 0 ] }
} define-identities
[ * fixnum* bignum* float* ] {
{ { @ 1 } [ drop ] }
{ { 1 @ } [ nip ] }
{ { @ 0 } [ nip ] }
{ { 0 @ } [ drop ] }
{ { @ -1 } [ drop 0 swap - ] }
{ { -1 @ } [ nip 0 swap - ] }
} define-identities
2006-05-05 23:06:08 -04:00
[ / fixnum/i fixnum/f bignum/i bignum/f float/f ] {
{ { @ 1 } [ drop ] }
{ { @ -1 } [ drop 0 swap - ] }
} define-identities
[ fixnum-mod bignum-mod ] {
{ { @ 1 } [ 2drop 0 ] }
} define-identities
[ bitand fixnum-bitand bignum-bitand ] {
{ { @ -1 } [ drop ] }
{ { -1 @ } [ nip ] }
{ { @ @ } [ drop ] }
{ { @ 0 } [ nip ] }
{ { 0 @ } [ drop ] }
} define-identities
[ bitor fixnum-bitor bignum-bitor ] {
{ { @ 0 } [ drop ] }
{ { 0 @ } [ nip ] }
{ { @ @ } [ drop ] }
{ { @ -1 } [ nip ] }
{ { -1 @ } [ drop ] }
} define-identities
[ bitxor fixnum-bitxor bignum-bitxor ] {
{ { @ 0 } [ drop ] }
{ { 0 @ } [ nip ] }
{ { @ -1 } [ drop bitnot ] }
{ { -1 @ } [ nip bitnot ] }
{ { @ @ } [ 2drop 0 ] }
} define-identities
[ shift fixnum-shift bignum-shift ] {
{ { 0 @ } [ drop ] }
{ { @ 0 } [ drop ] }
} define-identities
[ < fixnum< bignum< float< ] {
{ { @ @ } [ 2drop f ] }
} define-identities
[ <= fixnum<= bignum<= float<= ] {
{ { @ @ } [ 2drop t ] }
} define-identities
[ > fixnum> bignum> float>= ] {
{ { @ @ } [ 2drop f ] }
} define-identities
[ >= fixnum>= bignum>= float>= ] {
{ { @ @ } [ 2drop t ] }
} define-identities
2006-05-05 23:06:08 -04:00
[ eq? bignum= float= number= = ] {
{ { @ @ } [ 2drop t ] }
} define-identities
2005-08-14 01:17:25 -04:00
M: #call optimize-node*
{
{ [ dup partial-eval? ] [ partial-eval ] }
{ [ dup find-identity nip ] [ apply-identities ] }
{ [ dup optimizer-hooks ] [ optimize-hooks ] }
{ [ dup optimize-predicate? ] [ optimize-predicate ] }
2006-05-02 03:05:57 -04:00
{ [ t ] [ inline-method ] }
} cond ;