[clang] [clang][bytecode] Only count taken jumps as steps (PR #201845)

[Timm Baeder via cfe-commits]

tbaederr wrote:

> We probably should. (LLVM gets fancy with switch lowering, but even a simple binary search would solve the quadratic growth.)

Yeah, when initially landing the switch support I did a quick benchmark and it was slightly slower than what the current interpreter is doing. But whatever we do shouldn't regress the bytecode compilation time either because switch statements are often also small.

https://github.com/llvm/llvm-project/pull/201845