diff options
| author | Jakub Jelinek <jakub@redhat.com> | 2013-02-27 23:06:21 +0100 |
|---|---|---|
| committer | Jakub Jelinek <jakub@gcc.gnu.org> | 2013-02-27 23:06:21 +0100 |
| commit | 3f292312f2ddd6eba99c2d9ee8c73b130fdcbdb9 (patch) | |
| tree | 74d97d7816e08aa7dc6e5976582211a2d97d5999 | |
| parent | a344216b4b79c020f11c55ac718d6c5eec4c7d05 (diff) | |
| download | gcc-3f292312f2ddd6eba99c2d9ee8c73b130fdcbdb9.zip gcc-3f292312f2ddd6eba99c2d9ee8c73b130fdcbdb9.tar.gz gcc-3f292312f2ddd6eba99c2d9ee8c73b130fdcbdb9.tar.bz2 | |
re PR middle-end/56461 (GCC is leaking lots of memory)
PR middle-end/56461
* tree-vect-data-refs.c (vect_permute_load_chain): Avoid using copy
method on dr_chain and result_chain.
From-SVN: r196325
| -rw-r--r-- | gcc/ChangeLog | 4 | ||||
| -rw-r--r-- | gcc/tree-vect-data-refs.c | 7 |
2 files changed, 9 insertions, 2 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 7cc49fa..08fd6b8 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,6 +1,10 @@ 2013-02-27 Jakub Jelinek <jakub@redhat.com> PR middle-end/56461 + * tree-vect-data-refs.c (vect_permute_load_chain): Avoid using copy + method on dr_chain and result_chain. + + PR middle-end/56461 * tree-ssa-loop-niter.c (maybe_lower_iteration_bound): Call pointer_set_destroy on not_executed_last_iteration. diff --git a/gcc/tree-vect-data-refs.c b/gcc/tree-vect-data-refs.c index 74d8c3a..bf5a7b7 100644 --- a/gcc/tree-vect-data-refs.c +++ b/gcc/tree-vect-data-refs.c @@ -4673,7 +4673,9 @@ vect_permute_load_chain (vec<tree> dr_chain, unsigned nelt = TYPE_VECTOR_SUBPARTS (vectype); unsigned char *sel = XALLOCAVEC (unsigned char, nelt); - *result_chain = dr_chain.copy (); + result_chain->quick_grow (length); + memcpy (result_chain->address (), dr_chain.address (), + length * sizeof (tree)); for (i = 0; i < nelt; ++i) sel[i] = i * 2; @@ -4708,7 +4710,8 @@ vect_permute_load_chain (vec<tree> dr_chain, vect_finish_stmt_generation (stmt, perm_stmt, gsi); (*result_chain)[j/2+length/2] = data_ref; } - dr_chain = result_chain->copy (); + memcpy (dr_chain.address (), result_chain->address (), + length * sizeof (tree)); } } |