[fpc-pascal] Happy tickets benchmark

[leledumbo]

> Do you have any ideas why this kind of optimization is special?

Didn't Florian said that this kind of optimization has no benefit in real
world programs and will only increase compilation time?

> For info, simple loop test like 
>
>   while i < 1000000000 do 
>     i := i + 1; 
>
> shows that the FPC code is 2 times slower than Delphi 7 and Borland C 
> 5.5 and 4 times slower that C#.

Just checked such a code with gcc 5.3.0, in -O2 the generated assembly is:

	xorl	%eax, %eax
	ret

which literally does nothing. Without optimization the speed is equal.



--
View this message in context: http://free-pascal-general.1045716.n5.nabble.com/Happy-tickets-benchmark-tp5724109p5724197.html
Sent from the Free Pascal - General mailing list archive at Nabble.com.