OpenE2K/gcc
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

re PR tree-optimization/19097 (Quadratic behavior with many sets for the same register in VRP)

Browse Source 
2005-10-31  Andrew MacLeod  <amacleod@redhat.com>
	
	PR tree-optimization/19097
	* tree-ssa-operands.c (correct_use_link): Don't look for modified stmts.

From-SVN: r106272
This commit is contained in:
Andrew MacLeod 2005-10-31 13:38:05 +00:00 committed by Andrew Macleod
parent cd7ec127de
commit a56b5394f0
2 changed files with 9 additions and 19 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
gcc/ChangeLog
View File

@ -1,3 +1,8 @@
2005-10-31 Andrew MacLeod <amacleod@redhat.com>
PR tree-optimization/19097
* tree-ssa-operands.c (correct_use_link): Don't look for modified stmts.
2005-10-31 J"orn Rennecke <joern.rennecke@st.com>
* optabs.c (expand_unop): Take TRULY_NOOP_TRUNCATION into account.

23
gcc/tree-ssa-operands.c
View File

@ -311,27 +311,12 @@ correct_use_link (use_operand_p ptr, tree stmt)
prev = ptr->prev;
if (prev)
{
bool stmt_mod = true;
/* Find the first element which isn't a SAFE iterator, is in a different
stmt, and is not a modified stmt. That node is in the correct list,
see if we are too. */
while (stmt_mod)
{
while (prev->stmt == stmt || prev->stmt == NULL)
prev = prev->prev;
if (prev->use == NULL)
stmt_mod = false;
else
if ((stmt_mod = stmt_modified_p (prev->stmt)))
prev = prev->prev;
}
/* Find the root element, making sure we skip any safe iterators. */
while (prev->use != NULL || prev->stmt == NULL)
prev = prev->prev;
/* Get the ssa_name of the list the node is in. */
if (prev->use == NULL)
root = prev->stmt;
else
root = *(prev->use);
root = prev->stmt;
/* If it's the right list, simply return. */
if (root == *(ptr->use))
return;