index
:
riscv-gnu-toolchain/gcc.git
devel/analyzer
devel/autopar_devel
devel/autopar_europar_2021
devel/bypass-asm
devel/c++-contracts
devel/c++-coroutines
devel/c++-modules
devel/c++-name-lookup
devel/coarray_native
devel/fortran_unsigned
devel/gccgo
devel/gfortran-caf
devel/gimple-linterchange
devel/gomp-5_0-branch
devel/icpp2021
devel/ira-select
devel/ix86/evex512
devel/jlaw/crc
devel/loop-unswitch-support-switches
devel/lto-offload
devel/m2link
devel/modula-2
devel/mold-lto-plugin
devel/mold-lto-plugin-v2
devel/nothrow-detection
devel/omp/gcc-10
devel/omp/gcc-11
devel/omp/gcc-12
devel/omp/gcc-13
devel/omp/gcc-14
devel/omp/gcc-9
devel/omp/ompd
devel/power-ieee128
devel/range-gen3
devel/ranger
devel/rust/master
devel/sh-lra
devel/sphinx
devel/ssa-range
devel/subreg-coalesce
devel/unified-autovect
master
releases/egcs-1.0
releases/egcs-1.1
releases/gcc-10
releases/gcc-11
releases/gcc-12
releases/gcc-13
releases/gcc-14
releases/gcc-2.95
releases/gcc-2.95.2.1-branch
releases/gcc-3.0
releases/gcc-3.1
releases/gcc-3.2
releases/gcc-3.3
releases/gcc-3.4
releases/gcc-4.0
releases/gcc-4.1
releases/gcc-4.2
releases/gcc-4.3
releases/gcc-4.4
releases/gcc-4.5
releases/gcc-4.6
releases/gcc-4.7
releases/gcc-4.8
releases/gcc-4.9
releases/gcc-5
releases/gcc-6
releases/gcc-7
releases/gcc-8
releases/gcc-9
releases/libgcj-2.95
trunk
Unnamed repository; edit this file 'description' to name the repository.
root
about
summary
refs
log
tree
commit
diff
log msg
author
committer
range
path:
root
/
gcc
/
match.pd
Age
Commit message (
Expand
)
Author
Files
Lines
2024-05-29
match: Add support for `a ^ CST` to bitwise_inverted_equal_p [PR115224]
Andrew Pinski
1
-0
/
+4
2024-05-29
Match: Add maybe_bit_not instead of plain matching
Andrew Pinski
1
-4
/
+10
2024-05-24
MATCH: Look through VIEW_CONVERT when folding VEC_PERM_EXPRs.
Manolis Tsamis
1
-6
/
+8
2024-05-23
Match: Add overloaded types_match to avoid code dup [NFC]
Pan Li
1
-20
/
+10
2024-05-21
match: Disable `(type)zero_one_valuep*CST` for 1bit signed types [PR115154]
Andrew Pinski
1
-2
/
+4
2024-05-16
Internal-fn: Support new IFN SAT_ADD for unsigned scalar int
Pan Li
1
-0
/
+51
2024-05-08
match: `a CMP nonnegative ? a : ABS<a>` simplified to just `ABS<a>` [PR112392]
Andrew Pinski
1
-0
/
+15
2024-05-07
MATCH: Add some more value_replacement simplifications (a != 0 ? expr : 0) to...
Andrew Pinski
1
-0
/
+18
2024-04-12
match: Fix `!a?b:c` and `a?~t:t` patterns for signed 1 bit types [PR114666]
Andrew Pinski
1
-1
/
+5
2024-03-15
match.pd: Only merge truncation with conversion for -fno-signed-zeros
Joe Ramsay
1
-0
/
+1
2024-03-07
match.pd: Optimize a * !a to 0 [PR114009]
Jakub Jelinek
1
-0
/
+11
2024-03-01
middle-end/114070 - VEC_COND_EXPR folding
Richard Biener
1
-3
/
+15
2024-02-26
match.pd: Guard 2 simplifications on integral TYPE_OVERFLOW_UNDEFINED [PR114090]
Jakub Jelinek
1
-4
/
+6
2024-02-26
middle-end/114070 - folding breaking VEC_COND expansion
Richard Biener
1
-3
/
+12
2024-02-19
match.pd: Fix ICE on BIT_INSERT_EXPR of BIT_FIELD_REF folding [PR113967]
Jakub Jelinek
1
-1
/
+3
2024-01-31
match: Fix vcond into conditional op folding [PR113607].
Robin Dapp
1
-4
/
+4
2024-01-31
middle-end/110176 - wrong zext (bool) <= (int) 4294967295u folding
Richard Biener
1
-6
/
+6
2024-01-12
middle-end/113344 - is_truth_type_for vs GENERIC tcc_comparison
Richard Biener
1
-1
/
+1
2024-01-11
match: Delay folding of 1/x into `(x+1u)<2u?x:0` until late [PR113301]
Andrew Pinski
1
-5
/
+7
2024-01-11
tree-optimization/113126 - vector extension compare optimization
Richard Biener
1
-4
/
+5
2024-01-11
Optimize A < B ? A : B to MIN_EXPR.
liuhongt
1
-0
/
+21
2024-01-10
middle-end: Don't apply copysign optimization if target does not implement op...
Tamar Christina
1
-5
/
+17
2024-01-04
Match: Improve inverted_equal_p for bool and `^` and `==` [PR113186]
Andrew Pinski
1
-0
/
+6
2024-01-03
Update copyright years.
Jakub Jelinek
1
-1
/
+1
2023-12-24
match: Improve `(a != b) ? (a + b) : (2 * a)` pattern [PR19832]
Andrew Pinski
1
-1
/
+1
2023-12-15
match.pd: Optimize sign-extension followed by truncation [PR113024]
Jakub Jelinek
1
-2
/
+5
2023-12-14
match.pd: Simplify (t * u) / (t * v) [PR112994]
Jakub Jelinek
1
-1
/
+17
2023-12-14
match.pd: Simplify (t * u) / v -> t * (u / v) [PR112994]
Jakub Jelinek
1
-3
/
+19
2023-12-13
tree-optimization/112990 - unsupported VEC_PERM from match pattern
Richard Biener
1
-0
/
+2
2023-12-11
MATCH: (convert)(zero_one !=/== 0/1) for outer type and zero_one type are the...
Andrew Pinski
1
-0
/
+16
2023-12-11
Simplify vector ((VCE (a cmp b ? -1 : 0)) < 0) ? c : d to just (VCE ((a cmp b...
liuhongt
1
-0
/
+22
2023-12-04
MATCH: Fix zero_one_valued_p's convert pattern
Andrew Pinski
1
-0
/
+3
2023-11-28
MATCH: Fix invalid signed boolean type usage
Andrew Pinski
1
-2
/
+6
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
[next]