3 ms·
Probably yes, and branch prediction improved a lot since then, too. Bounds checks are easily predictable.
by panstromek 2y ago
Probably yes, and branch prediction improved a lot since then, too. Bounds checks are easily predictable.
- Gibbon1 2y agoBounds checking feels to me like low hanging fruit for a processor designer. A low cost operation that can run in parallel or tossed away as the steam from the instruction decoder gets optimized and scheduled. Meanwhile the guys on the standards committee thinks of fixed width RISC instructions being executed by jungle logic and the ALU.
- adgjlsfhk1 2y agothe hard part about bounds checks is you need very specific semantics for bounds errors to prevent them from preventing vectorization. specifically, you don't want to promise that they are thrown when they are executed
- almostgotcaught 2y ago> preventing vectorization No one that wants to emit vectorized code is relying on auto-vectorization to emit that code.