So one of the assumptions in nom's design is branch prediction will be mostly ok.But could it parse stuff while deferring branches to later?
Thinking forward, branch prediction close to maxed out but cache will increase somewhat
-
-
Probably room for speedup w. branchless even if it increases code size slightly. Worth a shot!
-
I might try my hand at the "tag" combinator first (recognizes a specific string) by reusing crypto constant time compare code (branchless)
-
Also, possible to measure rates of branch (mis) prediction: http://valgrind.org/docs/manual/cg-manual.html …
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.