Just curios, is it possible to replace AVL tree in helgrind with a
hashtable?
Will it perform better, esp on large inputs (i.e. where log(N) becomes too
large)?
--kcc
On Dec 10, 2007 5:50 PM, Julian Seward <[EMAIL PROTECTED]> wrote:
>
> > Did you see John`s followup that suggested a branch-free fast
> comparison?
>
> I tried it in Helgrind, and resulted in a slowdown compared to the
> obvious "if x < y then -1 else if x > y then 1 else 0", from 2m19
> to 2m29 on one test. gcc generates poor code for it, which I suspect
> is getting many partial-register-write stalls. This is something we
> can come back to when the (inevitable) next round of performance tuning
> happens.
>
> J
>
> -------------------------------------------------------------------------
> SF.Net email is sponsored by:
> Check out the new SourceForge.net Marketplace.
> It's the best place to buy or sell services for
> just about anything Open Source.
> http://sourceforge.net/services/buy/index.php
> _______________________________________________
> Valgrind-developers mailing list
> Valgrind-developers@lists.sourceforge.net
> https://lists.sourceforge.net/lists/listinfo/valgrind-developers
>
-------------------------------------------------------------------------
SF.Net email is sponsored by:
Check out the new SourceForge.net Marketplace.
It's the best place to buy or sell services for
just about anything Open Source.
http://sourceforge.net/services/buy/index.php
_______________________________________________
Valgrind-developers mailing list
Valgrind-developers@lists.sourceforge.net
https://lists.sourceforge.net/lists/listinfo/valgrind-developers
