GCC and Clang perform extremely slow on mod of power of 2 operation

Question

Consider following code:

int foo(int x) {
  if ((x) % 256 == 0)
    if ((x) % 16 == 0)
      return 0;
  return 1;
}

int bar(int x) {
  if ((x) & 255 ==