This could explain performance regressions we've seen on the
performance of heavily-recursive algorithms. I'll try to get an
assembly dump for fib in JRuby later today.
- Charlie
On Wed, Jan 7, 2015 at 10:13 AM, Remi Forax wrote:
>
> On 01/07/2015 10:43 AM, Marcus Lagergren wrote:
>>
>> Remi, I
7u40 is when the native invoke dynamic implementation was replaced with Lambda
Forms :-/
/M
> On 07 Jan 2015, at 17:13, Remi Forax wrote:
>
>
> On 01/07/2015 10:43 AM, Marcus Lagergren wrote:
>> Remi, I tried to reproduce your problem with jdk9 b44. It runs decently fast.
>
> yes, nashorn is
On 01/07/2015 10:43 AM, Marcus Lagergren wrote:
Remi, I tried to reproduce your problem with jdk9 b44. It runs decently fast.
yes, nashorn is fast enough but it can be faster if the JIT was not
doing something stupid.
When the VM inline fibo, because fibo is recursive, the recursive call
i
Hi
70 TestMethods testCase = getTestMethod();
71 if (testCase == TestMethods.EXACT_INVOKER || testCase ==
TestMethods.INVOKER) {
72 // Invokers aren't collected.
73 return;
74 }
Can you just filter those test cases out
Remi, I tried to reproduce your problem with jdk9 b44. It runs decently fast.
When did it start to regress?
Regards
Marcus
> On 30 Dec 2014, at 20:48, Remi Forax wrote:
>
> Hi guys,
> I've found a bug in the interaction between the lambda form and inlining
> algorithm,
> basically if the inli
