[PPT] - I n t e r p r o c e d u r a l S p e c i a l i PowerPoint Presentation

SLIDE 1

I n t e r p r

c

e d u r a l S p e c i a l i z a t i

n
f

H i g h e r

O

r d e r D y n a m i c L a n g u a g e s W i t h

u

t S t a t i c A n a l y s i s

Baptiste Saleil baptiste.saleil@umontreal.ca Marc Feeley feeley@iro.umontreal.ca ECOOP June 22, 2017

SLIDE 2

I n t r

d

u c t i

n

1

 Research on JIT compilation

 Dynamic languages  Dynamic techniques

 LC: Research oriented Scheme compiler

 Scheme and Functional Programming Workshop 2014 & 2015  https://github.com/bsaleil/lc

SLIDE 3

I n t r

d

u c t i

n

2

 Dynamic languages

 Work done at compilation  Work done at execution

 Dynamic type checking

 Ensures safety of the primitives :)  Impact on performance :(

SLIDE 4

D y n a m i c t y p e c h e c k i n g

3

( d e f i n e ( s u m

t
1

x ) ( i f ( > x 1 ) ( + x ( s u m

t
1

( + x 1 ) ) ) ) )

 Example

SLIDE 5

D y n a m i c t y p e c h e c k i n g

( d e f i n e ( s u m

t
1

x ) ( i f ( > x 1 ) ( + x ( s u m

t
1

( + x 1 ) ) ) ) )

4 type checks in this code

 Example

3

SLIDE 6

D y n a m i c t y p e c h e c k i n g

( d e f i n e ( s u m

t
1

x ) ( i f ( > x 1 ) ( + x ( s u m

t
1

( + x 1 ) ) ) ) )

 Example  How can we remove them ?

4 type checks in this code

3

SLIDE 7

I n t e r p r

c

e d u r a l S p e c i a l i z a t i

n

( d e f i n e ( s u m

t
1

x ) ( i f ( > x 1 ) ( + x ( s u m

t
1

( + x 1 ) ) ) ) ) ( p r i n t ( s u m

t
1

6 ) ) ( p r i n t ( s u m

t
1

7 . 5 ) )

4

SLIDE 8

I n t e r p r

c

e d u r a l S p e c i a l i z a t i

n

( d e f i n e ( s u m

t
1

x ) ( i f ( > x 1 ) ( + x ( s u m

t
1

( + x 1 ) ) ) ) ) ( p r i n t ( s u m

t
1

6 ) ) ( p r i n t ( s u m

t
1

7 . 5 ) )

s u m

t
1

: ( x : i n t )

4

+

i n t

SLIDE 9

I n t e r p r

c

e d u r a l S p e c i a l i z a t i

n

( d e f i n e ( s u m

t
1

x ) ( i f ( > x 1 ) ( + x ( s u m

t
1

( + x 1 ) ) ) ) ) ( p r i n t ( s u m

t
1

6 ) ) ( p r i n t ( s u m

t
1

7 . 5 ) )

s u m

t
1

: ( x : i n t ) s u m

t
1

: ( x : f l

a

t )

4

+

i n t

+

f l

a

t

SLIDE 10

R u n n i n g E x a m p l e : H i g h e r

r

d e r f u n c t i

n

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

5

Closure that captures n

SLIDE 11

R u n n i n g E x a m p l e : H i g h e r

r

d e r f u n c t i

n

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

Closure that captures n

5

SLIDE 12

6

R u n n i n g E x a m p l e : H i g h e r

r

d e r f u n c t i

n

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

→ Static analysis (e.g. 0-CFA)

SLIDE 13

→ Static analysis (e.g. 0-CFA)

 JIT incompatible  Lacks precision

R u n n i n g E x a m p l e : H i g h e r

r

d e r f u n c t i

n

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

6

SLIDE 14

R u n n i n g E x a m p l e : H i g h e r

r

d e r f u n c t i

n

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

→ Static analysis (e.g. 0-CFA)

 JIT incompatible  Lacks precision

6

SLIDE 15

I n t e r p r

c

e d u r a l S p e c i a l i z a t i

n
f

H i g h e r

O

r d e r D y n a m i c L a n g u a g e s W i t h

u

t S t a t i c A n a l y s i s

7

SLIDE 16

I n t e r p r

c

e d u r a l S p e c i a l i z a t i

n
f

H i g h e r

O

r d e r D y n a m i c L a n g u a g e s W i t h

u

t S t a t i c A n a l y s i s

7

SLIDE 17

I n t e r p r

c

e d u r a l S p e c i a l i z a t i

n
f

H i g h e r

O

r d e r D y n a m i c L a n g u a g e s W i t h

u

t S t a t i c A n a l y s i s

7

SLIDE 18

I n t e r p r

c

e d u r a l S p e c i a l i z a t i

n
f

H i g h e r

O

r d e r D y n a m i c L a n g u a g e s W i t h

u

t S t a t i c A n a l y s i s

7

SLIDE 19

I n t e r p r

c

e d u r a l S p e c i a l i z a t i

n
f

H i g h e r

O

r d e r D y n a m i c L a n g u a g e s W i t h

u

t S t a t i c A n a l y s i s

→ Basic Block Versioning (BBV)

 Simple and Efgective Type Check Removal through Lazy Basic

Block Versioning Maxime Chevalier-Boisvert and Marc Feeley, ECOOP 2015

 Lazy intraprocedural code specialization (JIT)  No static analysis  Dynamic languages (JavaScript, Scheme, ...) 7

SLIDE 20

N a i v e c

m

p i l a t i

n

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

8

SLIDE 21

N a i v e c

m

p i l a t i

n

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

5 checks needed

8

SLIDE 22

B a s i c B l

c

k V e r s i

n

i n g

9

E n t r y p

i

n t S t u b 1

x : u n k n : u n k

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

SLIDE 23

B a s i c B l

c

k V e r s i

n

i n g

E n t r y p

i

n t i n t ? x S t u b 2 S t u b 3

x : u n k n : u n k x : i n t n : u n k x : u n k n : u n k

t r u e f a l s e

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

9

SLIDE 24

B a s i c B l

c

k V e r s i

n

i n g

E n t r y p

i

n t i n t ? x i n t ? n S t u b 2 S t u b 4 S t u b 5

x : u n k n : u n k x : i n t n : u n k x : i n t n : i n t x : u n k n : u n k x : i n t n : u n k

t r u e f a l s e t r u e f a l s e

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

9

SLIDE 25

B a s i c B l

c

k V e r s i

n

i n g

E n t r y p

i

n t i n t ? x i n t ? n x >

i n t

n ? S t u b 2 S t u b 4 S t u b 6 S t u b 7

x : u n k n : u n k x : i n t n : u n k x : i n t n : i n t x : i n t n : i n t x : u n k n : u n k x : i n t n : u n k x : i n t n : i n t

t r u e f a l s e t r u e f a l s e t r u e f a l s e

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

9

SLIDE 26

B a s i c B l

c

k V e r s i

n

i n g

E n t r y p

i

n t i n t ? x i n t ? n x >

i n t

n ? t 1 = x +

i n t

1 t 2 = f ( t 1 ) S t u b 2 S t u b 4 S t u b 6 S t u b 8

x : u n k n : u n k x : i n t n : u n k x : i n t n : i n t x : i n t n : i n t x : u n k n : u n k x : i n t n : i n t t 2 : u n k x : i n t n : u n k x : i n t n : i n t

t r u e f a l s e t r u e f a l s e t r u e f a l s e

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

9

SLIDE 27

B a s i c B l

c

k V e r s i

n

i n g

E n t r y p

i

n t i n t ? x i n t ? n x >

i n t

n ? t 1 = x +

i n t

1 t 2 = f ( t 1 ) S t u b 2 S t u b 4 S t u b 8

x : u n k n : u n k x : i n t n : u n k x : i n t n : i n t x : i n t n : i n t x : u n k n : u n k x : i n t n : i n t t 2 : u n k x : i n t n : u n k x : i n t n : i n t

t r u e f a l s e t r u e f a l s e t r u e f a l s e

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

r e t u r n

9

SLIDE 28

B a s i c B l

c

k V e r s i

n

i n g

E n t r y p

i

n t i n t ? x i n t ? n x >

i n t

n ? t 1 = x +

i n t

1 t 2 = f ( t 1 ) i n t ? t 2 S t u b 2 S t u b 4 S t u b 9 S t u b 1

x : u n k n : u n k x : i n t n : u n k x : i n t n : i n t x : i n t n : i n t x : u n k n : u n k x : i n t n : i n t t 2 : u n k x : i n t n : i n t t 2 : u n k x : i n t n : i n t t 2 : i n t x : i n t n : u n k x : i n t n : i n t

t r u e f a l s e t r u e f a l s e t r u e f a l s e t r u e f a l s e

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

r e t u r n

9

SLIDE 29

B a s i c B l

c

k V e r s i

n

i n g

E n t r y p

i

n t i n t ? x i n t ? n x >

i n t

n ? t 1 = x +

i n t

1 t 2 = f ( t 1 ) i n t ? t 2 S t u b 2 S t u b 4 S t u b 9

x : u n k n : u n k x : i n t n : u n k x : i n t n : i n t x : i n t n : i n t x : u n k n : u n k x : i n t n : i n t t 2 : u n k x : i n t n : i n t t 2 : u n k x : i n t n : i n t t 2 : i n t x : i n t n : u n k x : i n t n : i n t

t r u e f a l s e t r u e f a l s e t r u e f a l s e t r u e f a l s e

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

r e t u r n r e t u r n ( x +

i n t

t 2 )

9

SLIDE 30

B a s i c B l

c

k V e r s i

n

i n g

E n t r y p

i

n t i n t ? x i n t ? n x >

i n t

n ? t 1 = x +

i n t

1 t 2 = f ( t 1 ) i n t ? t 2 r e t u r n ( x +

i n t

t 2 ) r e t u r n S t u b 2 S t u b 4 S t u b 9

x : u n k n : u n k x : i n t n : u n k x : i n t n : i n t x : i n t n : i n t x : u n k n : u n k x : i n t n : i n t t 2 : u n k x : i n t n : i n t t 2 : u n k x : i n t n : i n t t 2 : i n t x : i n t n : u n k x : i n t n : i n t

t r u e f a l s e t r u e f a l s e t r u e f a l s e t r u e f a l s e

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

3 checks needed (2 removed)

9

SLIDE 31

O u r w

r

k : I n t e r p r

c

e d u r a l E x t e n s i

n

s

10

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

2 checks needed (3 removed)

Propagate the types through

function calls → no check on x

SLIDE 32

O u r w

r

k : I n t e r p r

c

e d u r a l E x t e n s i

n

s

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

1 check needed (4 removed)

Propagate the types through

function calls → no check on x

Propagate the types through

function returns → no check on the returned value

10

SLIDE 33

O u r w

r

k : I n t e r p r

c

e d u r a l E x t e n s i

n

s

Propagate the types through

function calls → no check on x

Propagate the types through

function returns → no check on the returned value

Specialize the code using

captured information → no check on n

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

no checks needed (5 removed)

10

SLIDE 34

O u r w

r

k : I n t e r p r

c

e d u r a l E x t e n s i

n

s

11

→ Several entry points, each specialized for a type combination

1. Extend the closure representation
Allow to store several entry points instead of 1
2. Dynamic dispatch to jump to the entry point
Each function call
Each function return (each continuation call)
3. Specialize using captured information

SLIDE 35

O u r w

r

k : I n t e r p r

c

e d u r a l E x t e n s i

n

s

→ Several entry points, each specialized for a type combination

1. Extend the closure representation
Allow storing multiple entry points instead of 1
2. Dynamic dispatch to jump to the entry point
Each function call
Each function return (each continuation call)
3. Specialize using captured information

11

SLIDE 36

O u r w

r

k : I n t e r p r

c

e d u r a l E x t e n s i

n

s

→ Several entry points, each specialized for a type combination

1. Extend the closure representation
Allow storing multiple entry points instead of 1
2. Dynamic dispatch to jump to the entry point
Each function call
Each function return (each continuation call)
3. Specialize using captured information

11

SLIDE 37

O u r w

r

k : I n t e r p r

c

e d u r a l E x t e n s i

n

s

→ Several entry points, each specialized for a type combination

1. Extend the closure representation
Allow storing multiple entry points instead of 1
2. Dynamic dispatch to jump to the entry point
Each function call
Each function return (each continuation call)
3. Specialize using captured information

11

SLIDE 38

I m p l e m e n t a t i

n

Closure representation extension

SLIDE 39

F l a t c l

s

u r e r e p r e s e n t a t i

n

12 v1 ... vn code address captured variable 1 ... captured variable n ... ...

SLIDE 40

F l a t c l

s

u r e r e p r e s e n t a t i

n

13

Stub memory space Closure instances Generated code

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

SLIDE 41

F l a t c l

s

u r e r e p r e s e n t a t i

n

Stub memory space Closure instances Generated code

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) ) 13

