Re:Fast, simple, hard real time allocator for Rust
by sapiogram on Thursday May 02, 2024 @06:53AM
(#40234721)
Note that rustc will not emit this instruction by default, to support older CPUs. Without `target-cpu=haswell` or similar, the operation will be quite slow, but still O(1) of course.
Re:Fast, simple, hard real time allocator for Rust
by jsheard on Thursday May 02, 2024 @07:20AM
(#40234872)
It's not that bad, all x86 processors have the BSR instruction which can be mapped to LZCNT semantics with just a few extra instructions.
Left to right - modern x86-64, baseline x86-64, baseline i686:
https://rust.godbolt.org/z/nGsM35TEo
Maybe you're thinking of POPCNT, which hurts a lot more if it doesn't compile down to the native instruction:
Re:Fast, simple, hard real time allocator for Rust
by SkiFire13 on Thursday May 02, 2024 @12:39PM
(#40238232)
> That's O(1).
A loop over 2^64 elements is also O(1), but I don't think people are ok to label every program that can run on a 64 bit pc as O(1).
Re:Fast, simple, hard real time allocator for Rust
by xboxnolifes on Friday May 03, 2024 @11:15PM
(#40254520)
You should really refresh yourself on Big-O notation.
That's O(1).
> The LZCNT operation itself is a loop over all bits
That's not how circuits work. You can easily make a circuit of O(log n) depth that returns base-2 encoded index of the first 1 bit in a n-bit register.
But since n is just 64 here, you're looking at a circuit of AND/OR depth ~8, so it's no surprise that modern CPUs can compute the LZCNT / TZCNT of a 64-bit integer in a single CPU cycle.