[fpc-devel] Re: Compiler bottlenecks

Michael Schnell mschnell at lumino.de
Fri Jul 16 13:31:27 CEST 2010

  On 07/15/2010 04:43 PM, Hans-Peter Diettrich wrote:
> Just an idea: When the lists contain many entries, they could be split 
> into buckets. Then the currently searched bucket(s) could be locked 
> against use by other threads, which can skip them and inspect the next 
> bucket.
I suppose their idea is that concurrent requests are so seldom that it 
is not helpful to implement anything better than just using medium size 
chunks. _Detecting_ the conflict is another issue, as potentially 
necessary atomic instruction might slow down the program a lot.


More information about the fpc-devel mailing list