diff options
| author | rakdver <rakdver@138bc75d-0d04-0410-961f-82ee72b054a4> | 2007-04-20 23:27:51 +0000 |
|---|---|---|
| committer | rakdver <rakdver@138bc75d-0d04-0410-961f-82ee72b054a4> | 2007-04-20 23:27:51 +0000 |
| commit | cf95b243ed08fc93753ebe93d3180beb425fe612 (patch) | |
| tree | d623c3e0edf0b41cc30438c3c56f693f5223673f | |
| parent | 1363472363d63ef94bcb6d6bedd2aacdaf81b305 (diff) | |
| download | ppe42-gcc-cf95b243ed08fc93753ebe93d3180beb425fe612.tar.gz ppe42-gcc-cf95b243ed08fc93753ebe93d3180beb425fe612.zip | |
* tree-ssa-structalias.c (delete_points_to_sets): Free graph->complex.
* tree-ssa-operands.c (finalize_ssa_vuse_ops): Free new_ops.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@124012 138bc75d-0d04-0410-961f-82ee72b054a4
| -rw-r--r-- | gcc/ChangeLog | 5 | ||||
| -rw-r--r-- | gcc/tree-ssa-operands.c | 1 | ||||
| -rw-r--r-- | gcc/tree-ssa-structalias.c | 1 |
3 files changed, 7 insertions, 0 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 37f2c887038..dc2ed316e95 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,8 @@ +2007-04-21 Zdenek Dvorak <dvorakz@suse.cz> + + * tree-ssa-structalias.c (delete_points_to_sets): Free graph->complex. + * tree-ssa-operands.c (finalize_ssa_vuse_ops): Free new_ops. + 2007-04-20 Daniel Jacobowitz <dan@codesourcery.com> * config/rs6000/sysv4.h (STARTFILE_DEFAULT_SPEC): Include diff --git a/gcc/tree-ssa-operands.c b/gcc/tree-ssa-operands.c index 28464f939fc..7ced6a8997c 100644 --- a/gcc/tree-ssa-operands.c +++ b/gcc/tree-ssa-operands.c @@ -1072,6 +1072,7 @@ finalize_ssa_vuse_ops (tree stmt) SET_USE (VUSE_OP_PTR (last, (int) i), op); VUSE_OPS (stmt) = last; + VEC_free (tree, heap, new_ops); } #ifdef ENABLE_CHECKING diff --git a/gcc/tree-ssa-structalias.c b/gcc/tree-ssa-structalias.c index 6fda265797e..5c49b525ef3 100644 --- a/gcc/tree-ssa-structalias.c +++ b/gcc/tree-ssa-structalias.c @@ -4877,6 +4877,7 @@ delete_points_to_sets (void) for (i = 0; VEC_iterate (varinfo_t, varmap, i, v); i++) VEC_free (constraint_t, heap, graph->complex[i]); + free (graph->complex); free (graph->rep); free (graph->succs); |
