diff options
| author | Richard Biener <rguenther@suse.de> | 2014-06-17 13:15:53 +0000 |
|---|---|---|
| committer | Richard Biener <rguenth@gcc.gnu.org> | 2014-06-17 13:15:53 +0000 |
| commit | 75509ba24a8732f2da7fd118e7e85dab104ed3ff (patch) | |
| tree | 9ac9098188b835b6e26267572eddf69cab90d555 | |
| parent | e58b74ea3d6f27dc6e3f2022f12d1711a94f5a07 (diff) | |
| download | gcc-75509ba24a8732f2da7fd118e7e85dab104ed3ff.zip gcc-75509ba24a8732f2da7fd118e7e85dab104ed3ff.tar.gz gcc-75509ba24a8732f2da7fd118e7e85dab104ed3ff.tar.bz2 | |
genopinit.c (main): Use vec<>::qsort method.
2014-06-17 Richard Biener <rguenther@suse.de>
* genopinit.c (main): Use vec<>::qsort method.
* tree-ssa-loop-niter.c (discover_iteration_bound_by_body_walk):
Likewise.
* tree-vect-data-refs.c (vect_analyze_data_ref_accesses): Likewise.
From-SVN: r211738
| -rw-r--r-- | gcc/ChangeLog | 7 | ||||
| -rw-r--r-- | gcc/genopinit.c | 3 | ||||
| -rw-r--r-- | gcc/tree-ssa-loop-niter.c | 3 | ||||
| -rw-r--r-- | gcc/tree-vect-data-refs.c | 3 |
4 files changed, 10 insertions, 6 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 4f29609..2820759 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,10 @@ +2014-06-17 Richard Biener <rguenther@suse.de> + + * genopinit.c (main): Use vec<>::qsort method. + * tree-ssa-loop-niter.c (discover_iteration_bound_by_body_walk): + Likewise. + * tree-vect-data-refs.c (vect_analyze_data_ref_accesses): Likewise. + 2014-06-17 Matthew Fortune <matthew.fortune@imgtec.com> * config/mips/mips-protos.h (mips_expand_fcc_reload): Remove. diff --git a/gcc/genopinit.c b/gcc/genopinit.c index 77932ad..ef7f674 100644 --- a/gcc/genopinit.c +++ b/gcc/genopinit.c @@ -357,8 +357,7 @@ main (int argc, char **argv) } /* Sort the collected patterns. */ - qsort (patterns.address (), patterns.length (), - sizeof (pattern), pattern_cmp); + patterns.qsort (pattern_cmp); /* Now that we've handled the "extra" patterns, eliminate them from the optabs array. That way they don't get in the way below. */ diff --git a/gcc/tree-ssa-loop-niter.c b/gcc/tree-ssa-loop-niter.c index 73376bc..36d68a8 100644 --- a/gcc/tree-ssa-loop-niter.c +++ b/gcc/tree-ssa-loop-niter.c @@ -3144,8 +3144,7 @@ discover_iteration_bound_by_body_walk (struct loop *loop) fprintf (dump_file, " Trying to walk loop body to reduce the bound.\n"); /* Sort the bounds in decreasing order. */ - qsort (bounds.address (), bounds.length (), - sizeof (widest_int), wide_int_cmp); + bounds.qsort (wide_int_cmp); /* For every basic block record the lowest bound that is guaranteed to terminate the loop. */ diff --git a/gcc/tree-vect-data-refs.c b/gcc/tree-vect-data-refs.c index 1d40055..b2b629c 100644 --- a/gcc/tree-vect-data-refs.c +++ b/gcc/tree-vect-data-refs.c @@ -2508,8 +2508,7 @@ vect_analyze_data_ref_accesses (loop_vec_info loop_vinfo, bb_vec_info bb_vinfo) linear. Don't modify the original vector's order, it is needed for determining what dependencies are reversed. */ vec<data_reference_p> datarefs_copy = datarefs.copy (); - qsort (datarefs_copy.address (), datarefs_copy.length (), - sizeof (data_reference_p), dr_group_sort_cmp); + datarefs_copy.qsort (dr_group_sort_cmp); /* Build the interleaving chains. */ for (i = 0; i < datarefs_copy.length () - 1;) |