SLIDE 42

F l a t c l

s

u r e r e p r e s e n t a t i

n

Stub memory space Closure instances Generated code

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) ) 12 13

SLIDE 43

F l a t c l

s

u r e r e p r e s e n t a t i

n

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

Stub memory space Closure instances Generated code

13

SLIDE 44

I m p l e m e n t a t i

n

: F l a t c l

s

u r e e x t e n s i

n

14

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

Stub memory space Closure instances Entry point tables Generated code

SLIDE 45

I m p l e m e n t a t i

n

: F l a t c l

s

u r e e x t e n s i

n

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

Stub memory space Closure instances Entry point tables Generated code

( i n t )

14

SLIDE 46

I m p l e m e n t a t i

n

: F l a t c l

s

u r e e x t e n s i

n

( i n t ) ( f l

a

t )

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

Stub memory space Closure instances Entry point tables Generated code

14

SLIDE 47

I m p l e m e n t a t i

n

: F l a t c l

s

u r e e x t e n s i

n

( i n t ) ( f l

a

t )

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

Stub memory space Closure instances Entry point tables Generated code

14

SLIDE 48

I m p l e m e n t a t i

n

Dynamic dispatch

SLIDE 49

I m p l e m e n t a t i

n

: D y n a m i c d i s p a t c h

