Commit 80e66af3 by Uros Bizjak

re PR target/78794 (We noticed ~9% regression in 32-bit mode for 462.libquntum…

re PR target/78794 (We noticed ~9% regression in 32-bit mode for 462.libquntum on Avoton after r243202)

	PR target/78794
	* config/i386/i386.c (dimode_scalar_chain::compute_convert_gain):
	Calculate additional gain for andnot for targets without BMI.

testsuite/ChangeLog:

	PR target/78794
	* gcc.target/i386/pr78794.c: New test.

From-SVN: r243615
parent 6479f45b
2016-12-13 Uros Bizjak <ubizjak@gmail.com>
PR target/78794
* config/i386/i386.c (dimode_scalar_chain::compute_convert_gain):
Calculate additional gain for andnot for targets without BMI.
2016-12-13 Carl Love <cel@us.ibm.com> 2016-12-13 Carl Love <cel@us.ibm.com>
* config/rs6000/rs6000-c.c: Add built-in support for * config/rs6000/rs6000-c.c: Add built-in support for
...@@ -21,11 +27,9 @@ ...@@ -21,11 +27,9 @@
2016-12-13 Martin Liska <mliska@suse.cz> 2016-12-13 Martin Liska <mliska@suse.cz>
PR tree-optimization/78428 PR tree-optimization/78428
* expr.c (store_constructor_field): Add new arguments to the * expr.c (store_constructor_field): Add new arguments to the function.
function. (store_constructor): Set up bitregion_end and add gcc_unreachable to
(store_constructor): Set up bitregion_end and add fields that have either non-constant size or (and) offset.
gcc_unreachable to fields that have either non-constant size
or (and) offset.
2016-12-13 Marek Polacek <polacek@redhat.com> 2016-12-13 Marek Polacek <polacek@redhat.com>
...@@ -3419,6 +3419,11 @@ dimode_scalar_chain::compute_convert_gain () ...@@ -3419,6 +3419,11 @@ dimode_scalar_chain::compute_convert_gain ()
|| GET_CODE (src) == AND) || GET_CODE (src) == AND)
{ {
gain += ix86_cost->add; gain += ix86_cost->add;
/* Additional gain for andnot for targets without BMI. */
if (GET_CODE (XEXP (src, 0)) == NOT
&& !TARGET_BMI)
gain += 2 * ix86_cost->add;
if (CONST_INT_P (XEXP (src, 0))) if (CONST_INT_P (XEXP (src, 0)))
gain -= vector_const_cost (XEXP (src, 0)); gain -= vector_const_cost (XEXP (src, 0));
if (CONST_INT_P (XEXP (src, 1))) if (CONST_INT_P (XEXP (src, 1)))
...@@ -3431,7 +3436,7 @@ dimode_scalar_chain::compute_convert_gain () ...@@ -3431,7 +3436,7 @@ dimode_scalar_chain::compute_convert_gain ()
{ {
/* Assume comparison cost is the same. */ /* Assume comparison cost is the same. */
} }
else if (GET_CODE (src) == CONST_INT) else if (CONST_INT_P (src))
{ {
if (REG_P (dst)) if (REG_P (dst))
gain += COSTS_N_INSNS (2); gain += COSTS_N_INSNS (2);
2016-12-13 Uros Bizjak <ubizjak@gmail.com>
PR target/78794
* gcc.target/i386/pr78794.c: New test.
2016-12-13 Andre Vehreschild <vehre@gcc.gnu.org> 2016-12-13 Andre Vehreschild <vehre@gcc.gnu.org>
PR fortran/77785 PR fortran/77785
......
/* PR target/pr78794 */
/* { dg-do compile { target { ia32 } } } */
/* { dg-options "-O2 -march=slm -mno-bmi -mno-stackrealign" } */
/* { dg-final { scan-assembler "pandn" } } */
typedef unsigned long long ull;
struct S1
{
float x;
ull y;
};
struct S2
{
int a1;
struct S1 *node;
int *a2;
};
void
foo(int c1, int c2, int c3, struct S2 *reg)
{
int i;
for(i=0; i<reg->a1; i++)
if(reg->node[i].y & ((ull) 1 << c1))
{
if(reg->node[i].y & ((ull) 1 << c2))
reg->node[i].y ^= ((ull) 1 << c3);
}
}
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment