On a completely unrelated note. Do you think that the way ArrayBuffers are
managed right now is faster than the way External strings are?
The strings appears to be living in the table (list), and this list is
iterated
on GC, freeing the items that have not been marked.
The arraybuffers live in a maps. Maps are copied, partially erased, and
everything is freed from them.
The performance-wise notes:
1. std::map.insert is slower than pushing stuff to the list
2. iterating over the list should have comparable speed (if not the same)
3. erasing might have equal speed, more on this in next paragraph
Erasure does not happen it all for external string, and for std::map it is
doing
a RB-tree lookup. But when freeing stuff from the external map we are
reading
all the markings that were inserted by GC.
It seems to me that if the erasure takes the same time, we may want to adopt
this concept for ArrayBuffers too, because std::map.insert is very slow.
What are your thoughts on this?
https://codereview.chromium.org/1324023007/
--
--
v8-dev mailing list
[email protected]
http://groups.google.com/group/v8-dev
---
You received this message because you are subscribed to the Google Groups "v8-dev" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
For more options, visit https://groups.google.com/d/optout.
