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

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index 4f29609c82264d18d534464ebd519912d6d82cca..2820759a2808adb9c8b44ca17efdd0e81483ace6 100644 (file)
--- 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 77932ad3545bf8c65201639e04724518888a0a11..ef7f674d09b21503a62a5621d30b66b11f474ebf 100644 (file)
--- 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 73376bc8e75b33ff515edc6b17efb9563ddf784a..36d68a884bb412a3a4d84375cf52ccb2b962e417 100644 (file)
--- 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 1d40055bf9876bf145692c1f299436e16513f00a..b2b629c03c666052877fd0e52a44f9cf105f7e65 100644 (file)
--- 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;)