By the way, the fastest way was branchless linear scan up to 32-64 elements, as far as I remember.
I don't know about this, whenever I've benchmarked it on my use cases, unordered_map started to become faster than vector at well below 100 elements
Yet remembering how to measure time with nanosecond precision is the burden?
> By the way, the fastest way was branchless linear scan up to 32-64 elements, as far as I remember.
The analysis presented in the article is far more interesting, qualified, and useful that what you've produced here.
Pass by value describes the semantics of a function call, not implementation. Passing a const reference in C++ is pass-by-value. If the user opts to pass "a copy" instead, nothing requires the compiler to actually copy the data. The compiler is required only to supply the actual parameter as if it was copied.
The semantics of pass by const reference are also not exactly the same as pass by value in C++. The compiler can't in general assume a const reference doesn't alias other arguments or global variables and so has to be more conservative with certain optimizations than with pass by value.
I can cast the const away. The implementation does not hide this detail. The semantics therefore must be understood by the programmer.
[1] there is also call-by-push-value, but i was never able to wrap my mind around it.
Presumably this means for all arguments combined? If for example you pass four pointers each pointing to a 256-byte struct, you probably don’t want to pass all four structs (or even just one or two of the four?) by value instead.
In real world code, your caches and the CPU’s pipeline are influenced by some complex combination of what happens at the call site and what else the program is doing. So, a particular kind of call will perform better or worse than another kind of call depending on what else is happening.
The version of this benchmark that would have had predictive power is if you compared different kinds of call across a sufficiently diverse sampling of large programs that used those calls and also did other interesting things.
anonymous908213•3mo ago
What a fascinating CPU bug. I am quite curious as to how that came to pass.
sgarland•3mo ago
jasonthorsness•3mo ago
It would be great to repeat the author’s tests on other CPU models
TuxSH•3mo ago
astrange•3mo ago
Veserv•3mo ago
srcmax•3mo ago
jmalicki•3mo ago
nabla9•3mo ago
Apple's M2 uses 128-byte cache line.
themafia•3mo ago
gpderetta•3mo ago
I wonder if it has to do with a non-ideal implementation of virtual address resolution for the next page.