Native compilation article

[Jeff Sturm]

On 28 Jan 2002, Tom Tromey wrote:
> Runs with `long' were uniformly much slower than `int'.

Interesting...

> 16364 int -O2 -funroll-all-loops
...
> 48362 long -O2

The huge (factor of 3) difference appears to be caused by register
spillage.  Perhaps the experiemental regalloc would help.  From a quick
look at the assembly it wasn't obvious to me how it would improve (though
I'm certainly no expert on x86).

But the same test with primes.java on IBM's JDK shows it runs _faster_
with long's than int's.  What optimization could they possibly be using?

Jeff