News for hackers. Stuff that matters.
Re:"Blackhole" interpreter in PyPy: new optimization in PyPy... by yanowitz on Sunday June 27, 2010 @07:21PM (#1466503)
Fascinating article, I love compiler design.

I wonder if code cache locality (of the interpreters) ever becomes and issue or is that level of concern irrelevant because that's ages away from being the bottleneck. What other issues (besides maintainability) does this approach have.

Re:"Blackhole" interpreter in PyPy: new optimization in PyPy... by megaman821 on Sunday June 27, 2010 @10:39PM (#1466870)
Very cool stuff, but in what situation does the code run the same for one thousand times or more and then all of a sudden cause a guard condition to fail. I know it must happen with some frequency, hence the blackhole interpreter, but what is the most common scenario?
Re:"Blackhole" interpreter in PyPy: new optimization in PyPy... by fijall on Monday June 28, 2010 @02:00AM (#1467215)
The thing is in case of tracing you don't record all paths taken, just the one at the hot point. So say you have if that takes every path every second go, the JIT will compile just one path at first. Then the guard will fail every second iteration, hence the blackhole. Of course at some point JIT will realize guard fails often enough and will compile another path, so you'll get a tree. And so on...
Re:"Blackhole" interpreter in PyPy: new optimization in PyPy... by janzer on Sunday June 27, 2010 @11:09PM (#1466915)
I'm not directly involved at all. But what comes to my mind is a loop exit condition or more accurately, and by definition I suppose, any trace exit.