Author: Gerd Isenberg
Date: 12:03:21 06/25/04
Go up one level in this thread
On June 25, 2004 at 14:43:40, Dieter Buerssner wrote: >On June 24, 2004 at 16:13:03, Gerd Isenberg wrote: > >>Yes i mean such code size issues, three bytes more per load store ;-) >>At least one should try to keep the most often used locals inside this -128/127 >>range. Maybe POGO handles such issues. 4KByte and more requires some call >>checkstack for paging reasons. > >Do you mean 4 KB per routine, or total stack space? What will that checkstack >function do? Why is it needed? I don't know these levels of detail in the >implementations/hardware. I had the feeling, that the paging is done >automatically behinds the scenes (say when the stack pointer crosses a 4 KB >boundary, the paging mechanism of the OS will be called). Probably this is all >too naive. > >Cheers, >Dieter http://chessprogramming.org/cccsearch/ccc.php?art_id=357556 http://chessprogramming.org/cccsearch/ccc.php?art_id=357568 So it really seems negligible for "huge" search functions. Maybe my "bad" expirience has other sources by sideeffect or whatever. But nowadays i often use [ply-1] or [ply-2] and more a lot and prefere external arrays of nodes. One may simply use threadsafe preallocated external stacks too, eg. as member of a search thread object. Gerd
This page took 0.01 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.