stkrdknmibalz has quit [Ping timeout: 252 seconds]
ambv has joined #pypy
Atque has quit [Quit: ...]
ambv has quit [Quit: My MacBook has gone to sleep. ZZZzzz…]
ambv has joined #pypy
Atque has joined #pypy
Atque has quit [Quit: ...]
Atque has joined #pypy
ronan_ has joined #pypy
ronan has quit [Ping timeout: 268 seconds]
lritter has quit [Ping timeout: 265 seconds]
Atque has quit [Quit: ...]
Atque has joined #pypy
Atque has quit [Quit: ...]
Atque has joined #pypy
ronan_ is now known as ronan
isidentical has quit [Ping timeout: 265 seconds]
isidentical has joined #pypy
Atque has quit [Quit: ...]
smarr has joined #pypy
<smarr>
Looking through the RPython generated code, my interpreter loop is quite bloated. One of the things I'd like to see whether it makes a difference is the bounds check on my stack, allocated as `stack = [None] * max_stack_hight`. Would there possibly be an easy way to check what a bounce check eliminate could give? Though, I am pretty sure I couldn't proof correctness automatically.
ambv has quit [Quit: My MacBook has gone to sleep. ZZZzzz…]
greedom has joined #pypy
greedom has quit [Remote host closed the connection]
greedom has joined #pypy
greedom has quit [Remote host closed the connection]
jkovac12 has joined #pypy
jkovac1 has quit [Read error: Connection reset by peer]
jkovac12 is now known as jkovac1
greedom has joined #pypy
Corbin has quit [Ping timeout: 245 seconds]
greedom has quit [Remote host closed the connection]
benjaminp has quit [Ping timeout: 265 seconds]
benjamin1 has joined #pypy
isidentical has quit [Remote host closed the connection]