Le mercredi 05 septembre 2018 à 18:43 -0700, Christian Hergert a écrit :
> On 09/05/2018 06:18 PM, Nicolas Dufresne wrote:
> > Is there any benchmark that would justify this added complexity ? Also,
> > there will be more context switch, so cache misses will take more time
> > then just loading the icon directly.
> Just because you've decoded into a non-shareable page of memory doesn't
> mean it wont swap and be trivialized into the same as the cached case
> but with everything else worse.
> Also, read-only caches can have the benefit of shoving the index table
> into the head of the file and embedding it in the inode ensuring that
> even your lookup table is fast and share-able.

I've replied to a comment about sandboxing image loading to prevent
possible crash buffer overflow from happening. You are now focusing on
an optimization. I believe you should start a new thread.


gtk-devel-list mailing list

Reply via email to