15

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

Stub memory space Closure instances Entry point tables Generated code

SLIDE 50

I m p l e m e n t a t i

n

: D y n a m i c d i s p a t c h

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

Stub memory space Closure instances Entry point tables Generated code

15

SLIDE 51

I m p l e m e n t a t i

n

: D y n a m i c d i s p a t c h

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

Stub memory space Closure instances Entry point tables Generated code

( i n t )

m a k e

s

u m e r

15

SLIDE 52

I m p l e m e n t a t i

n

: D y n a m i c d i s p a t c h

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

Stub memory space Closure instances Entry point tables Generated code

( i n t ) ( f l

a

t )

m a k e

s

u m e r

15

SLIDE 53

I m p l e m e n t a t i

n

: D y n a m i c d i s p a t c h

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

Stub memory space Closure instances Entry point tables Generated code

( i n t ) ( f l

a

t )

m a k e

s

u m e r f

15

SLIDE 54

I m p l e m e n t a t i

n

: D y n a m i c d i s p a t c h

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

Stub memory space Closure instances Entry point tables Generated code

( i n t ) ( f l

a

t )

m a k e

s

u m e r f

15

SLIDE 55

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

I m p l e m e n t a t i

n

: D y n a m i c d i s p a t c h

Stub memory space Closure instances Entry point tables Generated code

