[Bug tree-optimization/19055] Minor bit optimization with or and xor

2005-07-21 Thread pinskia at gcc dot gnu dot org
--- Additional Comments From cvs-commit at gcc dot gnu dot org 2005-07-21 19:34 --- Subject: Bug 19055 CVSROOT:/cvs/gcc Module name:gcc Changes by: [EMAIL PROTECTED] 2005-07-21 19:33:50 Modified files: gcc: ChangeLog fold-const.c gcc/t

[Bug tree-optimization/19055] Minor bit optimization with or and xor

2005-07-21 Thread cvs-commit at gcc dot gnu dot org
--- Additional Comments From cvs-commit at gcc dot gnu dot org 2005-07-21 19:34 --- Subject: Bug 19055 CVSROOT:/cvs/gcc Module name:gcc Changes by: [EMAIL PROTECTED] 2005-07-21 19:33:50 Modified files: gcc: ChangeLog fold-const.c gcc/t

[Bug tree-optimization/19055] Minor bit optimization with or and xor

2005-07-05 Thread pinskia at gcc dot gnu dot org
--- Additional Comments From pinskia at gcc dot gnu dot org 2005-07-05 13:53 --- Patch posted here: . -- What|Removed |Added -

[Bug tree-optimization/19055] Minor bit optimization with or and xor

2005-07-04 Thread pinskia at gcc dot gnu dot org
--- Additional Comments From pinskia at gcc dot gnu dot org 2005-07-05 00:02 --- I have a fix which I will be testing over night. -- What|Removed |Added AssignedTo|u

[Bug tree-optimization/19055] Minor bit optimization with or and xor

2005-02-22 Thread pinskia at gcc dot gnu dot org
--- Additional Comments From pinskia at gcc dot gnu dot org 2005-02-22 14:44 --- If we changed the function in comment #0 like so: int f(int a) { a=(a|1)^1; return a; } Fold should do this simplification. And likewise for comment #1 (which is just general case): int f(int a,int b)