←back to thread

A leap year check in three instructions

(hueffner.de)
420 points gnabgib | 5 comments | 15 May 25 21:57 UTC | HN request time: 0.001s | source
Show context
captaincrunch ◴[15 May 25 22:46 UTC] No.44000123[source]▶
This is fast, READABLE, and accurate:

bool is_leap_year(uint32_t y) { // Works for Gregorian years in range [0, 65535] return ((!(y & 3)) && ((y % 25 != 0) || !(y & 15))); }

replies(3): >>44000304 #>>44000522 #>>44003153 #
andrepd ◴[15 May 25 23:12 UTC] No.44000304[source]▶
This impl is mentioned in TFA.. It's much slower and includes branches.
replies(1): >>44000495 #
1. hoten ◴[15 May 25 23:52 UTC] No.44000495[source]▶
I'd expect even without optimizations on, there wouldn't be branches in the output for that code.
replies(1): >>44000544 #
2. kragen ◴[16 May 25 00:01 UTC] No.44000544[source]▶
There are, even with optimizations on. You could have checked: https://godbolt.org/#g:!((g:!((g:!((h:codeEditor,i:(filename...

I didn't find any way to get a compiler to generate a branchless version. I tried clang and GCC, both for amd64, with -O0, -O5, -Os, and for clang, -Oz.

replies(1): >>44000615 #
3. mmozeiko ◴[16 May 25 00:14 UTC] No.44000615[source]▶
If you change logic and/or to bitwise and/or then it'll be branchless.
replies(1): >>44014827 #
4. kragen ◴[17 May 25 15:01 UTC] No.44014827{3}[source]▶
True: https://godbolt.org/#g:!((g:!((g:!((h:codeEditor,i:(filename... but I understood hoten to be saying that compilers would generally produce that version from the short-circuiting version, and they don't.
replies(1): >>44017765 #
5. hoten ◴[17 May 25 23:29 UTC] No.44017765{4}[source]▶
Yeah I was wrong.

Do we know why the compiler doesn't do it? Surely the output is the same and avoiding branches is clearly faster.

Maybe short circuiting requires such an optimization not be made?