( i n t ) ( f l

a

t )

m a k e

s

u m e r f

15

SLIDE 56

I m p l e m e n t a t i

n

Captured information

SLIDE 57

I m p l e m e n t a t i

n

: C a p t u r e d i n f

r

m a t i

n

16

Stub memory space Closure instances Entry point tables Generated code

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

SLIDE 58

I m p l e m e n t a t i

n

: C a p t u r e d i n f

r

m a t i

n

Stub memory space Closure instances Entry point tables Generated code

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

16

SLIDE 59

I m p l e m e n t a t i

n

: C a p t u r e d i n f

r

m a t i

n

Stub memory space Closure instances Entry point tables Generated code

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) ) ( i n t )

m a k e

s

u m e r

16

( i n t )

SLIDE 60

I m p l e m e n t a t i

n

: C a p t u r e d i n f

r

m a t i

n

Stub memory space Closure instances Entry point tables Generated code

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) ) ( i n t ) ( f l

a

t )

m a k e

s

u m e r

16

( i n t ) ( f l

a

t )

SLIDE 61

I m p l e m e n t a t i

n

: C a p t u r e d i n f

r

m a t i

n

Stub memory space Closure instances Entry point tables Generated code

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

15

( i n t ) ( f l

a

t )

m a k e

s

u m e r f

