Regarding buffers: there should be some way to use a buffer as a stack.
Like,
whenever you go to assert that something is an expression (or some other
terminal production), you can truncate the buffer back to where it was
when
the
ExpressionClassifier was created. If you need to signal an error, it's
probably
acceptable to do linear search within some range of the buffer; you'd
have to
record the pushes and pops of when you make new ExpressionClassifiers
though.
Anyway that might allow ExpressionClassifier itself to not have to hold
onto
individual error locations, and just be a buffer offset + bitmask.
I gave this a go, but it's just as slow as "master". Patch here:
https://github.com/andywingo/v8/commit/545d33648de98998c9d0d1ac70df4620d8d03ba5
I don't really understand why it's just as slow (924M); it should be faster!
https://codereview.chromium.org/1140813008/
--
--
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.
