[PATCH][GCC] Complex division improvements in GCC

2019-08-29 Thread Elen Kalda
gt; _61 = -_74; _79 = _73; _80 = _61; [...] Best wishes, Elen gcc/ChangeLog: 2019-08-29 Elen Kalda * fold-const.c (fold_negate_const): Make the fold_negate_const function non-static (const_binop): Implement Baudin's algorithm for complex division * fold-const.h (f

[PATCH][GCC] Complex division improvements in Libgcc

2019-08-23 Thread Elen Kalda
of replacing the two divisions with multiplications, ended up in being in 1.0ulp. Maybe that is acceptable? - The improved algorithm reduces the number of bad fails from 2.3% to 0.5%. Is that a significant/useful improvement? Best wishes, Elen libgcc/ChangeLog: 2019-07-31  Elen Kalda  

[PATCH][AArch64] Make use of FADDP in simple reductions

2019-05-08 Thread Elen Kalda
, d1, d0 ret After patch: foo: faddp d0, v0.2d ret Bootstrapped and done regression tests on aarch64-none-linux-gnu - no issues found. Best wishes, Elen gcc/ChangeLog: 2019-04-24 Elen Kalda * config/aarch64/aarch64-simd.md (*aarch64_faddp): New. gcc