16

( i n t ) ( f l

a

t )

SLIDE 62

I m p l e m e n t a t i

n

: C a p t u r e d i n f

r

m a t i

n

Stub memory space Closure instances Entry point tables Generated code

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

15

( i n t ) ( f l

a

t )

m a k e

s

u m e r f

16

( i n t ) ( f l

a

t )

SLIDE 63

I m p l e m e n t a t i

n

: C a p t u r e d i n f

r

m a t i

n

( d e f i n e ( m a k e

s

u m e r n ) ( l e t r e c ( ( f ( l a m b d a ( x ) ( i f ( > x n ) ( + x ( f ( + x 1 ) ) ) ) ) ) ) f ) ) ( d e f i n e s u m

t
1

( m a k e

s

u m e r 1 ) ) ( d e f i n e s u m

t
p

i ( m a k e

s

u m e r 3 . 1 4 ) ) ; 6 + 7 + 8 + 9 + 1 ( p r i n t ( s u m

t
1

6 ) ) ; 7 . 5 + 8 . 5 + 9 . 5 ( p r i n t ( s u m

t
1

7 . 5 ) ) ; 1 . 1 + 2 . 1 + 3 . 1 ( p r i n t ( s u m

t
p

i 1 . 1 ) )

Stub memory space Closure instances Entry point tables Generated code

( i n t ) ( f l

a

t )

( i n t ) ( f l

a

t )

15

m a k e

s

u m e r f

16

SLIDE 64

I m p l e m e n t a t i

n

17

 What about continuations ?

SLIDE 65

I m p l e m e n t a t i

n

 What about continuations ? → Function return is a call to the continuation → Conceptually same implementation !

17

SLIDE 66

I m p l e m e n t a t i

n

16

 What about continuations ? → Function return is a call to the continuation → Conceptually same implementation !

 Propagated types → Type of the returned value  Captured types → Type of the local variables

17

SLIDE 67

R E S U L T S

SLIDE 68

R e s u l t s

18

 35 benchmarks: Standard Scheme benchmarks  Confjgurations

 Intraprocedural BBV  Interprocedural: function specialization  Interprocedural: continuation specialization  Interprocedural: function and continuation specialization

 Metrics

 Number of type checks  Generated code size  Execution / Compilation / Total time

SLIDE 69

N u m b e r

f

t y p e c h e C k s

 Number of executed type checks relative to pure intraprocedural specialization

19

 No checks for 9 benchmarks  Significantly fewer checks for most of the

benchmarks

SLIDE 70

C

d

e s i z e

 Generated code size relative to pure intraprocedural specialization

20

 Less code generated for half of the

benchmarks

 Just 9% more code generated on average

SLIDE 71

E x e c u t i

n

t i m e

 Execution time relative to pure intraprocedural specialization

21

 Almost all benchmarks are faster  No benchmark is significantly slower  Up to 2x faster

SLIDE 72

E x e c u t i

n

t i m e ( v s G a m b i t )

 Execution time relative to the execution time of the code generated by the Gambit

Scheme compiler with dynamic checks turned off (capped at 400%) 22

 Faster than Gambit with dynamic checks

turned on

 Varies from 0.5x to 4x (6x slower with

Gambit executing all the checks)

SLIDE 73

C

m

p i l a t i

n

t i m e

 Compilation time relative to pure intraprocedural BBV

23

 Compilation time increase for most of

the benchmarks

 Mostly small increase in compilation

time, but up to 4x

SLIDE 74

T

t

a l t i m e

 Total time relative to pure intraprocedural BBV

24

 Large speedup for floating point (avoids

boxing)

 Most of the benchmarks are faster  From 0.14x to 1.33x

SLIDE 75

C O N C L U S I O N

SLIDE 76

C

n

c l u s i

n

 Lazy interprocedural specialization  Works well



Checks removed (up to 100%)



Faster code (up to 50%)

 Simple



Simple to implement



Does not require complex architecture

25

SLIDE 77

 Propagating other properties



Value (e.g. x = 1 )



Variable relationship (e.g. x < y )

 Function identity and return address propagation



Dynamic function inlining

 Register allocation information



Arguments



Returned value

F u t u r e w

r