497 lines
10 KiB
Factor
497 lines
10 KiB
Factor
IN: compiler.tree.cleanup.tests
|
|
USING: tools.test kernel.private kernel arrays sequences
|
|
math.private math generic words quotations alien alien.c-types
|
|
strings sbufs sequences.private slots.private combinators
|
|
definitions system layouts vectors math.partial-dispatch
|
|
math.order math.functions accessors hashtables classes assocs
|
|
io.encodings.utf8 io.encodings.ascii io.encodings fry slots
|
|
sorting.private
|
|
compiler.tree
|
|
compiler.tree.combinators
|
|
compiler.tree.cleanup
|
|
compiler.tree.builder
|
|
compiler.tree.recursive
|
|
compiler.tree.normalization
|
|
compiler.tree.propagation
|
|
compiler.tree.checker
|
|
compiler.tree.debugger ;
|
|
|
|
[ t ] [ [ [ 1 ] [ 2 ] if ] cleaned-up-tree [ #if? ] contains-node? ] unit-test
|
|
|
|
[ f ] [ [ f [ 1 ] [ 2 ] if ] cleaned-up-tree [ #if? ] contains-node? ] unit-test
|
|
|
|
[ f ] [ [ { array } declare [ 1 ] [ 2 ] if ] cleaned-up-tree [ #if? ] contains-node? ] unit-test
|
|
|
|
[ t ] [ [ { sequence } declare [ 1 ] [ 2 ] if ] cleaned-up-tree [ #if? ] contains-node? ] unit-test
|
|
|
|
: recursive-test ( a -- b ) dup [ not recursive-test ] when ; inline recursive
|
|
|
|
[ t ] [ [ recursive-test ] cleaned-up-tree [ #recursive? ] contains-node? ] unit-test
|
|
|
|
[ f ] [ [ f recursive-test ] cleaned-up-tree [ #recursive? ] contains-node? ] unit-test
|
|
|
|
[ t ] [ [ t recursive-test ] cleaned-up-tree [ #recursive? ] contains-node? ] unit-test
|
|
|
|
[ f ] [
|
|
[ { integer } declare >fixnum ]
|
|
\ >fixnum inlined?
|
|
] unit-test
|
|
|
|
GENERIC: mynot ( x -- y )
|
|
|
|
M: f mynot drop t ;
|
|
|
|
M: object mynot drop f ;
|
|
|
|
GENERIC: detect-f ( x -- y )
|
|
|
|
M: f detect-f ;
|
|
|
|
[ t ] [
|
|
[ dup [ mynot ] [ ] if detect-f ] \ detect-f inlined?
|
|
] unit-test
|
|
|
|
GENERIC: xyz ( n -- n )
|
|
|
|
M: integer xyz ;
|
|
|
|
M: object xyz ;
|
|
|
|
[ t ] [
|
|
[ { integer } declare xyz ] \ xyz inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ dup fixnum? [ xyz ] [ drop "hi" ] if ]
|
|
\ xyz inlined?
|
|
] unit-test
|
|
|
|
: (fx-repeat) ( i n quot: ( i -- i ) -- )
|
|
2over fixnum>= [
|
|
3drop
|
|
] [
|
|
[ swap >r call 1 fixnum+fast r> ] keep (fx-repeat)
|
|
] if ; inline recursive
|
|
|
|
: fx-repeat ( n quot -- )
|
|
0 -rot (fx-repeat) ; inline
|
|
|
|
! The + should be optimized into fixnum+, if it was not, then
|
|
! the type of the loop index was not inferred correctly
|
|
[ t ] [
|
|
[ [ dup 2 + drop ] fx-repeat ] \ + inlined?
|
|
] unit-test
|
|
|
|
: (i-repeat) ( i n quot: ( i -- i ) -- )
|
|
2over dup xyz drop >= [
|
|
3drop
|
|
] [
|
|
[ swap >r call 1+ r> ] keep (i-repeat)
|
|
] if ; inline recursive
|
|
|
|
: i-repeat >r { integer } declare r> 0 -rot (i-repeat) ; inline
|
|
|
|
[ t ] [
|
|
[ [ dup xyz drop ] i-repeat ] \ xyz inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { fixnum } declare dup 100 >= [ 1 + ] unless ] \ fixnum+ inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { fixnum fixnum } declare dupd < [ 1 + 1 + ] when ]
|
|
\ + inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { fixnum fixnum } declare dupd < [ 1 + 1 + ] when ]
|
|
\ + inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { fixnum } declare [ ] times ] \ >= inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { fixnum } declare [ ] times ] \ 1+ inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { fixnum } declare [ ] times ] \ + inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { fixnum } declare [ ] times ] \ fixnum+ inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { integer fixnum } declare dupd < [ 1 + ] when ]
|
|
\ + inlined?
|
|
] unit-test
|
|
|
|
[ f ] [
|
|
[ { integer fixnum } declare dupd < [ 1 + ] when ]
|
|
\ +-integer-fixnum inlined?
|
|
] unit-test
|
|
|
|
[ f ] [ [ dup 0 < [ neg ] when ] \ - inlined? ] unit-test
|
|
|
|
[ t ] [
|
|
[
|
|
[ no-cond ] 1
|
|
[ 1array dup quotation? [ >quotation ] unless ] times
|
|
] \ quotation? inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[
|
|
1000000000000000000000000000000000 [ ] times
|
|
] \ + inlined?
|
|
] unit-test
|
|
[ f ] [
|
|
[
|
|
1000000000000000000000000000000000 [ ] times
|
|
] \ +-integer-fixnum inlined?
|
|
] unit-test
|
|
|
|
[ f ] [
|
|
[ { bignum } declare [ ] times ]
|
|
\ +-integer-fixnum inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { array-capacity } declare 0 < ] \ < inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { array-capacity } declare 0 < ] \ fixnum< inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { array-capacity } declare 1 fixnum- ] \ fixnum- inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ 5000 [ 5000 [ ] times ] times ] \ 1+ inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ 5000 [ [ ] times ] each ] \ 1+ inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ 5000 0 [ dup 2 - swap [ 2drop ] curry each ] reduce ]
|
|
\ 1+ inlined?
|
|
] unit-test
|
|
|
|
GENERIC: annotate-entry-test-1 ( x -- )
|
|
|
|
M: fixnum annotate-entry-test-1 drop ;
|
|
|
|
: (annotate-entry-test-2) ( from to -- )
|
|
2dup >= [
|
|
2drop
|
|
] [
|
|
>r dup annotate-entry-test-1 1+ r> (annotate-entry-test-2)
|
|
] if ; inline recursive
|
|
|
|
: annotate-entry-test-2 0 -rot (annotate-entry-test-2) ; inline
|
|
|
|
[ f ] [
|
|
[ { bignum } declare annotate-entry-test-2 ]
|
|
\ annotate-entry-test-1 inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { float } declare 10 [ 2.3 * ] times >float ]
|
|
\ >float inlined?
|
|
] unit-test
|
|
|
|
GENERIC: detect-float ( a -- b )
|
|
|
|
M: float detect-float ;
|
|
|
|
[ t ] [
|
|
[ { real float } declare + detect-float ]
|
|
\ detect-float inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { float real } declare + detect-float ]
|
|
\ detect-float inlined?
|
|
] unit-test
|
|
|
|
[ f ] [
|
|
[ { fixnum fixnum } declare 7 bitand neg shift ]
|
|
\ fixnum-shift-fast inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { fixnum fixnum } declare 7 bitand neg shift ]
|
|
{ shift fixnum-shift } inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { fixnum fixnum } declare 1 swap 7 bitand shift ]
|
|
{ shift fixnum-shift } inlined?
|
|
] unit-test
|
|
|
|
[ f ] [
|
|
[ { fixnum fixnum } declare 1 swap 7 bitand shift ]
|
|
{ fixnum-shift-fast } inlined?
|
|
] unit-test
|
|
|
|
cell-bits 32 = [
|
|
[ t ] [
|
|
[ { fixnum fixnum } declare 1 swap 31 bitand shift ]
|
|
\ shift inlined?
|
|
] unit-test
|
|
|
|
[ f ] [
|
|
[ { fixnum fixnum } declare 1 swap 31 bitand shift ]
|
|
\ fixnum-shift inlined?
|
|
] unit-test
|
|
] when
|
|
|
|
[ t ] [
|
|
[ B{ 1 0 } *short 0 number= ]
|
|
\ number= inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ B{ 1 0 } *short 0 { number number } declare number= ]
|
|
\ number= inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ B{ 1 0 } *short 0 = ]
|
|
\ number= inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ B{ 1 0 } *short dup number? [ 0 number= ] [ drop f ] if ]
|
|
\ number= inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ HEX: ff bitand 0 HEX: ff between? ]
|
|
\ >= inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ HEX: ff swap HEX: ff bitand >= ]
|
|
\ >= inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { vector } declare nth-unsafe ] \ nth-unsafe inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[
|
|
dup integer? [
|
|
dup fixnum? [
|
|
1 +
|
|
] [
|
|
2 +
|
|
] if
|
|
] when
|
|
] \ + inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ 1000 [ 1+ ] map ] { 1+ fixnum+ } inlined?
|
|
] unit-test
|
|
|
|
: rec ( a -- b )
|
|
dup 0 > [ 1 - rec ] when ; inline recursive
|
|
|
|
[ t ] [
|
|
[ { fixnum } declare rec 1 + ]
|
|
{ > - + } inlined?
|
|
] unit-test
|
|
|
|
: fib ( m -- n )
|
|
dup 2 < [ drop 1 ] [ dup 1 - fib swap 2 - fib + ] if ; inline recursive
|
|
|
|
[ t ] [
|
|
[ 27.0 fib ] { < - + } inlined?
|
|
] unit-test
|
|
|
|
[ f ] [
|
|
[ 27.0 fib ] { +-integer-integer } inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ 27 fib ] { < - + } inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ 27 >bignum fib ] { < - + } inlined?
|
|
] unit-test
|
|
|
|
[ f ] [
|
|
[ 27/2 fib ] { < - } inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { fixnum } declare 10 [ -1 shift ] times ] \ shift inlined?
|
|
] unit-test
|
|
|
|
[ f ] [
|
|
[ { integer } declare 10 [ -1 shift ] times ] \ shift inlined?
|
|
] unit-test
|
|
|
|
[ f ] [
|
|
[ { fixnum } declare 1048575 fixnum-bitand 524288 fixnum- ]
|
|
\ fixnum-bitand inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { fixnum } declare [ drop ] each-integer ]
|
|
{ < <-integer-fixnum +-integer-fixnum + } inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { fixnum } declare length [ drop ] each-integer ]
|
|
{ < <-integer-fixnum +-integer-fixnum + } inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { fixnum } declare [ drop ] each ]
|
|
{ < <-integer-fixnum +-integer-fixnum + } inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { fixnum } declare 0 [ + ] reduce ]
|
|
{ < <-integer-fixnum nth-unsafe } inlined?
|
|
] unit-test
|
|
|
|
[ f ] [
|
|
[ { fixnum } declare 0 [ + ] reduce ]
|
|
\ +-integer-fixnum inlined?
|
|
] unit-test
|
|
|
|
[ f ] [
|
|
[
|
|
{ integer } declare [ ] map
|
|
] \ >fixnum inlined?
|
|
] unit-test
|
|
|
|
[ f ] [
|
|
[
|
|
{ integer } declare { } set-nth-unsafe
|
|
] \ >fixnum inlined?
|
|
] unit-test
|
|
|
|
[ f ] [
|
|
[
|
|
{ integer } declare 1 + { } set-nth-unsafe
|
|
] \ >fixnum inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[
|
|
{ array } declare length
|
|
1 + dup 100 fixnum> [ 1 fixnum+ ] when
|
|
] \ fixnum+ inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ [ resize-array ] keep length ] \ length inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ dup 0 > [ sqrt ] when ] \ sqrt inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { utf8 } declare decode-char ] \ decode-char inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ { ascii } declare decode-char ] \ decode-char inlined?
|
|
] unit-test
|
|
|
|
[ t ] [ [ { 1 2 } length ] { length length>> slot } inlined? ] unit-test
|
|
|
|
[ t ] [
|
|
[
|
|
{ integer } declare [ 0 >= ] map
|
|
] { >= fixnum>= } inlined?
|
|
] unit-test
|
|
|
|
[ ] [
|
|
[
|
|
4 pick array-capacity?
|
|
[ set-slot ] [ \ array-capacity 2nip bad-slot-value ] if
|
|
] cleaned-up-tree drop
|
|
] unit-test
|
|
|
|
[ ] [
|
|
[ { merge } declare accum>> 0 >>length ] cleaned-up-tree drop
|
|
] unit-test
|
|
|
|
[ ] [
|
|
[
|
|
[ "X" throw ]
|
|
[ dupd dup -1 < [ 0 >= [ ] [ "X" throw ] if ] [ drop ] if ]
|
|
if
|
|
] cleaned-up-tree drop
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ [ 2array ] [ 0 3array ] if first ]
|
|
{ nth-unsafe < <= > >= } inlined?
|
|
] unit-test
|
|
|
|
[ ] [
|
|
[ [ >r "A" throw r> ] [ "B" throw ] if ]
|
|
cleaned-up-tree drop
|
|
] unit-test
|
|
|
|
! Regression from benchmark.nsieve
|
|
: chicken-fingers ( i seq -- )
|
|
2dup < [
|
|
2drop
|
|
] [
|
|
chicken-fingers
|
|
] if ; inline recursive
|
|
|
|
: buffalo-wings ( i seq -- )
|
|
2dup < [
|
|
2dup chicken-fingers
|
|
>r 1+ r> buffalo-wings
|
|
] [
|
|
2drop
|
|
] if ; inline recursive
|
|
|
|
[ t ] [
|
|
[ 2 swap >fixnum buffalo-wings ]
|
|
{ <-integer-fixnum +-integer-fixnum } inlined?
|
|
] unit-test
|
|
|
|
! A reduction
|
|
: buffalo-sauce f ;
|
|
|
|
: steak ( -- )
|
|
buffalo-sauce [ steak ] when ; inline recursive
|
|
|
|
: ribs ( i seq -- )
|
|
2dup < [
|
|
steak
|
|
>r 1+ r> ribs
|
|
] [
|
|
2drop
|
|
] if ; inline recursive
|
|
|
|
[ t ] [
|
|
[ 2 swap >fixnum ribs ]
|
|
{ <-integer-fixnum +-integer-fixnum } inlined?
|
|
] unit-test
|
|
|
|
[ t ] [
|
|
[ hashtable new ] \ new inlined?
|
|
] unit-test
|