factor/basis/compiler/tree/escape-analysis/nodes/nodes.factor

! Copyright (C) 2008, 2009 Slava Pestov.
! See http://factorcode.org/license.txt for BSD license.
USING: kernel sequences fry math namespaces
compiler.tree
compiler.tree.def-use
compiler.tree.escape-analysis.allocations ;
IN: compiler.tree.escape-analysis.nodes

GENERIC: escape-analysis* ( node -- )

SYMBOL: next-node

: each-with-next ( ... seq quot: ( ... elt -- ... ) -- ... )
    dupd '[ 1 + _ ?nth next-node set @ ] each-index ; inline

: (escape-analysis) ( nodes -- )
    [
        [ node-defs-values introduce-values ]
        [ escape-analysis* ]
        bi
    ] each-with-next ;
compiler.tree.escape-analysis: if the output of an #introduce node has an immutable tuple class type declaration, and it is not passed to any subroutine calls, or returned from the word, then unbox it. This speeds up vector arithmetic words on specialized arrays, because the specialized array is unboxed up-front, eliminating an indirection on every loop iteration 2009-08-09 17:29:21 -04:00			`! Copyright (C) 2008, 2009 Slava Pestov.`
Start work on escape analysis pass 2008-08-02 00:31:43 -04:00			`! See http://factorcode.org/license.txt for BSD license.`
compiler.tree.escape-analysis: if the output of an #introduce node has an immutable tuple class type declaration, and it is not passed to any subroutine calls, or returned from the word, then unbox it. This speeds up vector arithmetic words on specialized arrays, because the specialized array is unboxed up-front, eliminating an indirection on every loop iteration 2009-08-09 17:29:21 -04:00			`USING: kernel sequences fry math namespaces`
Working on tuple unboxing 2008-08-07 07:34:28 -04:00			`compiler.tree`
			`compiler.tree.def-use`
			`compiler.tree.escape-analysis.allocations ;`
Start work on escape analysis pass 2008-08-02 00:31:43 -04:00			`IN: compiler.tree.escape-analysis.nodes`

			`GENERIC: escape-analysis* ( node -- )`

compiler.tree.escape-analysis: if the output of an #introduce node has an immutable tuple class type declaration, and it is not passed to any subroutine calls, or returned from the word, then unbox it. This speeds up vector arithmetic words on specialized arrays, because the specialized array is unboxed up-front, eliminating an indirection on every loop iteration 2009-08-09 17:29:21 -04:00			`SYMBOL: next-node`

generalize stack effects so we can bootstrap with the stricter stack effect checking 2010-03-09 02:38:10 -05:00			`: each-with-next ( ... seq quot: ( ... elt -- ... ) -- ... )`
compiler.tree.escape-analysis: if the output of an #introduce node has an immutable tuple class type declaration, and it is not passed to any subroutine calls, or returned from the word, then unbox it. This speeds up vector arithmetic words on specialized arrays, because the specialized array is unboxed up-front, eliminating an indirection on every loop iteration 2009-08-09 17:29:21 -04:00			`dupd '[ 1 + _ ?nth next-node set @ ] each-index ; inline`

FFI rewrite part 7: compile callback bodies with the optimizing compiler 2010-07-28 00:49:26 -04:00			`: (escape-analysis) ( nodes -- )`
Working on tuple unboxing 2008-08-07 07:34:28 -04:00			`[`
			`[ node-defs-values introduce-values ]`
			`[ escape-analysis* ]`
			`bi`
compiler.tree.escape-analysis: if the output of an #introduce node has an immutable tuple class type declaration, and it is not passed to any subroutine calls, or returned from the word, then unbox it. This speeds up vector arithmetic words on specialized arrays, because the specialized array is unboxed up-front, eliminating an indirection on every loop iteration 2009-08-09 17:29:21 -04:00			`] each-with-next ;`