[Bug tree-optimization/106138] Inefficient code generation: logical AND of disjoint booleans from equal and bitwise AND not optimized to constant false

[pinskia at gcc dot gnu.org via Gcc-bugs]

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=106138

--- Comment #6 from Andrew Pinski <pinskia at gcc dot gnu.org> ---
Note for:
bool f(char x)
{
    bool b1 = x == 4;
    bool b2 = x & 4;
    return b1 && b2;
}


We should just get:
bool f(char x)
{
    return x == 4;
}

bit_ior should be handled too.