[Bug tree-optimization/104292] (bool)(bool0 + bool1) should be simplified into bool0 | bool1

2024-05-09 Thread pinskia at gcc dot gnu.org via Gcc-bugs
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=104292 --- Comment #5 from Andrew Pinski --- Note LLVM started to do this "trick" in 17.1.0.

[Bug tree-optimization/104292] (bool)(bool0 + bool1) should be simplified into bool0 | bool1

2023-06-22 Thread pinskia at gcc dot gnu.org via Gcc-bugs
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=104292 Andrew Pinski changed: What|Removed |Added Status|NEW |ASSIGNED Assignee|unassigned

[Bug tree-optimization/104292] (bool)(bool0 + bool1) should be simplified into bool0 | bool1

2023-06-22 Thread pinskia at gcc dot gnu.org via Gcc-bugs
https://gcc.gnu.org/bugzilla/show_bug.cgi?id=104292 --- Comment #4 from Andrew Pinski --- This should do it I think: (for neeq (ne eq) (simplify (neeq (plus zero_one_valued_p@0 zero_one_valued_p@1) INTEGER_CST@2) (with { tree_code newcode = ERROR_MARK; bool notatend = false; tre