diff options
| author | Jan Hubicka <jh@suse.cz> | 2009-03-28 17:53:27 +0100 |
|---|---|---|
| committer | Jan Hubicka <hubicka@gcc.gnu.org> | 2009-03-28 16:53:27 +0000 |
| commit | 1de812a6cce2199fc81ae2fe074ebac1e0769174 (patch) | |
| tree | 4f27e6e257437e77d91e8b316c24259c9c2f8d8c | |
| parent | fbb789d49a45ad77c8af271a673f305401f2b134 (diff) | |
| download | gcc-1de812a6cce2199fc81ae2fe074ebac1e0769174.zip gcc-1de812a6cce2199fc81ae2fe074ebac1e0769174.tar.gz gcc-1de812a6cce2199fc81ae2fe074ebac1e0769174.tar.bz2 | |
tree-ssa-structalias.c (ipa_pta_execute): Fix bogus node->analyzed test introduced by my previous patch.
* tree-ssa-structalias.c (ipa_pta_execute): Fix bogus node->analyzed
test introduced by my previous patch.
From-SVN: r145194
| -rw-r--r-- | gcc/ChangeLog | 5 | ||||
| -rw-r--r-- | gcc/tree-ssa-structalias.c | 19 |
2 files changed, 13 insertions, 11 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 9cf73c2..aff4c85 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,8 @@ +2009-03-28 Jan Hubicka <jh@suse.cz> + + * tree-ssa-structalias.c (ipa_pta_execute): Fix bogus node->analyzed + test introduced by my previous patch. + 2009-03-28 Richard Guenther <rguenther@suse.de> * tree-ssa-copy.c (copy_prop_visit_phi_node): Do not leave diff --git a/gcc/tree-ssa-structalias.c b/gcc/tree-ssa-structalias.c index 92d68d20..1cb07f5 100644 --- a/gcc/tree-ssa-structalias.c +++ b/gcc/tree-ssa-structalias.c @@ -5669,18 +5669,15 @@ ipa_pta_execute (void) for (node = cgraph_nodes; node; node = node->next) { - if (!node->analyzed) - { - unsigned int varid; + unsigned int varid; - varid = create_function_info_for (node->decl, - cgraph_node_name (node)); - if (node->local.externally_visible) - { - varinfo_t fi = get_varinfo (varid); - for (; fi; fi = fi->next) - make_constraint_from (fi, anything_id); - } + varid = create_function_info_for (node->decl, + cgraph_node_name (node)); + if (node->local.externally_visible) + { + varinfo_t fi = get_varinfo (varid); + for (; fi; fi = fi->next) + make_constraint_from (fi, anything_id); } } for (node = cgraph_nodes; node; node = node->next) |