Thank you Thomas for the update, then.
Awaiting your coming work.
Regards,
Dieter
Am 10.10.2017 15:22, schrieb Thomas Helland:
Hi!
Thanks for keeping up with the long wait =)
I revisited this not too long ago, and found that with the new
pointer hashing function the benefits are zero to negati
Hi!
Thanks for keeping up with the long wait =)
I revisited this not too long ago, and found that with the new
pointer hashing function the benefits are zero to negative
from this series. I've reduced it to only the instruction set and
the string_to_uint_map patch but it's not convincing.
I suspec
Hello Thomas,
now, that you have write commit 'only' this one is missing.
Maybe you have time for this.
Latest version do not apply any longer.
Wende an: util: Avoid computing hash twice in string_to_uint_map
error: src/util/string_to_uint_map.h ist nicht im Index
Anwendung des Patches fehlgesc
Ping!
Any news, reviews --- anyone?
I'm running this all day without a hitch.
Cheers,
Dieter
Am 23.05.2017 05:40, schrieb Dieter Nützel:
For the series:
Tested-by: Dieter Nützel
on radeonsi/RX580
Unigine_Heaven-4.0, Unigine_Valley-1.0, Unigine_Superposition-1.0,
LS2015 (Wine-staging), Mes
For the series:
Tested-by: Dieter Nützel
on radeonsi/RX580
Unigine_Heaven-4.0, Unigine_Valley-1.0, Unigine_Superposition-1.0,
LS2015 (Wine-staging), Mesa-demos (objviewer)
Dieter
Am 22.05.2017 20:55, schrieb Thomas Helland:
While this doesn't prehash all the things, it does switch quite a l
While this doesn't prehash all the things, it does switch quite a lot
of places from doing a search and then a subsequent insert to first
hash the key, and then use this hash when searching / inserting.
While our new pointer hashing function remedied much of our overhead
hashing pointers, there is
