Author: David Rasmussen
Date: 12:57:08 01/18/03
Go up one level in this thread
On January 18, 2003 at 14:30:15, Matt Taylor wrote: > >Perahps they are generating inefficient code. I know MSVC 7 chokes big on 64-bit >code. Multiply and divide go to library calls, and I think 64-bit shift does >too. Mmm. That's weird. My bitboard-based program was as fast if not a little bit faster with NSVC7 then with MSVC6. I can't believe it's library calls. >In that case, try the assembly I posted (noting the redundancy that Dieter >pointed out in the gcc version). > >I truly find this sad if the compiler cannot make enough assumptions to generate >decent code for 1ull << count. (Though I can sympathize with the >compiler-writers a little bit.) > I don't know, but I guess I should check it's generated code. /David
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.