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
2021-03-13
match.pd: Don't optimize vector X + (X << C) -> X * (1 + (1 << C)) if there i...
Jakub Jelinek
1
-2
/
+8
2021-02-25
match.pd: Use :s for (T)(A) + CST -> (T)(A + CST) [PR95798]
Jakub Jelinek
1
-1
/
+1
2021-02-18
match.pd: Restrict clz cmp 0 replacement by single_use, PR99142
Hans-Peter Nilsson
1
-2
/
+2
2021-02-15
match.pd: Fix up A % (cast) (pow2cst << B) simplification [PR99079]
Jakub Jelinek
1
-6
/
+17
2021-01-22
match.pd: Replace incorrect simplifications into copysign [PR90248]
Jakub Jelinek
1
-30
/
+16
2021-01-20
Optimize combination of comparisons to dec+compare
Eugene Rozenfeld
1
-0
/
+14
2021-01-16
match.pd: Optimize ((cst << x) & 1) [PR96669]
Jakub Jelinek
1
-0
/
+7
2021-01-15
match.pd: Generalize the PR64309 simplifications [PR96669]
Jakub Jelinek
1
-4
/
+17
2021-01-15
match.pd: Optimize (x < 0) ^ (y < 0) to (x ^ y) < 0 etc. [PR96681]
Jakub Jelinek
1
-0
/
+18
2021-01-14
match.pd: Optimize ~(X >> Y) to ~X >> Y if ~X can be simplified [PR96688]
Jakub Jelinek
1
-0
/
+12
2021-01-13
match.pd: Fold (~X | C) ^ D into (X | C) ^ (~D ^ C) if (~D ^ C) can be simpli...
Jakub Jelinek
1
-1
/
+11
2021-01-13
tree-optimization/92645 - avoid harmful early BIT_FIELD_REF canonicalization
Richard Biener
1
-0
/
+2
2021-01-05
match.pd: Improve (A / (1 << B)) -> (A >> B) optimization [PR96930]
Jakub Jelinek
1
-2
/
+6
2021-01-04
match.pd: Fold x == ~x to false [PR96782]
Jakub Jelinek
1
-0
/
+7
2021-01-04
Update copyright years.
Jakub Jelinek
1
-1
/
+1
2020-12-31
match.pd: Add clz(X) == 0 -> (int)X < 0 etc. simpifications [PR94802]
Jakub Jelinek
1
-0
/
+33
2020-12-31
match.pd: Add (-(X < 0) | 1) * X -> abs (X) etc. simplifications [PR94785]
Jakub Jelinek
1
-0
/
+16
2020-12-15
match.pd: Optimize X / bool_range_Y to X [PR96094]
Jakub Jelinek
1
-4
/
+9
2020-12-12
match.pd: Add ~(X - Y) -> ~X + Y simplification [PR96685]
Jakub Jelinek
1
-0
/
+28
2020-12-06
match.pd: Improve conditional_replacement for x ? 0 : -1 [PR796232]
Jakub Jelinek
1
-0
/
+10
2020-12-01
Optimize max/min pattern with comparison
Eugene Rozenfeld
1
-0
/
+10
2020-11-30
Optimize or+and+or pattern to and+or
Eugene Rozenfeld
1
-0
/
+5
2020-11-27
tree-ssanames: Allow non-SSA_NAME arguments to get_range_info
Jakub Jelinek
1
-36
/
+24
2020-11-26
match.pd: Use ranges to optimize some x * y / y to x [PR97997]
Jakub Jelinek
1
-3
/
+42
2020-11-26
match.pd: Avoid ICE with shifts [PR97979]
Jakub Jelinek
1
-1
/
+2
2020-11-24
middle-end, c++: Treat shifts by negative as undefined [PR96929]
Jakub Jelinek
1
-2
/
+1
2020-11-18
Fix middle-end/85811: Introduce tree_expr_maybe_non_p et al.
Roger Sayle
1
-1
/
+19
2020-11-18
Optimize two patterns with three xors
Eugene Rozenfeld
1
-0
/
+10
2020-11-05
Improve overflow check
Jeff Law
1
-6
/
+10
2020-11-05
Simplify x >> x to 0. This fixes PR96701.
Eugene Rozenfeld
1
-0
/
+5
2020-10-19
[PATCH] fold x << (n % C) to x << (n & C-1) if C meets power2
guojiufu
1
-1
/
+11
2020-10-09
match.pd: Fix up FFS -> CTZ + 1 optimization [PR97325]
Jakub Jelinek
1
-1
/
+2
2020-09-30
[nvptx] Add type arg to TARGET_LIBC_HAS_FUNCTION
Tom de Vries
1
-3
/
+3
2020-09-24
tree-optimization/97085 - fold some trivial bool vector ?:
Richard Biener
1
-0
/
+11
2020-09-15
tree-optimization/94234 - add plusminus-with-convert pattern
Feng Xue
1
-0
/
+15
2020-09-15
tree-optimization/94234 - Fold plusminus_mult expr with multi-use operands
Feng Xue
1
-9
/
+13
2020-08-25
match.pd: Simplify copysign (x, -x) to -x [PR96715]
Jakub Jelinek
1
-0
/
+5
2020-08-19
tree-optimization/94234 - add pattern for ptr-diff on addresses with same offset
Feng Xue
1
-0
/
+3
2020-08-10
Simplify X * C1 == C2 with wrapping overflow
Marc Glisse
1
-2
/
+17
2020-08-07
Disable some VEC_COND_EXPR transformations after vector lowering
Marc Glisse
1
-9
/
+11
2020-08-05
VEC_COND_EXPR optimizations
Marc Glisse
1
-12
/
+58
2020-08-04
Simplify X * C1 == C2 with undefined overflow
Marc Glisse
1
-0
/
+14
2020-07-28
middle-end: Parity and popcount folding optimizations.
Roger Sayle
1
-13
/
+39
2020-07-01
match.pd: (x & y) - (x | y) - 1 -> ~(x ^ y) simplification [PR94882]
Jeff Law
1
-0
/
+29
2020-06-19
Fix PR94880: Failure to recognize andn pattern
Przemyslaw Wirkus
1
-0
/
+5
2020-06-09
match.pd: Optimize ffs comparisons against constants [PR95527]
Jakub Jelinek
1
-0
/
+48
2020-06-03
optimize tanh(x) / sinh (x) to 1/ cosh (x)
Vitor Guidi
1
-0
/
+5
2020-05-12
tree: Add vector_element_bits(_tree) [PR94980 1/3]
Richard Sandiford
1
-1
/
+1
2020-05-08
match.pd: A ^ ((A ^ B) & -(C cmp D)) -> (C cmp D) ? B : A simplification [PR9...
Jakub Jelinek
1
-0
/
+12
2020-05-08
match.pd: Canonicalize (X + (X >> (prec - 1))) ^ (X >> (prec - 1)) to abs (X)...
Jakub Jelinek
1
-0
/
+9
[next]