| Age | Commit message (Expand) | Author | Files | Lines |
|---|
| 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 |
| 2023-09-11 | MATCH: [PR111349] add missing :c to cmp in the `(a CMP CST1) ? max<a,CST2> : ... | Andrew Pinski | 1 | -1/+1 |
| 2023-09-10 | MATCH: [PR111346] `X CMP MINMAX` pattern missing :c on CMP | Andrew Pinski | 1 | -1/+1 |
| 2023-09-10 | Fix PR 111331: wrong code for `a > 28 ? MIN<a, 28> : 29` | Andrew Pinski | 1 | -2/+2 |
| 2023-09-06 | Middle-end _BitInt support [PR102989] | Jakub Jelinek | 1 | -0/+1 |
| 2023-09-05 | MATCH: Add `(x | c) & ~(y | c)` and `x & ~(y | x)` patterns [PR98710] | Andrew Pinski | 1 | -1/+13 |
| 2023-09-05 | MATCH: Add pattern for `(x | y) & (x & z)` | Andrew Pinski | 1 | -1/+6 |
| 2023-09-05 | MATCH: `(nop_convert)-(convert)a` into -(convert)a if we are converting from ... | Andrew Pinski | 1 | -0/+11 |
| 2023-09-05 | MATCH: Add `~MAX(~X, Y)` pattern: [PR96694] | Andrew Pinski | 1 | -1/+6 |
| 2023-09-05 | MATCH: Transform `(1 >> X) !=/== 0` into `X ==/!= 0` | Andrew Pinski | 1 | -2/+8 |
| 2023-09-04 | Optimize '(X - N * M) / N' to 'X / N - M' if valid | Jiufu Guo | 1 | -0/+80 |
| 2023-08-31 | MATCH [PR19832]: Optimize some `(a != b) ? a OP b : c` | Andrew Pinski | 1 | -0/+31 |
| 2023-08-31 | MATCH: extend min_value/max_value match to vectors | Andrew Pinski | 1 | -8/+16 |
| 2023-08-30 | tree-optimization/111228 - combine two VEC_PERM_EXPRs | Richard Biener | 1 | -3/+138 |
| 2023-08-29 | MATCH: Move `(x | y) & (~x ^ y)` over to use bitwise_inverted_equal_p | Andrew Pinski | 1 | -2/+5 |
| 2023-08-28 | MATCH: Move `(X & ~Y) | (~X & Y)` over to use bitwise_inverted_equal_p | Andrew Pinski | 1 | -6/+7 |
| 2023-08-28 | MATCH: Remove redundant pattern for `(x | y) & ~x` | Andrew Pinski | 1 | -8/+0 |
| 2023-08-25 | MATCH: Move `a ? one_zero : one_zero` matching after min/max matching | Andrew Pinski | 1 | -18/+24 |
| 2023-08-25 | MATCH: `a | C -> C` when we know that `a & ~C == 0` | Andrew Pinski | 1 | -0/+6 |
