[Bug tree-optimization/95433] Failure to completely optimize simple compare after operations

[ebotcazou at gcc dot gnu.org]

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

Eric Botcazou <ebotcazou at gcc dot gnu.org> changed:

           What    |Removed                     |Added
----------------------------------------------------------------------------
                 CC|                            |ebotcazou at gcc dot gnu.org

--- Comment #4 from Eric Botcazou <ebotcazou at gcc dot gnu.org> ---
> Hmm, are we supposed to solve/simplify arbitrary linear equations?
> 
> 3 * x * x * x + 5 == 8
> 
> is equal to x == 1.
> 
> 3 * x * x + 5 == 8
> 
> is equal to abs(x) == 1.

Solving linear equations is at least tractable, which is not the case of
general polynomial equations, especially if the degree is greater than 4. ;-)