2008-09-10 23:11:03 -04:00
|
|
|
! Copyright (C) 2006, 2008 Slava Pestov.
|
|
|
|
! See http://factorcode.org/license.txt for BSD license.
|
|
|
|
USING: arrays assocs classes classes.private classes.algebra
|
|
|
|
combinators hashtables kernel layouts math fry namespaces
|
|
|
|
quotations sequences system vectors words effects alien
|
2008-09-15 02:54:48 -04:00
|
|
|
byte-arrays accessors sets math.order compiler.cfg.instructions
|
|
|
|
compiler.cfg.registers ;
|
2008-09-10 23:11:03 -04:00
|
|
|
IN: compiler.cfg.stacks
|
|
|
|
|
|
|
|
! Converting stack operations into register operations, while
|
|
|
|
! doing a bit of optimization along the way.
|
|
|
|
|
|
|
|
USE: qualified
|
|
|
|
FROM: compiler.generator.registers => +input+ ;
|
|
|
|
FROM: compiler.generator.registers => +output+ ;
|
|
|
|
FROM: compiler.generator.registers => +scratch+ ;
|
|
|
|
FROM: compiler.generator.registers => +clobber+ ;
|
|
|
|
SYMBOL: known-tag
|
|
|
|
|
|
|
|
! Value protocol
|
|
|
|
GENERIC: set-operand-class ( class obj -- )
|
|
|
|
GENERIC: operand-class* ( operand -- class )
|
|
|
|
GENERIC: move-spec ( obj -- spec )
|
|
|
|
GENERIC: live-loc? ( actual current -- ? )
|
|
|
|
GENERIC# (lazy-load) 1 ( value spec -- value )
|
|
|
|
GENERIC# (eager-load) 1 ( value spec -- value )
|
|
|
|
GENERIC: lazy-store ( dst src -- )
|
|
|
|
GENERIC: minimal-ds-loc* ( min obj -- min )
|
|
|
|
|
|
|
|
! This will be a multimethod soon
|
|
|
|
DEFER: %move
|
|
|
|
|
|
|
|
PRIVATE>
|
|
|
|
|
|
|
|
: operand-class ( operand -- class )
|
|
|
|
operand-class* object or ;
|
|
|
|
|
|
|
|
! Default implementation
|
|
|
|
M: value set-operand-class 2drop ;
|
|
|
|
M: value operand-class* drop f ;
|
|
|
|
M: value live-loc? 2drop f ;
|
|
|
|
M: value minimal-ds-loc* drop ;
|
|
|
|
M: value lazy-store 2drop ;
|
|
|
|
|
|
|
|
M: vreg move-spec reg-class>> move-spec ;
|
|
|
|
|
|
|
|
M: int-regs move-spec drop f ;
|
|
|
|
M: int-regs operand-class* drop object ;
|
|
|
|
|
|
|
|
M: float-regs move-spec drop float ;
|
|
|
|
M: float-regs operand-class* drop float ;
|
|
|
|
|
|
|
|
M: ds-loc minimal-ds-loc* n>> min ;
|
|
|
|
M: ds-loc live-loc?
|
|
|
|
over ds-loc? [ [ n>> ] bi@ = not ] [ 2drop t ] if ;
|
|
|
|
|
|
|
|
M: rs-loc live-loc?
|
|
|
|
over rs-loc? [ [ n>> ] bi@ = not ] [ 2drop t ] if ;
|
|
|
|
|
|
|
|
M: loc operand-class* class>> ;
|
|
|
|
M: loc set-operand-class (>>class) ;
|
|
|
|
M: loc move-spec drop loc ;
|
|
|
|
|
|
|
|
M: f move-spec drop loc ;
|
|
|
|
M: f operand-class* ;
|
|
|
|
|
|
|
|
M: cached set-operand-class vreg>> set-operand-class ;
|
|
|
|
M: cached operand-class* vreg>> operand-class* ;
|
|
|
|
M: cached move-spec drop cached ;
|
|
|
|
M: cached live-loc? loc>> live-loc? ;
|
|
|
|
M: cached (lazy-load) >r vreg>> r> (lazy-load) ;
|
|
|
|
M: cached (eager-load) >r vreg>> r> (eager-load) ;
|
|
|
|
M: cached lazy-store
|
|
|
|
2dup loc>> live-loc?
|
|
|
|
[ "live-locs" get at %move ] [ 2drop ] if ;
|
|
|
|
M: cached minimal-ds-loc* loc>> minimal-ds-loc* ;
|
|
|
|
|
|
|
|
M: tagged set-operand-class (>>class) ;
|
|
|
|
M: tagged operand-class* class>> ;
|
|
|
|
M: tagged move-spec drop f ;
|
|
|
|
|
|
|
|
M: unboxed-alien operand-class* drop simple-alien ;
|
|
|
|
M: unboxed-alien move-spec class ;
|
|
|
|
|
|
|
|
M: unboxed-byte-array operand-class* drop c-ptr ;
|
|
|
|
M: unboxed-byte-array move-spec class ;
|
|
|
|
|
|
|
|
M: unboxed-f operand-class* drop \ f ;
|
|
|
|
M: unboxed-f move-spec class ;
|
|
|
|
|
|
|
|
M: unboxed-c-ptr operand-class* drop c-ptr ;
|
|
|
|
M: unboxed-c-ptr move-spec class ;
|
|
|
|
|
|
|
|
M: constant operand-class* value>> class ;
|
|
|
|
M: constant move-spec class ;
|
|
|
|
|
|
|
|
! Moving values between locations and registers
|
|
|
|
: %move-bug ( -- * ) "Bug in generator.registers" throw ;
|
|
|
|
|
|
|
|
: %unbox-c-ptr ( dst src -- )
|
|
|
|
dup operand-class {
|
|
|
|
{ [ dup \ f class<= ] [ drop %unbox-f ] }
|
|
|
|
{ [ dup simple-alien class<= ] [ drop %unbox-alien ] }
|
|
|
|
{ [ dup byte-array class<= ] [ drop %unbox-byte-array ] }
|
|
|
|
[ drop %unbox-any-c-ptr ]
|
|
|
|
} cond ; inline
|
|
|
|
|
|
|
|
: %move-via-temp ( dst src -- )
|
|
|
|
#! For many transfers, such as loc to unboxed-alien, we
|
|
|
|
#! don't have an intrinsic, so we transfer the source to
|
|
|
|
#! temp then temp to the destination.
|
|
|
|
int-regs next-vreg [ over %move operand-class ] keep
|
|
|
|
tagged new
|
|
|
|
swap >>vreg
|
|
|
|
swap >>class
|
|
|
|
%move ;
|
|
|
|
|
|
|
|
: %move ( dst src -- )
|
|
|
|
2dup [ move-spec ] bi@ 2array {
|
|
|
|
{ { f f } [ %copy ] }
|
|
|
|
{ { unboxed-alien unboxed-alien } [ %copy ] }
|
|
|
|
{ { unboxed-byte-array unboxed-byte-array } [ %copy ] }
|
|
|
|
{ { unboxed-f unboxed-f } [ %copy ] }
|
|
|
|
{ { unboxed-c-ptr unboxed-c-ptr } [ %copy ] }
|
|
|
|
{ { float float } [ %copy-float ] }
|
|
|
|
|
|
|
|
{ { f unboxed-c-ptr } [ %move-bug ] }
|
|
|
|
{ { f unboxed-byte-array } [ %move-bug ] }
|
|
|
|
|
2008-09-15 03:59:24 -04:00
|
|
|
{ { f constant } [ value>> %load-literal ] }
|
2008-09-10 23:11:03 -04:00
|
|
|
|
|
|
|
{ { f float } [ %box-float ] }
|
|
|
|
{ { f unboxed-alien } [ %box-alien ] }
|
|
|
|
{ { f loc } [ %peek ] }
|
|
|
|
|
|
|
|
{ { float f } [ %unbox-float ] }
|
|
|
|
{ { unboxed-alien f } [ %unbox-alien ] }
|
|
|
|
{ { unboxed-byte-array f } [ %unbox-byte-array ] }
|
|
|
|
{ { unboxed-f f } [ %unbox-f ] }
|
|
|
|
{ { unboxed-c-ptr f } [ %unbox-c-ptr ] }
|
|
|
|
{ { loc f } [ swap %replace ] }
|
|
|
|
|
|
|
|
[ drop %move-via-temp ]
|
|
|
|
} case ;
|
|
|
|
|
|
|
|
! A compile-time stack
|
|
|
|
TUPLE: phantom-stack height stack ;
|
|
|
|
|
|
|
|
M: phantom-stack clone
|
|
|
|
call-next-method [ clone ] change-stack ;
|
|
|
|
|
|
|
|
GENERIC: finalize-height ( stack -- )
|
|
|
|
|
|
|
|
: new-phantom-stack ( class -- stack )
|
|
|
|
>r 0 V{ } clone r> boa ; inline
|
|
|
|
|
|
|
|
: (loc) ( m stack -- n )
|
|
|
|
#! Utility for methods on <loc>
|
|
|
|
height>> - ;
|
|
|
|
|
|
|
|
: (finalize-height) ( stack word -- )
|
|
|
|
#! We consolidate multiple stack height changes until the
|
|
|
|
#! last moment, and we emit the final height changing
|
|
|
|
#! instruction here.
|
|
|
|
'[ dup zero? [ drop ] [ _ execute ] if 0 ] change-height drop ; inline
|
|
|
|
|
|
|
|
GENERIC: <loc> ( n stack -- loc )
|
|
|
|
|
|
|
|
TUPLE: phantom-datastack < phantom-stack ;
|
|
|
|
|
|
|
|
: <phantom-datastack> ( -- stack )
|
|
|
|
phantom-datastack new-phantom-stack ;
|
|
|
|
|
|
|
|
M: phantom-datastack <loc> (loc) <ds-loc> ;
|
|
|
|
|
|
|
|
M: phantom-datastack finalize-height
|
|
|
|
\ %inc-d (finalize-height) ;
|
|
|
|
|
|
|
|
TUPLE: phantom-retainstack < phantom-stack ;
|
|
|
|
|
|
|
|
: <phantom-retainstack> ( -- stack )
|
|
|
|
phantom-retainstack new-phantom-stack ;
|
|
|
|
|
|
|
|
M: phantom-retainstack <loc> (loc) <rs-loc> ;
|
|
|
|
|
|
|
|
M: phantom-retainstack finalize-height
|
|
|
|
\ %inc-r (finalize-height) ;
|
|
|
|
|
|
|
|
: phantom-locs ( n phantom -- locs )
|
|
|
|
#! A sequence of n ds-locs or rs-locs indexing the stack.
|
|
|
|
>r <reversed> r> '[ _ <loc> ] map ;
|
|
|
|
|
|
|
|
: phantom-locs* ( phantom -- locs )
|
|
|
|
[ stack>> length ] keep phantom-locs ;
|
|
|
|
|
|
|
|
: phantoms ( -- phantom phantom )
|
|
|
|
phantom-datastack get phantom-retainstack get ;
|
|
|
|
|
|
|
|
: (each-loc) ( phantom quot -- )
|
|
|
|
>r [ phantom-locs* ] [ stack>> ] bi r> 2each ; inline
|
|
|
|
|
|
|
|
: each-loc ( quot -- )
|
|
|
|
phantoms 2array swap '[ _ (each-loc) ] each ; inline
|
|
|
|
|
|
|
|
: adjust-phantom ( n phantom -- )
|
|
|
|
swap '[ _ + ] change-height drop ;
|
|
|
|
|
|
|
|
: cut-phantom ( n phantom -- seq )
|
|
|
|
swap '[ _ cut* swap ] change-stack drop ;
|
|
|
|
|
|
|
|
: phantom-append ( seq stack -- )
|
|
|
|
over length over adjust-phantom stack>> push-all ;
|
|
|
|
|
|
|
|
: add-locs ( n phantom -- )
|
|
|
|
2dup stack>> length <= [
|
|
|
|
2drop
|
|
|
|
] [
|
|
|
|
[ phantom-locs ] keep
|
|
|
|
[ stack>> length head-slice* ] keep
|
|
|
|
[ append >vector ] change-stack drop
|
|
|
|
] if ;
|
|
|
|
|
|
|
|
: phantom-input ( n phantom -- seq )
|
|
|
|
2dup add-locs
|
|
|
|
2dup cut-phantom
|
|
|
|
>r >r neg r> adjust-phantom r> ;
|
|
|
|
|
|
|
|
: each-phantom ( quot -- ) phantoms rot bi@ ; inline
|
|
|
|
|
|
|
|
: finalize-heights ( -- ) [ finalize-height ] each-phantom ;
|
|
|
|
|
|
|
|
: (live-locs) ( phantom -- seq )
|
|
|
|
#! Discard locs which haven't moved
|
|
|
|
[ phantom-locs* ] [ stack>> ] bi zip
|
|
|
|
[ live-loc? ] assoc-filter
|
|
|
|
values ;
|
|
|
|
|
|
|
|
: live-locs ( -- seq )
|
|
|
|
[ (live-locs) ] each-phantom append prune ;
|
|
|
|
|
|
|
|
! Operands holding pointers to freshly-allocated objects which
|
|
|
|
! are guaranteed to be in the nursery
|
|
|
|
SYMBOL: fresh-objects
|
|
|
|
|
|
|
|
: reg-spec>class ( spec -- class )
|
|
|
|
float eq? double-float-regs int-regs ? ;
|
|
|
|
|
|
|
|
: alloc-vreg ( spec -- reg )
|
|
|
|
[ reg-spec>class next-vreg ] keep {
|
|
|
|
{ f [ <tagged> ] }
|
|
|
|
{ unboxed-alien [ <unboxed-alien> ] }
|
|
|
|
{ unboxed-byte-array [ <unboxed-byte-array> ] }
|
|
|
|
{ unboxed-f [ <unboxed-f> ] }
|
|
|
|
{ unboxed-c-ptr [ <unboxed-c-ptr> ] }
|
|
|
|
[ drop ]
|
|
|
|
} case ;
|
|
|
|
|
|
|
|
: compatible? ( value spec -- ? )
|
|
|
|
>r move-spec r> {
|
|
|
|
{ [ 2dup = ] [ t ] }
|
|
|
|
{ [ dup unboxed-c-ptr eq? ] [
|
|
|
|
over { unboxed-byte-array unboxed-alien } member?
|
|
|
|
] }
|
|
|
|
[ f ]
|
|
|
|
} cond 2nip ;
|
|
|
|
|
|
|
|
: alloc-vreg-for ( value spec -- vreg )
|
|
|
|
alloc-vreg swap operand-class
|
|
|
|
over tagged? [ >>class ] [ drop ] if ;
|
|
|
|
|
|
|
|
M: value (lazy-load)
|
|
|
|
{
|
|
|
|
{ [ dup quotation? ] [ drop ] }
|
|
|
|
{ [ 2dup compatible? ] [ drop ] }
|
|
|
|
[ (eager-load) ]
|
|
|
|
} cond ;
|
|
|
|
|
|
|
|
M: value (eager-load) ( value spec -- vreg )
|
|
|
|
[ alloc-vreg-for ] [ drop ] 2bi
|
|
|
|
[ %move ] [ drop ] 2bi ;
|
|
|
|
|
|
|
|
M: loc lazy-store
|
|
|
|
2dup live-loc? [ "live-locs" get at %move ] [ 2drop ] if ;
|
|
|
|
|
|
|
|
: finalize-locs ( -- )
|
|
|
|
#! Perform any deferred stack shuffling.
|
|
|
|
live-locs [ dup f (lazy-load) ] H{ } map>assoc
|
|
|
|
dup assoc-empty? [ drop ] [
|
|
|
|
"live-locs" set [ lazy-store ] each-loc
|
|
|
|
] if ;
|
|
|
|
|
|
|
|
: finalize-vregs ( -- )
|
|
|
|
#! Store any vregs to their final stack locations.
|
|
|
|
[
|
|
|
|
dup loc? over cached? or [ 2drop ] [ %move ] if
|
|
|
|
] each-loc ;
|
|
|
|
|
|
|
|
: reset-phantom ( phantom -- )
|
|
|
|
#! Kill register assignments but preserve constants and
|
|
|
|
#! class information.
|
|
|
|
dup phantom-locs*
|
|
|
|
over stack>> [
|
|
|
|
dup constant? [ nip ] [
|
|
|
|
operand-class over set-operand-class
|
|
|
|
] if
|
|
|
|
] 2map
|
|
|
|
over stack>> delete-all
|
|
|
|
swap stack>> push-all ;
|
|
|
|
|
|
|
|
: reset-phantoms ( -- )
|
|
|
|
[ reset-phantom ] each-phantom ;
|
|
|
|
|
|
|
|
: finalize-contents ( -- )
|
|
|
|
finalize-locs finalize-vregs reset-phantoms ;
|
|
|
|
|
|
|
|
! Loading stacks to vregs
|
|
|
|
: vreg-substitution ( value vreg -- pair )
|
|
|
|
dupd <cached> 2array ;
|
|
|
|
|
|
|
|
: substitute-vreg? ( old new -- ? )
|
|
|
|
#! We don't substitute locs for float or alien vregs,
|
|
|
|
#! since in those cases the boxing overhead might kill us.
|
|
|
|
vreg>> tagged? >r loc? r> and ;
|
|
|
|
|
|
|
|
: substitute-vregs ( values vregs -- )
|
|
|
|
[ vreg-substitution ] 2map
|
|
|
|
[ substitute-vreg? ] assoc-filter >hashtable
|
|
|
|
'[ stack>> _ substitute-here ] each-phantom ;
|
|
|
|
|
|
|
|
: clear-phantoms ( -- )
|
|
|
|
[ stack>> delete-all ] each-phantom ;
|
|
|
|
|
|
|
|
: set-operand-classes ( classes -- )
|
|
|
|
phantom-datastack get
|
|
|
|
over length over add-locs
|
|
|
|
stack>> [ set-operand-class ] 2reverse-each ;
|
|
|
|
|
|
|
|
: finalize-phantoms ( -- )
|
|
|
|
#! Commit all deferred stacking shuffling, and ensure the
|
|
|
|
#! in-memory data and retain stacks are up to date with
|
|
|
|
#! respect to the compiler's current picture.
|
|
|
|
finalize-contents
|
|
|
|
clear-phantoms
|
|
|
|
finalize-heights
|
|
|
|
fresh-objects get [ empty? [ %gc ] unless ] [ delete-all ] bi ;
|
|
|
|
|
|
|
|
: fresh-object ( obj -- ) fresh-objects get push ;
|
|
|
|
|
|
|
|
: fresh-object? ( obj -- ? ) fresh-objects get memq? ;
|
|
|
|
|
|
|
|
: init-phantoms ( -- )
|
|
|
|
V{ } clone fresh-objects set
|
|
|
|
<phantom-datastack> phantom-datastack set
|
|
|
|
<phantom-retainstack> phantom-retainstack set ;
|
|
|
|
|
|
|
|
: copy-phantoms ( -- )
|
|
|
|
fresh-objects [ clone ] change
|
|
|
|
phantom-datastack [ clone ] change
|
|
|
|
phantom-retainstack [ clone ] change ;
|
|
|
|
|
|
|
|
: operand-tag ( operand -- tag/f )
|
|
|
|
operand-class dup [ class-tag ] when ;
|
|
|
|
|
|
|
|
UNION: immediate fixnum POSTPONE: f ;
|
|
|
|
|
|
|
|
: operand-immediate? ( operand -- ? )
|
|
|
|
operand-class immediate class<= ;
|
|
|
|
|
|
|
|
: phantom-push ( obj -- )
|
|
|
|
1 phantom-datastack get adjust-phantom
|
|
|
|
phantom-datastack get stack>> push ;
|
|
|
|
|
|
|
|
: phantom-shuffle ( shuffle -- )
|
|
|
|
[ in>> length phantom-datastack get phantom-input ] keep
|
|
|
|
shuffle phantom-datastack get phantom-append ;
|
|
|
|
|
|
|
|
: phantom->r ( n -- )
|
|
|
|
phantom-datastack get phantom-input
|
|
|
|
phantom-retainstack get phantom-append ;
|
|
|
|
|
|
|
|
: phantom-r> ( n -- )
|
|
|
|
phantom-retainstack get phantom-input
|
|
|
|
phantom-datastack get phantom-append ;
|
|
|
|
|
|
|
|
: phantom-drop ( n -- )
|
|
|
|
phantom-datastack get phantom-input drop ;
|
|
|
|
|
|
|
|
: phantom-rdrop ( n -- )
|
|
|
|
phantom-retainstack get phantom-input drop ;
|