Author: Tom Kerrigan
Date: 14:43:15 04/18/00
Go up one level in this thread
On April 18, 2000 at 14:27:52, Andrew Dados wrote: >On April 18, 2000 at 12:48:28, Tom Kerrigan wrote: > >>On April 18, 2000 at 12:45:36, John Coffey wrote: >> >>>I am writting a data structure that I have to copy with every new node. I was >>>planning on using 16 bytes, but could maybe get it down to 8 using short >>>integers. I am wondering if short integers (16 bits) can be accessed any faster >>>than 32 bit integers or if they are actually slower. Also will the difference >> >>They're actually slower. >> > >I'll be picky: that depends on alignment - may be faster or slower or same...:) >Technically mov ax,[data16] has same timing as mov eax,[data32]. According to my tests, 16 bit stuff is always slower than 32 bit, even when I direct the compiler to align everything to 32 bits. If the instructions have the same timing, then I'm at a loss to explain this behavior. -Tom
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.