Branches are prone to be faster than conditional moves if they are correctly pre... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

moonchild on July 6, 2023 | parent | context | favorite | on: {n} times faster than C

Branches are prone to be faster than conditional moves if they are correctly predicted, because they do not increase the critical path length. And utf-8 decoders are commonly run on all-ascii input. What were you benchmarking on?

aidenn0 on July 6, 2023 [–]

I ran separate benchmarks on all-ASCII, BMP-only, and ascii with non-BMP. ASCII was not slower on the low-branch version.

Join us for AI Startup School this June 16-17 in San Francisco!
Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact