| Age | Commit message (Expand) | Author | Files | Lines |
|---|
| 2023-11-28 | match.pd: Fix parity (X) ^ parity (Y) simplification [PR112719] | Jakub Jelinek | 1 | -1/+8 |
| 2023-11-28 | match.pd: Fix popcount (X) + popcount (Y) simplification [PR112719] | Jakub Jelinek | 1 | -2/+7 |
| 2023-11-27 | tree-optimization/112706 - missed simplification of condition | Richard Biener | 1 | -0/+9 |
| 2023-11-24 | match.pd: Avoid simplification into invalid BIT_FIELD_REFs [PR112673] | Jakub Jelinek | 1 | -1/+3 |
| 2023-11-17 | match.pd: Optimize ctz/popcount/parity/ffs on extended argument [PR112566] | Jakub Jelinek | 1 | -2/+181 |
| 2023-11-14 | Add type-generic clz/ctz/clrsb/ffs/parity/popcount builtins [PR111309] | Jakub Jelinek | 1 | -54/+148 |
| 2023-11-10 | middle-end/112469 - fix missing converts in vec_cond_expr simplification | Richard Biener | 1 | -4/+4 |
| 2023-11-09 | ifcvt: Add support for conditional copysign | Tamar Christina | 1 | -3/+3 |
| 2023-11-09 | middle-end: optimize fneg (fabs (x)) to copysign (x, -1) [PR109154] | Tamar Christina | 1 | -3/+7 |
| 2023-11-09 | middle-end: expand copysign handling from lockstep to nested iters | Tamar Christina | 1 | -24/+24 |
| 2023-11-06 | internal-fn: Add VCOND_MASK_LEN. | Robin Dapp | 1 | -0/+51 |
| 2023-10-31 | match.pd: Support combine cond_len_op + vec_cond similar to cond_op | Lehua Ding | 1 | -0/+39 |
| 2023-10-30 | MATCH: Add some more value_replacement simplifications to match | Andrew Pinski | 1 | -0/+18 |
| 2023-10-30 | MATCH: first of the value replacement moving from phiopt | Andrew Pinski | 1 | -0/+14 |
| 2023-10-27 | MATCH: Simplify `(X &| B) CMP X` if possible [PR 101590] | Andrew Pinski | 1 | -0/+24 |
| 2023-10-26 | match: Simplify `a != C1 ? abs(a) : C2` when C2 == abs(C1) [PR111957] | Andrew Pinski | 1 | -0/+10 |
| 2023-10-24 | match: Fix the `popcnt(a&b) + popcnt(a|b)` pattern for types [PR111913] | Andrew Pinski | 1 | -1/+1 |
| 2023-10-23 | move the (a-b) CMP 0 ? (a-b) : (b-a) optimization from fold_cond_expr_with_co... | Andrew Pinski | 1 | -3/+43 |
| 2023-10-18 | middle-end: Fold vec_cond into conditional ternary or binary operation when s... | Tamar Christina | 1 | -0/+24 |
| 2023-10-17 | MATCH: [PR111432] Simplify `a & (x | CST)` to a when we know that (a & ~CST) ... | Andrew Pinski | 1 | -0/+8 |
| 2023-10-16 | MATCH: Improve `A CMP 0 ? A : -A` set of patterns to use bitwise_equal_p. | Andrew Pinski | 1 | -20/+29 |
| 2023-10-16 | [PR31531] MATCH: Improve ~a < ~b and ~a < CST, allow a nop cast inbetween ~ a... | Andrew Pinski | 1 | -4/+6 |
| 2023-10-12 | wide-int: Allow up to 16320 bits wide_int and change widest_int precision to ... | Jakub Jelinek | 1 | -2/+6 |
| 2023-10-11 | MATCH: [PR111282] Simplify `a & (b ^ ~a)` to `a & b` | Andrew Pinski | 1 | -0/+20 |
| 2023-10-10 | MATCH: [PR111679] Add alternative simplification of `a | ((~a) ^ b)` | Andrew Pinski | 1 | -0/+8 |
| 2023-10-06 | MATCH: Fix infinite loop between `vec_cond(vec_cond(a,b,0), c, d)` and `a & b` | Andrew Pinski | 1 | -0/+5 |
| 2023-10-04 | match.pd: Avoid other build_nonstandard_integer_type calls [PR111369] | Jakub Jelinek | 1 | -17/+9 |
| 2023-10-04 | match.pd: Fix up a ? cst1 : cst2 regression on signed bool [PR111668] | Jakub Jelinek | 1 | -14/+31 |
| 2023-09-27 | Simplify abs (copysign (x, y)) | Richard Biener | 1 | -0/+5 |
| 2023-09-26 | MATCH: Simplify `(A ==/!= B) &/| (((cast)A) CMP C)` | Andrew Pinski | 1 | -30/+46 |
| 2023-09-26 | MATCH: Optimize COND_ADD reduction pattern | Juzhe-Zhong | 1 | -2/+5 |
| 2023-09-26 | MATCH: Optimize COND_ADD_LEN reduction pattern | Juzhe-Zhong | 1 | -0/+15 |
| 2023-09-24 | MATCH: Add `(X & ~Y) & Y` and `(X | ~Y) | Y` | Andrew Pinski | 1 | -0/+17 |
| 2023-09-21 | check undefine_p for one more vr | Jiufu Guo | 1 | -1/+1 |
| 2023-09-21 | using overflow_free_p to simplify pattern | Jiufu Guo | 1 | -30/+6 |
| 2023-09-20 | middle-end: use MAX_FIXED_MODE_SIZE instead of precidion of TImode/DImode | Jakub Jelinek | 1 | -3/+1 |
| 2023-09-19 | match.pd: Some build_nonstandard_integer_type tweaks | Jakub Jelinek | 1 | -42/+21 |
| 2023-09-18 | MATCH: Make zero_one_valued_p non-recursive fully | Andrew Pinski | 1 | -1/+4 |
| 2023-09-18 | MATCH: Avoid recursive zero_one_valued_p for conversions | Andrew Pinski | 1 | -1/+7 |
| 2023-09-18 | MATCH: Add simplifications of `(a == CST) & a` | Andrew Pinski | 1 | -0/+8 |
| 2023-09-18 | use local range for one more pattern in match.pd | Jiufu Guo | 1 | -2/+2 |
| 2023-09-15 | MATCH: Improve zero_one_valued_p for cases without range information | Andrew Pinski | 1 | -0/+10 |
| 2023-09-15 | MATCH: Fix `(1 >> X) != 0` pattern for vector types | Andrew Pinski | 1 | -2/+3 |
| 2023-09-14 | MATCH: Support `(a != (CST+1)) & (a > CST)` optimizations | Andrew Pinski | 1 | -2/+42 |
| 2023-09-13 | MATCH: Move `X <= MAX(X, Y)` before `MIN (X, C1) < C2` pattern | Andrew Pinski | 1 | -7/+8 |
| 2023-09-13 | MATCH: [PR111364] Add some more minmax cmp operand simplifications | Andrew Pinski | 1 | -3/+5 |
| 2023-09-13 | MATCH: Simplify `(X % Y) < Y` pattern. | Andrew Pinski | 1 | -6/+1 |
| 2023-09-13 | Checking undefined_p before using the vr | Jiufu Guo | 1 | -0/+3 |
| 2023-09-12 | MATCH: Simplify (a CMP1 b) ^ (a CMP2 b) | Andrew Pinski | 1 | -0/+20 |
| 2023-09-11 | MATCH: [PR111348] add missing :c to cmp in the `(a CMP b) ? minmax<a, c> : mi... | Andrew Pinski | 1 | -1/+1 |
