[Mono-bugs] [Bug 68723][Nor] Changed - Performance on long arith

bugzilla-daemon@bugzilla.ximian.com bugzilla-daemon@bugzilla.ximian.com
Sun, 24 Oct 2004 23:12:36 -0400 (EDT)

Please do not reply to this email- if you want to comment on the bug, go to the
URL shown below and enter your comments there.

Changed by writeonlymemory@gmail.com.


--- shadow/68723	2004-10-24 20:49:19.000000000 -0400
+++ shadow/68723.tmp.14645	2004-10-24 23:12:36.000000000 -0400
@@ -113,6 +113,11 @@
 as offsets from esp, and use ebp as another register. This makes
 recursion a tad faster. However, division, multiplication, etc are
 orders of magnitude more expensive than push ebp.
 I checked in the debugger that msft is not doing any fancy
 recursion->loop opts.
+------- Additional Comments From writeonlymemory@gmail.com  2004-10-24 23:12 -------
+OK well I'll try to come up with a counter example when I have a
+minute (exam tomorrow) but if it was just floating point, wouldn't the
+O(n) one run slower? I mean, it's doing more floating point arithmetic...