Andreas Kling 17c1f742a9 LibJS/Bytecode: Increase coverage of left/shift expression fast paths ...

As long as the inputs are Int32, we can convert them to UInt32 in a
spec-compliant way with a simple static_cast<u32>.

This allows calculations like `-3 >>> 2` to take the fast path as well,
which is extremely valuable for stuff like crypto code.

While we're doing this, also remove the fast paths from the generic
shift functions in Value.cpp, since we only end up there if we *didn't*
take the same fast path in the interpreter.

2024-03-04 20:54:51 +01:00

94 KiB

Raw Blame History

View Raw