// Type your code here, or load an example.
int CheckIriUnicodeRange(unsigned utf32) {
   return ((utf32 - 0x10000) <= (0x1FFFD - 0x10000) ||
       (utf32 - 0x20000) <= (0x2FFFD - 0x20000) ||
       (utf32 - 0x30000) <= (0x3FFFD - 0x30000) ||
       (utf32 - 0x40000) <= (0x4FFFD - 0x40000) ||
       (utf32 - 0x50000) <= (0x5FFFD - 0x50000) ||
       (utf32 - 0x60000) <= (0x6FFFD - 0x60000) ||
       (utf32 - 0x70000) <= (0x7FFFD - 0x70000) ||
       (utf32 - 0x80000) <= (0x8FFFD - 0x80000) ||
       (utf32 - 0x90000) <= (0x9FFFD - 0x90000) ||
       (utf32 - 0xA0000) <= (0xAFFFD - 0xA0000) ||
       (utf32 - 0xB0000) <= (0xBFFFD - 0xB0000) ||
       (utf32 - 0xC0000) <= (0xCFFFD - 0xC0000) ||
       (utf32 - 0xD0000) <= (0xDFFFD - 0xD0000) ||
       (utf32 - 0xE1000) <= (0xEFFFD - 0xE1000));
}

Is it known lack of optimization?  bool foo(int a) {     int z;     if (a > 5) { z=1; } else { z=2; }     int y;     if (a > 10) {          // here z=1, so y = 2         y=z + 1;     } else {          // here z=1 or 2, so y = 3 or 4         y=z + 2;     }     // here y is either 2, 3 or 4     if (y == 5) {         // it is unreachable         return true;     } else {         return false;     } }  clang 9.0.0 gives following asm (even with -O3) https://godbolt.org/z/3j3CqC          xor     eax,...